Lines Matching refs:cur_cycle
65 int32_t cur_cycle = 0;
188 res_available[(int)perf.rsrc0] = cur_cycle + perf.cost0;
193 res_available[(int)perf.rsrc1] = cur_cycle + perf.cost1;
205 cost = MAX2(cost, res_available[(int)perf.rsrc0] - cur_cycle);
207 cost = MAX2(cost, res_available[(int)perf.rsrc1] - cur_cycle);
286 int deps_available = cur_cycle;
321 return deps_available - cur_cycle;
357 cur_cycle += get_dependency_cost(instr);
363 cur_cycle += cycles_until_res_available(instr);
365 start = cur_cycle;
369 cur_cycle += program->gfx_level >= GFX10 ? 1 : perf.latency;
384 exp.push_back(cur_cycle + wait_info.exp);
386 lgkm.push_back(cur_cycle + wait_info.lgkm);
388 vm.push_back(cur_cycle + wait_info.vm);
390 vs.push_back(cur_cycle + wait_info.vs);
417 assert(cur_cycle == 0);
421 res_available[i] = MAX2(res_available[i], pred.res_available[i] - pred.cur_cycle);
425 reg_available[i] = MAX2(reg_available[i], pred.reg_available[i] - pred.cur_cycle + cur_cycle);
427 join_queue(lgkm, pred.lgkm, -pred.cur_cycle);
428 join_queue(exp, pred.exp, -pred.cur_cycle);
429 join_queue(vm, pred.vm, -pred.cur_cycle);
430 join_queue(vs, pred.vs, -pred.cur_cycle);
492 unsigned before = block_est.cur_cycle;
494 instr->pass_flags = block_est.cur_cycle - before;
523 latency += block_est.cur_cycle * iter;