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

/freebsd-current/contrib/llvm-project/clang/lib/Tooling/Syntax/
H A DNodes.cpp204 syntax::Leaf *syntax::UnaryOperatorExpression::getOperatorToken() {
205 return cast_or_null<syntax::Leaf>(findChild(syntax::NodeRole::OperatorToken));
212 syntax::Leaf *syntax::BinaryOperatorExpression::getOperatorToken() {
213 return cast_or_null<syntax::Leaf>(findChild(syntax::NodeRole::OperatorToken));
221 syntax::Leaf *syntax::SwitchStatement::getSwitchKeyword() {
222 return cast_or_null<syntax::Leaf>(
231 syntax::Leaf *syntax::CaseStatement::getCaseKeyword() {
232 return cast_or_null<syntax::Leaf>(
246 syntax::Leaf *syntax::DefaultStatement::getDefaultKeyword() {
247 return cast_or_null<syntax::Leaf>(
[all...]
H A DTree.cpp35 syntax::Leaf::Leaf(syntax::TokenManager::Key K) : Node(NodeKind::Leaf), K(K) {} function in class:syntax::Leaf
186 if (const auto *L = dyn_cast<syntax::Leaf>(N)) {
231 if (const auto *L = dyn_cast<syntax::Leaf>(N)) {
268 assert(isa<Leaf>(C));
269 // FIXME: re-enable it when there is way to retrieve token kind in Leaf.
270 // assert(cast<Leaf>(C).getToken()->kind() == L->getDelimiterTokenKind());
283 const syntax::Leaf *syntax::Tree::findFirstLeaf() const {
285 if (const auto *L = dyn_cast<syntax::Leaf>(
[all...]
H A DSynthesis.cpp40 syntax::Leaf *clang::syntax::createLeaf(syntax::Arena &A,
50 auto *Leaf = new (A.getAllocator()) syntax::Leaf( local
52 syntax::FactoryImpl::setCanModify(Leaf);
53 Leaf->assertInvariants();
54 return Leaf;
57 syntax::Leaf *clang::syntax::createLeaf(syntax::Arena &A,
72 case syntax::NodeKind::Leaf:
220 if (const auto *L = dyn_cast<syntax::Leaf>(N))
H A DComputeReplacements.cpp46 auto *L = cast<syntax::Leaf>(N);
H A DBuildTree.cpp578 syntax::Leaf(reinterpret_cast<TokenManager::Key>(&T));
/freebsd-current/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 *getContinueKeywor
[all...]
H A DBuildTree.h31 /// Create `Leaf` from token with `Spelling` and assert it has the desired
33 syntax::Leaf *createLeaf(syntax::Arena &A, TokenBufferTokenManager &TBTM,
36 /// Infer the token spelling from its `TokenKind`, then create `Leaf` from
38 syntax::Leaf *createLeaf(syntax::Arena &A, TokenBufferTokenManager &TBTM,
H A DTree.h52 /// A node in a syntax tree. Each node is either a Leaf (representing tokens) or
132 class Leaf final : public Node {
134 Leaf(TokenManager::Key K);
184 const Leaf *findFirstLeaf() const;
185 Leaf *findFirstLeaf() {
186 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findFirstLeaf());
189 const Leaf *findLastLeaf() const;
190 Leaf *findLastLeaf() {
191 return const_cast<Leaf *>(const_cast<const Tree *>(this)->findLastLeaf());
258 Leaf *delimite
[all...]
/freebsd-current/contrib/llvm-project/compiler-rt/lib/fuzzer/
H A DFuzzerIO.cpp176 static bool MkDirRecursiveInner(const std::string &Leaf) { argument
178 if (Leaf == ".")
181 const std::string &Dir = DirName(Leaf);
184 MkDir(Leaf);
185 return IsDirectory(Leaf);
194 MkDir(Leaf);
195 return IsDirectory(Leaf);
/freebsd-current/contrib/llvm-project/llvm/include/llvm/ObjectYAML/
H A DCodeViewYAMLTypes.h46 std::shared_ptr<detail::LeafRecordBase> Leaf; member in struct:llvm::CodeViewYAML::LeafRecord
/freebsd-current/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLowerSwitch.cpp156 BasicBlock *NewLeafBlock(CaseRange &Leaf, Value *Val, ConstantInt *LowerBound, argument
165 if (Leaf.Low == Leaf.High) {
168 new ICmpInst(*NewLeaf, ICmpInst::ICMP_EQ, Val, Leaf.Low, "SwitchLeaf");
171 if (Leaf.Low == LowerBound) {
173 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SLE, Val, Leaf.High,
175 } else if (Leaf.High == UpperBound) {
177 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_SGE, Val, Leaf.Low,
179 } else if (Leaf.Low->isZero()) {
181 Comp = new ICmpInst(*NewLeaf, ICmpInst::ICMP_ULE, Val, Leaf
[all...]
/freebsd-current/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-current/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>;
1208 return NR.get<Leaf>().safeLookup(x, NotFound);
1218 const unsigned Nodes = RootLeaf::Capacity / Leaf::Capacity + 1;
1228 NewOffset = distribute(Nodes, rootSize, Leaf
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/DebugInfo/CodeView/
H A DCVTypeVisitor.cpp171 TypeLeafKind Leaf; local
173 if (auto EC = Reader.readEnum(Leaf))
177 Record.Kind = Leaf;
H A DCodeViewRecordIO.cpp94 uint8_t Leaf = Reader->peek();
95 if (Leaf < LF_PAD0)
97 // Leaf is greater than 0xf0. We should advance by the number of bytes in
99 unsigned BytesToAdvance = Leaf & 0x0F;
/freebsd-current/contrib/llvm-project/llvm/lib/Support/
H A DSuffixTree.cpp259 auto *Leaf = cast<SuffixTreeLeafNode>(ChildPair.second); local
260 RepeatedSubstringStarts.push_back(Leaf->getSuffixIdx());
/freebsd-current/contrib/llvm-project/llvm/tools/llvm-xray/
H A Dxray-stacks.cpp467 auto *Leaf = *CurrentStack.begin(); local
469 std::accumulate(Leaf->ExtraData.TerminalDurations.begin(),
470 Leaf->ExtraData.TerminalDurations.end(), 0LL);
471 auto LeafFuncId = FN.SymbolOrNumber(Leaf->FuncId);
475 Leaf->ExtraData.TerminalDurations.size(), LeafSum);
/freebsd-current/contrib/llvm-project/llvm/lib/ObjectYAML/
H A DCodeViewYAMLTypes.cpp683 Result.Leaf = Impl;
705 return Leaf->toCodeViewRecord(Serializer);
726 Obj.Leaf = std::make_shared<LeafRecordImpl<ConcreteType>>(Kind);
729 Obj.Leaf->map(IO);
731 IO.mapRequired(Class, *Obj.Leaf);
737 Kind = Obj.Leaf->Kind;
809 for (const auto &Leaf : Leafs) {
810 CVType T = Leaf.Leaf->toCodeViewRecord(TS);
/freebsd-current/contrib/llvm-project/clang/lib/Lex/
H A DPPMacroExpansion.cpp188 auto Leaf = LeafModuleMacros.find(II); local
189 if (Leaf == LeafModuleMacros.end()) {
203 for (auto *LeafMM : Leaf->second) {
259 ArrayRef<ModuleMacro*> Leaf; local
262 Leaf = LeafIt->second;
291 llvm::SmallVector<ModuleMacro *, 16> Worklist(Leaf.begin(), Leaf.end());
/freebsd-current/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-current/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLowerMatrixIntrinsics.cpp2107 /// Leaf node of the expression to linearize.
2108 Value *Leaf; member in struct:__anon2943::LowerMatrixIntrinsics::ExprLinearizer
2118 Value *Leaf)
2120 ExprsInSubprogram(ExprsInSubprogram), Leaf(Leaf) {}
2287 assert(SI != Shared.end() && SI->second.count(Leaf));
2290 if (S == Leaf)
2384 /// Recursively traverse expression \p V starting at \p Leaf and add \p Leaf
2387 void collectSharedInfo(Value *Leaf, Valu argument
2114 ExprLinearizer(const DataLayout &DL, const MapVector<Value *, MatrixTy> &Inst2Matrix, const DenseMap<Value *, SmallPtrSet<Value *, 2>> &Shared, const SmallSetVector<Value *, 32> &ExprsInSubprogram, Value *Leaf) argument
[all...]
/freebsd-current/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCInstrInfo.cpp308 // A = FADD X, Y (Leaf)
317 // A = FMA X, M11, M12 (Leaf)
334 // A = FSUB X, Y (Leaf)
341 // A = FSUB X, Y (Leaf)
418 // If this is not Leaf FMA Instr, its 'add' operand should only have one use
511 MachineInstr *Leaf = MRI->getUniqueVRegDef(RegA); local
513 if (IsReassociableFMA(*Leaf, AddOpIdx, MulOpIdx, true)) {
518 if (IsReassociableAddOrSub(*Leaf, InfoArrayIdxFAddInst)) {
800 MachineInstr *Leaf = nullptr; local
807 Leaf
[all...]
/freebsd-current/contrib/llvm-project/llvm/utils/TableGen/
H A DGlobalISelEmitter.cpp444 /// Return the CodeGenRegisterClass associated with \p Leaf if it has one.
446 getRegClassFromLeaf(const TreePatternNode *Leaf);
1761 GlobalISelEmitter::getRegClassFromLeaf(const TreePatternNode *Leaf) { argument
1762 assert(Leaf && "Expected node?");
1763 assert(Leaf->isLeaf() && "Expected leaf?");
1764 Record *RCRec = getInitValueAsRegClass(Leaf->getLeafValue());
H A DCodeGenDAGPatterns.cpp3759 Record *Leaf) {
3760 if (OI.Rec == Leaf)
3765 if (Leaf->isSubClassOf("ValueType"))
3769 if (Leaf->isSubClassOf("ComplexPattern"))
3758 checkOperandClass(CGIOperandList::OperandInfo &OI, Record *Leaf) argument
/freebsd-current/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Readers/
H A DLVCodeViewVisitor.cpp2945 TypeLeafKind Leaf; local
2947 if (Error Err = Reader.readEnum(Leaf))
2951 Record.Kind = Leaf;

Completed in 423 milliseconds