Searched refs:Leaves (Results 1 – 10 of 10) sorted by relevance
/freebsd/contrib/llvm-project/llvm/utils/TableGen/GlobalISel/ |
H A D | GIMatchTree.cpp |
|
H A D | GIMatchTree.h |
|
/freebsd/contrib/llvm-project/clang/lib/Basic/ |
H A D | OpenMPKinds.cpp | 622 ArrayRef<Directive> Leaves = getLeafConstructs(DKind); in isOpenMPNestingTeamsDirective() local 623 return !Leaves.empty() && Leaves.front() == OMPD_teams; in isOpenMPNestingTeamsDirective() 645 ArrayRef<Directive> Leaves = getLeafConstructs(Kind); in isOpenMPNestingDistributeDirective() local 646 return !Leaves.empty() && Leaves.front() == OMPD_distribute; in isOpenMPNestingDistributeDirective() 657 ArrayRef<Directive> Leaves = getLeafConstructs(Kind); in isOpenMPGenericLoopDirective() local 658 return !Leaves.empty() && Leaves.back() == OMPD_loop; in isOpenMPGenericLoopDirective()
|
/freebsd/contrib/llvm-project/llvm/utils/TableGen/ |
H A D | DirectiveEmitter.cpp | 522 std::vector<Record *> Leaves = Dir.getLeafConstructs(); in EmitLeafTable() local 527 List[1] = Leaves.size(); // The number of leaves to follow. in EmitLeafTable() 531 static_cast<size_t>(I) < Leaves.size() ? DirId.at(Leaves[I]) : -1; in EmitLeafTable() 584 auto &Leaves = LeafTable[Ordering[I]]; in EmitLeafTable() local 585 OS << " {" << GetDirectiveName(DirLang, Directives[Leaves[0]]); in EmitLeafTable() 586 OS << ", static_cast<" << DirectiveType << ">(" << Leaves[1] << "),"; in EmitLeafTable() 587 for (size_t I = 2, E = Leaves.size(); I != E; ++I) { in EmitLeafTable() 588 int Idx = Leaves[I]; in EmitLeafTable() 590 OS << ' ' << GetDirectiveName(DirLang, Directives[Leaves[I]]) << ','; in EmitLeafTable()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86PartialReduction.cpp | 435 static void collectLeaves(Value *Root, SmallVectorImpl<Instruction *> &Leaves) { in collectLeaves() argument 495 Leaves.push_back(I); in collectLeaves() 527 SmallVector<Instruction *, 8> Leaves; in runOnFunction() local 528 collectLeaves(Root, Leaves); in runOnFunction() 530 for (Instruction *I : Leaves) { in runOnFunction()
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
H A D | HexagonISelDAGToDAG.cpp | 2093 LeafPrioQueue Leaves(NOpcode); in balanceSubTree() local 2165 Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++)); in balanceSubTree() 2176 Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++)); in balanceSubTree() 2228 Leaves.push(WeightedLeaf(New, Weight, Mul1.InsertionOrder)); in balanceSubTree() 2232 Leaves.push(Mul1); in balanceSubTree() 2234 Leaves.push(Mul2); in balanceSubTree() 2242 if (NOpcode == ISD::ADD && GA.Value.getNode() && Leaves.hasConst() && in balanceSubTree() 2246 ConstantSDNode *Offset = cast<ConstantSDNode>(Leaves.top().Value); in balanceSubTree() 2260 GA.Weight += Leaves.top().Weight; in balanceSubTree() 2265 Leaves.pop(); // Remove the offset constant from the queue in balanceSubTree() [all …]
|
/freebsd/share/misc/ |
H A D | flowers | 20 Leaves (dead):Melancholy.
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | Reassociate.cpp | 421 LeafMap Leaves; // Leaf -> Total weight so far. in LinearizeExprTree() local 452 LeafMap::iterator It = Leaves.find(Op); in LinearizeExprTree() 453 if (It == Leaves.end()) { in LinearizeExprTree() 462 Leaves[Op] = Weight; in LinearizeExprTree() 468 assert(It != Leaves.end() && Visited.count(Op) && in LinearizeExprTree() 482 Leaves.erase(It); // Since the value may be morphed below. in LinearizeExprTree() 524 Leaves[Op] = Weight; in LinearizeExprTree() 531 LeafMap::iterator It = Leaves.find(V); in LinearizeExprTree() 532 if (It == Leaves.end()) in LinearizeExprTree()
|
H A D | LowerMatrixIntrinsics.cpp | 2472 SmallVector<Value *, 4> Leaves; in getExpressionLeaves() local 2478 Leaves.push_back(Expr); in getExpressionLeaves() 2479 return Leaves; in getExpressionLeaves() 2557 auto Leaves = getExpressionLeaves(ExprsInSubprogram); in emitRemarks() local 2560 for (Value *Leaf : Leaves) in emitRemarks() 2564 for (auto *L : Leaves) { in emitRemarks()
|
/freebsd/contrib/llvm-project/clang/include/clang/Tooling/Syntax/ |
H A D | Syntax.td | 12 // - Leaves, owning exactly one token. (syntax::Leaf)
|