Home
last modified time | relevance | path

Searched refs:Rank (Results 1 – 25 of 89) sorted by relevance

1234

/llvm-project-15.0.7/flang/lib/Evaluate/
H A Dintrinsics.cpp178 ENUM_CLASS(Rank,
209 Rank rank{Rank::elemental};
253 Rank rank{Rank::elemental};
317 {{"n1", AnyInt, Rank::scalar}, {"n2", AnyInt, Rank::scalar},
324 {{"n1", AnyInt, Rank::scalar}, {"n2", AnyInt, Rank::scalar},
1770 case Rank::scalar: in Match()
1773 case Rank::vector: in Match()
1776 case Rank::matrix: in Match()
1800 case Rank::shape: in Match()
1801 case Rank::array: in Match()
[all …]
H A Dvariable.cpp372 int BaseObject::Rank() const { in Rank() function in Fortran::evaluate::BaseObject
380 int Component::Rank() const { in Rank() function in Fortran::evaluate::Component
384 return base().Rank(); in Rank()
395 int Subscript::Rank() const { in Rank() function in Fortran::evaluate::Subscript
405 int ArrayRef::Rank() const { in Rank() function in Fortran::evaluate::ArrayRef
408 rank += expr.Rank(); in Rank()
419 int CoarrayRef::Rank() const { in Rank() function in Fortran::evaluate::CoarrayRef
423 rank += expr.Rank(); in Rank()
431 int DataRef::Rank() const { in Rank() function in Fortran::evaluate::DataRef
439 int Substring::Rank() const { in Rank() function in Fortran::evaluate::Substring
[all …]
H A Dcall.cpp34 int ActualArgument::AssumedType::Rank() const { return symbol_->Rank(); } in Rank() function in Fortran::evaluate::ActualArgument::AssumedType
51 int ActualArgument::Rank() const { in Rank() function in Fortran::evaluate::ActualArgument
53 return expr->Rank(); in Rank()
55 return std::get<AssumedType>(u_).Rank(); in Rank()
101 int ProcedureDesignator::Rank() const { in Rank() function in Fortran::evaluate::ProcedureDesignator
104 return symbol->Rank(); in Rank()
111 return typeAndShape->Rank(); in Rank()
214 int ProcedureRef::Rank() const { in Rank() function in Fortran::evaluate::ProcedureRef
218 if (int rank{arg->Rank()}; rank > 0) { in Rank()
225 return proc_.Rank(); in Rank()
H A Dshape.cpp37 return shape.Rank() == 0 || in IsExplicitShape()
46 CHECK(arrayConstant.Rank() == 1); in ConstantShape()
67 if (expr && expr->Rank() == 0) { in AsShapeResult()
366 int rank{base.Rank()}; in GetRawLowerBounds()
375 int rank{base.Rank()}; in GetRawLowerBounds()
384 int rank{base.Rank()}; in GetLBOUNDs()
393 int rank{base.Rank()}; in GetLBOUNDs()
715 int rank{symbol.Rank()}; in operator ()()
734 if (ss.Rank() > 0) { in operator ()()
755 if (ss.Rank() > 0) { in operator ()()
[all …]
H A Dfold-implementation.h203 CHECK(ss.Rank() <= 1); in ApplySubscripts()
204 if (ss.Rank() == 1) { in ApplySubscripts()
593 } else if (shift->Rank() > 0 && shift->Rank() != array->Rank() - 1) { in CSHIFT()
596 int rank{array->Rank()}; in CSHIFT()
599 if (shift->Rank() > 0) { in CSHIFT()
683 } else if (shift->Rank() > 0 && shift->Rank() != array->Rank() - 1) { in EOSHIFT()
686 boundary->Rank() != array->Rank() - 1) { in EOSHIFT()
689 int rank{array->Rank()}; in EOSHIFT()
692 if (shift->Rank() > 0) { in EOSHIFT()
800 if (mask->Rank() == 0) { in PACK()
[all …]
H A Dfold-integer.cpp91 return ConstantSubscripts(x.Rank(), ConstantSubscript{1}); in Get()
118 if (int rank{array->Rank()}; rank > 0) { in LBOUND()
120 if (funcRef.Rank() == 0) { in LBOUND()
139 if (symbol.Rank() == rank) { in LBOUND()
172 if (int rank{array->Rank()}; rank > 0) { in UBOUND()
174 if (funcRef.Rank() == 0) { in UBOUND()
193 if (symbol.Rank() == rank) { in UBOUND()
329 if (*dim < 1 || *dim > array->Rank()) { in Test()
371 resultIndices = ConstantSubscripts(array->Rank(), 0); in Test()
957 return Expr<T>{args[0].value().Rank()}; in FoldIntrinsicFunction()
[all …]
H A Dcheck-expression.cpp258 return y.value().Rank() == 0 && in operator ()()
420 if (folded.Rank() == symRank) { in NonPointerInitializationExpr()
428 symbol.name(), symRank, folded.Rank()); in NonPointerInitializationExpr()
431 if (folded.Rank() == 0 && symRank == 0) { in NonPointerInitializationExpr()
434 } else if (folded.Rank() == 0 && symRank > 0) { in NonPointerInitializationExpr()
706 } else if (ultimate.Rank() == 0) { in operator ()()
729 if (x.Rank() == 0) { in operator ()()
746 return x.base().Rank() == 0 && (*this)(x.GetLastSymbol()).value_or(false); in operator ()()
785 } else if (anyTriplet || subscript[j].Rank() > 0) { in CheckSubscripts()
H A Dformatting.cpp38 if (Rank() > 1) { in AsFortran()
41 if (Rank() > 0) { in AsFortran()
71 if (Rank() > 0) { in AsFortran()
81 if (Rank() > 1) { in AsFortran()
84 if (Rank() > 0) { in AsFortran()
98 if (Rank() > 0) { in AsFortran()
734 case Field::Rank: in AsFortran()
744 } else if (field_ == Field::Rank) { in AsFortran()
H A Dconstant.cpp38 CHECK(*dim < Rank()); in ComputeUbounds()
41 ConstantSubscripts ubounds(Rank()); in ComputeUbounds()
42 for (int i{0}; i < Rank(); ++i) { in ComputeUbounds()
337 if (Rank() == 0) { in GetScalarValue()
/llvm-project-15.0.7/mlir/include/mlir/ExecutionEngine/
H A DMemRefUtils.h133 template <typename T, unsigned Rank>
136 using DescriptorType = StridedMemRefType<T, Rank>;
150 std::function<void(StridedMemRefType<T, Rank>)> freeFun =
151 [](StridedMemRefType<T, Rank> descriptor) {
157 assert(shape.size() == Rank); in freeFunc()
158 assert(shapeAlloc.size() == Rank); in freeFunc()
159 for (unsigned i = 0; i < Rank; ++i) in freeFunc()
168 descriptor = detail::makeStridedMemRefDescriptor<Rank>(data, alignedData, in freeFunc()
171 for (StridedMemrefIterator<T, Rank> it = descriptor.begin(), in freeFunc()
H A DCRunnerUtils.h125 template <typename T, int Rank>
209 template <typename T, int Rank>
212 StridedMemrefIterator(StridedMemRefType<T, Rank> &descriptor,
215 StridedMemrefIterator<T, Rank> &operator++() {
216 int dim = Rank - 1;
234 const std::array<int64_t, Rank> &getIndices() { return indices; }
249 std::array<int64_t, Rank> indices = {};
251 StridedMemRefType<T, Rank> &descriptor;
/llvm-project-15.0.7/flang/include/flang/Evaluate/
H A Dvariable.h53 int Rank() const;
83 int Rank() const;
113 int Rank() const;
144 static constexpr int Rank() { return 0; } // always scalar in Rank() function
190 int Rank() const;
222 int Rank() const;
269 int Rank() const;
292 int Rank() const;
329 int Rank() const;
359 int Rank() const;
[all …]
H A Dcall.h63 int Rank() const;
109 int Rank() const;
200 int Rank() const;
226 int Rank() const;
H A Dconstant.h70 int Rank() const { return GetRank(shape_); } in Rank() function
138 if (ConstantBounds::Rank() == 0) { in CLASS_BOILERPLATE()
177 if (Rank() == 0) { in GetScalarValue()
H A Dexpression.h94 int Rank() const;
185 int Rank() const { in Rank() function
186 int rank{left().Rank()}; in Rank()
188 return std::max(rank, right().Rank()); in Rank()
393 static constexpr int Rank() { return 0; }
439 static constexpr int Rank() { return 1; }
648 int Rank() const {
649 return common::visit([](const auto &x) { return x.Rank(); }, u);
736 int Rank() const { return 0; }
790 constexpr int Rank() const { return 0; }
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Scalar/
H A DReassociate.h47 unsigned Rank; member
50 ValueEntry(unsigned R, Value *O) : Rank(R), Op(O) {} in ValueEntry()
54 return LHS.Rank > RHS.Rank; // Sort so that highest rank goes to start.
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DSCCIterator.h260 uint32_t Rank = 0; member
283 if (G1->Rank < G1->Rank) in unionGroups()
288 if (G1->Rank == G2->Rank) in unionGroups()
289 G2->Rank++; in unionGroups()
/llvm-project-15.0.7/llvm/lib/Transforms/Instrumentation/
H A DCFGMST.h71 if (BB1G->Rank < BB2G->Rank) in unionGroups()
76 if (BB1G->Rank == BB2G->Rank) in unionGroups()
77 BB1G->Rank++; in unionGroups()
/llvm-project-15.0.7/flang/test/Semantics/
H A Dselect-rank.f90145 Rank(2)
171 Rank(2)
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp82 dbgs() << ", #" << Ops[i].Rank << "] "; in PrintOps()
176 unsigned Rank = 2; in BuildRankMap() local
180 ValueRankMap[&Arg] = ++Rank; in BuildRankMap()
187 unsigned BBRank = RankMap[BB] = ++Rank << 16; in BuildRankMap()
205 if (unsigned Rank = ValueRankMap[I]) in getRank() local
206 return Rank; // Rank already known? in getRank()
214 Rank = std::max(Rank, getRank(I->getOperand(i))); in getRank()
220 ++Rank; in getRank()
225 return ValueRankMap[I] = Rank; in getRank()
1121 unsigned XRank = Ops[i].Rank; in FindInOperandList()
[all …]
/llvm-project-15.0.7/mlir/test/Integration/Dialect/Standard/CPU/
H A Dtest_subview.mlir43 /// Rank-reducing subview.
52 /// Rank-reducing subview with only leading operands.
/llvm-project-15.0.7/flang/lib/Semantics/
H A Dcheck-declarations.cpp318 if (symbol.Rank() > 0) { in Check()
340 symbol.Rank() == 0) { // C830 in Check()
478 } else if (details.shape().Rank() + details.coshape().Rank() > in CheckObjectEntity()
482 symbol.name(), details.shape().Rank(), details.coshape().Rank(), in CheckObjectEntity()
570 if (details.shape().Rank() > 0) { in CheckObjectEntity()
699 if (arraySpec.Rank() == 0) { in CheckArraySpec()
1204 IsDefinedAssignment(lhs.type(), lhs.Rank(), rhs.type(), rhs.Rank()); in ConflictsWithIntrinsicAssignment()
1223 int rank0{arg0.Rank()}; in ConflictsWithIntrinsicOperator()
1226 int rank1{arg1.Rank()}; in ConflictsWithIntrinsicOperator()
1438 int rank{object->shape().Rank()}; in WarnMissingFinal()
[all …]
H A Dcheck-arithmeticif.cpp29 if (expr->Rank() > 0) { in Leave()
H A Dcheck-call.cpp179 if (!typesCompatible && dummy.type.Rank() == 0 && in CheckExplicitDataArg()
195 } else if (dummy.type.Rank() > 0 && in CheckExplicitDataArg()
200 (actualType.Rank() > 0 || IsArrayElement(actual))) { in CheckExplicitDataArg()
337 } else if (actualRank == 0 && dummy.type.Rank() > 0) { in CheckExplicitDataArg()
542 if (actualRank == dummy.type.Rank() && !actualIsContiguous) { in CheckExplicitDataArg()
728 object.type.Rank() == 0 && proc.IsElemental()}; in CheckExplicitInterfaceArg()
850 if (arg && arg.value().Rank() > 0) { in CheckElementalConformance()
/llvm-project-15.0.7/flang/include/flang/Semantics/
H A Dexpression.h181 if (int rank{result->Rank()}; rank != 0) { in Analyze()
387 return AreConformable(left.Rank(), right.Rank()); in AreConformable()
395 left.Rank(), right.Rank()); in ConformabilityCheck()

1234