HomeSort by: relevance | last modified time | path
    Searched defs:find_hard_regno_for (Results 1 - 2 of 2) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
lra-assigns.cc 33 find_hard_regno_for finds hard registers for allocation without
691 find_hard_regno_for (int regno, int *cost, int try_only_hard_regno, bool first_p) function
1020 && find_hard_regno_for (reload_regno, &cost, -1, first_p) < 0)
1029 hard_regno = find_hard_regno_for (regno, &cost, -1, first_p);
1040 = find_hard_regno_for (reload_regno,
1317 if (hard_regno == find_hard_regno_for (another_regno, &cost,
1427 hard_regno = find_hard_regno_for (regno, &cost, -1, iter == 1);
1558 hard_regno = find_hard_regno_for (regno, &cost, -1, false);
1582 hard_regno = find_hard_regno_for (regno, &cost, -1, false);
  /src/external/gpl3/gcc.old/dist/gcc/
lra-assigns.cc 33 find_hard_regno_for finds hard registers for allocation without
690 find_hard_regno_for (int regno, int *cost, int try_only_hard_regno, bool first_p) function
1019 && find_hard_regno_for (reload_regno, &cost, -1, first_p) < 0)
1028 hard_regno = find_hard_regno_for (regno, &cost, -1, first_p);
1039 = find_hard_regno_for (reload_regno,
1316 if (hard_regno == find_hard_regno_for (another_regno, &cost,
1426 hard_regno = find_hard_regno_for (regno, &cost, -1, iter == 1);
1550 hard_regno = find_hard_regno_for (regno, &cost, -1, false);
1574 hard_regno = find_hard_regno_for (regno, &cost, -1, false);

Completed in 17 milliseconds