/freebsd-10.1-release/crypto/heimdal/lib/gssapi/mech/ |
H A D | gss_export_name.c | 37 struct _gss_mechanism_name *mn; local 46 mn = HEIM_SLIST_FIRST(&name->gn_mn); 47 if (!mn) { 52 return mn->gmn_mech->gm_export_name(minor_status, 53 mn->gmn_name, exported_name);
|
H A D | gss_names.c | 37 struct _gss_mechanism_name *mn; local 41 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 42 if (gss_oid_equal(mech, mn->gmn_mech_oid)) 46 if (!mn) { 58 mn = malloc(sizeof(struct _gss_mechanism_name)); 59 if (!mn) 66 &mn->gmn_name); 69 free(mn); 73 mn->gmn_mech = m; 74 mn 89 struct _gss_mechanism_name *mn; local [all...] |
H A D | gss_pname_to_uid.c | 37 struct _gss_mechanism_name *mn, 44 if (mn->gmn_mech->gm_pname_to_uid == NULL) 47 major_status = mn->gmn_mech->gm_pname_to_uid(minor_status, 48 mn->gmn_name, 49 mn->gmn_mech_oid, 52 _gss_mg_error(mn->gmn_mech, major_status, *minor_status); 59 struct _gss_mechanism_name *mn, 71 if (mn->gmn_mech->gm_get_name_attribute == NULL) 86 major_status = mn->gmn_mech->gm_get_name_attribute(minor_status, 87 mn 36 mech_pname_to_uid(OM_uint32 *minor_status, struct _gss_mechanism_name *mn, uid_t *uidp) argument 58 attr_pname_to_uid(OM_uint32 *minor_status, struct _gss_mechanism_name *mn, uid_t *uidp) argument 141 struct _gss_mechanism_name *mn = NULL; local [all...] |
H A D | gss_release_name.c | 62 struct _gss_mechanism_name *mn; local 63 mn = HEIM_SLIST_FIRST(&name->gn_mn); 65 mn->gmn_mech->gm_release_name(minor_status, 66 &mn->gmn_name); 67 free(mn);
|
H A D | gss_canonicalize_name.c | 63 struct _gss_mechanism_name *mn; local 70 major_status = _gss_find_mn(minor_status, name, mech_type, &mn); 74 m = mn->gmn_mech; 76 mn->gmn_name, mech_type, &new_canonical_name); 94 mn = malloc(sizeof(struct _gss_mechanism_name)); 95 if (!mn) { 103 mn->gmn_mech = m; 104 mn->gmn_mech_oid = &m->gm_mech_oid; 105 mn->gmn_name = new_canonical_name; 106 HEIM_SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_lin [all...] |
H A D | gss_delete_name_attribute.c | 42 struct _gss_mechanism_name *mn; local 49 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 50 gssapi_mech_interface m = mn->gmn_mech; 56 mn->gmn_name,
|
H A D | gss_display_name_ext.c | 43 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_export_name_composite.c | 42 struct _gss_mechanism_name *mn; local 50 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 51 gssapi_mech_interface m = mn->gmn_mech; 57 mn->gmn_name,
|
H A D | gss_set_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_duplicate_name.c | 39 struct _gss_mechanism_name *mn; local 56 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 59 mn->gmn_mech_oid, &mn2); 71 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 79 new_mn->gmn_mech = mn->gmn_mech; 80 new_mn->gmn_mech_oid = mn->gmn_mech_oid; 83 mn->gmn_mech->gm_duplicate_name(minor_status, 84 mn->gmn_name, &new_mn->gmn_name);
|
H A D | gss_display_name.c | 39 struct _gss_mechanism_name *mn; local 70 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 71 major_status = mn->gmn_mech->gm_display_name( 72 minor_status, mn->gmn_name,
|
H A D | gss_get_name_attribute.c | 47 struct _gss_mechanism_name *mn; local 60 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 61 gssapi_mech_interface m = mn->gmn_mech; 67 mn->gmn_name,
|
H A D | gss_inquire_name.c | 44 struct _gss_mechanism_name *mn; local 57 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 58 gssapi_mech_interface m = mn->gmn_mech; 64 mn->gmn_name,
|
H A D | gss_inquire_cred.c | 57 struct _gss_mechanism_name *mn; local 110 mn = malloc(sizeof(struct _gss_mechanism_name)); 111 if (!mn) { 116 mn->gmn_mech = mc->gmc_mech; 117 mn->gmn_mech_oid = mc->gmc_mech_oid; 118 mn->gmn_name = mc_name; 119 HEIM_SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link); 146 mn = malloc( 148 if (!mn) { 153 mn [all...] |
H A D | gss_inquire_cred_by_mech.c | 44 gss_name_t mn; local 74 &mn, initiator_lifetime, acceptor_lifetime, cred_usage); 81 name = _gss_make_name(m, mn); 83 m->gm_release_name(minor_status, &mn); 88 m->gm_release_name(minor_status, &mn);
|
/freebsd-10.1-release/lib/libstand/ |
H A D | zalloc.c | 108 MemNode *mn; local 110 for (pmn = &mp->mp_First; (mn=*pmn) != NULL; pmn = &mn->mr_Next) { 111 if (bytes > mn->mr_Bytes) 120 char *ptr = (char *)mn; 122 if (mn->mr_Bytes == bytes) { 123 *pmn = mn->mr_Next; 125 mn = (MemNode *)((char *)mn + bytes); 126 mn 174 MemNode *mn; local 289 MemNode *mn; local [all...] |
/freebsd-10.1-release/lib/libgssapi/ |
H A D | gss_export_name.c | 41 struct _gss_mechanism_name *mn; local 50 mn = SLIST_FIRST(&name->gn_mn); 51 if (!mn) { 56 return mn->gmn_mech->gm_export_name(minor_status, 57 mn->gmn_name, exported_name);
|
H A D | gss_release_name.c | 47 struct _gss_mechanism_name *mn; local 48 mn = SLIST_FIRST(&name->gn_mn); 50 mn->gmn_mech->gm_release_name(minor_status, 51 &mn->gmn_name); 52 free(mn);
|
H A D | gss_names.c | 187 struct _gss_mechanism_name *mn; local 191 SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 192 if (gss_oid_equal(mech, mn->gmn_mech_oid)) 196 if (!mn) { 208 mn = malloc(sizeof(struct _gss_mechanism_name)); 209 if (!mn) 216 &mn->gmn_name); 219 free(mn); 223 mn->gmn_mech = m; 224 mn 239 struct _gss_mechanism_name *mn; local [all...] |
H A D | gss_canonicalize_name.c | 45 struct _gss_mechanism_name *mn; local 52 major_status = _gss_find_mn(minor_status, name, mech_type, &mn); 56 m = mn->gmn_mech; 58 mn->gmn_name, mech_type, &new_canonical_name); 76 mn = malloc(sizeof(struct _gss_mechanism_name)); 77 if (!mn) { 85 mn->gmn_mech = m; 86 mn->gmn_mech_oid = &m->gm_mech_oid; 87 mn->gmn_name = new_canonical_name; 88 SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_lin [all...] |
H A D | gss_duplicate_name.c | 44 struct _gss_mechanism_name *mn; local 61 SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 64 mn->gmn_mech_oid, &mn2); 76 SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { 84 new_mn->gmn_mech = mn->gmn_mech; 85 new_mn->gmn_mech_oid = mn->gmn_mech_oid; 88 mn->gmn_mech->gm_duplicate_name(minor_status, 89 mn->gmn_name, &new_mn->gmn_name);
|
H A D | gss_inquire_cred.c | 64 struct _gss_mechanism_name *mn; local 118 mn = malloc(sizeof(struct _gss_mechanism_name)); 119 if (!mn) { 124 mn->gmn_mech = mc->gmc_mech; 125 mn->gmn_mech_oid = mc->gmc_mech_oid; 126 mn->gmn_name = mc_name; 127 SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link); 154 mn = malloc( 156 if (!mn) { 161 mn [all...] |
H A D | gss_inquire_cred_by_mech.c | 48 gss_name_t mn; local 78 &mn, initiator_lifetime, acceptor_lifetime, cred_usage); 85 name = _gss_make_name(m, mn); 87 m->gm_release_name(minor_status, &mn); 92 m->gm_release_name(minor_status, &mn);
|
/freebsd-10.1-release/contrib/gcc/ |
H A D | opts-common.c | 54 size_t mn, mx, md, opt_len; local 58 mn = 0; 61 /* Find mn such this lexicographical inequality holds: 62 cl_options[mn] <= input < cl_options[mn + 1]. */ 63 while (mx - mn > 1) 65 md = (mn + mx) / 2; 72 mn = md; 84 const struct cl_option *opt = &cl_options[mn]; 93 return mn; [all...] |
/freebsd-10.1-release/sbin/nvmecontrol/ |
H A D | devlist.c | 65 uint8_t mn[64]; local 95 nvme_strvis(mn, cdata.mn, sizeof(mn), NVME_MODEL_NUMBER_LENGTH); 96 printf("%6s: %s\n", name, mn);
|