Searched refs:children (Results 126 - 150 of 317) sorted by relevance

1234567891011>>

/freebsd-11-stable/usr.bin/gprof/
H A Dprintgprof.c191 "" , "" , "" , "" , "called" , "total" , "children");
353 arcp = parentp -> children;
354 for ( arcp = parentp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
415 * unlink children from parent,
416 * then insertion sort back on to sorted's children.
423 for ( (arcp = parentp -> children)&&(detachedp = arcp -> arc_childlist);
441 * reattach sorted children to parent
443 parentp -> children = sorted.arc_childlist;
H A Dgprof.h105 struct arcstruct *arc_childlist; /* children-of-this-parent list */
128 double childtime; /* cumulative ticks in children */
144 arctype *children; /* list of callee arcs */ member in struct:nl
/freebsd-11-stable/usr.sbin/rpc.ypupdated/
H A Dypupdated_server.c52 int children = 0; variable
H A Dypupdated_main.c174 children--;
/freebsd-11-stable/sys/sys/
H A Dsmp.h53 TAILQ_HEAD(topo_children, topo_node) children; member in struct:topo_node
79 struct cpu_group *cg_child; /* Optional children groups. */
82 int16_t cg_children; /* Number of children groups. */
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/DataFormatters/
H A DFormattersHelpers.h51 std::vector<std::string> children, const char *description,
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DObjCContainersASTChecker.cpp149 // Recurse and check children.
154 for (Stmt *Child : S->children())
H A DRunLoopAutoreleaseLeakChecker.cpp66 for (const Stmt *C : Parent->children()) {
H A DDirectIvarAssignment.cpp79 for (const Stmt *Child : S->children())
H A DObjCUnusedIVarsChecker.cpp59 for (const Stmt *SubStmt : S->children())
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericIteratedDominanceFrontier.h36 /// Generic utility class used for getting the children of a basic block.
124 auto Children = children<OrderedNodeTy>(N);
162 // Walk all dominator tree children of Root, inspecting their CFG edges with
/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/
H A DVarBypassDetector.cpp104 for (const Stmt *SubStmt : S->children()) {
/freebsd-11-stable/contrib/llvm-project/clang/lib/Analysis/
H A DCloneDetection.cpp247 /// hashes for all possible StmtSequences in the children of this Stmt.
259 for (const Stmt *Child : S->children()) {
323 for (const Stmt *Child : S->children()) {
363 // Generate hash codes for all children of S and save them in StmtsByHash.
454 for (const Stmt *S : Seq.front()->children()) {
544 // children). We skip such statements as they don't reference any
555 // Recursively check all children of the given statement.
556 for (const Stmt *Child : S->children()) {
/freebsd-11-stable/contrib/subversion/subversion/libsvn_wc/
H A Ddiff_editor.c636 apr_array_header_t *children;
655 children = svn_sort__hash(nodes, svn_sort_compare_items_lexically,
658 for (i = 0; i < children->nelts; i++)
660 svn_sort__item_t *item = &APR_ARRAY_IDX(children, i,
1080 const apr_array_header_t *children;
1159 children = svn_sort__hash(nodes, svn_sort_compare_items_lexically,
1162 for (i = 0; i < children->nelts; i++)
1164 svn_sort__item_t *item = &APR_ARRAY_IDX(children, i, svn_sort__item_t);
1474 apr_array_header_t *children;
1480 children
635 apr_array_header_t *children; local
1079 const apr_array_header_t *children; local
1473 apr_array_header_t *children; local
1795 apr_array_header_t *children; local
[all...]
/freebsd-11-stable/usr.sbin/jail/tests/
H A Djail_basic_test.sh72 jail -c name=basejail persist ip4.addr=192.0.1.1 children.max=1
87 # Create jail with no child - children.max should be 0 by default
/freebsd-11-stable/contrib/gcc/
H A Dtree-sra.c100 struct sra_elt *children; member in struct:sra_elt
151 : (ELT)->children; \
167 child = group->parent->children;
404 for (c = elt->children; c; c = c->sibling)
568 elt->sibling = parent->children;
569 parent->children = elt;
1080 for (c = elt->children; c ; c = c->sibling)
1269 for (c = elt->children; c ; c = c->sibling)
1291 for (c = elt->children; c ; c = c->sibling)
1299 children o
[all...]
/freebsd-11-stable/contrib/bmake/unit-tests/
H A Ddotwait.mk43 # recursive: all children of the left hand side of the .WAIT
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDie.h113 /// \returns a valid DWARFDie instance if this object has children or an
119 /// \returns a valid null DWARFDie instance if this object has children or an
224 /// of its children.
228 /// and all children.
284 iterator_range<iterator> children() const;
387 inline iterator_range<DWARFDie::iterator> DWARFDie::children() const { function in class:llvm::DWARFDie
/freebsd-11-stable/contrib/subversion/subversion/libsvn_repos/
H A Dreplay.c155 the appropriate editor calls to add it and its children without any
1060 the appropriate editor calls to add it and its children without any
1082 apr_array_header_t *children = NULL;
1087 SVN_ERR(svn_editor_add_directory(editor, repos_relpath, children,
1174 children, props,
1356 apr_array_header_t *children;
1362 SVN_ERR(svn_hash_keys(&children, dirents, scratch_pool));
1368 children, props,
1501 apr_array_header_t *children = NULL;
1504 SVN_INVALID_REVNUM, children,
1077 apr_array_header_t *children = NULL; local
1351 apr_array_header_t *children; local
1496 apr_array_header_t *children = NULL; local
[all...]
/freebsd-11-stable/sys/dev/ata/
H A Data-pci.c136 /* detach & delete all children */
873 device_t *children; local
877 if (device_get_children(device_get_parent(dev), &children, &nchildren))
881 s = pci_get_slot(children[i]);
883 idx = ata_match_chip(children[i], index);
885 free(children, M_TEMP);
890 free(children, M_TEMP);
/freebsd-11-stable/sys/dev/sound/pci/
H A Dt4dwave.c831 device_t *children; local
907 if (device_get_children(device_get_parent(dev), &children,
910 if (pci_get_devid(children[i]) == 0x153310b9) {
912 data = pci_read_config(children[i],
921 pci_write_config(children[i], 0x7e,
927 free(children, M_TEMP);
/freebsd-11-stable/usr.sbin/nfsd/
H A Dnfsd.c88 static pid_t children[MAXNFSDCNT]; /* PIDs of children */ variable
89 static int nfsdcnt; /* number of children */
442 children[0] = pid;
758 * kills all children. If we run for UDP only (and so do not have to
891 if (pid == children[i])
892 children[i] = -1;
910 if (children[i] > 0)
911 kill(children[i], SIGKILL);
/freebsd-11-stable/sys/kern/
H A Dsubr_bus.c118 device_list_t children; /**< list of child devices */ member in struct:device
1074 * notification of all the children classes of dc, as well as dc.
1079 * level to save storing children-lists in the devclass structure. If
1100 * Walk through the children classes. Since we only keep a
1102 * devclasses looking for children. We set the
1105 * that have children.
1122 * to re-probe any unmatched children.
1155 * search for drivers in both devclasses for children
1180 * recursive notification of all the children classes of busclass, as
1182 * from any devices that are children o
[all...]
/freebsd-11-stable/usr.bin/dtc/
H A Dfdt.cc744 for (auto &&c : children)
801 children.push_back(std::move(child));
964 children.push_back(std::move(child));
1065 children.erase(std::remove_if(children.begin(), children.end(),
1079 }), children.end());
1111 for (auto &c : other->children)
1114 for (auto &i : children)
1125 children
[all...]
/freebsd-11-stable/sys/dev/xen/blkfront/
H A Dblkfront.c899 struct sysctl_oid_list *children; local
909 children = SYSCTL_CHILDREN(sysctl_tree);
910 SYSCTL_ADD_UINT(sysctl_ctx, children, OID_AUTO,
914 SYSCTL_ADD_UINT(sysctl_ctx, children, OID_AUTO,
919 SYSCTL_ADD_UINT(sysctl_ctx, children, OID_AUTO,
923 SYSCTL_ADD_UINT(sysctl_ctx, children, OID_AUTO,
927 SYSCTL_ADD_PROC(sysctl_ctx, children, OID_AUTO,

Completed in 385 milliseconds

1234567891011>>