/freebsd-10.3-release/contrib/llvm/tools/clang/lib/Format/ |
H A D | TokenAnnotator.h | 59 Current->Children.clear(); 61 I = Node.Children.begin(), 62 E = Node.Children.end(); 64 Children.push_back(new AnnotatedLine(*I)); 65 Current->Children.push_back(Children.back()); 73 for (unsigned i = 0, e = Children.size(); i != e; ++i) { 74 delete Children[i]; 81 SmallVector<AnnotatedLine *, 0> Children; member in class:clang::format::AnnotatedLine
|
H A D | UnwrappedLineParser.h | 195 SmallVector<UnwrappedLine, 0> Children; member in struct:clang::format::UnwrappedLineNode
|
H A D | Format.cpp | 950 LBrace->BlockKind != BK_Block || Previous.Children.size() == 0) 957 Previous.Children[0]->Level * Style.IndentWidth; 958 Penalty += format(Previous.Children, DryRun, AdditionalIndent); 963 if (Previous.Children.size() > 1) 967 if (Previous.Children[0]->Last->isTrailingComment()) 972 *Previous.Children[0]->First, 976 Penalty += format(*Previous.Children[0], State.Column + 1, DryRun); 978 State.Column += 1 + Previous.Children[0]->Last->TotalLength;
|
H A D | TokenAnnotator.cpp | 1026 setCommentLineLevels((*I)->Children); 1031 for (SmallVectorImpl<AnnotatedLine *>::iterator I = Line.Children.begin(), 1032 E = Line.Children.end(); 1074 if (Current->MustBreakBefore || !Current->Children.empty() || 1102 for (SmallVectorImpl<AnnotatedLine *>::iterator I = Line.Children.begin(), 1103 E = Line.Children.end(); 1302 return !Left.Children.empty(); // No spaces in "{}".
|
H A D | FormatToken.h | 361 SmallVector<AnnotatedLine *, 1> Children; member in struct:clang::format::FormatToken
|
/freebsd-10.3-release/contrib/llvm/tools/clang/lib/Tooling/ |
H A D | FileMatchTrie.cpp | 62 if (Children.empty()) { 69 Children[Element].Path = Path; 73 Children[Element].insert(NewPath, ConsumedLength + Element.size() + 1); 101 if (Children.empty()) { 109 Children.find(Element); 110 if (MatchingChild != Children.end()) { 139 if (Children.empty()) { 144 It = Children.begin(), E = Children.end(); 148 It->getValue().getAll(Results, Children 157 llvm::StringMap<FileMatchTrieNode> Children; member in class:clang::tooling::FileMatchTrieNode [all...] |
/freebsd-10.3-release/contrib/llvm/tools/clang/lib/Rewrite/Core/ |
H A D | DeltaTree.cpp | 123 DeltaTreeNode *Children[2*WidthFactor]; 126 Children[i]->Destroy(); 134 Children[0] = IR.LHS; 135 Children[1] = IR.RHS; 143 return Children[i]; 147 return Children[i]; 227 if (!IN->Children[i]->DoInsertion(FileIndex, Delta, InsertRes)) 237 memmove(&IN->Children[i+2], &IN->Children[i+1], 238 (e-i)*sizeof(IN->Children[ [all...] |
H A D | RewriteRope.cpp | 393 /// Children array. 395 RopePieceBTreeNode *Children[2*WidthFactor]; 401 Children[0] = LHS; 402 Children[1] = RHS; 409 Children[i]->Destroy(); 417 return Children[i]; 421 return Children[i]; 530 memmove(&Children[i+2], &Children[i+1], 531 (getNumChildren()-i-1)*sizeof(Children[ [all...] |
/freebsd-10.3-release/contrib/llvm/lib/CodeGen/ |
H A D | LexicalScopes.cpp | 221 const SmallVectorImpl<LexicalScope *> &Children = WS->getChildren(); local 223 for (SmallVectorImpl<LexicalScope *>::const_iterator SI = Children.begin(), 224 SE = Children.end(); SI != SE; ++SI) { 328 if (!Children.empty()) 329 err << std::string(Indent + 2, ' ') << "Children ...\n"; 330 for (unsigned i = 0, e = Children.size(); i != e; ++i) 331 if (Children[i] != this) 332 Children[i]->dump(Indent + 2);
|
H A D | MachineCSE.cpp | 631 const std::vector<MachineDomTreeNode*> &Children = Node->getChildren(); local 632 unsigned NumChildren = Children.size(); 635 MachineDomTreeNode *Child = Children[i];
|
/freebsd-10.3-release/contrib/llvm/include/llvm/CodeGen/ |
H A D | LexicalScopes.h | 174 SmallVectorImpl<LexicalScope *> &getChildren() { return Children; } 178 void addChild(LexicalScope *S) { Children.push_back(S); } 236 SmallVector<LexicalScope *, 4> Children; // Scopes defined in scope. member in class:llvm::LexicalScope
|
/freebsd-10.3-release/contrib/llvm/include/llvm/Analysis/ |
H A D | Dominators.h | 67 std::vector<DomTreeNodeBase<NodeT> *> Children; member in class:llvm::DomTreeNodeBase 77 iterator begin() { return Children.begin(); } 78 iterator end() { return Children.end(); } 79 const_iterator begin() const { return Children.begin(); } 80 const_iterator end() const { return Children.end(); } 85 return Children; 92 Children.push_back(C); 97 return Children.size(); 101 Children.clear(); 126 std::find(IDom->Children [all...] |
/freebsd-10.3-release/contrib/llvm/utils/TableGen/ |
H A D | DAGISelMatcher.h | 189 SmallVector<Matcher*, 4> Children; member in class:llvm::ScopeMatcher 192 : Matcher(Scope), Children(children, children+numchildren) { 196 unsigned getNumChildren() const { return Children.size(); } 198 Matcher *getChild(unsigned i) { return Children[i]; } 199 const Matcher *getChild(unsigned i) const { return Children[i]; } 202 delete Children[i]; 203 Children[i] = N; 207 Matcher *Res = Children[i]; 208 Children[i] = 0; 213 if (NC < Children [all...] |
H A D | CodeGenDAGPatterns.h | 324 std::vector<TreePatternNode*> Children; 328 : Operator(Op), Val(0), TransformFn(0), Children(Ch) { 366 unsigned getNumChildren() const { return Children.size(); } 367 TreePatternNode *getChild(unsigned N) const { return Children[N]; } 369 Children[i] = N; 374 for (unsigned i = 0, e = Children.size(); i != e; ++i) 375 if (Children[i] == N) return true;
|
H A D | CodeGenDAGPatterns.cpp | 1199 CChildren.reserve(Children.size()); 1279 if (Frag->getNumArgs() != Children.size()) { 1950 std::vector<TreePatternNode*> Children; local 1954 Children.push_back(ParseTreePattern(Dag->getArg(i), Dag->getArgName(i))); 1974 Children.insert(Children.begin(), IIDNode); 1978 TreePatternNode *Result = new TreePatternNode(Operator, Children, NumResults); 2799 std::vector<TreePatternNode*> Children; local 2800 Children.push_back(OpNode); 2801 OpNode = new TreePatternNode(Xform, Children, OpNod 3268 std::vector<TreePatternNode*> Children; local 3389 GatherChildrenOfAssociativeOpcode(TreePatternNode *N, std::vector<TreePatternNode *> &Children) argument [all...] |
H A D | DAGISelMatcher.cpp | 83 for (unsigned i = 0, e = Children.size(); i != e; ++i) 84 delete Children[i];
|
/freebsd-10.3-release/contrib/llvm/lib/Transforms/Scalar/ |
H A D | LICM.cpp | 312 const std::vector<DomTreeNode*> &Children = N->getChildren(); local 313 for (unsigned i = 0, e = Children.size(); i != e; ++i) 314 SinkRegion(Children[i]); 385 const std::vector<DomTreeNode*> &Children = N->getChildren(); local 386 for (unsigned i = 0, e = Children.size(); i != e; ++i) 387 HoistRegion(Children[i]);
|
/freebsd-10.3-release/contrib/llvm/lib/CodeGen/AsmPrinter/ |
H A D | DIE.h | 123 /// Children DIEs. 125 std::vector<DIE *> Children; member in class:llvm::DIE 146 const std::vector<DIE *> &getChildren() const { return Children; } 171 Children.push_back(Child);
|
H A D | DIE.cpp | 111 for (unsigned i = 0, N = Children.size(); i < N; ++i) 112 delete Children[i]; 186 for (unsigned j = 0, M = Children.size(); j < M; ++j) { 187 Children[j]->print(O, IndentCount+4);
|
H A D | DwarfDebug.cpp | 584 SmallVectorImpl<DIE*> &Children) { 593 Children.push_back(Arg); 603 Children.push_back(Ellipsis); 612 Children.push_back(Variable); 618 Children.push_back(Nested); 629 SmallVector<DIE *, 8> Children; local 655 ObjectPointer = createScopeChildrenDIE(TheCU, Scope, Children); 664 if (Children.empty() && Range.first == Range.second) 674 assert(Children.empty() && 680 ObjectPointer = createScopeChildrenDIE(TheCU, Scope, Children); 583 createScopeChildrenDIE(CompileUnit *TheCU, LexicalScope *Scope, SmallVectorImpl<DIE*> &Children) argument 1566 const SmallVectorImpl<LexicalScope *> &Children = S->getChildren(); local 1952 const std::vector<DIE *> &Children = Die->getChildren(); local 2165 const std::vector<DIE *> &Children = Die->getChildren(); local [all...] |
/freebsd-10.3-release/contrib/llvm/lib/Transforms/Utils/ |
H A D | BasicBlockUtils.cpp | 173 SmallVector<DomTreeNode*, 8> Children(DTN->begin(), DTN->end()); 174 for (SmallVectorImpl<DomTreeNode *>::iterator DI = Children.begin(), 175 DE = Children.end(); DI != DE; ++DI) 286 std::vector<DomTreeNode *> Children; local 289 Children.push_back(*I); 292 for (std::vector<DomTreeNode *>::iterator I = Children.begin(), 293 E = Children.end(); I != E; ++I)
|
H A D | LoopSimplify.cpp | 350 const std::vector<DomTreeNodeBase<BasicBlock> *> &Children = local 352 while (!Children.empty()) { 353 DomTreeNode *Child = Children.front();
|
H A D | CodeExtractor.cpp | 273 SmallVector<DomTreeNode*, 8> Children; local 276 Children.push_back(*DI); 280 for (SmallVectorImpl<DomTreeNode *>::iterator I = Children.begin(), 281 E = Children.end(); I != E; ++I)
|
/freebsd-10.3-release/contrib/llvm/lib/Support/ |
H A D | Dwarf.cpp | 105 const char *llvm::dwarf::ChildrenString(unsigned Children) { argument 106 switch (Children) {
|
/freebsd-10.3-release/contrib/llvm/tools/clang/include/clang/AST/ |
H A D | Stmt.h | 1776 Stmt *Children[2]; member in class:clang::SEHExceptStmt 1801 return reinterpret_cast<Expr*>(Children[FILTER_EXPR]); 1805 return cast<CompoundStmt>(Children[BLOCK]); 1809 return child_range(Children,Children+2); 1855 Stmt *Children[2]; member in class:clang::SEHTryStmt 1877 SourceLocation getEndLoc() const { return Children[HANDLER]->getLocEnd(); } 1882 return cast<CompoundStmt>(Children[TRY]); 1885 Stmt *getHandler() const { return Children[HANDLER]; } 1892 return child_range(Children,Childre [all...] |