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

1 2 3

  /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);
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);
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...]
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...]
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...]
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
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
  /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.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++)
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])
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)) {
pcnfsd_v2.c 448 __aconst char *__aconst *members; local
459 for (members = grp->gr_mem; members && *members; members++) {
460 if (!strcmp(*members, uname)) {
  /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
symbol.h 97 ASN1_TAILQ_ENTRY(member) members; member in struct:member
128 struct memhead *members; member in struct:type
  /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...]
  /src/external/public-domain/sqlite/dist/autosetup/
cc.tcl 191 # @cc-check-members type.member ...
193 # Checks that the given type/structure members exist.
195 proc cc-check-members {args} {

Completed in 41 milliseconds

1 2 3