| /external/llvm-project/llvm/utils/TableGen/GlobalISel/ |
| D | GIMatchTree.cpp | 214 Partitioner->repartition(Leaves); in evaluatePartitioners()
222 for (const auto &Leaf : Leaves) { in runStep()
241 auto FullyTestedLeafI = Leaves.end(); in runStep()
242 for (auto LeafI = Leaves.begin(), LeafE = Leaves.end(); in runStep()
246 else if (FullyTestedLeafI != Leaves.end()) { in runStep()
265 if (Leaves.size() > 1) { in runStep()
269 std::find_if(Leaves.begin(), Leaves.end(), in runStep()
274 if (FirstFullyTested != Leaves.end()) in runStep()
278 for (auto &Leaf : make_range(Leaves.begin(), FirstFullyTested)) in runStep()
280 for (const auto &Leaf : make_range(FirstFullyTested, Leaves.end())) in runStep()
[all …]
|
| D | GIMatchTree.h | 394 LeafVec Leaves;
426 Leaves.emplace_back(*this, Name, RootIdx, MatchDag, Data); in addLeaf()
428 void addLeaf(const GIMatchTreeBuilderLeafInfo &L) { Leaves.push_back(L); } in addLeaf()
435 LeafVec &getPossibleLeaves() { return Leaves; } in getPossibleLeaves()
490 virtual void repartition(GIMatchTreeBuilder::LeafVec &Leaves) = 0;
578 void repartition(GIMatchTreeBuilder::LeafVec &Leaves) override;
619 void repartition(GIMatchTreeBuilder::LeafVec &Leaves) override;
|
| /external/llvm-project/llvm/lib/Target/X86/ |
| D | X86PartialReduction.cpp | 378 static void collectLeaves(Value *Root, SmallVectorImpl<Instruction *> &Leaves) { in collectLeaves() argument
441 Leaves.push_back(I); in collectLeaves()
472 SmallVector<Instruction *, 8> Leaves; in runOnFunction() local
473 collectLeaves(Root, Leaves); in runOnFunction()
475 for (Instruction *I : Leaves) { in runOnFunction()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/ |
| D | HexagonISelDAGToDAG.cpp | 1936 LeafPrioQueue Leaves(NOpcode); in balanceSubTree() local
2008 Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++)); in balanceSubTree()
2019 Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++)); in balanceSubTree()
2071 Leaves.push(WeightedLeaf(New, Weight, Mul1.InsertionOrder)); in balanceSubTree()
2075 Leaves.push(Mul1); in balanceSubTree()
2077 Leaves.push(Mul2); in balanceSubTree()
2085 if (NOpcode == ISD::ADD && GA.Value.getNode() && Leaves.hasConst() && in balanceSubTree()
2089 ConstantSDNode *Offset = cast<ConstantSDNode>(Leaves.top().Value); in balanceSubTree()
2103 GA.Weight += Leaves.top().Weight; in balanceSubTree()
2108 Leaves.pop(); // Remove the offset constant from the queue in balanceSubTree()
[all …]
|
| /external/llvm-project/llvm/lib/Target/Hexagon/ |
| D | HexagonISelDAGToDAG.cpp | 1943 LeafPrioQueue Leaves(NOpcode); in balanceSubTree() local
2015 Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++)); in balanceSubTree()
2026 Leaves.push(WeightedLeaf(Child, Weight, InsertionOrder++)); in balanceSubTree()
2078 Leaves.push(WeightedLeaf(New, Weight, Mul1.InsertionOrder)); in balanceSubTree()
2082 Leaves.push(Mul1); in balanceSubTree()
2084 Leaves.push(Mul2); in balanceSubTree()
2092 if (NOpcode == ISD::ADD && GA.Value.getNode() && Leaves.hasConst() && in balanceSubTree()
2096 ConstantSDNode *Offset = cast<ConstantSDNode>(Leaves.top().Value); in balanceSubTree()
2110 GA.Weight += Leaves.top().Weight; in balanceSubTree()
2115 Leaves.pop(); // Remove the offset constant from the queue in balanceSubTree()
[all …]
|
| /external/llvm/lib/Transforms/Scalar/ |
| D | Reassociate.cpp | 471 LeafMap Leaves; // Leaf -> Total weight so far. in LinearizeExprTree() local
497 LeafMap::iterator It = Leaves.find(Op); in LinearizeExprTree()
498 if (It == Leaves.end()) { in LinearizeExprTree()
506 Leaves[Op] = Weight; in LinearizeExprTree()
510 } else if (It != Leaves.end()) { in LinearizeExprTree()
531 Leaves.erase(It); in LinearizeExprTree()
543 Leaves.erase(It); // Since the value may be morphed below. in LinearizeExprTree()
575 Leaves[Op] = Weight; in LinearizeExprTree()
583 LeafMap::iterator It = Leaves.find(V); in LinearizeExprTree()
584 if (It == Leaves.end()) in LinearizeExprTree()
|
| /external/llvm-project/clang/lib/Tooling/ASTDiff/ |
| D | ASTDiff.cpp | 134 std::vector<NodeId> Leaves; member in clang::diff::SyntaxTree::Impl
227 Tree.Leaves.push_back(MyId); in PostTraverse()
320 for (NodeId Leaf : Leaves) { in setLeftMostDescendants()
540 void computeKeyRoots(int Leaves) { in computeKeyRoots() argument
541 KeyRoots.resize(Leaves); in computeKeyRoots()
543 int K = Leaves - 1; in computeKeyRoots()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Transforms/Scalar/ |
| D | Reassociate.cpp | 492 LeafMap Leaves; // Leaf -> Total weight so far. in LinearizeExprTree() local
518 LeafMap::iterator It = Leaves.find(Op); in LinearizeExprTree()
519 if (It == Leaves.end()) { in LinearizeExprTree()
528 Leaves[Op] = Weight; in LinearizeExprTree()
534 assert(It != Leaves.end() && Visited.count(Op) && in LinearizeExprTree()
554 Leaves.erase(It); in LinearizeExprTree()
566 Leaves.erase(It); // Since the value may be morphed below. in LinearizeExprTree()
599 Leaves[Op] = Weight; in LinearizeExprTree()
607 LeafMap::iterator It = Leaves.find(V); in LinearizeExprTree()
608 if (It == Leaves.end()) in LinearizeExprTree()
|
| /external/llvm-project/llvm/lib/Transforms/Scalar/ |
| D | Reassociate.cpp | 493 LeafMap Leaves; // Leaf -> Total weight so far. in LinearizeExprTree() local
519 LeafMap::iterator It = Leaves.find(Op); in LinearizeExprTree()
520 if (It == Leaves.end()) { in LinearizeExprTree()
529 Leaves[Op] = Weight; in LinearizeExprTree()
535 assert(It != Leaves.end() && Visited.count(Op) && in LinearizeExprTree()
555 Leaves.erase(It); in LinearizeExprTree()
567 Leaves.erase(It); // Since the value may be morphed below. in LinearizeExprTree()
600 Leaves[Op] = Weight; in LinearizeExprTree()
608 LeafMap::iterator It = Leaves.find(V); in LinearizeExprTree()
609 if (It == Leaves.end()) in LinearizeExprTree()
|
| D | LowerMatrixIntrinsics.cpp | 1791 SmallVector<Value *, 4> Leaves; in getExpressionLeaves() local
1797 Leaves.push_back(Expr); in getExpressionLeaves()
1798 return Leaves; in getExpressionLeaves()
1877 auto Leaves = getExpressionLeaves(ExprsInSubprogram); in emitRemarks() local
1880 for (Value *Leaf : Leaves) in emitRemarks()
1884 for (auto *L : Leaves) { in emitRemarks()
|
| /external/llvm-project/clang/include/clang/Tooling/Syntax/ |
| D | Syntax.td | 12 // - Leaves, owning exactly one token. (syntax::Leaf)
|
| /external/tensorflow/tensorflow/core/kernels/boosted_trees/ |
| D | boosted_trees.proto | 30 // Leaves can either hold dense or sparse information.
|
| /external/skqp/docs/ |
| D | undocumented.bmh | 369 Leaves glyph outlines unchanged from their native representation.
|
| /external/icu/tools/icu4c_srcgen/doc_patches/patches/unicode/ |
| D | utext.h.patch | 291 - * Leaves the current iteration position at the position following the
|
| /external/llvm-project/llvm/test/CodeGen/AMDGPU/GlobalISel/ |
| D | legalize-extract.mir | 518 # FIXME: Leaves behind dead G_TRUNC
|
| /external/kotlinx.coroutines/benchmarks/src/jmh/resources/ |
| D | words.shakespeare.txt.gz | 1a
2A
3Aaron
4AARON
5abaissiez
6abandon
7abandoned
8abase
9Abase
10 ... |