1 /* Form lists of pseudo register references for autoinc optimization
2 for GNU compiler. This is part of flow optimization.
3 Copyright (C) 1999, 2000, 2001, 2003, 2004, 2005, 2006
4 Free Software Foundation, Inc.
5 Originally contributed by Michael P. Hayes
6 (m.hayes@elec.canterbury.ac.nz, mhayes@redhat.com)
7 Major rewrite contributed by Danny Berlin (dberlin@dberlin.org)
8 and Kenneth Zadeck (zadeck@naturalbridge.com).
10 This file is part of GCC.
12 GCC is free software; you can redistribute it and/or modify it under
13 the terms of the GNU General Public License as published by the Free
14 Software Foundation; either version 2, or (at your option) any later
17 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
18 WARRANTY; without even the implied warranty of MERCHANTABILITY or
19 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
22 You should have received a copy of the GNU General Public License
23 along with GCC; see the file COPYING. If not, write to the Free
24 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
31 #include "basic-block.h"
32 #include "alloc-pool.h"
38 /* Data flow problems. All problems must have a unique here. */
39 /* Scanning is not really a dataflow problem, but it is useful to have
40 the basic block functions in the vector so that things get done in
43 #define DF_RU 1 /* Reaching Uses. */
44 #define DF_RD 2 /* Reaching Defs. */
45 #define DF_LR 3 /* Live Registers. */
46 #define DF_UR 4 /* Uninitialized Registers. */
47 #define DF_UREC 5 /* Uninitialized Registers with Early Clobber. */
48 #define DF_CHAIN 6 /* Def-Use and/or Use-Def Chains. */
49 #define DF_RI 7 /* Register Info. */
50 #define DF_LAST_PROBLEM_PLUS1 (DF_RI + 1)
52 /* Flags that control the building of chains. */
53 #define DF_DU_CHAIN 1 /* Build DU chains. */
54 #define DF_UD_CHAIN 2 /* Build UD chains. */
57 /* Dataflow direction. */
65 /* Function prototypes added to df_problem instance. */
67 /* Allocate the problem specific data. */
68 typedef void (*df_alloc_function
) (struct dataflow
*, bitmap
);
70 /* Free the basic block info. Called from the block reordering code
71 to get rid of the blocks that have been squished down. */
72 typedef void (*df_free_bb_function
) (struct dataflow
*, void *);
74 /* Local compute function. */
75 typedef void (*df_local_compute_function
) (struct dataflow
*, bitmap
, bitmap
);
77 /* Init the solution specific data. */
78 typedef void (*df_init_function
) (struct dataflow
*, bitmap
);
80 /* Iterative dataflow function. */
81 typedef void (*df_dataflow_function
) (struct dataflow
*, bitmap
, bitmap
,
84 /* Confluence operator for blocks with 0 out (or in) edges. */
85 typedef void (*df_confluence_function_0
) (struct dataflow
*, basic_block
);
87 /* Confluence operator for blocks with 1 or more out (or in) edges. */
88 typedef void (*df_confluence_function_n
) (struct dataflow
*, edge
);
90 /* Transfer function for blocks. */
91 typedef bool (*df_transfer_function
) (struct dataflow
*, int);
93 /* Function to massage the information after the problem solving. */
94 typedef void (*df_finalizer_function
) (struct dataflow
*, bitmap
);
96 /* Function to free all of the problem specific datastructures. */
97 typedef void (*df_free_function
) (struct dataflow
*);
99 /* Function to dump results to FILE. */
100 typedef void (*df_dump_problem_function
) (struct dataflow
*, FILE *);
102 /* The static description of a dataflow problem to solve. See above
103 typedefs for doc for the function fields. */
106 /* The unique id of the problem. This is used it index into
107 df->defined_problems to make accessing the problem data easy. */
109 enum df_flow_dir dir
; /* Dataflow direction. */
110 df_alloc_function alloc_fun
;
111 df_free_bb_function free_bb_fun
;
112 df_local_compute_function local_compute_fun
;
113 df_init_function init_fun
;
114 df_dataflow_function dataflow_fun
;
115 df_confluence_function_0 con_fun_0
;
116 df_confluence_function_n con_fun_n
;
117 df_transfer_function trans_fun
;
118 df_finalizer_function finalize_fun
;
119 df_free_function free_fun
;
120 df_dump_problem_function dump_fun
;
122 /* A dataflow problem that must be solved before this problem can be
124 struct df_problem
*dependent_problem
;
128 /* The specific instance of the problem to solve. */
131 struct df
*df
; /* Instance of df we are working in. */
132 struct df_problem
*problem
; /* The problem to be solved. */
134 /* Communication between iterative_dataflow and hybrid_search. */
135 sbitmap visited
, pending
, considered
;
137 /* Array indexed by bb->index, that contains basic block problem and
138 solution specific information. */
140 unsigned int block_info_size
;
142 /* The pool to allocate the block_info from. */
143 alloc_pool block_pool
;
145 /* Other problem specific data that is not on a per basic block
146 basis. The structure is generally defined privately for the
147 problem. The exception being the scanning problem where it is
152 /* One of these structures is allocated for every insn. */
155 struct df_ref
*defs
; /* Head of insn-def chain. */
156 struct df_ref
*uses
; /* Head of insn-use chain. */
157 /* ???? The following luid field should be considered private so that
158 we can change it on the fly to accommodate new insns? */
159 int luid
; /* Logical UID. */
160 bool contains_asm
; /* Contains an asm instruction. */
163 /* Two of these structures are allocated for every pseudo reg, one for
164 the uses and one for the defs. */
167 struct df_ref
*reg_chain
; /* Head of reg-use or def chain. */
168 unsigned int begin
; /* First def_index for this pseudo. */
169 unsigned int n_refs
; /* Number of refs or defs for this pseudo. */
173 enum df_ref_type
{DF_REF_REG_DEF
, DF_REF_REG_USE
, DF_REF_REG_MEM_LOAD
,
174 DF_REF_REG_MEM_STORE
};
176 #define DF_REF_TYPE_NAMES {"def", "use", "mem load", "mem store"}
180 /* Read-modify-write refs generate both a use and a def and
181 these are marked with this flag to show that they are not
183 DF_REF_READ_WRITE
= 1,
185 /* This flag is set, if we stripped the subreg from the reference.
186 In this case we must make conservative guesses, at what the
190 /* If this flag is set, this is not a real definition/use, but an
191 artificial one created to model always live registers, eh uses, etc. */
192 DF_REF_ARTIFICIAL
= 4,
195 /* If this flag is set for an artificial use or def, that ref
196 logically happens at the top of the block. If it is not set
197 for an artificial use or def, that ref logically happens at the
198 bottom of the block. This is never set for regular refs. */
201 /* This flag is set if the use is inside a REG_EQUAL note. */
204 /* This flag is set if this ref is really a clobber, and not a def. */
209 /* Define a register reference structure. One of these is allocated
210 for every register reference (use or def). Note some register
211 references (e.g., post_inc, subreg) generate both a def and a use. */
214 rtx reg
; /* The register referenced. */
215 unsigned int regno
; /* The register number referenced. */
216 basic_block bb
; /* Basic block containing the instruction. */
217 rtx insn
; /* Insn containing ref. NB: THIS MAY BE NULL. */
218 rtx
*loc
; /* The location of the reg. */
219 struct df_link
*chain
; /* Head of def-use, use-def or bi chain. */
220 unsigned int id
; /* Location in table. */
221 enum df_ref_type type
; /* Type of ref. */
222 enum df_ref_flags flags
; /* Various flags. */
224 /* For each regno, there are two chains of refs, one for the uses
225 and one for the defs. These chains go thru the refs themselves
226 rather than using an external structure. */
227 struct df_ref
*next_reg
; /* Next ref with same regno and type. */
228 struct df_ref
*prev_reg
; /* Prev ref with same regno and type. */
230 /* Each insn has two lists, one for the uses and one for the
231 defs. This is the next field in either of these chains. */
232 struct df_ref
*next_ref
;
233 void *data
; /* The data assigned to it by user. */
236 /* There are two kinds of links: */
238 /* This is used for def-use or use-def chains. */
242 struct df_link
*next
;
245 /* Two of these structures are allocated, one for the uses and one for
249 struct df_reg_info
**regs
; /* Array indexed by pseudo regno. */
250 unsigned int regs_size
; /* Size of currently allocated regs table. */
251 unsigned int regs_inited
; /* Number of regs with reg_infos allocated. */
252 struct df_ref
**refs
; /* Ref table, indexed by id. */
253 unsigned int refs_size
; /* Size of currently allocated refs table. */
254 unsigned int bitmap_size
; /* Number of refs seen. */
256 /* True if refs table is organized so that every reference for a
257 pseudo is contigious. */
259 /* True if the next refs should be added immediately or false to
260 defer to later to reorganize the table. */
261 bool add_refs_inline
;
265 /*----------------------------------------------------------------------------
266 Problem data for the scanning dataflow problem. Unlike the other
267 dataflow problems, the problem data for scanning is fully exposed and
268 used by owners of the problem.
269 ----------------------------------------------------------------------------*/
274 #define DF_HARD_REGS 1 /* Mark hard registers. */
275 #define DF_EQUIV_NOTES 2 /* Mark uses present in EQUIV/EQUAL notes. */
276 #define DF_SUBREGS 4 /* Return subregs rather than the inner reg. */
278 int flags
; /* Indicates what's recorded. */
280 /* The set of problems to be solved is stored in two arrays. In
281 PROBLEMS_IN_ORDER, the problems are stored in the order that they
282 are solved. This is an internally dense array that may have
283 nulls at the end of it. In PROBLEMS_BY_INDEX, the problem is
284 stored by the value in df_problem.id. These are used to access
285 the problem local data without having to search the first
288 struct dataflow
*problems_in_order
[DF_LAST_PROBLEM_PLUS1
];
289 struct dataflow
*problems_by_index
[DF_LAST_PROBLEM_PLUS1
];
290 int num_problems_defined
;
292 /* Set after calls to df_scan_blocks, this contains all of the
293 blocks that higher level problems must rescan before solving the
294 dataflow equations. If this is NULL, the blocks_to_analyze is
296 bitmap blocks_to_scan
;
298 /* If not NULL, the subset of blocks of the program to be considered
300 bitmap blocks_to_analyze
;
302 /* The following information is really the problem data for the
303 scanning instance but it is used too often by the other problems
304 to keep getting it from there. */
305 struct df_ref_info def_info
; /* Def info. */
306 struct df_ref_info use_info
; /* Use info. */
307 struct df_insn_info
**insns
; /* Insn table, indexed by insn UID. */
308 unsigned int insns_size
; /* Size of insn table. */
309 bitmap hardware_regs_used
; /* The set of hardware registers used. */
310 bitmap exit_block_uses
; /* The set of hardware registers used in exit block. */
313 #define DF_SCAN_BB_INFO(DF, BB) (df_scan_get_bb_info((DF)->problems_by_index[DF_SCAN],(BB)->index))
314 #define DF_RU_BB_INFO(DF, BB) (df_ru_get_bb_info((DF)->problems_by_index[DF_RU],(BB)->index))
315 #define DF_RD_BB_INFO(DF, BB) (df_rd_get_bb_info((DF)->problems_by_index[DF_RD],(BB)->index))
316 #define DF_LR_BB_INFO(DF, BB) (df_lr_get_bb_info((DF)->problems_by_index[DF_LR],(BB)->index))
317 #define DF_UR_BB_INFO(DF, BB) (df_ur_get_bb_info((DF)->problems_by_index[DF_UR],(BB)->index))
318 #define DF_UREC_BB_INFO(DF, BB) (df_urec_get_bb_info((DF)->problems_by_index[DF_UREC],(BB)->index))
320 /* Most transformations that wish to use live register analysis will
321 use these macros. The DF_UPWARD_LIVE* macros are only half of the
323 #define DF_LIVE_IN(DF, BB) (DF_UR_BB_INFO(DF, BB)->in)
324 #define DF_LIVE_OUT(DF, BB) (DF_UR_BB_INFO(DF, BB)->out)
327 /* Live in for register allocation also takes into account several other factors. */
328 #define DF_RA_LIVE_IN(DF, BB) (DF_UREC_BB_INFO(DF, BB)->in)
329 #define DF_RA_LIVE_OUT(DF, BB) (DF_UREC_BB_INFO(DF, BB)->out)
331 /* These macros are currently used by only reg-stack since it is not
332 tolerant of uninitialized variables. This intolerance should be
333 fixed because it causes other problems. */
334 #define DF_UPWARD_LIVE_IN(DF, BB) (DF_LR_BB_INFO(DF, BB)->in)
335 #define DF_UPWARD_LIVE_OUT(DF, BB) (DF_LR_BB_INFO(DF, BB)->out)
338 /* Macros to access the elements within the ref structure. */
341 #define DF_REF_REAL_REG(REF) (GET_CODE ((REF)->reg) == SUBREG \
342 ? SUBREG_REG ((REF)->reg) : ((REF)->reg))
343 #define DF_REF_REGNO(REF) ((REF)->regno)
344 #define DF_REF_REAL_LOC(REF) (GET_CODE ((REF)->reg) == SUBREG \
345 ? &SUBREG_REG ((REF)->reg) : ((REF)->loc))
346 #define DF_REF_REG(REF) ((REF)->reg)
347 #define DF_REF_LOC(REF) ((REF)->loc)
348 #define DF_REF_BB(REF) ((REF)->bb)
349 #define DF_REF_BBNO(REF) (DF_REF_BB (REF)->index)
350 #define DF_REF_INSN(REF) ((REF)->insn)
351 #define DF_REF_INSN_UID(REF) (INSN_UID ((REF)->insn))
352 #define DF_REF_TYPE(REF) ((REF)->type)
353 #define DF_REF_CHAIN(REF) ((REF)->chain)
354 #define DF_REF_ID(REF) ((REF)->id)
355 #define DF_REF_FLAGS(REF) ((REF)->flags)
356 #define DF_REF_NEXT_REG(REF) ((REF)->next_reg)
357 #define DF_REF_PREV_REG(REF) ((REF)->prev_reg)
358 #define DF_REF_NEXT_REF(REF) ((REF)->next_ref)
359 #define DF_REF_DATA(REF) ((REF)->data)
361 /* Macros to determine the reference type. */
363 #define DF_REF_REG_DEF_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_DEF)
364 #define DF_REF_REG_USE_P(REF) ((REF) && ! DF_REF_REG_DEF_P (REF))
365 #define DF_REF_REG_MEM_STORE_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_MEM_STORE)
366 #define DF_REF_REG_MEM_LOAD_P(REF) (DF_REF_TYPE (REF) == DF_REF_REG_MEM_LOAD)
367 #define DF_REF_REG_MEM_P(REF) (DF_REF_REG_MEM_STORE_P (REF) \
368 || DF_REF_REG_MEM_LOAD_P (REF))
370 /* Macros to get the refs out of def_info or use_info refs table. */
371 #define DF_DEFS_SIZE(DF) ((DF)->def_info.bitmap_size)
372 #define DF_DEFS_GET(DF,ID) ((DF)->def_info.refs[(ID)])
373 #define DF_DEFS_SET(DF,ID,VAL) ((DF)->def_info.refs[(ID)]=(VAL))
374 #define DF_USES_SIZE(DF) ((DF)->use_info.bitmap_size)
375 #define DF_USES_GET(DF,ID) ((DF)->use_info.refs[(ID)])
376 #define DF_USES_SET(DF,ID,VAL) ((DF)->use_info.refs[(ID)]=(VAL))
378 /* Macros to access the register information from scan dataflow record. */
380 #define DF_REG_SIZE(DF) ((DF)->def_info.regs_size)
381 #define DF_REG_DEF_GET(DF, REG) ((DF)->def_info.regs[(REG)])
382 #define DF_REG_DEF_SET(DF, REG, VAL) ((DF)->def_info.regs[(REG)]=(VAL))
383 #define DF_REG_USE_GET(DF, REG) ((DF)->use_info.regs[(REG)])
384 #define DF_REG_USE_SET(DF, REG, VAL) ((DF)->use_info.regs[(REG)]=(VAL))
386 /* Macros to access the elements within the reg_info structure table. */
388 #define DF_REGNO_FIRST_DEF(DF, REGNUM) \
389 (DF_REG_DEF_GET(DF, REGNUM) ? DF_REG_DEF_GET(DF, REGNUM) : 0)
390 #define DF_REGNO_LAST_USE(DF, REGNUM) \
391 (DF_REG_USE_GET(DF, REGNUM) ? DF_REG_USE_GET(DF, REGNUM) : 0)
393 /* Macros to access the elements within the insn_info structure table. */
395 #define DF_INSN_SIZE(DF) ((DF)->insns_size)
396 #define DF_INSN_GET(DF,INSN) ((DF)->insns[(INSN_UID(INSN))])
397 #define DF_INSN_SET(DF,INSN,VAL) ((DF)->insns[(INSN_UID (INSN))]=(VAL))
398 #define DF_INSN_CONTAINS_ASM(DF, INSN) (DF_INSN_GET(DF,INSN)->contains_asm)
399 #define DF_INSN_LUID(DF, INSN) (DF_INSN_GET(DF,INSN)->luid)
400 #define DF_INSN_DEFS(DF, INSN) (DF_INSN_GET(DF,INSN)->defs)
401 #define DF_INSN_USES(DF, INSN) (DF_INSN_GET(DF,INSN)->uses)
403 #define DF_INSN_UID_GET(DF,UID) ((DF)->insns[(UID)])
404 #define DF_INSN_UID_LUID(DF, INSN) (DF_INSN_UID_GET(DF,INSN)->luid)
405 #define DF_INSN_UID_DEFS(DF, INSN) (DF_INSN_UID_GET(DF,INSN)->defs)
406 #define DF_INSN_UID_USES(DF, INSN) (DF_INSN_UID_GET(DF,INSN)->uses)
408 /* This is a bitmap copy of regs_invalidated_by_call so that we can
409 easily add it into bitmaps, etc. */
411 extern bitmap df_invalidated_by_call
;
413 /* Initialize ur_in and ur_out as if all hard registers were partially
416 extern bitmap df_all_hard_regs
;
418 /* The way that registers are processed, especially hard registers,
419 changes as the compilation proceeds. These states are passed to
420 df_set_state to control this processing. */
422 #define DF_SCAN_INITIAL 1 /* Processing from beginning of rtl to
424 #define DF_SCAN_GLOBAL 2 /* Processing before global
426 #define DF_SCAN_POST_ALLOC 4 /* Processing after register
428 extern int df_state
; /* Indicates where we are in the compilation. */
431 /* One of these structures is allocated for every basic block. */
432 struct df_scan_bb_info
434 /* Defs at the start of a basic block that is the target of an
436 struct df_ref
*artificial_defs
;
438 /* Uses of hard registers that are live at every block. */
439 struct df_ref
*artificial_uses
;
454 /* Reaching definitions. */
465 /* Live registers. */
475 /* Uninitialized registers. */
484 /* Uninitialized registers. */
485 struct df_urec_bb_info
495 #define df_finish(df) {df_finish1(df); df=NULL;}
497 /* Functions defined in df-core.c. */
499 extern struct df
*df_init (int);
500 extern struct dataflow
*df_add_problem (struct df
*, struct df_problem
*);
501 extern void df_set_blocks (struct df
*, bitmap
);
502 extern void df_finish1 (struct df
*);
503 extern void df_analyze (struct df
*);
504 extern void df_compact_blocks (struct df
*);
505 extern void df_bb_replace (struct df
*, int, basic_block
);
506 extern struct df_ref
*df_bb_regno_last_use_find (struct df
*, basic_block
, unsigned int);
507 extern struct df_ref
*df_bb_regno_first_def_find (struct df
*, basic_block
, unsigned int);
508 extern struct df_ref
*df_bb_regno_last_def_find (struct df
*, basic_block
, unsigned int);
509 extern bool df_insn_regno_def_p (struct df
*, rtx
, unsigned int);
510 extern struct df_ref
*df_find_def (struct df
*, rtx
, rtx
);
511 extern bool df_reg_defined (struct df
*, rtx
, rtx
);
512 extern struct df_ref
*df_find_use (struct df
*, rtx
, rtx
);
513 extern bool df_reg_used (struct df
*, rtx
, rtx
);
514 extern void df_iterative_dataflow (struct dataflow
*, bitmap
, bitmap
, int *, int, bool);
515 extern void df_dump (struct df
*, FILE *);
516 extern void df_chain_dump (struct df
*, struct df_link
*, FILE *);
517 extern void df_refs_chain_dump (struct df
*, struct df_ref
*, bool, FILE *);
518 extern void df_regs_chain_dump (struct df
*, struct df_ref
*, FILE *);
519 extern void df_insn_debug (struct df
*, rtx
, bool, FILE *);
520 extern void df_insn_debug_regno (struct df
*, rtx
, FILE *);
521 extern void df_regno_debug (struct df
*, unsigned int, FILE *);
522 extern void df_ref_debug (struct df
*, struct df_ref
*, FILE *);
523 extern void debug_df_insn (rtx
);
524 extern void debug_df_regno (unsigned int);
525 extern void debug_df_reg (rtx
);
526 extern void debug_df_defno (unsigned int);
527 extern void debug_df_useno (unsigned int);
528 extern void debug_df_ref (struct df_ref
*);
529 extern void debug_df_chain (struct df_link
*);
530 /* An instance of df that can be shared between passes. */
531 extern struct df
*shared_df
;
534 /* Functions defined in df-problems.c. */
536 extern struct dataflow
*df_get_dependent_problem (struct dataflow
*);
537 extern struct df_link
*df_chain_create (struct dataflow
*, struct df_ref
*, struct df_ref
*);
538 extern void df_chain_unlink (struct dataflow
*, struct df_ref
*, struct df_link
*);
539 extern void df_chain_copy (struct dataflow
*, struct df_ref
*, struct df_link
*);
540 extern bitmap
df_get_live_in (struct df
*, basic_block
);
541 extern bitmap
df_get_live_out (struct df
*, basic_block
);
542 extern void df_grow_bb_info (struct dataflow
*);
543 extern void df_chain_dump (struct df
*, struct df_link
*, FILE *);
544 extern void df_print_bb_index (basic_block bb
, FILE *file
);
545 extern struct dataflow
*df_ru_add_problem (struct df
*);
546 extern struct df_ru_bb_info
*df_ru_get_bb_info (struct dataflow
*, unsigned int);
547 extern struct dataflow
*df_rd_add_problem (struct df
*);
548 extern struct df_rd_bb_info
*df_rd_get_bb_info (struct dataflow
*, unsigned int);
549 extern struct dataflow
*df_lr_add_problem (struct df
*);
550 extern struct df_lr_bb_info
*df_lr_get_bb_info (struct dataflow
*, unsigned int);
551 extern struct dataflow
*df_ur_add_problem (struct df
*);
552 extern struct df_ur_bb_info
*df_ur_get_bb_info (struct dataflow
*, unsigned int);
553 extern struct dataflow
*df_urec_add_problem (struct df
*);
554 extern struct df_urec_bb_info
*df_urec_get_bb_info (struct dataflow
*, unsigned int);
555 extern struct dataflow
*df_chain_add_problem (struct df
*, int flags
);
556 extern struct dataflow
*df_ri_add_problem (struct df
*);
557 extern int df_reg_lifetime (struct df
*, rtx reg
);
560 /* Functions defined in df-scan.c. */
562 extern struct df_scan_bb_info
*df_scan_get_bb_info (struct dataflow
*, unsigned int);
563 extern struct dataflow
*df_scan_add_problem (struct df
*);
564 extern void df_rescan_blocks (struct df
*, bitmap
);
565 extern struct df_ref
*df_ref_create (struct df
*, rtx
, rtx
*, rtx
,basic_block
,enum df_ref_type
, enum df_ref_flags
);
566 extern struct df_ref
*df_get_artificial_defs (struct df
*, unsigned int);
567 extern struct df_ref
*df_get_artificial_uses (struct df
*, unsigned int);
568 extern void df_reg_chain_create (struct df_reg_info
*, struct df_ref
*);
569 extern struct df_ref
*df_reg_chain_unlink (struct dataflow
*, struct df_ref
*);
570 extern void df_ref_remove (struct df
*, struct df_ref
*);
571 extern void df_insn_refs_delete (struct dataflow
*, rtx
);
572 extern void df_refs_delete (struct dataflow
*, bitmap
);
573 extern void df_reorganize_refs (struct df_ref_info
*);
574 extern void df_set_state (int);
575 extern void df_hard_reg_init (void);
576 extern bool df_read_modify_subreg_p (rtx
);
579 #endif /* GCC_DF_H */