Lines Matching defs:after
102 * Lower bound of the scheduling time after which one of the instructions
275 * On the second load, it takes just an extra ~140 cycles, and after
654 void add_dep(schedule_node *before, schedule_node *after, int latency);
655 void add_dep(schedule_node *before, schedule_node *after);
1046 * The @after node will be scheduled after @before. We will try to
1047 * schedule it @latency cycles after @before, but no guarantees there.
1050 instruction_scheduler::add_dep(schedule_node *before, schedule_node *after,
1053 if (!before || !after)
1056 assert(before != after);
1059 if (before->children[i] == after) {
1078 before->children[before->child_count] = after;
1081 after->parent_count++;
1085 instruction_scheduler::add_dep(schedule_node *before, schedule_node *after)
1090 add_dep(before, after, before->latency);
1102 * Sometimes we really want this node to execute after everything that
1168 /* read-after-write deps. */
1217 /* write-after-write deps. */
1297 /* write-after-read deps. */
1432 /* read-after-write deps. */
1470 /* write-after-write deps. */
1518 /* write-after-read deps. */
1786 * and may not return to dispatching our thread for a while even after
1792 /* Update the clock for how soon an instruction could start after the
1883 fprintf(stderr, "\nInstructions after scheduling (reg_alloc %d)\n",