Home
last modified time | relevance | path

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

12

/freebsd/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/
H A DGIMatchTree.cpp
/freebsd/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DNodes.cpp204 syntax::Leaf *syntax::UnaryOperatorExpression::getOperatorToken() { in getOperatorToken()
205 return cast_or_null<syntax::Leaf>(findChild(syntax::NodeRole::OperatorToken)); in getOperatorToken()
212 syntax::Leaf *syntax::BinaryOperatorExpression::getOperatorToken() { in getOperatorToken()
213 return cast_or_null<syntax::Leaf>(findChild(syntax::NodeRole::OperatorToken)); in getOperatorToken()
221 syntax::Leaf *syntax::SwitchStatement::getSwitchKeyword() { in getSwitchKeyword()
222 return cast_or_null<syntax::Leaf>( in getSwitchKeyword()
231 syntax::Leaf *syntax::CaseStatement::getCaseKeyword() { in getCaseKeyword()
232 return cast_or_null<syntax::Leaf>( in getCaseKeyword()
246 syntax::Leaf *syntax::DefaultStatement::getDefaultKeyword() { in getDefaultKeyword()
247 return cast_or_null<syntax::Leaf>( in getDefaultKeyword()
[all …]
H A DTree.cpp35 syntax::Leaf::Leaf(syntax::TokenManager::Key K) : Node(NodeKind::Leaf), K(K) {} in Leaf() function in syntax::Leaf
186 if (const auto *L = dyn_cast<syntax::Leaf>(N)) { in dumpNode()
231 if (const auto *L = dyn_cast<syntax::Leaf>(N)) { in dumpTokens()
268 assert(isa<Leaf>(C)); in assertInvariants()
283 const syntax::Leaf *syntax::Tree::findFirstLeaf() const { in findFirstLeaf()
285 if (const auto *L = dyn_cast<syntax::Leaf>(&C)) in findFirstLeaf()
293 const syntax::Leaf *syntax::Tree::findLastLeaf() const { in findLastLeaf()
295 if (const auto *L = dyn_cast<syntax::Leaf>(C)) in findLastLeaf()
328 Children.push_back({ElementWithoutDelimiter, cast<syntax::Leaf>(&C)}); in getElementsAsNodesAndDelimiters()
H A DSynthesis.cpp40 syntax::Leaf *clang::syntax::createLeaf(syntax::Arena &A, in createLeaf()
50 auto *Leaf = new (A.getAllocator()) syntax::Leaf( in createLeaf() local
52 syntax::FactoryImpl::setCanModify(Leaf); in createLeaf()
53 Leaf->assertInvariants(); in createLeaf()
54 return Leaf; in createLeaf()
57 syntax::Leaf *clang::syntax::createLeaf(syntax::Arena &A, in createLeaf()
72 case syntax::NodeKind::Leaf: in allocateTree()
220 if (const auto *L = dyn_cast<syntax::Leaf>(N)) in deepCopyExpandingMacros()
H A DComputeReplacements.cpp46 auto *L = cast<syntax::Leaf>(N); in enumerateTokenSpans()
/freebsd/contrib/llvm-project/clang/include/clang/Tooling/Syntax/
H A DNodes.h159 Leaf *getOperatorToken();
203 Leaf *getOperatorToken();
242 Leaf *getSwitchKeyword();
251 Leaf *getCaseKeyword();
261 Leaf *getDefaultKeyword();
271 Leaf *getIfKeyword();
273 Leaf *getElseKeyword();
282 Leaf *getForKeyword();
291 Leaf *getWhileKeyword();
300 Leaf *getContinueKeyword();
[all …]
H A DTree.h132 class Leaf final : public Node {
134 Leaf(TokenManager::Key K);
184 const Leaf *findFirstLeaf() const;
185 Leaf *findFirstLeaf() { in findFirstLeaf()
186 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findFirstLeaf()); in findFirstLeaf()
189 const Leaf *findLastLeaf() const;
190 Leaf *findLastLeaf() { in findLastLeaf()
191 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findLastLeaf()); in findLastLeaf()
258 Leaf *delimiter;
H A DBuildTree.h33 syntax::Leaf *createLeaf(syntax::Arena &A, TokenBufferTokenManager &TBTM,
38 syntax::Leaf *createLeaf(syntax::Arena &A, TokenBufferTokenManager &TBTM,
H A DSyntax.td12 // - Leaves, owning exactly one token. (syntax::Leaf)
52 def Leaf : External<Node> {}
78 // are permitted (for Leaf nodes). These invariants are not enforced.
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp156 BasicBlock *NewLeafBlock(CaseRange &Leaf, Value *Val, ConstantInt *LowerBound, in NewLeafBlock() argument
165 if (Leaf.Low == Leaf.High) { in NewLeafBlock()
168 new ICmpInst(NewLeaf, ICmpInst::ICMP_EQ, Val, Leaf.Low, "SwitchLeaf"); in NewLeafBlock()
171 if (Leaf.Low == LowerBound) { in NewLeafBlock()
173 Comp = new ICmpInst(NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High, in NewLeafBlock()
175 } else if (Leaf.High == UpperBound) { in NewLeafBlock()
177 Comp = new ICmpInst(NewLeaf, ICmpInst::ICMP_SGE, Val, Leaf.Low, in NewLeafBlock()
179 } else if (Leaf.Low->isZero()) { in NewLeafBlock()
181 Comp = new ICmpInst(NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf.High, in NewLeafBlock()
185 Constant *NegLo = ConstantExpr::getNeg(Leaf.Low); in NewLeafBlock()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerIO.cpp176 static bool MkDirRecursiveInner(const std::string &Leaf) { in MkDirRecursiveInner() argument
178 if (Leaf == ".") in MkDirRecursiveInner()
181 const std::string &Dir = DirName(Leaf); in MkDirRecursiveInner()
184 MkDir(Leaf); in MkDirRecursiveInner()
185 return IsDirectory(Leaf); in MkDirRecursiveInner()
194 MkDir(Leaf); in MkDirRecursiveInner()
195 return IsDirectory(Leaf); in MkDirRecursiveInner()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DIntervalMap.h215 // 8 4 16 0 Leaf<4,4>, Branch<4>
216 // 8 8 12 0 Leaf<4,8>, Branch<8>
217 // 16 4 9 12 Leaf<8,4>
218 // 16 8 8 0 Leaf<8,8>
549 // Leaf nodes store up to N disjoint intervals with corresponding values.
804 // Leaf accessors.
938 using Leaf = IntervalMapImpl::LeafNode<KeyT, ValT, Sizer::LeafSize, Traits>; variable
1208 return NR.get<Leaf>().safeLookup(x, NotFound); in treeSafeLookup()
1218 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1; in branchRoot()
1228 NewOffset = distribute(Nodes, rootSize, Leaf in branchRoot()
[all...]
/freebsd/contrib/llvm-project/clang/lib/Rewrite/
H A DRewriteRope.cpp621 if (auto *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in Destroy() local
622 delete Leaf; in Destroy()
635 if (auto *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in split() local
636 return Leaf->split(Offset); in split()
649 if (auto *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in insert() local
650 return Leaf->insert(Offset, R); in insert()
658 if (auto *Leaf = dyn_cast<RopePieceBTreeLeaf>(this)) in erase() local
659 return Leaf->erase(Offset, NumBytes); in erase()
739 if (auto *Leaf = dyn_cast<RopePieceBTreeLeaf>(getRoot(Root))) in clear() local
740 Leaf->clear(); in clear()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86InstrSGX.td18 // ENCLS - Execute an Enclave System Function of Specified Leaf Number
22 // ENCLU - Execute an Enclave User Function of Specified Leaf Number
26 // ENCLV - Execute an Enclave VMM Function of Specified Leaf Number
/freebsd/contrib/llvm-project/llvm/utils/TableGen/
H A DGICombinerEmitter.cpp
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DCVTypeVisitor.cpp171 TypeLeafKind Leaf; in visitFieldListMemberStream() local
173 if (auto EC = Reader.readEnum(Leaf)) in visitFieldListMemberStream()
177 Record.Kind = Leaf; in visitFieldListMemberStream()
H A DCodeViewRecordIO.cpp94 uint8_t Leaf = Reader->peek(); in skipPadding() local
95 if (Leaf < LF_PAD0) in skipPadding()
99 unsigned BytesToAdvance = Leaf & 0x0F; in skipPadding()
/freebsd/contrib/llvm-project/llvm/lib/ObjectYAML/
H A DCodeViewYAMLTypes.cpp684 Result.Leaf = Impl; in fromCodeViewRecordImpl()
706 return Leaf->toCodeViewRecord(Serializer); in toCodeViewRecord()
727 Obj.Leaf = std::make_shared<LeafRecordImpl<ConcreteType>>(Kind); in mapLeafRecordImpl()
730 Obj.Leaf->map(IO); in mapLeafRecordImpl()
732 IO.mapRequired(Class, *Obj.Leaf); in mapLeafRecordImpl()
738 Kind = Obj.Leaf->Kind; in mapping()
810 for (const auto &Leaf : Leafs) { in toDebugT() local
811 CVType T = Leaf.Leaf->toCodeViewRecord(TS); in toDebugT()
/freebsd/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-stacks.cpp467 auto *Leaf = *CurrentStack.begin(); in printStack() local
469 std::accumulate(Leaf->ExtraData.TerminalDurations.begin(), in printStack()
470 Leaf->ExtraData.TerminalDurations.end(), 0LL); in printStack()
471 auto LeafFuncId = FN.SymbolOrNumber(Leaf->FuncId); in printStack()
475 Leaf->ExtraData.TerminalDurations.size(), LeafSum); in printStack()
/freebsd/contrib/llvm-project/llvm/include/llvm/ObjectYAML/
H A DCodeViewYAMLTypes.h46 std::shared_ptr<detail::LeafRecordBase> Leaf; member
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DSuffixTree.cpp339 if (auto *Leaf = dyn_cast<SuffixTreeLeafNode>(ChildPair.second)) in advance() local
340 RepeatedSubstringStarts.push_back(Leaf->getSuffixIdx()); in advance()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLowerMatrixIntrinsics.cpp2206 Value *Leaf; member
2216 Value *Leaf) in ExprLinearizer()
2218 ExprsInSubprogram(ExprsInSubprogram), Leaf(Leaf) {} in ExprLinearizer()
2385 assert(SI != Shared.end() && SI->second.count(Leaf)); in linearizeExpr()
2388 if (S == Leaf) in linearizeExpr()
2485 void collectSharedInfo(Value *Leaf, Value *V, in collectSharedInfo()
2493 I.first->second.insert(Leaf); in collectSharedInfo()
2496 collectSharedInfo(Leaf, Op, ExprsInSubprogram, Shared); in collectSharedInfo()
2560 for (Value *Leaf : Leaves) in emitRemarks()
2561 collectSharedInfo(Leaf, Leaf, ExprsInSubprogram, Shared); in emitRemarks()
/freebsd/contrib/llvm-project/clang/lib/Lex/
H A DPPMacroExpansion.cpp188 auto Leaf = LeafModuleMacros.find(II); in updateModuleMacroInfo() local
189 if (Leaf == LeafModuleMacros.end()) { in updateModuleMacroInfo()
203 for (auto *LeafMM : Leaf->second) { in updateModuleMacroInfo()
259 ArrayRef<ModuleMacro*> Leaf; in dumpMacroInfo() local
262 Leaf = LeafIt->second; in dumpMacroInfo()
291 llvm::SmallVector<ModuleMacro *, 16> Worklist(Leaf.begin(), Leaf.end()); in dumpMacroInfo()
/freebsd/lib/libc/net/
H A Dprotocols31 leaf-1 25 LEAF-1 # Leaf-1
32 leaf-2 26 LEAF-2 # Leaf-2
/freebsd/contrib/libxo/doc/
H A Dfield-modifiers.rst221 .. index:: Field Modifiers; Leaf-List
224 The Leaf-List Modifier ({l:})
227 .. index:: Field Modifiers; Leaf-List

12