HomeSort by: relevance | last modified time | path
    Searched defs:mn (Results 1 - 25 of 110) sorted by relevancy

1 2 3 4 5

  /src/crypto/external/bsd/heimdal/dist/lib/gssapi/mech/
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,
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);
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);
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,
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,
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,
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,
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,
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,
gss_canonicalize_name.c 35 * mechanism specific Mechanism Name (MN).
40 * mechanism is specified, the resulting MN type is a
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);
85 * Now we make a new name and mark it as an MN.
96 mn = malloc(sizeof(struct _gss_mechanism_name));
97 if (!mn) {
105 mn->gmn_mech = m
    [all...]
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);
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) {
51 * MN but it is from a different mech), give up now.
60 mn = malloc(sizeof(struct _gss_mechanism_name));
61 if (!mn)
68 &mn->gmn_name);
71 free(mn);
75 mn->gmn_mech = m
91 struct _gss_mechanism_name *mn; local
    [all...]
gss_inquire_cred_by_mech.c 46 gss_name_t mn; local
76 &mn, initiator_lifetime, acceptor_lifetime, cred_usage);
83 name = _gss_make_name(m, mn);
85 m->gm_release_name(minor_status, &mn);
90 m->gm_release_name(minor_status, &mn);
gss_acquire_cred.c 103 struct _gss_mechanism_name *mn = NULL; local
111 &mechs->elements[i], &mn);
129 ? mn->gmn_name : GSS_C_NO_NAME),
gss_acquire_cred_ext.c 38 const struct _gss_mechanism_name *mn,
66 mn->gmn_name,
82 mn->gmn_name,
92 mn->gmn_name,
164 struct _gss_mechanism_name *mn = NULL; local
173 &mechs->elements[i], &mn);
178 major_status = _gss_acquire_mech_cred(minor_status, m, mn,
gss_add_cred_with_password.c 52 struct _gss_mechanism_name *mn = NULL; local
98 * Figure out a suitable mn, if any.
104 &mn);
118 major_status = _gss_acquire_mech_cred(minor_status, m, mn,
gss_init_sec_context.c 128 struct _gss_mechanism_name *mn; local
172 * Find the MN for this mechanism.
174 major_status = _gss_find_mn(minor_status, name, mech_type, &mn);
199 mn->gmn_name,
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->gmn_name
112 struct _gss_mechanism_name *mn = NULL; local
    [all...]
gss_add_cred.c 94 struct _gss_mechanism_name *mn; local
137 * Figure out a suitable mn, if any.
143 &mn);
149 mn = 0;
166 desired_name ? mn->gmn_name : GSS_C_NO_NAME,
  /src/sbin/nvmectl/
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);
  /src/sys/arch/atari/atari/
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_link)
153 struct mem_node *mn, *next, *prev; local
    [all...]
  /src/sys/dev/qbus/
if_uba.c 194 struct mbuf *m, *mn; local
196 if ((mn = getmcl()) == NULL)
201 ifr->ifrw_mbuf = mn;
203 mn->m_ext.ext_buf, mn->m_ext.ext_size, NULL, BUS_DMA_NOWAIT)))
  /src/external/bsd/ntp/dist/include/
ntp_datum.h 25 unsigned short mn; member in struct:vmedate
  /src/external/lgpl3/gmp/dist/mpn/generic/
invertappr.c 156 mp_size_t rn, mn; local
189 mn = mpn_mulmod_bnm1_next_size (n + 1);
190 tp = TMP_ALLOC_LIMBS (mpn_mulmod_bnm1_itch (mn, n, (n >> 1) + 1));
204 || ((mn = mpn_mulmod_bnm1_next_size (n + 1)) > (n + rn))) {
210 } else { /* Use B^mn-1 wraparound */
211 mpn_mulmod_bnm1 (xp, mn, dp - n, n, ip - rn, rn, tp);
212 /* We computed {xp,mn} <- {ip,rn} * {dp,n} mod (B^mn-1) */
213 /* We know that 2*|ip*dp + dp*B^rn - B^{rn+n}| < B^mn-1 */
214 /* Add dp*B^rn mod (B^mn-1) *
    [all...]
  /src/sys/dev/scsipi/
uk.c 127 int cmaj, mn; local
133 mn = device_unit(self);
134 vdevgone(cmaj, mn, mn, VCHR);

Completed in 41 milliseconds

1 2 3 4 5