/netbsd-current/external/bsd/openldap/dist/servers/slapd/back-perl/ |
H A D | SampleLDAP.pm | 60 for my $dn ( keys %{$this} ) { 61 if ( $this->{$dn} =~ /$filterStr/imx ) { 62 push @match_dn, $dn; 70 for my $dn (@match_dn) { 71 push @match_entries, $this->{$dn}; 80 my ( $dn, $avaStr ) = @_; 85 if ( $this->{$dn} =~ /$avaStr/im ) { 95 my ( $dn, @list ) = @_; 103 $this->{$dn} .= "$key: $value\n"; 107 $this->{$dn} [all...] |
/netbsd-current/external/lgpl3/gmp/dist/mpn/generic/ |
H A D | sbpi1_div_qr.c | 45 mp_srcptr dp, mp_size_t dn, 55 ASSERT (dn > 2); 56 ASSERT (nn >= dn); 57 ASSERT ((dp[dn-1] & GMP_NUMB_HIGHBIT) != 0); 61 qh = mpn_cmp (np - dn, dp, dn) >= 0; 63 mpn_sub_n (np - dn, np - dn, dp, dn); 65 qp += nn - dn; 43 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 | sec_div.c | 52 FNAME_itch (mp_size_t nn, mp_size_t dn) argument 55 /* Needs (nn + dn + 1) + mpn_sec_pi1_div_qr's needs of (2nn' - dn + 1) for a 61 /* Needs (nn + dn + 1) + mpn_sec_pi1_div_r's needs of (dn + 1) for a total of 62 nn + 2dn + 2 limbs at tp. */ 63 return nn + 2 * dn + 2; 70 mp_srcptr dp, mp_size_t dn, variable 77 ASSERT (dn >= 1); 78 ASSERT (nn >= dn); [all...] |
H A D | dcpi1_divappr_q.c | 86 mp_srcptr dp, mp_size_t dn, gmp_pi1_t *dinv) 95 ASSERT (dn >= 6); 96 ASSERT (nn > dn); 97 ASSERT (dp[dn-1] & GMP_NUMB_HIGHBIT); 99 qn = nn - dn; 102 dp += dn; 104 if (qn >= dn) 107 /* Reduce qn mod dn without division, optimizing small operations. */ 109 qn -= dn; 110 while (qn > dn); 85 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 | bdiv_qr.c | 47 mp_srcptr dp, mp_size_t dn, 53 ASSERT (nn > dn); 54 if (BELOW_THRESHOLD (dn, DC_BDIV_QR_THRESHOLD) || 55 BELOW_THRESHOLD (nn - dn, DC_BDIV_QR_THRESHOLD)) 59 rh = mpn_sbpi1_bdiv_qr (qp, tp, nn, dp, dn, di); 60 MPN_COPY (rp, tp + nn - dn, dn); 62 else if (BELOW_THRESHOLD (dn, MU_BDIV_QR_THRESHOLD)) 66 rh = mpn_dcpi1_bdiv_qr (qp, tp, nn, dp, dn, di); 67 MPN_COPY (rp, tp + nn - dn, d 45 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 78 mpn_bdiv_qr_itch(mp_size_t nn, mp_size_t dn) argument [all...] |
H A D | sbpi1_divappr_q.c | 46 mp_srcptr dp, mp_size_t dn, 57 ASSERT (dn > 2); 58 ASSERT (nn >= dn); 59 ASSERT ((dp[dn-1] & GMP_NUMB_HIGHBIT) != 0); 63 qn = nn - dn; 64 if (qn + 1 < dn) 66 dp += dn - (qn + 1); 67 dn = qn + 1; 70 qh = mpn_cmp (np - dn, dp, dn) > 44 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 | 40 /* Determine whether A={ap,an} is divisible by D={dp,dn}. Must have both 61 mp_srcptr dp, mp_size_t dn) 72 ASSERT (dn >= 1); 73 ASSERT (dp[dn-1] != 0); 75 ASSERT_MPN (dp, dn); 79 if (an < dn) 96 dn--; ASSERT (dn >= 1); 106 if (dn == 1) 117 if (dn 60 mpn_divisible_p(mp_srcptr ap, mp_size_t an, mp_srcptr dp, mp_size_t dn) argument [all...] |
H A D | sbpi1_bdiv_qr.c | 41 /* Computes a binary quotient of size qn = un - dn. 48 Stores the dn least significant limbs of R at {up + un - dn, dn}, 56 mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) 61 ASSERT (dn > 0); 62 ASSERT (un > dn); 65 ASSERT (up == qp || !MPN_OVERLAP_P (up, un, qp, un - dn)); 67 for (i = un - dn, cy = 0; i != 0; i--) 70 mp_limb_t hi = mpn_addmul_1 (up, dp, dn, 54 mpn_sbpi1_bdiv_qr(mp_ptr qp, mp_ptr up, mp_size_t un, mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) argument [all...] |
H A D | bdiv_q.c | 45 mp_srcptr dp, mp_size_t dn, 50 if (BELOW_THRESHOLD (dn, DC_BDIV_Q_THRESHOLD)) 54 mpn_sbpi1_bdiv_q (qp, tp, nn, dp, dn, di); 56 else if (BELOW_THRESHOLD (dn, MU_BDIV_Q_THRESHOLD)) 60 mpn_dcpi1_bdiv_q (qp, tp, nn, dp, dn, di); 64 mpn_mu_bdiv_q (qp, np, nn, dp, dn, tp); 70 mpn_bdiv_q_itch (mp_size_t nn, mp_size_t dn) argument 72 if (BELOW_THRESHOLD (dn, MU_BDIV_Q_THRESHOLD)) 75 return mpn_mu_bdiv_q_itch (nn, dn); 43 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 | dcpi1_div_qr.c | 92 mp_srcptr dp, mp_size_t dn, 102 ASSERT (dn >= 6); /* to adhere to mpn_sbpi1_div_qr's limits */ 103 ASSERT (nn - dn >= 3); /* to adhere to mpn_sbpi1_div_qr's limits */ 104 ASSERT (dp[dn-1] & GMP_NUMB_HIGHBIT); 106 tp = TMP_ALLOC_LIMBS (dn); 108 qn = nn - dn; 111 dp += dn; 113 if (qn > dn) 115 /* Reduce qn mod dn without division, optimizing small operations. */ 117 qn -= dn; 90 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 | 45 mp_srcptr dp, mp_size_t dn, 56 mp_size_t dn_orig = dn; 60 ASSERT (dn > 2); 61 ASSERT (nn >= dn); 62 ASSERT ((dp[dn-1] & GMP_NUMB_HIGHBIT) != 0); 66 qn = nn - dn; 67 if (qn + 1 < dn) 69 dp += dn - (qn + 1); 70 dn = qn + 1; 73 qh = mpn_cmp (np - dn, d 43 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 | 49 mp_srcptr dp, mp_size_t dn, 55 ASSERT (dn > 0); 56 ASSERT (un >= dn); 59 ASSERT (up == qp || !MPN_OVERLAP_P (up, un, qp, un - dn)); 61 if (un > dn) 64 for (i = un - dn - 1, cy = 0; i > 0; i--) 67 hi = mpn_addmul_1 (up, dp, dn, q); 73 hi += up[dn]; 74 cy += hi < up[dn]; 75 up[dn] 47 mpn_sbpi1_bdiv_q(mp_ptr qp, mp_ptr up, mp_size_t un, mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) argument [all...] |
H A D | sec_pi1_div.c | 65 /* Needs (dn + 1) + (nn - dn) + (nn - dn) = 2nn - dn + 1 limbs at tp. */ 71 /* Needs (dn + 1) limbs at tp. */ 80 mp_srcptr dp, mp_size_t dn, variable 92 ASSERT (dn >= 1); 93 ASSERT (nn >= dn); 94 ASSERT ((dp[dn - 1] & GMP_NUMB_HIGHBIT) != 0); 96 if (nn == dn) [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 51 D = {dp,dn} 56 dn >= 2 58 scratch space as determined by mpn_mu_bdiv_qr_itch(nn,dn). 60 Write quotient to Q = {qp,nn-dn}. 64 FIXME: Trim allocation for (qn > dn) case, 3*dn might be possible. In 65 particular, when dn 68 mpn_mu_bdiv_qr_old(mp_ptr qp, mp_ptr rp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr scratch) argument 246 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 279 mpn_mu_bdiv_qr_itch(mp_size_t nn, mp_size_t dn) argument [all...] |
H A D | sbpi1_bdiv_r.c | 41 /* Computes a binary quotient of size qn = un - dn. 48 Stores the dn least significant limbs of R at {up + un - dn, dn}, 55 mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) 60 ASSERT (dn > 0); 61 ASSERT (un > dn); 65 for (i = un - dn, cy = 0; i != 0; i--) 68 mp_limb_t hi = mpn_addmul_1 (up, dp, dn, q); 72 hi += up[dn]; 54 mpn_sbpi1_bdiv_r(mp_ptr up, mp_size_t un, mp_srcptr dp, mp_size_t dn, mp_limb_t dinv) argument [all...] |
H A D | dcpi1_bdiv_q.c | 88 D = {dp,dn} 94 mp_srcptr dp, mp_size_t dn, 104 ASSERT (dn >= 2); 105 ASSERT (nn - dn >= 0); 108 tp = TMP_SALLOC_LIMBS (dn); 112 if (qn > dn) 114 /* Reduce qn mod dn in a super-efficient manner. */ 116 qn -= dn; 117 while (qn > dn); 125 if (qn != dn) 92 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 | div_q.c | 43 D = {dp,dn} 44 Q = {qp,nn-dn+1} 52 dp[dn-1] != 0 66 We write nn-dn+1 limbs for the quotient, but return void. Why not return 70 generate all nn-dn+1 and return 0 or 1. I don't see how to fix that unless 77 >= dn) blocks into separate functions, since we could promise quite 102 mp_srcptr dp, mp_size_t dn, mp_ptr scratch) 112 ASSERT (nn >= dn); 113 ASSERT (dn > 0); 114 ASSERT (dp[dn 100 mpn_div_q(mp_ptr qp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, mp_ptr scratch) argument [all...] |
/netbsd-current/external/bsd/openldap/dist/tests/data/ |
H A D | slapd-acl.conf | 29 access to dn.exact="" attrs=objectClass 52 #access to attrs=objectclass dn.subtree="dc=example,dc=com" 54 by dn.exact="cn=Bjorn Jensen,ou=Information Technology Division,ou=People,dc=example,dc=com" add 57 #access to filter="(objectclass=person)" attrs=userpassword dn.subtree="dc=example,dc=com" 62 access to dn.exact="cn=Mark Elliot,ou=Alumni Association,ou=People,dc=example,dc=com" 64 by dn="cn=Barbara Jensen,ou=Information Technology Division,ou=People,dc=example,dc=com" read 67 access to dn.exact="cn=Mark Elliot,ou=Alumni Association,ou=People,dc=example,dc=com" 69 by dn="cn=Bjorn Jensen,ou=Information Technology Division,ou=People,dc=example,dc=com" read 72 access to dn.exact="cn=Mark Elliot,ou=Alumni Association,ou=People,dc=example,dc=com" 76 access to dn [all...] |
/netbsd-current/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-current/external/gpl3/gdb.old/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-current/external/gpl3/gcc.old/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-current/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-current/external/lgpl3/gmp/dist/tests/mpn/ |
H A D | t-div.c | 61 mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, 64 mp_size_t qn = nn - dn + 1; 73 if (dn >= qn) 74 refmpn_mul (tp, dp, dn, qp, qn); 76 refmpn_mul (tp, qp, qn, dp, dn); 79 ASSERT_NOCARRY (refmpn_sub (tp, tp, nn+1, dp, dn)); 89 printf ("D= "); dumpy (dp, dn); 92 { printf ("R= "); dumpy (rp, dn); } 94 printf ("nn = %ld, dn = %ld, qn = %ld\n", nn, dn, q 60 check_one(mp_ptr qp, mp_srcptr rp, mp_srcptr np, mp_size_t nn, mp_srcptr dp, mp_size_t dn, const char *fname, mp_limb_t q_allowed_err) argument 131 mp_size_t maxnn, maxdn, nn, dn, clearn, i; local [all...] |
/netbsd-current/external/cddl/osnet/dist/uts/common/fs/zfs/ |
H A D | dnode.c | 107 dnode_t *dn = arg; local 110 rw_init(&dn->dn_struct_rwlock, NULL, RW_DEFAULT, NULL); 111 mutex_init(&dn->dn_mtx, NULL, MUTEX_DEFAULT, NULL); 112 mutex_init(&dn->dn_dbufs_mtx, NULL, MUTEX_DEFAULT, NULL); 113 cv_init(&dn->dn_notxholds, NULL, CV_DEFAULT, NULL); 119 refcount_create_untracked(&dn->dn_holds); 120 refcount_create(&dn->dn_tx_holds); 121 list_link_init(&dn->dn_link); 123 bzero(&dn->dn_next_nblkptr[0], sizeof (dn 169 dnode_t *dn = arg; local 232 dnode_verify(dnode_t *dn) argument 354 dnode_setbonuslen(dnode_t *dn, int newsize, dmu_tx_t *tx) argument 371 dnode_setbonus_type(dnode_t *dn, dmu_object_type_t newtype, dmu_tx_t *tx) argument 382 dnode_rm_spill(dnode_t *dn, dmu_tx_t *tx) argument 392 dnode_setdblksz(dnode_t *dn, int size) argument 408 dnode_t *dn; local 485 dnode_destroy(dnode_t *dn) argument 539 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 622 dnode_reallocate(dnode_t *dn, dmu_object_type_t ot, int blocksize, dmu_object_type_t bonustype, int bonuslen, dmu_tx_t *tx) argument 990 dnode_t *dn = dnh->dnh_dnode; local 1012 dnode_t *dn; local 1027 dnode_t *dn; local 1072 dnode_t *mdn, *dn; local 1213 dnode_add_ref(dnode_t *dn, void *tag) argument 1226 dnode_rele(dnode_t *dn, void *tag) argument 1233 dnode_rele_and_unlock(dnode_t *dn, void *tag) argument 1269 dnode_setdirty(dnode_t *dn, dmu_tx_t *tx) argument 1338 dnode_free(dnode_t *dn, dmu_tx_t *tx) argument 1375 dnode_set_blksz(dnode_t *dn, uint64_t size, int ibs, dmu_tx_t *tx) argument 1440 dnode_new_blkid(dnode_t *dn, uint64_t blkid, dmu_tx_t *tx, boolean_t have_read) argument 1522 dnode_dirty_l1(dnode_t *dn, uint64_t l1blkid, dmu_tx_t *tx) argument 1532 dnode_free_range(dnode_t *dn, uint64_t off, uint64_t len, dmu_tx_t *tx) argument 1740 dnode_spill_freed(dnode_t *dn) argument 1755 dnode_block_freed(dnode_t *dn, uint64_t blkid) argument 1788 dnode_diduse_space(dnode_t *dn, int64_t delta) argument 1820 dnode_willuse_space(dnode_t *dn, int64_t space, dmu_tx_t *tx) argument 1853 dnode_next_offset_level(dnode_t *dn, int flags, uint64_t *offset, int lvl, uint64_t blkfill, uint64_t txg) argument 1986 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 | 40 dnode_increase_indirection(dnode_t *dn, dmu_tx_t *tx) argument 44 int nblkptr = dn->dn_phys->dn_nblkptr; 45 int old_toplvl = dn->dn_phys->dn_nlevels - 1; 46 int new_level = dn->dn_next_nlevels[txgoff]; 49 rw_enter(&dn->dn_struct_rwlock, RW_WRITER); 52 ASSERT(dn->dn_phys->dn_type != DMU_OT_NONE); 53 ASSERT(RW_WRITE_HELD(&dn->dn_struct_rwlock)); 54 ASSERT(new_level > 1 && dn->dn_phys->dn_nlevels > 0); 56 db = dbuf_hold_level(dn, dn 81 ASSERT3P(DB_DNODE(child), ==, dn); local 114 free_blocks(dnode_t *dn, blkptr_t *bp, int num, dmu_tx_t *tx) argument 160 dnode_t *dn; local 236 dnode_t *dn; local 316 dnode_sync_free_range_impl(dnode_t *dn, uint64_t blkid, uint64_t nblks, dmu_tx_t *tx) argument 382 dnode_t *dn = dsfra->dsfra_dnode; local 393 dnode_evict_dbufs(dnode_t *dn) argument 403 ASSERT3P(DB_DNODE(db), ==, dn); local 432 dnode_evict_bonus(dnode_t *dn) argument 479 dnode_sync_free(dnode_t *dn, dmu_tx_t *tx) argument 540 dnode_sync(dnode_t *dn, dmu_tx_t *tx) argument [all...] |