/netbsd-6-1-5-RELEASE/external/bsd/openldap/dist/servers/slapd/back-perl/ |
H A D | SampleLDAP.pm | 57 for my $dn ( keys %{$this} ) { 58 if ( $this->{$dn} =~ /$filterStr/imx ) { 59 push @match_dn, $dn; 67 for my $dn (@match_dn) { 68 push @match_entries, $this->{$dn}; 77 my ( $dn, $avaStr ) = @_; 82 if ( $this->{$dn} =~ /$avaStr/im ) { 92 my ( $dn, @list ) = @_; 100 $this->{$dn} .= "$key: $value\n"; 104 $this->{$dn} [all...] |
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/mpn/generic/ |
H A D | sbpi1_div_qr.c | 35 mp_srcptr dp, mp_size_t dn, 45 ASSERT (dn > 2); 46 ASSERT (nn >= dn); 47 ASSERT ((dp[dn-1] & GMP_NUMB_HIGHBIT) != 0); 51 qh = mpn_cmp (np - dn, dp, dn) >= 0; 53 mpn_sub_n (np - dn, np - dn, dp, dn); 55 qp += nn - dn; 33 mpn_sbpi1_div_qr(mp_ptr qp, mp_ptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) argument [all...] |
H A D | dcpi1_divappr_q.c | 76 mp_srcptr dp, mp_size_t dn, gmp_pi1_t *dinv) 85 ASSERT (dn >= 6); 86 ASSERT (nn > dn); 87 ASSERT (dp[dn-1] & GMP_NUMB_HIGHBIT); 89 qn = nn - dn; 92 dp += dn; 94 if (qn >= dn) 97 /* Reduce qn mod dn without division, optimizing small operations. */ 99 qn -= dn; 100 while (qn > dn); 75 mpn_dcpi1_divappr_q(mp_ptr qp, mp_ptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, gmp_pi1_t *dinv) argument [all...] |
H A D | sbpi1_bdiv_qr.c | 31 /* Computes a binary quotient of size qn = nn - dn. 38 Stores the dn least significant limbs of R at {np + nn - dn, dn}, 46 mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) 53 ASSERT (dn > 0); 54 ASSERT (nn > dn); 57 qn = nn - dn; 63 while (qn > dn) 65 for (i = 0; i < dn; 44 mpn_sbpi1_bdiv_qr(mp_ptr qp, mp_ptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) argument [all...] |
H A D | sbpi1_divappr_q.c | 36 mp_srcptr dp, mp_size_t dn, 47 ASSERT (dn > 2); 48 ASSERT (nn >= dn); 49 ASSERT ((dp[dn-1] & GMP_NUMB_HIGHBIT) != 0); 53 qn = nn - dn; 54 if (qn + 1 < dn) 56 dp += dn - (qn + 1); 57 dn = qn + 1; 60 qh = mpn_cmp (np - dn, dp, dn) > 34 mpn_sbpi1_divappr_q(mp_ptr qp, mp_ptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) argument [all...] |
H A D | divis.c | 29 /* Determine whether {ap,an} is divisible by {dp,dn}. Must have both 52 mp_srcptr dp, mp_size_t dn) 63 ASSERT (dn >= 1); 64 ASSERT (dp[dn-1] != 0); 66 ASSERT_MPN (dp, dn); 70 if (an < dn) 87 dn--; ASSERT (dn >= 1); 97 if (dn == 1) 107 if (dn 51 mpn_divisible_p(mp_srcptr ap, mp_size_t an, mp_srcptr dp, mp_size_t dn) argument [all...] |
H A D | bdiv_q.c | 35 mp_srcptr dp, mp_size_t dn, 40 if (BELOW_THRESHOLD (dn, DC_BDIV_Q_THRESHOLD)) 44 mpn_sbpi1_bdiv_q (qp, tp, nn, dp, dn, di); 46 else if (BELOW_THRESHOLD (dn, MU_BDIV_Q_THRESHOLD)) 50 mpn_dcpi1_bdiv_q (qp, tp, nn, dp, dn, di); 54 mpn_mu_bdiv_q (qp, np, nn, dp, dn, tp); 60 mpn_bdiv_q_itch (mp_size_t nn, mp_size_t dn) argument 62 if (BELOW_THRESHOLD (dn, MU_BDIV_Q_THRESHOLD)) 65 return mpn_mu_bdiv_q_itch (nn, dn); 33 mpn_bdiv_q(mp_ptr qp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr tp) argument
|
H A D | mu_div_q.c | 41 complex qn>=dn arm would be to allocate a temporary nn+1 limb buffer, then 63 mp_srcptr dp, mp_size_t dn, 73 qn = nn - dn; 77 if (qn >= dn) /* nn >= 2*dn + 1 */ 81 if (dn != qn) 85 in1 = mpn_mu_div_qr_choose_in (qn - dn, dn, 0); 86 in2 = mpn_mu_divappr_q_choose_in (dn + 1, dn, 61 mpn_mu_div_q(mp_ptr qp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr scratch) argument 206 mpn_mu_div_q_itch(mp_size_t nn, mp_size_t dn, int mua_k) argument [all...] |
H A D | bdiv_qr.c | 37 mp_srcptr dp, mp_size_t dn, 43 if (BELOW_THRESHOLD (dn, DC_BDIV_QR_THRESHOLD) || 44 BELOW_THRESHOLD (nn - dn, DC_BDIV_QR_THRESHOLD)) 48 rh = mpn_sbpi1_bdiv_qr (qp, tp, nn, dp, dn, di); 49 MPN_COPY (rp, tp + nn - dn, dn); 51 else if (BELOW_THRESHOLD (dn, MU_BDIV_QR_THRESHOLD)) 55 rh = mpn_dcpi1_bdiv_qr (qp, tp, nn, dp, dn, di); 56 MPN_COPY (rp, tp + nn - dn, dn); 35 mpn_bdiv_qr(mp_ptr qp, mp_ptr rp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr tp) argument 67 mpn_bdiv_qr_itch(mp_size_t nn, mp_size_t dn) argument [all...] |
H A D | mu_divappr_q.c | 3 Compute Q = floor(N / D) + e. N is nn limbs, D is dn limbs and must be 4 normalized, and Q must be nn-dn limbs, 0 <= e <= 4. The requirement that Q 5 is nn-dn limbs (and not nn-dn+1 limbs) was put in place in order to allow us 69 mp_size_t dn, 76 ASSERT (dn > 1); 78 qn = nn - dn; 81 if (qn + 1 < dn) 83 np += dn - (qn + 1); 84 nn -= dn 65 mpn_mu_divappr_q(mp_ptr qp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr scratch) argument 149 mpn_preinv_mu_divappr_q(mp_ptr qp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_srcptr ip, mp_size_t in, mp_ptr scratch) argument 305 mpn_mu_divappr_q_choose_in(mp_size_t qn, mp_size_t dn, int k) argument 338 mpn_mu_divappr_q_itch(mp_size_t nn, mp_size_t dn, int mua_k) argument [all...] |
H A D | dcpi1_div_qr.c | 82 mp_srcptr dp, mp_size_t dn, 92 ASSERT (dn >= 6); /* to adhere to mpn_sbpi1_div_qr's limits */ 93 ASSERT (nn - dn >= 3); /* to adhere to mpn_sbpi1_div_qr's limits */ 94 ASSERT (dp[dn-1] & GMP_NUMB_HIGHBIT); 96 tp = TMP_SALLOC_LIMBS (dn); 98 qn = nn - dn; 101 dp += dn; 103 if (qn > dn) 105 /* Reduce qn mod dn without division, optimizing small operations. */ 107 qn -= dn; 80 mpn_dcpi1_div_qr(mp_ptr qp, mp_ptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, gmp_pi1_t *dinv) argument [all...] |
H A D | sbpi1_div_q.c | 35 mp_srcptr dp, mp_size_t dn, 46 mp_size_t dn_orig = dn; 50 ASSERT (dn > 2); 51 ASSERT (nn >= dn); 52 ASSERT ((dp[dn-1] & GMP_NUMB_HIGHBIT) != 0); 56 qn = nn - dn; 57 if (qn + 1 < dn) 59 dp += dn - (qn + 1); 60 dn = qn + 1; 63 qh = mpn_cmp (np - dn, d 33 mpn_sbpi1_div_q(mp_ptr qp, mp_ptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) argument [all...] |
H A D | sbpi1_bdiv_q.c | 52 mp_srcptr dp, mp_size_t dn, 58 ASSERT (dn > 0); 59 ASSERT (nn >= dn); 62 for (i = nn - dn; i > 0; i--) 67 cy = mpn_addmul_1 (np, dp, dn, q); 68 mpn_add_1 (np + dn, np + dn, i, cy); 73 for (i = dn; i > 1; i--) 50 mpn_sbpi1_bdiv_q(mp_ptr qp, mp_ptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) argument
|
H A D | divrem.c | 30 mp_srcptr dp, mp_size_t dn) 33 ASSERT (nn >= dn); 34 ASSERT (dn >= 1); 35 ASSERT (dp[dn-1] & GMP_NUMB_HIGHBIT); 36 ASSERT (! MPN_OVERLAP_P (np, nn, dp, dn)); 37 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, np, nn) || qp==np+dn+qxn); 38 ASSERT (! MPN_OVERLAP_P (qp, nn-dn+qxn, dp, dn)); 40 ASSERT_MPN (dp, dn); 28 mpn_divrem(mp_ptr qp, mp_size_t qxn, mp_ptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn) argument [all...] |
H A D | mu_bdiv_qr.c | 1 /* mpn_mu_bdiv_qr(qp,rp,np,nn,dp,dn,tp) -- Compute {np,nn} / {dp,dn} mod B^qn, 2 where qn = nn-dn, storing the result in {qp,qn}. Overlap allowed between Q 41 D = {dp,dn} 46 dn >= 2 48 scratch space as determined by mpn_mu_bdiv_qr_itch(nn,dn). 50 Write quotient to Q = {qp,nn-dn}. 54 FIXME: Trim allocation for (qn > dn) case, 3*dn might be possible. In 55 particular, when dn 58 mpn_mu_bdiv_qr(mp_ptr qp, mp_ptr rp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr scratch) argument 238 mpn_mu_bdiv_qr_itch(mp_size_t nn, mp_size_t dn) argument [all...] |
H A D | dcpi1_bdiv_q.c | 78 D = {dp,dn} 84 mp_srcptr dp, mp_size_t dn, 94 ASSERT (dn >= 2); 95 ASSERT (nn - dn >= 0); 98 tp = TMP_SALLOC_LIMBS (dn); 102 if (qn > dn) 104 /* Reduce qn mod dn in a super-efficient manner. */ 106 qn -= dn; 107 while (qn > dn); 115 if (qn != dn) 82 mpn_dcpi1_bdiv_q(mp_ptr qp, mp_ptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) argument [all...] |
H A D | mu_div_qr.c | 3 Compute Q = floor(N / D) and R = N-QD. N is nn limbs and D is dn limbs and 4 must be normalized, and Q must be nn-dn limbs. The requirement that Q is 5 nn-dn limbs (and not nn-dn+1 limbs) was put in place in order to allow us to 70 really make sense? It seem like the quotient between dn and qn might be 91 mp_size_t dn, 97 qn = nn - dn; 98 if (qn + MU_DIV_QR_SKEW_THRESHOLD < dn) 101 |_______|_ign_first__| divisor dn 105 |___________________| quotient * ignored-divisor-part dn 86 mpn_mu_div_qr(mp_ptr qp, mp_ptr rp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr scratch) argument 147 mpn_mu_div_qr2(mp_ptr qp, mp_ptr rp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr scratch) argument 223 mpn_preinv_mu_div_qr(mp_ptr qp, mp_ptr rp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_srcptr ip, mp_size_t in, mp_ptr scratch) argument 356 mpn_mu_div_qr_choose_in(mp_size_t qn, mp_size_t dn, int k) argument 389 mpn_mu_div_qr_itch(mp_size_t nn, mp_size_t dn, int mua_k) argument 399 mpn_preinv_mu_div_qr_itch(mp_size_t nn, mp_size_t dn, mp_size_t in) argument [all...] |
/netbsd-6-1-5-RELEASE/external/bsd/openldap/dist/tests/data/ |
H A D | slapd-acl.conf | 29 access to dn.exact="" attrs=objectClass 56 #access to attrs=objectclass dn.subtree="dc=example,dc=com" 58 by dn.exact="cn=Bjorn Jensen,ou=Information Technology Division,ou=People,dc=example,dc=com" add 61 #access to filter="(objectclass=person)" attrs=userpassword dn.subtree="dc=example,dc=com" 66 access to dn.exact="cn=Mark Elliot,ou=Alumni Association,ou=People,dc=example,dc=com" 68 by dn="cn=Barbara Jensen,ou=Information Technology Division,ou=People,dc=example,dc=com" read 71 access to dn.exact="cn=Mark Elliot,ou=Alumni Association,ou=People,dc=example,dc=com" 73 by dn="cn=Bjorn Jensen,ou=Information Technology Division,ou=People,dc=example,dc=com" read 76 access to dn.exact="cn=Mark Elliot,ou=Alumni Association,ou=People,dc=example,dc=com" 80 access to dn [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/libdecnumber/ |
H A D | decLibrary.c | 43 decNumber dn; local 47 decimal32ToNumber (&d32, &dn); 48 return (decNumberIsInfinite (&dn)); 54 decNumber dn; local 58 decimal64ToNumber (&d64, &dn); 59 return (decNumberIsInfinite (&dn)); 65 decNumber dn; local 69 decimal128ToNumber (&d128, &dn); 70 return (decNumberIsInfinite (&dn));
|
/netbsd-6-1-5-RELEASE/external/gpl3/gdb/dist/libdecnumber/ |
H A D | decLibrary.c | 43 decNumber dn; local 47 decimal32ToNumber (&d32, &dn); 48 return (decNumberIsInfinite (&dn)); 54 decNumber dn; local 58 decimal64ToNumber (&d64, &dn); 59 return (decNumberIsInfinite (&dn)); 65 decNumber dn; local 69 decimal128ToNumber (&d128, &dn); 70 return (decNumberIsInfinite (&dn));
|
/netbsd-6-1-5-RELEASE/external/cddl/osnet/dist/uts/common/fs/zfs/ |
H A D | dnode.c | 53 dnode_t *dn = unused; local 54 bzero(dn, sizeof (dnode_t)); 56 rw_init(&dn->dn_struct_rwlock, NULL, RW_DEFAULT, NULL); 57 mutex_init(&dn->dn_mtx, NULL, MUTEX_DEFAULT, NULL); 58 mutex_init(&dn->dn_dbufs_mtx, NULL, MUTEX_DEFAULT, NULL); 59 cv_init(&dn->dn_notxholds, NULL, CV_DEFAULT, NULL); 61 refcount_create(&dn->dn_holds); 62 refcount_create(&dn->dn_tx_holds); 65 avl_create(&dn->dn_ranges[i], free_range_compar, 68 list_create(&dn 84 dnode_t *dn = unused; local 118 dnode_verify(dnode_t *dn) argument 245 dnode_setbonuslen(dnode_t *dn, int newsize, dmu_tx_t *tx) argument 262 dnode_setdblksz(dnode_t *dn, int size) argument 278 dnode_t *dn = kmem_cache_alloc(dnode_cache, KM_SLEEP); local 310 dnode_destroy(dnode_t *dn) argument 345 dnode_allocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, int ibs, dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) argument 418 dnode_reallocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) argument 477 dnode_special_close(dnode_t *dn) argument 493 dnode_t *dn = dnode_create(os, dnp, NULL, object); local 506 dnode_t *dn = children_dnodes[i]; local 545 dnode_t *mdn, *dn; local 664 dnode_add_ref(dnode_t *dn, void *tag) argument 677 dnode_rele(dnode_t *dn, void *tag) argument 690 dnode_setdirty(dnode_t *dn, dmu_tx_t *tx) argument 752 dnode_free(dnode_t *dn, dmu_tx_t *tx) argument 789 dnode_set_blksz(dnode_t *dn, uint64_t size, int ibs, dmu_tx_t *tx) argument 855 dnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx, boolean_t have_read) argument 935 dnode_clear_range(dnode_t *dn, uint64_t blkid, uint64_t nblks, dmu_tx_t *tx) argument 988 dnode_free_range(dnode_t *dn, uint64_t off, uint64_t len, dmu_tx_t *tx) argument 1175 dnode_block_freed(dnode_t *dn, uint64_t blkid) argument 1216 dnode_diduse_space(dnode_t *dn, int64_t delta) argument 1249 dnode_willuse_space(dnode_t *dn, int64_t space, dmu_tx_t *tx) argument 1280 dnode_next_offset_level(dnode_t *dn, int flags, uint64_t *offset, int lvl, uint64_t blkfill, uint64_t txg) argument 1411 dnode_next_offset(dnode_t *dn, int flags, uint64_t *offset, int minlvl, uint64_t blkfill, uint64_t txg) argument [all...] |
H A D | dnode_sync.c | 36 dnode_increase_indirection(dnode_t *dn, dmu_tx_t *tx) argument 40 int nblkptr = dn->dn_phys->dn_nblkptr; 41 int old_toplvl = dn->dn_phys->dn_nlevels - 1; 42 int new_level = dn->dn_next_nlevels[txgoff]; 45 rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 48 ASSERT(dn->dn_phys->dn_type != DMU_OT_NONE); 49 ASSERT(RW_WRITE_HELD(&dn->dn_struct_rwlock)); 50 ASSERT(new_level > 1 && dn->dn_phys->dn_nlevels > 0); 52 db = dbuf_hold_level(dn, dn 111 free_blocks(dnode_t *dn, blkptr_t *bp, int num, dmu_tx_t *tx) argument 213 dnode_t *dn = db->db_dnode; local 296 dnode_sync_free_range(dnode_t *dn, uint64_t blkid, uint64_t nblks, dmu_tx_t *tx) argument 363 dnode_evict_dbufs(dnode_t *dn) argument 447 dnode_sync_free(dnode_t *dn, dmu_tx_t *tx) argument 508 dnode_sync(dnode_t *dn, dmu_tx_t *tx) argument [all...] |
/netbsd-6-1-5-RELEASE/external/lgpl3/gmp/dist/tests/mpn/ |
H A D | t-bdiv.c | 58 mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, char *fname) 66 qn = nn - dn; 75 if (dn >= qn) 76 mpn_mul (tp, dp, dn, qp, qn); 78 mpn_mul (tp, qp, qn, dp, dn); 82 cy = mpn_add_n (tp + qn, tp + qn, rp, dn); 86 cmp = mpn_cmp (tp, np, nn - dn) != 0; 93 printf ("D= "); dumpy (dp, dn); 97 printf ("R= "); dumpy (rp, dn); 101 printf ("nn = %ld, dn 57 check_one(mp_ptr qp, mp_srcptr rp, mp_limb_t rh, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, char *fname) argument 138 mp_size_t maxnn, maxdn, nn, dn, clearn, i; local [all...] |
H A D | t-div.c | 58 mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, 61 mp_size_t qn = nn - dn + 1; 70 if (dn >= qn) 71 refmpn_mul (tp, dp, dn, qp, qn); 73 refmpn_mul (tp, qp, qn, dp, dn); 76 ASSERT_NOCARRY (refmpn_sub (tp, tp, nn+1, dp, dn)); 86 printf ("D= "); dumpy (dp, dn); 89 { printf ("R= "); dumpy (rp, dn); } 91 printf ("nn = %ld, dn = %ld, qn = %ld\n", nn, dn, q 57 check_one(mp_ptr qp, mp_srcptr rp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, char *fname, mp_limb_t q_allowed_err) argument 143 mp_size_t maxnn, maxdn, nn, dn, clearn, i; local [all...] |
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/ |
H A D | pr42245.c | 17 DIS_node *dnroot, *dn; local 23 dnroot = dn; 24 for (child = dn->cl; child != ((void *) 0); child = xchild)
|