Home
last modified time | relevance | path

Searched full:mn (Results 1 – 25 of 195) sorted by relevance

12345678

/freebsd/crypto/heimdal/lib/wind/
H A Dcombining_table.c9 {0x300, 230}, /* Mn */
10 {0x301, 230}, /* Mn */
11 {0x302, 230}, /* Mn */
12 {0x303, 230}, /* Mn */
13 {0x304, 230}, /* Mn */
14 {0x305, 230}, /* Mn */
15 {0x306, 230}, /* Mn */
16 {0x307, 230}, /* Mn */
17 {0x308, 230}, /* Mn */
18 {0x309, 230}, /* Mn */
[all …]
H A DDerivedNormalizationProps.txt589 0340..0341 ; Full_Composition_Exclusion # Mn [2] COMBINING GRAVE TONE MARK..COMBINING ACUTE TO…
590 0343..0344 ; Full_Composition_Exclusion # Mn [2] COMBINING GREEK KORONIS..COMBINING GREEK DIAL…
608 0F73 ; Full_Composition_Exclusion # Mn TIBETAN VOWEL SIGN II
609 0F75..0F76 ; Full_Composition_Exclusion # Mn [2] TIBETAN VOWEL SIGN UU..TIBETAN VOWEL SIGN VOC…
610 0F78 ; Full_Composition_Exclusion # Mn TIBETAN VOWEL SIGN VOCALIC L
611 0F81 ; Full_Composition_Exclusion # Mn TIBETAN VOWEL SIGN REVERSED II
612 0F93 ; Full_Composition_Exclusion # Mn TIBETAN SUBJOINED LETTER GHA
613 0F9D ; Full_Composition_Exclusion # Mn TIBETAN SUBJOINED LETTER DDHA
614 0FA2 ; Full_Composition_Exclusion # Mn TIBETAN SUBJOINED LETTER DHA
615 0FA7 ; Full_Composition_Exclusion # Mn TIBETAN SUBJOINED LETTER BHA
[all …]
/freebsd/contrib/less/
H A Dcompose.uni1 /* Generated by "./mkutable -f2 Mn Me -- unicode/UnicodeData.txt" on Sun Sep 17 17:56:27 PDT 2023 */
2 { 0x0300, 0x036f }, /* Mn */
3 { 0x0483, 0x0487 }, /* Mn */
5 { 0x0591, 0x05bd }, /* Mn */
6 { 0x05bf, 0x05bf }, /* Mn */
7 { 0x05c1, 0x05c2 }, /* Mn */
8 { 0x05c4, 0x05c5 }, /* Mn */
9 { 0x05c7, 0x05c7 }, /* Mn */
10 { 0x0610, 0x061a }, /* Mn */
11 { 0x064b, 0x065f }, /* Mn */
[all...]
/freebsd/stand/libsa/
H A Dzalloc.c91 MemNode *mn; in znalloc() local
111 for (pmn = &mp->mp_First; (mn = *pmn) != NULL; pmn = &mn->mr_Next) { in znalloc()
112 char *ptr = (char *)mn; in znalloc()
121 if (bytes + extra > mn->mr_Bytes) in znalloc()
133 new->mr_Next = mn->mr_Next; in znalloc()
134 new->mr_Bytes = mn->mr_Bytes - extra; in znalloc()
137 mn->mr_Bytes = extra; in znalloc()
138 mn->mr_Next = new; in znalloc()
148 if (mn->mr_Bytes == bytes) { in znalloc()
149 *pmn = mn->mr_Next; in znalloc()
[all …]
/freebsd/crypto/heimdal/lib/gssapi/mech/
H A Dgss_names.c37 struct _gss_mechanism_name *mn; in _gss_find_mn() local
41 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { in _gss_find_mn()
42 if (gss_oid_equal(mech, mn->gmn_mech_oid)) in _gss_find_mn()
46 if (!mn) { in _gss_find_mn()
49 * MN but it is from a different mech), give up now. in _gss_find_mn()
58 mn = malloc(sizeof(struct _gss_mechanism_name)); in _gss_find_mn()
59 if (!mn) in _gss_find_mn()
66 &mn->gmn_name); in _gss_find_mn()
69 free(mn); in _gss_find_mn()
73 mn->gmn_mech = m; in _gss_find_mn()
[all …]
H A Dgss_pname_to_uid.c37 struct _gss_mechanism_name *mn, in mech_pname_to_uid() argument
44 if (mn->gmn_mech->gm_pname_to_uid == NULL) in mech_pname_to_uid()
47 major_status = mn->gmn_mech->gm_pname_to_uid(minor_status, in mech_pname_to_uid()
48 mn->gmn_name, in mech_pname_to_uid()
49 mn->gmn_mech_oid, in mech_pname_to_uid()
52 _gss_mg_error(mn->gmn_mech, major_status, *minor_status); in mech_pname_to_uid()
59 struct _gss_mechanism_name *mn, in attr_pname_to_uid() argument
71 if (mn->gmn_mech->gm_get_name_attribute == NULL) in attr_pname_to_uid()
86 major_status = mn->gmn_mech->gm_get_name_attribute(minor_status, in attr_pname_to_uid()
87 mn->gmn_name, in attr_pname_to_uid()
[all …]
H A Dgss_canonicalize_name.c33 * mechanism specific Mechanism Name (MN).
38 * mechanism is specified, the resulting MN type is a
63 struct _gss_mechanism_name *mn; in gss_canonicalize_name() local
70 major_status = _gss_find_mn(minor_status, name, mech_type, &mn); in gss_canonicalize_name()
74 m = mn->gmn_mech; in gss_canonicalize_name()
76 mn->gmn_name, mech_type, &new_canonical_name); in gss_canonicalize_name()
83 * Now we make a new name and mark it as an MN. in gss_canonicalize_name()
94 mn = malloc(sizeof(struct _gss_mechanism_name)); in gss_canonicalize_name()
95 if (!mn) { in gss_canonicalize_name()
103 mn->gmn_mech = m; in gss_canonicalize_name()
[all …]
H A Dgss_inquire_cred.c57 struct _gss_mechanism_name *mn; in gss_inquire_cred() local
110 mn = malloc(sizeof(struct _gss_mechanism_name)); in gss_inquire_cred()
111 if (!mn) { in gss_inquire_cred()
116 mn->gmn_mech = mc->gmc_mech; in gss_inquire_cred()
117 mn->gmn_mech_oid = mc->gmc_mech_oid; in gss_inquire_cred()
118 mn->gmn_name = mc_name; in gss_inquire_cred()
119 HEIM_SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link); in gss_inquire_cred()
146 mn = malloc( in gss_inquire_cred()
148 if (!mn) { in gss_inquire_cred()
153 mn->gmn_mech = &m->gm_mech; in gss_inquire_cred()
[all …]
H A Dgss_import_name.c137 * Now we make a new name and mark it as an MN. in _gss_import_export_name()
182 struct _gss_mechanism_name *mn; in gss_import_name() local
206 * the mechanism and then import it as an MN. See RFC 2743 in gss_import_name()
250 mn = malloc(sizeof(struct _gss_mechanism_name)); in gss_import_name()
251 if (!mn) { in gss_import_name()
261 &mn->gmn_name); in gss_import_name()
264 free(mn); in gss_import_name()
268 mn->gmn_mech = &m->gm_mech; in gss_import_name()
269 mn->gmn_mech_oid = &m->gm_mech_oid; in gss_import_name()
270 HEIM_SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link); in gss_import_name()
[all …]
H A Dgss_duplicate_name.c39 struct _gss_mechanism_name *mn; in gss_duplicate_name() local
56 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { in gss_duplicate_name()
59 mn->gmn_mech_oid, &mn2); in gss_duplicate_name()
71 HEIM_SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { in gss_duplicate_name()
79 new_mn->gmn_mech = mn->gmn_mech; in gss_duplicate_name()
80 new_mn->gmn_mech_oid = mn->gmn_mech_oid; in gss_duplicate_name()
83 mn->gmn_mech->gm_duplicate_name(minor_status, in gss_duplicate_name()
84 mn->gmn_name, &new_mn->gmn_name); in gss_duplicate_name()
H A Dgss_acquire_cred_ext.c36 const struct _gss_mechanism_name *mn, in _gss_acquire_mech_cred() argument
64 mn->gmn_name, in _gss_acquire_mech_cred()
80 mn->gmn_name, in _gss_acquire_mech_cred()
90 mn->gmn_name, in _gss_acquire_mech_cred()
153 struct _gss_mechanism_name *mn = NULL; in _gss_acquire_cred_ext() local
163 &mechs->elements[i], &mn); in _gss_acquire_cred_ext()
167 desired_mech_name = mn->gmn_name; in _gss_acquire_cred_ext()
170 major_status = _gss_acquire_mech_cred(minor_status, m, mn, in _gss_acquire_cred_ext()
H A Dgss_export_name.c37 struct _gss_mechanism_name *mn; in gss_export_name() local
46 mn = HEIM_SLIST_FIRST(&name->gn_mn); in gss_export_name()
47 if (!mn) { in gss_export_name()
52 return mn->gmn_mech->gm_export_name(minor_status, in gss_export_name()
53 mn->gmn_name, exported_name); in gss_export_name()
H A Dgss_inquire_cred_by_mech.c44 gss_name_t mn; in gss_inquire_cred_by_mech() local
74 &mn, initiator_lifetime, acceptor_lifetime, cred_usage); in gss_inquire_cred_by_mech()
81 name = _gss_make_name(m, mn); in gss_inquire_cred_by_mech()
83 m->gm_release_name(minor_status, &mn); in gss_inquire_cred_by_mech()
88 m->gm_release_name(minor_status, &mn); in gss_inquire_cred_by_mech()
H A Dgss_release_name.c62 struct _gss_mechanism_name *mn; in gss_release_name() local
63 mn = HEIM_SLIST_FIRST(&name->gn_mn); in gss_release_name()
65 mn->gmn_mech->gm_release_name(minor_status, in gss_release_name()
66 &mn->gmn_name); in gss_release_name()
67 free(mn); in gss_release_name()
/freebsd/lib/libgssapi/
H A Dgss_names.c187 struct _gss_mechanism_name *mn; in _gss_find_mn() local
191 SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { in _gss_find_mn()
192 if (gss_oid_equal(mech, mn->gmn_mech_oid)) in _gss_find_mn()
196 if (!mn) { in _gss_find_mn()
199 * MN but it is from a different mech), give up now. in _gss_find_mn()
208 mn = malloc(sizeof(struct _gss_mechanism_name)); in _gss_find_mn()
209 if (!mn) in _gss_find_mn()
216 &mn->gmn_name); in _gss_find_mn()
219 free(mn); in _gss_find_mn()
223 mn->gmn_mech = m; in _gss_find_mn()
[all …]
H A Dgss_canonicalize_name.c45 struct _gss_mechanism_name *mn; in gss_canonicalize_name() local
52 major_status = _gss_find_mn(minor_status, name, mech_type, &mn); in gss_canonicalize_name()
56 m = mn->gmn_mech; in gss_canonicalize_name()
58 mn->gmn_name, mech_type, &new_canonical_name); in gss_canonicalize_name()
65 * Now we make a new name and mark it as an MN. in gss_canonicalize_name()
76 mn = malloc(sizeof(struct _gss_mechanism_name)); in gss_canonicalize_name()
77 if (!mn) { in gss_canonicalize_name()
85 mn->gmn_mech = m; in gss_canonicalize_name()
86 mn->gmn_mech_oid = &m->gm_mech_oid; in gss_canonicalize_name()
87 mn->gmn_name = new_canonical_name; in gss_canonicalize_name()
[all …]
H A Dgss_inquire_cred.c64 struct _gss_mechanism_name *mn; in gss_inquire_cred() local
118 mn = malloc(sizeof(struct _gss_mechanism_name)); in gss_inquire_cred()
119 if (!mn) { in gss_inquire_cred()
124 mn->gmn_mech = mc->gmc_mech; in gss_inquire_cred()
125 mn->gmn_mech_oid = mc->gmc_mech_oid; in gss_inquire_cred()
126 mn->gmn_name = mc_name; in gss_inquire_cred()
127 SLIST_INSERT_HEAD(&name->gn_mn, mn, gmn_link); in gss_inquire_cred()
154 mn = malloc( in gss_inquire_cred()
156 if (!mn) { in gss_inquire_cred()
161 mn->gmn_mech = m; in gss_inquire_cred()
[all …]
H A Dgss_duplicate_name.c44 struct _gss_mechanism_name *mn; in gss_duplicate_name() local
61 SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { in gss_duplicate_name()
64 mn->gmn_mech_oid, &mn2); in gss_duplicate_name()
76 SLIST_FOREACH(mn, &name->gn_mn, gmn_link) { in gss_duplicate_name()
84 new_mn->gmn_mech = mn->gmn_mech; in gss_duplicate_name()
85 new_mn->gmn_mech_oid = mn->gmn_mech_oid; in gss_duplicate_name()
88 mn->gmn_mech->gm_duplicate_name(minor_status, in gss_duplicate_name()
89 mn->gmn_name, &new_mn->gmn_name); in gss_duplicate_name()
H A Dgss_export_name.c41 struct _gss_mechanism_name *mn; in gss_export_name() local
50 mn = SLIST_FIRST(&name->gn_mn); in gss_export_name()
51 if (!mn) { in gss_export_name()
56 return mn->gmn_mech->gm_export_name(minor_status, in gss_export_name()
57 mn->gmn_name, exported_name); in gss_export_name()
H A Dgss_release_name.c47 struct _gss_mechanism_name *mn; in gss_release_name() local
48 mn = SLIST_FIRST(&name->gn_mn); in gss_release_name()
50 mn->gmn_mech->gm_release_name(minor_status, in gss_release_name()
51 &mn->gmn_name); in gss_release_name()
52 free(mn); in gss_release_name()
H A Dgss_inquire_cred_by_mech.c48 gss_name_t mn; in gss_inquire_cred_by_mech() local
78 &mn, initiator_lifetime, acceptor_lifetime, cred_usage); in gss_inquire_cred_by_mech()
85 name = _gss_make_name(m, mn); in gss_inquire_cred_by_mech()
87 m->gm_release_name(minor_status, &mn); in gss_inquire_cred_by_mech()
92 m->gm_release_name(minor_status, &mn); in gss_inquire_cred_by_mech()
/freebsd/contrib/llvm-project/llvm/lib/Target/M68k/
H A DM68kInstrShiftRotate.td55 class MxSR_DD<string MN, MxType TYPE, SDNode NODE, bit RODI, bits<2> ROOP>
57 MN#"."#TYPE.Prefix#"\t$opd, $dst",
64 class MxSR_DI<string MN, MxType TYPE, SDNode NODE, bit RODI, bits<2> ROOP>
67 MN#"."#TYPE.Prefix#"\t$opd, $dst",
75 multiclass MxSROp<string MN, SDNode NODE, bit RODI, bits<2> ROOP> {
80 def NAME#"8dd" : MxSR_DD<MN, MxType8d, NODE, RODI, ROOP>;
81 def NAME#"16dd" : MxSR_DD<MN, MxType16d, NODE, RODI, ROOP>;
82 def NAME#"32dd" : MxSR_DD<MN, MxType32d, NODE, RODI, ROOP>;
84 def NAME#"8di" : MxSR_DI<MN, MxType8d, NODE, RODI, ROOP>;
85 def NAME#"16di" : MxSR_DI<MN, MxType16d, NODE, RODI, ROOP>;
[all …]
H A DM68kInstrArithmetic.td68 class MxBiArOp_R_RR_xEA<string MN, SDNode NODE, MxType DST_TYPE, MxType SRC_TYPE,
71 MN#"."#DST_TYPE.Prefix#"\t$opd, $dst",
89 class MxBiArOp_R_RR_EAd<string MN, SDNode NODE, MxType TYPE, bits<4> CMD>
91 MN#"."#TYPE.Prefix#"\t$opd, $dst",
102 class MxBiArOp_R_RM<string MN, SDNode NODE, MxType TYPE, MxOperand OPD, ComplexPattern PAT,
105 MN#"."#TYPE.Prefix#"\t$opd, $dst",
130 class MxBiArOp_R_RI_xEA<string MN, SDNode NODE, MxType TYPE, bits<4> CMD>
132 MN#"."#TYPE.Prefix#"\t$opd, $dst",
145 class MxBiArOp_R_RI<string MN, SDNode NODE, MxType TYPE, bits<4> CMD>
147 MN#"i."#TYPE.Prefix#"\t$opd, $dst",
[all …]
/freebsd/sys/ofed/drivers/infiniband/core/
H A Dib_umem_odp.c141 static void ib_umem_notifier_release(struct mmu_notifier *mn, in ib_umem_notifier_release() argument
144 struct ib_ucontext *context = container_of(mn, struct ib_ucontext, mn); in ib_umem_notifier_release()
167 static void ib_umem_notifier_invalidate_page(struct mmu_notifier *mn, in ib_umem_notifier_invalidate_page() argument
171 struct ib_ucontext *context = container_of(mn, struct ib_ucontext, mn); in ib_umem_notifier_invalidate_page()
193 static void ib_umem_notifier_invalidate_range_start(struct mmu_notifier *mn, in ib_umem_notifier_invalidate_range_start() argument
198 struct ib_ucontext *context = container_of(mn, struct ib_ucontext, mn); in ib_umem_notifier_invalidate_range_start()
218 static void ib_umem_notifier_invalidate_range_end(struct mmu_notifier *mn, in ib_umem_notifier_invalidate_range_end() argument
223 struct ib_ucontext *context = container_of(mn, struct ib_ucontext, mn); in ib_umem_notifier_invalidate_range_end()
311 INIT_HLIST_NODE(&context->mn.hlist); in ib_umem_odp_get()
312 context->mn.ops = &ib_umem_notifiers; in ib_umem_odp_get()
[all …]
/freebsd/contrib/netbsd-tests/lib/libc/regex/data/
H A Dcomplex.in20 [ab][cd][ef][gh][ij][kl][mn] - xacegikmoq acegikm
21 [ab][cd][ef][gh][ij][kl][mn][op] - xacegikmoq acegikmo
22 [ab][cd][ef][gh][ij][kl][mn][op][qr] - xacegikmoqy acegikmoq
23 [ab][cd][ef][gh][ij][kl][mn][op][q] - xacegikmoqy acegikmoq

12345678