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

/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DNodes.cpp15 case NodeKind::Leaf:
16 return OS << "Leaf";
111 syntax::Leaf *syntax::SwitchStatement::switchKeyword() {
112 return llvm::cast_or_null<syntax::Leaf>(
121 syntax::Leaf *syntax::CaseStatement::caseKeyword() {
122 return llvm::cast_or_null<syntax::Leaf>(
136 syntax::Leaf *syntax::DefaultStatement::defaultKeyword() {
137 return llvm::cast_or_null<syntax::Leaf>(
146 syntax::Leaf *syntax::IfStatement::ifKeyword() {
147 return llvm::cast_or_null<syntax::Leaf>(
[all...]
H A DTree.cpp51 syntax::Leaf::Leaf(const syntax::Token *Tok) : Node(NodeKind::Leaf), Tok(Tok) { function in class:syntax::Leaf
55 bool syntax::Leaf::classof(const Node *N) {
56 return N->kind() == NodeKind::Leaf;
66 bool syntax::Tree::classof(const Node *N) { return N->kind() > NodeKind::Leaf; }
157 if (auto *L = llvm::dyn_cast<syntax::Leaf>(N)) {
197 auto *L = llvm::dyn_cast<syntax::Leaf>(N);
231 syntax::Leaf *syntax::Tree::firstLeaf() {
234 if (auto *L = dyn_cast<syntax::Leaf>(
[all...]
H A DSynthesis.cpp24 clang::syntax::Leaf *syntax::createPunctuation(clang::syntax::Arena &A,
31 auto *L = new (A.allocator()) clang::syntax::Leaf(Tokens.begin());
H A DComputeReplacements.cpp40 auto *L = cast<syntax::Leaf>(N);
H A DBuildTree.cpp166 auto *L = new (A.allocator()) syntax::Leaf(&T);
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp39 for (const auto &Leaf : PossibleLeaves) {
40 OS << Separator << Leaf.getName();
42 if (!Leaf.isFullyTraversed())
44 if (!Leaf.isFullyTested())
52 for (const GIMatchTreeLeafInfo &Leaf : PossibleLeaves) {
53 if (Leaf.isFullyTested())
55 OS << "\\n" << Leaf.getName() << ": " << &Leaf;
56 for (const GIMatchDagPredicate *P : Leaf.untested_predicates())
221 for (const auto &Leaf
545 auto &Leaf = EnumeratedLeaf.value(); local
713 auto &Leaf = EnumeratedLeaf.value(); local
729 auto &Leaf = std::get<0>(I); local
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/Syntax/
H A DTree.h74 /// A node in a syntax tree. Each node is either a Leaf (representing tokens) or
138 class Leaf final : public Node {
140 Leaf(const syntax::Token *T);
158 Leaf *firstLeaf();
159 const Leaf *firstLeaf() const {
163 Leaf *lastLeaf();
164 const Leaf *lastLeaf() const { return const_cast<Tree *>(this)->lastLeaf(); }
H A DBuildTree.h27 clang::syntax::Leaf *createPunctuation(clang::syntax::Arena &A,
H A DNodes.h38 Leaf, member in class:clang::syntax::NodeKind
185 syntax::Leaf *switchKeyword();
196 syntax::Leaf *caseKeyword();
208 syntax::Leaf *defaultKeyword();
220 syntax::Leaf *ifKeyword();
222 syntax::Leaf *elseKeyword();
233 syntax::Leaf *forKeyword();
244 syntax::Leaf *whileKeyword();
255 syntax::Leaf *continueKeyword();
265 syntax::Leaf *breakKeywor
[all...]
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/pat_trie_/
H A Dpoint_iterators.hpp61 Leaf, \
71 Leaf, \
81 Leaf, \
91 Leaf, \
101 class Leaf,
117 Leaf>::other::const_pointer
122 Leaf>::other::pointer
359 class Leaf,
376 Leaf>::other::const_pointer
381 Leaf>
[all...]
H A Dnode_iterators.hpp60 Leaf, \
71 Leaf, \
81 class Leaf,
98 Leaf>::other::const_pointer
103 Leaf>::other::pointer
258 class Leaf,
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ObjectYAML/
H A DCodeViewYAMLTypes.h46 std::shared_ptr<detail::LeafRecordBase> Leaf; member in struct:llvm::CodeViewYAML::LeafRecord
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp111 BasicBlock *newLeafBlock(CaseRange &Leaf, Value *Val,
333 BasicBlock *LowerSwitch::newLeafBlock(CaseRange &Leaf, Value *Val, argument
344 if (Leaf.Low == Leaf.High) {
347 Leaf.Low, "SwitchLeaf");
350 if (Leaf.Low == LowerBound) {
352 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High,
354 } else if (Leaf.High == UpperBound) {
356 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SGE, Val, Leaf.Low,
358 } else if (Leaf
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/Rewrite/
H A DRewriteRope.cpp621 if (auto *Leaf = dyn_cast<RopePieceBTreeLeaf>(this))
622 delete Leaf;
635 if (auto *Leaf = dyn_cast<RopePieceBTreeLeaf>(this))
636 return Leaf->split(Offset);
649 if (auto *Leaf = dyn_cast<RopePieceBTreeLeaf>(this))
650 return Leaf->insert(Offset, R);
658 if (auto *Leaf = dyn_cast<RopePieceBTreeLeaf>(this))
659 return Leaf->erase(Offset, NumBytes);
739 if (auto *Leaf = dyn_cast<RopePieceBTreeLeaf>(getRoot(Root)))
740 Leaf
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h212 // 8 4 16 0 Leaf<4,4>, Branch<4>
213 // 8 8 12 0 Leaf<4,8>, Branch<8>
214 // 16 4 9 12 Leaf<8,4>
215 // 16 8 8 0 Leaf<8,8>
546 // Leaf nodes store up to N disjoint intervals with corresponding values.
801 // Leaf accessors.
935 using Leaf = IntervalMapImpl::LeafNode<KeyT, ValT, Sizer::LeafSize, Traits>;
1161 return NR.get<Leaf>().safeLookup(x, NotFound);
1171 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1;
1181 NewOffset = distribute(Nodes, rootSize, Leaf
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DCVTypeVisitor.cpp170 TypeLeafKind Leaf; local
172 if (auto EC = Reader.readEnum(Leaf))
176 Record.Kind = Leaf;
H A DCodeViewRecordIO.cpp91 uint8_t Leaf = Reader->peek();
92 if (Leaf < LF_PAD0)
94 // Leaf is greater than 0xf0. We should advance by the number of bytes in
96 unsigned BytesToAdvance = Leaf & 0x0F;
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-stacks.cpp466 auto *Leaf = *CurrentStack.begin(); local
468 std::accumulate(Leaf->ExtraData.TerminalDurations.begin(),
469 Leaf->ExtraData.TerminalDurations.end(), 0LL);
470 auto LeafFuncId = FN.SymbolOrNumber(Leaf->FuncId);
474 Leaf->ExtraData.TerminalDurations.size(), LeafSum);
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DGICombinerEmitter.cpp738 for (const auto &Leaf : Tree.possible_leaves()) {
739 OS << Indent << "// Leaf name: " << Leaf.getName() << "\n";
741 const CombineRule *Rule = Leaf.getTargetData<CombineRule>();
748 for (const auto &VarBinding : Leaf.var_bindings()) {
776 for (const GIMatchDagPredicate *Predicate : Leaf.untested_predicates()) {
824 assert(Leaf.isFullyTraversed());
830 if (Leaf.isFullyTested() &&
H A DGlobalISelEmitter.cpp3381 /// Return the CodeGenRegisterClass associated with \p Leaf if it has one.
3383 getRegClassFromLeaf(TreePatternNode *Leaf);
4499 GlobalISelEmitter::getRegClassFromLeaf(TreePatternNode *Leaf) {
4500 assert(Leaf && "Expected node?");
4501 assert(Leaf->isLeaf() && "Expected leaf?");
4502 Record *RCRec = getInitValueAsRegClass(Leaf->getLeafValue());
H A DCodeGenDAGPatterns.cpp3611 Record *Leaf) {
3612 if (OI.Rec == Leaf)
3617 if (Leaf->isSubClassOf("ValueType"))
3621 if (Leaf->isSubClassOf("ComplexPattern"))
3610 checkOperandClass(CGIOperandList::OperandInfo &OI, Record *Leaf) argument
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ObjectYAML/
H A DCodeViewYAMLTypes.cpp675 Result.Leaf = Impl;
697 return Leaf->toCodeViewRecord(Serializer);
718 Obj.Leaf = std::make_shared<LeafRecordImpl<ConcreteType>>(Kind);
721 Obj.Leaf->map(IO);
723 IO.mapRequired(Class, *Obj.Leaf);
729 Kind = Obj.Leaf->Kind;
801 for (const auto &Leaf : Leafs) {
802 CVType T = Leaf.Leaf->toCodeViewRecord(TS);
/freebsd-11-stable/contrib/llvm-project/clang/lib/Lex/
H A DPPMacroExpansion.cpp189 auto Leaf = LeafModuleMacros.find(II); local
190 if (Leaf == LeafModuleMacros.end()) {
204 for (auto *LeafMM : Leaf->second) {
260 ArrayRef<ModuleMacro*> Leaf; local
263 Leaf = LeafIt->second;
291 llvm::SmallVector<ModuleMacro *, 16> Worklist(Leaf.begin(), Leaf.end());
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/ASTDiff/
H A DASTDiff.cpp319 for (NodeId Leaf : Leaves) {
320 getMutableNode(Leaf).LeftMostDescendant = Leaf;
321 NodeId Parent, Cur = Leaf;
325 getMutableNode(Cur).LeftMostDescendant = Leaf;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineOutliner.cpp559 for (SuffixTreeNode *Leaf : LeafChildren)
560 RS.StartIndices.push_back(Leaf->SuffixIdx);

Completed in 256 milliseconds