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

  /src/external/apache2/llvm/dist/llvm/lib/Target/X86/
X86PartialReduction.cpp 358 // found a loop and it is safe to step through this Add to find more leaves.
374 // Collect all the leaves of the tree of adds that feeds into the horizontal
378 static void collectLeaves(Value *Root, SmallVectorImpl<Instruction *> &Leaves) {
438 Leaves.push_back(I);
469 SmallVector<Instruction *, 8> Leaves;
470 collectLeaves(Root, Leaves);
472 for (Instruction *I : Leaves) {
  /src/external/apache2/llvm/dist/llvm/utils/TableGen/GlobalISel/
GIMatchTree.h 125 /// All the leaves that are possible for this node of the tree.
390 /// The leaves that the resulting decision tree will distinguish.
391 LeafVec Leaves;
423 Leaves.emplace_back(*this, Name, RootIdx, MatchDag, Data);
425 void addLeaf(const GIMatchTreeBuilderLeafInfo &L) { Leaves.push_back(L); }
432 LeafVec &getPossibleLeaves() { return Leaves; }
445 /// leaves. The keys must be consecutive integers starting from 0. This can
451 /// sequence. The values are a bitvector indicating which leaves belong to
459 /// Determines which partitions the given leaves belong to. A leaf may belong
467 /// * Not all DAG's for the leaves may be able to perform the test. Fo
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/Tooling/ASTDiff/
ASTDiff.cpp 134 std::vector<NodeId> Leaves;
227 Tree.Leaves.push_back(MyId);
320 for (NodeId Leaf : Leaves) {
540 void computeKeyRoots(int Leaves) {
541 KeyRoots.resize(Leaves);
543 int K = Leaves - 1;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LowerMatrixIntrinsics.cpp 1616 /// Mapping from values to the leaves of all expressions that the value is
1797 // Is Expr shared with other expression leaves?
1865 /// 2. Collect leaves of matrix expressions (done in
1867 // mapping. Leaves are lowered matrix instructions without other matrix
1872 /// that multiple leaves can share sub-expressions. Shared subexpressions
1885 /// Return all leaves of the expressions in \p ExprsInSubprogram. Those are
1890 SmallVector<Value *, 4> Leaves;
1896 Leaves.push_back(Expr);
1897 return Leaves;
1975 auto Leaves = getExpressionLeaves(ExprsInSubprogram)
    [all...]

Completed in 96 milliseconds