Searched refs:INSN_LUID (Results 1 - 12 of 12) sorted by relevance

/haiku-buildtools/legacy/gcc/gcc/
H A Dloop.h26 #define INSN_LUID(INSN) \ macro
H A Dloop.c368 && INSN_LUID (INSN) >= INSN_LUID (START) \
369 && INSN_LUID (INSN) <= INSN_LUID (END))
978 m->global = (uid_luid[REGNO_LAST_UID (regno)] > INSN_LUID (end)
979 || uid_luid[REGNO_FIRST_UID (regno)] < INSN_LUID (loop_start));
1076 INSN_LUID and hence must make a conservative
1080 > INSN_LUID (end))
1082 < INSN_LUID (p))
2180 if (uid_luid[REGNO_FIRST_UID (regno)] > INSN_LUID (loop_star
[all...]
H A Dunroll.c787 int copy_start_luid = INSN_LUID (copy_start);
788 int copy_end_luid = INSN_LUID (copy_end);
1420 > INSN_LUID (loop_start))
2291 the target_insn. We can't use INSN_LUID comparisons here,
2566 && (uid_luid[REGNO_LAST_UID (bl->regno)] >= INSN_LUID (loop_end)
2570 < INSN_LUID (bl->init_insn))
2797 >= INSN_LUID (loop_end)))
H A Dhaifa-sched.c263 #define INSN_LUID(INSN) (insn_luid[INSN_UID (INSN)])
1419 (*num_insns) += (INSN_LUID (BLOCK_END (block)) -
1420 INSN_LUID (BLOCK_HEAD (block)));
1696 num_insns = (INSN_LUID (BLOCK_END (i))
1697 - INSN_LUID (BLOCK_HEAD (i)));
4228 /* If insns are equally good, sort by INSN_LUID (original insn order),
4231 return INSN_LUID (tmp) - INSN_LUID (tmp2);
8554 INSN_LUID (insn) = luid++;
262 #define INSN_LUID macro
H A Dsched.c165 #define INSN_LUID(INSN) (insn_luid[INSN_UID (INSN)])
1627 INSN_LUID (insn) = luid++;
1886 /* If insns are equally good, sort by INSN_LUID (original insn order),
1889 return INSN_LUID (tmp) - INSN_LUID (tmp2);
164 #define INSN_LUID macro
/haiku-buildtools/gcc/gcc/
H A Dsched-deps.c613 if (INSN_LUID (insn) == 0)
927 int elem_luid = INSN_LUID (pro);
928 int insn_luid = INSN_LUID (con);
981 int elem_luid = INSN_LUID (DEP_PRO (dep));
982 int insn_luid = INSN_LUID (DEP_CON (dep));
1055 int elem_luid = INSN_LUID (DEP_PRO (dep));
1056 int insn_luid = INSN_LUID (DEP_CON (dep));
1108 int elem_luid = INSN_LUID (DEP_PRO (dep));
1109 int insn_luid = INSN_LUID (DEP_CON (dep));
1153 bitmap_clear_bit (&spec_dependency_cache[INSN_LUID (ins
[all...]
H A Dsel-sched-dump.c587 if (s_i_d.exists () && INSN_LUID (insn) > 0)
694 if (sched_luids.exists () && INSN_LUID (insn) > 0)
H A Dhaifa-sched.c1947 /* Index I describes the instruction with INSN_LUID I. */
1981 (&model_insns[INSN_LUID (INSN)])
2636 return INSN_LUID (tmp) - INSN_LUID (tmp2);
2663 /* Sort by INSN_LUID (original insn order), so that we make the
2667 INSN_LUID (tmp) - INSN_LUID (tmp2), tmp, tmp2);
2684 by priority, and at last by INSN_LUID. */
2706 INSN_LUID (tmp) - INSN_LUID (tmp
[all...]
H A Dsched-int.h110 /* Mapping from INSN_UID to INSN_LUID. In the end all other per insn data
113 #define INSN_LUID(INSN) (sched_luids[INSN_UID (INSN)]) macro
119 /* The highest INSN_LUID. */
961 #define HDID(INSN) (&h_d_i_d[INSN_LUID (INSN)])
H A Dsched-rgn.c552 count = INSN_LUID (BB_END (bb)) - INSN_LUID (BB_HEAD (bb));
2507 bitmap_set_bit (insn_referenced, INSN_LUID (insn));
2531 if (bitmap_bit_p (insn_referenced, INSN_LUID (insn))
H A Dsel-sched-ir.h729 /* Indexed by INSN_LUID, the collection of all data associated with
798 #define SID(INSN) (&s_i_d[INSN_LUID (INSN)])
H A Dsel-sched-ir.c1437 if (INSN_LUID (insn) == 0)
3111 if (INSN_LUID (insn) > 0)
4306 gcc_assert (INSN_P (insn) && INSN_LUID (insn) > 0);

Completed in 306 milliseconds