Searched refs:children (Results 176 - 200 of 317) sorted by relevance

1234567891011>>

/freebsd-11-stable/usr.sbin/rpc.ypxfrd/
H A Dypxfrd_main.c178 children--;
/freebsd-11-stable/contrib/bmake/
H A Dmake.h161 * 6) whether any of its children has been remade
162 * 7) the number of its children that are, as yet, unmade
166 * 11) a list of nodes on which this depends (children)
194 #define CHILDMADE 0x2 /* children of this target were made */
195 #define FORCE 0x4 /* children don't exist, and we pretend made */
220 int unmade; /* The number of unmade children */
229 Lst children; /* Nodes on which this one depends */ member in struct:GNode
282 * children was out-of-date */
283 #define OP_MADE 0x00000800 /* Assume the children of the node have
H A Darch.c1307 } else if (OP_NOP(gn->type) && Lst_IsEmpty(gn->children)) {
1309 } else if ((!Lst_IsEmpty(gn->children) && gn->cmgn == NULL) ||
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DAsmPrinterDwarf.cpp277 // Emit the DIE children if any.
279 for (auto &Child : Die.children())
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DLLVMConventionsChecker.cpp125 for (Stmt *Child : S->children())
H A DMallocSizeofChecker.cpp67 for (const Stmt *Child : S->children())
H A DCStringSyntaxChecker.cpp268 // Recurse and check children.
273 for (Stmt *Child : S->children())
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDominanceFrontierImpl.h184 for (const auto Succ : children<BlockT *>(currentBB)) {
191 // At this point, S is DFlocal. Now we union in DFup's of our children...
193 // children in the IDomTree)
207 // If all children are visited or there is any child then pop this block
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DCallGraph.cpp132 for (Stmt *SubStmt : S->children())
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonGenExtract.cpp225 for (auto *DTN : children<DomTreeNode*>(DT->getNode(B)))
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Object/
H A DArchive.h241 iterator_range<child_iterator> children(Error &Err, function in class:llvm::object::Archive
/freebsd-11-stable/contrib/subversion/subversion/libsvn_repos/
H A Dcommit.c1119 const apr_array_header_t *children,
1126 SVN_ERR(svn_editor_add_directory(eb->inner, relpath, children, props,
1187 const apr_array_header_t *children,
1194 children, props));
1113 add_directory_cb(void *baton, const char *relpath, const apr_array_header_t *children, apr_hash_t *props, svn_revnum_t replaces_rev, apr_pool_t *scratch_pool) argument
1180 alter_directory_cb(void *baton, const char *relpath, svn_revnum_t revision, const apr_array_header_t *children, apr_hash_t *props, apr_pool_t *scratch_pool) argument
/freebsd-11-stable/contrib/subversion/subversion/libsvn_wc/
H A Dwc_db_update_move.c1689 children are caught as local modifications below.*/
1735 /* Get all descendants of the node in reverse order (so children are
1821 children are caught as local modifications below.*/
1907 than a hash, to allow the driver to process children in a defined order. */
1911 apr_array_header_t **children,
1944 if (children)
1945 *children = apr_array_make(result_pool, 0, sizeof(const char *));
1955 if (children && db_kind == svn_node_dir)
1960 *children = apr_array_make(result_pool, 16, sizeof(const char *));
1970 APR_ARRAY_PUSH(*children, cons
1909 get_info(apr_hash_t **props, const svn_checksum_t **checksum, apr_array_header_t **children, svn_node_kind_t *kind, const char *local_relpath, int op_depth, svn_wc__db_wcroot_t *wcroot, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument
2391 get_working_info(apr_hash_t **props, const svn_checksum_t **checksum, apr_array_header_t **children, svn_node_kind_t *kind, const char *local_relpath, svn_wc__db_wcroot_t *wcroot, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument
[all...]
H A Dentries.c1025 const apr_array_header_t *children;
1042 SVN_ERR(svn_wc__db_read_children(&children, db,
1045 for (i = children->nelts; i--; )
1047 const char *name = APR_ARRAY_IDX(children, i, const char *);
1110 const apr_array_header_t *children;
1122 SVN_ERR(svn_wc__db_read_children(&children, db, dir_abspath,
1124 for (i = children->nelts; i--; )
1126 const char *child = APR_ARRAY_IDX(children, i, const char *);
2016 skel = skel->children;
1024 const apr_array_header_t *children; local
1109 const apr_array_header_t *children; local
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-size/
H A Dllvm-size.cpp553 for (auto &C : a->children(Err)) {
622 for (auto &C : UA->children(Err)) {
711 for (auto &C : UA->children(Err)) {
787 for (auto &C : UA->children(Err)) {
/freebsd-11-stable/contrib/gcc/
H A Dalias.c136 /* The children of the alias set. These are not just the immediate
137 children, but, in fact, all descendants. So, if we have:
141 continuing our example above, the children here will be all of
143 splay_tree GTY((param1_is (int), param2_is (int))) children;
315 || splay_tree_lookup (ase->children,
323 || splay_tree_lookup (ase->children,
678 superset_entry->children
689 /* If there is an entry for the subset, enter all of its children
690 (if they are not already present) as children of the SUPERSET. */
696 splay_tree_foreach (subset_entry->children, insert_subset_childre
[all...]
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/SymbolFile/PDB/
H A DPDBASTParser.cpp427 auto children = udt->findAllChildren(); local
428 if (!children || children->getChildCount() == 0) {
840 // children list.
1087 if (auto children = symbol->findAllChildren())
1088 while (auto child = children->getNext())
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/
H A DStmt.cpp204 (void) is_good(implements_children(&type::children))
224 Stmt::child_range Stmt::children() { function in class:Stmt
230 return static_cast<type*>(this)->children();
1289 Stmt::child_range CapturedStmt::children() { function in class:CapturedStmt
1294 Stmt::const_child_range CapturedStmt::children() const { function in class:CapturedStmt
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dspa.c1338 uint_t children; local
1348 &child, &children);
1359 for (int c = 0; c < children; c++) {
3657 int children = rvd->vdev_children; local
3658 int c0 = spa_get_random(children);
3660 for (int c = 0; c < children; c++) {
3661 vdev_t *vd = rvd->vdev_child[(c0 + c) % children];
5894 * children. Otherwise, vdev_inuse() will blindly overwrite the spare.
6350 * Remove vd from its parent and compact the parent's children.
6356 * Remember one of the remaining children s
6561 uint_t c, children, lastlog; local
8176 int children = rvd->vdev_children; local
[all...]
/freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/LanguageRuntime/RenderScript/RenderScriptRuntime/
H A DRenderScriptRuntime.cpp562 std::vector<Element> children; // Child Element fields for structs member in struct:RenderScriptRuntime::Element
615 // ElementHeader's children, each struct is immediately followed by a
618 // 4 bytes in size, and the 0 offset signifies no more children.
2082 elem.children.push_back(child);
2115 if (alloc->element.children.size() > 0) {
2256 if (num_children > elem.children.size() || num_children == 0)
2259 // Iterate over children looking for members with matching field names. If
2261 // TODO: This could be made more robust by also checking children data
2266 if (!child || (child->GetName() != elem.children[i].type_name)) {
2274 if (found && num_children < elem.children
[all...]
/freebsd-11-stable/contrib/binutils/binutils/
H A Ddwarf.c316 int children; member in struct:abbrev_entry
352 add_abbrev (unsigned long number, unsigned long tag, int children) argument
364 entry->children = children;
417 int children; local
431 children = *start++;
433 add_abbrev (entry, tag, children);
1700 /* A null DIE marks the end of a list of children. */
1768 if (entry->children)
2274 entry->children
[all...]
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_write_set_format_xar.c200 } children; member in struct:file
1661 if (np->dir && np->children.first != NULL) {
1663 np = np->children.first;
1854 if (xar->root->children.first == NULL)
1970 file->children.first = NULL;
1971 file->children.last = &(file->children.first);
2030 *parent->children.last = child;
2031 parent->children.last = &(child->chnext);
/freebsd-11-stable/sys/dev/cxgb/
H A Dcxgb_sge.c3349 struct sysctl_oid_list *children; local
3352 children = SYSCTL_CHILDREN(device_get_sysctl_tree(sc->dev));
3355 SYSCTL_ADD_STRING(ctx, children, OID_AUTO,
3359 SYSCTL_ADD_UINT(ctx, children, OID_AUTO,
3363 SYSCTL_ADD_STRING(ctx, children, OID_AUTO,
3367 SYSCTL_ADD_INT(ctx, children, OID_AUTO,
3371 SYSCTL_ADD_UQUAD(ctx, children, OID_AUTO, "tunq_coalesce",
3374 SYSCTL_ADD_INT(ctx, children, OID_AUTO,
3378 SYSCTL_ADD_UINT(ctx, children, OID_AUTO,
3412 struct sysctl_oid_list *children; local
[all...]
/freebsd-11-stable/contrib/jemalloc/src/
H A Dctl.c29 const ctl_named_node_t *children = ctl_named_node(node->children); local
31 return (children ? &children[index] : NULL);
838 if (ctl_named_node(node->children) != NULL) {
870 inode = ctl_indexed_node(node->children);
979 if (ctl_named_node(node->children) != NULL) {
990 inode = ctl_indexed_node(node->children);
/freebsd-11-stable/sys/dev/proto/
H A Dproto_busdma.c85 LIST_INSERT_HEAD(&parent->children, tag, peers);
121 if (!LIST_EMPTY(&tag->children))

Completed in 303 milliseconds

1234567891011>>