| /NextBSD/contrib/llvm/tools/clang/lib/Rewrite/ |
| HD | DeltaTree.cpp | 123 DeltaTreeNode *Children[2*WidthFactor]; member in __anon5c215cbe0311::DeltaTreeInteriorNode 126 Children[i]->Destroy(); in ~DeltaTreeInteriorNode() 134 Children[0] = IR.LHS; in DeltaTreeInteriorNode() 135 Children[1] = IR.RHS; in DeltaTreeInteriorNode() 143 return Children[i]; in getChild() 147 return Children[i]; in getChild() 227 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes)) in DoInsertion() 237 memmove(&IN->Children[i+2], &IN->Children[i+1], in DoInsertion() 238 (e-i)*sizeof(IN->Children[0])); in DoInsertion() 239 IN->Children[i] = InsertRes->LHS; in DoInsertion() [all …]
|
| HD | RewriteRope.cpp | 395 RopePieceBTreeNode *Children[2*WidthFactor]; member in __anonb3c0279c0411::RopePieceBTreeInterior 401 Children[0] = LHS; in RopePieceBTreeInterior() 402 Children[1] = RHS; in RopePieceBTreeInterior() 409 Children[i]->Destroy(); in ~RopePieceBTreeInterior() 417 return Children[i]; in getChild() 421 return Children[i]; in getChild() 530 memmove(&Children[i+2], &Children[i+1], in HandleChildPiece() 531 (getNumChildren()-i-1)*sizeof(Children[0])); in HandleChildPiece() 532 Children[i+1] = RHS; in HandleChildPiece() 544 memcpy(&NewNode->Children[0], &Children[WidthFactor], in HandleChildPiece() [all …]
|
| /NextBSD/contrib/llvm/tools/clang/lib/Tooling/ |
| HD | FileMatchTrie.cpp | 64 if (Children.empty()) { in insert() 71 Children[Element].Path = Path; in insert() 75 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1); in insert() 103 if (Children.empty()) { in findEquivalent() 111 Children.find(Element); in findEquivalent() 112 if (MatchingChild != Children.end()) { in findEquivalent() 141 if (Children.empty()) { in getAll() 146 It = Children.begin(), E = Children.end(); in getAll() 150 It->getValue().getAll(Results, Children.end()); in getAll() 159 llvm::StringMap<FileMatchTrieNode> Children; member in clang::tooling::FileMatchTrieNode
|
| /NextBSD/contrib/llvm/tools/clang/lib/Format/ |
| HD | TokenAnnotator.h | 61 Current->Children.clear(); in AnnotatedLine() 62 for (const auto &Child : Node.Children) { in AnnotatedLine() 63 Children.push_back(new AnnotatedLine(Child)); in AnnotatedLine() 64 Current->Children.push_back(Children.back()); in AnnotatedLine() 72 for (unsigned i = 0, e = Children.size(); i != e; ++i) { in ~AnnotatedLine() 73 delete Children[i]; in ~AnnotatedLine() local 77 Current->Children.clear(); in ~AnnotatedLine() 92 SmallVector<AnnotatedLine *, 0> Children; variable
|
| HD | UnwrappedLineFormatter.cpp | 456 for (AnnotatedLine *Child : Tok->Children) in markFinalized() 514 LBrace->BlockKind != BK_Block || Previous.Children.size() == 0) in formatChildren() 521 Previous.Children[0]->Level * Style.IndentWidth; in formatChildren() 524 BlockFormatter->format(Previous.Children, DryRun, AdditionalIndent, in formatChildren() 529 if (Previous.Children[0]->First->MustBreakBefore) in formatChildren() 533 if (Previous.Children.size() > 1) in formatChildren() 541 if (Previous.Children[0]->Last->isTrailingComment()) in formatChildren() 547 Previous.Children[0]->Last->TotalLength + State.Column + 2 > in formatChildren() 553 *Previous.Children[0]->First, in formatChildren() 557 Penalty += formatLine(*Previous.Children[0], State.Column + 1, DryRun); in formatChildren() [all …]
|
| HD | UnwrappedLineParser.h | 211 SmallVector<UnwrappedLine, 0> Children; member
|
| HD | TokenAnnotator.cpp | 1431 setCommentLineLevels((*I)->Children); in setCommentLineLevels() 1436 for (SmallVectorImpl<AnnotatedLine *>::iterator I = Line.Children.begin(), in annotate() 1437 E = Line.Children.end(); in annotate() 1497 for (SmallVectorImpl<AnnotatedLine *>::iterator I = Line.Children.begin(), in calculateFormattingInformation() 1498 E = Line.Children.end(); in calculateFormattingInformation() 1560 if (Current->Previous->Children.size() == 1) { in calculateFormattingInformation() 1561 FormatToken &LastOfChild = *Current->Previous->Children[0]->Last; in calculateFormattingInformation() 1566 if (Current->MustBreakBefore || Prev->Children.size() > 1 || in calculateFormattingInformation() 1567 (Prev->Children.size() == 1 && in calculateFormattingInformation() 1568 Prev->Children[0]->First->MustBreakBefore) || in calculateFormattingInformation() [all …]
|
| /NextBSD/contrib/llvm/include/llvm/Support/ |
| HD | GenericDomTree.h | 72 std::vector<DomTreeNodeBase<NodeT> *> Children; variable 83 iterator begin() { return Children.begin(); } in begin() 84 iterator end() { return Children.end(); } in end() 85 const_iterator begin() const { return Children.begin(); } in begin() 86 const_iterator end() const { return Children.end(); } in end() 91 return Children; in getChildren() 99 Children.push_back(C.get()); in addChild() 103 size_t getNumChildren() const { return Children.size(); } in getNumChildren() 105 void clearAllChildren() { Children.clear(); } in clearAllChildren() 129 std::find(IDom->Children.begin(), IDom->Children.end(), this); in setIDom() [all …]
|
| /NextBSD/contrib/llvm/lib/CodeGen/ |
| HD | LexicalScopes.cpp | 224 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); in constructScopeNest() local 226 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children.begin(), in constructScopeNest() 227 SE = Children.end(); in constructScopeNest() 327 if (!Children.empty()) in dump() 329 for (unsigned i = 0, e = Children.size(); i != e; ++i) in dump() 330 if (Children[i] != this) in dump() 331 Children[i]->dump(Indent + 2); in dump()
|
| HD | MachineCSE.cpp | 687 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren(); in PerformCSE() local 688 unsigned NumChildren = Children.size(); in PerformCSE() 691 MachineDomTreeNode *Child = Children[i]; in PerformCSE()
|
| /NextBSD/contrib/llvm/lib/CodeGen/AsmPrinter/ |
| HD | DwarfCompileUnit.cpp | 315 SmallVector<DIE *, 8> Children; in constructScopeDIE() local 326 createScopeChildrenDIE(Scope, Children); in constructScopeDIE() 336 createScopeChildrenDIE(Scope, Children, &ChildScopeCount); in constructScopeDIE() 342 Children.push_back( in constructScopeDIE() 348 if (Children.size() == ChildScopeCount) { in constructScopeDIE() 350 std::make_move_iterator(Children.begin()), in constructScopeDIE() 351 std::make_move_iterator(Children.end())); in constructScopeDIE() 359 for (auto &I : Children) in constructScopeDIE() 541 SmallVectorImpl<DIE *> &Children, in createScopeChildrenDIE() argument 546 Children.push_back(constructVariableDIE(*DV, *Scope, ObjectPointer)); in createScopeChildrenDIE() [all …]
|
| HD | DIE.cpp | 55 ID.AddInteger(unsigned(Children)); in Profile() 69 AP->EmitULEB128((unsigned)Children, dwarf::ChildrenString(Children)); in Emit() 96 << dwarf::ChildrenString(Children) in print()
|
| /NextBSD/contrib/llvm/include/llvm/CodeGen/ |
| HD | DIE.h | 72 bool Children; variable 79 DIEAbbrev(dwarf::Tag T, bool C) : Tag(T), Children(C), Data() {} in DIEAbbrev() 84 bool hasChildren() const { return Children; } in hasChildren() 86 void setChildrenFlag(bool hasChild) { Children = hasChild; } in setChildrenFlag() 642 IntrusiveBackList<DIE> Children; variable 666 bool hasChildren() const { return !Children.empty(); } in hasChildren() 674 return llvm::make_range(Children.begin(), Children.end()); in children() 677 return llvm::make_range(Children.begin(), Children.end()); in children() 729 Children.push_back(*Child); in addChild() 730 return Children.back(); in addChild()
|
| HD | LexicalScopes.h | 64 SmallVectorImpl<LexicalScope *> &getChildren() { return Children; } in getChildren() 68 void addChild(LexicalScope *S) { Children.push_back(S); } in addChild() 126 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope. variable
|
| /NextBSD/contrib/llvm/utils/TableGen/ |
| HD | DAGISelMatcher.h | 192 SmallVector<Matcher*, 4> Children; variable 195 : Matcher(Scope), Children(children.begin(), children.end()) { in ScopeMatcher() 199 unsigned getNumChildren() const { return Children.size(); } in getNumChildren() 201 Matcher *getChild(unsigned i) { return Children[i]; } in getChild() 202 const Matcher *getChild(unsigned i) const { return Children[i]; } in getChild() 205 delete Children[i]; in resetChild() local 206 Children[i] = N; in resetChild() 210 Matcher *Res = Children[i]; in takeChild() 211 Children[i] = nullptr; in takeChild() 216 if (NC < Children.size()) { in setNumChildren() [all …]
|
| HD | CodeGenDAGPatterns.h | 342 std::vector<TreePatternNode*> Children; variable 346 : Operator(Op), Val(nullptr), TransformFn(nullptr), Children(Ch) { in TreePatternNode() 384 unsigned getNumChildren() const { return Children.size(); } in getNumChildren() 385 TreePatternNode *getChild(unsigned N) const { return Children[N]; } in getChild() 387 Children[i] = N; in setChild() 392 for (unsigned i = 0, e = Children.size(); i != e; ++i) in hasChild() 393 if (Children[i] == N) return true; in hasChild()
|
| HD | CodeGenDAGPatterns.cpp | 1304 CChildren.reserve(Children.size()); in clone() 1386 if (Frag->getNumArgs() != Children.size()) { in InlinePatternFragments() 2151 std::vector<TreePatternNode*> Children; in ParseTreePattern() local 2155 Children.push_back(ParseTreePattern(Dag->getArg(i), Dag->getArgName(i))); in ParseTreePattern() 2175 Children.insert(Children.begin(), IIDNode); in ParseTreePattern() 2179 for (unsigned i = 0; i < Children.size(); ++i) { in ParseTreePattern() 2180 TreePatternNode *Child = Children[i]; in ParseTreePattern() 2200 TreePatternNode *Result = new TreePatternNode(Operator, Children, NumResults); in ParseTreePattern() 3024 std::vector<TreePatternNode*> Children; in parseInstructionPattern() local 3025 Children.push_back(OpNode); in parseInstructionPattern() [all …]
|
| /NextBSD/contrib/llvm/lib/Transforms/Utils/ |
| HD | BasicBlockUtils.cpp | 168 SmallVector<DomTreeNode *, 8> Children(DTN->begin(), DTN->end()); in MergeBlockIntoPredecessor() local 169 for (SmallVectorImpl<DomTreeNode *>::iterator DI = Children.begin(), in MergeBlockIntoPredecessor() 170 DE = Children.end(); in MergeBlockIntoPredecessor() 301 std::vector<DomTreeNode *> Children; in SplitBlock() local 304 Children.push_back(*I); in SplitBlock() 307 for (std::vector<DomTreeNode *>::iterator I = Children.begin(), in SplitBlock() 308 E = Children.end(); I != E; ++I) in SplitBlock() 727 std::vector<DomTreeNode *> Children(OldNode->begin(), OldNode->end()); in SplitBlockAndInsertIfThen() local 730 for (auto Child : Children) in SplitBlockAndInsertIfThen()
|
| /NextBSD/contrib/llvm/tools/llvm-pdbdump/ |
| HD | ClassDefinitionDumper.cpp | 61 auto Children = Class.findAllChildren(); in start() local 62 if (Children->getChildCount() == 0) { in start() 79 while (auto Child = Children->getNext()) { in start()
|
| HD | CompilandDumper.cpp | 45 void CompilandDumper::start(const PDBSymbolCompiland &Symbol, bool Children) { in start() argument 52 if (!Children) in start()
|
| HD | CompilandDumper.h | 23 void start(const PDBSymbolCompiland &Symbol, bool Children);
|
| /NextBSD/contrib/llvm/lib/Target/Mips/ |
| HD | MipsOptimizePICCall.cpp | 201 const std::vector<MachineDomTreeNode *> &Children = Node->getChildren(); in runOnMachineFunction() local 202 WorkList.append(Children.begin(), Children.end()); in runOnMachineFunction()
|
| /NextBSD/contrib/llvm/lib/Transforms/Scalar/ |
| HD | LICM.cpp | 314 const std::vector<DomTreeNode*> &Children = N->getChildren(); in sinkRegion() local 315 for (unsigned i = 0, e = Children.size(); i != e; ++i) in sinkRegion() 317 sinkRegion(Children[i], AA, LI, DT, TLI, CurLoop, CurAST, SafetyInfo); in sinkRegion() 397 const std::vector<DomTreeNode*> &Children = N->getChildren(); in hoistRegion() local 398 for (unsigned i = 0, e = Children.size(); i != e; ++i) in hoistRegion() 400 hoistRegion(Children[i], AA, LI, DT, TLI, CurLoop, CurAST, SafetyInfo); in hoistRegion()
|
| /NextBSD/contrib/llvm/tools/clang/include/clang/AST/ |
| HD | Stmt.h | 1831 Stmt *Children[2]; variable 1856 return reinterpret_cast<Expr*>(Children[FILTER_EXPR]); in getFilterExpr() 1860 return cast<CompoundStmt>(Children[BLOCK]); in getBlock() 1864 return child_range(Children,Children+2); in children() 1910 Stmt *Children[2]; variable 1932 SourceLocation getEndLoc() const { return Children[HANDLER]->getLocEnd(); } in getEndLoc() 1937 return cast<CompoundStmt>(Children[TRY]); in getTryBlock() 1940 Stmt *getHandler() const { return Children[HANDLER]; } in getHandler() 1947 return child_range(Children,Children+2); in children()
|
| /NextBSD/contrib/llvm/lib/Support/ |
| HD | Dwarf.cpp | 38 const char *llvm::dwarf::ChildrenString(unsigned Children) { in ChildrenString() argument 39 switch (Children) { in ChildrenString()
|