1 /* Instruction scheduling pass. This file contains definitions used
2 internally in the scheduler.
3 Copyright (C) 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 2001, 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 #ifndef GCC_SCHED_INT_H
23 #define GCC_SCHED_INT_H
25 #ifdef INSN_SCHEDULING
28 #include "insn-attr.h"
30 #include "basic-block.h"
32 /* For VEC (int, heap). */
35 /* Identificator of a scheduler pass. */
36 enum sched_pass_id_t { SCHED_PASS_UNKNOWN, SCHED_RGN_PASS, SCHED_EBB_PASS,
37 SCHED_SMS_PASS, SCHED_SEL_PASS };
39 typedef VEC (basic_block, heap) *bb_vec_t;
40 typedef VEC (rtx, heap) *insn_vec_t;
41 typedef VEC(rtx, heap) *rtx_vec_t;
43 struct sched_scan_info_def
45 /* This hook notifies scheduler frontend to extend its internal per basic
46 block data structures. This hook should be called once before a series of
47 calls to bb_init (). */
48 void (*extend_bb) (void);
50 /* This hook makes scheduler frontend to initialize its internal data
51 structures for the passed basic block. */
52 void (*init_bb) (basic_block);
54 /* This hook notifies scheduler frontend to extend its internal per insn data
55 structures. This hook should be called once before a series of calls to
57 void (*extend_insn) (void);
59 /* This hook makes scheduler frontend to initialize its internal data
60 structures for the passed insn. */
61 void (*init_insn) (rtx);
64 extern const struct sched_scan_info_def *sched_scan_info;
66 extern void sched_scan (const struct sched_scan_info_def *,
67 bb_vec_t, basic_block, insn_vec_t, rtx);
69 extern void sched_init_bbs (void);
71 extern void sched_init_luids (bb_vec_t, basic_block, insn_vec_t, rtx);
72 extern void sched_finish_luids (void);
74 extern void sched_extend_target (void);
76 extern void haifa_init_h_i_d (bb_vec_t, basic_block, insn_vec_t, rtx);
77 extern void haifa_finish_h_i_d (void);
79 /* Hooks that are common to all the schedulers. */
80 struct common_sched_info_def
82 /* Called after blocks were rearranged due to movement of jump instruction.
83 The first parameter - index of basic block, in which jump currently is.
84 The second parameter - index of basic block, in which jump used
86 The third parameter - index of basic block, that follows the second
88 void (*fix_recovery_cfg) (int, int, int);
90 /* Called to notify frontend, that new basic block is being added.
91 The first parameter - new basic block.
92 The second parameter - block, after which new basic block is being added,
93 or EXIT_BLOCK_PTR, if recovery block is being added,
94 or NULL, if standalone block is being added. */
95 void (*add_block) (basic_block, basic_block);
97 /* Estimate number of insns in the basic block. */
98 int (*estimate_number_of_insns) (basic_block);
100 /* Given a non-insn (!INSN_P (x)) return
101 -1 - if this rtx don't need a luid.
102 0 - if it should have the same luid as the previous insn.
103 1 - if it needs a separate luid. */
104 int (*luid_for_non_insn) (rtx);
106 /* Scheduler pass identifier. It is preferably used in assertions. */
107 enum sched_pass_id_t sched_pass_id;
110 extern struct common_sched_info_def *common_sched_info;
112 extern const struct common_sched_info_def haifa_common_sched_info;
114 /* Return true if selective scheduling pass is working. */
118 return common_sched_info->sched_pass_id == SCHED_SEL_PASS;
121 /* Returns maximum priority that an insn was assigned to. */
122 extern int get_rgn_sched_max_insns_priority (void);
124 /* Increases effective priority for INSN by AMOUNT. */
125 extern void sel_add_to_insn_priority (rtx, int);
127 /* True if during selective scheduling we need to emulate some of haifa
128 scheduler behaviour. */
129 extern int sched_emulate_haifa_p;
131 /* Mapping from INSN_UID to INSN_LUID. In the end all other per insn data
132 structures should be indexed by luid. */
133 extern VEC (int, heap) *sched_luids;
134 #define INSN_LUID(INSN) (VEC_index (int, sched_luids, INSN_UID (INSN)))
135 #define LUID_BY_UID(UID) (VEC_index (int, sched_luids, UID))
137 #define SET_INSN_LUID(INSN, LUID) \
138 (VEC_replace (int, sched_luids, INSN_UID (INSN), (LUID)))
140 /* The highest INSN_LUID. */
141 extern int sched_max_luid;
143 extern int insn_luid (rtx);
145 /* This list holds ripped off notes from the current block. These notes will
146 be attached to the beginning of the block when its scheduling is
148 extern rtx note_list;
150 extern void remove_notes (rtx, rtx);
151 extern rtx restore_other_notes (rtx, basic_block);
152 extern void sched_insns_init (rtx);
153 extern void sched_insns_finish (void);
155 extern void *xrecalloc (void *, size_t, size_t, size_t);
156 extern rtx bb_note (basic_block);
158 extern void reemit_notes (rtx);
160 /* Functions in sched-vis.c. */
161 extern void print_insn (char *, const_rtx, int);
162 extern void print_pattern (char *, const_rtx, int);
163 extern void print_value (char *, const_rtx, int);
165 /* Functions in haifa-sched.c. */
166 extern int haifa_classify_insn (const_rtx);
168 /* Functions in sel-sched-ir.c. */
169 extern void sel_find_rgns (void);
170 extern void sel_mark_hard_insn (rtx);
172 extern size_t dfa_state_size;
174 extern void advance_state (state_t);
176 extern void setup_sched_dump (void);
177 extern void sched_init (void);
178 extern void sched_finish (void);
180 extern bool sel_insn_is_speculation_check (rtx);
182 /* Describe the ready list of the scheduler.
183 VEC holds space enough for all insns in the current region. VECLEN
184 says how many exactly.
185 FIRST is the index of the element with the highest priority; i.e. the
186 last one in the ready list, since elements are ordered by ascending
188 N_READY determines how many insns are on the ready list. */
197 extern char *ready_try;
198 extern struct ready_list ready;
200 extern int max_issue (struct ready_list *, int, state_t, int *);
202 extern void ebb_compute_jump_reg_dependencies (rtx, regset, regset, regset);
204 extern edge find_fallthru_edge (basic_block);
206 extern void (* sched_init_only_bb) (basic_block, basic_block);
207 extern basic_block (* sched_split_block) (basic_block, rtx);
208 extern basic_block sched_split_block_1 (basic_block, rtx);
209 extern basic_block (* sched_create_empty_bb) (basic_block);
210 extern basic_block sched_create_empty_bb_1 (basic_block);
212 extern basic_block sched_create_recovery_block (basic_block *);
213 extern void sched_create_recovery_edges (basic_block, basic_block,
216 /* Pointer to data describing the current DFA state. */
217 extern state_t curr_state;
219 /* Type to represent status of a dependence. */
222 /* Type to represent weakness of speculative dependence. */
225 extern enum reg_note ds_to_dk (ds_t);
226 extern ds_t dk_to_ds (enum reg_note);
228 /* Information about the dependency. */
237 /* Dependency major type. This field is superseded by STATUS below.
238 Though, it is still in place because some targets use it. */
241 /* Dependency status. This field holds all dependency types and additional
242 information for speculative dependencies. */
246 typedef struct _dep dep_def;
247 typedef dep_def *dep_t;
249 #define DEP_PRO(D) ((D)->pro)
250 #define DEP_CON(D) ((D)->con)
251 #define DEP_TYPE(D) ((D)->type)
252 #define DEP_STATUS(D) ((D)->status)
254 /* Functions to work with dep. */
256 extern void init_dep_1 (dep_t, rtx, rtx, enum reg_note, ds_t);
257 extern void init_dep (dep_t, rtx, rtx, enum reg_note);
259 extern void sd_debug_dep (dep_t);
261 /* Definition of this struct resides below. */
263 typedef struct _dep_node *dep_node_t;
265 /* A link in the dependency list. This is essentially an equivalent of a
266 single {INSN, DEPS}_LIST rtx. */
269 /* Dep node with all the data. */
272 /* Next link in the list. For the last one it is NULL. */
273 struct _dep_link *next;
275 /* Pointer to the next field of the previous link in the list.
276 For the first link this points to the deps_list->first.
278 With help of this field it is easy to remove and insert links to the
280 struct _dep_link **prev_nextp;
282 typedef struct _dep_link *dep_link_t;
284 #define DEP_LINK_NODE(N) ((N)->node)
285 #define DEP_LINK_NEXT(N) ((N)->next)
286 #define DEP_LINK_PREV_NEXTP(N) ((N)->prev_nextp)
288 /* Macros to work dep_link. For most usecases only part of the dependency
289 information is need. These macros conveniently provide that piece of
292 #define DEP_LINK_DEP(N) (DEP_NODE_DEP (DEP_LINK_NODE (N)))
293 #define DEP_LINK_PRO(N) (DEP_PRO (DEP_LINK_DEP (N)))
294 #define DEP_LINK_CON(N) (DEP_CON (DEP_LINK_DEP (N)))
295 #define DEP_LINK_TYPE(N) (DEP_TYPE (DEP_LINK_DEP (N)))
296 #define DEP_LINK_STATUS(N) (DEP_STATUS (DEP_LINK_DEP (N)))
298 /* A list of dep_links. */
304 /* Total number of elements in the list. */
307 typedef struct _deps_list *deps_list_t;
309 #define DEPS_LIST_FIRST(L) ((L)->first)
310 #define DEPS_LIST_N_LINKS(L) ((L)->n_links)
312 /* Suppose we have a dependence Y between insn pro1 and con1, where pro1 has
313 additional dependents con0 and con2, and con1 is dependent on additional
334 This is represented using a "dep_node" for each dependence arc, which are
335 connected as follows (diagram is centered around Y which is fully shown;
336 other dep_nodes shown partially):
338 . +------------+ +--------------+ +------------+
339 . : dep_node X : | dep_node Y | : dep_node Z :
342 . : forw : | forw | : forw :
343 . : +--------+ : | +--------+ | : +--------+ :
344 forw_deps : |dep_link| : | |dep_link| | : |dep_link| :
345 +-----+ : | +----+ | : | | +----+ | | : | +----+ | :
346 |first|----->| |next|-+------+->| |next|-+--+----->| |next|-+--->NULL
347 +-----+ : | +----+ | : | | +----+ | | : | +----+ | :
348 . ^ ^ : | ^ | : | | ^ | | : | | :
349 . | | : | | | : | | | | | : | | :
350 . | +--<----+--+ +--+---<--+--+--+ +--+--+--<---+--+ | :
351 . | : | | | : | | | | | : | | | :
352 . | : | +----+ | : | | +----+ | | : | +----+ | :
353 . | : | |prev| | : | | |prev| | | : | |prev| | :
354 . | : | |next| | : | | |next| | | : | |next| | :
355 . | : | +----+ | : | | +----+ | | : | +----+ | :
356 . | : | | :<-+ | | | |<-+ : | | :<-+
357 . | : | +----+ | : | | | +----+ | | | : | +----+ | : |
358 . | : | |node|-+----+ | | |node|-+--+--+ : | |node|-+----+
359 . | : | +----+ | : | | +----+ | | : | +----+ | :
360 . | : | | : | | | | : | | :
361 . | : +--------+ : | +--------+ | : +--------+ :
363 . | : SAME pro1 : | +--------+ | : SAME pro1 :
364 . | : DIFF con0 : | |dep | | : DIFF con2 :
367 .RTX<------------------------+--+-|pro1| | |
371 .RTX<------------------------+--+-|con1| | |
377 . | : : | | |stat| | | : :
378 . | : DIFF pro0 : | | +----+ | | : DIFF pro2 :
379 . | : SAME con1 : | | | | : SAME con1 :
380 . | : : | +--------+ | : :
382 . | : back : | back | : back :
383 . v : +--------+ : | +--------+ | : +--------+ :
384 back_deps : |dep_link| : | |dep_link| | : |dep_link| :
385 +-----+ : | +----+ | : | | +----+ | | : | +----+ | :
386 |first|----->| |next|-+------+->| |next|-+--+----->| |next|-+--->NULL
387 +-----+ : | +----+ | : | | +----+ | | : | +----+ | :
388 . ^ : | ^ | : | | ^ | | : | | :
389 . | : | | | : | | | | | : | | :
390 . +--<----+--+ +--+---<--+--+--+ +--+--+--<---+--+ | :
391 . : | | | : | | | | | : | | | :
392 . : | +----+ | : | | +----+ | | : | +----+ | :
393 . : | |prev| | : | | |prev| | | : | |prev| | :
394 . : | |next| | : | | |next| | | : | |next| | :
395 . : | +----+ | : | | +----+ | | : | +----+ | :
396 . : | | :<-+ | | | |<-+ : | | :<-+
397 . : | +----+ | : | | | +----+ | | | : | +----+ | : |
398 . : | |node|-+----+ | | |node|-+--+--+ : | |node|-+----+
399 . : | +----+ | : | | +----+ | | : | +----+ | :
400 . : | | : | | | | : | | :
401 . : +--------+ : | +--------+ | : +--------+ :
403 . : dep_node A : | dep_node Y | : dep_node B :
404 . +------------+ +--------------+ +------------+
410 struct _dep_link back;
416 struct _dep_link forw;
419 #define DEP_NODE_BACK(N) (&(N)->back)
420 #define DEP_NODE_DEP(N) (&(N)->dep)
421 #define DEP_NODE_FORW(N) (&(N)->forw)
423 /* The following enumeration values tell us what dependencies we
424 should use to implement the barrier. We use true-dependencies for
425 TRUE_BARRIER and anti-dependencies for MOVE_BARRIER. */
426 enum reg_pending_barrier_mode
433 /* Describe state of dependencies used during sched_analyze phase. */
436 /* The *_insns and *_mems are paired lists. Each pending memory operation
437 will have a pointer to the MEM rtx on one list and a pointer to the
438 containing insn on the other list in the same place in the list. */
440 /* We can't use add_dependence like the old code did, because a single insn
441 may have multiple memory accesses, and hence needs to be on the list
442 once for each memory access. Add_dependence won't let you add an insn
443 to a list more than once. */
445 /* An INSN_LIST containing all insns with pending read operations. */
446 rtx pending_read_insns;
448 /* An EXPR_LIST containing all MEM rtx's which are pending reads. */
449 rtx pending_read_mems;
451 /* An INSN_LIST containing all insns with pending write operations. */
452 rtx pending_write_insns;
454 /* An EXPR_LIST containing all MEM rtx's which are pending writes. */
455 rtx pending_write_mems;
457 /* We must prevent the above lists from ever growing too large since
458 the number of dependencies produced is at least O(N*N),
459 and execution time is at least O(4*N*N), as a function of the
460 length of these pending lists. */
462 /* Indicates the length of the pending_read list. */
463 int pending_read_list_length;
465 /* Indicates the length of the pending_write list. */
466 int pending_write_list_length;
468 /* Length of the pending memory flush list. Large functions with no
469 calls may build up extremely large lists. */
470 int pending_flush_length;
472 /* The last insn upon which all memory references must depend.
473 This is an insn which flushed the pending lists, creating a dependency
474 between it and all previously pending memory references. This creates
475 a barrier (or a checkpoint) which no memory reference is allowed to cross.
477 This includes all non constant CALL_INSNs. When we do interprocedural
478 alias analysis, this restriction can be relaxed.
479 This may also be an INSN that writes memory if the pending lists grow
481 rtx last_pending_memory_flush;
483 /* A list of the last function calls we have seen. We use a list to
484 represent last function calls from multiple predecessor blocks.
485 Used to prevent register lifetimes from expanding unnecessarily. */
486 rtx last_function_call;
488 /* A list of insns which use a pseudo register that does not already
489 cross a call. We create dependencies between each of those insn
490 and the next call insn, to ensure that they won't cross a call after
491 scheduling is done. */
492 rtx sched_before_next_call;
494 /* Used to keep post-call pseudo/hard reg movements together with
496 enum { not_post_call, post_call, post_call_initial } in_post_call_group_p;
498 /* The maximum register number for the following arrays. Before reload
499 this is max_reg_num; after reload it is FIRST_PSEUDO_REGISTER. */
502 /* Element N is the next insn that sets (hard or pseudo) register
503 N within the current basic block; or zero, if there is no
504 such insn. Needed for new registers which may be introduced
505 by splitting insns. */
515 /* Element N is set for each register that has any nonzero element
516 in reg_last[N].{uses,sets,clobbers}. */
517 regset_head reg_last_in_use;
519 /* Element N is set for each register that is conditionally set. */
520 regset_head reg_conditional_sets;
522 /* Shows the last value of reg_pending_barrier associated with the insn. */
523 enum reg_pending_barrier_mode last_reg_pending_barrier;
525 /* True when this context should be treated as a readonly by
527 BOOL_BITFIELD readonly : 1;
530 typedef struct deps *deps_t;
532 /* This structure holds some state of the current scheduling pass, and
533 contains some function pointers that abstract out some of the non-generic
534 functionality from functions such as schedule_block or schedule_insn.
535 There is one global variable, current_sched_info, which points to the
536 sched_info structure currently in use. */
537 struct haifa_sched_info
539 /* Add all insns that are initially ready to the ready list. Called once
540 before scheduling a set of insns. */
541 void (*init_ready_list) (void);
542 /* Called after taking an insn from the ready list. Returns nonzero if
543 this insn can be scheduled, nonzero if we should silently discard it. */
544 int (*can_schedule_ready_p) (rtx);
545 /* Return nonzero if there are more insns that should be scheduled. */
546 int (*schedule_more_p) (void);
547 /* Called after an insn has all its hard dependencies resolved.
548 Adjusts status of instruction (which is passed through second parameter)
549 to indicate if instruction should be moved to the ready list or the
550 queue, or if it should silently discard it (until next resolved
552 ds_t (*new_ready) (rtx, ds_t);
553 /* Compare priority of two insns. Return a positive number if the second
554 insn is to be preferred for scheduling, and a negative one if the first
555 is to be preferred. Zero if they are equally good. */
556 int (*rank) (rtx, rtx);
557 /* Return a string that contains the insn uid and optionally anything else
558 necessary to identify this insn in an output. It's valid to use a
559 static buffer for this. The ALIGNED parameter should cause the string
560 to be formatted so that multiple output lines will line up nicely. */
561 const char *(*print_insn) (const_rtx, int);
562 /* Return nonzero if an insn should be included in priority
564 int (*contributes_to_priority) (rtx, rtx);
566 /* The boundaries of the set of insns to be scheduled. */
567 rtx prev_head, next_tail;
569 /* Filled in after the schedule is finished; the first and last scheduled
573 /* If nonzero, enables an additional sanity check in schedule_block. */
574 unsigned int queue_must_finish_empty:1;
576 /* Maximum priority that has been assigned to an insn. */
577 int sched_max_insns_priority;
579 /* Hooks to support speculative scheduling. */
581 /* Called to notify frontend that instruction is being added (second
582 parameter == 0) or removed (second parameter == 1). */
583 void (*add_remove_insn) (rtx, int);
585 /* Called to notify frontend that instruction is being scheduled.
586 The first parameter - instruction to scheduled, the second parameter -
587 last scheduled instruction. */
588 void (*begin_schedule_ready) (rtx, rtx);
590 /* If the second parameter is not NULL, return nonnull value, if the
591 basic block should be advanced.
592 If the second parameter is NULL, return the next basic block in EBB.
593 The first parameter is the current basic block in EBB. */
594 basic_block (*advance_target_bb) (basic_block, rtx);
596 /* ??? FIXME: should use straight bitfields inside sched_info instead of
601 /* This structure holds description of the properties for speculative
605 /* Holds types of allowed speculations: BEGIN_{DATA|CONTROL},
606 BE_IN_{DATA_CONTROL}. */
609 /* A dump file for additional information on speculative scheduling. */
612 /* Minimal cumulative weakness of speculative instruction's
613 dependencies, so that insn will be scheduled. */
614 dw_t data_weakness_cutoff;
616 /* Minimal usefulness of speculative instruction to be considered for
618 int control_weakness_cutoff;
620 /* Flags from the enum SPEC_SCHED_FLAGS. */
623 typedef struct spec_info_def *spec_info_t;
625 extern spec_info_t spec_info;
627 extern struct haifa_sched_info *current_sched_info;
629 /* Indexed by INSN_UID, the collection of all data associated with
630 a single instruction. */
632 struct _haifa_deps_insn_data
634 /* The number of incoming edges in the forward dependency graph.
635 As scheduling proceeds, counts are decreased. An insn moves to
636 the ready queue when its counter reaches zero. */
639 /* Nonzero if instruction has internal dependence
640 (e.g. add_dependence was invoked with (insn == elem)). */
641 unsigned int has_internal_dep;
643 /* NB: We can't place 'struct _deps_list' here instead of deps_list_t into
644 h_i_d because when h_i_d extends, addresses of the deps_list->first
645 change without updating deps_list->first->next->prev_nextp. Thus
646 BACK_DEPS and RESOLVED_BACK_DEPS are allocated on the heap and FORW_DEPS
647 list is allocated on the obstack. */
649 /* A list of hard backward dependencies. The insn is a consumer of all the
650 deps mentioned here. */
651 deps_list_t hard_back_deps;
653 /* A list of speculative (weak) dependencies. The insn is a consumer of all
654 the deps mentioned here. */
655 deps_list_t spec_back_deps;
657 /* A list of insns which depend on the instruction. Unlike 'back_deps',
658 it represents forward dependencies. */
659 deps_list_t forw_deps;
661 /* A list of scheduled producers of the instruction. Links are being moved
662 from 'back_deps' to 'resolved_back_deps' while scheduling. */
663 deps_list_t resolved_back_deps;
665 /* A list of scheduled consumers of the instruction. Links are being moved
666 from 'forw_deps' to 'resolved_forw_deps' while scheduling to fasten the
667 search in 'forw_deps'. */
668 deps_list_t resolved_forw_deps;
670 /* Some insns (e.g. call) are not allowed to move across blocks. */
671 unsigned int cant_move : 1;
674 struct _haifa_insn_data
676 /* We can't place 'struct _deps_list' into h_i_d instead of deps_list_t
677 because when h_i_d extends, addresses of the deps_list->first
678 change without updating deps_list->first->next->prev_nextp. */
680 /* Logical uid gives the original ordering of the insns. */
683 /* A priority for each insn. */
686 /* Number of instructions referring to this insn. */
689 /* The minimum clock tick at which the insn becomes ready. This is
690 used to note timing constraints for the insns in the pending list. */
693 /* INTER_TICK is used to adjust INSN_TICKs of instructions from the
694 subsequent blocks in a region. */
697 /* See comment on QUEUE_INDEX macro in haifa-sched.c. */
702 /* This weight is an estimation of the insn's contribution to
703 register pressure. */
706 /* Set if there's DEF-USE dependence between some speculatively
707 moved load insn and this one. */
708 unsigned int fed_by_spec_load : 1;
709 unsigned int is_load_insn : 1;
711 /* '> 0' if priority is valid,
712 '== 0' if priority was not yet computed,
713 '< 0' if priority in invalid and should be recomputed. */
714 signed char priority_status;
716 /* What speculations are necessary to apply to schedule the instruction. */
719 /* What speculations were already applied. */
722 /* What speculations are checked by this instruction. */
725 /* Recovery block for speculation checks. */
726 basic_block recovery_block;
728 /* Original pattern of the instruction. */
732 typedef struct _haifa_insn_data haifa_insn_data_def;
733 typedef haifa_insn_data_def *haifa_insn_data_t;
735 DEF_VEC_O (haifa_insn_data_def);
736 DEF_VEC_ALLOC_O (haifa_insn_data_def, heap);
738 extern VEC(haifa_insn_data_def, heap) *h_i_d;
740 #define HID(INSN) (VEC_index (haifa_insn_data_def, h_i_d, INSN_UID (INSN)))
742 /* Accessor macros for h_i_d. There are more in haifa-sched.c and
744 #define INSN_PRIORITY(INSN) (HID (INSN)->priority)
745 #define INSN_REG_WEIGHT(INSN) (HID (INSN)->reg_weight)
746 #define INSN_PRIORITY_STATUS(INSN) (HID (INSN)->priority_status)
748 typedef struct _haifa_deps_insn_data haifa_deps_insn_data_def;
749 typedef haifa_deps_insn_data_def *haifa_deps_insn_data_t;
751 DEF_VEC_O (haifa_deps_insn_data_def);
752 DEF_VEC_ALLOC_O (haifa_deps_insn_data_def, heap);
754 extern VEC(haifa_deps_insn_data_def, heap) *h_d_i_d;
756 #define HDID(INSN) (VEC_index (haifa_deps_insn_data_def, h_d_i_d, \
758 #define INSN_DEP_COUNT(INSN) (HDID (INSN)->dep_count)
759 #define HAS_INTERNAL_DEP(INSN) (HDID (INSN)->has_internal_dep)
760 #define INSN_FORW_DEPS(INSN) (HDID (INSN)->forw_deps)
761 #define INSN_RESOLVED_BACK_DEPS(INSN) (HDID (INSN)->resolved_back_deps)
762 #define INSN_RESOLVED_FORW_DEPS(INSN) (HDID (INSN)->resolved_forw_deps)
763 #define INSN_HARD_BACK_DEPS(INSN) (HDID (INSN)->hard_back_deps)
764 #define INSN_SPEC_BACK_DEPS(INSN) (HDID (INSN)->spec_back_deps)
765 #define CANT_MOVE(INSN) (HDID (INSN)->cant_move)
766 #define CANT_MOVE_BY_LUID(LUID) (VEC_index (haifa_deps_insn_data_def, h_d_i_d, \
770 #define INSN_PRIORITY(INSN) (HID (INSN)->priority)
771 #define INSN_PRIORITY_STATUS(INSN) (HID (INSN)->priority_status)
772 #define INSN_PRIORITY_KNOWN(INSN) (INSN_PRIORITY_STATUS (INSN) > 0)
773 #define TODO_SPEC(INSN) (HID (INSN)->todo_spec)
774 #define DONE_SPEC(INSN) (HID (INSN)->done_spec)
775 #define CHECK_SPEC(INSN) (HID (INSN)->check_spec)
776 #define RECOVERY_BLOCK(INSN) (HID (INSN)->recovery_block)
777 #define ORIG_PAT(INSN) (HID (INSN)->orig_pat)
779 /* INSN is either a simple or a branchy speculation check. */
780 #define IS_SPECULATION_CHECK_P(INSN) \
781 (sel_sched_p () ? sel_insn_is_speculation_check (INSN) : RECOVERY_BLOCK (INSN) != NULL)
783 /* INSN is a speculation check that will simply reexecute the speculatively
784 scheduled instruction if the speculation fails. */
785 #define IS_SPECULATION_SIMPLE_CHECK_P(INSN) \
786 (RECOVERY_BLOCK (INSN) == EXIT_BLOCK_PTR)
788 /* INSN is a speculation check that will branch to RECOVERY_BLOCK if the
789 speculation fails. Insns in that block will reexecute the speculatively
790 scheduled code and then will return immediately after INSN thus preserving
791 semantics of the program. */
792 #define IS_SPECULATION_BRANCHY_CHECK_P(INSN) \
793 (RECOVERY_BLOCK (INSN) != NULL && RECOVERY_BLOCK (INSN) != EXIT_BLOCK_PTR)
795 /* Dep status (aka ds_t) of the link encapsulates information, that is needed
796 for speculative scheduling. Namely, it is 4 integers in the range
797 [0, MAX_DEP_WEAK] and 3 bits.
798 The integers correspond to the probability of the dependence to *not*
799 exist, it is the probability, that overcoming of this dependence will
800 not be followed by execution of the recovery code. Nevertheless,
801 whatever high the probability of success is, recovery code should still
802 be generated to preserve semantics of the program. To find a way to
803 get/set these integers, please refer to the {get, set}_dep_weak ()
804 functions in sched-deps.c .
805 The 3 bits in the DEP_STATUS correspond to 3 dependence types: true-,
806 output- and anti- dependence. It is not enough for speculative scheduling
807 to know just the major type of all the dependence between two instructions,
808 as only true dependence can be overcome.
809 There also is the 4-th bit in the DEP_STATUS (HARD_DEP), that is reserved
810 for using to describe instruction's status. It is set whenever instruction
811 has at least one dependence, that cannot be overcame.
812 See also: check_dep_status () in sched-deps.c . */
814 /* We exclude sign bit. */
815 #define BITS_PER_DEP_STATUS (HOST_BITS_PER_INT - 1)
817 /* First '4' stands for 3 dep type bits and HARD_DEP bit.
818 Second '4' stands for BEGIN_{DATA, CONTROL}, BE_IN_{DATA, CONTROL}
820 #define BITS_PER_DEP_WEAK ((BITS_PER_DEP_STATUS - 4) / 4)
822 /* Mask of speculative weakness in dep_status. */
823 #define DEP_WEAK_MASK ((1 << BITS_PER_DEP_WEAK) - 1)
825 /* This constant means that dependence is fake with 99.999...% probability.
826 This is the maximum value, that can appear in dep_status.
827 Note, that we don't want MAX_DEP_WEAK to be the same as DEP_WEAK_MASK for
828 debugging reasons. Though, it can be set to DEP_WEAK_MASK, and, when
829 done so, we'll get fast (mul for)/(div by) NO_DEP_WEAK. */
830 #define MAX_DEP_WEAK (DEP_WEAK_MASK - 1)
832 /* This constant means that dependence is 99.999...% real and it is a really
833 bad idea to overcome it (though this can be done, preserving program
835 #define MIN_DEP_WEAK 1
837 /* This constant represents 100% probability.
838 E.g. it is used to represent weakness of dependence, that doesn't exist. */
839 #define NO_DEP_WEAK (MAX_DEP_WEAK + MIN_DEP_WEAK)
841 /* Default weakness of speculative dependence. Used when we can't say
842 neither bad nor good about the dependence. */
843 #define UNCERTAIN_DEP_WEAK (MAX_DEP_WEAK - MAX_DEP_WEAK / 4)
845 /* Offset for speculative weaknesses in dep_status. */
846 enum SPEC_TYPES_OFFSETS {
847 BEGIN_DATA_BITS_OFFSET = 0,
848 BE_IN_DATA_BITS_OFFSET = BEGIN_DATA_BITS_OFFSET + BITS_PER_DEP_WEAK,
849 BEGIN_CONTROL_BITS_OFFSET = BE_IN_DATA_BITS_OFFSET + BITS_PER_DEP_WEAK,
850 BE_IN_CONTROL_BITS_OFFSET = BEGIN_CONTROL_BITS_OFFSET + BITS_PER_DEP_WEAK
853 /* The following defines provide numerous constants used to distinguish between
854 different types of speculative dependencies. */
856 /* Dependence can be overcome with generation of new data speculative
858 #define BEGIN_DATA (((ds_t) DEP_WEAK_MASK) << BEGIN_DATA_BITS_OFFSET)
860 /* This dependence is to the instruction in the recovery block, that was
861 formed to recover after data-speculation failure.
862 Thus, this dependence can overcome with generating of the copy of
863 this instruction in the recovery block. */
864 #define BE_IN_DATA (((ds_t) DEP_WEAK_MASK) << BE_IN_DATA_BITS_OFFSET)
866 /* Dependence can be overcome with generation of new control speculative
868 #define BEGIN_CONTROL (((ds_t) DEP_WEAK_MASK) << BEGIN_CONTROL_BITS_OFFSET)
870 /* This dependence is to the instruction in the recovery block, that was
871 formed to recover after control-speculation failure.
872 Thus, this dependence can be overcome with generating of the copy of
873 this instruction in the recovery block. */
874 #define BE_IN_CONTROL (((ds_t) DEP_WEAK_MASK) << BE_IN_CONTROL_BITS_OFFSET)
876 /* A few convenient combinations. */
877 #define BEGIN_SPEC (BEGIN_DATA | BEGIN_CONTROL)
878 #define DATA_SPEC (BEGIN_DATA | BE_IN_DATA)
879 #define CONTROL_SPEC (BEGIN_CONTROL | BE_IN_CONTROL)
880 #define SPECULATIVE (DATA_SPEC | CONTROL_SPEC)
881 #define BE_IN_SPEC (BE_IN_DATA | BE_IN_CONTROL)
883 /* Constants, that are helpful in iterating through dep_status. */
884 #define FIRST_SPEC_TYPE BEGIN_DATA
885 #define LAST_SPEC_TYPE BE_IN_CONTROL
886 #define SPEC_TYPE_SHIFT BITS_PER_DEP_WEAK
888 /* Dependence on instruction can be of multiple types
889 (e.g. true and output). This fields enhance REG_NOTE_KIND information
890 of the dependence. */
891 #define DEP_TRUE (((ds_t) 1) << (BE_IN_CONTROL_BITS_OFFSET + BITS_PER_DEP_WEAK))
892 #define DEP_OUTPUT (DEP_TRUE << 1)
893 #define DEP_ANTI (DEP_OUTPUT << 1)
895 #define DEP_TYPES (DEP_TRUE | DEP_OUTPUT | DEP_ANTI)
897 /* Instruction has non-speculative dependence. This bit represents the
898 property of an instruction - not the one of a dependence.
899 Therefore, it can appear only in TODO_SPEC field of an instruction. */
900 #define HARD_DEP (DEP_ANTI << 1)
902 /* This represents the results of calling sched-deps.c functions,
903 which modify dependencies. */
904 enum DEPS_ADJUST_RESULT {
905 /* No dependence needed (e.g. producer == consumer). */
907 /* Dependence is already present and wasn't modified. */
909 /* Existing dependence was modified to include additional information. */
911 /* New dependence has been created. */
915 /* Represents the bits that can be set in the flags field of the
916 sched_info structure. */
918 /* If set, generate links between instruction as DEPS_LIST.
919 Otherwise, generate usual INSN_LIST links. */
921 /* Perform data or control (or both) speculation.
922 Results in generation of data and control speculative dependencies.
923 Requires USE_DEPS_LIST set. */
924 DO_SPECULATION = USE_DEPS_LIST << 1,
925 SCHED_RGN = DO_SPECULATION << 1,
926 SCHED_EBB = SCHED_RGN << 1,
927 /* Scheduler can possibly create new basic blocks. Used for assertions. */
928 NEW_BBS = SCHED_EBB << 1,
929 SEL_SCHED = NEW_BBS << 1
932 enum SPEC_SCHED_FLAGS {
933 COUNT_SPEC_IN_CRITICAL_PATH = 1,
934 PREFER_NON_DATA_SPEC = COUNT_SPEC_IN_CRITICAL_PATH << 1,
935 PREFER_NON_CONTROL_SPEC = PREFER_NON_DATA_SPEC << 1,
936 SEL_SCHED_SPEC_DONT_CHECK_CONTROL = PREFER_NON_CONTROL_SPEC << 1
939 #define NOTE_NOT_BB_P(NOTE) (NOTE_P (NOTE) && (NOTE_KIND (NOTE) \
940 != NOTE_INSN_BASIC_BLOCK))
942 extern FILE *sched_dump;
943 extern int sched_verbose;
945 extern spec_info_t spec_info;
946 extern bool haifa_recovery_bb_ever_added_p;
948 /* Exception Free Loads:
950 We define five classes of speculative loads: IFREE, IRISKY,
951 PFREE, PRISKY, and MFREE.
953 IFREE loads are loads that are proved to be exception-free, just
954 by examining the load insn. Examples for such loads are loads
955 from TOC and loads of global data.
957 IRISKY loads are loads that are proved to be exception-risky,
958 just by examining the load insn. Examples for such loads are
959 volatile loads and loads from shared memory.
961 PFREE loads are loads for which we can prove, by examining other
962 insns, that they are exception-free. Currently, this class consists
963 of loads for which we are able to find a "similar load", either in
964 the target block, or, if only one split-block exists, in that split
965 block. Load2 is similar to load1 if both have same single base
966 register. We identify only part of the similar loads, by finding
967 an insn upon which both load1 and load2 have a DEF-USE dependence.
969 PRISKY loads are loads for which we can prove, by examining other
970 insns, that they are exception-risky. Currently we have two proofs for
971 such loads. The first proof detects loads that are probably guarded by a
972 test on the memory address. This proof is based on the
973 backward and forward data dependence information for the region.
974 Let load-insn be the examined load.
975 Load-insn is PRISKY iff ALL the following hold:
977 - insn1 is not in the same block as load-insn
978 - there is a DEF-USE dependence chain (insn1, ..., load-insn)
979 - test-insn is either a compare or a branch, not in the same block
981 - load-insn is reachable from test-insn
982 - there is a DEF-USE dependence chain (insn1, ..., test-insn)
984 This proof might fail when the compare and the load are fed
985 by an insn not in the region. To solve this, we will add to this
986 group all loads that have no input DEF-USE dependence.
988 The second proof detects loads that are directly or indirectly
989 fed by a speculative load. This proof is affected by the
990 scheduling process. We will use the flag fed_by_spec_load.
991 Initially, all insns have this flag reset. After a speculative
992 motion of an insn, if insn is either a load, or marked as
993 fed_by_spec_load, we will also mark as fed_by_spec_load every
994 insn1 for which a DEF-USE dependence (insn, insn1) exists. A
995 load which is fed_by_spec_load is also PRISKY.
997 MFREE (maybe-free) loads are all the remaining loads. They may be
998 exception-free, but we cannot prove it.
1000 Now, all loads in IFREE and PFREE classes are considered
1001 exception-free, while all loads in IRISKY and PRISKY classes are
1002 considered exception-risky. As for loads in the MFREE class,
1003 these are considered either exception-free or exception-risky,
1004 depending on whether we are pessimistic or optimistic. We have
1005 to take the pessimistic approach to assure the safety of
1006 speculative scheduling, but we can take the optimistic approach
1007 by invoking the -fsched_spec_load_dangerous option. */
1009 enum INSN_TRAP_CLASS
1011 TRAP_FREE = 0, IFREE = 1, PFREE_CANDIDATE = 2,
1012 PRISKY_CANDIDATE = 3, IRISKY = 4, TRAP_RISKY = 5
1015 #define WORST_CLASS(class1, class2) \
1016 ((class1 > class2) ? class1 : class2)
1022 #ifndef HAIFA_INLINE
1023 #define HAIFA_INLINE __inline
1026 struct sched_deps_info_def
1028 /* Called when computing dependencies for a JUMP_INSN. This function
1029 should store the set of registers that must be considered as set by
1030 the jump in the regset. */
1031 void (*compute_jump_reg_dependencies) (rtx, regset, regset, regset);
1033 /* Start analyzing insn. */
1034 void (*start_insn) (rtx);
1036 /* Finish analyzing insn. */
1037 void (*finish_insn) (void);
1039 /* Start analyzing insn LHS (Left Hand Side). */
1040 void (*start_lhs) (rtx);
1042 /* Finish analyzing insn LHS. */
1043 void (*finish_lhs) (void);
1045 /* Start analyzing insn RHS (Right Hand Side). */
1046 void (*start_rhs) (rtx);
1048 /* Finish analyzing insn RHS. */
1049 void (*finish_rhs) (void);
1051 /* Note set of the register. */
1052 void (*note_reg_set) (int);
1054 /* Note clobber of the register. */
1055 void (*note_reg_clobber) (int);
1057 /* Note use of the register. */
1058 void (*note_reg_use) (int);
1060 /* Note memory dependence of type DS between MEM1 and MEM2 (which is
1062 void (*note_mem_dep) (rtx mem1, rtx mem2, rtx insn2, ds_t ds);
1064 /* Note a dependence of type DS from the INSN. */
1065 void (*note_dep) (rtx insn, ds_t ds);
1067 /* Nonzero if we should use cselib for better alias analysis. This
1068 must be 0 if the dependency information is used after sched_analyze
1069 has completed, e.g. if we're using it to initialize state for successor
1070 blocks in region scheduling. */
1071 unsigned int use_cselib : 1;
1073 /* If set, generate links between instruction as DEPS_LIST.
1074 Otherwise, generate usual INSN_LIST links. */
1075 unsigned int use_deps_list : 1;
1077 /* Generate data and control speculative dependencies.
1078 Requires USE_DEPS_LIST set. */
1079 unsigned int generate_spec_deps : 1;
1082 extern struct sched_deps_info_def *sched_deps_info;
1085 /* Functions in sched-deps.c. */
1086 extern bool sched_insns_conditions_mutex_p (const_rtx, const_rtx);
1087 extern bool sched_insn_is_legitimate_for_speculation_p (const_rtx, ds_t);
1088 extern void add_dependence (rtx, rtx, enum reg_note);
1089 extern void sched_analyze (struct deps *, rtx, rtx);
1090 extern void init_deps (struct deps *);
1091 extern void free_deps (struct deps *);
1092 extern void init_deps_global (void);
1093 extern void finish_deps_global (void);
1094 extern void deps_analyze_insn (struct deps *, rtx);
1095 extern void remove_from_deps (struct deps *, rtx);
1097 extern dw_t get_dep_weak_1 (ds_t, ds_t);
1098 extern dw_t get_dep_weak (ds_t, ds_t);
1099 extern ds_t set_dep_weak (ds_t, ds_t, dw_t);
1100 extern dw_t estimate_dep_weak (rtx, rtx);
1101 extern ds_t ds_merge (ds_t, ds_t);
1102 extern ds_t ds_full_merge (ds_t, ds_t, rtx, rtx);
1103 extern ds_t ds_max_merge (ds_t, ds_t);
1104 extern dw_t ds_weak (ds_t);
1105 extern ds_t ds_get_speculation_types (ds_t);
1106 extern ds_t ds_get_max_dep_weak (ds_t);
1108 extern void sched_deps_init (bool);
1109 extern void sched_deps_finish (void);
1111 extern void haifa_note_reg_set (int);
1112 extern void haifa_note_reg_clobber (int);
1113 extern void haifa_note_reg_use (int);
1115 extern void maybe_extend_reg_info_p (void);
1117 extern void deps_start_bb (struct deps *, rtx);
1118 extern enum reg_note ds_to_dt (ds_t);
1120 extern bool deps_pools_are_empty_p (void);
1121 extern void sched_free_deps (rtx, rtx, bool);
1122 extern void extend_dependency_caches (int, bool);
1124 extern void debug_ds (ds_t);
1126 /* Functions in haifa-sched.c. */
1127 extern int haifa_classify_insn (const_rtx);
1128 extern void get_ebb_head_tail (basic_block, basic_block, rtx *, rtx *);
1129 extern int no_real_insns_p (const_rtx, const_rtx);
1131 extern int insn_cost (rtx);
1132 extern int dep_cost_1 (dep_t, dw_t);
1133 extern int dep_cost (dep_t);
1134 extern int set_priorities (rtx, rtx);
1136 extern void schedule_block (basic_block *);
1138 extern int cycle_issued_insns;
1139 extern int issue_rate;
1140 extern int dfa_lookahead;
1142 extern void ready_sort (struct ready_list *);
1143 extern rtx ready_element (struct ready_list *, int);
1144 extern rtx *ready_lastpos (struct ready_list *);
1146 extern int try_ready (rtx);
1147 extern void sched_extend_ready_list (int);
1148 extern void sched_finish_ready_list (void);
1149 extern void sched_change_pattern (rtx, rtx);
1150 extern int sched_speculate_insn (rtx, ds_t, rtx *);
1151 extern void unlink_bb_notes (basic_block, basic_block);
1152 extern void add_block (basic_block, basic_block);
1153 extern rtx bb_note (basic_block);
1154 extern void concat_note_lists (rtx, rtx *);
1157 /* Types and functions in sched-rgn.c. */
1159 /* A region is the main entity for interblock scheduling: insns
1160 are allowed to move between blocks in the same region, along
1161 control flow graph edges, in the 'up' direction. */
1164 /* Number of extended basic blocks in region. */
1166 /* cblocks in the region (actually index in rgn_bb_table). */
1168 /* Dependencies for this region are already computed. Basically, indicates,
1169 that this is a recovery block. */
1170 unsigned int dont_calc_deps : 1;
1171 /* This region has at least one non-trivial ebb. */
1172 unsigned int has_real_ebb : 1;
1176 extern int nr_regions;
1177 extern region *rgn_table;
1178 extern int *rgn_bb_table;
1179 extern int *block_to_bb;
1180 extern int *containing_rgn;
1182 #define RGN_NR_BLOCKS(rgn) (rgn_table[rgn].rgn_nr_blocks)
1183 #define RGN_BLOCKS(rgn) (rgn_table[rgn].rgn_blocks)
1184 #define RGN_DONT_CALC_DEPS(rgn) (rgn_table[rgn].dont_calc_deps)
1185 #define RGN_HAS_REAL_EBB(rgn) (rgn_table[rgn].has_real_ebb)
1186 #define BLOCK_TO_BB(block) (block_to_bb[block])
1187 #define CONTAINING_RGN(block) (containing_rgn[block])
1189 /* The mapping from ebb to block. */
1190 extern int *ebb_head;
1191 #define BB_TO_BLOCK(ebb) (rgn_bb_table[ebb_head[ebb]])
1192 #define EBB_FIRST_BB(ebb) BASIC_BLOCK (BB_TO_BLOCK (ebb))
1193 #define EBB_LAST_BB(ebb) BASIC_BLOCK (rgn_bb_table[ebb_head[ebb + 1] - 1])
1194 #define INSN_BB(INSN) (BLOCK_TO_BB (BLOCK_NUM (INSN)))
1196 extern int current_nr_blocks;
1197 extern int current_blocks;
1198 extern int target_bb;
1200 extern bool sched_is_disabled_for_current_region_p (void);
1201 extern void sched_rgn_init (bool);
1202 extern void sched_rgn_finish (void);
1203 extern void rgn_setup_region (int);
1204 extern void sched_rgn_compute_dependencies (int);
1205 extern void sched_rgn_local_init (int);
1206 extern void sched_rgn_local_finish (void);
1207 extern void sched_rgn_local_free (void);
1208 extern void extend_regions (void);
1209 extern void rgn_make_new_region_out_of_new_block (basic_block);
1211 extern void compute_priorities (void);
1212 extern void increase_insn_priority (rtx, int);
1213 extern void debug_rgn_dependencies (int);
1214 extern void debug_dependencies (rtx, rtx);
1215 extern void free_rgn_deps (void);
1216 extern int contributes_to_priority (rtx, rtx);
1217 extern void extend_rgns (int *, int *, sbitmap, int *);
1218 extern void deps_join (struct deps *, struct deps *);
1220 extern void rgn_setup_common_sched_info (void);
1221 extern void rgn_setup_sched_infos (void);
1223 extern void debug_regions (void);
1224 extern void debug_region (int);
1225 extern void dump_region_dot (FILE *, int);
1226 extern void dump_region_dot_file (const char *, int);
1228 extern void haifa_sched_init (void);
1229 extern void haifa_sched_finish (void);
1231 /* sched-deps.c interface to walk, add, search, update, resolve, delete
1232 and debug instruction dependencies. */
1234 /* Constants defining dependences lists. */
1237 #define SD_LIST_NONE (0)
1239 /* hard_back_deps. */
1240 #define SD_LIST_HARD_BACK (1)
1242 /* spec_back_deps. */
1243 #define SD_LIST_SPEC_BACK (2)
1246 #define SD_LIST_FORW (4)
1248 /* resolved_back_deps. */
1249 #define SD_LIST_RES_BACK (8)
1251 /* resolved_forw_deps. */
1252 #define SD_LIST_RES_FORW (16)
1254 #define SD_LIST_BACK (SD_LIST_HARD_BACK | SD_LIST_SPEC_BACK)
1256 /* A type to hold above flags. */
1257 typedef int sd_list_types_def;
1259 extern void sd_next_list (const_rtx, sd_list_types_def *, deps_list_t *, bool *);
1261 /* Iterator to walk through, resolve and delete dependencies. */
1264 /* What lists to walk. Can be any combination of SD_LIST_* flags. */
1265 sd_list_types_def types;
1267 /* Instruction dependencies lists of which will be walked. */
1270 /* Pointer to the next field of the previous element. This is not
1271 simply a pointer to the next element to allow easy deletion from the
1272 list. When a dep is being removed from the list the iterator
1273 will automatically advance because the value in *linkp will start
1274 referring to the next element. */
1277 /* True if the current list is a resolved one. */
1281 typedef struct _sd_iterator sd_iterator_def;
1283 /* ??? We can move some definitions that are used in below inline functions
1284 out of sched-int.h to sched-deps.c provided that the below functions will
1285 become global externals.
1286 These definitions include:
1287 * struct _deps_list: opaque pointer is needed at global scope.
1288 * struct _dep_link: opaque pointer is needed at scope of sd_iterator_def.
1289 * struct _dep_node: opaque pointer is needed at scope of
1290 struct _deps_link. */
1292 /* Return initialized iterator. */
1293 static inline sd_iterator_def
1294 sd_iterator_start (rtx insn, sd_list_types_def types)
1296 /* Some dep_link a pointer to which will return NULL. */
1297 static dep_link_t null_link = NULL;
1303 i.linkp = &null_link;
1305 /* Avoid 'uninitialized warning'. */
1306 i.resolved_p = false;
1311 /* Return the current element. */
1313 sd_iterator_cond (sd_iterator_def *it_ptr, dep_t *dep_ptr)
1315 dep_link_t link = *it_ptr->linkp;
1319 *dep_ptr = DEP_LINK_DEP (link);
1324 sd_list_types_def types = it_ptr->types;
1326 if (types != SD_LIST_NONE)
1327 /* Switch to next list. */
1331 sd_next_list (it_ptr->insn,
1332 &it_ptr->types, &list, &it_ptr->resolved_p);
1334 it_ptr->linkp = &DEPS_LIST_FIRST (list);
1336 return sd_iterator_cond (it_ptr, dep_ptr);
1344 /* Advance iterator. */
1346 sd_iterator_next (sd_iterator_def *it_ptr)
1348 it_ptr->linkp = &DEP_LINK_NEXT (*it_ptr->linkp);
1351 /* A cycle wrapper. */
1352 #define FOR_EACH_DEP(INSN, LIST_TYPES, ITER, DEP) \
1353 for ((ITER) = sd_iterator_start ((INSN), (LIST_TYPES)); \
1354 sd_iterator_cond (&(ITER), &(DEP)); \
1355 sd_iterator_next (&(ITER)))
1357 extern int sd_lists_size (const_rtx, sd_list_types_def);
1358 extern bool sd_lists_empty_p (const_rtx, sd_list_types_def);
1359 extern void sd_init_insn (rtx);
1360 extern void sd_finish_insn (rtx);
1361 extern dep_t sd_find_dep_between (rtx, rtx, bool);
1362 extern void sd_add_dep (dep_t, bool);
1363 extern enum DEPS_ADJUST_RESULT sd_add_or_update_dep (dep_t, bool);
1364 extern void sd_resolve_dep (sd_iterator_def);
1365 extern void sd_copy_back_deps (rtx, rtx, bool);
1366 extern void sd_delete_dep (sd_iterator_def);
1367 extern void sd_debug_lists (rtx, sd_list_types_def);
1369 #endif /* INSN_SCHEDULING */
1371 #endif /* GCC_SCHED_INT_H */