Home | History | Annotate | Download | only in c6x

Lines Matching defs:reqs

3273 count_unit_reqs (unit_req_table reqs, rtx_insn *head, rtx_insn *tail)
3277 memset (reqs, 0, sizeof (unit_req_table));
3286 reqs[side2][req2]++;
3289 reqs[side1][req1]++;
3295 /* Update the table REQS by merging more specific unit reservations into
3299 merge_unit_reqs (unit_req_table reqs)
3304 int d = reqs[side][UNIT_REQ_D];
3305 int l = reqs[side][UNIT_REQ_L];
3306 int s = reqs[side][UNIT_REQ_S];
3307 int dl = reqs[side][UNIT_REQ_DL];
3308 int ls = reqs[side][UNIT_REQ_LS];
3309 int ds = reqs[side][UNIT_REQ_DS];
3311 reqs[side][UNIT_REQ_DL] += d;
3312 reqs[side][UNIT_REQ_DL] += l;
3313 reqs[side][UNIT_REQ_DS] += d;
3314 reqs[side][UNIT_REQ_DS] += s;
3315 reqs[side][UNIT_REQ_LS] += l;
3316 reqs[side][UNIT_REQ_LS] += s;
3317 reqs[side][UNIT_REQ_DLS] += ds + dl + ls + d + l + s;
3321 /* Examine the table REQS and return a measure of unit imbalance by comparing
3326 unit_req_imbalance (unit_req_table reqs)
3334 int diff = abs (reqs[0][i] - reqs[1][i]);
3341 data in the REQS table. This must have been processed with
3344 res_mii (unit_req_table reqs)
3352 worst = MAX ((reqs[side][UNIT_REQ_D] + factor - 1) / factor, worst);
3415 REQS is the table of unit reservations in the loop between HEAD and TAIL.
3419 try_rename_operands (rtx_insn *head, rtx_insn *tail, unit_req_table reqs,
3510 unit_req_imbalance (reqs), unit_req_imbalance (new_reqs));
3512 if (unit_req_imbalance (new_reqs) > unit_req_imbalance (reqs))
3518 memcpy (reqs, new_reqs, sizeof (unit_req_table));
3532 unit_req_table reqs;
3537 count_unit_reqs (reqs, head, PREV_INSN (tail));
3538 merge_unit_reqs (reqs);
3572 if (reqs[side1][req1] > 1
3573 && reqs[side1][req1] > 2 * reqs[side1 ^ 1][req1])
3575 try_rename_operands (head, tail, reqs, insn, info, mask1, side1);
3582 if (reqs[side2][req2] > 1
3583 && reqs[side2][req2] > 2 * reqs[side2 ^ 1][req2])
3585 try_rename_operands (head, tail, reqs, insn, info, mask2, side2);