/netbsd-current/sys/arch/atari/atari/ |
H A D | stalloc.c | 83 struct mem_node *mn, *new, *bfit; local 98 TAILQ_FOREACH(mn, &free_list, free_link) { 99 if (size <= mn->size) { 101 (bfit->size < mn->size)) 103 bfit = mn; 107 mn = bfit; 108 if (mn == NULL) { 115 if ((mn->size - size) <= sizeof(*mn)) { 120 TAILQ_REMOVE(&free_list, mn, free_lin 153 struct mem_node *mn, *next, *prev; local [all...] |
H A D | stalloc.h | 52 #define MNODES_MEM(mn) ((u_char *)(&mn[1]))
|
/netbsd-current/crypto/external/bsd/heimdal/dist/lib/gssapi/mech/ |
H A D | gss_export_name.c | 53 struct _gss_mechanism_name *mn; local 62 mn = HEIM_SLIST_FIRST(&name->gn_mn); 63 if (!mn) { 68 return mn->gmn_mech->gm_export_name(minor_status, 69 mn->gmn_name, exported_name);
|
H A D | gss_names.c | 39 struct _gss_mechanism_name *mn; local 43 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 44 if (gss_oid_equal(mech, mn->gmn_mech_oid)) 48 if (!mn) { 60 mn = malloc(sizeof(struct _gss_mechanism_name)); 61 if (!mn) 68 &mn->gmn_name); 71 free(mn); 75 mn->gmn_mech = m; 76 mn 91 struct _gss_mechanism_name *mn; local [all...] |
H A D | gss_release_name.c | 64 struct _gss_mechanism_name *mn; local 65 mn = HEIM_SLIST_FIRST(&name->gn_mn); 67 mn->gmn_mech->gm_release_name(minor_status, 68 &mn->gmn_name); 69 free(mn);
|
H A D | gss_canonicalize_name.c | 65 struct _gss_mechanism_name *mn; local 72 major_status = _gss_find_mn(minor_status, name, mech_type, &mn); 76 m = mn->gmn_mech; 78 mn->gmn_name, mech_type, &new_canonical_name); 96 mn = malloc(sizeof(struct _gss_mechanism_name)); 97 if (!mn) { 105 mn->gmn_mech = m; 106 mn->gmn_mech_oid = &m->gm_mech_oid; 107 mn->gmn_name = new_canonical_name; 108 HEIM_SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_lin [all...] |
H A D | gss_set_name_attribute.c | 46 struct _gss_mechanism_name *mn; local 53 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 54 gssapi_mech_interface m = mn->gmn_mech; 60 mn->gmn_name,
|
H A D | gss_delete_name_attribute.c | 44 struct _gss_mechanism_name *mn; local 51 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 52 gssapi_mech_interface m = mn->gmn_mech; 58 mn->gmn_name,
|
H A D | gss_display_name_ext.c | 45 struct _gss_mechanism_name *mn; local 53 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 54 gssapi_mech_interface m = mn->gmn_mech; 60 mn->gmn_name,
|
H A D | gss_export_name_composite.c | 44 struct _gss_mechanism_name *mn; local 52 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 53 gssapi_mech_interface m = mn->gmn_mech; 59 mn->gmn_name,
|
H A D | gss_duplicate_name.c | 41 struct _gss_mechanism_name *mn; local 58 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 61 mn->gmn_mech_oid, &mn2); 73 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 81 new_mn->gmn_mech = mn->gmn_mech; 82 new_mn->gmn_mech_oid = mn->gmn_mech_oid; 85 mn->gmn_mech->gm_duplicate_name(minor_status, 86 mn->gmn_name, &new_mn->gmn_name);
|
H A D | gss_pname_to_uid.c | 39 struct _gss_mechanism_name *mn, 46 if (mn->gmn_mech->gm_localname == NULL) 49 major_status = mn->gmn_mech->gm_localname(minor_status, 50 mn->gmn_name, 51 mn->gmn_mech_oid, 54 _gss_mg_error(mn->gmn_mech, major_status, *minor_status); 61 struct _gss_mechanism_name *mn, 76 if (mn->gmn_mech->gm_get_name_attribute == NULL) 79 major_status = mn->gmn_mech->gm_get_name_attribute(minor_status, 80 mn 38 mech_localname(OM_uint32 *minor_status, struct _gss_mechanism_name *mn, gss_buffer_t localname) argument 60 attr_localname(OM_uint32 *minor_status, struct _gss_mechanism_name *mn, gss_buffer_t localname) argument 112 struct _gss_mechanism_name *mn = NULL; local [all...] |
H A D | gss_display_name.c | 41 struct _gss_mechanism_name *mn; local 72 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 73 major_status = mn->gmn_mech->gm_display_name( 74 minor_status, mn->gmn_name,
|
H A D | gss_inquire_name.c | 46 struct _gss_mechanism_name *mn; local 59 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 60 gssapi_mech_interface m = mn->gmn_mech; 66 mn->gmn_name,
|
H A D | gss_get_name_attribute.c | 49 struct _gss_mechanism_name *mn; local 62 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 63 gssapi_mech_interface m = mn->gmn_mech; 69 mn->gmn_name,
|
/netbsd-current/external/lgpl3/gmp/dist/tests/mpn/ |
H A D | t-fib2m.c | 40 mp_size_t mn, fn, size, max_mn; local 67 mn = gmp_urandomm_ui (rands, MAX_K) % (fn / 4 + 10); 68 } while (mn == 0); 69 ASSERT (mn <= max_mn); 70 mpn_random2 (mp, mn); 71 ASSERT (mp [mn - 1] != 0); 73 if (fn >= mn) 75 mpn_tdiv_qr (qp, fk, 0, fk, fn, mp, mn); 76 mpn_tdiv_qr (qp, fks1, 0, fks1, fn, mp, mn); 80 MPN_ZERO (fk + fn, mn 189 mp_size_t mn, kn; local [all...] |
/netbsd-current/external/lgpl3/gmp/dist/mpn/generic/ |
H A D | strongfibo.c | 77 The sequence is computed modulo M = {mp, mn}. 78 The starting point is given in L_{count+1} = {lp, mn}. 79 The scratch pointed by sp, needs a space of at least 3 * mn + 1 limbs. 88 mpn_llriter (mp_ptr lp, mp_srcptr mp, mp_size_t mn, mp_bitcnt_t count, mp_ptr sp) argument 92 mpn_sqr (sp, lp, mn); 93 mpn_tdiv_qr (sp + 2 * mn, lp, 0, sp, 2 * mn, mp, mn); 97 if (mn == 1 || mpn_zero_p (lp + 1, mn 118 mpn_lucm(mp_ptr lp, mp_srcptr np, mp_size_t nn, mp_srcptr mp, mp_size_t mn, mp_ptr scratch) argument 170 mpn_strongfibo(mp_srcptr mp, mp_size_t mn, mp_ptr scratch) argument [all...] |
H A D | fib2m.c | 73 fp and f1p should have room for mn*2+1 limbs. 87 TODO: Should {tp, 2 * mn} be passed as a scratch pointer? 88 Should the call to mpn_fib2_ui() obtain (up to) 2*mn limbs? 92 mpn_fib2m (mp_ptr fp, mp_ptr f1p, mp_srcptr np, mp_size_t nn, mp_srcptr mp, mp_size_t mn) argument 100 ASSERT (! MPN_OVERLAP_P (fp, MAX(2*mn+1,5), f1p, MAX(2*mn+1,5))); 103 /* Estimate the maximal n such that fibonacci(n) fits in mn limbs. */ 105 if (UNLIKELY (ULONG_MAX / (23 * (GMP_NUMB_BITS / 16)) <= mn)) 108 nfirst = mn * (23 * (GMP_NUMB_BITS / 16)); 112 mbi = (mp_bitcnt_t) mn * GMP_NUMB_BIT [all...] |
H A D | matrix22_mul.c | 79 mpn_matrix22_mul_itch (mp_size_t rn, mp_size_t mn) argument 82 || BELOW_THRESHOLD (mn, MATRIX22_STRASSEN_THRESHOLD)) 83 return 3*rn + 2*mn; 85 return 3*(rn + mn) + 5; 126 * Resulting elements are of size up to rn + mn + 1. 128 * Temporary storage: 3 rn + 3 mn + 5. */ 131 mp_srcptr m0, mp_srcptr m1, mp_srcptr m2, mp_srcptr m3, mp_size_t mn, 137 t0 = tp; tp += mn + 1; 138 u0 = tp; tp += rn + mn + 1; 139 u1 = tp; /* rn + mn 130 mpn_matrix22_mul_strassen(mp_ptr r0, mp_ptr r1, mp_ptr r2, mp_ptr r3, mp_size_t rn, mp_srcptr m0, mp_srcptr m1, mp_srcptr m2, mp_srcptr m3, mp_size_t mn, mp_ptr tp) argument 280 mpn_matrix22_mul(mp_ptr r0, mp_ptr r1, mp_ptr r2, mp_ptr r3, mp_size_t rn, mp_srcptr m0, mp_srcptr m1, mp_srcptr m2, mp_srcptr m3, mp_size_t mn, mp_ptr tp) argument [all...] |
H A D | hgcd_reduce.c | 78 mp_size_t mn[2][2]; local 99 mn[i][j] = k; 102 ASSERT (mn[0][0] > 0); 103 ASSERT (mn[1][1] > 0); 104 ASSERT ( (mn[0][1] | mn[1][0]) > 0); 108 if (mn[0][1] == 0) 111 ASSERT (mn[0][0] == 1); 113 ASSERT (mn[1][1] == 1); 117 nn = submul (bp, bn, ap, an, M->p[1][0], mn[ [all...] |
/netbsd-current/external/lgpl3/gmp/dist/mpz/ |
H A D | powm_ui.c | 104 /* Compute t = a mod m, a is defined by (ap,an), m is defined by (mp,mn), and 105 t is defined by (tp,mn). */ 107 reduce (mp_ptr tp, mp_srcptr ap, mp_size_t an, mp_srcptr mp, mp_size_t mn, gmp_pi1_t *dinv) argument 113 TMP_ALLOC_LIMBS_2 (rp, an, scratch, an - mn + 1); 115 mod (rp, an, mp, mn, dinv, scratch); 116 MPN_COPY (tp, rp, mn); 127 mp_size_t xn, tn, mn, bn; local 135 mn = ABSIZ(m); 136 if (UNLIKELY (mn == 0)) 148 SIZ(r) = mn ! [all...] |
/netbsd-current/sys/arch/amiga/amiga/ |
H A D | cc.c | 489 struct mem_node *mn, *new; local 502 TAILQ_FOREACH(mn, &free_list, free_link) 503 if (size <= mn->size) 506 if (mn == NULL) { 511 if ((mn->size - size) <= sizeof (*mn)) { 516 TAILQ_REMOVE(&free_list, mn, free_link); 517 mn->type = MNODE_USED; 518 size = mn->size; /* increase size. (or same) */ 519 chip_total -= mn 547 struct mem_node *mn, *next, *prev; local 626 struct mem_node *mn; local 638 struct mem_node *mn; local [all...] |
/netbsd-current/sys/external/bsd/drm2/dist/drm/i915/gem/ |
H A D | i915_gem_userptr.c | 34 struct i915_mmu_notifier *mn; member in struct:i915_mm_struct 46 struct mmu_notifier mn; member in struct:i915_mmu_notifier 52 struct i915_mmu_notifier *mn; member in struct:i915_mmu_object 60 interval_tree_insert(&mo->it, &mo->mn->objects); 68 interval_tree_remove(&mo->it, &mo->mn->objects); 91 spin_lock(&mo->mn->lock); 96 spin_unlock(&mo->mn->lock); 103 struct i915_mmu_notifier *mn = local 104 container_of(_mn, struct i915_mmu_notifier, mn); 109 if (RB_EMPTY_ROOT(&mn 173 struct i915_mmu_notifier *mn; local 205 struct i915_mmu_notifier *mn; local 247 struct i915_mmu_notifier *mn; local 276 i915_mmu_notifier_free(struct i915_mmu_notifier *mn, struct vmspace *mm) argument 318 i915_mmu_notifier_free(struct i915_mmu_notifier *mn, struct vmspace *mm) argument [all...] |
/netbsd-current/sbin/nvmectl/ |
H A D | devlist.c | 74 uint8_t mn[64]; local 104 nvme_strvis(mn, sizeof(mn), cdata.mn, sizeof(cdata.mn)); 105 printf("%6s: %s\n", name, mn);
|
/netbsd-current/external/lgpl3/gmp/dist/mpf/ |
H A D | set_str.c | 256 mp_size_t ra, ma, rn, mn; local 284 mn = mpn_set_str (mp, (unsigned char *) begs, str_size, base); 288 if (mn > prec) 290 madj = mn - prec; 291 mp += mn - prec; 292 mn = prec; 331 MPN_COPY (PTR(x), mp, mn); local 332 SIZ(x) = negative ? -mn : mn; 333 EXP(x) = mn [all...] |