Lines Matching +defs:hi +defs:size
84 // The default attempts to balance a modest allocation size with expected user
89 "array-constructor-initial-buffer-size",
91 "set the incremental array construction buffer size (default=32)"),
296 assert(load.getTypeparams().size() == 1 &&
317 assert(load.getTypeparams().size() == 1 &&
1508 if (coorArgs.size() == 0)
1539 assert(shape.size() > 0 && "removing columns for sequence sans shape");
1540 assert(dims <= shape.size() && "removing more columns than exist");
1543 std::size_t e = shape.size() - dims;
1612 assert(args.size() == seqTy.getDimension());
1642 assert(arr.getExtents().size() == aref.subscript().size());
1899 operands.size(), stmtCtx);
1919 // IS_CONTIGUOUS may require an assumed size TYPE(*) to be passed to
2421 // pointing to a null size storage, would not be a nullptr and
3165 assert(load.getTypeparams().size() == 1 &&
3492 assert(arrayOperands.size() == 1 &&
3604 auto seqTy = fir::SequenceType::get(eleTy, shape.size());
3620 auto seqTy = fir::SequenceType::get(eleTy, iters.iterVec().size());
3655 assert(procRef.arguments().size() == 2);
3898 auto hi = [&]() {
3906 builder.genExtentFromTriplet(loc, lo, hi, step, idxTy);
3998 TODO(loc, "TARGET of pointer assignment with runtime size/shape");
4007 if (lbs.size() > 0) {
4009 auto shiftTy = fir::ShiftType::get(eleTy.getContext(), lbs.size());
4017 if (lbs.size() > 0) {
4021 auto shapeTy = fir::ShapeShiftType::get(eleTy.getContext(), lbs.size());
4109 for (unsigned i = 0, end = triples.size(); i < end; i += 3) {
4180 if (extents.size() == 0)
4226 const std::size_t depth = loopStack.size();
4260 auto toTy = fir::SequenceType::get(raggedTy, offsets.size());
4324 static_cast<std::size_t>(rank) == destShape.size());
4384 const std::size_t loopDepth = loopUppers.size();
4469 const std::size_t size = maskExprs.size() - 1;
4488 for (std::remove_const_t<decltype(size)> i = 0; i < size; ++i)
4493 if (const auto *e = maskExprs[size])
4701 *bldr, loc, name, retTy, isPresent, getArgument, operands.size(),
4779 operands.reserve(caller.getPassedArguments().size());
4952 assert(procRef.arguments().size() == 1 &&
4958 assert((destShape.empty() || destShape.size() == 2) &&
4974 assert(destShape.size() == 2 &&
4980 assert(iters.iterVec().size() == 2 &&
5467 assert(destShape.size() == 1 && "vector has rank > 1");
5700 if (triples.size()) {
5745 // Convert to (offset, size)
5747 if (substringBounds.size() != 2) {
5770 auto size =
5773 loc, mlir::arith::CmpIPredicate::sgt, size, zero);
5774 // size = MAX(upper - (lower - 1), 0)
5776 builder.create<mlir::arith::SelectOp>(loc, cmp, size, zero);
5810 // Adjust char length to substring size.
6088 for (unsigned i = 1, end = triples.size(); i < end; i += 3) {
6138 /// Target agnostic computation of the size of an element in the array.
6139 /// Returns the size in bytes with type `index` or a null Value if the element
6140 /// size is not constant.
6164 "array constructor element has unknown size");
6253 // Compute the element size at runtime.
6265 TODO(loc, "PDT size");
6266 // Will call the PDT's size function with the type parameters.
6271 // dynamic size, generating the pointer arithmetic.
6294 // Compute the array size.
6471 mlir::Value buffSize = builder.createTemporary(loc, idxTy, ".buff.size");
6479 // The size of each element may depend on a general expression. Defer
6499 // Compute size of element
6835 if (index != revPath.size() - 1 || !isPointerAssignment()) {
7590 assert(call.arguments().size() == 2);