| /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 = ∅
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/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...] |
| /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...] |
| ipa-icf.h | 42 /* Dump function prints all class members to a FILE with an INDENT. */
53 /* Vector of all group members. */
54 auto_vec <sem_item *> members; member in class:ipa_icf::congruence_class
570 that members of the class reference.
624 where bitmap B splits congruence class members. DATA is used
|
| value-relation.h | 148 bitmap members; // Other members in the partial equivalency. member in class:pe_slice
|
| /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...] |
| ipa-icf.h | 42 /* Dump function prints all class members to a FILE with an INDENT. */
53 /* Vector of all group members. */
54 auto_vec <sem_item *> members; member in class:ipa_icf::congruence_class
566 that members of the class reference.
620 where bitmap B splits congruence class members. DATA is used
|
| /src/distrib/utils/libhack/ |
| getgrent.c | 107 static __aconst char *members[MAXGRP]; variable
309 for (_gr_group.gr_mem = m = members;; bp++) {
310 if (m == &members[MAXGRP - 1])
329 for (m = members; *m; m++)
|
| /src/usr.sbin/mtree/ |
| getid.c | 114 static char *members[MAXGRP]; variable
273 for (_gr_group.gr_mem = m = members;; bp++) {
274 if (m == &members[MAXGRP - 1])
|
| /src/usr.sbin/rpc.pcnfsd/ |
| pcnfsd_v2.c | 448 __aconst char *__aconst *members; local
459 for (members = grp->gr_mem; members && *members; members++) {
460 if (!strcmp(*members, uname)) {
|
| /src/usr.bin/make/ |
| arch.c | 72 * Manipulate libraries, archives and their members.
74 * The first time an archive is referenced, all of its members' headers are
138 HashTable members; /* All the members of the archive described member in struct:Arch
158 HashIter_Init(&hi, &a->members);
164 HashTable_Done(&a->members);
184 * adding nodes for the expanded members to gns. If successful, advance pp
325 StringList members = LST_INIT; local
326 SearchPath_Expand(&dirSearchPath, mem.str, &members);
328 while (!Lst_IsEmpty(&members)) {
[all...] |
| suff.c | 1248 * add those nodes to the members list.
1254 ExpandChildrenRegular(char *p, GNode *pgn, GNodeList *members)
1269 Lst_Append(members, gn);
1305 Lst_Append(members, gn);
1350 GNodeList members = LST_INIT; local
1359 (void)Arch_ParseArchive(&ap, &members, pgn);
1361 ExpandChildrenRegular(expanded, pgn, &members);
1364 /* Add all members to the parent node. */
1365 while (!Lst_IsEmpty(&members)) {
1366 GNode *gn = Lst_Dequeue(&members);
[all...] |
| /src/crypto/external/bsd/heimdal/dist/lib/asn1/ |
| symbol.h | 97 ASN1_TAILQ_ENTRY(member) members; member in struct:member
128 struct memhead *members; member in struct:type
|
| asn1parse.h | 258 struct memhead *members; member in union:YYSTYPE
|
| /src/external/bsd/libevent/dist/ |
| bufferevent-internal.h | 82 /** List of all members in the group */
83 LIST_HEAD(rlim_group_member_list, bufferevent_private) members; member in struct:bufferevent_rate_limit_group
125 /** Lock to protect the members of this group. This lock should nest
|
| /src/external/bsd/ntp/dist/sntp/libevent/ |
| bufferevent-internal.h | 82 /** List of all members in the group */
83 LIST_HEAD(rlim_group_member_list, bufferevent_private) members; member in struct:bufferevent_rate_limit_group
125 /** Lock to protect the members of this group. This lock should nest
|
| /src/external/bsd/wpa/dist/src/p2p/ |
| p2p_group.c | 37 struct p2p_group_member *members; member in struct:p2p_group
87 m = group->members;
88 group->members = NULL;
382 m = group->members;
425 for (m = group->members; m; m = m->next) {
458 if (group->members)
579 m = group->members;
594 group->members = m->next;
628 m->next = group->members;
629 group->members = m
[all...] |
| /src/external/gpl3/gcc/dist/gcc/cp/ |
| method.cc | 851 /* Assign to each of the non-static data members. */
929 /* Names of the comparison categories and their value members, to be indexed by
931 of the members. */
936 const char *members[4];
997 /* Also make sure we can look up the value members now, since we won't
1002 const char *p = comp_cat_info[tag].members[i];
1021 /* Wrapper that takes the index into the members array instead of the name. */
1026 const char *name_str = comp_cat_info[tag].members[idx];
1485 deleted if ... C has variant members. */
1554 C has variant members. *
934 const char *members[4]; member in struct:comp_cat_info_t
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/d/ |
| modules.cc | 236 destructors, unittests, members, classes, and imports for the given module.
533 for (size_t i = 0; i < decl->members->length; i++)
535 Dsymbol *member = (*decl->members)[i];
567 for (size_t i = 0; i < decl->members->length; i++)
569 Dsymbol *member = (*decl->members)[i];
733 /* Layout module members. */
734 if (decl->members)
736 for (size_t i = 0; i < decl->members->length; i++)
738 Dsymbol *s = (*decl->members)[i];
754 Dsymbols members; local
[all...] |
| d-builtins.cc | 245 /* Add both named and anonymous fields as members of the struct.
248 sdecl->members = d_gc_malloc<Dsymbols> ();
280 sdecl->members->push (vd);
532 Dsymbols *members = d_gc_malloc<Dsymbols> (); local
574 members->push (func);
586 members->push (build_alias_declaration (name, t));
602 members->push (build_alias_declaration (name, t));
616 members->push (dsym);
624 members->push (build_alias_declaration ("__builtin_va_list", tvalist));
628 members->push (ts->sym)
672 m->members->push (LinkDeclaration::create (Loc (), LINK::c, members)); local
[all...] |
| /src/external/bsd/libbind/dist/irs/ |
| irpmarshall.c | 485 char **members = NULL; local
533 members = splitarray(p, q, COMMA);
534 if (members == NULL) {
546 gr->gr_mem = members;
|
| /src/external/gpl3/gcc.old/dist/gcc/cp/ |
| method.cc | 845 /* Assign to each of the non-static data members. */
923 /* Names of the comparison categories and their value members, to be indexed by
925 of the members. */
930 const char *members[4];
991 /* Also make sure we can look up the value members now, since we won't
996 const char *p = comp_cat_info[tag].members[i];
1015 /* Wrapper that takes the index into the members array instead of the name. */
1020 const char *name_str = comp_cat_info[tag].members[idx];
1478 deleted if ... C has variant members. */
1547 C has variant members. *
928 const char *members[4]; member in struct:comp_cat_info_t
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/d/dmd/ |
| dsymbol.h | 321 Dsymbols *members; // all Dsymbol's in this scope member in class:ScopeDsymbol
322 DsymbolTable *symtab; // members[] sorted into table
|
