HomeSort by: relevance | last modified time | path
    Searched defs:Leaf (Results 1 - 9 of 9) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/ObjectYAML/
CodeViewYAMLTypes.h 46 std::shared_ptr<detail::LeafRecordBase> Leaf;
  /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/
Synthesis.cpp 37 syntax::Leaf *clang::syntax::createLeaf(syntax::Arena &A, tok::TokenKind K,
46 auto *Leaf = new (A.getAllocator()) syntax::Leaf(Tokens.begin());
47 syntax::FactoryImpl::setCanModify(Leaf);
48 Leaf->assertInvariants();
49 return Leaf;
52 syntax::Leaf *clang::syntax::createLeaf(syntax::Arena &A, tok::TokenKind K) {
65 case syntax::NodeKind::Leaf:
212 if (const auto *L = dyn_cast<syntax::Leaf>(N))
Tree.cpp 51 syntax::Leaf::Leaf(const syntax::Token *Tok) : Node(NodeKind::Leaf), Tok(Tok) {
192 static void dumpLeaf(raw_ostream &OS, const syntax::Leaf *L,
216 if (const auto *L = dyn_cast<syntax::Leaf>(N)) {
261 if (const auto *L = dyn_cast<syntax::Leaf>(N)) {
298 assert(isa<Leaf>(C));
299 assert(cast<Leaf>(C).getToken()->kind() == L->getDelimiterTokenKind());
312 const syntax::Leaf *syntax::Tree::findFirstLeaf() const {
314 if (const auto *L = dyn_cast<syntax::Leaf>(&C)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/CodeView/
CVTypeVisitor.cpp 170 TypeLeafKind Leaf;
172 if (auto EC = Reader.readEnum(Leaf))
176 Record.Kind = Leaf;
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/
GIMatchTree.cpp 40 for (const auto &Leaf : PossibleLeaves) {
41 OS << Separator << Leaf.getName();
43 if (!Leaf.isFullyTraversed())
45 if (!Leaf.isFullyTested())
53 for (const GIMatchTreeLeafInfo &Leaf : PossibleLeaves) {
54 if (Leaf.isFullyTested())
56 OS << "\\n" << Leaf.getName() << ": " << &Leaf;
57 for (const GIMatchDagPredicate *P : Leaf.untested_predicates())
221 for (const auto &Leaf : Leaves)
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Lex/
PPMacroExpansion.cpp 155 // If we were the first overrider for any macro, it's no longer a leaf.
165 // The new macro is always a leaf macro.
191 auto Leaf = LeafModuleMacros.find(II);
192 if (Leaf == LeafModuleMacros.end()) {
206 for (auto *LeafMM : Leaf->second) {
207 assert(LeafMM->getNumOverridingMacros() == 0 && "leaf macro overridden");
262 ArrayRef<ModuleMacro*> Leaf;
265 Leaf = LeafIt->second;
293 llvm::SmallVector<ModuleMacro *, 16> Worklist(Leaf.begin(), Leaf.end())
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-xray/
xray-stacks.cpp 288 // its callees and the timings from when it was a leaf.
467 auto *Leaf = *CurrentStack.begin();
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);
626 // when we get to a leaf function.
656 OS << "Top 10 Stacks by leaf sum:\n\n";
662 OS << "Top 10 Stacks by leaf count:\n\n";
  /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCInstrInfo.cpp 324 // A = FADD X, Y (Leaf)
333 // A = FMA X, M11, M12 (Leaf)
350 // A = FSUB X, Y (Leaf)
357 // A = FSUB X, Y (Leaf)
434 // If this is not Leaf FMA Instr, its 'add' operand should only have one use
455 // Treat it as leaf as we don't care its add operand.
528 MachineInstr *Leaf = MRI->getUniqueVRegDef(RegA);
530 if (IsReassociableFMA(*Leaf, AddOpIdx, MulOpIdx, true)) {
535 if (IsReassociableAddOrSub(*Leaf, InfoArrayIdxFAddInst)) {
819 MachineInstr *Leaf = nullptr
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LowerMatrixIntrinsics.cpp 1603 /// matrix expressions are linarized by starting at an expression leaf and
1623 /// Leaf node of the expression to linearize.
1624 Value *Leaf;
1634 Value *Leaf)
1636 ExprsInSubprogram(ExprsInSubprogram), Leaf(Leaf) {}
1803 assert(SI != Shared.end() && SI->second.count(Leaf));
1806 if (S == Leaf)
1869 /// 3. For each leaf, create a remark containing a linearizied version of the
1871 /// bottom-up traversal of the matrix operands, starting at a leaf. Not
    [all...]

Completed in 40 milliseconds