HomeSort by: relevance | last modified time | path
    Searched refs:members (Results 1 - 25 of 141) sorted by relevancy

1 2 3 4 5 6

  /src/crypto/external/bsd/heimdal/dist/lib/asn1/
gen_glue.c 57 ASN1_TAILQ_FOREACH(m, t->members, members) {
81 if(t->members) {
82 ASN1_TAILQ_FOREACH(m, t->members, members) {
116 if(t->members) {
117 ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) {
149 if (!ASN1_TAILQ_EMPTY(t->members)) {
gen_free.c 57 if (t->range == NULL && t->members == NULL) {
76 if (ASN1_TAILQ_EMPTY(t->members))
87 if (t->members == NULL)
96 ASN1_TAILQ_FOREACH(m, t->members, members) {
gen_encode.c 123 if(t->members) {
158 if (ASN1_TAILQ_EMPTY(t->members)) {
171 pos = t->members->prev->val;
183 pos = ASN1_TAILQ_LAST(t->members, memhead)->val;
189 ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) {
261 if (t->members == NULL)
264 ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) {
409 if (t->members == NULL
    [all...]
gen_length.c 77 if(t->members) {
107 if (ASN1_TAILQ_EMPTY(t->members))
112 int pos = ASN1_TAILQ_LAST(t->members, memhead)->val;
116 ASN1_TAILQ_FOREACH_REVERSE(m, t->members, memhead, members) {
138 if (t->members == NULL)
144 ASN1_TAILQ_FOREACH(m, t->members, members) {
asn1parse.c 349 struct memhead *members; member in union:YYSTYPE
1853 (yyval.type)->members = (yyvsp[-1].members);
1862 (yyval.members) = emalloc(sizeof(*(yyval.members)));
1863 ASN1_TAILQ_INIT((yyval.members));
1864 ASN1_TAILQ_INSERT_HEAD((yyval.members), (yyvsp[0].member), members);
1872 ASN1_TAILQ_INSERT_TAIL((yyvsp[-2].members), (yyvsp[0].member), members);
    [all...]
gen.c 534 struct member *n = ASN1_TAILQ_NEXT(m, members);
537 if (n->ellipsis && ASN1_TAILQ_NEXT(n, members) == NULL)
546 ASN1_TAILQ_FOREACH(m, t->members, members) {
561 if(t->members == NULL) {
570 ASN1_TAILQ_FOREACH(m, t->members, members) {
594 ASN1_TAILQ_FOREACH(m, t->members, members) {
615 ASN1_TAILQ_FOREACH(m, t->members, members)
    [all...]
asn1parse.y 85 struct memhead *members;
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...]
symbol.h 97 ASN1_TAILQ_ENTRY(member) members; member in struct:member
128 struct memhead *members; member in struct:type
gen_decode.c 246 if(t->members) {
302 if (ASN1_TAILQ_EMPTY(t->members)) {
312 ASN1_TAILQ_FOREACH(m, t->members, members) {
332 if (t->members == NULL)
335 ASN1_TAILQ_FOREACH(m, t->members, members) {
355 if(t->members == NULL)
359 fprintf(codefile, "unsigned int members = 0;\n");
369 ASN1_TAILQ_FOREACH(m, t->members, members)
    [all...]
gen_template.c 53 if (t->members)
159 if (t->members)
251 ASN1_TAILQ_ENTRY(template) members;
302 ASN1_TAILQ_FOREACH(q, &tl->template, members) {
323 ASN1_TAILQ_FOREACH(q, &tl->template, members) {
363 ASN1_TAILQ_FOREACH(t, &tl->template, members) {
380 q = ASN1_TAILQ_NEXT(q, members);
415 ASN1_TAILQ_INSERT_TAIL(t, q, members);
509 if (t->members)
580 if (ASN1_TAILQ_EMPTY(t->members)) {
    [all...]
  /src/external/gpl3/gcc/dist/gcc/
sparseset.h 31 fixed-size universe. Two vectors are used to store the members of
48 the members in O(N) time, where n is the number of members in the set.
49 The members of the set are stored cache-friendly in the dense vector.
81 over the members in the set is cache-friendly because only the dense
92 SPARSESET_ELT_TYPE members; /* Number of elements. */ member in struct:sparseset_def
115 s->members = 0;
124 return s->members;
146 return idx < s->members && s->dense[idx] == e;
166 sparseset_insert_bit (s, e, s->members++)
    [all...]
sparseset.cc 49 Assumes idx1 < s->members and idx2 < s->members. */
69 SPARSESET_ELT_TYPE mem = s->members - 1;
87 in the dense array and then decrement s->members, effectively
90 s->members = mem;
106 for (i = 0; i < s->members; i++)
108 d->members = s->members;
  /src/external/gpl3/gcc.old/dist/gcc/
sparseset.h 31 fixed-size universe. Two vectors are used to store the members of
48 the members in O(N) time, where n is the number of members in the set.
49 The members of the set are stored cache-friendly in the dense vector.
81 over the members in the set is cache-friendly because only the dense
92 SPARSESET_ELT_TYPE members; /* Number of elements. */ member in struct:sparseset_def
115 s->members = 0;
124 return s->members;
146 return idx < s->members && s->dense[idx] == e;
166 sparseset_insert_bit (s, e, s->members++)
    [all...]
sparseset.cc 49 Assumes idx1 < s->members and idx2 < s->members. */
69 SPARSESET_ELT_TYPE mem = s->members - 1;
87 in the dense array and then decrement s->members, effectively
90 s->members = mem;
106 for (i = 0; i < s->members; i++)
108 d->members = s->members;
  /src/external/gpl3/gcc.old/dist/gcc/d/dmd/
nspace.d 71 extern (D) this(const ref Loc loc, Identifier ident, Expression identExp, Dsymbols* members)
75 this.members = members;
90 if (members)
108 members.foreachDsymbol(s => s.addMember(sc, this));
116 if (members)
122 members.foreachDsymbol(s => s.setScope(sc));
133 if (!members || !symtab) // opaque or semantic() is not yet called
146 return members.foreachDsymbol( (s) { return s.hasPointers(); } ) != 0;
154 members.foreachDsymbol( s => s.setFieldOffset(ad, fieldState, isunion) )
    [all...]
  /src/external/bsd/kyua-cli/dist/utils/fs/
lua_module.cpp 262 std::map< std::string, lutok::cxx_function > members; local
263 members["basename"] = lua_fs_basename;
264 members["dirname"] = lua_fs_dirname;
265 members["exists"] = lua_fs_exists;
266 members["files"] = lua_fs_files;
267 members["is_absolute"] = lua_fs_is_absolute;
268 members["join"] = lua_fs_join;
269 lutok::create_module(s, "fs", members);
  /src/external/bsd/openldap/dist/contrib/slapd-modules/nssov/
alias.c 55 struct berval *names, *members; local
77 /* get the members of the alias */
81 members = &empty;
83 members = a->a_vals;
90 WRITE_BVARRAY(cbp->fp,members);
group.c 145 struct berval *names,*gids,*members; local
192 /* get group members (memberUid&uniqueMember) */
203 members = cbp->op->o_tmpalloc( (i+1) * sizeof(struct berval), cbp->op->o_tmpmemctx );
208 ber_dupbv_x(&members[j],&a->a_vals[i],cbp->op->o_tmpmemctx);
216 if (nssov_dn2uid(cbp->op,cbp->ni,&a->a_nvals[i],&members[j]))
221 BER_BVZERO(&members[j]);
223 members=NULL;
228 members=NULL;
263 WRITE_BERVAL(cbp->fp,&members[k]);
270 if (members!=NULL
    [all...]
  /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/
implref-struct.exp 135 # Returns the struct members, e.g. '{a = 0, b = 1, c = 2}'.
137 set members [get_valueof "" ${var} ""]
140 set members [string trim ${members}]
141 set members [string trim ${members} "{}"]
143 return ${members}
146 # Values of the struct members.
  /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dwarf2/
implref-struct.exp 135 # Returns the struct members, e.g. '{a = 0, b = 1, c = 2}'.
137 set members [get_valueof "" ${var} ""]
140 set members [string trim ${members}]
141 set members [string trim ${members} "{}"]
143 return ${members}
146 # Values of the struct members.
  /src/external/bsd/lutok/dist/
operations_test.cpp 84 std::map< std::string, lutok::cxx_function > members; local
85 lutok::create_module(state, "my_math", members);
98 std::map< std::string, lutok::cxx_function > members; local
99 members["add"] = hook_add;
100 lutok::create_module(state, "my_math", members);
112 std::map< std::string, lutok::cxx_function > members; local
113 members["add"] = hook_add;
114 members["multiply"] = hook_multiply;
115 members["add2"] = hook_add;
116 lutok::create_module(state, "my_math", members);
    [all...]
operations.cpp 43 /// \param members The list of member functions to add to the module.
46 const std::map< std::string, cxx_function >& members)
51 iter = members.begin(); iter != members.end(); iter++) {
  /src/external/mpl/dhcp/dist/keama/tests/samples/
example.conf 104 allow members of "foo";
108 deny members of "foo";
  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
RDFDeadCode.cpp 88 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG)) {
128 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG))
129 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG))
157 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) {
158 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) {
159 for (NodeAddr<RefNode*> RA : IA.Addr->members(DFG))
198 append_range(DRNs, NodeAddr<CodeNode*>(BA).Addr->members(DFG));
  /src/external/mpl/dhcp/bin/server/
dhcpd.conf 97 allow members of "foo";
101 deny members of "foo";

Completed in 47 milliseconds

1 2 3 4 5 6