Home
last modified time | relevance | path

Searched refs:members (Results 1 – 25 of 561) sorted by relevance

12345678910>>...23

/netbsd/src/crypto/external/bsd/heimdal/dist/lib/asn1/
Dgen_glue.c57 ASN1_TAILQ_FOREACH(m, t->members, members) { in generate_2int()
81 if(t->members) { in generate_int2()
82 ASN1_TAILQ_FOREACH(m, t->members, members) { in generate_int2()
116 if(t->members) { in generate_units()
117 ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) { in generate_units()
149 if (!ASN1_TAILQ_EMPTY(t->members)) { in generate_glue()
Dasn1parse.c349 struct memhead *members; member
1853 (yyval.type)->members = (yyvsp[-1].members); in yyparse()
1862 (yyval.members) = emalloc(sizeof(*(yyval.members))); in yyparse()
1863 ASN1_TAILQ_INIT((yyval.members)); in yyparse()
1864 ASN1_TAILQ_INSERT_HEAD((yyval.members), (yyvsp[0].member), members); in yyparse()
1872 … ASN1_TAILQ_INSERT_TAIL((yyvsp[-2].members), (yyvsp[0].member), members); in yyparse()
1873 (yyval.members) = (yyvsp[-2].members); in yyparse()
1880 { (yyval.members) = (yyvsp[-2].members); } in yyparse()
1903 (yyval.type)->members = (yyvsp[-1].members); in yyparse()
1913 (yyval.type)->members = emalloc(sizeof(*(yyval.type)->members)); in yyparse()
[all …]
Dasn1parse.y85 struct memhead *members; member
220 %type <members> ComponentTypeList
221 %type <members> Enumerations
222 %type <members> NamedBitList
223 %type <members> NamedNumberList
412 $$->members = $3;
421 ASN1_TAILQ_INSERT_HEAD($$, $1, members);
425 ASN1_TAILQ_INSERT_TAIL($1, $3, members);
448 $$->members = $3;
459 $$->members = emalloc(sizeof(*$$->members));
[all …]
Dgen.c534 struct member *n = ASN1_TAILQ_NEXT(m, members); in last_member_p()
537 if (n->ellipsis && ASN1_TAILQ_NEXT(n, members) == NULL) in last_member_p()
546 ASN1_TAILQ_FOREACH(m, t->members, members) { in have_ellipsis()
561 if(t->members == NULL) { in define_asn1()
570 ASN1_TAILQ_FOREACH(m, t->members, members) { in define_asn1()
594 ASN1_TAILQ_FOREACH(m, t->members, members) { in define_asn1()
615 ASN1_TAILQ_FOREACH(m, t->members, members) { in define_asn1()
621 ASN1_TAILQ_FOREACH(m, t->members, members) { in define_asn1()
737 if(t->members) { in define_type()
740 ASN1_TAILQ_FOREACH(m, t->members, members) { in define_type()
[all …]
Dgen_encode.c123 if(t->members) { in encode_type()
158 if (ASN1_TAILQ_EMPTY(t->members)) { in encode_type()
171 pos = t->members->prev->val; in encode_type()
183 pos = ASN1_TAILQ_LAST(t->members, memhead)->val; in encode_type()
189 ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) { in encode_type()
261 if (t->members == NULL) in encode_type()
264 ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) { in encode_type()
409 if (t->members == NULL) in encode_type()
418 ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) { in encode_type()
Dgen_template.c53 if (t->members) in integer_symbol()
159 if (t->members) in bitstring_symbol()
251 ASN1_TAILQ_ENTRY(template) members;
302 ASN1_TAILQ_FOREACH(q, &tl->template, members) { in tlist_count()
323 ASN1_TAILQ_FOREACH(q, &tl->template, members) { in tlist_print()
363 ASN1_TAILQ_FOREACH(t, &tl->template, members) { in tlist_cmp()
380 q = ASN1_TAILQ_NEXT(q, members); in tlist_cmp()
415 ASN1_TAILQ_INSERT_TAIL(t, q, members); in add_line()
509 if (t->members) in template_members()
580 if (ASN1_TAILQ_EMPTY(t->members)) { in template_members()
[all …]
Dgen_decode.c246 if(t->members) { in decode_type()
302 if (ASN1_TAILQ_EMPTY(t->members)) { in decode_type()
312 ASN1_TAILQ_FOREACH(m, t->members, members) { in decode_type()
332 if (t->members == NULL) in decode_type()
335 ASN1_TAILQ_FOREACH(m, t->members, members) { in decode_type()
355 if(t->members == NULL) in decode_type()
369 ASN1_TAILQ_FOREACH(m, t->members, members) { in decode_type()
400 ASN1_TAILQ_FOREACH(m, t->members, members) { in decode_type()
576 if (t->members == NULL) in decode_type()
579 ASN1_TAILQ_FOREACH(m, t->members, members) { in decode_type()
Dgen_length.c77 if(t->members) { in length_type()
107 if (ASN1_TAILQ_EMPTY(t->members)) in length_type()
112 int pos = ASN1_TAILQ_LAST(t->members, memhead)->val; in length_type()
116 ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) { in length_type()
138 if (t->members == NULL) in length_type()
144 ASN1_TAILQ_FOREACH(m, t->members, members) { in length_type()
Dgen_free.c57 if (t->range == NULL && t->members == NULL) { in free_type()
76 if (ASN1_TAILQ_EMPTY(t->members)) in free_type()
87 if (t->members == NULL) in free_type()
96 ASN1_TAILQ_FOREACH(m, t->members, members) { in free_type()
Dgen_copy.c63 if (t->range == NULL && t->members == NULL) { in copy_type()
76 if (ASN1_TAILQ_EMPTY(t->members)) in copy_type()
86 if(t->members == NULL) in copy_type()
104 ASN1_TAILQ_FOREACH(m, t->members, members) { in copy_type()
/netbsd/src/external/gpl3/gcc/dist/gcc/
Dsparseset.h92 SPARSESET_ELT_TYPE members; /* Number of elements. */ member
115 s->members = 0; in sparseset_clear()
124 return s->members; in sparseset_cardinality()
146 return idx < s->members && s->dense[idx] == e; in sparseset_bit_p()
166 sparseset_insert_bit (s, e, s->members++); in sparseset_set_bit()
174 SPARSESET_ELT_TYPE mem = s->members; in sparseset_pop()
178 s->members = mem - 1; in sparseset_pop()
179 return s->dense[s->members]; in sparseset_pop()
193 if (s->iterating && s->iter < s->members) in sparseset_iter_p()
Dipa-icf.cc2313 gcc_assert (cls->members.length ()); in add_class()
2316 = get_group_by_hash (cls->members[0]->get_hash (), in add_class()
2317 cls->members[0]->type); in add_class()
2527 item->index_in_class = cls->members.length (); in add_item_to_class()
2528 cls->members.safe_push (item); in add_item_to_class()
2688 if (m_items[i]->cls->members.length () > 1) in parse_nonsingleton_classes()
2718 if (c->members.length() > 1) in subdivide_classes_by_equality()
2722 sem_item *first = c->members[0]; in subdivide_classes_by_equality()
2727 for (unsigned j = 1; j < c->members.length (); j++) in subdivide_classes_by_equality()
2729 sem_item *item = c->members[j]; in subdivide_classes_by_equality()
[all …]
Dsparseset.cc69 SPARSESET_ELT_TYPE mem = s->members - 1; in sparseset_clear_bit()
90 s->members = mem; in sparseset_clear_bit()
106 for (i = 0; i < s->members; i++) in sparseset_copy()
108 d->members = s->members; in sparseset_copy()
/netbsd/src/external/bsd/kyua-cli/dist/utils/fs/
Dlua_module.cpp262 std::map< std::string, lutok::cxx_function > members; in open_fs() local
263 members["basename"] = lua_fs_basename; in open_fs()
264 members["dirname"] = lua_fs_dirname; in open_fs()
265 members["exists"] = lua_fs_exists; in open_fs()
266 members["files"] = lua_fs_files; in open_fs()
267 members["is_absolute"] = lua_fs_is_absolute; in open_fs()
268 members["join"] = lua_fs_join; in open_fs()
269 lutok::create_module(s, "fs", members); in open_fs()
/netbsd/src/external/bsd/lutok/dist/
Doperations_test.cpp84 std::map< std::string, lutok::cxx_function > members; in ATF_TEST_CASE_BODY() local
85 lutok::create_module(state, "my_math", members); in ATF_TEST_CASE_BODY()
98 std::map< std::string, lutok::cxx_function > members; in ATF_TEST_CASE_BODY() local
99 members["add"] = hook_add; in ATF_TEST_CASE_BODY()
100 lutok::create_module(state, "my_math", members); in ATF_TEST_CASE_BODY()
112 std::map< std::string, lutok::cxx_function > members; in ATF_TEST_CASE_BODY() local
113 members["add"] = hook_add; in ATF_TEST_CASE_BODY()
114 members["multiply"] = hook_multiply; in ATF_TEST_CASE_BODY()
115 members["add2"] = hook_add; in ATF_TEST_CASE_BODY()
116 lutok::create_module(state, "my_math", members); in ATF_TEST_CASE_BODY()
Doperations.cpp46 const std::map< std::string, cxx_function >& members) in create_module()
51 iter = members.begin(); iter != members.end(); iter++) { in create_module()
/netbsd/src/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/
Dimplref-struct.exp137 set members [get_valueof "" ${var} ""]
140 set members [string trim ${members}]
141 set members [string trim ${members} "{}"]
143 return ${members}
/netbsd/src/usr.bin/make/
Darch.c138 HashTable members; /* All the members of the archive described member
158 HashIter_Init(&hi, &a->members); in ArchFree()
164 HashTable_Done(&a->members); in ArchFree()
325 StringList members = LST_INIT; in Arch_ParseArchive() local
326 SearchPath_Expand(&dirSearchPath, mem.str, &members); in Arch_ParseArchive()
328 while (!Lst_IsEmpty(&members)) { in Arch_ParseArchive()
329 char *member = Lst_Dequeue(&members); in Arch_ParseArchive()
339 Lst_Done(&members); in Arch_ParseArchive()
392 hdr = HashTable_FindValue(&ar->members, member); in ArchStatMember()
403 hdr = HashTable_FindValue(&ar->members, copy); in ArchStatMember()
[all …]
/netbsd/src/external/bsd/openldap/dist/contrib/slapd-modules/nssov/
Dgroup.c145 struct berval *names,*gids,*members; in write_group() local
203 … members = cbp->op->o_tmpalloc( (i+1) * sizeof(struct berval), cbp->op->o_tmpmemctx ); in write_group()
208 … ber_dupbv_x(&members[j],&a->a_vals[i],cbp->op->o_tmpmemctx); in write_group()
216 … if (nssov_dn2uid(cbp->op,cbp->ni,&a->a_nvals[i],&members[j])) in write_group()
221 BER_BVZERO(&members[j]); in write_group()
223 members=NULL; in write_group()
228 members=NULL; in write_group()
263 WRITE_BERVAL(cbp->fp,&members[k]); in write_group()
270 if (members!=NULL) in write_group()
271 ber_bvarray_free_x( members, cbp->op->o_tmpmemctx ); in write_group()
Dalias.c55 struct berval *names, *members; in write_alias() local
81 members = &empty; in write_alias()
83 members = a->a_vals; in write_alias()
90 WRITE_BVARRAY(cbp->fp,members); in write_alias()
/netbsd/src/external/bsd/wpa/dist/src/p2p/
Dp2p_group.c37 struct p2p_group_member *members; member
87 m = group->members; in p2p_group_free_members()
88 group->members = NULL; in p2p_group_free_members()
382 m = group->members; in wifi_display_build_go_ie()
425 for (m = group->members; m; m = m->next) { in p2p_buf_add_group_info()
458 if (group->members) in p2p_group_build_probe_resp_ie()
579 m = group->members; in p2p_group_remove_member()
594 group->members = m->next; in p2p_group_remove_member()
628 m->next = group->members; in p2p_group_notif_assoc()
629 group->members = m; in p2p_group_notif_assoc()
[all …]
/netbsd/src/lib/libpthread/
Dshlib_version8 # clean out unused and abused members.
10 # add spare members.
12 # add members to deal with inter-process synch and priority inheritance.
/netbsd/src/distrib/utils/libhack/
Dgetgrent.c107 static __aconst char *members[MAXGRP]; variable
309 for (_gr_group.gr_mem = m = members;; bp++) { in grmatchline()
310 if (m == &members[MAXGRP - 1]) in grmatchline()
329 for (m = members; *m; m++) in grmatchline()
/netbsd/src/usr.sbin/rpc.pcnfsd/
Dpcnfsd_v2.c448 __aconst char *__aconst *members; in fillin_extra_groups() local
459 for (members = grp->gr_mem; members && *members; members++) { in fillin_extra_groups()
460 if (!strcmp(*members, uname)) { in fillin_extra_groups()
/netbsd/src/external/bsd/openldap/dist/doc/drafts/
Ddraft-haripriya-dynamicgroup-xx.txt98 6.2.1. Managing the static members of a dynamic group . . . . 16
257 are the actual members. This solution is more scalable and reduces
293 that they are able to use static groups for listing members and
491 For the purpose of evaluating dynamic members, the directory server
496 start the search for dynamic members. The scope specifies the scope
497 with respect to the dn in which to search for dynamic members. The
513 to other servers while searching for dynamic members. When x-chain
514 is absent, the dynamic members computed will be only those that are
523 members of the dynamic group will be the union of the members
544 static group, the static or dynamic members of M SHALL NOT be
[all …]

12345678910>>...23