Home
last modified time | relevance | path

Searched refs:Children (Results 1 - 25 of 59) sorted by relevance

123

/third_party/protobuf/csharp/src/Google.Protobuf/
H A DFieldMaskTree.cs65 public Dictionary<string, Node> Children { get; } = new Dictionary<string, Node>(); property in Google.Protobuf.FieldMaskTree.Node
117 && node.Children.Count == 0) in AddFieldPath()
124 if (!node.Children.TryGetValue(part, out childNode)) in AddFieldPath()
128 node.Children.Add(part, childNode); in AddFieldPath()
134 node.Children.Clear(); in AddFieldPath()
157 if (root.Children.Count != 0) in ToFieldMask()
172 if (node.Children.Count == 0) in GetFieldPaths()
178 foreach (var entry in node.Children) in GetFieldPaths()
190 if (root.Children.Count == 0) in IntersectFieldPath()
205 && node.Children in IntersectFieldPath()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/DebugInfo/GSYM/
H A DInlineInfo.h32 /// "Children" variable. All address ranges must be sorted and all address
67 std::vector<InlineInfo> Children; member
74 Children.clear(); in clear()
174 LHS.Children == RHS.Children; in operator ==()
/third_party/skia/third_party/externals/swiftshader/tests/regres/cov/
H A Doptimization.go142 wg.Add(len(tc.Children))
143 for id, child := range tc.Children {
153 for _, child := range tc.Children {
163 child := tc.Children.index(idx)
166 delete(tc.Children, idx)
H A Dtree.go137 delete(parent.Children, indexedTest.index)
153 child := tc.Children.index(TestIndex(i))
167 tcm = tc.Children
183 spans = spans.addAll(spans.invertAll(t.allSpans(tf, tc.Children)))
274 Children TestCoverageMap
288 if len(tc.Children) > 0 {
290 sb.WriteString(tc.Children.String(t, s))
298 return len(tc.Spans) == 0 && tc.Group == nil && len(tc.Children) == 0
308 tc.Children.traverse(cb)
327 Children
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
H A DGenericDomTree.h64 std::vector<DomTreeNodeBase *> Children; member in llvm::DomTreeNodeBase
76 iterator begin() { return Children.begin(); } in begin()
77 iterator end() { return Children.end(); } in end()
78 const_iterator begin() const { return Children.begin(); } in begin()
79 const_iterator end() const { return Children.end(); } in end()
85 const std::vector<DomTreeNodeBase *> &getChildren() const { return Children; } in getChildren()
89 Children.push_back(C.get()); in addChild()
93 size_t getNumChildren() const { return Children.size(); } in getNumChildren()
95 void clearAllChildren() { Children.clear(); } in clearAllChildren()
121 auto I = find(IDom->Children, thi in setIDom()
[all...]
H A DGenericIteratedDominanceFrontier.h124 auto Children = children<OrderedNodeTy>(N); in get()
125 return {Children.begin(), Children.end()}; in get()
H A DGenericDomTreeConstruction.h1143 auto ChIt = llvm::find(IDom->Children, TN); in EraseNode()
1144 assert(ChIt != IDom->Children.end()); in EraseNode()
1145 std::swap(*ChIt, IDom->Children.back()); in EraseNode()
1146 IDom->Children.pop_back(); in EraseNode()
1413 SmallVector<TreeNodePtr, 8> Children(Node->begin(), Node->end()); in VerifyDFSNumbers()
1414 llvm::sort(Children, [](const TreeNodePtr Ch1, const TreeNodePtr Ch2) { in VerifyDFSNumbers()
1418 auto PrintChildrenError = [Node, &Children, PrintNodeAndDFSNums]( in VerifyDFSNumbers()
1434 for (const TreeNodePtr Ch : Children) { in VerifyDFSNumbers()
1443 if (Children.front()->getDFSNumIn() != Node->getDFSNumIn() + 1) { in VerifyDFSNumbers()
1444 PrintChildrenError(Children in VerifyDFSNumbers()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
H A DDIE.h90 bool Children; member in llvm::DIEAbbrev
96 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C) {} in DIEAbbrev()
102 bool hasChildren() const { return Children; } in hasChildren()
104 void setChildrenFlag(bool hasChild) { Children = hasChild; } in setChildrenFlag()
726 /// Children DIEs.
727 IntrusiveBackList<DIE> Children; member in llvm::DIE
752 bool hasChildren() const { return ForceChildren || !Children.empty(); } in hasChildren()
761 return make_range(Children.begin(), Children.end()); in children()
764 return make_range(Children in children()
[all...]
H A DLexicalScopes.h65 SmallVectorImpl<LexicalScope *> &getChildren() { return Children; } in getChildren()
69 void addChild(LexicalScope *S) { Children.push_back(S); } in addChild()
127 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope. member in llvm::LexicalScope
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/DebugInfo/GSYM/
H A DInlineInfo.cpp34 for (const auto &Child : II.Children) in operator <<()
47 for (const auto &Child : II.Children) { in getInlineStackHelper()
68 /// objects to the InlineInfo::Children array.
98 /// InlineInfo::Children array and also skips any InlineInfo objects that do
212 Inline.Children.emplace_back(std::move(*Child)); in decode()
232 bool HasChildren = !Children.empty(); in encode()
242 for (const auto &Child : Children) { in encode()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
H A DIteratedDominanceFrontier.h72 auto Children = children<OrderedNodeTy>(N); in get() local
73 return {Children.begin(), Children.end()}; in get()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/
H A DLexicalScopes.cpp240 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); in constructScopeNest() local
242 for (auto &ChildScope : Children) in constructScopeNest()
332 if (!Children.empty()) in dump()
333 err << std::string(Indent + 2, ' ') << "Children ...\n"; in dump()
334 for (unsigned i = 0, e = Children.size(); i != e; ++i) in dump()
335 if (Children[i] != this) in dump()
336 Children[i]->dump(Indent + 2); in dump()
H A DMachineOutliner.cpp109 /// Children are represented as a map between unsigned integers and nodes. If
126 DenseMap<unsigned, SuffixTreeNode *> Children; member
283 Parent.Children[Edge] = N; in insertLeaf()
307 Parent->Children[Edge] = N; in insertInternalNode()
329 for (auto &ChildPair : CurrNode->Children) { in setSuffixIndices()
336 if (CurrNode->Children.size() == 0 && !CurrNode->isRoot()) in setSuffixIndices()
372 if (Active.Node->Children.count(FirstChar) == 0) { in extend()
385 SuffixTreeNode *NextNode = Active.Node->Children[FirstChar]; in extend()
443 SplitNode->Children[Str[NextNode->StartIdx]] = NextNode; in extend()
538 for (auto &ChildPair : Curr->Children) { in advance()
[all...]
H A DMachineCSE.cpp750 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren(); in PerformCSE() local
751 OpenChildren[Node] = Children.size(); in PerformCSE()
752 for (MachineDomTreeNode *Child : Children) in PerformCSE()
858 const std::vector<MachineDomTreeNode *> &Children = Node->getChildren(); in PerformSimplePRE() local
859 for (MachineDomTreeNode *Child : Children) in PerformSimplePRE()
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/
H A DIceTimerTree.cpp123 if (Nodes[Parent].Children.size() <= ID) in getChildIndex()
124 Nodes[Parent].Children.resize(ID + 1); in getChildIndex()
125 if (Nodes[Parent].Children[ID] == 0) { in getChildIndex()
127 Nodes[Parent].Children[ID] = Size; in getChildIndex()
132 return Nodes[Parent].Children[ID]; in getChildIndex()
171 assert(Nodes[Nodes[StackTop].Parent].Children[ID] == StackTop); in pop()
H A DIceTimerTree.h51 std::vector<TTindex> Children; // indexed by TimerIdT member in Ice::TimerStack::TimerTreeNode
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Object/
H A DWindowsResource.h171 using Children = std::map<T, std::unique_ptr<TreeNode>>;
181 const Children<uint32_t> &getIDChildren() const { return IDChildren; } in getIDChildren()
182 const Children<std::string> &getStringChildren() const { in getStringChildren()
225 Children<uint32_t> IDChildren;
226 Children<std::string> StringChildren;
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/AsmPrinter/
H A DDebugHandlerBase.cpp99 const SmallVectorImpl<LexicalScope *> &Children = S->getChildren(); in identifyScopeMarkers() local
100 if (!Children.empty()) in identifyScopeMarkers()
101 WorkList.append(Children.begin(), Children.end()); in identifyScopeMarkers()
H A DDwarfCompileUnit.cpp435 SmallVector<DIE *, 8> Children; in constructScopeDIE() local
446 createScopeChildrenDIE(Scope, Children); in constructScopeDIE()
456 createScopeChildrenDIE(Scope, Children, &HasNonScopeChildren); in constructScopeDIE()
462 std::make_move_iterator(Children.begin()), in constructScopeDIE()
463 std::make_move_iterator(Children.end())); in constructScopeDIE()
471 for (auto &I : Children) in constructScopeDIE()
792 SmallVectorImpl<DIE *> &Children, in createScopeChildrenDIE()
794 assert(Children.empty()); in createScopeChildrenDIE()
800 Children.push_back(constructVariableDIE(*DV.second, *Scope, ObjectPointer)); in createScopeChildrenDIE()
805 Children in createScopeChildrenDIE()
791 createScopeChildrenDIE(LexicalScope *Scope, SmallVectorImpl<DIE *> &Children, bool *HasNonScopeChildren) createScopeChildrenDIE() argument
858 SmallVector<DIE *, 8> Children; createAndAddScopeChildren() local
[all...]
H A DDIE.cpp59 ID.AddInteger(unsigned(Children)); in Profile()
73 AP->EmitULEB128((unsigned)Children, dwarf::ChildrenString(Children).data()); in Emit()
115 << dwarf::ChildrenString(Children) in print()
297 assert(Abbrev.hasChildren() && "Children flag not set"); in computeOffsetsAndAbbrevs()
/third_party/node/deps/v8/src/torque/
H A Dearley-parser.cc48 for (const Item* child : completed_item->Children()) { in RunAction()
71 std::vector<const Item*> Item::Children() const { in Children() function in v8::internal::torque::Item
84 if (const Item* child = Children()[0]) in SplitByChildren()
89 for (const Item* item : Children()) { in SplitByChildren()
272 return final_item->Children()[0]; in RunEarleyAlgorithm()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AMDGPU/
H A DAMDGPUMachineCFGStructurizer.cpp514 SetVector<MRT *> Children;
528 for (auto CI : Children) {
544 return (*(Children.begin()))->getBBSelectRegOut();
547 void addChild(MRT *Tree) { Children.insert(Tree); }
549 SetVector<MRT *> *getChildren() { return &Children; }
562 for (auto MRTI : Children) {
567 MRT *getEntryTree() { return Children.back(); }
569 MRT *getExitTree() { return Children.front(); }
572 MRT *Tree = Children.back();
578 MRT *Tree = Children
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Mips/
H A DMipsOptimizePICCall.cpp221 const std::vector<MachineDomTreeNode *> &Children = Node->getChildren(); in runOnMachineFunction() local
222 WorkList.append(Children.begin(), Children.end()); in runOnMachineFunction()
/third_party/skia/third_party/externals/angle2/src/compiler/translator/TranslatorMetalDirect/
H A DIntermRebuild.h68 Children = 1u << 0u,
73 // If (Children) bit, only visit if the returned node is the same as the original node.
81 Both = Children | Post,
/third_party/skia/third_party/externals/angle2/src/compiler/translator/tree_util/
H A DIntermRebuild.h68 Children = 1u << 0u,
73 // If (Children) bit, only visit if the returned node is the same as the original node.
81 Both = Children | Post,

Completed in 19 milliseconds

123