size_t 59 apps/fft/fft.cpp for (size_t i = 0; i < R.size(); i++) { size_t 312 apps/fft/fft.cpp for (size_t i = 0; i < NR.size(); i++) { size_t 408 apps/fft/fft.cpp for (size_t i = 0; i + 1 < stages.size(); i++) { size_t 54 apps/fft/fft_aot_test.cpp for (size_t i = 0; i < kSize; i++) { size_t 56 apps/fft/fft_aot_test.cpp for (size_t k = 1; k < 5; k++) { size_t 77 apps/fft/fft_aot_test.cpp for (size_t i = 1; i < 5; i++) { size_t 107 apps/fft/fft_aot_test.cpp for (size_t j = 0; j < kSize / 2 + 1; j++) { size_t 108 apps/fft/fft_aot_test.cpp for (size_t i = 0; i < kSize; i++) { size_t 156 apps/fft/fft_aot_test.cpp for (size_t j = 0; j < kSize; j++) { size_t 157 apps/fft/fft_aot_test.cpp for (size_t i = 0; i < kSize; i++) { size_t 176 apps/fft/fft_aot_test.cpp for (size_t i = 0; i < kSize; i++) { size_t 179 apps/fft/fft_aot_test.cpp for (size_t k = 1; k < 5; k++) { size_t 201 apps/fft/fft_aot_test.cpp for (size_t i = 1; i < 5; i++) { size_t 231 apps/fft/fft_aot_test.cpp for (size_t j = 0; j < kSize; j++) { size_t 232 apps/fft/fft_aot_test.cpp for (size_t i = 0; i < kSize; i++) { size_t 275 apps/fft/fft_aot_test.cpp for (size_t j = 0; j < kSize; j++) { size_t 276 apps/fft/fft_aot_test.cpp for (size_t i = 0; i < kSize; i++) { size_t 7 apps/simd_op_check/driver.cpp extern "C" void *memalign(size_t alignment, size_t size); size_t 89 python_bindings/numpy/ndarray.cpp for (std::size_t i = 0; i < shape_.size(); ++i) { size_t 29 python_bindings/python/Func.cpp for (size_t i = 0; i < r.size(); i++) { size_t 76 python_bindings/python/Func.h const size_t args_len = bp::len(args_passed); size_t 77 python_bindings/python/Func.h for (size_t i = 0; i < args_len; i += 1) { size_t 84 python_bindings/python/Func.h for (size_t j = 0; j < args_len; j += 1) { size_t 113 python_bindings/python/Func.h const size_t args_len = bp::len(args_passed); size_t 114 python_bindings/python/Func.h for (size_t i = 0; i < args_len; i += 1) { size_t 121 python_bindings/python/Func.h for (size_t j = 0; j < args_len; j += 1) { size_t 153 python_bindings/python/IROperator.cpp const size_t num_values = p::len(values_passed); size_t 157 python_bindings/python/IROperator.cpp for (size_t i = 0; i < num_values; i += 1) { size_t 164 python_bindings/python/IROperator.cpp for (size_t j = 0; j < num_values; j += 1) { size_t 78 python_bindings/python/Image.cpp const size_t args_len = p::len(args_passed); size_t 79 python_bindings/python/Image.cpp for (size_t i = 0; i < args_len; i += 1) { size_t 89 python_bindings/python/Image.cpp for (size_t j = 0; j < args_len; j += 1) { size_t 23 python_bindings/python/Param.cpp const size_t args_len = p::len(args_passed); size_t 24 python_bindings/python/Param.cpp for (size_t i = 0; i < args_len; i += 1) { size_t 53 python_bindings/python/RDom.cpp const size_t args_len = p::len(args); size_t 60 python_bindings/python/RDom.cpp for (size_t i = 0; i < args_len; i += 1) { size_t 67 python_bindings/python/RDom.cpp for (size_t j = 0; j < args_len; j += 1) { size_t 78 python_bindings/python/RDom.cpp for (size_t i = 0; i < exprs.size(); i += 2) { size_t 79 python_bindings/tests/the_sort_function.c for(size_t i=1; i < 4; i +=1) size_t 78 src/AddImageChecks.cpp for (size_t i = 0; i < f.values().size(); i++) { size_t 152 src/AddImageChecks.cpp for (size_t i = 0; i < f.output_buffers().size(); i++) { size_t 175 src/AddImageChecks.cpp for (size_t i = 0; i < order.size(); i++) { size_t 179 src/AddImageChecks.cpp for (size_t j = 0; j < args.size(); j++) { size_t 191 src/AddImageChecks.cpp for (size_t i = 0; i < extern_users.size(); i++) { size_t 479 src/AddImageChecks.cpp for (size_t i = 0; i < constraints.size(); i++) { size_t 513 src/AddImageChecks.cpp for (size_t i = asserts_host_alignment.size(); i > 0; i--) { size_t 519 src/AddImageChecks.cpp for (size_t i = dims_no_overflow_asserts.size(); i > 0; i--) { size_t 524 src/AddImageChecks.cpp for (size_t i = lets_overflow.size(); i > 0; i--) { size_t 541 src/AddImageChecks.cpp for (size_t i = asserts_constrained.size(); i > 0; i--) { size_t 546 src/AddImageChecks.cpp for (size_t i = asserts_required.size(); i > 0; i--) { size_t 551 src/AddImageChecks.cpp for (size_t i = asserts_elem_size.size(); i > 0; i--) { size_t 561 src/AddImageChecks.cpp for (size_t i = buffer_rewrites.size(); i > 0; i--) { size_t 568 src/AddImageChecks.cpp for (size_t i = asserts_proposed.size(); i > 0; i--) { size_t 574 src/AddImageChecks.cpp for (size_t i = lets_proposed.size(); i > 0; i--) { size_t 579 src/AddImageChecks.cpp for (size_t i = lets_constrained.size(); i > 0; i--) { size_t 584 src/AddImageChecks.cpp for (size_t i = lets_required.size(); i > 0; i--) { size_t 89 src/AddParameterChecks.cpp for (size_t i = 0; i < lets.size(); i++) { size_t 98 src/AddParameterChecks.cpp for (size_t i = 0; i < asserts.size(); i++) { size_t 40 src/AllocationBoundsInference.cpp for (size_t i = 0; i < required.size(); i++) { size_t 55 src/AllocationBoundsInference.cpp for (size_t i = 0; i < b.size(); i++) { size_t 58 src/AllocationBoundsInference.cpp for (size_t j = 0; j < f.schedule().bounds().size(); j++) { size_t 134 src/AllocationBoundsInference.cpp for (size_t i = 0; i < f.extern_arguments().size(); i++) { size_t 84 src/AssociativeOpsTable.cpp size_t dim; size_t 85 src/AssociativeOpsTable.cpp TableKey(ValType t, RootExpr r, size_t d) : type(t), root(r), dim(d) {} size_t 294 src/AssociativeOpsTable.cpp const vector<AssociativePattern> &get_ops_table_helper(Type t, RootExpr root, size_t dim) { size_t 326 src/AssociativeOpsTable.cpp for (size_t i = 1; i < exprs.size() - 1; ++i) { size_t 40 src/AssociativeOpsTable.h AssociativePattern(size_t size) : ops(size), identities(size), is_commutative(false) {} size_t 50 src/AssociativeOpsTable.h for (size_t i = 0; i < size(); ++i) { size_t 58 src/AssociativeOpsTable.h size_t size() const { return ops.size(); } size_t 63 src/Associativity.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 107 src/Associativity.cpp for (size_t i = 0; i < x_names.size(); ++i) { size_t 118 src/Associativity.cpp for (size_t i = 0; i < y_names.size(); ++i) { size_t 128 src/Associativity.cpp for (size_t i = 0; i < x_names.size(); ++i) { size_t 177 src/Associativity.cpp for (size_t i = 0; i < pattern.size(); ++i) { size_t 189 src/Associativity.cpp for (size_t index = 0; index < op_y_names.size(); ++index) { size_t 208 src/Associativity.cpp for (size_t index = 0; index < exprs.size(); ++index) { size_t 253 src/Associativity.cpp for (size_t i = 0; i < dependencies.size(); ++i) { size_t 254 src/Associativity.cpp for (size_t j = 0; j < dependencies.size(); ++j) { size_t 276 src/Associativity.cpp for (size_t i = 0; i < dependencies.size(); ++i) { size_t 283 src/Associativity.cpp for (size_t j = 0; j < dependencies.size(); ++j) { size_t 318 src/Associativity.cpp for (size_t idx = 0; idx < exprs.size(); ++idx) { size_t 373 src/Associativity.cpp for (size_t i = 0; i < subgraphs.size(); ++i) { size_t 449 src/Associativity.cpp for (size_t i = 0; i < args.size(); ++i) { size_t 461 src/Associativity.cpp for (size_t i = 0; i < exprs.size(); ++i) { size_t 481 src/Associativity.cpp for (size_t i = 0; i < assoc_op.size(); ++i) { size_t 504 src/Associativity.cpp for (size_t i = 0; i < assoc_op.size(); ++i) { size_t 606 src/Associativity.cpp for (size_t i = 0; i < xs.size(); ++i) { size_t 76 src/Associativity.h AssociativeOp(size_t size) : pattern(size), xs(size), ys(size), is_associative(false) {} size_t 83 src/Associativity.h size_t size() const { return pattern.size(); } size_t 16 src/BoundaryConditions.cpp for (size_t i = 0; i < bounds.size(); i++) { size_t 50 src/BoundaryConditions.cpp for (size_t i = 0; i < bounds.size(); i++) { size_t 68 src/BoundaryConditions.cpp for (size_t i = 0; i < value.as_vector().size(); i++) { size_t 94 src/BoundaryConditions.cpp for (size_t i = 0; i < bounds.size(); i++) { size_t 135 src/BoundaryConditions.cpp for (size_t i = 0; i < bounds.size(); i++) { size_t 176 src/BoundaryConditions.cpp for (size_t i = 0; i < bounds.size(); i++) { size_t 585 src/Bounds.cpp for (size_t i = 0; i < op->args.size() && const_args; i++) { size_t 804 src/Bounds.cpp for (size_t i = 0; i < a.size(); i++) { size_t 834 src/Bounds.cpp for (size_t i = 0; i < a.size(); i++) { size_t 908 src/Bounds.cpp for (size_t i = 0; i < a.size(); i++) { size_t 941 src/Bounds.cpp for (size_t i = 0; i < a.size(); i++) { size_t 961 src/Bounds.cpp for (size_t i = 0; i < inner.size(); i++) { size_t 1022 src/Bounds.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 1079 src/Bounds.cpp for (size_t i = 0; i < box.size(); i++) { size_t 1294 src/Bounds.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 1302 src/Bounds.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 1305 src/Bounds.cpp for (size_t i = 0; i < op->values.size(); i++) { size_t 1422 src/Bounds.cpp for (size_t i = 0; i < order.size(); i++) { size_t 1434 src/Bounds.cpp for (size_t k = 0; k < f.args().size(); k++) { size_t 51 src/Bounds.h Box(size_t sz) : bounds(sz) {} size_t 54 src/Bounds.h size_t size() const {return bounds.size();} size_t 58 src/Bounds.h void resize(size_t sz) {bounds.resize(sz);} size_t 124 src/BoundsInference.cpp size_t stage; // 0 is the pure definition, 1 is the first update size_t 153 src/BoundsInference.cpp for (size_t i = 0; i < result.size(); ++i) { size_t 160 src/BoundsInference.cpp for (size_t i = 1; i < predicates.size(); ++i) { size_t 174 src/BoundsInference.cpp for (size_t i = specializations.size(); i > 0; i--) { size_t 192 src/BoundsInference.cpp for (size_t i = 0; i < result.size(); i++) { size_t 205 src/BoundsInference.cpp for (size_t i = 1; i < vec.size(); ++i) { size_t 295 src/BoundsInference.cpp for (size_t j = 0; j < always_pure_dims.size(); j++) { size_t 304 src/BoundsInference.cpp size_t stages = func.updates().size(); size_t 306 src/BoundsInference.cpp for (size_t i = 0; i < always_pure_dims.size(); i++) { size_t 406 src/BoundsInference.cpp for (size_t i = 0; i < func.schedule().bounds().size(); i++) { size_t 451 src/BoundsInference.cpp for (size_t d = 0; d < b.size(); d++) { size_t 490 src/BoundsInference.cpp for (size_t j = 0; j < args.size(); j++) { size_t 600 src/BoundsInference.cpp for (size_t i = 0; i < lets.size(); i++) { size_t 647 src/BoundsInference.cpp for (size_t i = 0; i < inlined.size(); i++) { size_t 660 src/BoundsInference.cpp for (size_t i = 0; i < f.size(); i++) { size_t 672 src/BoundsInference.cpp for (size_t j = 0; j < f[i].updates().size(); j++) { size_t 682 src/BoundsInference.cpp for (size_t i = f.size(); i > 0; i--) { size_t 685 src/BoundsInference.cpp for (size_t j = 0; j < stages.size(); j++) { size_t 687 src/BoundsInference.cpp for (size_t k = 0; k < s.exprs.size(); k++) { size_t 698 src/BoundsInference.cpp for (size_t i = 0; i < stages.size(); i++) { size_t 715 src/BoundsInference.cpp for (size_t i = 0; i < stages.size(); i++) { size_t 733 src/BoundsInference.cpp for (size_t j = 0; j < args.size(); j++) { size_t 765 src/BoundsInference.cpp for (size_t j = 0; j < i; j++) { size_t 772 src/BoundsInference.cpp for (size_t k = 0; k < b.size(); k++) { size_t 832 src/BoundsInference.cpp for (size_t i = 0; i < stages.size(); i++) { size_t 868 src/BoundsInference.cpp for (size_t i = 0; i < stages.size(); i++) { size_t 897 src/BoundsInference.cpp for (size_t i = 0; i < stages.size(); i++) { size_t 907 src/BoundsInference.cpp for (size_t j = 0; j < stages[i].consumers.size(); j++) { size_t 918 src/BoundsInference.cpp for (size_t i = 0; i < box.size(); i++) { size_t 972 src/BoundsInference.cpp for (size_t i = lets.size(); i > 0; i--) { size_t 1000 src/BoundsInference.cpp for (size_t i = 0; i < order.size(); i++) { size_t 171 src/Buffer.h template<typename Array, size_t N> size_t 248 src/Buffer.h void *(*allocate_fn)(size_t) = nullptr, size_t 257 src/Buffer.h void *(*allocate_fn)(size_t) = nullptr, size_t 212 src/CPlusPlusMangle.cpp for (size_t i = type.handle_type->enclosing_types.size(); i > 0; i--) { size_t 217 src/CPlusPlusMangle.cpp for (size_t i = type.handle_type->namespaces.size(); i > 0; i--) { size_t 282 src/CPlusPlusMangle.cpp for (size_t i = namespaces.size(); i > 0; i--) { size_t 789 src/CPlusPlusMangle.cpp void check_result(const MangleResult *expecteds, size_t &expected_index, size_t 798 src/CPlusPlusMangle.cpp size_t expecteds_index = 0; size_t 900 src/CPlusPlusMangle.cpp size_t i = 0; size_t 920 src/CPlusPlusMangle.cpp size_t expecteds_index = 0; size_t 943 src/CPlusPlusMangle.cpp size_t expecteds_index = 0; size_t 966 src/CPlusPlusMangle.cpp size_t expecteds_index = 0; size_t 978 src/CPlusPlusMangle.cpp for (size_t i = 1; i <= 8; i++) { size_t 980 src/CPlusPlusMangle.cpp for (size_t j = 0; j < i; j++) { size_t 991 src/CPlusPlusMangle.cpp size_t expecteds_index = 0; size_t 1001 src/CPlusPlusMangle.cpp size_t expecteds_index = 0; size_t 1025 src/CPlusPlusMangle.cpp size_t expecteds_index = 0; size_t 285 src/CSE.cpp for (size_t i = 0; i < gvn.entries.size(); i++) { size_t 304 src/CSE.cpp for (size_t i = lets.size(); i > 0; i--) { size_t 371 src/CSE.cpp for (size_t i = exprs.size() - 1; i > 0; i--) { size_t 80 src/CanonicalizeGPUVars.cpp for (size_t i = 0; i < v.size(); ++i) { size_t 78 src/Closure.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 54 src/Closure.h size_t size; size_t 45 src/CodeGen_ARM.cpp for (size_t i = 0; i < sizeof(types)/sizeof(types[0]); i++) { size_t 257 src/CodeGen_ARM.cpp for (size_t i = 0; i < casts.size() ; i++) { size_t 269 src/CodeGen_ARM.cpp for (size_t i = 0; i < matches.size(); i++) { size_t 386 src/CodeGen_ARM.cpp for (size_t i = 0; i < left_shifts.size(); i++) { size_t 420 src/CodeGen_ARM.cpp for (size_t i = 0; i < averagings.size(); i++) { size_t 441 src/CodeGen_ARM.cpp for (size_t i = 0; i < negations.size(); i++) { size_t 529 src/CodeGen_ARM.cpp for (size_t i = 0; i < sizeof(patterns)/sizeof(patterns[0]); i++) { size_t 602 src/CodeGen_ARM.cpp for (size_t i = 0; i < sizeof(patterns)/sizeof(patterns[0]); i++) { size_t 698 src/CodeGen_ARM.cpp for (size_t i = 0; i < lets.size(); i++) { size_t 772 src/CodeGen_ARM.cpp for (size_t i = 0; i < lets.size(); i++) { size_t 256 src/CodeGen_C.cpp for (size_t i = 0; i < type.handle_type->namespaces.size(); i++) { size_t 259 src/CodeGen_C.cpp for (size_t i = 0; i < type.handle_type->enclosing_types.size(); i++) { size_t 341 src/CodeGen_C.cpp for (size_t i = 0; i < name.size(); i++) { size_t 395 src/CodeGen_C.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 428 src/CodeGen_C.cpp size_t j = 0; size_t 429 src/CodeGen_C.cpp for (size_t i = 0; str[i]; i++) { size_t 492 src/CodeGen_C.cpp for (size_t i = 0; i < args.size(); i++) { size_t 497 src/CodeGen_C.cpp for (size_t ns = 0; ns < handle_type->namespaces.size(); ns++ ) { size_t 509 src/CodeGen_C.cpp for (size_t ns = 0; ns < handle_type->namespaces.size(); ns++ ) { size_t 516 src/CodeGen_C.cpp for (size_t i = 0; i < args.size(); i++) { size_t 569 src/CodeGen_C.cpp for (size_t i = 0; i < args.size(); i++) { size_t 609 src/CodeGen_C.cpp for (size_t i = 0; i < namespaces.size(); i++) { size_t 636 src/CodeGen_C.cpp size_t num_elems = 1; size_t 643 src/CodeGen_C.cpp for (size_t i = 0; i < num_elems * b.type.bytes(); i++) { size_t 1004 src/CodeGen_C.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 1010 src/CodeGen_C.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 1016 src/CodeGen_C.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 1031 src/CodeGen_C.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 1059 src/CodeGen_C.cpp for (size_t i = 0; i < printf_args.size(); i++) { size_t 1113 src/CodeGen_C.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 1122 src/CodeGen_C.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 1330 src/CodeGen_C.cpp for (size_t i = 1; i < op->extents.size(); i++) { size_t 241 src/CodeGen_GPU_Host.cpp for (size_t i = 0; i < kernel_name.size(); i++) { size_t 294 src/CodeGen_GPU_Host.cpp for (size_t i = 0; i < closure_args.size(); i++) { size_t 307 src/CodeGen_GPU_Host.cpp for (size_t i = 0; i < closure_args.size(); i++) { size_t 623 src/CodeGen_Hexagon.cpp for (size_t i = 0; i < args.size(); i++) { size_t 752 src/CodeGen_Hexagon.cpp for (size_t j = 0; j < v.size(); j++) { size_t 808 src/CodeGen_Hexagon.cpp size_t begin = 0; size_t 812 src/CodeGen_Hexagon.cpp size_t end = indices.size(); size_t 818 src/CodeGen_Hexagon.cpp for (size_t i = begin; i + 1 < end; i++) { size_t 852 src/CodeGen_Hexagon.cpp for (size_t i = 1; i < indices.size(); i++) { size_t 1190 src/CodeGen_Hexagon.cpp for (size_t i = 1; i < ranges.size(); i++) { size_t 1228 src/CodeGen_Hexagon.cpp for (size_t i = 1; i < ops.size(); i++) { size_t 568 src/CodeGen_LLVM.cpp for (size_t i = 0; i < args.size(); i++) { size_t 604 src/CodeGen_LLVM.cpp for (size_t i = 0; i < args.size(); i++) { size_t 621 src/CodeGen_LLVM.cpp size_t i = 0; size_t 645 src/CodeGen_LLVM.cpp for (size_t i = 0; i < args.size(); i++) { size_t 802 src/CodeGen_LLVM.cpp size_t shape_size = buf.dimensions() * sizeof(halide_dimension_t); size_t 1806 src/CodeGen_LLVM.cpp for (size_t i = 1; i < vecs.size(); i++) { size_t 1825 src/CodeGen_LLVM.cpp for (size_t i = 0; i < vecs.size(); i++) { size_t 2309 src/CodeGen_LLVM.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 2327 src/CodeGen_LLVM.cpp for (size_t i = 0; i < args.size(); i++) { size_t 2343 src/CodeGen_LLVM.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 2389 src/CodeGen_LLVM.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 2521 src/CodeGen_LLVM.cpp for (size_t i = 0; i < op->args.size(); i += 2) { size_t 2684 src/CodeGen_LLVM.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 2703 src/CodeGen_LLVM.cpp for (size_t i = 0; i < args.size(); i++) { size_t 2734 src/CodeGen_LLVM.cpp for (size_t i = takes_user_context ? 1 : 0; size_t 2735 src/CodeGen_LLVM.cpp i < std::min(args.size(), (size_t)(func_t->getNumParams())); size_t 2785 src/CodeGen_LLVM.cpp for (size_t j = 0; j < args.size(); j++) { size_t 3288 src/CodeGen_LLVM.cpp for (size_t i = 0; i < args.size(); i++) { size_t 3309 src/CodeGen_LLVM.cpp for (size_t i = 0; i < arg_values.size(); i++) { size_t 3334 src/CodeGen_LLVM.cpp for (size_t i = 0; i < arg_values.size(); i++) { size_t 3391 src/CodeGen_LLVM.cpp for (size_t i = 0; i < vecs.size()-1; i += 2) { size_t 3437 src/CodeGen_LLVM.cpp for (size_t i = 0; i < llvm_indices.size(); i++) { size_t 3478 src/CodeGen_LLVM.cpp for (size_t i = 0; i < sizes_to_try.size(); i++) { size_t 423 src/CodeGen_Metal_Dev.cpp size_t size; size_t 426 src/CodeGen_Metal_Dev.cpp BufferSize(string name, size_t size) : name(name), size(size) {} size_t 450 src/CodeGen_Metal_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 465 src/CodeGen_Metal_Dev.cpp for (size_t i = 1; i < constants.size(); i++) { size_t 471 src/CodeGen_Metal_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 494 src/CodeGen_Metal_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 514 src/CodeGen_Metal_Dev.cpp size_t buffer_index = 0; size_t 520 src/CodeGen_Metal_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 539 src/CodeGen_Metal_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 552 src/CodeGen_Metal_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 560 src/CodeGen_Metal_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 514 src/CodeGen_OpenCL_Dev.cpp size_t size; size_t 517 src/CodeGen_OpenCL_Dev.cpp BufferSize(string name, size_t size) : name(name), size(size) {} size_t 545 src/CodeGen_OpenCL_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 560 src/CodeGen_OpenCL_Dev.cpp for (size_t i = 1; i < constants.size(); i++) { size_t 566 src/CodeGen_OpenCL_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 589 src/CodeGen_OpenCL_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 619 src/CodeGen_OpenCL_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 627 src/CodeGen_OpenCL_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 96 src/CodeGen_OpenGLCompute_Dev.cpp for (size_t i = 0; i < sizeof(ids) / sizeof(string); i++) { size_t 272 src/CodeGen_OpenGLCompute_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 76 src/CodeGen_OpenGL_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 199 src/CodeGen_OpenGL_Dev.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 848 src/CodeGen_OpenGL_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 902 src/CodeGen_OpenGL_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 930 src/CodeGen_OpenGL_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 963 src/CodeGen_OpenGL_Dev.cpp for (size_t i = 0; i < s.size(); ) { size_t 56 src/CodeGen_PTX_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 70 src/CodeGen_PTX_Dev.cpp for (size_t i = 0; i < args.size(); i++) { size_t 84 src/CodeGen_PTX_Dev.cpp size_t i = 0; size_t 135 src/CodeGen_PTX_Dev.cpp for (size_t i = 0; i < arg_sym_names.size(); i++) { size_t 43 src/CodeGen_Posix.cpp for (size_t i = 0; i < extents.size(); i++) { size_t 82 src/CodeGen_Posix.h size_t cur_stack_alloc_total{0}; size_t 99 src/CodeGen_PowerPC.cpp for (size_t i = 0; i < sizeof(patterns)/sizeof(patterns[0]); i++) { size_t 110 src/CodeGen_PowerPC.cpp for (size_t i = 0; i < matches.size(); i++) { size_t 263 src/CodeGen_X86.cpp for (size_t i = 0; i < sizeof(patterns)/sizeof(patterns[0]); i++) { size_t 278 src/CodeGen_X86.cpp for (size_t i = 0; i < matches.size(); i++) { size_t 39 src/DebugToFile.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 53 src/Definition.cpp for (size_t i = 0; i < values.size(); ++i) { size_t 56 src/Definition.cpp for (size_t i = 0; i < args.size(); ++i) { size_t 96 src/Definition.cpp for (size_t i = 0; i < rdom.domain().size(); i++) { size_t 71 src/Deinterleave.cpp if (stores.size() >= (size_t)max_stores) { size_t 259 src/Deinterleave.cpp for (size_t i = 0; i < args.size(); i++) { size_t 296 src/Deinterleave.cpp for (size_t i = 0; i < new_vectors.size(); i++) { size_t 596 src/Deinterleave.cpp internal_assert(stores.size() <= (size_t)expected_stores); size_t 599 src/Deinterleave.cpp if (stores.size() != (size_t)expected_stores) goto fail; size_t 612 src/Deinterleave.cpp for (size_t i = 0; i < stores.size(); ++i) { size_t 658 src/Deinterleave.cpp for (size_t i = 0; i < stores.size(); ++i) { size_t 669 src/Deinterleave.cpp if (j < 0 || (size_t)j >= stores.size()) goto fail; size_t 50 src/DeviceArgument.h size_t size; size_t 54 src/DeviceArgument.h size_t packed_index; size_t 74 src/DeviceArgument.h size_t _size = 0) : size_t 38 src/DeviceInterface.cpp for (size_t i = 0; i < runtime.size(); i++) { size_t 265 src/Elf.cpp const char *assert_string_valid(const char *name, const char *data, size_t size) { size_t 283 src/Elf.cpp void append_zeros(std::vector<char> &buf, size_t count) { size_t 287 src/Elf.cpp void append_padding(std::vector<char> &buf, size_t alignment) { size_t 321 src/Elf.cpp std::unique_ptr<Object> parse_object_internal(const char *data, size_t size) { size_t 425 src/Elf.cpp std::unique_ptr<Object> Object::parse_object(const char *data, size_t size) { size_t 774 src/Elf.cpp size_t sym_count = syms.size(); size_t 776 src/Elf.cpp size_t bucket_count = 1; size_t 782 src/Elf.cpp for (size_t i = 0; i < sym_count; i++) { size_t 303 src/Elf.h size_t contents_size() const { return contents.size(); } size_t 322 src/Elf.h size_t relocations_size() const { return relocs.size(); } size_t 425 src/Elf.h static std::unique_ptr<Object> parse_object(const char *data, size_t size); size_t 437 src/Elf.h size_t sections_size() const { return secs.size(); } size_t 453 src/Elf.h size_t symbols_size() const { return syms.size(); } size_t 21 src/FastIntegerDivide.cpp for (size_t i = 0; i < 256; i++) { size_t 38 src/FastIntegerDivide.cpp for (size_t i = 0; i < 256; i++) { size_t 55 src/FastIntegerDivide.cpp for (size_t i = 0; i < 256; i++) { size_t 72 src/FastIntegerDivide.cpp for (size_t i = 0; i < 256; i++) { size_t 89 src/FastIntegerDivide.cpp for (size_t i = 0; i < 256; i++) { size_t 106 src/FastIntegerDivide.cpp for (size_t i = 0; i < 256; i++) { size_t 65 src/Func.cpp for (size_t i = 0; i < arg_names.size(); i++) { size_t 136 src/Func.cpp for (size_t i = 0; i < rvars.size(); i++) { size_t 225 src/Func.cpp if (func.has_pure_definition() && args.size() != (size_t)dimensions()) { size_t 255 src/Func.cpp if (func.has_pure_definition() && args.size() != (size_t)dimensions()) { size_t 280 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { size_t 325 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { size_t 345 src/Func.cpp for (size_t i = 0; i < definition.schedule().dims().size(); i++) { size_t 706 src/Func.cpp for (size_t i = 0; i < preserved.size(); ++i) { size_t 748 src/Func.cpp for (size_t i = 0; i < init_vals.size(); ++i) { size_t 762 src/Func.cpp for (size_t i = 0; i < intm_rvars.size(); ++i) { size_t 765 src/Func.cpp for (size_t i = 0; i < vars_rename.size(); i++) { size_t 773 src/Func.cpp for (size_t i = 0; i < args.size(); i++) { size_t 794 src/Func.cpp for (size_t i = 0; i < update_vals.size(); i++) { size_t 813 src/Func.cpp for (size_t i = 0; i < storage_dims.size(); ++i) { size_t 817 src/Func.cpp for (size_t i = 0; i < rvars_kept.size(); ++i) { size_t 846 src/Func.cpp for (size_t i = 0; i < f_store_args.size(); ++i) { size_t 865 src/Func.cpp for (size_t i = 0; i < f_values.size(); ++i) { size_t 880 src/Func.cpp for (size_t i = 0; i < f_values.size(); ++i) { size_t 911 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { size_t 928 src/Func.cpp for (size_t i = 0; (!found) && i < dims.size(); i++) { size_t 1050 src/Func.cpp for (size_t i = 0; (!found_outer) && i < dims.size(); i++) { size_t 1066 src/Func.cpp for (size_t i = 0; (!found_inner) && i < dims.size(); i++) { size_t 1128 src/Func.cpp for (size_t i = 0; i < specializations.size(); i++) { size_t 1169 src/Func.cpp for (size_t i = 0; (!found) && i < dims.size(); i++) { size_t 1201 src/Func.cpp for (size_t i = 0; (!found) && i < dims.size(); i++) { size_t 1230 src/Func.cpp for (size_t i = splits.size(); i > 0; i--) { size_t 1310 src/Func.cpp for (size_t i = 0; (!found) && i < dims.size(); i++) { size_t 1332 src/Func.cpp for (size_t i = splits.size(); i > 0; i--) { size_t 1464 src/Func.cpp void reorder_vars(vector<Dim> &dims_old, const VarOrRVar *vars, size_t size, const Stage &stage) { size_t 1468 src/Func.cpp vector<size_t> idx(size); size_t 1469 src/Func.cpp for (size_t i = 0; i < size; i++) { size_t 1471 src/Func.cpp for (size_t j = 0; j < dims.size(); j++) { size_t 1485 src/Func.cpp for (size_t i = 0; i < idx.size(); i++) { size_t 1487 src/Func.cpp for (size_t j = i+1; j < idx.size(); j++) { size_t 1501 src/Func.cpp vector<size_t> sorted = idx; size_t 1504 src/Func.cpp for (size_t i = 0; i < size; i++) { size_t 1795 src/Func.cpp for (size_t i = 1; i < fs.size(); ++i) { size_t 1948 src/Func.cpp for (size_t i = 0; i < func.args().size(); i++) { size_t 1983 src/Func.cpp for (size_t i = 0; i < func.args().size(); i++) { size_t 2196 src/Func.cpp for (size_t i = 0; i < sched.bounds().size(); i++) { size_t 2235 src/Func.cpp size_t y_loc = 0; size_t 2236 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { size_t 2250 src/Func.cpp Func &Func::reorder_storage(const std::vector<Var> &dims, size_t start) { size_t 2253 src/Func.cpp for (size_t i = start + 1; i < dims.size(); i++) { size_t 2273 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { size_t 2288 src/Func.cpp for (size_t i = 0; i < dims.size(); i++) { size_t 2387 src/Func.cpp for (size_t i = 0; i < e.size(); i++) { size_t 2413 src/Func.cpp for (size_t i = 0; i < a.size(); i++) { size_t 2421 src/Func.cpp for (size_t i = 0; i < a.size(); i++) { size_t 2425 src/Func.cpp for (size_t i = 0; i < e.size(); i++) { size_t 2431 src/Func.cpp for (size_t i = 0; i < a.size(); i++) { size_t 2462 src/Func.cpp for (size_t j = 0; j < a.size(); j++) { size_t 2484 src/Func.cpp for (size_t i = 0; i < args.size(); ++i) { size_t 2494 src/Func.cpp for (size_t i = 0; i < expanded_args.size(); ++i) { size_t 2505 src/Func.cpp size_t update_stage = func.updates().size() - 1; size_t 2530 src/Func.cpp for (size_t i = 0; i < a.size(); i++) { size_t 2678 src/Func.cpp size_t FuncRef::size() const { size_t 2760 src/Func.cpp for (size_t i = 0; i < outputs.size(); i++) { size_t 2790 src/Func.cpp for (size_t i = 0; i < bufs.size(); i++) { size_t 2906 src/Func.cpp void Func::set_custom_allocator(void *(*cust_malloc)(void *, size_t), size_t 79 src/Func.h for (size_t i = 0; i < args.size(); i++) { size_t 405 src/Func.h EXPORT size_t size() const; size_t 514 src/Func.h EXPORT Func &reorder_storage(const std::vector<Var> &dims, size_t start); size_t 751 src/Func.h EXPORT void set_custom_allocator(void *(*malloc)(void *, size_t), size_t 79 src/Function.cpp for (size_t j = 0; j < init_def.args().size() && j < 4; j++) { size_t 148 src/Function.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 169 src/Function.cpp for (size_t i = 0; i < pure_args.size(); i++) { size_t 253 src/Function.cpp for (size_t i = 0; i < n.size(); i++) { size_t 379 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 389 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 395 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 400 src/Function.cpp for (size_t i = 0; i < args.size(); i++) { size_t 405 src/Function.cpp for (size_t j = 0; j < i; j++) { size_t 414 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 420 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 442 src/Function.cpp for (size_t i = 0; i < args.size(); i++) { size_t 446 src/Function.cpp for (size_t i = 0; i < args.size(); i++) { size_t 460 src/Function.cpp for (size_t i = 0; i < contents->output_types.size(); i++) { size_t 464 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 486 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 504 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 524 src/Function.cpp for (size_t i = 0; i < args.size(); i++) { size_t 534 src/Function.cpp for (size_t i = 0; i < args.size(); i++) { size_t 561 src/Function.cpp for (size_t i = 0; i < args.size(); i++) { size_t 564 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 574 src/Function.cpp for (size_t i = 0; i < args.size(); i++) { size_t 577 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 589 src/Function.cpp for (size_t i = 0; i < pure_args.size(); i++) { size_t 595 src/Function.cpp for (size_t i = 0; i < check.reduction_domain.domain().size(); i++) { size_t 601 src/Function.cpp for (size_t i = 0; i < args.size(); i++) { size_t 604 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 617 src/Function.cpp for (size_t i = 0; i < args.size(); i++) { size_t 620 src/Function.cpp for (size_t i = 0; i < values.size(); i++) { size_t 633 src/Function.cpp for (size_t i = 0; i < check.reduction_domain.domain().size(); i++) { size_t 650 src/Function.cpp for (size_t i = 0; i < pure_args.size(); i++) { size_t 702 src/Function.cpp for (size_t i = 0; i < types.size(); i++) { size_t 741 src/Function.cpp for (size_t i = 0; i < pure_def_args.size(); i++) { size_t 346 src/FuseGPUThreadLoops.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 30 src/Generator.cpp for (size_t i = 1; i < n.size(); ++i) { size_t 190 src/Generator.cpp for (size_t i = 0; i < values.size(); ++i) { size_t 202 src/Generator.cpp for (size_t i = 0; i < values.size(); ++i) { size_t 536 src/Generator.cpp for (size_t i = 0; i < inputs.size(); ++i) { size_t 721 src/Generator.cpp for (size_t i = 0; i < a.size(); ++i) { size_t 1057 src/Generator.cpp GeneratorBase::GeneratorBase(size_t size, const void *introspection_helper) size_t 1079 src/Generator.cpp GeneratorBase::ParamInfo::ParamInfo(GeneratorBase *generator, const size_t size) { size_t 1105 src/Generator.cpp owned_synthetic_params.emplace_back(new GeneratorParam_Synthetic<size_t>(n + ".size", *gio, GeneratorParam_Synthetic<size_t>::ArraySize)); size_t 1276 src/Generator.cpp for (size_t i = 0; i < pi.filter_inputs.size(); ++i) { size_t 1395 src/Generator.cpp for (size_t i = 0; i < f.output_types().size(); ++i) { size_t 1475 src/Generator.cpp GIOBase::GIOBase(size_t array_size, size_t 1491 src/Generator.cpp size_t GIOBase::array_size() const { size_t 1495 src/Generator.cpp return (size_t) array_size_; size_t 1577 src/Generator.cpp std::string GIOBase::array_name(size_t i) const { size_t 1591 src/Generator.cpp for (size_t i = 0; i < t.size(); ++i) { size_t 1605 src/Generator.cpp void GIOBase::check_matching_array_size(size_t size) { size_t 1613 src/Generator.cpp GeneratorInputBase::GeneratorInputBase(size_t array_size, size_t 1641 src/Generator.cpp for (size_t i = 0; i < array_size(); ++i) { size_t 1650 src/Generator.cpp const size_t expected = (kind() != IOKind::Scalar) ? funcs().size() : exprs().size(); size_t 1664 src/Generator.cpp for (size_t i = 0; i < array_size(); ++i) { size_t 1683 src/Generator.cpp for (size_t i = 0; i < inputs.size(); ++i) { size_t 1719 src/Generator.cpp GeneratorOutputBase::GeneratorOutputBase(size_t array_size, const std::string &name, IOKind kind, const std::vector<Type> &t, int d) size_t 1743 src/Generator.cpp for (size_t i = 0; i < array_size(); ++i) { size_t 1749 src/Generator.cpp void GeneratorOutputBase::resize(size_t size) { size_t 248 src/Generator.h const size_t max_unique_values; size_t 250 src/Generator.h explicit ValueTracker(size_t max_unique_values = 2) : max_unique_values(max_unique_values) {} size_t 1091 src/Generator.h EXPORT size_t array_size() const; size_t 1108 src/Generator.h EXPORT GIOBase(size_t array_size, size_t 1136 src/Generator.h EXPORT std::string array_name(size_t i) const; size_t 1140 src/Generator.h EXPORT void check_matching_array_size(size_t size); size_t 1176 src/Generator.h EXPORT GeneratorInputBase(size_t array_size, size_t 1242 src/Generator.h size_t size() const { size_t 1247 src/Generator.h const ValueType &operator[](size_t i) const { size_t 1252 src/Generator.h const ValueType &at(size_t i) const { size_t 1366 src/Generator.h GeneratorInput_Func(size_t array_size, const std::string &name, const Type &t, int d) size_t 1371 src/Generator.h GeneratorInput_Func(size_t array_size, const std::string &name, int d) size_t 1376 src/Generator.h GeneratorInput_Func(size_t array_size, const std::string &name, const Type &t) size_t 1381 src/Generator.h GeneratorInput_Func(size_t array_size, const std::string &name) size_t 1426 src/Generator.h GeneratorInput_Scalar(size_t array_size, size_t 1474 src/Generator.h GeneratorInput_Arithmetic(size_t array_size, size_t 1487 src/Generator.h GeneratorInput_Arithmetic(size_t array_size, size_t 1543 src/Generator.h GeneratorInput(size_t array_size, const std::string &name, const TBase &def) size_t 1552 src/Generator.h GeneratorInput(size_t array_size, const std::string &name, size_t 1570 src/Generator.h GeneratorInput(size_t array_size, const std::string &name, const Type &t, int d) size_t 1574 src/Generator.h GeneratorInput(size_t array_size, const std::string &name, const Type &t) size_t 1580 src/Generator.h GeneratorInput(size_t array_size, const std::string &name, IntIfNonScalar d) size_t 1584 src/Generator.h GeneratorInput(size_t array_size, const std::string &name) size_t 1661 src/Generator.h EXPORT GeneratorOutputBase(size_t array_size, size_t 1678 src/Generator.h EXPORT void resize(size_t size); size_t 1750 src/Generator.h size_t size() const { size_t 1755 src/Generator.h const ValueType &operator[](size_t i) const { size_t 1760 src/Generator.h const ValueType &at(size_t i) const { size_t 1778 src/Generator.h void resize(size_t size) { size_t 1903 src/Generator.h NO_INLINE Func &get_assignable_func_ref(size_t i) { size_t 1916 src/Generator.h GeneratorOutput_Func(size_t array_size, const std::string &name, const std::vector<Type> &t, int d) size_t 1934 src/Generator.h Func &operator[](size_t i) { size_t 1940 src/Generator.h const Func &operator[](size_t i) const { size_t 1958 src/Generator.h GeneratorOutput_Arithmetic(size_t array_size, const std::string &name) size_t 1989 src/Generator.h GeneratorOutput(size_t array_size, const std::string &name) size_t 2005 src/Generator.h GeneratorOutput(size_t array_size, const std::string &name, int d) size_t 2009 src/Generator.h GeneratorOutput(size_t array_size, const std::string &name, const Type &t, int d) size_t 2013 src/Generator.h GeneratorOutput(size_t array_size, const std::string &name, const std::vector<Type> &t, int d) size_t 2331 src/Generator.h EXPORT GeneratorBase(size_t size, const void *introspection_helper); size_t 2392 src/Generator.h EXPORT ParamInfo(GeneratorBase *generator, const size_t size); size_t 2420 src/Generator.h const size_t size; size_t 2470 src/Generator.h std::vector<StubInput> build_input(size_t i, const Buffer<T> &arg) { size_t 2495 src/Generator.h std::vector<StubInput> build_input(size_t i, const GeneratorInput<Buffer<T>> &arg) { size_t 2514 src/Generator.h std::vector<StubInput> build_input(size_t i, const Func &arg) { size_t 2524 src/Generator.h std::vector<StubInput> build_input(size_t i, const std::vector<Func> &arg) { size_t 2538 src/Generator.h std::vector<StubInput> build_input(size_t i, const Expr &arg) { size_t 2547 src/Generator.h std::vector<StubInput> build_input(size_t i, const std::vector<Expr> &arg) { size_t 2563 src/Generator.h std::vector<StubInput> build_input(size_t i, const T &arg) { size_t 2576 src/Generator.h std::vector<StubInput> build_input(size_t i, const std::vector<T> &arg) { size_t 2591 src/Generator.h template<typename... Args, size_t... Indices> size_t 640 src/HexagonOffload.cpp Expr buffer_ptr(const uint8_t* buffer, size_t size, const char* name) { size_t 774 src/HexagonOffload.cpp params.push_back(Call::make(type_of<size_t*>(), Call::make_struct, arg_sizes, Call::Intrinsic)); size_t 930 src/HexagonOffload.cpp size_t signed_size = f.tellg(); size_t 195 src/HexagonOptimize.cpp for (size_t i = 0; i < matches.size() && is_match; i++) { size_t 207 src/HexagonOptimize.cpp for (size_t i = Pattern::BeginExactLog2Op; i < Pattern::EndExactLog2Op && is_match; i++) { size_t 222 src/HexagonOptimize.cpp for (size_t i = Pattern::BeginDeinterleaveOp; i < Pattern::EndDeinterleaveOp; i++) { size_t 364 src/IR.cpp for (size_t i = 0; i < values.size(); i++) { size_t 367 src/IR.cpp for (size_t i = 0; i < args.size(); i++) { size_t 381 src/IR.cpp for (size_t i = 0; i < extents.size(); i++) { size_t 403 src/IR.cpp for (size_t i = 0; i < extents.size(); i++) { size_t 442 src/IR.cpp for (size_t i = 0; i < bounds.size(); i++) { size_t 463 src/IR.cpp for (size_t i = 0; i < bounds.size(); i++) { size_t 502 src/IR.cpp for (size_t i = stmts.size()-1; i > 0; i--) { size_t 533 src/IR.cpp return make(func.output_types()[(size_t)idx], func.name(), args, Halide, size_t 544 src/IR.cpp for (size_t i = 0; i < args.size(); i++) { size_t 548 src/IR.cpp for (size_t i = 0; i < args.size(); i++) { size_t 555 src/IR.cpp for (size_t i = 0; i < args.size(); i++) { size_t 699 src/IR.cpp for (size_t i = 0; i + 1 < indices.size(); i++) { size_t 710 src/IR.cpp size_t input_lanes = 0; size_t 721 src/IR.cpp size_t input_lanes = 0; size_t 227 src/IREquality.cpp for (size_t i = 0; (i < a.size()) && result == Equal; i++) { size_t 405 src/IREquality.cpp for (size_t i = 0; (result == Equal) && (i < s->types.size()); i++) { size_t 408 src/IREquality.cpp for (size_t i = 0; (result == Equal) && (i < s->bounds.size()); i++) { size_t 449 src/IREquality.cpp for (size_t i = 0; (i < e->indices.size()) && result == Equal; i++) { size_t 459 src/IREquality.cpp for (size_t i = 0; (result == Equal) && (i < s->bounds.size()); i++) { size_t 60 src/IREquality.h for (size_t i = 0; i < entries.size(); i++) { size_t 67 src/IREquality.h IRCompareCache(int b) : bits(b), entries(static_cast<size_t>(1) << bits) {} size_t 232 src/IRMatch.cpp for (size_t i = 0; result && (i < e->args.size()); i++) { size_t 47 src/IRMutator.cpp for (size_t i = 0; i < bounds.size(); i++) { size_t 147 src/IRMutator.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 234 src/IRMutator.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 241 src/IRMutator.cpp for (size_t i = 0; i < op->values.size(); i++) { size_t 258 src/IRMutator.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 352 src/IRMutator.cpp for (size_t i = 0; i < op->vectors.size(); i++) { size_t 660 src/IROperator.cpp for (size_t i = 0; i < (size_t)dimensions; i++) { size_t 776 src/IROperator.cpp for (size_t i = 0; i < args.size(); i++) { size_t 151 src/IRPrinter.cpp for (size_t i = 0; i < p.ops.size(); ++i) { size_t 162 src/IRPrinter.cpp for (size_t i = 0; i < op.xs.size(); ++i) { size_t 222 src/IRPrinter.cpp for (size_t i = 0; i < function.args.size(); i++) { size_t 263 src/IRPrinter.cpp for (size_t i = 0; i < exprs.size(); i++) { size_t 305 src/IRPrinter.cpp for (size_t i = 0; i < op->value.size(); i++) { size_t 610 src/IRPrinter.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 638 src/IRPrinter.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 664 src/IRPrinter.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 740 src/IRPrinter.cpp for (size_t i = 0; i < op->indices.size(); i++) { size_t 128 src/IRVisitor.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 136 src/IRVisitor.cpp for (size_t i = 0; i < f.extern_arguments().size(); i++) { size_t 178 src/IRVisitor.cpp for (size_t i = 0; i < op->values.size(); i++) { size_t 181 src/IRVisitor.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 187 src/IRVisitor.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 201 src/IRVisitor.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 210 src/IRVisitor.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 380 src/IRVisitor.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 417 src/IRVisitor.cpp for (size_t i = 0; i < op->values.size(); i++) { size_t 420 src/IRVisitor.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 426 src/IRVisitor.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 440 src/IRVisitor.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 449 src/IRVisitor.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 278 src/InjectHostDevBufferCopies.cpp size_t non_host_devices_reading_count = 0; size_t 291 src/InjectHostDevBufferCopies.cpp size_t non_host_devices_writing_count = 0; size_t 608 src/InjectHostDevBufferCopies.cpp for (size_t i = body_lets.size(); i > 0; i--) { size_t 85 src/InjectImageIntrinsics.cpp for (size_t i = 0; i < padded_call_args.size(); i++) { size_t 49 src/InjectOpenGLIntrinsics.cpp for (size_t i = 0; i < 2; i++) { size_t 38 src/Inline.cpp for (size_t i = 0; i < s.dims().size(); i++) { size_t 55 src/Inline.cpp for (size_t i = 0; i < s.splits().size(); i++) { size_t 76 src/Inline.cpp for (size_t i = 0; i < s.bounds().size(); i++) { size_t 103 src/Inline.cpp for (size_t i = 0; i < args.size(); i++) { size_t 114 src/Inline.cpp for (size_t i = 0; i < args.size(); i++) { size_t 94 src/InlineReductions.cpp for (size_t i = 0; i < free_vars.size(); i++) { size_t 167 src/Introspection.cpp size_t last_slash = binary.rfind('/'); size_t 199 src/Introspection.cpp for (size_t i = 0; i < functions.size(); i++) { size_t 240 src/Introspection.cpp for (size_t i = 0; i < functions.size(); i++) { size_t 244 src/Introspection.cpp for (size_t j = 0; j < f.variables.size(); j++) { size_t 246 src/Introspection.cpp for (size_t k = 0; k < v.live_ranges.size(); k++) { size_t 253 src/Introspection.cpp for (size_t i = 0; i < source_lines.size(); i++) { size_t 257 src/Introspection.cpp for (size_t i = 0; i < global_variables.size(); i++) { size_t 288 src/Introspection.cpp size_t hi = global_variables.size(); size_t 289 src/Introspection.cpp size_t lo = 0; size_t 291 src/Introspection.cpp size_t mid = (hi + lo)/2; size_t 305 src/Introspection.cpp size_t idx = lo; size_t 343 src/Introspection.cpp for (; (size_t)idx < global_variables.size() && global_variables[idx].addr <= address; idx++) { size_t 382 src/Introspection.cpp void register_heap_object(const void *obj, size_t size, const void *helper) { size_t 413 src/Introspection.cpp for (size_t i = 0; i < object_type->members.size(); i++) { size_t 428 src/Introspection.cpp for (size_t i = 0; i < heap_object.members.size(); i++) { size_t 440 src/Introspection.cpp for (size_t j = 0; j < parent.type->members.size(); j++) { size_t 470 src/Introspection.cpp for (size_t i = 0; i < heap_object.members.size(); i++) { size_t 478 src/Introspection.cpp void deregister_heap_object(const void *obj, size_t size) { size_t 515 src/Introspection.cpp for (size_t i = 0; i < obj.members.size(); i++) { size_t 656 src/Introspection.cpp for (size_t j = 0; j < func->variables.size(); j++) { size_t 663 src/Introspection.cpp for (size_t i = 0; i < var.live_ranges.size(); i++) { size_t 767 src/Introspection.cpp size_t hi = source_lines.size(); size_t 768 src/Introspection.cpp size_t lo = 0; size_t 770 src/Introspection.cpp size_t mid = (hi + lo)/2; size_t 796 src/Introspection.cpp for (size_t i = 0; i < types.size(); i++) { size_t 801 src/Introspection.cpp for (size_t j = 0; j < types[i].members.size(); j++) { size_t 816 src/Introspection.cpp for (size_t i = 0; i < functions.size(); i++) { size_t 823 src/Introspection.cpp for (size_t j = 0; j < f.variables.size(); j++) { size_t 835 src/Introspection.cpp for (size_t k = 0; k < v.live_ranges.size(); k++) { size_t 844 src/Introspection.cpp for (size_t i = 0; i < source_lines.size(); i++) { size_t 852 src/Introspection.cpp for (size_t i = 0; i < global_variables.size(); i++) { size_t 1128 src/Introspection.cpp for (size_t i = 0; i < namespace_stack.size(); i++) { size_t 1142 src/Introspection.cpp for (size_t i = 0; i < fmt.fields.size(); i++) { size_t 1596 src/Introspection.cpp for (size_t i = 0; i < functions.size(); i++) { size_t 1600 src/Introspection.cpp for (size_t i = 0; i < functions.size(); i++) { size_t 1613 src/Introspection.cpp for (size_t i = 0; i < functions.size(); i++) { size_t 1614 src/Introspection.cpp for (size_t j = 0; j < functions[i].variables.size(); j++) { size_t 1619 src/Introspection.cpp for (size_t i = 0; i < functions.size(); i++) { size_t 1620 src/Introspection.cpp for (size_t j = 0; j < functions[i].variables.size(); j++) { size_t 1640 src/Introspection.cpp for (size_t i = 0; i < global_variables.size(); i++) { size_t 1650 src/Introspection.cpp for (size_t i = 0; i < global_variables.size(); i++) { size_t 1668 src/Introspection.cpp for (size_t i = 0; i < types.size(); i++) { size_t 1672 src/Introspection.cpp for (size_t i = 0; i < functions.size(); i++) { size_t 1673 src/Introspection.cpp for (size_t j = 0; j < functions[i].variables.size(); j++) { size_t 1679 src/Introspection.cpp for (size_t i = 0; i < global_variables.size(); i++) { size_t 1684 src/Introspection.cpp for (size_t i = 0; i < types.size(); i++) { size_t 1685 src/Introspection.cpp for (size_t j = 0; j < types[i].members.size(); j++) { size_t 1692 src/Introspection.cpp for (size_t i = 0; i < types.size(); i++) { size_t 1737 src/Introspection.cpp for (size_t i = 0; i < functions.size(); i++) { size_t 1739 src/Introspection.cpp for (size_t j = 0; j < new_vars.size(); j++) { size_t 1747 src/Introspection.cpp size_t members = v.type->members.size(); size_t 1758 src/Introspection.cpp for (size_t k = 0; k < members; k++) { size_t 1772 src/Introspection.cpp for (size_t j = 0; j < functions[i].variables.size(); j++) { size_t 1782 src/Introspection.cpp for (size_t i = 0; i < global_variables.size(); i++) { size_t 1790 src/Introspection.cpp for (size_t j = 0; j < members.size(); j++) { size_t 1813 src/Introspection.cpp for (size_t i = 0; i < functions.size(); i++) { size_t 1823 src/Introspection.cpp for (size_t j = 0; j < f.variables.size(); j++) { size_t 1841 src/Introspection.cpp for (size_t i = 0; i < global_variables.size(); i++) { size_t 2116 src/Introspection.cpp size_t hi = functions.size(); size_t 2117 src/Introspection.cpp size_t lo = 0; size_t 2119 src/Introspection.cpp size_t mid = (hi + lo)/2; size_t 2204 src/Introspection.cpp void register_heap_object(const void *obj, size_t size, const void *helper) { size_t 2211 src/Introspection.cpp void deregister_heap_object(const void *obj, size_t size) { size_t 2288 src/Introspection.cpp void register_heap_object(const void *obj, size_t size, const void *helper) { size_t 2291 src/Introspection.cpp void deregister_heap_object(const void *obj, size_t size) { size_t 30 src/Introspection.h EXPORT void register_heap_object(const void *obj, size_t size, const void *helper); size_t 33 src/Introspection.h EXPORT void deregister_heap_object(const void *obj, size_t size); size_t 174 src/JITModule.cpp std::vector<std::pair<uint8_t *, size_t>> code_pages; size_t 181 src/JITModule.cpp for (size_t i = 0; i < modules.size(); i++) { size_t 313 src/JITModule.cpp for (size_t i = 0; i < listeners.size(); i++) { size_t 332 src/JITModule.cpp for (size_t i = 0; i < requested_exports.size(); i++) { size_t 341 src/JITModule.cpp for (size_t i = 0; i < listeners.size(); i++) { size_t 513 src/JITModule.cpp void *malloc_handler(void *context, size_t x) { size_t 127 src/JITModule.h void *(*custom_malloc)(void *, size_t){nullptr}; size_t 412 src/LLVM_Runtime_Linker.cpp for (size_t i = 0; i < modules.size(); i++) { size_t 418 src/LLVM_Runtime_Linker.cpp for (size_t i = 1; i < modules.size(); i++) { size_t 526 src/LLVM_Runtime_Linker.cpp size_t at = unmangled_name.rfind('@'); size_t 228 src/LoopCarry.cpp for (size_t i = 0; i < v.size(); i++) { size_t 318 src/LoopCarry.cpp for (size_t i = 0; i < chains.size(); i++) { size_t 320 src/LoopCarry.cpp for (size_t j = 0; j < chains.size(); j++) { size_t 330 src/LoopCarry.cpp for (size_t i = 0; i < chains.size(); i++) { size_t 354 src/LoopCarry.cpp size_t sz = 0; size_t 356 src/LoopCarry.cpp if (sz + c.size() > (size_t)max_carried_values) { size_t 357 src/LoopCarry.cpp if (sz < (size_t)max_carried_values - 1) { size_t 389 src/LoopCarry.cpp for (size_t i = 0; i < c.size(); i++) { size_t 433 src/LoopCarry.cpp for (size_t i = 0; i < c.size() - 1; i++) { size_t 444 src/LoopCarry.cpp for (size_t i = initial_lets.size(); i > 0; i--) { size_t 450 src/LoopCarry.cpp for (size_t i = containing_lets.size(); i > 0; i--) { size_t 322 src/Lower.cpp for (size_t i = 0; i < custom_passes.size(); i++) { size_t 368 src/Lower.cpp for (size_t i = 0; i < args.size(); i++) { size_t 28 src/Memoization.cpp for (size_t i = 0; i < extern_args.size(); i++) { size_t 54 src/Memoization.cpp for (size_t i = 1; i < call->args.size(); i++) { size_t 152 src/Memoization.cpp size_t parameters_alignment() { size_t 166 src/Memoization.cpp return size_t(1) << i; size_t 188 src/Memoization.cpp size_t size_so_far = 0; size_t 191 src/Memoization.cpp size_t needed_alignment = parameters_alignment(); size_t 224 src/Memoization.cpp size_t alignment = Handle().bytes(); size_t 236 src/Memoization.cpp size_t needed_alignment = parameters_alignment(); size_t 447 src/Memoization.cpp size_t off = realization_name.rfind('.'); size_t 449 src/Memoization.cpp size_t i = off + 1; size_t 508 src/Memoization.cpp for (size_t i = allocations.size(); i > 0; i--) { size_t 43 src/Module.cpp size_t slash_idx = base_path_name.rfind('/'); size_t 44 src/Module.cpp size_t backslash_idx = base_path_name.rfind('\\'); size_t 214 src/Module.cpp for (size_t i = 0; i < modules.size(); i++) { size_t 436 src/Module.cpp const size_t num_threads = (debug::debug_level() > 0) ? 1 : Internal::ThreadPool<void>::num_processors_online(); size_t 298 src/Monotonic.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 323 src/Monotonic.cpp for (size_t i = 0; i < op->vectors.size(); i++) { size_t 15 src/ObjectInstanceRegistry.cpp void ObjectInstanceRegistry::register_instance(void *this_ptr, size_t size, Kind kind, size_t 43 src/ObjectInstanceRegistry.cpp std::vector<void *> ObjectInstanceRegistry::instances_in_range(void *start, size_t size, size_t 55 src/ObjectInstanceRegistry.h static void register_instance(void *this_ptr, size_t size, Kind kind, void *subject_ptr, size_t 67 src/ObjectInstanceRegistry.h static std::vector<void *> instances_in_range(void *start, size_t size, Kind kind); size_t 74 src/ObjectInstanceRegistry.h size_t size; // May be 0 for params size_t 79 src/ObjectInstanceRegistry.h InstanceInfo(size_t size, Kind kind, void *subject_ptr, bool registered_for_introspection) size_t 35 src/ParallelRVar.cpp for (size_t i = 0; i < loads.size(); i++) { size_t 36 src/ParallelRVar.cpp for (size_t j = 0; j < loads[i].size(); j++) { size_t 100 src/ParallelRVar.cpp for (size_t i = 0; i < values.size(); i++) { size_t 107 src/ParallelRVar.cpp for (size_t i = 0; i < args.size(); i++) { size_t 120 src/ParallelRVar.cpp for (size_t i = 0; i < args.size(); i++) { size_t 126 src/ParallelRVar.cpp for (size_t i = 0; i < find.loads.size(); i++) { size_t 129 src/ParallelRVar.cpp for (size_t j = 0; j < find.loads[i].size(); j++) { size_t 353 src/Parameter.cpp user_assert(args->size() == (size_t)dims) size_t 357 src/Parameter.cpp for (size_t i = 0; i < args->size(); i++) { size_t 103 src/Pipeline.cpp for (size_t i = 0; i < custom_lowering_passes.size(); i++) { size_t 372 src/Pipeline.cpp for (size_t i = 0; i < name.size(); i++) { size_t 446 src/Pipeline.cpp void Pipeline::set_custom_allocator(void *(*cust_malloc)(void *, size_t), size_t 517 src/Pipeline.cpp for (size_t i = 0; i < r.size(); i++) { size_t 562 src/Pipeline.cpp size_t len = strlen(message); size_t 581 src/Pipeline.cpp for (size_t i = 0; i < len - 1; i++) { size_t 683 src/Pipeline.cpp for (size_t i = 0; i < dst.size(); i++) { size_t 729 src/Pipeline.cpp for (size_t i = 0; i < dst.size(); i++) { size_t 772 src/Pipeline.cpp for (size_t i = 0; i < pipeline_contents.outputs.size(); i++) { size_t 793 src/Pipeline.cpp for (size_t i = 0; i < dst.size(); i++) { size_t 911 src/Pipeline.cpp vector<size_t> query_indices; size_t 912 src/Pipeline.cpp for (size_t i = 0; i < contents->inferred_args.size(); i++) { size_t 973 src/Pipeline.cpp for (size_t i : query_indices) { size_t 226 src/Pipeline.h EXPORT void set_custom_allocator(void *(*malloc)(void *, size_t), size_t 169 src/Prefetch.cpp for (size_t i = 0; i < box.size(); i++) { size_t 236 src/Prefetch.cpp for (size_t i = 0; i < bounds.size(); ++i) { size_t 267 src/Prefetch.cpp size_t max_dim; size_t 280 src/Prefetch.cpp size_t max_arg_size = 2 + 2 * max_dim; // Prefetch: {base, offset, extent0, stride0, extent1, stride1, ...} size_t 287 src/Prefetch.cpp for (size_t i = max_arg_size; i < call->args.size(); i += 2) { size_t 295 src/Prefetch.cpp for (size_t i = 2; i < max_arg_size; ++i) { size_t 300 src/Prefetch.cpp for (size_t i = 0; i < index_names.size(); ++i) { size_t 310 src/Prefetch.cpp ReducePrefetchDimension(size_t dim) : max_dim(dim) {} size_t 336 src/Prefetch.cpp for (size_t i = 2; i < call->args.size(); i += 2) { size_t 363 src/Prefetch.cpp for (size_t i = 0; i < index_names.size(); ++i) { size_t 383 src/Prefetch.cpp size_t max_dim = 0; size_t 57 src/PrintLoopNest.cpp for (size_t i = 0; i < s.size(); i++) { size_t 96 src/Profiling.cpp for (size_t i = 1; i < extents.size(); i++) { size_t 108 src/Profiling.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 63 src/RDom.cpp for (size_t i = 0; i < sizeof(vars)/sizeof(vars[0]); i++) { size_t 107 src/RDom.cpp for (size_t i = 0; i < ranges.size(); i++) { size_t 71 src/Random.cpp for (size_t i = 1; i < e.size(); i++) { size_t 121 src/Random.cpp for (size_t i = 0; i < free_vars.size(); i++) { size_t 23 src/Reduction.cpp for (size_t i = 0; i < expected.size(); ++i) { size_t 17 src/RemoveDeadAllocations.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 160 src/RemoveUndef.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 308 src/RemoveUndef.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 321 src/RemoveUndef.cpp for (size_t i = 1; i < args_predicates.size(); i++) { size_t 329 src/RemoveUndef.cpp for (size_t i = 0; i < op->values.size(); i++) { size_t 348 src/RemoveUndef.cpp for (size_t i = 1; i < values_predicates.size(); i++) { size_t 368 src/RemoveUndef.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 406 src/RemoveUndef.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 220 src/ScheduleFunctions.cpp for (size_t i = splits.size(); i > 0; i--) { size_t 224 src/ScheduleFunctions.cpp for (size_t j = 0; j < let_stmts.size(); j++) { size_t 275 src/ScheduleFunctions.cpp for (size_t i = 0; i < values.size(); i++) { size_t 283 src/ScheduleFunctions.cpp for (size_t i = 0; i < def.args().size(); i++) { size_t 296 src/ScheduleFunctions.cpp for (size_t i = specializations.size(); i > 0; i--) { size_t 497 src/ScheduleFunctions.cpp for (size_t i = 0; i < lets.size(); i++) { size_t 518 src/ScheduleFunctions.cpp for (size_t i = 0; i < f.updates().size(); i++) { size_t 545 src/ScheduleFunctions.cpp for (size_t stage = 0; stage <= func.updates().size(); stage++) { size_t 546 src/ScheduleFunctions.cpp for (size_t i = 0; i < s.bounds().size(); i++) { size_t 745 src/ScheduleFunctions.cpp for (size_t i = lets.size(); i > 0; i--) { size_t 800 src/ScheduleFunctions.cpp size_t first_dot = f->name.find('.'); size_t 801 src/ScheduleFunctions.cpp size_t last_dot = f->name.rfind('.'); size_t 1000 src/ScheduleFunctions.cpp for (size_t i = 0; i < f.updates().size(); i++) { size_t 1022 src/ScheduleFunctions.cpp for (size_t i = 0; i < definitions.size(); i++) { size_t 1077 src/ScheduleFunctions.cpp size_t store_idx = 0, compute_idx = 0; size_t 1078 src/ScheduleFunctions.cpp for (size_t i = 0; i < sites.size(); i++) { size_t 1093 src/ScheduleFunctions.cpp for (size_t i = store_idx + 1; i <= compute_idx; i++) { size_t 1108 src/ScheduleFunctions.cpp for (size_t i = 0; i < sites.size(); i++) { size_t 1156 src/ScheduleFunctions.cpp for (size_t i = order.size(); i > 0; i--) { size_t 242 src/Simplify.cpp void found_buffer_reference(const string &name, size_t dimensions = 0) { size_t 243 src/Simplify.cpp for (size_t i = 0; i < dimensions; i++) { size_t 4121 src/Simplify.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 4259 src/Simplify.cpp for (size_t i = 0; i < op->args.size(); ++i) { size_t 4270 src/Simplify.cpp for (size_t i = 2; i < args.size(); i += 2) { size_t 4273 src/Simplify.cpp for (size_t j = i + 2; j < args.size(); j += 2) { size_t 4371 src/Simplify.cpp for (size_t i = 1; i < new_vectors.size() && can_collapse; i++) { size_t 4396 src/Simplify.cpp for (size_t i = 1; i < new_vectors.size() && can_collapse; i++) { size_t 4423 src/Simplify.cpp for (size_t i = 0; i < new_vectors.size() && can_collapse; i++) { size_t 4445 src/Simplify.cpp for (size_t j = 0; j < first_shuffle->vectors.size() && can_collapse; j++) { size_t 4464 src/Simplify.cpp for (size_t i = 1; i < new_vectors.size() && can_collapse; i++) { size_t 4488 src/Simplify.cpp for (size_t i = 1; i < new_vectors.size() && can_collapse; i++) { size_t 4536 src/Simplify.cpp for (size_t i = 0; i < slices_a.size(); i++) { size_t 4543 src/Simplify.cpp for (size_t i = 0; i < slices_a.size(); i++) { size_t 4848 src/Simplify.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 4896 src/Simplify.cpp for (size_t i = lets.size(); i > 0; i--) { size_t 5599 src/Simplify.cpp for (size_t i = 0; i < clamped.size(); ++i) { size_t 5610 src/Simplify.cpp for (size_t i = 0; i < clamped.size(); ++i) { size_t 5621 src/Simplify.cpp for (size_t i = 0; i < clamped.size(); ++i) { size_t 5643 src/Simplify.cpp for (size_t i = 0; i < clamped.size(); ++i) { size_t 5653 src/Simplify.cpp for (size_t i = 0; i < clamped.size(); ++i) { size_t 124 src/SimplifySpecializations.cpp for (size_t i = specializations.size(); i > 0; i--) { size_t 28 src/SkipStages.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 252 src/SkipStages.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 462 src/SkipStages.cpp for (size_t i = order.size()-1; i > 0; i--) { size_t 250 src/SlidingWindow.cpp for (size_t i = 0; i < func.updates().size(); i++) { size_t 170 src/SplitTuples.cpp for (size_t i = 0; i < op->values.size(); i++) { size_t 113 src/StmtToHtml.cpp for (size_t i = 0; i < args.size(); i++) { size_t 161 src/StmtToHtml.cpp for (size_t i = 0; i < op->value.size(); i++) { size_t 424 src/StmtToHtml.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 466 src/StmtToHtml.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 491 src/StmtToHtml.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 611 src/StmtToHtml.cpp for (size_t i = 0; i < op.args.size(); i++) { size_t 46 src/StorageFlattening.cpp for (size_t i = 0; i < args.size(); i++) { size_t 66 src/StorageFlattening.cpp for (size_t i = 0; i < args.size(); i++) { size_t 80 src/StorageFlattening.cpp for (size_t i = 0; i < args.size(); i++) { size_t 104 src/StorageFlattening.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 119 src/StorageFlattening.cpp for (size_t i = 0; i < storage_dims.size(); i++) { size_t 120 src/StorageFlattening.cpp for (size_t j = 0; j < args.size(); j++) { size_t 184 src/StorageFlattening.cpp for (size_t i = op->bounds.size(); i > 0; i--) { size_t 233 src/StorageFlattening.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 252 src/StorageFlattening.cpp for (size_t i = 0; i < storage_dims.size(); i++) { size_t 253 src/StorageFlattening.cpp for (size_t j = 0; j < args.size(); j++) { size_t 263 src/StorageFlattening.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 269 src/StorageFlattening.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 124 src/StorageFolding.cpp for (size_t i = box.size(); i > 0; i--) { size_t 331 src/StorageFolding.cpp for (size_t i = 0; i < folder.dims_folded.size(); i++) { size_t 66 src/Target.cpp bool use_64_bits = (sizeof(size_t) == 8); size_t 307 src/Target.cpp size_t first_dash; size_t 317 src/Target.cpp for (size_t i = 0; i < tokens.size(); i++) { size_t 90 src/Target.h for (size_t i = 0; i < initial_features.size(); i++) { size_t 79 src/ThreadPool.h static size_t num_processors_online() { size_t 89 src/ThreadPool.h ThreadPool(size_t desired_num_threads = num_processors_online()) { size_t 95 src/ThreadPool.h for (size_t i = 0; i < desired_num_threads; ++i) { size_t 127 src/Tracing.cpp for (size_t i = 0; i < values.size(); i++) { size_t 147 src/Tracing.cpp for (size_t i = 0; i < args.size(); i++) { size_t 177 src/Tracing.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 189 src/TrimNoOps.cpp for (size_t i = containing_loops.size(); i > 0; i--) { size_t 11 src/Tuple.cpp for (size_t i = 0; i < f.size(); i++) { size_t 24 src/Tuple.h size_t size() const { return exprs.size(); } size_t 27 src/Tuple.h Expr &operator[](size_t x) { size_t 33 src/Tuple.h Expr operator[](size_t x) const { size_t 74 src/Tuple.h size_t size() const { return images.size(); } size_t 77 src/Tuple.h const Buffer<> &operator[](size_t x) const { size_t 83 src/Tuple.h Buffer<> &operator[](size_t x) { size_t 116 src/Tuple.h for (size_t i = 0; i < result.size(); i++) { size_t 124 src/Tuple.h for (size_t i = 0; i < result.size(); i++) { size_t 49 src/Util.cpp size_t read = 0; size_t 95 src/Util.cpp int unique_count(size_t h) { size_t 111 src/Util.cpp return prefix + std::to_string(unique_count((size_t)(prefix))); size_t 127 src/Util.cpp for (size_t i = 0; i < sanitized.size(); i++) { size_t 163 src/Util.cpp for (size_t i = 0; i < prefix.size(); i++) { size_t 171 src/Util.cpp size_t off = str.size() - suffix.size(); size_t 172 src/Util.cpp for (size_t i = 0; i < suffix.size(); i++) { size_t 179 src/Util.cpp size_t pos = 0; size_t 195 src/Util.cpp for (size_t i = 0; i < name.size(); i++) { size_t 206 src/Util.cpp size_t start = 0; size_t 207 src/Util.cpp size_t found = 0; size_t 119 src/Util.h for (size_t i = 1; i < vec.size(); i++) { size_t 134 src/Util.h for (size_t i = vec.size()-1; i > 0; i--) { size_t 270 src/Util.h static constexpr size_t size() { return sizeof...(Ints); } size_t 296 src/Util.h template<size_t... Ints> size_t 297 src/Util.h using index_sequence = integer_sequence<size_t, Ints...>; size_t 299 src/Util.h template<size_t N> size_t 300 src/Util.h using make_index_sequence = make_integer_sequence<size_t, N>; size_t 817 src/VaryingAttributes.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 824 src/VaryingAttributes.cpp for (size_t i = 0; i < new_args.size(); ++i) { size_t 857 src/VaryingAttributes.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 871 src/VaryingAttributes.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 894 src/VaryingAttributes.cpp for (size_t i = 0; i < op->bounds.size(); i++) { size_t 480 src/VectorizeLoops.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 494 src/VectorizeLoops.cpp for (size_t i = 1; i <= 2; i++) { size_t 501 src/VectorizeLoops.cpp for (size_t i = 0; i < call_args.size(); i++) { size_t 514 src/VectorizeLoops.cpp for (size_t i = 0; i < new_args.size(); i++) { size_t 624 src/VectorizeLoops.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 632 src/VectorizeLoops.cpp for (size_t i = 0; i < op->args.size(); i++) { size_t 644 src/VectorizeLoops.cpp for (size_t i = 0; i < new_args.size(); i++) { size_t 647 src/VectorizeLoops.cpp for (size_t i = 0; i < new_values.size(); i++) { size_t 819 src/VectorizeLoops.cpp for (size_t i = 0; i < op->extents.size(); i++) { size_t 864 src/VectorizeLoops.cpp for (size_t i = containing_lets.size(); i > 0; i--) { size_t 153 src/WrapExternStages.cpp size_t num_functions = m.functions().size(); size_t 154 src/WrapExternStages.cpp for (size_t i = 0; i < num_functions; i++) { size_t 264 src/runtime/HalideBuffer.h for (size_t i = 0; i < sizes.size(); i++) { size_t 276 src/runtime/HalideBuffer.h template<typename Array, size_t N> size_t 294 src/runtime/HalideBuffer.h template<typename Array, size_t N> size_t 305 src/runtime/HalideBuffer.h template<typename Array, size_t N> size_t 398 src/runtime/HalideBuffer.h size_t number_of_elements() const { size_t 399 src/runtime/HalideBuffer.h size_t s = 1; size_t 441 src/runtime/HalideBuffer.h size_t size_in_bytes() const { size_t 442 src/runtime/HalideBuffer.h return (size_t)((const uint8_t *)end() - (const uint8_t *)begin()); size_t 628 src/runtime/HalideBuffer.h size_t size = type().bytes(); size_t 637 src/runtime/HalideBuffer.h assert(size == (size_t)type().bytes() && "Error: Overflow computing total size of buffer."); size_t 642 src/runtime/HalideBuffer.h void allocate(void *(*allocate_fn)(size_t) = nullptr, size_t 656 src/runtime/HalideBuffer.h size_t size = size_in_bytes(); size_t 657 src/runtime/HalideBuffer.h const size_t alignment = 128; size_t 769 src/runtime/HalideBuffer.h template<typename Array, size_t N> size_t 955 src/runtime/HalideBuffer.h Buffer<T, D> copy(void *(*allocate_fn)(size_t) = nullptr, size_t 1089 src/runtime/HalideBuffer.h for (size_t i = 0; i < delta.size(); i++) { size_t 1097 src/runtime/HalideBuffer.h assert(sizeof...(args) <= (size_t)dimensions()); size_t 1100 src/runtime/HalideBuffer.h for (size_t i = 0; i < sizeof...(args); i++) { size_t 1108 src/runtime/HalideBuffer.h assert(sizeof...(args) <= (size_t)dimensions()); size_t 1110 src/runtime/HalideBuffer.h for (size_t i = 0; i < sizeof...(args); i++) { size_t 1348 src/runtime/HalideBuffer.h void *(*allocate_fn)(size_t) = nullptr, size_t 185 src/runtime/HalideRuntime.h extern void *halide_malloc(void *user_context, size_t x); size_t 187 src/runtime/HalideRuntime.h typedef void *(*halide_malloc_t)(void *, size_t); size_t 634 src/runtime/HalideRuntime.h char *path_buf, size_t path_buf_size); size_t 1059 src/runtime/HalideRuntime.h HALIDE_ALWAYS_INLINE size_t number_of_elements() const { size_t 1060 src/runtime/HalideRuntime.h size_t s = 1; size_t 1092 src/runtime/HalideRuntime.h HALIDE_ALWAYS_INLINE size_t size_in_bytes() const { size_t 1093 src/runtime/HalideRuntime.h return (size_t)(end() - begin()); size_t 27 src/runtime/HalideRuntimeCuda.h size_t arg_sizes[], size_t 28 src/runtime/HalideRuntimeMetal.h size_t arg_sizes[], size_t 27 src/runtime/HalideRuntimeOpenCL.h size_t arg_sizes[], size_t 28 src/runtime/HalideRuntimeOpenGL.h size_t arg_sizes[], size_t 38 src/runtime/HalideRuntimeOpenGLCompute.h size_t arg_sizes[], size_t 11 src/runtime/android_tempfile.cpp char *path_buf, size_t path_buf_size) { size_t 17 src/runtime/android_tempfile.cpp const size_t needed = strlen(kTmp) + strlen(prefix) + strlen(kWild) + strlen(suffix) + 1; size_t 40 src/runtime/cache.cpp if ((size_t)key_size > (sizeof(buf) / 2) - 1) { // Each byte in key can take two bytes in output size_t 63 src/runtime/cache.cpp WEAK bool keys_equal(const uint8_t *key1, const uint8_t *key2, size_t key_size) { size_t 81 src/runtime/cache.cpp const size_t extra_bytes_host_bytes = 16; size_t 88 src/runtime/cache.cpp size_t key_size; size_t 99 src/runtime/cache.cpp bool init(const uint8_t *cache_key, size_t cache_key_size, size_t 117 src/runtime/cache.cpp WEAK bool CacheEntry::init(const uint8_t *cache_key, size_t cache_key_size, size_t 130 src/runtime/cache.cpp size_t storage_bytes = 0; size_t 137 src/runtime/cache.cpp size_t shape_offset = storage_bytes; size_t 141 src/runtime/cache.cpp size_t key_offset = storage_bytes; size_t 156 src/runtime/cache.cpp for (size_t i = 0; i < key_size; i++) { size_t 184 src/runtime/cache.cpp WEAK uint32_t djb_hash(const uint8_t *key, size_t key_size) { size_t 186 src/runtime/cache.cpp for (size_t i = 0; i < key_size; i++) { size_t 194 src/runtime/cache.cpp const size_t kHashTableSize = 256; size_t 211 src/runtime/cache.cpp for (size_t i = 0; i < kHashTableSize; i++) { size_t 351 src/runtime/cache.cpp if (entry->hash == h && entry->key_size == (size_t)size && size_t 446 src/runtime/cache.cpp if (entry->hash == h && entry->key_size == (size_t)size && size_t 553 src/runtime/cache.cpp for (size_t i = 0; i < kHashTableSize; i++) { size_t 19 src/runtime/cl_functions.h size_t /* param_value_size */, size_t 21 src/runtime/cl_functions.h size_t * /* param_value_size_ret */)); size_t 34 src/runtime/cl_functions.h size_t /* param_value_size */, size_t 36 src/runtime/cl_functions.h size_t * /* param_value_size_ret */)); size_t 58 src/runtime/cl_functions.h void (CL_CALLBACK * /* pfn_notify */)(const char *, const void *, size_t, void *), size_t 65 src/runtime/cl_functions.h void (CL_CALLBACK * /* pfn_notify*/ )(const char *, const void *, size_t, void *), size_t 78 src/runtime/cl_functions.h size_t /* param_value_size */, size_t 80 src/runtime/cl_functions.h size_t * /* param_value_size_ret */)); size_t 98 src/runtime/cl_functions.h size_t /* param_value_size */, size_t 100 src/runtime/cl_functions.h size_t * /* param_value_size_ret */)); size_t 106 src/runtime/cl_functions.h size_t /* size */, size_t 144 src/runtime/cl_functions.h size_t /* param_value_size */, size_t 146 src/runtime/cl_functions.h size_t * /* param_value_size_ret */)); size_t 151 src/runtime/cl_functions.h size_t /* param_value_size */, size_t 153 src/runtime/cl_functions.h size_t * /* param_value_size_ret */)); size_t 165 src/runtime/cl_functions.h const size_t * /* lengths */, size_t 185 src/runtime/cl_functions.h size_t /* param_value_size */, size_t 187 src/runtime/cl_functions.h size_t * /* param_value_size_ret */)); size_t 204 src/runtime/cl_functions.h size_t /* arg_size */, size_t 219 src/runtime/cl_functions.h size_t /* offset */, size_t 220 src/runtime/cl_functions.h size_t /* size */, size_t 230 src/runtime/cl_functions.h const size_t * /* buffer_offset */, size_t 231 src/runtime/cl_functions.h const size_t * /* host_offset */, size_t 232 src/runtime/cl_functions.h const size_t * /* region */, size_t 233 src/runtime/cl_functions.h size_t /* buffer_row_pitch */, size_t 234 src/runtime/cl_functions.h size_t /* buffer_slice_pitch */, size_t 235 src/runtime/cl_functions.h size_t /* host_row_pitch */, size_t 236 src/runtime/cl_functions.h size_t /* host_slice_pitch */, size_t 246 src/runtime/cl_functions.h size_t /* offset */, size_t 247 src/runtime/cl_functions.h size_t /* size */, size_t 257 src/runtime/cl_functions.h const size_t * /* buffer_offset */, size_t 258 src/runtime/cl_functions.h const size_t * /* host_offset */, size_t 259 src/runtime/cl_functions.h const size_t * /* region */, size_t 260 src/runtime/cl_functions.h size_t /* buffer_row_pitch */, size_t 261 src/runtime/cl_functions.h size_t /* buffer_slice_pitch */, size_t 262 src/runtime/cl_functions.h size_t /* host_row_pitch */, size_t 263 src/runtime/cl_functions.h size_t /* host_slice_pitch */, size_t 273 src/runtime/cl_functions.h const size_t * /* origin[3] */, size_t 274 src/runtime/cl_functions.h const size_t * /* region[3] */, size_t 275 src/runtime/cl_functions.h size_t /* row_pitch */, size_t 276 src/runtime/cl_functions.h size_t /* slice_pitch */, size_t 286 src/runtime/cl_functions.h const size_t * /* origin[3] */, size_t 287 src/runtime/cl_functions.h const size_t * /* region[3] */, size_t 288 src/runtime/cl_functions.h size_t /* input_row_pitch */, size_t 289 src/runtime/cl_functions.h size_t /* input_slice_pitch */, size_t 300 src/runtime/cl_functions.h size_t /* offset */, size_t 301 src/runtime/cl_functions.h size_t /* size */, size_t 312 src/runtime/cl_functions.h const size_t * /* origin[3] */, size_t 313 src/runtime/cl_functions.h const size_t * /* region[3] */, size_t 314 src/runtime/cl_functions.h size_t * /* image_row_pitch */, size_t 315 src/runtime/cl_functions.h size_t * /* image_slice_pitch */, size_t 333 src/runtime/cl_functions.h const size_t * /* global_work_offset */, size_t 334 src/runtime/cl_functions.h const size_t * /* global_work_size */, size_t 335 src/runtime/cl_functions.h const size_t * /* local_work_size */, size_t 39 src/runtime/cuda.cpp for (size_t i = 0; i < sizeof(lib_names) / sizeof(lib_names[0]); i++) { size_t 244 src/runtime/cuda.cpp size_t memory = 0; size_t 335 src/runtime/cuda.cpp WEAK bool validate_device_pointer(void *user_context, halide_buffer_t* buf, size_t size=0) { size_t 537 src/runtime/cuda.cpp size_t size = buf->size_in_bytes(); size_t 712 src/runtime/cuda.cpp size_t arg_sizes[], size_t 752 src/runtime/cuda.cpp size_t num_args = 0; size_t 765 src/runtime/cuda.cpp for (size_t i = 0; i <= num_args; i++) { // Get NULL at end. size_t 21 src/runtime/cuda_functions.h CUDA_FN(CUresult, cuDeviceTotalMem, (size_t *, CUdevice dev)); size_t 30 src/runtime/cuda_functions.h CUDA_FN_3020(CUresult, cuMemAlloc, cuMemAlloc_v2, (CUdeviceptr *dptr, size_t bytesize)); size_t 32 src/runtime/cuda_functions.h CUDA_FN_3020(CUresult, cuMemcpyHtoD, cuMemcpyHtoD_v2, (CUdeviceptr dstDevice, const void *srcHost, size_t ByteCount)); size_t 33 src/runtime/cuda_functions.h CUDA_FN_3020(CUresult, cuMemcpyDtoH, cuMemcpyDtoH_v2, (void *dstHost, CUdeviceptr srcDevice, size_t ByteCount)); size_t 9 src/runtime/device_interface.cpp extern void *malloc(size_t); size_t 302 src/runtime/device_interface.cpp size_t size = buf->size_in_bytes(); size_t 14 src/runtime/gcd_thread_pool.cpp extern void dispatch_apply_f(size_t iterations, dispatch_queue_t queue, size_t 15 src/runtime/gcd_thread_pool.cpp void *context, void (*work)(void *, size_t)); size_t 95 src/runtime/gcd_thread_pool.cpp WEAK void halide_do_gcd_task(void *job, size_t idx) { size_t 12 src/runtime/hexagon_host.cpp size_t size; size_t 42 src/runtime/hexagon_host.cpp typedef void *(*host_malloc_fn)(size_t); size_t 165 src/runtime/hexagon_host.cpp size_t size; size_t 414 src/runtime/hexagon_host.cpp size_t size = buf->size_in_bytes(); size_t 167 src/runtime/hexagon_remote/dlib.cpp size_t program_size; size_t 189 src/runtime/hexagon_remote/dlib.cpp bool assert_in_bounds(const T *x, size_t count = 1) { size_t 322 src/runtime/hexagon_remote/dlib.cpp bool parse(const char *data, size_t size) { size_t 333 src/runtime/hexagon_remote/dlib.cpp typedef void *(*mmap_fn)(void *, size_t, int, int, int, off_t); size_t 334 src/runtime/hexagon_remote/dlib.cpp typedef int (*mprotect_fn)(void *, size_t, int); size_t 347 src/runtime/hexagon_remote/dlib.cpp const size_t alignment = 4096; size_t 348 src/runtime/hexagon_remote/dlib.cpp size_t aligned_size = (size + alignment - 1) & ~(alignment - 1); size_t 366 src/runtime/hexagon_remote/dlib.cpp size_t size_i = phdrs[i].p_memsz; size_t 367 src/runtime/hexagon_remote/dlib.cpp size_t offset_i = phdrs[i].p_offset; size_t 411 src/runtime/hexagon_remote/dlib.cpp typedef int (*munmap_fn)(void *, size_t); size_t 432 src/runtime/hexagon_remote/dlib.cpp const size_t len = strlen(name); size_t 449 src/runtime/hexagon_remote/dlib.cpp void *mmap_dlopen(const void *code, size_t size) { size_t 11 src/runtime/hexagon_remote/dlib.h void *mmap_dlopen(const void *code, size_t size); size_t 62 src/runtime/hexagon_remote/halide_remote.cpp void *halide_malloc(void *user_context, size_t x) { size_t 26 src/runtime/hexagon_remote/host_malloc.cpp size_t len; size_t 27 src/runtime/hexagon_remote/host_malloc.cpp size_t align; size_t 46 src/runtime/hexagon_remote/host_malloc.cpp ion_user_handle_t ion_alloc(int ion_fd, size_t len, size_t align, unsigned int heap_id_mask, unsigned int flags) { size_t 86 src/runtime/hexagon_remote/host_malloc.cpp size_t size; size_t 119 src/runtime/hexagon_remote/host_malloc.cpp void *halide_hexagon_host_malloc(size_t size) { size_t 126 src/runtime/hexagon_remote/host_malloc.cpp static const size_t alignments[] = { 0x1000, 0x4000, 0x10000, 0x40000, 0x100000 }; size_t 127 src/runtime/hexagon_remote/host_malloc.cpp size_t alignment = alignments[0]; size_t 133 src/runtime/hexagon_remote/host_malloc.cpp for (size_t i = 0; i < sizeof(alignments) / sizeof(alignments[0]); i++) { size_t 200 src/runtime/hexagon_remote/sim_host.cpp for (size_t i = 0; i < arguments.size(); i++) { size_t 457 src/runtime/hexagon_remote/sim_host.cpp void *halide_hexagon_host_malloc(size_t x) { size_t 459 src/runtime/hexagon_remote/sim_host.cpp const size_t alignment = 4096; size_t 466 src/runtime/hexagon_remote/sim_host.cpp void *ptr = (void *)(((size_t)orig + alignment + sizeof(void*) - 1) & ~(alignment - 1)); size_t 118 src/runtime/hexagon_remote/sim_remote.cpp void *halide_malloc(void *user_context, size_t x) { size_t 67 src/runtime/matlab.cpp typedef size_t mwSize; size_t 68 src/runtime/matlab.cpp typedef size_t mwIndex; size_t 152 src/runtime/matlab.cpp INLINE size_t get_number_of_dimensions(const mxArray *a) { size_t 160 src/runtime/matlab.cpp INLINE size_t get_dimension(const mxArray *a, size_t n) { size_t 168 src/runtime/matlab.cpp INLINE mxArray *create_numeric_matrix(size_t M, size_t N, mxClassID type, mxComplexity complexity) { size_t 429 src/runtime/matlab.cpp size_t size_bytes = max(8, (arg_metadata->type.bits + 7) / 8); size_t 29 src/runtime/metal.cpp WEAK mtl_buffer *new_buffer(mtl_device *device, size_t length) { size_t 30 src/runtime/metal.cpp typedef mtl_buffer *(*new_buffer_method)(objc_id device, objc_sel sel, size_t length, size_t options); size_t 87 src/runtime/metal.cpp size_t location; size_t 88 src/runtime/metal.cpp size_t length; size_t 120 src/runtime/metal.cpp WEAK mtl_library *new_library_with_source(mtl_device *device, const char *source, size_t source_len) { size_t 145 src/runtime/metal.cpp WEAK mtl_function *new_function_with_name(mtl_library *library, const char *name, size_t name_len) { size_t 156 src/runtime/metal.cpp mtl_buffer *input_buffer, size_t offset, size_t index); size_t 164 src/runtime/metal.cpp size_t length, size_t index); size_t 332 src/runtime/metal.cpp size_t size = buf->size_in_bytes(); size_t 553 src/runtime/metal.cpp size_t total_size = buffer->size_in_bytes(); size_t 608 src/runtime/metal.cpp size_t arg_sizes[], size_t 653 src/runtime/metal.cpp size_t total_args_size = 0; size_t 654 src/runtime/metal.cpp for (size_t i = 0; arg_sizes[i] != 0; i++) { size_t 675 src/runtime/metal.cpp size_t offset = 0; size_t 676 src/runtime/metal.cpp for (size_t i = 0; arg_sizes[i] != 0; i++) { size_t 689 src/runtime/metal.cpp for (size_t i = 0; arg_sizes[i] != 0; i++) { size_t 59 src/runtime/mex_functions.h MEX_FN_730(size_t, mxGetNumberOfDimensions, mxGetNumberOfDimensions_730, (const mxArray*)); size_t 61 src/runtime/mex_functions.h MEX_FN_730(const size_t*, mxGetDimensions, mxGetDimensions_730, (const mxArray*)); size_t 122 src/runtime/mex_functions.h MEX_FN(size_t, mxGetElementSize, (const mxArray*)); size_t 140 src/runtime/mex_functions.h MEX_FN_730(mxArray*, mxCreateNumericMatrix, mxCreateNumericMatrix_730, (size_t, size_t, mxClassID, mxComplexity)); size_t 115 src/runtime/mini_cl.h size_t image_width; size_t 116 src/runtime/mini_cl.h size_t image_height; size_t 117 src/runtime/mini_cl.h size_t image_depth; size_t 118 src/runtime/mini_cl.h size_t image_array_size; size_t 119 src/runtime/mini_cl.h size_t image_row_pitch; size_t 120 src/runtime/mini_cl.h size_t image_slice_pitch; size_t 127 src/runtime/mini_cl.h size_t origin; size_t 128 src/runtime/mini_cl.h size_t size; size_t 189 src/runtime/mini_cuda.h size_t srcXInBytes; /**< Source X in bytes */ size_t 190 src/runtime/mini_cuda.h size_t srcY; /**< Source Y */ size_t 191 src/runtime/mini_cuda.h size_t srcZ; /**< Source Z */ size_t 192 src/runtime/mini_cuda.h size_t srcLOD; /**< Source LOD */ size_t 198 src/runtime/mini_cuda.h size_t srcPitch; /**< Source pitch (ignored when src is array) */ size_t 199 src/runtime/mini_cuda.h size_t srcHeight; /**< Source height (ignored when src is array; may be 0 if Depth==1) */ size_t 201 src/runtime/mini_cuda.h size_t dstXInBytes; /**< Destination X in bytes */ size_t 202 src/runtime/mini_cuda.h size_t dstY; /**< Destination Y */ size_t 203 src/runtime/mini_cuda.h size_t dstZ; /**< Destination Z */ size_t 204 src/runtime/mini_cuda.h size_t dstLOD; /**< Destination LOD */ size_t 210 src/runtime/mini_cuda.h size_t dstPitch; /**< Destination pitch (ignored when dst is array) */ size_t 211 src/runtime/mini_cuda.h size_t dstHeight; /**< Destination height (ignored when dst is array; may be 0 if Depth==1) */ size_t 213 src/runtime/mini_cuda.h size_t WidthInBytes; /**< Width of 3D memory copy in bytes */ size_t 214 src/runtime/mini_cuda.h size_t Height; /**< Height of 3D memory copy */ size_t 215 src/runtime/mini_cuda.h size_t Depth; /**< Depth of 3D memory copy */ size_t 8 src/runtime/msan.cpp const void *mem, size_t size); size_t 11 src/runtime/msan.cpp AnnotateMemoryIsInitialized("Halide", 0, ptr, (size_t) len); size_t 33 src/runtime/noos.cpp WEAK void *halide_malloc(void *user_context, size_t x) { size_t 31 src/runtime/objc_support.h WEAK objc_id wrap_string_as_ns_string(const char *string, size_t length) { size_t 32 src/runtime/objc_support.h typedef objc_id (*init_with_bytes_no_copy_method)(objc_id ns_string, objc_sel sel, const char *string, size_t length, size_t encoding, uint8_t freeWhenDone); size_t 39 src/runtime/objc_support.h extern "C" size_t strlen(const char *string); size_t 39 src/runtime/opencl.cpp for (size_t i = 0; i < sizeof(lib_names)/sizeof(lib_names[0]); i++) { size_t 217 src/runtime/opencl.cpp WEAK bool validate_device_pointer(void *user_context, halide_buffer_t* buf, size_t size=0) { size_t 224 src/runtime/opencl.cpp size_t real_size; size_t 225 src/runtime/opencl.cpp cl_int result = clGetMemObjectInfo(dev_ptr, CL_MEM_SIZE, sizeof(size_t), &real_size, NULL); size_t 383 src/runtime/opencl.cpp size_t max_work_group_size = 0; size_t 385 src/runtime/opencl.cpp size_t max_work_item_sizes[4] = { 0, }; size_t 388 src/runtime/opencl.cpp struct {void *dst; size_t sz; cl_device_info param;} infos[] = { size_t 708 src/runtime/opencl.cpp size_t size = buf->size_in_bytes(); size_t 787 src/runtime/opencl.cpp size_t offset[3] = { off, 0, 0 }; size_t 788 src/runtime/opencl.cpp size_t region[3] = { c.chunk_size, c.extent[0], c.extent[1] }; size_t 917 src/runtime/opencl.cpp size_t arg_sizes[], size_t 962 src/runtime/opencl.cpp size_t global_dim[3] = {blocksX*threadsX, blocksY*threadsY, blocksZ*threadsZ}; size_t 963 src/runtime/opencl.cpp size_t local_dim[3] = {threadsX, threadsY, threadsZ}; size_t 125 src/runtime/opengl.cpp __attribute__((always_inline)) HalideMalloc(void *user_context, size_t size) size_t 333 src/runtime/opengl.cpp WEAK char *strndup(const char *s, size_t n) { size_t 342 src/runtime/opengl.cpp WEAK char *strstrip(char *str, size_t n) { size_t 647 src/runtime/opengl.cpp size_t i = 0; size_t 1217 src/runtime/opengl.cpp size_t texture_size = width * height * buffer_channels * buf->type.bytes(); size_t 1345 src/runtime/opengl.cpp size_t texture_size = width * height * texture_channels * buf->type.bytes(); size_t 1422 src/runtime/opengl.cpp size_t arg_sizes[], void *args[], int8_t is_buffer[], size_t 68 src/runtime/openglcompute.cpp __attribute__((always_inline)) HalideMalloc(void *user_context, size_t size) size_t 244 src/runtime/openglcompute.cpp size_t size = buf->size_in_bytes(); size_t 283 src/runtime/openglcompute.cpp size_t size_in_bytes = buf->size_in_bytes(); size_t 358 src/runtime/openglcompute.cpp size_t size = buf->size_in_bytes(); size_t 385 src/runtime/openglcompute.cpp size_t size = buf->size_in_bytes(); size_t 427 src/runtime/openglcompute.cpp int shared_mem_bytes, size_t arg_sizes[], void *args[], size_t 531 src/runtime/openglcompute.cpp const size_t kernel_name_length = end - start; size_t 567 src/runtime/openglcompute.cpp const size_t END_OF_KERNEL_MARKER_LENGTH = strlen(END_OF_KERNEL_MARKER); size_t 583 src/runtime/openglcompute.cpp size_t src_len = just_beyond_kernel_name - src; size_t 5 src/runtime/posix_allocator.cpp extern void *malloc(size_t); size_t 12 src/runtime/posix_allocator.cpp WEAK void *default_malloc(void *user_context, size_t x) { size_t 14 src/runtime/posix_allocator.cpp const size_t alignment = 128; size_t 21 src/runtime/posix_allocator.cpp void *ptr = (void *)(((size_t)orig + alignment + sizeof(void*) - 1) & ~(alignment - 1)); size_t 49 src/runtime/posix_allocator.cpp WEAK void *halide_malloc(void *user_context, size_t x) { size_t 9 src/runtime/posix_tempfile.cpp char *path_buf, size_t path_buf_size) { size_t 15 src/runtime/posix_tempfile.cpp const size_t needed = strlen(kTmp) + strlen(prefix) + strlen(kWild) + strlen(suffix) + 1; size_t 327 src/runtime/profiler.cpp size_t cursor = 0; size_t 5 src/runtime/qurt_allocator.cpp extern void *malloc(size_t); size_t 12 src/runtime/qurt_allocator.cpp WEAK void *default_malloc(void *user_context, size_t x) { size_t 14 src/runtime/qurt_allocator.cpp const size_t alignment = 128; size_t 26 src/runtime/qurt_allocator.cpp void *ptr = (void *)(((size_t)orig + alignment + sizeof(void*) - 1) & ~(alignment - 1)); size_t 54 src/runtime/qurt_allocator.cpp WEAK void *halide_malloc(void *user_context, size_t x) { size_t 54 src/runtime/runtime_internal.h void *halide_malloc(void *user_context, size_t x); size_t 64 src/runtime/runtime_internal.h void *malloc(size_t); size_t 68 src/runtime/runtime_internal.h int strncmp(const char* s, const char* t, size_t n); size_t 69 src/runtime/runtime_internal.h size_t strlen(const char* s); size_t 71 src/runtime/runtime_internal.h void* memcpy(void* s1, const void* s2, size_t n); size_t 72 src/runtime/runtime_internal.h int memcmp(const void* s1, const void* s2, size_t n); size_t 73 src/runtime/runtime_internal.h void *memset(void *s, int val, size_t n); size_t 80 src/runtime/runtime_internal.h size_t fwrite(const void *, size_t, size_t, void *); size_t 81 src/runtime/runtime_internal.h ssize_t write(int fd, const void *buf, size_t bytes); size_t 86 src/runtime/runtime_internal.h char *strncpy(char *dst, const char *src, size_t n); size_t 45 src/runtime/tracing.cpp size_t written = 0; size_t 17 src/runtime/windows_tempfile.cpp char *path_buf, size_t path_buf_size) { size_t 20 src/runtime/windows_threads.cpp extern WIN32API Thread CreateThread(void *, size_t, void *(*fn)(void *), void *, int32_t, int32_t *); size_t 115 src/runtime/write_debug_image.cpp size_t elts = 1; size_t 47 src/runtime/x86_cpu_features.cpp const bool use_64_bits = (sizeof(size_t) == 8); size_t 27 test/common/halide_test_dirs.h size_t read = 0; size_t 85 test/correctness/argmax.cpp for (size_t i = 0; i < sizeof(starts)/sizeof(starts[0]); i++) { size_t 23 test/correctness/cascaded_filters.cpp for (size_t i = 0; i < 100; i++) { size_t 27 test/correctness/cascaded_filters.cpp for (size_t i = 0; i < stages.size()-1; i++) { size_t 28 test/correctness/code_explosion.cpp for (size_t i = 2; i < e.size(); i++) { size_t 11 test/correctness/custom_allocator.cpp void *my_malloc(void *user_context, size_t x) { size_t 14 test/correctness/custom_allocator.cpp void *ptr = (void *)((((size_t)orig + 32) >> 5) << 5); size_t 101 test/correctness/exception.cpp for (size_t i = 0; i < 10; i++) { size_t 56 test/correctness/extern_consumer.cpp size_t bytes_read = fread(&result[0], 1, 1023, f); size_t 5 test/correctness/force_onto_stack.cpp void *my_malloc(void *user_context, size_t x) { size_t 9 test/correctness/gpu_multi_device.cpp size_t current_stage; size_t 55 test/correctness/gpu_multi_device.cpp bool verify(const Buffer<float> &result, size_t stages, const char * test_case) { size_t 12 test/correctness/heap_cleanup.cpp void *my_malloc(void *user_context, size_t x) { size_t 15 test/correctness/heap_cleanup.cpp void *ptr = (void *)((((size_t)orig + 32) >> 5) << 5); size_t 11 test/correctness/implicit_args_tests.cpp for (size_t idx = 0; idx < funcs.size(); idx++) { size_t 12 test/correctness/many_dimensions.cpp for (size_t i = 0; i < vars.size(); i++) { size_t 28 test/correctness/many_dimensions.cpp for (size_t i = 0; i < vars.size(); i++) { size_t 38 test/correctness/many_small_extern_stages.cpp size_t sz = out->type.bytes() * out->dim[0].extent * out->dim[1].extent; size_t 67 test/correctness/memoize.cpp void *flakey_malloc(void * /* user_context */, size_t x) { size_t 7 test/correctness/out_of_memory.cpp size_t mem_limit = (size_t)-1; size_t 8 test/correctness/out_of_memory.cpp size_t total_allocated = 0; size_t 13 test/correctness/out_of_memory.cpp std::map<void *, size_t> allocation_sizes; size_t 15 test/correctness/out_of_memory.cpp extern "C" void *test_malloc(void *user_context, size_t x) { size_t 45 test/correctness/out_of_memory.cpp for (size_t i = 0; i < 10; i++) { size_t 44 test/correctness/print.cpp for (size_t i = 0; i < messages.size(); i++) { size_t 156 test/correctness/print.cpp assert(messages.size() == (size_t)N); size_t 179 test/correctness/print.cpp assert(messages.size() == (size_t)N); size_t 6 test/correctness/reorder_storage.cpp size_t expected_allocation = 0; size_t 8 test/correctness/reorder_storage.cpp void *my_malloc(void *user_context, size_t x) { size_t 43 test/correctness/simd_op_check.cpp size_t num_threads = Halide::Internal::ThreadPool<void>::num_processors_online(); size_t 260 test/correctness/simd_op_check.cpp for (size_t i = 0; i < name.size(); i++) { size_t 19 test/correctness/sliding_window.cpp extern "C" void *my_malloc(void *, size_t x) { size_t 19 test/correctness/sort_exprs.cpp size_t size = v.size(); size_t 20 test/correctness/sort_exprs.cpp size_t half_size = size/2; size_t 39 test/correctness/sort_exprs.cpp for (size_t stride = half_size; stride > 0; stride /= 2) { size_t 40 test/correctness/sort_exprs.cpp for (size_t i = 0; i < size; i++) { size_t 36 test/correctness/specialize.cpp void *my_malloc(void *ctx, size_t sz) { size_t 7 test/correctness/stack_allocations.cpp void *my_malloc(void *ctx, size_t sz) { size_t 8 test/correctness/storage_folding.cpp size_t custom_malloc_size = 0; size_t 10 test/correctness/storage_folding.cpp void *my_malloc(void *user_context, size_t x) { size_t 13 test/correctness/storage_folding.cpp void *ptr = (void *)((((size_t)orig + 32) >> 5) << 5); size_t 38 test/correctness/storage_folding.cpp size_t expected_size = 101*4*sizeof(int) + sizeof(int); size_t 60 test/correctness/storage_folding.cpp size_t expected_size = 101*1002*3*sizeof(int) + sizeof(int); size_t 84 test/correctness/storage_folding.cpp size_t expected_size = 101*3*sizeof(int) + sizeof(int); size_t 177 test/correctness/storage_folding.cpp size_t expected_size = 2*1002*4*sizeof(int) + sizeof(int); size_t 216 test/correctness/storage_folding.cpp size_t expected_size = 1000*8*sizeof(int) + sizeof(int); size_t 254 test/correctness/storage_folding.cpp size_t expected_size = 2*1002*3*sizeof(int) + sizeof(int); size_t 288 test/correctness/storage_folding.cpp size_t expected_size = 1000*2*sizeof(int) + sizeof(int); size_t 320 test/correctness/storage_folding.cpp size_t expected_size = 101*3*sizeof(int) + sizeof(int); size_t 52 test/correctness/tuple_reduction.cpp for (size_t i = 0; i < 10; i++) { size_t 100 test/correctness/tuple_reduction.cpp for (size_t i = 0; i < 10; i++) { size_t 145 test/correctness/tuple_reduction.cpp for (size_t i = 0; i < 10; i++) { size_t 19 test/generator/cleanup_on_error_aottest.cpp void *my_halide_malloc(void *user_context, size_t x) { size_t 29 test/generator/cleanup_on_error_aottest.cpp void *ptr = (void *)((((size_t)orig + 32) >> 5) << 5); size_t 21 test/generator/image_from_array_aottest.cpp template<typename Array, size_t N> size_t 37 test/generator/image_from_array_aottest.cpp template<typename Array, size_t N> size_t 47 test/generator/image_from_array_aottest.cpp for (size_t i = 0, last = v.size(); i < last; ++i) { size_t 34 test/generator/matlab_aottest.cpp virtual const size_t *get_dimensions() const = 0; size_t 35 test/generator/matlab_aottest.cpp virtual size_t get_number_of_dimensions() const = 0; size_t 38 test/generator/matlab_aottest.cpp virtual size_t get_element_size() const = 0; size_t 46 test/generator/matlab_aottest.cpp std::vector<size_t> dims; size_t 49 test/generator/matlab_aottest.cpp mxArrayImpl(size_t M, size_t N) : data(M * N), dims({M, N}) {} size_t 53 test/generator/matlab_aottest.cpp const size_t *get_dimensions() const { return &dims[0]; } size_t 54 test/generator/matlab_aottest.cpp size_t get_number_of_dimensions() const { return dims.size(); } size_t 57 test/generator/matlab_aottest.cpp size_t get_element_size() const { return sizeof(T); } size_t 71 test/generator/matlab_aottest.cpp EXPORT size_t mxGetNumberOfDimensions_730(const mxArray *a) { size_t 79 test/generator/matlab_aottest.cpp EXPORT const size_t *mxGetDimensions_730(const mxArray *a) { size_t 84 test/generator/matlab_aottest.cpp assert(sizeof(size_t) == sizeof(int)); size_t 96 test/generator/matlab_aottest.cpp EXPORT size_t mxGetElementSize(const mxArray *a) { size_t 115 test/generator/matlab_aottest.cpp EXPORT mxArray *mxCreateNumericMatrix_730(size_t M, size_t N, mxClassID type, mxComplexity complexity) { size_t 72 test/generator/metadata_tester_generator.cpp for (size_t i = 0; i < array_outputs.size(); ++i) { size_t 54 test/generator/msan_aottest.cpp const void *mem, size_t size) { size_t 16 test/generator/multitarget_aottest.cpp size_t read = 0; size_t 17 test/generator/pyramid_generator.cpp for (size_t i = 1; i < pyramid.size(); i++) { size_t 65 test/generator/stubtest_generator.cpp for (size_t i = 0; i < array_input.size(); ++i) { size_t 29 test/generator/user_context_aottest.cpp void *my_halide_malloc(void *context, size_t sz) { size_t 194 test/opengl/save_state.cpp size_t i = 0; size_t 23 test/opengl/testing.h for (size_t i = 0; i < v.size(); i++) { size_t 14 test/performance/const_division.cpp size_t bits = sizeof(T)*8; size_t 60 test/performance/packed_planar_fusion.cpp while ((size_t)ptr_1 & 0x1f) ptr_1 ++; size_t 61 test/performance/packed_planar_fusion.cpp while ((size_t)ptr_2 & 0x1f) ptr_2 ++; size_t 34 tools/build_halide_h.cpp size_t slash_pos = header.rfind('/'); size_t 377 tools/halide_image_io.h if (!check(fread((void *) &data[0], sizeof(uint8_t), width*height, f.f) == (size_t) (width*height), "Could not read PGM 8-bit data\n")) return false; size_t 388 tools/halide_image_io.h if (!check(fread((void *) &data[0], sizeof(uint16_t), width*height, f.f) == (size_t) (width*height), "Could not read PGM 16-bit data\n")) return false; size_t 428 tools/halide_image_io.h if (!check(fwrite((void *) &data[0], sizeof(uint8_t), width*height, f.f) == (size_t) (width*height), "Could not write PGM 8-bit data\n")) return false; size_t 441 tools/halide_image_io.h if (!check(fwrite((void *) &data[0], sizeof(uint16_t), width*height, f.f) == (size_t) (width*height), "Could not write PGM 16-bit data\n")) return false; size_t 482 tools/halide_image_io.h if (!check(fread((void *) &data[0], sizeof(uint8_t), width*height*3, f.f) == (size_t) (width*height*3), "Could not read PPM 8-bit data\n")) return false; size_t 495 tools/halide_image_io.h if (!check(fread((void *) &data[0], sizeof(uint16_t), width*height*3, f.f) == (size_t) (width*height*3), "Could not read PPM 16-bit data\n")) return false; size_t 553 tools/halide_image_io.h if (!check(fwrite((void *) &data[0], sizeof(uint8_t), width*height*3, f.f) == (size_t) (width*height*3), "Could not write PPM 8-bit data\n")) return false; size_t 586 tools/halide_image_io.h if (!check(fwrite((void *) &data[0], sizeof(uint16_t), width*height*3, f.f) == (size_t) (width*height*3), "Could not write PPM 16-bit data\n")) return false; size_t 50 tools/halide_malloc_trace.h void *halide_malloc_trace(void *user_context, size_t x) { size_t 61 tools/halide_malloc_trace.h void *ptr = (void *)((((size_t)orig + 128) >> 7) << 7); size_t 606 util/HalideTraceViz.cpp size_t halide_clock = 0, video_clock = 0; size_t 632 util/HalideTraceViz.cpp size_t end_counter = 0; size_t 633 util/HalideTraceViz.cpp size_t packet_clock = 0; size_t 638 util/HalideTraceViz.cpp if (end_counter == (size_t)hold_frames) { size_t 756 util/HalideTraceViz.cpp for (size_t i = 0; i < fi.config.labels.size(); i++) {