Lines Matching defs:count
99 mir_create_dependency_graph(midgard_instruction **instructions, unsigned count, unsigned node_count)
112 for (unsigned i = 0; i < count; ++i) {
114 calloc(BITSET_WORDS(count), sizeof(BITSET_WORD));
122 for (signed i = count - 1; i >= 0; --i) {
188 if (instructions[count - 1]->compact_branch) {
189 BITSET_WORD *dependents = instructions[count - 1]->dependents;
191 for (signed i = count - 2; i >= 0; --i) {
296 mir_initialize_worklist(BITSET_WORD *worklist, midgard_instruction **instructions, unsigned count)
298 for (unsigned i = 0; i < count; ++i) {
310 BITSET_WORD *worklist, unsigned count,
332 BITSET_FOREACH_SET(i, done->dependents, count) {
658 BITSET_WORD *worklist, unsigned count,
691 BITSET_FOREACH_SET(i, worklist, count) {
695 BITSET_FOREACH_SET(i, worklist, count) {
766 assert(best_index < count);
796 BITSET_WORD *worklist, unsigned count,
810 midgard_instruction *chosen = mir_choose_instruction(instructions, liveness, worklist, count, &predicate);
818 chosen = mir_choose_instruction(instructions, liveness, worklist, count, &predicate);
824 chosen = mir_choose_instruction(instructions, liveness, worklist, count, &predicate);
880 unsigned count,
888 for (unsigned i = 0; i < count; ++i) {
935 BITSET_WORD *worklist, unsigned count,
942 mir_comparison_mobile(ctx, instructions, predicate, count, cond) : ~0;
946 assert(comp_i < count);
966 BITSET_WORD *worklist, unsigned count,
980 ctx, instructions, predicate, worklist, count, last->src[condition_index],