| /haiku-buildtools/gcc/gcc/ |
| H A D | lcm.c | 186 /* Compute the earliest vector for edge based lcm. */
191 sbitmap *earliest)
207 bitmap_copy (earliest[x], antin[succ->index]);
211 bitmap_clear (earliest[x]);
217 bitmap_and_or (earliest[x], difference,
257 compute_laterin (struct edge_list *edge_list, sbitmap *earliest,
295 bitmap_copy (later[(size_t) e->aux], earliest[(size_t) e->aux]);
337 earliest[(size_t) e->aux],
401 sbitmap *antin, *antout, *earliest;
445 earliest
188 compute_earliest(struct edge_list *edge_list, int n_exprs, sbitmap *antin, sbitmap *antout, sbitmap *avout, sbitmap *kill, sbitmap *earliest) argument
256 compute_laterin(struct edge_list *edge_list, sbitmap *earliest, sbitmap *antloc, sbitmap *later, sbitmap *laterin) argument
400 sbitmap *antin, *antout, *earliest; local
[all...] |
| H A D | ipa-split.c | 1055 /* Stack entry index of earliest BB reachable from current BB
1057 int earliest; member in struct:__anon175
1073 The articulation is discovered via DFS walk. We collect earliest
1102 first.earliest = INT_MAX;
1127 if (pos <= entry->earliest && !entry->can_split
1132 if (pos <= entry->earliest && entry->can_split)
1183 new_entry.earliest = INT_MAX;
1193 /* Back edge found, record the earliest point. */
1195 && (intptr_t)dest->aux < entry->earliest)
1196 entry->earliest
[all...] |
| H A D | ifcvt.c | 877 /* If earliest == jump, or when the condition is complex, try to
1473 /* If earliest == jump, try to build the cmove insn directly.
1830 rtx_insn **earliest)
1839 *earliest = if_info->cond_earliest;
1950 *earliest = if_info->cond_earliest;
1956 earliest, target, HAVE_cbranchcc4, true);
1964 for (insn = if_info->jump; insn != *earliest; insn = PREV_INSN (insn))
1969 for (insn = *earliest; insn != if_info->jump; insn = NEXT_INSN (insn))
1984 rtx_insn *earliest, *seq;
1995 cond = noce_get_alt_condition (if_info, if_info->a, &earliest);
1826 noce_get_alt_condition(struct noce_if_info *if_info, rtx target, rtx_insn **earliest) argument
1981 rtx_insn *earliest, *seq; local
2077 rtx_insn *earliest, *seq; local
2419 noce_get_condition(rtx_insn *jump, rtx_insn **earliest, bool then_else_reversed) argument
4240 rtx_insn *earliest = NULL; local
[all...] |
| H A D | modulo-sched.c | 216 /* The earliest absolute cycle of an insn in the partial schedule. */
1823 'ASAP(u)' the earliest time at which u could be scheduled as computed in
1954 int earliest = p_st + e->latency - (e->distance * ii);
1960 "", earliest, "", latest, p_st);
1965 early_start = MAX (early_start, earliest);
1982 int earliest = (e->data_type == MEM_DEP ? s_st - ii + 1 : INT_MIN);
1988 earliest, "", latest, "", s_st);
1993 start = MAX (start, earliest);
1951 int earliest = p_st + e->latency - (e->distance * ii); local
1979 int earliest = (e->data_type == MEM_DEP ? s_st - ii + 1 : INT_MIN); local
|
| H A D | rtlanal.c | 5015 If EARLIEST is nonzero, it is a pointer to a place where the earliest
5030 rtx_insn **earliest,
5052 if (earliest)
5053 *earliest = insn;
5081 if (earliest)
5082 *earliest = prev;
5215 if (earliest)
5216 *earliest = prev;
5287 If EARLIEST is nonzero, it is a pointer to a place where the earliest
5299 get_condition (rtx_insn *jump, rtx_insn **earliest, in
4999 canonicalize_condition(rtx_insn *insn, rtx cond, int reverse, rtx_insn **earliest, rtx want_reg, int allow_cc_mode, int valid_at_insn_p) argument
5269 get_condition(rtx_insn *jump, rtx_insn **earliest, int allow_cc_mode, int valid_at_insn_p) argument
[all...] |
| H A D | haifa-sched.c | 4856 int earliest = INSN_TICK (insn);
4880 if (earliest == INVALID_TICK || t > earliest)
4881 earliest = t;
4885 INSN_TICK_ESTIMATE (insn) = earliest;
6342 backtrack queue to find the earliest insn that caused this condition. */
4841 int earliest = INSN_TICK (insn); local
|
| /haiku-buildtools/legacy/gcc/gcc/ |
| H A D | loop.c | 8906 If EARLIEST is non-zero, it is a pointer to a place where the earliest
8921 get_condition (jump, earliest)
8923 rtx *earliest;
8944 if (earliest)
8945 *earliest = jump;
8976 if (earliest)
8977 *earliest = prev;
9088 if (earliest)
9089 *earliest = prev;
|
| /haiku-buildtools/gcc/gcc/config/c6x/ |
| H A D | c6x.c | 5494 int earliest = 0;
5510 if (earliest < this_clock + cycles)
5511 earliest = this_clock + cycles;
5513 return earliest;
5812 /* The earliest cycle in which we can emit the SPKERNEL instruction. */
5475 int earliest = 0; local
|
| /haiku-buildtools/legacy/binutils/gas/config/ |
| H A D | tc-xtensa.c | 582 xtensa_setup_hw_workarounds (int earliest, int latest)
584 if (earliest > latest)
588 if (earliest < 105000 || latest < 105000)
857 int earliest, latest = 0;
861 earliest = strtol (arg, &arg, 0);
864 latest = earliest;
874 xtensa_setup_hw_workarounds (earliest, latest);
581 xtensa_setup_hw_workarounds(int earliest, int latest) argument
856 int earliest, latest = 0; local
|
| /haiku-buildtools/binutils/gas/config/ |
| H A D | tc-xtensa.c | 641 xtensa_setup_hw_workarounds (int earliest, int latest)
643 if (earliest > latest)
647 if (earliest < 105000 || latest < 105000)
947 int earliest, latest = 0;
952 earliest = strtol (arg, &end, 0);
955 latest = earliest;
965 xtensa_setup_hw_workarounds (earliest, latest);
11152 /* Take earliest use of this literal to avoid
640 xtensa_setup_hw_workarounds(int earliest, int latest) argument
946 int earliest, latest = 0; local
|