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 haifa-sched.c. */
161 extern int haifa_classify_insn (const_rtx);
163 /* Functions in sel-sched-ir.c. */
164 extern void sel_find_rgns (void);
165 extern void sel_mark_hard_insn (rtx);
167 extern size_t dfa_state_size;
169 extern void advance_state (state_t);
171 extern void setup_sched_dump (void);
172 extern void sched_init (void);
173 extern void sched_finish (void);
175 extern bool sel_insn_is_speculation_check (rtx);
177 /* Describe the ready list of the scheduler.
178 VEC holds space enough for all insns in the current region. VECLEN
179 says how many exactly.
180 FIRST is the index of the element with the highest priority; i.e. the
181 last one in the ready list, since elements are ordered by ascending
183 N_READY determines how many insns are on the ready list. */
192 extern char *ready_try;
193 extern struct ready_list ready;
195 extern int max_issue (struct ready_list *, int, state_t, int *);
197 extern void ebb_compute_jump_reg_dependencies (rtx, regset, regset, regset);
199 extern edge find_fallthru_edge (basic_block);
201 extern void (* sched_init_only_bb) (basic_block, basic_block);
202 extern basic_block (* sched_split_block) (basic_block, rtx);
203 extern basic_block sched_split_block_1 (basic_block, rtx);
204 extern basic_block (* sched_create_empty_bb) (basic_block);
205 extern basic_block sched_create_empty_bb_1 (basic_block);
207 extern basic_block sched_create_recovery_block (basic_block *);
208 extern void sched_create_recovery_edges (basic_block, basic_block,
211 /* Pointer to data describing the current DFA state. */
212 extern state_t curr_state;
214 /* Type to represent status of a dependence. */
217 /* Type to represent weakness of speculative dependence. */
220 extern enum reg_note ds_to_dk (ds_t);
221 extern ds_t dk_to_ds (enum reg_note);
223 /* Information about the dependency. */
232 /* Dependency major type. This field is superseded by STATUS below.
233 Though, it is still in place because some targets use it. */
236 /* Dependency status. This field holds all dependency types and additional
237 information for speculative dependencies. */
241 typedef struct _dep dep_def;
242 typedef dep_def *dep_t;
244 #define DEP_PRO(D) ((D)->pro)
245 #define DEP_CON(D) ((D)->con)
246 #define DEP_TYPE(D) ((D)->type)
247 #define DEP_STATUS(D) ((D)->status)
249 /* Functions to work with dep. */
251 extern void init_dep_1 (dep_t, rtx, rtx, enum reg_note, ds_t);
252 extern void init_dep (dep_t, rtx, rtx, enum reg_note);
254 extern void sd_debug_dep (dep_t);
256 /* Definition of this struct resides below. */
258 typedef struct _dep_node *dep_node_t;
260 /* A link in the dependency list. This is essentially an equivalent of a
261 single {INSN, DEPS}_LIST rtx. */
264 /* Dep node with all the data. */
267 /* Next link in the list. For the last one it is NULL. */
268 struct _dep_link *next;
270 /* Pointer to the next field of the previous link in the list.
271 For the first link this points to the deps_list->first.
273 With help of this field it is easy to remove and insert links to the
275 struct _dep_link **prev_nextp;
277 typedef struct _dep_link *dep_link_t;
279 #define DEP_LINK_NODE(N) ((N)->node)
280 #define DEP_LINK_NEXT(N) ((N)->next)
281 #define DEP_LINK_PREV_NEXTP(N) ((N)->prev_nextp)
283 /* Macros to work dep_link. For most usecases only part of the dependency
284 information is need. These macros conveniently provide that piece of
287 #define DEP_LINK_DEP(N) (DEP_NODE_DEP (DEP_LINK_NODE (N)))
288 #define DEP_LINK_PRO(N) (DEP_PRO (DEP_LINK_DEP (N)))
289 #define DEP_LINK_CON(N) (DEP_CON (DEP_LINK_DEP (N)))
290 #define DEP_LINK_TYPE(N) (DEP_TYPE (DEP_LINK_DEP (N)))
291 #define DEP_LINK_STATUS(N) (DEP_STATUS (DEP_LINK_DEP (N)))
293 /* A list of dep_links. */
299 /* Total number of elements in the list. */
302 typedef struct _deps_list *deps_list_t;
304 #define DEPS_LIST_FIRST(L) ((L)->first)
305 #define DEPS_LIST_N_LINKS(L) ((L)->n_links)
307 /* Suppose we have a dependence Y between insn pro1 and con1, where pro1 has
308 additional dependents con0 and con2, and con1 is dependent on additional
329 This is represented using a "dep_node" for each dependence arc, which are
330 connected as follows (diagram is centered around Y which is fully shown;
331 other dep_nodes shown partially):
333 . +------------+ +--------------+ +------------+
334 . : dep_node X : | dep_node Y | : dep_node Z :
337 . : forw : | forw | : forw :
338 . : +--------+ : | +--------+ | : +--------+ :
339 forw_deps : |dep_link| : | |dep_link| | : |dep_link| :
340 +-----+ : | +----+ | : | | +----+ | | : | +----+ | :
341 |first|----->| |next|-+------+->| |next|-+--+----->| |next|-+--->NULL
342 +-----+ : | +----+ | : | | +----+ | | : | +----+ | :
343 . ^ ^ : | ^ | : | | ^ | | : | | :
344 . | | : | | | : | | | | | : | | :
345 . | +--<----+--+ +--+---<--+--+--+ +--+--+--<---+--+ | :
346 . | : | | | : | | | | | : | | | :
347 . | : | +----+ | : | | +----+ | | : | +----+ | :
348 . | : | |prev| | : | | |prev| | | : | |prev| | :
349 . | : | |next| | : | | |next| | | : | |next| | :
350 . | : | +----+ | : | | +----+ | | : | +----+ | :
351 . | : | | :<-+ | | | |<-+ : | | :<-+
352 . | : | +----+ | : | | | +----+ | | | : | +----+ | : |
353 . | : | |node|-+----+ | | |node|-+--+--+ : | |node|-+----+
354 . | : | +----+ | : | | +----+ | | : | +----+ | :
355 . | : | | : | | | | : | | :
356 . | : +--------+ : | +--------+ | : +--------+ :
358 . | : SAME pro1 : | +--------+ | : SAME pro1 :
359 . | : DIFF con0 : | |dep | | : DIFF con2 :
362 .RTX<------------------------+--+-|pro1| | |
366 .RTX<------------------------+--+-|con1| | |
372 . | : : | | |stat| | | : :
373 . | : DIFF pro0 : | | +----+ | | : DIFF pro2 :
374 . | : SAME con1 : | | | | : SAME con1 :
375 . | : : | +--------+ | : :
377 . | : back : | back | : back :
378 . v : +--------+ : | +--------+ | : +--------+ :
379 back_deps : |dep_link| : | |dep_link| | : |dep_link| :
380 +-----+ : | +----+ | : | | +----+ | | : | +----+ | :
381 |first|----->| |next|-+------+->| |next|-+--+----->| |next|-+--->NULL
382 +-----+ : | +----+ | : | | +----+ | | : | +----+ | :
383 . ^ : | ^ | : | | ^ | | : | | :
384 . | : | | | : | | | | | : | | :
385 . +--<----+--+ +--+---<--+--+--+ +--+--+--<---+--+ | :
386 . : | | | : | | | | | : | | | :
387 . : | +----+ | : | | +----+ | | : | +----+ | :
388 . : | |prev| | : | | |prev| | | : | |prev| | :
389 . : | |next| | : | | |next| | | : | |next| | :
390 . : | +----+ | : | | +----+ | | : | +----+ | :
391 . : | | :<-+ | | | |<-+ : | | :<-+
392 . : | +----+ | : | | | +----+ | | | : | +----+ | : |
393 . : | |node|-+----+ | | |node|-+--+--+ : | |node|-+----+
394 . : | +----+ | : | | +----+ | | : | +----+ | :
395 . : | | : | | | | : | | :
396 . : +--------+ : | +--------+ | : +--------+ :
398 . : dep_node A : | dep_node Y | : dep_node B :
399 . +------------+ +--------------+ +------------+
405 struct _dep_link back;
411 struct _dep_link forw;
414 #define DEP_NODE_BACK(N) (&(N)->back)
415 #define DEP_NODE_DEP(N) (&(N)->dep)
416 #define DEP_NODE_FORW(N) (&(N)->forw)
418 /* The following enumeration values tell us what dependencies we
419 should use to implement the barrier. We use true-dependencies for
420 TRUE_BARRIER and anti-dependencies for MOVE_BARRIER. */
421 enum reg_pending_barrier_mode
428 /* Describe state of dependencies used during sched_analyze phase. */
431 /* The *_insns and *_mems are paired lists. Each pending memory operation
432 will have a pointer to the MEM rtx on one list and a pointer to the
433 containing insn on the other list in the same place in the list. */
435 /* We can't use add_dependence like the old code did, because a single insn
436 may have multiple memory accesses, and hence needs to be on the list
437 once for each memory access. Add_dependence won't let you add an insn
438 to a list more than once. */
440 /* An INSN_LIST containing all insns with pending read operations. */
441 rtx pending_read_insns;
443 /* An EXPR_LIST containing all MEM rtx's which are pending reads. */
444 rtx pending_read_mems;
446 /* An INSN_LIST containing all insns with pending write operations. */
447 rtx pending_write_insns;
449 /* An EXPR_LIST containing all MEM rtx's which are pending writes. */
450 rtx pending_write_mems;
452 /* We must prevent the above lists from ever growing too large since
453 the number of dependencies produced is at least O(N*N),
454 and execution time is at least O(4*N*N), as a function of the
455 length of these pending lists. */
457 /* Indicates the length of the pending_read list. */
458 int pending_read_list_length;
460 /* Indicates the length of the pending_write list. */
461 int pending_write_list_length;
463 /* Length of the pending memory flush list. Large functions with no
464 calls may build up extremely large lists. */
465 int pending_flush_length;
467 /* The last insn upon which all memory references must depend.
468 This is an insn which flushed the pending lists, creating a dependency
469 between it and all previously pending memory references. This creates
470 a barrier (or a checkpoint) which no memory reference is allowed to cross.
472 This includes all non constant CALL_INSNs. When we do interprocedural
473 alias analysis, this restriction can be relaxed.
474 This may also be an INSN that writes memory if the pending lists grow
476 rtx last_pending_memory_flush;
478 /* A list of the last function calls we have seen. We use a list to
479 represent last function calls from multiple predecessor blocks.
480 Used to prevent register lifetimes from expanding unnecessarily. */
481 rtx last_function_call;
483 /* A list of insns which use a pseudo register that does not already
484 cross a call. We create dependencies between each of those insn
485 and the next call insn, to ensure that they won't cross a call after
486 scheduling is done. */
487 rtx sched_before_next_call;
489 /* Used to keep post-call pseudo/hard reg movements together with
491 enum { not_post_call, post_call, post_call_initial } in_post_call_group_p;
493 /* The maximum register number for the following arrays. Before reload
494 this is max_reg_num; after reload it is FIRST_PSEUDO_REGISTER. */
497 /* Element N is the next insn that sets (hard or pseudo) register
498 N within the current basic block; or zero, if there is no
499 such insn. Needed for new registers which may be introduced
500 by splitting insns. */
510 /* Element N is set for each register that has any nonzero element
511 in reg_last[N].{uses,sets,clobbers}. */
512 regset_head reg_last_in_use;
514 /* Element N is set for each register that is conditionally set. */
515 regset_head reg_conditional_sets;
517 /* Shows the last value of reg_pending_barrier associated with the insn. */
518 enum reg_pending_barrier_mode last_reg_pending_barrier;
520 /* True when this context should be treated as a readonly by
522 BOOL_BITFIELD readonly : 1;
525 typedef struct deps *deps_t;
527 /* This structure holds some state of the current scheduling pass, and
528 contains some function pointers that abstract out some of the non-generic
529 functionality from functions such as schedule_block or schedule_insn.
530 There is one global variable, current_sched_info, which points to the
531 sched_info structure currently in use. */
532 struct haifa_sched_info
534 /* Add all insns that are initially ready to the ready list. Called once
535 before scheduling a set of insns. */
536 void (*init_ready_list) (void);
537 /* Called after taking an insn from the ready list. Returns nonzero if
538 this insn can be scheduled, nonzero if we should silently discard it. */
539 int (*can_schedule_ready_p) (rtx);
540 /* Return nonzero if there are more insns that should be scheduled. */
541 int (*schedule_more_p) (void);
542 /* Called after an insn has all its hard dependencies resolved.
543 Adjusts status of instruction (which is passed through second parameter)
544 to indicate if instruction should be moved to the ready list or the
545 queue, or if it should silently discard it (until next resolved
547 ds_t (*new_ready) (rtx, ds_t);
548 /* Compare priority of two insns. Return a positive number if the second
549 insn is to be preferred for scheduling, and a negative one if the first
550 is to be preferred. Zero if they are equally good. */
551 int (*rank) (rtx, rtx);
552 /* Return a string that contains the insn uid and optionally anything else
553 necessary to identify this insn in an output. It's valid to use a
554 static buffer for this. The ALIGNED parameter should cause the string
555 to be formatted so that multiple output lines will line up nicely. */
556 const char *(*print_insn) (const_rtx, int);
557 /* Return nonzero if an insn should be included in priority
559 int (*contributes_to_priority) (rtx, rtx);
561 /* The boundaries of the set of insns to be scheduled. */
562 rtx prev_head, next_tail;
564 /* Filled in after the schedule is finished; the first and last scheduled
568 /* If nonzero, enables an additional sanity check in schedule_block. */
569 unsigned int queue_must_finish_empty:1;
571 /* Maximum priority that has been assigned to an insn. */
572 int sched_max_insns_priority;
574 /* Hooks to support speculative scheduling. */
576 /* Called to notify frontend that instruction is being added (second
577 parameter == 0) or removed (second parameter == 1). */
578 void (*add_remove_insn) (rtx, int);
580 /* Called to notify frontend that instruction is being scheduled.
581 The first parameter - instruction to scheduled, the second parameter -
582 last scheduled instruction. */
583 void (*begin_schedule_ready) (rtx, rtx);
585 /* If the second parameter is not NULL, return nonnull value, if the
586 basic block should be advanced.
587 If the second parameter is NULL, return the next basic block in EBB.
588 The first parameter is the current basic block in EBB. */
589 basic_block (*advance_target_bb) (basic_block, rtx);
591 /* ??? FIXME: should use straight bitfields inside sched_info instead of
596 /* This structure holds description of the properties for speculative
600 /* Holds types of allowed speculations: BEGIN_{DATA|CONTROL},
601 BE_IN_{DATA_CONTROL}. */
604 /* A dump file for additional information on speculative scheduling. */
607 /* Minimal cumulative weakness of speculative instruction's
608 dependencies, so that insn will be scheduled. */
609 dw_t data_weakness_cutoff;
611 /* Minimal usefulness of speculative instruction to be considered for
613 int control_weakness_cutoff;
615 /* Flags from the enum SPEC_SCHED_FLAGS. */
618 typedef struct spec_info_def *spec_info_t;
620 extern spec_info_t spec_info;
622 extern struct haifa_sched_info *current_sched_info;
624 /* Indexed by INSN_UID, the collection of all data associated with
625 a single instruction. */
627 struct _haifa_deps_insn_data
629 /* The number of incoming edges in the forward dependency graph.
630 As scheduling proceeds, counts are decreased. An insn moves to
631 the ready queue when its counter reaches zero. */
634 /* Nonzero if instruction has internal dependence
635 (e.g. add_dependence was invoked with (insn == elem)). */
636 unsigned int has_internal_dep;
638 /* NB: We can't place 'struct _deps_list' here instead of deps_list_t into
639 h_i_d because when h_i_d extends, addresses of the deps_list->first
640 change without updating deps_list->first->next->prev_nextp. Thus
641 BACK_DEPS and RESOLVED_BACK_DEPS are allocated on the heap and FORW_DEPS
642 list is allocated on the obstack. */
644 /* A list of hard backward dependencies. The insn is a consumer of all the
645 deps mentioned here. */
646 deps_list_t hard_back_deps;
648 /* A list of speculative (weak) dependencies. The insn is a consumer of all
649 the deps mentioned here. */
650 deps_list_t spec_back_deps;
652 /* A list of insns which depend on the instruction. Unlike 'back_deps',
653 it represents forward dependencies. */
654 deps_list_t forw_deps;
656 /* A list of scheduled producers of the instruction. Links are being moved
657 from 'back_deps' to 'resolved_back_deps' while scheduling. */
658 deps_list_t resolved_back_deps;
660 /* A list of scheduled consumers of the instruction. Links are being moved
661 from 'forw_deps' to 'resolved_forw_deps' while scheduling to fasten the
662 search in 'forw_deps'. */
663 deps_list_t resolved_forw_deps;
665 /* Some insns (e.g. call) are not allowed to move across blocks. */
666 unsigned int cant_move : 1;
669 struct _haifa_insn_data
671 /* We can't place 'struct _deps_list' into h_i_d instead of deps_list_t
672 because when h_i_d extends, addresses of the deps_list->first
673 change without updating deps_list->first->next->prev_nextp. */
675 /* Logical uid gives the original ordering of the insns. */
678 /* A priority for each insn. */
681 /* Number of instructions referring to this insn. */
684 /* The minimum clock tick at which the insn becomes ready. This is
685 used to note timing constraints for the insns in the pending list. */
688 /* INTER_TICK is used to adjust INSN_TICKs of instructions from the
689 subsequent blocks in a region. */
692 /* See comment on QUEUE_INDEX macro in haifa-sched.c. */
697 /* This weight is an estimation of the insn's contribution to
698 register pressure. */
701 /* Set if there's DEF-USE dependence between some speculatively
702 moved load insn and this one. */
703 unsigned int fed_by_spec_load : 1;
704 unsigned int is_load_insn : 1;
706 /* '> 0' if priority is valid,
707 '== 0' if priority was not yet computed,
708 '< 0' if priority in invalid and should be recomputed. */
709 signed char priority_status;
711 /* What speculations are necessary to apply to schedule the instruction. */
714 /* What speculations were already applied. */
717 /* What speculations are checked by this instruction. */
720 /* Recovery block for speculation checks. */
721 basic_block recovery_block;
723 /* Original pattern of the instruction. */
727 typedef struct _haifa_insn_data haifa_insn_data_def;
728 typedef haifa_insn_data_def *haifa_insn_data_t;
730 DEF_VEC_O (haifa_insn_data_def);
731 DEF_VEC_ALLOC_O (haifa_insn_data_def, heap);
733 extern VEC(haifa_insn_data_def, heap) *h_i_d;
735 #define HID(INSN) (VEC_index (haifa_insn_data_def, h_i_d, INSN_UID (INSN)))
737 /* Accessor macros for h_i_d. There are more in haifa-sched.c and
739 #define INSN_PRIORITY(INSN) (HID (INSN)->priority)
740 #define INSN_REG_WEIGHT(INSN) (HID (INSN)->reg_weight)
741 #define INSN_PRIORITY_STATUS(INSN) (HID (INSN)->priority_status)
743 typedef struct _haifa_deps_insn_data haifa_deps_insn_data_def;
744 typedef haifa_deps_insn_data_def *haifa_deps_insn_data_t;
746 DEF_VEC_O (haifa_deps_insn_data_def);
747 DEF_VEC_ALLOC_O (haifa_deps_insn_data_def, heap);
749 extern VEC(haifa_deps_insn_data_def, heap) *h_d_i_d;
751 #define HDID(INSN) (VEC_index (haifa_deps_insn_data_def, h_d_i_d, \
753 #define INSN_DEP_COUNT(INSN) (HDID (INSN)->dep_count)
754 #define HAS_INTERNAL_DEP(INSN) (HDID (INSN)->has_internal_dep)
755 #define INSN_FORW_DEPS(INSN) (HDID (INSN)->forw_deps)
756 #define INSN_RESOLVED_BACK_DEPS(INSN) (HDID (INSN)->resolved_back_deps)
757 #define INSN_RESOLVED_FORW_DEPS(INSN) (HDID (INSN)->resolved_forw_deps)
758 #define INSN_HARD_BACK_DEPS(INSN) (HDID (INSN)->hard_back_deps)
759 #define INSN_SPEC_BACK_DEPS(INSN) (HDID (INSN)->spec_back_deps)
760 #define CANT_MOVE(INSN) (HDID (INSN)->cant_move)
761 #define CANT_MOVE_BY_LUID(LUID) (VEC_index (haifa_deps_insn_data_def, h_d_i_d, \
765 #define INSN_PRIORITY(INSN) (HID (INSN)->priority)
766 #define INSN_PRIORITY_STATUS(INSN) (HID (INSN)->priority_status)
767 #define INSN_PRIORITY_KNOWN(INSN) (INSN_PRIORITY_STATUS (INSN) > 0)
768 #define TODO_SPEC(INSN) (HID (INSN)->todo_spec)
769 #define DONE_SPEC(INSN) (HID (INSN)->done_spec)
770 #define CHECK_SPEC(INSN) (HID (INSN)->check_spec)
771 #define RECOVERY_BLOCK(INSN) (HID (INSN)->recovery_block)
772 #define ORIG_PAT(INSN) (HID (INSN)->orig_pat)
774 /* INSN is either a simple or a branchy speculation check. */
775 #define IS_SPECULATION_CHECK_P(INSN) \
776 (sel_sched_p () ? sel_insn_is_speculation_check (INSN) : RECOVERY_BLOCK (INSN) != NULL)
778 /* INSN is a speculation check that will simply reexecute the speculatively
779 scheduled instruction if the speculation fails. */
780 #define IS_SPECULATION_SIMPLE_CHECK_P(INSN) \
781 (RECOVERY_BLOCK (INSN) == EXIT_BLOCK_PTR)
783 /* INSN is a speculation check that will branch to RECOVERY_BLOCK if the
784 speculation fails. Insns in that block will reexecute the speculatively
785 scheduled code and then will return immediately after INSN thus preserving
786 semantics of the program. */
787 #define IS_SPECULATION_BRANCHY_CHECK_P(INSN) \
788 (RECOVERY_BLOCK (INSN) != NULL && RECOVERY_BLOCK (INSN) != EXIT_BLOCK_PTR)
790 /* Dep status (aka ds_t) of the link encapsulates information, that is needed
791 for speculative scheduling. Namely, it is 4 integers in the range
792 [0, MAX_DEP_WEAK] and 3 bits.
793 The integers correspond to the probability of the dependence to *not*
794 exist, it is the probability, that overcoming of this dependence will
795 not be followed by execution of the recovery code. Nevertheless,
796 whatever high the probability of success is, recovery code should still
797 be generated to preserve semantics of the program. To find a way to
798 get/set these integers, please refer to the {get, set}_dep_weak ()
799 functions in sched-deps.c .
800 The 3 bits in the DEP_STATUS correspond to 3 dependence types: true-,
801 output- and anti- dependence. It is not enough for speculative scheduling
802 to know just the major type of all the dependence between two instructions,
803 as only true dependence can be overcome.
804 There also is the 4-th bit in the DEP_STATUS (HARD_DEP), that is reserved
805 for using to describe instruction's status. It is set whenever instruction
806 has at least one dependence, that cannot be overcame.
807 See also: check_dep_status () in sched-deps.c . */
809 /* We exclude sign bit. */
810 #define BITS_PER_DEP_STATUS (HOST_BITS_PER_INT - 1)
812 /* First '4' stands for 3 dep type bits and HARD_DEP bit.
813 Second '4' stands for BEGIN_{DATA, CONTROL}, BE_IN_{DATA, CONTROL}
815 #define BITS_PER_DEP_WEAK ((BITS_PER_DEP_STATUS - 4) / 4)
817 /* Mask of speculative weakness in dep_status. */
818 #define DEP_WEAK_MASK ((1 << BITS_PER_DEP_WEAK) - 1)
820 /* This constant means that dependence is fake with 99.999...% probability.
821 This is the maximum value, that can appear in dep_status.
822 Note, that we don't want MAX_DEP_WEAK to be the same as DEP_WEAK_MASK for
823 debugging reasons. Though, it can be set to DEP_WEAK_MASK, and, when
824 done so, we'll get fast (mul for)/(div by) NO_DEP_WEAK. */
825 #define MAX_DEP_WEAK (DEP_WEAK_MASK - 1)
827 /* This constant means that dependence is 99.999...% real and it is a really
828 bad idea to overcome it (though this can be done, preserving program
830 #define MIN_DEP_WEAK 1
832 /* This constant represents 100% probability.
833 E.g. it is used to represent weakness of dependence, that doesn't exist. */
834 #define NO_DEP_WEAK (MAX_DEP_WEAK + MIN_DEP_WEAK)
836 /* Default weakness of speculative dependence. Used when we can't say
837 neither bad nor good about the dependence. */
838 #define UNCERTAIN_DEP_WEAK (MAX_DEP_WEAK - MAX_DEP_WEAK / 4)
840 /* Offset for speculative weaknesses in dep_status. */
841 enum SPEC_TYPES_OFFSETS {
842 BEGIN_DATA_BITS_OFFSET = 0,
843 BE_IN_DATA_BITS_OFFSET = BEGIN_DATA_BITS_OFFSET + BITS_PER_DEP_WEAK,
844 BEGIN_CONTROL_BITS_OFFSET = BE_IN_DATA_BITS_OFFSET + BITS_PER_DEP_WEAK,
845 BE_IN_CONTROL_BITS_OFFSET = BEGIN_CONTROL_BITS_OFFSET + BITS_PER_DEP_WEAK
848 /* The following defines provide numerous constants used to distinguish between
849 different types of speculative dependencies. */
851 /* Dependence can be overcome with generation of new data speculative
853 #define BEGIN_DATA (((ds_t) DEP_WEAK_MASK) << BEGIN_DATA_BITS_OFFSET)
855 /* This dependence is to the instruction in the recovery block, that was
856 formed to recover after data-speculation failure.
857 Thus, this dependence can overcome with generating of the copy of
858 this instruction in the recovery block. */
859 #define BE_IN_DATA (((ds_t) DEP_WEAK_MASK) << BE_IN_DATA_BITS_OFFSET)
861 /* Dependence can be overcome with generation of new control speculative
863 #define BEGIN_CONTROL (((ds_t) DEP_WEAK_MASK) << BEGIN_CONTROL_BITS_OFFSET)
865 /* This dependence is to the instruction in the recovery block, that was
866 formed to recover after control-speculation failure.
867 Thus, this dependence can be overcome with generating of the copy of
868 this instruction in the recovery block. */
869 #define BE_IN_CONTROL (((ds_t) DEP_WEAK_MASK) << BE_IN_CONTROL_BITS_OFFSET)
871 /* A few convenient combinations. */
872 #define BEGIN_SPEC (BEGIN_DATA | BEGIN_CONTROL)
873 #define DATA_SPEC (BEGIN_DATA | BE_IN_DATA)
874 #define CONTROL_SPEC (BEGIN_CONTROL | BE_IN_CONTROL)
875 #define SPECULATIVE (DATA_SPEC | CONTROL_SPEC)
876 #define BE_IN_SPEC (BE_IN_DATA | BE_IN_CONTROL)
878 /* Constants, that are helpful in iterating through dep_status. */
879 #define FIRST_SPEC_TYPE BEGIN_DATA
880 #define LAST_SPEC_TYPE BE_IN_CONTROL
881 #define SPEC_TYPE_SHIFT BITS_PER_DEP_WEAK
883 /* Dependence on instruction can be of multiple types
884 (e.g. true and output). This fields enhance REG_NOTE_KIND information
885 of the dependence. */
886 #define DEP_TRUE (((ds_t) 1) << (BE_IN_CONTROL_BITS_OFFSET + BITS_PER_DEP_WEAK))
887 #define DEP_OUTPUT (DEP_TRUE << 1)
888 #define DEP_ANTI (DEP_OUTPUT << 1)
890 #define DEP_TYPES (DEP_TRUE | DEP_OUTPUT | DEP_ANTI)
892 /* Instruction has non-speculative dependence. This bit represents the
893 property of an instruction - not the one of a dependence.
894 Therefore, it can appear only in TODO_SPEC field of an instruction. */
895 #define HARD_DEP (DEP_ANTI << 1)
897 /* This represents the results of calling sched-deps.c functions,
898 which modify dependencies. */
899 enum DEPS_ADJUST_RESULT {
900 /* No dependence needed (e.g. producer == consumer). */
902 /* Dependence is already present and wasn't modified. */
904 /* Existing dependence was modified to include additional information. */
906 /* New dependence has been created. */
910 /* Represents the bits that can be set in the flags field of the
911 sched_info structure. */
913 /* If set, generate links between instruction as DEPS_LIST.
914 Otherwise, generate usual INSN_LIST links. */
916 /* Perform data or control (or both) speculation.
917 Results in generation of data and control speculative dependencies.
918 Requires USE_DEPS_LIST set. */
919 DO_SPECULATION = USE_DEPS_LIST << 1,
920 SCHED_RGN = DO_SPECULATION << 1,
921 SCHED_EBB = SCHED_RGN << 1,
922 /* Scheduler can possibly create new basic blocks. Used for assertions. */
923 NEW_BBS = SCHED_EBB << 1,
924 SEL_SCHED = NEW_BBS << 1
927 enum SPEC_SCHED_FLAGS {
928 COUNT_SPEC_IN_CRITICAL_PATH = 1,
929 PREFER_NON_DATA_SPEC = COUNT_SPEC_IN_CRITICAL_PATH << 1,
930 PREFER_NON_CONTROL_SPEC = PREFER_NON_DATA_SPEC << 1,
931 SEL_SCHED_SPEC_DONT_CHECK_CONTROL = PREFER_NON_CONTROL_SPEC << 1
934 #define NOTE_NOT_BB_P(NOTE) (NOTE_P (NOTE) && (NOTE_KIND (NOTE) \
935 != NOTE_INSN_BASIC_BLOCK))
937 extern FILE *sched_dump;
938 extern int sched_verbose;
940 extern spec_info_t spec_info;
941 extern bool haifa_recovery_bb_ever_added_p;
943 /* Exception Free Loads:
945 We define five classes of speculative loads: IFREE, IRISKY,
946 PFREE, PRISKY, and MFREE.
948 IFREE loads are loads that are proved to be exception-free, just
949 by examining the load insn. Examples for such loads are loads
950 from TOC and loads of global data.
952 IRISKY loads are loads that are proved to be exception-risky,
953 just by examining the load insn. Examples for such loads are
954 volatile loads and loads from shared memory.
956 PFREE loads are loads for which we can prove, by examining other
957 insns, that they are exception-free. Currently, this class consists
958 of loads for which we are able to find a "similar load", either in
959 the target block, or, if only one split-block exists, in that split
960 block. Load2 is similar to load1 if both have same single base
961 register. We identify only part of the similar loads, by finding
962 an insn upon which both load1 and load2 have a DEF-USE dependence.
964 PRISKY loads are loads for which we can prove, by examining other
965 insns, that they are exception-risky. Currently we have two proofs for
966 such loads. The first proof detects loads that are probably guarded by a
967 test on the memory address. This proof is based on the
968 backward and forward data dependence information for the region.
969 Let load-insn be the examined load.
970 Load-insn is PRISKY iff ALL the following hold:
972 - insn1 is not in the same block as load-insn
973 - there is a DEF-USE dependence chain (insn1, ..., load-insn)
974 - test-insn is either a compare or a branch, not in the same block
976 - load-insn is reachable from test-insn
977 - there is a DEF-USE dependence chain (insn1, ..., test-insn)
979 This proof might fail when the compare and the load are fed
980 by an insn not in the region. To solve this, we will add to this
981 group all loads that have no input DEF-USE dependence.
983 The second proof detects loads that are directly or indirectly
984 fed by a speculative load. This proof is affected by the
985 scheduling process. We will use the flag fed_by_spec_load.
986 Initially, all insns have this flag reset. After a speculative
987 motion of an insn, if insn is either a load, or marked as
988 fed_by_spec_load, we will also mark as fed_by_spec_load every
989 insn1 for which a DEF-USE dependence (insn, insn1) exists. A
990 load which is fed_by_spec_load is also PRISKY.
992 MFREE (maybe-free) loads are all the remaining loads. They may be
993 exception-free, but we cannot prove it.
995 Now, all loads in IFREE and PFREE classes are considered
996 exception-free, while all loads in IRISKY and PRISKY classes are
997 considered exception-risky. As for loads in the MFREE class,
998 these are considered either exception-free or exception-risky,
999 depending on whether we are pessimistic or optimistic. We have
1000 to take the pessimistic approach to assure the safety of
1001 speculative scheduling, but we can take the optimistic approach
1002 by invoking the -fsched_spec_load_dangerous option. */
1004 enum INSN_TRAP_CLASS
1006 TRAP_FREE = 0, IFREE = 1, PFREE_CANDIDATE = 2,
1007 PRISKY_CANDIDATE = 3, IRISKY = 4, TRAP_RISKY = 5
1010 #define WORST_CLASS(class1, class2) \
1011 ((class1 > class2) ? class1 : class2)
1017 #ifndef HAIFA_INLINE
1018 #define HAIFA_INLINE __inline
1021 struct sched_deps_info_def
1023 /* Called when computing dependencies for a JUMP_INSN. This function
1024 should store the set of registers that must be considered as set by
1025 the jump in the regset. */
1026 void (*compute_jump_reg_dependencies) (rtx, regset, regset, regset);
1028 /* Start analyzing insn. */
1029 void (*start_insn) (rtx);
1031 /* Finish analyzing insn. */
1032 void (*finish_insn) (void);
1034 /* Start analyzing insn LHS (Left Hand Side). */
1035 void (*start_lhs) (rtx);
1037 /* Finish analyzing insn LHS. */
1038 void (*finish_lhs) (void);
1040 /* Start analyzing insn RHS (Right Hand Side). */
1041 void (*start_rhs) (rtx);
1043 /* Finish analyzing insn RHS. */
1044 void (*finish_rhs) (void);
1046 /* Note set of the register. */
1047 void (*note_reg_set) (int);
1049 /* Note clobber of the register. */
1050 void (*note_reg_clobber) (int);
1052 /* Note use of the register. */
1053 void (*note_reg_use) (int);
1055 /* Note memory dependence of type DS between MEM1 and MEM2 (which is
1057 void (*note_mem_dep) (rtx mem1, rtx mem2, rtx insn2, ds_t ds);
1059 /* Note a dependence of type DS from the INSN. */
1060 void (*note_dep) (rtx insn, ds_t ds);
1062 /* Nonzero if we should use cselib for better alias analysis. This
1063 must be 0 if the dependency information is used after sched_analyze
1064 has completed, e.g. if we're using it to initialize state for successor
1065 blocks in region scheduling. */
1066 unsigned int use_cselib : 1;
1068 /* If set, generate links between instruction as DEPS_LIST.
1069 Otherwise, generate usual INSN_LIST links. */
1070 unsigned int use_deps_list : 1;
1072 /* Generate data and control speculative dependencies.
1073 Requires USE_DEPS_LIST set. */
1074 unsigned int generate_spec_deps : 1;
1077 extern struct sched_deps_info_def *sched_deps_info;
1080 /* Functions in sched-deps.c. */
1081 extern bool sched_insns_conditions_mutex_p (const_rtx, const_rtx);
1082 extern bool sched_insn_is_legitimate_for_speculation_p (const_rtx, ds_t);
1083 extern void add_dependence (rtx, rtx, enum reg_note);
1084 extern void sched_analyze (struct deps *, rtx, rtx);
1085 extern void init_deps (struct deps *);
1086 extern void free_deps (struct deps *);
1087 extern void init_deps_global (void);
1088 extern void finish_deps_global (void);
1089 extern void deps_analyze_insn (struct deps *, rtx);
1090 extern void remove_from_deps (struct deps *, rtx);
1092 extern dw_t get_dep_weak_1 (ds_t, ds_t);
1093 extern dw_t get_dep_weak (ds_t, ds_t);
1094 extern ds_t set_dep_weak (ds_t, ds_t, dw_t);
1095 extern dw_t estimate_dep_weak (rtx, rtx);
1096 extern ds_t ds_merge (ds_t, ds_t);
1097 extern ds_t ds_full_merge (ds_t, ds_t, rtx, rtx);
1098 extern ds_t ds_max_merge (ds_t, ds_t);
1099 extern dw_t ds_weak (ds_t);
1100 extern ds_t ds_get_speculation_types (ds_t);
1101 extern ds_t ds_get_max_dep_weak (ds_t);
1103 extern void sched_deps_init (bool);
1104 extern void sched_deps_finish (void);
1106 extern void haifa_note_reg_set (int);
1107 extern void haifa_note_reg_clobber (int);
1108 extern void haifa_note_reg_use (int);
1110 extern void maybe_extend_reg_info_p (void);
1112 extern void deps_start_bb (struct deps *, rtx);
1113 extern enum reg_note ds_to_dt (ds_t);
1115 extern bool deps_pools_are_empty_p (void);
1116 extern void sched_free_deps (rtx, rtx, bool);
1117 extern void extend_dependency_caches (int, bool);
1119 extern void debug_ds (ds_t);
1121 /* Functions in haifa-sched.c. */
1122 extern int haifa_classify_insn (const_rtx);
1123 extern void get_ebb_head_tail (basic_block, basic_block, rtx *, rtx *);
1124 extern int no_real_insns_p (const_rtx, const_rtx);
1126 extern int insn_cost (rtx);
1127 extern int dep_cost_1 (dep_t, dw_t);
1128 extern int dep_cost (dep_t);
1129 extern int set_priorities (rtx, rtx);
1131 extern void schedule_block (basic_block *);
1133 extern int cycle_issued_insns;
1134 extern int issue_rate;
1135 extern int dfa_lookahead;
1137 extern void ready_sort (struct ready_list *);
1138 extern rtx ready_element (struct ready_list *, int);
1139 extern rtx *ready_lastpos (struct ready_list *);
1141 extern int try_ready (rtx);
1142 extern void sched_extend_ready_list (int);
1143 extern void sched_finish_ready_list (void);
1144 extern void sched_change_pattern (rtx, rtx);
1145 extern int sched_speculate_insn (rtx, ds_t, rtx *);
1146 extern void unlink_bb_notes (basic_block, basic_block);
1147 extern void add_block (basic_block, basic_block);
1148 extern rtx bb_note (basic_block);
1149 extern void concat_note_lists (rtx, rtx *);
1150 extern rtx sched_emit_insn (rtx);
1153 /* Types and functions in sched-rgn.c. */
1155 /* A region is the main entity for interblock scheduling: insns
1156 are allowed to move between blocks in the same region, along
1157 control flow graph edges, in the 'up' direction. */
1160 /* Number of extended basic blocks in region. */
1162 /* cblocks in the region (actually index in rgn_bb_table). */
1164 /* Dependencies for this region are already computed. Basically, indicates,
1165 that this is a recovery block. */
1166 unsigned int dont_calc_deps : 1;
1167 /* This region has at least one non-trivial ebb. */
1168 unsigned int has_real_ebb : 1;
1172 extern int nr_regions;
1173 extern region *rgn_table;
1174 extern int *rgn_bb_table;
1175 extern int *block_to_bb;
1176 extern int *containing_rgn;
1178 #define RGN_NR_BLOCKS(rgn) (rgn_table[rgn].rgn_nr_blocks)
1179 #define RGN_BLOCKS(rgn) (rgn_table[rgn].rgn_blocks)
1180 #define RGN_DONT_CALC_DEPS(rgn) (rgn_table[rgn].dont_calc_deps)
1181 #define RGN_HAS_REAL_EBB(rgn) (rgn_table[rgn].has_real_ebb)
1182 #define BLOCK_TO_BB(block) (block_to_bb[block])
1183 #define CONTAINING_RGN(block) (containing_rgn[block])
1185 /* The mapping from ebb to block. */
1186 extern int *ebb_head;
1187 #define BB_TO_BLOCK(ebb) (rgn_bb_table[ebb_head[ebb]])
1188 #define EBB_FIRST_BB(ebb) BASIC_BLOCK (BB_TO_BLOCK (ebb))
1189 #define EBB_LAST_BB(ebb) BASIC_BLOCK (rgn_bb_table[ebb_head[ebb + 1] - 1])
1190 #define INSN_BB(INSN) (BLOCK_TO_BB (BLOCK_NUM (INSN)))
1192 extern int current_nr_blocks;
1193 extern int current_blocks;
1194 extern int target_bb;
1196 extern bool sched_is_disabled_for_current_region_p (void);
1197 extern void sched_rgn_init (bool);
1198 extern void sched_rgn_finish (void);
1199 extern void rgn_setup_region (int);
1200 extern void sched_rgn_compute_dependencies (int);
1201 extern void sched_rgn_local_init (int);
1202 extern void sched_rgn_local_finish (void);
1203 extern void sched_rgn_local_free (void);
1204 extern void extend_regions (void);
1205 extern void rgn_make_new_region_out_of_new_block (basic_block);
1207 extern void compute_priorities (void);
1208 extern void increase_insn_priority (rtx, int);
1209 extern void debug_rgn_dependencies (int);
1210 extern void debug_dependencies (rtx, rtx);
1211 extern void free_rgn_deps (void);
1212 extern int contributes_to_priority (rtx, rtx);
1213 extern void extend_rgns (int *, int *, sbitmap, int *);
1214 extern void deps_join (struct deps *, struct deps *);
1216 extern void rgn_setup_common_sched_info (void);
1217 extern void rgn_setup_sched_infos (void);
1219 extern void debug_regions (void);
1220 extern void debug_region (int);
1221 extern void dump_region_dot (FILE *, int);
1222 extern void dump_region_dot_file (const char *, int);
1224 extern void haifa_sched_init (void);
1225 extern void haifa_sched_finish (void);
1227 /* sched-deps.c interface to walk, add, search, update, resolve, delete
1228 and debug instruction dependencies. */
1230 /* Constants defining dependences lists. */
1233 #define SD_LIST_NONE (0)
1235 /* hard_back_deps. */
1236 #define SD_LIST_HARD_BACK (1)
1238 /* spec_back_deps. */
1239 #define SD_LIST_SPEC_BACK (2)
1242 #define SD_LIST_FORW (4)
1244 /* resolved_back_deps. */
1245 #define SD_LIST_RES_BACK (8)
1247 /* resolved_forw_deps. */
1248 #define SD_LIST_RES_FORW (16)
1250 #define SD_LIST_BACK (SD_LIST_HARD_BACK | SD_LIST_SPEC_BACK)
1252 /* A type to hold above flags. */
1253 typedef int sd_list_types_def;
1255 extern void sd_next_list (const_rtx, sd_list_types_def *, deps_list_t *, bool *);
1257 /* Iterator to walk through, resolve and delete dependencies. */
1260 /* What lists to walk. Can be any combination of SD_LIST_* flags. */
1261 sd_list_types_def types;
1263 /* Instruction dependencies lists of which will be walked. */
1266 /* Pointer to the next field of the previous element. This is not
1267 simply a pointer to the next element to allow easy deletion from the
1268 list. When a dep is being removed from the list the iterator
1269 will automatically advance because the value in *linkp will start
1270 referring to the next element. */
1273 /* True if the current list is a resolved one. */
1277 typedef struct _sd_iterator sd_iterator_def;
1279 /* ??? We can move some definitions that are used in below inline functions
1280 out of sched-int.h to sched-deps.c provided that the below functions will
1281 become global externals.
1282 These definitions include:
1283 * struct _deps_list: opaque pointer is needed at global scope.
1284 * struct _dep_link: opaque pointer is needed at scope of sd_iterator_def.
1285 * struct _dep_node: opaque pointer is needed at scope of
1286 struct _deps_link. */
1288 /* Return initialized iterator. */
1289 static inline sd_iterator_def
1290 sd_iterator_start (rtx insn, sd_list_types_def types)
1292 /* Some dep_link a pointer to which will return NULL. */
1293 static dep_link_t null_link = NULL;
1299 i.linkp = &null_link;
1301 /* Avoid 'uninitialized warning'. */
1302 i.resolved_p = false;
1307 /* Return the current element. */
1309 sd_iterator_cond (sd_iterator_def *it_ptr, dep_t *dep_ptr)
1311 dep_link_t link = *it_ptr->linkp;
1315 *dep_ptr = DEP_LINK_DEP (link);
1320 sd_list_types_def types = it_ptr->types;
1322 if (types != SD_LIST_NONE)
1323 /* Switch to next list. */
1327 sd_next_list (it_ptr->insn,
1328 &it_ptr->types, &list, &it_ptr->resolved_p);
1330 it_ptr->linkp = &DEPS_LIST_FIRST (list);
1332 return sd_iterator_cond (it_ptr, dep_ptr);
1340 /* Advance iterator. */
1342 sd_iterator_next (sd_iterator_def *it_ptr)
1344 it_ptr->linkp = &DEP_LINK_NEXT (*it_ptr->linkp);
1347 /* A cycle wrapper. */
1348 #define FOR_EACH_DEP(INSN, LIST_TYPES, ITER, DEP) \
1349 for ((ITER) = sd_iterator_start ((INSN), (LIST_TYPES)); \
1350 sd_iterator_cond (&(ITER), &(DEP)); \
1351 sd_iterator_next (&(ITER)))
1353 extern int sd_lists_size (const_rtx, sd_list_types_def);
1354 extern bool sd_lists_empty_p (const_rtx, sd_list_types_def);
1355 extern void sd_init_insn (rtx);
1356 extern void sd_finish_insn (rtx);
1357 extern dep_t sd_find_dep_between (rtx, rtx, bool);
1358 extern void sd_add_dep (dep_t, bool);
1359 extern enum DEPS_ADJUST_RESULT sd_add_or_update_dep (dep_t, bool);
1360 extern void sd_resolve_dep (sd_iterator_def);
1361 extern void sd_copy_back_deps (rtx, rtx, bool);
1362 extern void sd_delete_dep (sd_iterator_def);
1363 extern void sd_debug_lists (rtx, sd_list_types_def);
1365 #endif /* INSN_SCHEDULING */
1367 /* Functions in sched-vis.c. These must be outside INSN_SCHEDULING as
1368 sched-vis.c is compiled always. */
1369 extern void print_insn (char *, const_rtx, int);
1370 extern void print_pattern (char *, const_rtx, int);
1371 extern void print_value (char *, const_rtx, int);
1373 #endif /* GCC_SCHED_INT_H */