Searched refs:children (Results 226 - 250 of 348) sorted by relevance

1234567891011>>

/freebsd-current/contrib/wpa/src/utils/
H A Dxml_libxml2.c369 return (xml_node_t *) ((xmlNodePtr) parent)->children;
/freebsd-current/usr.sbin/ypserv/
H A Dyp_main.c206 children--;
/freebsd-current/usr.bin/gprof/
H A Dgprof.c357 for ( arcp = nlp -> children ; arcp ; arcp = arcp -> arc_childlist ) {
/freebsd-current/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/
H A DLVReaderHandler.cpp76 for (const Archive::Child &Child : Arch.children(Err)) {
/freebsd-current/contrib/expat/lib/
H A Dexpat.h155 and children point to an array of XML_Content cells that will be
159 the numchildren field will be zero and children will be NULL. The
162 CHOICE and SEQ will have name NULL, the number of children in
163 numchildren and children will point, recursively, to an array
176 XML_Content *children; member in struct:XML_cp
/freebsd-current/contrib/llvm-project/llvm/lib/Object/
H A DMachOUniversalWriter.cpp129 for (const Archive::Child &Child : A.children(Err)) {
H A DOffloadBinary.cpp148 for (auto Child : Library.children(Err)) {
/freebsd-current/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFTypePrinter.cpp19 for (const DWARFDie &C : D.children()) {
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h1521 for (const BlockT *DstBB : children<const BlockT *>(SrcBB)) {
1535 bool HasSucc = !llvm::children<const BlockT *>(&BB).empty();
1575 for (const auto SI : children<const BlockT *>(BB)) {
1653 for (const auto *Succ : children<const BlockT *>(BB))
/freebsd-current/contrib/llvm-project/llvm/include/llvm/Object/
H A DArchive.h345 iterator_range<child_iterator> children(Error &Err, function in class:llvm::object::Archive
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DADCE.cpp270 // Invoked after we have visited all children of a node.
301 // We do this by seeing which of the postdomtree root children exit the
303 for (const auto &PDTChild : children<DomTreeNode *>(PDT.getRootNode())) {
/freebsd-current/contrib/llvm-project/llvm/tools/llvm-link/
H A Dllvm-link.cpp181 for (const object::Archive::Child &C : Archive->children(Err)) {
/freebsd-current/contrib/bmake/
H A Dcompat.c516 * descend and make all our children. If any of them has an error
527 MakeNodes(&gn->children, gn);
539 * All the children were made ok. Now youngestChild->mtime contains the
/freebsd-current/sys/dev/sound/pcm/
H A Dchannel.h151 } children; member in struct:pcm_channel
/freebsd-current/lib/libpfctl/
H A Dlibpfctl.h285 struct pfctl_anchor_node children; member in struct:pfctl_anchor
/freebsd-current/contrib/jemalloc/src/
H A Dctl.c36 const ctl_named_node_t *children = ctl_named_node(node->children); local
38 return (children ? &children[index] : NULL);
1213 if (ctl_named_node(node->children) != NULL) {
1246 inode = ctl_indexed_node(node->children);
1354 if (ctl_named_node(node->children) != NULL) {
1365 inode = ctl_indexed_node(node->children);
/freebsd-current/contrib/elftoolchain/libdwarf/
H A Ddwarf_dump.c579 dwarf_get_CHILDREN_name(unsigned children, const char **s) argument
584 switch (children) {
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DDIE.cpp66 // Emit whether it has children DIEs.
258 for (const auto &Child : children())
287 // Let the children compute their offsets and abbreviation numbers.
292 for (auto &Child : children())
300 // Compute the byte size of this DIE and all of its children correctly. This
/freebsd-current/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DDIE.h86 /// Whether or not this node has children.
89 /// are 0 and 1 for no children and children respectively.
825 /// Size of instance + children.
831 /// children even when it doesn't. This is used for unit testing purposes.
836 /// The owner is either the parent DIE for children of other DIEs, or a
875 child_range children() { function in class:llvm::DIE
878 const_child_range children() const { function in class:llvm::DIE
897 /// Compute the offset of this DIE and all its children.
/freebsd-current/contrib/llvm-project/clang/lib/CodeGen/
H A DCGCoroutine.cpp154 // Fall through to visit the children.
159 // temporary is not part of `children()` as covered in the fall through.
166 // Fall through to visit the children.
169 for (const auto *child : S->children())
372 for (auto *C : S->children()) {
/freebsd-current/contrib/llvm-project/clang/lib/StaticAnalyzer/Checkers/
H A DCheckSecuritySyntaxOnly.cpp126 for (Stmt *Child : S->children())
185 // Recurse and check children.
199 // Recurse and check children.
204 for (Stmt *Child : S->children())
215 // Recurse and check children.
/freebsd-current/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineCSE.cpp752 /// dominator tree node if its a leaf or all of its children are done. Walk
786 append_range(WorkList, Node->children());
916 append_range(BBs, Node->children());
/freebsd-current/contrib/llvm-project/llvm/utils/TableGen/
H A DDAGISelMatcher.h50 size_t Size = 0; // Size in bytes of matcher and all its children (if any).
128 /// operates on the node or its children without potential side effects or a
198 /// ScopeMatcher - This attempts to match each of its children to find the first
200 /// If none of the children match then this check fails. It never has a 'next'.
204 ScopeMatcher(SmallVectorImpl<Matcher *> &&children) argument
205 : Matcher(Scope), Children(std::move(children)) {}
226 // delete any children we're about to lose pointers to.
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLoopUnroll.cpp695 for (auto *ChildDomNode : BBDomNode->children()) {
806 for (auto *C : to_vector(DT->getNode(OriginalExit)->children())) {
/freebsd-current/contrib/llvm-project/lldb/source/Core/
H A DIOHandlerCursesGUI.cpp4488 // The process stop ID when the children were calculated.
4496 std::vector<Row> children; member in struct:Row
4518 children.clear();
4524 children.push_back(Row(valobj->GetChildAtIndex(i), this));
4528 return children;
4534 children.clear();
4699 // The root item must calculate its children, or we must calculate the
4700 // number of children if the item is expanded
4842 void AdoptChildren(std::vector<TreeItem> &children) { argument
4843 m_children = std::move(children);
5851 auto &children = row.GetChildren(); local
5876 auto &children = row.GetChildren(); local
[all...]

Completed in 419 milliseconds

1234567891011>>