dims 180 python_bindings/numpy/ndarray.cpp boost::scoped_array<Py_intptr_t> dims(new Py_intptr_t[nd]); dims 182 python_bindings/numpy/ndarray.cpp dims[n] = python::extract<Py_intptr_t>(shape[n]); dims 183 python_bindings/numpy/ndarray.cpp return ndarray(python::detail::new_reference(PyArray_Zeros(nd, dims.get(), detail::incref_dtype(dt), 0))); dims 192 python_bindings/numpy/ndarray.cpp boost::scoped_array<Py_intptr_t> dims(new Py_intptr_t[nd]); dims 194 python_bindings/numpy/ndarray.cpp dims[n] = python::extract<Py_intptr_t>(shape[n]); dims 195 python_bindings/numpy/ndarray.cpp return ndarray(python::detail::new_reference(PyArray_Empty(nd, dims.get(), detail::incref_dtype(dt), 0))); dims 510 python_bindings/python/Image.cpp const int dims = array.get_nd(); dims 513 python_bindings/python/Image.cpp (halide_dimension_t *)__builtin_alloca(sizeof(halide_dimension_t) * dims); dims 514 python_bindings/python/Image.cpp for (int i = 0; i < dims; i++) { dims 520 python_bindings/python/Image.cpp return buffer_to_python_object(h::Buffer<>(t, host, dims, shape)); dims 511 src/BoundsInference.cpp int dims = args[j].is_image_param() ? p.dimensions() : b.dimensions(); dims 522 src/BoundsInference.cpp {(int)(sizeof(halide_dimension_t) * dims)}, Call::Intrinsic); dims 196 src/Definition.cpp s.definition.contents->schedule.dims() = contents->schedule.dims(); dims 279 src/Func.cpp vector<Dim> &dims = definition.schedule().dims(); dims 280 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { dims 281 src/Func.cpp if (var_name_match(dims[i].var, var.name())) { dims 283 src/Func.cpp dims[i].for_type = t; dims 287 src/Func.cpp if (!dims[i].is_pure() && var.is_rvar && dims 305 src/Func.cpp user_assert(dims[i].for_type != ForType::Vectorized) dims 308 src/Func.cpp << " because Func is already vectorized across " << dims[i].var << "\n"; dims 324 src/Func.cpp vector<Dim> &dims = definition.schedule().dims(); dims 325 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { dims 326 src/Func.cpp if (var_name_match(dims[i].var, var.name())) { dims 328 src/Func.cpp dims[i].device_api = device_api; dims 345 src/Func.cpp for (size_t i = 0; i < definition.schedule().dims().size(); i++) { dims 346 src/Func.cpp oss << " " << definition.schedule().dims()[i].var; dims 611 src/Func.cpp vector<Dim> &dims = definition.schedule().dims(); dims 617 src/Func.cpp vector<bool> is_rfactored(dims.size(), false); dims 623 src/Func.cpp const auto iter = std::find_if(dims.begin(), dims.end(), dims 625 src/Func.cpp user_assert((iter != dims.end()) && (*iter).is_rvar()) dims 630 src/Func.cpp is_rfactored[iter - dims.begin()] = true; dims 634 src/Func.cpp const auto &iter = std::find_if(dims.begin(), dims.end(), dims 636 src/Func.cpp user_assert(iter == dims.end()) dims 648 src/Func.cpp for (int i = dims.size() - 1; i >= 0; --i) { dims 652 src/Func.cpp << ", can't rfactor an inner dimension " << dims[i].var dims 657 src/Func.cpp if (dims[i].is_rvar()) { dims 807 src/Func.cpp intm.function().update(0).schedule().dims() = dims; dims 828 src/Func.cpp const auto iter = std::find_if(dims.begin(), dims.end(), dims 830 src/Func.cpp if (iter == dims.end()) { dims 832 src/Func.cpp dims.insert(dims.end()-1, d); dims 908 src/Func.cpp vector<Dim> &dims = definition.schedule().dims(); dims 911 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { dims 914 src/Func.cpp if (var_name_match(dims[i].var, new_names[j]) && new_names[j] != old) { dims 928 src/Func.cpp for (size_t i = 0; (!found) && i < dims.size(); i++) { dims 929 src/Func.cpp if (var_name_match(dims[i].var, old)) { dims 931 src/Func.cpp old_name = dims[i].var; dims 934 src/Func.cpp dims.insert(dims.begin() + i, dims[i]); dims 935 src/Func.cpp dims[i].var = inner_name; dims 936 src/Func.cpp dims[i+1].var = outer_name; dims 1047 src/Func.cpp vector<Dim> &dims = definition.schedule().dims(); dims 1050 src/Func.cpp for (size_t i = 0; (!found_outer) && i < dims.size(); i++) { dims 1051 src/Func.cpp if (var_name_match(dims[i].var, outer.name())) { dims 1053 src/Func.cpp outer_name = dims[i].var; dims 1054 src/Func.cpp outer_type = dims[i].dim_type; dims 1055 src/Func.cpp dims.erase(dims.begin() + i); dims 1066 src/Func.cpp for (size_t i = 0; (!found_inner) && i < dims.size(); i++) { dims 1067 src/Func.cpp if (var_name_match(dims[i].var, inner.name())) { dims 1069 src/Func.cpp inner_name = dims[i].var; dims 1071 src/Func.cpp dims[i].var = fused_name; dims 1074 src/Func.cpp (dims[i].is_rvar() && ((outer_type == Dim::Type::PureRVar) || dims 1076 src/Func.cpp (!dims[i].is_rvar() && (outer_type == Dim::Type::PureVar))); dims 1078 src/Func.cpp if (dims[i].is_rvar()) { dims 1079 src/Func.cpp dims[i].dim_type = (dims[i].dim_type == Dim::Type::PureRVar) && (outer_type == Dim::Type::PureRVar) ? dims 1167 src/Func.cpp vector<Dim> &dims = schedule.dims(); dims 1169 src/Func.cpp for (size_t i = 0; (!found) && i < dims.size(); i++) { dims 1170 src/Func.cpp if (var_name_match(dims[i].var, old_var.name())) { dims 1172 src/Func.cpp old_name = dims[i].var; dims 1173 src/Func.cpp dims[i].var = new_name; dims 1174 src/Func.cpp dims[i].dim_type = Dim::Type::PureVar; dims 1200 src/Func.cpp vector<Dim> &dims = schedule.dims(); dims 1201 src/Func.cpp for (size_t i = 0; (!found) && i < dims.size(); i++) { dims 1202 src/Func.cpp if (dims[i].var == var) { dims 1204 src/Func.cpp old_name = dims[i].var; dims 1205 src/Func.cpp dims.erase(dims.begin() + i); dims 1309 src/Func.cpp vector<Dim> &dims = schedule.dims(); dims 1310 src/Func.cpp for (size_t i = 0; (!found) && i < dims.size(); i++) { dims 1311 src/Func.cpp if (var_name_match(dims[i].var, old_var.name())) { dims 1313 src/Func.cpp old_name = dims[i].var; dims 1314 src/Func.cpp dims[i].var += "." + new_var.name(); dims 1465 src/Func.cpp vector<Dim> dims = dims_old; dims 1471 src/Func.cpp for (size_t j = 0; j < dims.size(); j++) { dims 1472 src/Func.cpp if (var_name_match(dims[j].var, vars[i].name())) { dims 1486 src/Func.cpp if (dims[idx[i]].is_pure()) continue; dims 1488 src/Func.cpp if (dims[idx[j]].is_pure()) continue; dims 1505 src/Func.cpp dims[sorted[i]] = dims_old[idx[i]]; dims 1508 src/Func.cpp dims_old.swap(dims); dims 1513 src/Func.cpp reorder_vars(definition.schedule().dims(), &vars[0], vars.size(), *this); dims 2233 src/Func.cpp vector<StorageDim> &dims = func.schedule().storage_dims(); dims 2236 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { dims 2237 src/Func.cpp if (var_name_match(dims[i].var, y.name())) { dims 2240 src/Func.cpp } else if (var_name_match(dims[i].var, x.name())) { dims 2241 src/Func.cpp if (found_y) std::swap(dims[i], dims[y_loc]); dims 2250 src/Func.cpp Func &Func::reorder_storage(const std::vector<Var> &dims, size_t start) { dims 2253 src/Func.cpp for (size_t i = start + 1; i < dims.size(); i++) { dims 2254 src/Func.cpp reorder_storage(dims[start], dims[i]); dims 2256 src/Func.cpp if ((dims.size() - start) > 2) { dims 2257 src/Func.cpp reorder_storage(dims, start + 1); dims 2262 src/Func.cpp Func &Func::reorder_storage(const std::vector<Var> &dims) { dims 2263 src/Func.cpp user_assert(dims.size() > 1) << dims 2266 src/Func.cpp return reorder_storage(dims, 0); dims 2272 src/Func.cpp vector<StorageDim> &dims = func.schedule().storage_dims(); dims 2273 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { dims 2274 src/Func.cpp if (var_name_match(dims[i].var, dim.name())) { dims 2275 src/Func.cpp dims[i].alignment = alignment; dims 2287 src/Func.cpp vector<StorageDim> &dims = func.schedule().storage_dims(); dims 2288 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { dims 2289 src/Func.cpp if (var_name_match(dims[i].var, dim.name())) { dims 2290 src/Func.cpp dims[i].fold_factor = factor; dims 2291 src/Func.cpp dims[i].fold_forward = fold_forward; dims 514 src/Func.h EXPORT Func &reorder_storage(const std::vector<Var> &dims, size_t start); dims 1604 src/Func.h EXPORT Func &reorder_storage(const std::vector<Var> &dims); dims 448 src/Function.cpp contents->init_def.schedule().dims().push_back(d); dims 456 src/Function.cpp contents->init_def.schedule().dims().push_back(d); dims 645 src/Function.cpp r.schedule().dims().push_back(d); dims 653 src/Function.cpp r.schedule().dims().push_back(d); dims 660 src/Function.cpp r.schedule().dims().push_back(d); dims 38 src/Inline.cpp for (size_t i = 0; i < s.dims().size(); i++) { dims 39 src/Inline.cpp Dim d = s.dims()[i]; dims 352 src/Parameter.cpp void check_call_arg_types(const std::string &name, std::vector<Expr> *args, int dims) { dims 353 src/Parameter.cpp user_assert(args->size() == (size_t)dims) dims 355 src/Parameter.cpp << name << "\", which has " << dims << " dimensions.\n"; dims 228 src/Parameter.h void check_call_arg_types(const std::string &name, std::vector<Expr> *args, int dims); dims 667 src/Pipeline.cpp int dims; dims 685 src/Pipeline.cpp int dims = output_buffer_types[i].dims; dims 687 src/Pipeline.cpp user_assert(dst[i].dimensions() == dims) dims 692 src/Pipeline.cpp << "\" is " << dims << "-dimensional.\n"; dims 73 src/Prefetch.cpp Box get_buffer_bounds(string name, int dims) { dims 76 src/Prefetch.cpp internal_assert((int)b.size() == dims); dims 84 src/Prefetch.cpp for (int i = 0; i < dims; i++) { dims 130 src/Schedule.cpp std::vector<Dim> dims; dims 201 src/Schedule.cpp copy.contents->dims = contents->dims; dims 250 src/Schedule.cpp return contents->dims; dims 254 src/Schedule.cpp return contents->dims; dims 293 src/Schedule.h const std::vector<Dim> &dims() const; dims 294 src/Schedule.h std::vector<Dim> &dims(); dims 64 src/ScheduleFunctions.cpp const vector<string> &dims, dims 120 src/ScheduleFunctions.cpp for (int i = (int)s.dims().size() - 1; i >= 0; i--) { dims 121 src/ScheduleFunctions.cpp const Dim &dim = s.dims()[i]; dims 156 src/ScheduleFunctions.cpp for (int i = (int)s.dims().size(); i < (int)nest.size() - n_predicates; i++) { dims 210 src/ScheduleFunctions.cpp const Dim &dim = s.dims()[nest[i].dim_idx]; dims 238 src/ScheduleFunctions.cpp for (const std::string &i : dims) { dims 266 src/ScheduleFunctions.cpp const vector<string> &dims, dims 292 src/ScheduleFunctions.cpp func_name, prefix, dims, site, values, def.split_predicate(), def.schedule(), is_update); dims 302 src/ScheduleFunctions.cpp then_case = build_provide_loop_nest(func_name, prefix, dims, s_def, is_update); dims 508 src/ScheduleFunctions.cpp vector<string> dims = f.args(); dims 509 src/ScheduleFunctions.cpp return build_provide_loop_nest(f.name(), prefix, dims, f.definition(), false); dims 523 src/ScheduleFunctions.cpp vector<string> dims = f.args(); dims 524 src/ScheduleFunctions.cpp Stmt loop = build_provide_loop_nest(f.name(), prefix, dims, def, true); dims 1030 src/ScheduleFunctions.cpp for (const Dim &d : s.dims()) { dims 115 src/SimplifySpecializations.cpp def.schedule().dims() = s_def.schedule().dims(); dims 139 src/StorageFlattening.cpp int dims = op->bounds.size(); dims 140 src/StorageFlattening.cpp vector<string> min_name(dims), extent_name(dims), stride_name(dims); dims 141 src/StorageFlattening.cpp for (int i = 0; i < dims; i++) { dims 147 src/StorageFlattening.cpp vector<Expr> min_var(dims), extent_var(dims), stride_var(dims); dims 148 src/StorageFlattening.cpp for (int i = 0; i < dims; i++) { dims 158 src/StorageFlattening.cpp builder.dimensions = dims; dims 159 src/StorageFlattening.cpp for (int i = 0; i < dims; i++) { dims 178 src/StorageFlattening.cpp if (dims > 0) { dims 1003 src/VaryingAttributes.cpp const std::vector<Expr>& dim = dims[op->name]; dims 1090 src/VaryingAttributes.cpp DimsType dims; dims 1200 src/VaryingAttributes.cpp vs.dims[loop0->name] = coords[0]; dims 1201 src/VaryingAttributes.cpp vs.dims[loop1->name] = coords[1]; dims 1190 src/runtime/HalideBuffer.h const int dims = buf.dimensions; dims 1195 src/runtime/HalideBuffer.h for (int i = 0; i < dims; i++) { dims 1200 src/runtime/HalideBuffer.h } else if (dims == D) { dims 1203 src/runtime/HalideBuffer.h for (int i = 0; i < dims; i++) { dims 1209 src/runtime/HalideBuffer.h buf.dim[dims] = {0, 1, 0}; dims 1210 src/runtime/HalideBuffer.h if (dims == 0) { dims 1211 src/runtime/HalideBuffer.h buf.dim[dims].stride = 1; dims 1213 src/runtime/HalideBuffer.h buf.dim[dims].stride = buf.dim[dims-1].extent * buf.dim[dims-1].stride; dims 1758 src/runtime/HalideBuffer.h static void for_each_element(int, int dims, const for_each_element_task_dim *t, Fn &&f, int check = 0) { dims 1759 src/runtime/HalideBuffer.h int *pos = (int *)HALIDE_ALLOCA(dims * sizeof(int)); dims 1760 src/runtime/HalideBuffer.h for_each_element_array(dims - 1, t, std::forward<Fn>(f), pos); dims 1767 src/runtime/HalideBuffer.h static void for_each_element(double, int dims, const for_each_element_task_dim *t, Fn &&f) { dims 1769 src/runtime/HalideBuffer.h assert(dims >= args); dims 98 test/generator/image_from_array_aottest.cpp int dims = (int)sizes.size(); dims 100 test/generator/image_from_array_aottest.cpp for (int i = 0; i < dims; ++i) { dims 46 test/generator/matlab_aottest.cpp std::vector<size_t> dims; dims 53 test/generator/matlab_aottest.cpp const size_t *get_dimensions() const { return &dims[0]; } dims 54 test/generator/matlab_aottest.cpp size_t get_number_of_dimensions() const { return dims.size(); } dims 59 test/generator/matlab_aottest.cpp T &operator () (int i, int j) { return data[i * dims[0] + j]; } dims 60 test/generator/matlab_aottest.cpp T operator () (int i, int j) const { return data[i * dims[0] + j]; } dims 154 util/HalideTraceViz.cpp int dims = 0; dims 181 util/HalideTraceViz.cpp dims, dims 443 util/HalideTraceViz.cpp assert(p.dimensions >= 2 * fi.config.dims); dims 489 util/HalideTraceViz.cpp config.dims = 2; dims 562 util/HalideTraceViz.cpp config.dims = 0; dims 570 util/HalideTraceViz.cpp config.x_stride[config.dims] = atoi(argv[++i]); dims 571 util/HalideTraceViz.cpp config.y_stride[config.dims] = atoi(argv[++i]); dims 572 util/HalideTraceViz.cpp config.dims++; dims 784 util/HalideTraceViz.cpp assert(p.dimensions >= p.type.lanes * fi.config.dims); dims 785 util/HalideTraceViz.cpp if (p.dimensions >= p.type.lanes * fi.config.dims) { dims 790 util/HalideTraceViz.cpp for (int d = 0; d < fi.config.dims; d++) {