count              27 apps/linear_algebra/benchmarks/clock.h     return std::chrono::duration_cast<std::chrono::microseconds>(now).count() / 1e3;
count              19 apps/opengl_demo/timer.cpp     const auto ms = std::chrono::duration<double, std::milli>(end_time - info.time).count();
count             410 src/AddImageChecks.cpp                 if (replace_with_constrained.count(min0_name) > 0 ) {
count             417 src/AddImageChecks.cpp                 if (replace_with_constrained.count(extent0_name) > 0 ) {
count              35 src/AllocationBoundsInference.cpp         if (touched_by_extern.count(f.name())) {
count             258 src/Associativity.cpp                 if (dependencies[i].count(j)) {
count             260 src/Associativity.cpp                         if (dependencies[i].count(idx) == 0) {
count            1034 src/Bounds.cpp             count++;
count            1037 src/Bounds.cpp         int count;
count            1038 src/Bounds.cpp         CountVars() : count(0) {}
count            1049 src/Bounds.cpp         return c.count < 10;
count             280 src/BoundsInference.cpp                     inner_productions.count(func_name)) {
count             399 src/BoundsInference.cpp             if (in_pipeline.count(name) == 0) {
count             898 src/BoundsInference.cpp                 if (inner_productions.count(stages[i].name)) {
count             902 src/BoundsInference.cpp                 if (in_pipeline.count(stages[i].name)) {
count             224 src/CSE.cpp            if (!visited.count(e.get())) {
count             370 src/CodeGen_C.cpp         if (!emitted.count(op->name)) {
count             495 src/CodeGen_C.cpp         if (forward_declared.count(handle_type)) continue;
count             194 src/CodeGen_OpenGL_Dev.cpp     if (builtin.count(op->name) == 0) {
count             283 src/Elf.cpp    void append_zeros(std::vector<char> &buf, size_t count) {
count             284 src/Elf.cpp        buf.insert(buf.end(), count, (char)0);
count             317 src/Float16.cpp     unsigned count = repr.convertToHexString(buffer,
count             321 src/Float16.cpp     internal_assert(count < sizeof(buffer) / sizeof(char)) << "Incorrect buffer size\n";
count             194 src/Func.cpp       int placeholder_pos, count;
count             195 src/Func.cpp       std::tie(placeholder_pos, count) = add_implicit_vars(args);
count             196 src/Func.cpp       return FuncRef(func, args, placeholder_pos, count);
count             200 src/Func.cpp       int placeholder_pos, count;
count             201 src/Func.cpp       std::tie(placeholder_pos, count) = add_implicit_vars(args);
count             202 src/Func.cpp       return FuncRef(func, args, placeholder_pos, count);
count             207 src/Func.cpp       int count = 0;
count             221 src/Func.cpp               count++;
count             230 src/Func.cpp       return { placeholder_pos, count };
count             235 src/Func.cpp       int count = 0;
count             251 src/Func.cpp               count++;
count             260 src/Func.cpp       return { placeholder_pos, count };
count             981 src/Func.cpp                   } else if (s.is_split() && descends_from_shiftinwards_outer.count(s.old_var)) {
count             985 src/Func.cpp                              descends_from_shiftinwards_outer.count(s.old_var)) {
count             989 src/Func.cpp               if (descends_from_shiftinwards_outer.count(old_name)) {
count            1796 src/Func.cpp               user_assert(wrappers.count(fs[i].name()) == 0)
count            2384 src/Func.cpp       int count;
count            2386 src/Func.cpp       CountImplicitVars(const vector<Expr> &e) : count(0) {
count            2397 src/Func.cpp               if (index >= count) count = index + 1;
count            2404 src/Func.cpp                    int count) : func(f), implicit_count(count), args(a){
count            2410 src/Func.cpp                    int count) : func(f), implicit_count(count) {
count            2430 src/Func.cpp       CountImplicitVars count(e);
count            2432 src/Func.cpp           a[i].accept(&count);
count            2435 src/Func.cpp       if (count.count > 0) {
count            2440 src/Func.cpp               user_assert(implicit_count >= count.count)
count            2441 src/Func.cpp                   << "The update definition of " << func.name() << " uses " << count.count
count            2448 src/Func.cpp               Internal::debug(2) << "Adding " << count.count << " implicit vars to LHS of " << func.name() << "\n";
count            2451 src/Func.cpp               for (int i = 0; i < count.count; i++) {
count            2459 src/Func.cpp       for (int i = 0; i < count.count; i++) {
count             332 src/Func.h                     int placeholder_pos = -1, int count = 0);
count             334 src/Func.h                     int placeholder_pos = -1, int count = 0);
count             203 src/Function.cpp     int count = 0;
count             215 src/Function.cpp             count++;
count             359 src/Function.cpp         if (copied_map.count(old_func)) {
count             616 src/Function.cpp     deleter.count = 0;
count             667 src/Function.cpp         deleter.count == 0 &&
count             902 src/Function.cpp         if ((c->call_type == Call::Halide) && c->func.defined() && substitutions.count(Function(c->func))) {
count             356 src/FuseGPUThreadLoops.cpp         if (shared.count(op->name)) {
count             375 src/FuseGPUThreadLoops.cpp         if (shared.count(op->name)) {
count             769 src/Generator.cpp     internal_assert(m.count(encode(t))) << t << " " << encode(t);
count            1088 src/Generator.cpp         user_assert(!names.count(param->name())) << "Duplicate Param name: " << param->name();
count            1116 src/Generator.cpp         user_assert(!names.count(input->name())) << "Duplicate Input name: " << input->name();
count            1130 src/Generator.cpp         user_assert(!names.count(output->name())) << "Duplicate Output name: " << output->name();
count            1157 src/Generator.cpp         user_assert(!names.count(param->name)) << "Duplicate GeneratorParam name: " << param->name;
count            1180 src/Generator.cpp         user_assert(!names.count(param->name())) << "Duplicate ScheduleParam name: " << param->name();
count            1213 src/HexagonOptimize.cpp         if (interleavable.count(op->name) != 0) return true;
count            1226 src/HexagonOptimize.cpp         if (not_interleavable.count(op->name) != 0) return false;
count            1326 src/HexagonOptimize.cpp         } else if (interleaving_alts.count(op->name) && is_native_deinterleave(args[0])) {
count             242 src/IRVisitor.cpp     if (visited.count(e.get())) {
count             252 src/IRVisitor.cpp     if (visited.count(s.get())) {
count              65 src/InferArguments.cpp         if (visited_functions.count(func.name())) return;
count             406 src/InjectHostDevBufferCopies.cpp         return buffers_to_track.count(buf) != 0;
count             552 src/InjectHostDevBufferCopies.cpp                                   buf_info.devices_touched.count(DeviceAPI::Host)));
count              20 src/IntrusivePtr.h     std::atomic<int> count;
count              22 src/IntrusivePtr.h     RefCount() : count(0) {}
count              23 src/IntrusivePtr.h     int increment() {return ++count;} // Increment and return new value
count              24 src/IntrusivePtr.h     int decrement() {return --count;} // Decrement and return new value
count              25 src/IntrusivePtr.h     bool is_zero() const {return count == 0;}
count             395 src/JITModule.cpp     if (already_seen.count(start) != 0) {
count             590 src/JITModule.cpp void adjust_module_ref_count(void *arg, int32_t count) {
count             593 src/JITModule.cpp     debug(2) << "Adjusting refcount for module " << module->name << " by " << count << "\n";
count             595 src/JITModule.cpp     if (count > 0) {
count             761 src/JITModule.cpp         *(void (**)(void *arg, int32_t count))fun_addr = &adjust_module_ref_count;
count              96 src/LoopCarry.cpp         if (found.count(op) == 0) {
count             299 src/Schedule.cpp     if (contents->wrappers.count(f)) {
count             204 src/StorageFlattening.cpp             if (outputs.count(f.name())) {
count              33 src/StorageFolding.cpp             count++;
count              42 src/StorageFolding.cpp     int count = 0;
count              50 src/StorageFolding.cpp     return counter.count;
count             131 src/UnpackBuffers.cpp         if (finder.symbols.count(l.first)) {
count             146 src/Util.cpp       int count = unique_count(std::hash<std::string>()(sanitized));
count             147 src/Util.cpp       if (count == 0) {
count             156 src/Util.cpp       return sanitized + "$" + std::to_string(count);
count              23 src/WrapCalls.cpp     internal_assert(func_wrappers_map[in_func].count(wrapped_func) == 0)
count              85 src/WrapCalls.cpp                     if (wrappers.count(in_func)) {
count              35 src/WrapExternStages.cpp         if (done.count(op->name)) {
count              17 src/runtime/cuda_functions.h CUDA_FN(CUresult, cuDeviceGetCount, (int *count));
count             189 src/runtime/hexagon_remote/dlib.cpp     bool assert_in_bounds(const T *x, size_t count = 1) {
count             190 src/runtime/hexagon_remote/dlib.cpp         return assert_in_bounds(x, x + count);
count             193 src/runtime/hexagon_remote/dlib.cpp     bool do_relocations(const Rela *relocs, int count) {
count             194 src/runtime/hexagon_remote/dlib.cpp         for (int i = 0; i < count; i++) {
count              68 src/runtime/mini_opengl.h typedef void (*PFNGLDRAWELEMENTSPROC)(GLenum mode, GLsizei count, GLenum type, const GLvoid *indices );
count             143 src/runtime/mini_opengl.h typedef void (*PFNGLSHADERSOURCEPROC) (GLuint shader, GLsizei count, const GLchar* *string, const GLint *length);
count             146 src/runtime/mini_opengl.h typedef void (*PFNGLUNIFORM1IVPROC) (GLint location, GLsizei count, const GLint *value);
count             147 src/runtime/mini_opengl.h typedef void (*PFNGLUNIFORM2IVPROC) (GLint location, GLsizei count, const GLint *value);
count             148 src/runtime/mini_opengl.h typedef void (*PFNGLUNIFORM1FVPROC) (GLint location, GLsizei count, const GLfloat *value);
count              22 src/runtime/module_jit_ref_count.cpp WEAK void (*halide_jit_module_adjust_ref_count)(void *arg, int32_t count) = NULL;
count              32 src/runtime/write_debug_image.cpp     int32_t count;
count              39 src/runtime/write_debug_image.cpp     void assign16(uint16_t tag_code, int32_t count, int16_t value) __attribute__((always_inline)) {
count              42 src/runtime/write_debug_image.cpp         this->count = count;
count              46 src/runtime/write_debug_image.cpp     void assign32(uint16_t tag_code, int32_t count, int32_t value) __attribute__((always_inline)) {
count              49 src/runtime/write_debug_image.cpp         this->count = count;
count              53 src/runtime/write_debug_image.cpp     void assign32(uint16_t tag_code, int16_t type_code, int32_t count, int32_t value)  __attribute__((always_inline)) {
count              56 src/runtime/write_debug_image.cpp         this->count = count;
count             198 src/runtime/write_debug_image.cpp             int32_t count = shape[0].extent * shape[1].extent * depth;
count             200 src/runtime/write_debug_image.cpp                 if (!fwrite((void*)(&count), 4, 1, f)) {
count              40 test/common/check_call_graphs.h             assert(calls.count(producer) > 0);
count              56 test/common/check_call_graphs.h         if (result.count(iter.first) == 0) {
count              11 test/correctness/bit_counting.cpp     T count = 0;
count              13 test/correctness/bit_counting.cpp         if (v & 1) ++count;
count              16 test/correctness/bit_counting.cpp     return count;
count              16 test/correctness/compute_at_split_rvar.cpp HalideExtern_1(int, count, int);
count              26 test/correctness/compute_at_split_rvar.cpp         f(x) = count(x);
count              50 test/correctness/compute_at_split_rvar.cpp         f(x) = count(x);
count              74 test/correctness/compute_at_split_rvar.cpp         f(x) = count(x);
count             100 test/correctness/compute_at_split_rvar.cpp         f(x) = count(x);
count             125 test/correctness/compute_at_split_rvar.cpp         f(x) = count(x);
count              13 test/correctness/erf.cpp     int count = 0;
count              15 test/correctness/erf.cpp         count++;
count              18 test/correctness/erf.cpp     return count;
count             263 test/correctness/fuzz_simplify.cpp     const int count = 1000;
count             281 test/correctness/fuzz_simplify.cpp             for (int n = 0; n < count; n++) {
count               9 test/correctness/gpu_thread_barrier.cpp     int count;
count              11 test/correctness/gpu_thread_barrier.cpp     CountBarriers() : count(0) {}
count              18 test/correctness/gpu_thread_barrier.cpp             count++;
count              34 test/correctness/gpu_thread_barrier.cpp         if (c.count != correct) {
count              35 test/correctness/gpu_thread_barrier.cpp             printf("There were %d barriers. There were supposed to be %d\n", c.count, correct);
count              41 test/correctness/host_alignment.cpp     int count;
count              43 test/correctness/host_alignment.cpp     CountHostAlignmentAsserts(std::map<string, int> m) : count(0),
count              65 test/correctness/host_alignment.cpp                     count++;
count              85 test/correctness/host_alignment.cpp     return c.count;
count              53 test/correctness/interleave.cpp void define(FuncRef f, Expr value, int count) {
count              55 test/correctness/interleave.cpp     for (int i = 0; i < count; i++) {
count              13 test/correctness/inverse.cpp     int count = 0;
count              15 test/correctness/inverse.cpp         count++;
count              18 test/correctness/inverse.cpp     return count;
count               6 test/correctness/iterate_over_circle.cpp int count = 0;
count               9 test/correctness/iterate_over_circle.cpp         count++;
count              41 test/correctness/iterate_over_circle.cpp     if (count != c) {
count              44 test/correctness/iterate_over_circle.cpp                "times, but there are %d points within that circle\n", count, c);
count              47 test/correctness/lots_of_dimensions.cpp         int count = 0;
count              49 test/correctness/lots_of_dimensions.cpp             count++;
count              58 test/correctness/lots_of_dimensions.cpp         if (count != (int)in.number_of_elements()) {
count              59 test/correctness/lots_of_dimensions.cpp             printf("count = %d instead of %d\n", count, (int)in.number_of_elements());
count              95 test/correctness/side_effects.cpp     Func count;
count              98 test/correctness/side_effects.cpp     count(x, y) = select(escape[1], 0, escape[0]);
count             102 test/correctness/side_effects.cpp     render() += draw_pixel(r.x, r.y, count(r.x, r.y));
count              18 test/correctness/sliding_backwards.cpp HalideExtern_1(int, count, int);
count              24 test/correctness/sliding_backwards.cpp     g(x) = count(x);
count              12 test/correctness/sliding_window.cpp int count = 0;
count              14 test/correctness/sliding_window.cpp     count++;
count              41 test/correctness/sliding_window.cpp         if (count != 101) {
count              42 test/correctness/sliding_window.cpp             printf("f was called %d times instead of %d times\n", count, 101);
count              49 test/correctness/sliding_window.cpp         count = 0;
count              59 test/correctness/sliding_window.cpp         if (count != 101) {
count              60 test/correctness/sliding_window.cpp             printf("f was called %d times instead of %d times\n", count, 101);
count              67 test/correctness/sliding_window.cpp         count = 0;
count              86 test/correctness/sliding_window.cpp         if (count != 404) {
count              87 test/correctness/sliding_window.cpp             printf("f was called %d times instead of %d times\n", count, 404);
count              94 test/correctness/sliding_window.cpp         count = 0;
count             109 test/correctness/sliding_window.cpp         if (count != 100 * 11) {
count             110 test/correctness/sliding_window.cpp             printf("f was called %d times instead of %d times\n", count, 100*11);
count             119 test/correctness/sliding_window.cpp         count = 0;
count             126 test/correctness/sliding_window.cpp         if (count != 11*11) {
count             127 test/correctness/sliding_window.cpp             printf("f was called %d times instead of %d times\n", count, 11*11);
count             136 test/correctness/sliding_window.cpp         count = 0;
count             143 test/correctness/sliding_window.cpp         if (count != 1500) {
count             144 test/correctness/sliding_window.cpp             printf("f was called %d times instead of %d times\n", count, 1500);
count               7 test/correctness/trim_no_ops.cpp     int count = 0;
count              16 test/correctness/trim_no_ops.cpp             count++;
count              24 test/correctness/trim_no_ops.cpp             count++;
count              58 test/correctness/trim_no_ops.cpp         if (s.count != 0) {
count              92 test/correctness/trim_no_ops.cpp         if (s.count != 0) {
count             131 test/correctness/trim_no_ops.cpp             if (s.count != 0) {
count             171 test/correctness/trim_no_ops.cpp         if (s.count != 0) {
count               9 test/correctness/tuple_undef.cpp     int count;
count              11 test/correctness/tuple_undef.cpp     CountStores() : count(0) {}
count              17 test/correctness/tuple_undef.cpp         count++;
count              31 test/correctness/tuple_undef.cpp         if (c.count != correct) {
count              32 test/correctness/tuple_undef.cpp             printf("There were %d stores. There were supposed to be %d\n", c.count, correct);
count              59 test/generator/mandelbrot_generator.cpp         Func count;
count              63 test/generator/mandelbrot_generator.cpp         count(x, y) = select(escape[1], 0, escape[0]);
count              66 test/generator/mandelbrot_generator.cpp         mandelbrot.compute_at(count, xo);
count              68 test/generator/mandelbrot_generator.cpp         count.tile(x, y, xo, yo, xi, yi, 8, 8).parallel(yo).vectorize(xi, 4).unroll(xi).unroll(yi, 2);
count              70 test/generator/mandelbrot_generator.cpp         return count;
count              62 test/generator/memory_profiler_mandelbrot_generator.cpp         Func count;
count              66 test/generator/memory_profiler_mandelbrot_generator.cpp         count(x, y) = select(escape[1], 0, escape[0]);
count              69 test/generator/memory_profiler_mandelbrot_generator.cpp         mandelbrot.compute_at(count, xo);
count              71 test/generator/memory_profiler_mandelbrot_generator.cpp         count.tile(x, y, xo, yo, xi, yi, 8, 8).parallel(yo).vectorize(xi, 4).unroll(xi).unroll(yi, 2);
count              73 test/generator/memory_profiler_mandelbrot_generator.cpp         return count;
count              44 tools/binary2cpp.cpp     int count = 0;
count              55 tools/binary2cpp.cpp         count++;
count              58 tools/binary2cpp.cpp     printf("int %s_length = %d;\n", target, count);
count              24 tools/halide_benchmark.h         double dt = std::chrono::duration_cast<std::chrono::microseconds>(t2 - t1).count() / 1e6;