Searched refs:loops (Results 1 - 25 of 84) sorted by relevance

1234

/freebsd-9.3-release/contrib/gcc/
H A Dloop-init.c39 loops. */
41 struct loops *
44 struct loops *loops = XCNEW (struct loops);
64 /* Find the loops. */
66 if (flow_loops_find (loops) <= 1)
68 /* No loops. */
69 flow_loops_free (loops);
70 free (loops);
43 struct loops *loops = XCNEW (struct loops); local
108 loop_optimizer_finalize(struct loops *loops) argument
[all...]
H A Dcfgloop.h61 /* Index into loops array. */
144 /* Structure to hold CFG information about natural loops within a function. */
145 struct loops struct
147 /* Number of natural loops in the function. */
150 /* State of loops. */
153 /* We store just pointers to loops here.
155 has been removed and the entire loops structure has not been
173 /* Headers shared by multiple loops that should be merged. */
179 extern struct loops *current_loops;
182 extern int flow_loops_find (struct loops *);
[all...]
H A Dtree-scalar-evolution.h28 extern void scev_initialize (struct loops *loops);
H A Dcfgloop.c43 static void flow_loops_cfg_dump (const struct loops *, FILE *);
45 static void flow_loops_level_compute (struct loops *);
54 flow_loops_cfg_dump (const struct loops *loops, FILE *file)
59 if (! loops->num || ! file)
74 if (loops->cfg.dfs_order)
78 fprintf (file, "%d ", loops->cfg.dfs_order[i]);
84 if (loops->cfg.rc_order)
88 fprintf (file, "%d ", loops->cfg.rc_order[i]);
104 loops withi
53 flow_loops_cfg_dump(const struct loops *loops, FILE *file) argument
153 flow_loops_dump(const struct loops *loops, FILE *file, void (*loop_dump_aux) (const struct loop *, FILE *, int), int verbose) argument
190 flow_loops_free(struct loops *loops) argument
273 mark_single_exit_loops(struct loops *loops) argument
419 flow_loops_level_compute(struct loops *loops) argument
577 initialize_loops_parallel_p(struct loops *loops) argument
593 flow_loops_find(struct loops *loops) argument
1016 cancel_loop(struct loops *loops, struct loop *loop) argument
1040 cancel_loop_tree(struct loops *loops, struct loop *loop) argument
1055 verify_loop_structure(struct loops *loops) argument
[all...]
H A Dtree-ssa-loop-unswitch.c40 /* This file implements the loop unswitching, i.e. transformation of loops like
76 static struct loop *tree_unswitch_loop (struct loops *, struct loop *, basic_block,
78 static bool tree_unswitch_single_loop (struct loops *, struct loop *, int);
84 tree_ssa_unswitch_loops (struct loops *loops) argument
90 /* Go through inner loops (only original ones). */
91 num = loops->num;
96 loop = loops->parray[i];
103 changed |= tree_unswitch_single_loop (loops, loop, 0);
180 tree_unswitch_single_loop (struct loops *loop argument
280 tree_unswitch_loop(struct loops *loops, struct loop *loop, basic_block unswitch_on, tree cond) argument
[all...]
H A Dcfgloopmanip.c34 static void duplicate_subloops (struct loops *, struct loop *, struct loop *);
35 static void copy_loops_to (struct loops *, struct loop **, int,
43 static void add_loop (struct loops *, struct loop *);
44 static void fix_loop_placements (struct loops *, struct loop *, bool *);
45 static bool fix_bb_placement (struct loops *, basic_block);
46 static void fix_bb_placements (struct loops *, basic_block, bool *);
47 static void place_new_loop (struct loops *, struct loop *);
50 static void unloop (struct loops *, struct loop *, bool *);
100 fix_bb_placement (struct loops *loops, basic_bloc argument
141 fix_bb_placements(struct loops *loops, basic_block from, bool *irred_invalidated) argument
246 remove_path(struct loops *loops, edge e) argument
369 add_loop(struct loops *loops, struct loop *loop) argument
411 loopify(struct loops *loops, edge latch_edge, edge header_edge, basic_block switch_bb, edge true_edge, edge false_edge, bool redirect_all_edges) argument
511 unloop(struct loops *loops, struct loop *loop, bool *irred_invalidated) argument
603 fix_loop_placements(struct loops *loops, struct loop *loop, bool *irred_invalidated) argument
627 place_new_loop(struct loops *loops, struct loop *loop) argument
639 duplicate_loop(struct loops *loops, struct loop *loop, struct loop *target) argument
660 duplicate_subloops(struct loops *loops, struct loop *loop, struct loop *target) argument
674 copy_loops_to(struct loops *loops, struct loop **copied_loops, int n, struct loop *target) argument
784 duplicate_loop_to_header_edge(struct loop *loop, edge e, struct loops *loops, unsigned int ndupl, sbitmap wont_exit, edge orig, edge *to_remove, unsigned int *n_to_remove, int flags) argument
1176 create_preheaders(struct loops *loops, int flags) argument
1187 force_single_succ_latches(struct loops *loops) argument
1294 loop_version(struct loops *loops, struct loop * loop, void *cond_expr, basic_block *condition_bb, bool place_after) argument
1401 fix_loop_structure(struct loops *loops, bitmap changed_bbs) argument
[all...]
H A Dtree-ssa-loop-ivcanon.c21 /* This pass detects the loops that iterate a constant number of times,
58 /* Specifies types of loops that may be unrolled. */
62 UL_SINGLE_ITER, /* Only loops that exit immediately in the first
64 UL_NO_GROWTH, /* Only loops whose unrolling will not cause increase
66 UL_ALL /* All suitable loops. */
158 loop tree. UL determines which loops we are allowed to unroll.
162 try_unroll_loop_completely (struct loops *loops ATTRIBUTE_UNUSED,
240 loops, n_unroll, wont_exit,
269 /* Adds a canonical induction variable to LOOP if suitable. LOOPS is the loops
276 canonicalize_loop_induction_variables(struct loops *loops, struct loop *loop, bool create_iv, enum unroll_level ul, bool try_eval) argument
334 canonicalize_induction_variables(struct loops *loops) argument
364 tree_unroll_loops_completely(struct loops *loops, bool may_increase_size) argument
568 remove_empty_loops(struct loops *loops) argument
[all...]
H A Dtree-ssa-loop-ch.c41 /* Duplicates headers of loops if they are small enough, so that the statements
119 /* For all loops, copy the condition at the end of the loop body in front
126 struct loops *loops; local
135 loops = loop_optimizer_init (LOOPS_HAVE_PREHEADERS
137 if (!loops)
141 verify_loop_structure (loops);
148 for (i = 1; i < loops->num; i++)
153 loop = loops->parray[i];
212 don't warn about overflow involving loops
[all...]
H A Dloop-unswitch.c35 /* This pass moves constant conditions out of loops, duplicating the loop
78 transformation on innermost loops, as the benefit of doing it on loops
82 static struct loop *unswitch_loop (struct loops *, struct loop *,
84 static void unswitch_single_loop (struct loops *, struct loop *, rtx, int);
140 unswitch_loops (struct loops *loops) argument
145 /* Go through inner loops (only original ones). */
146 num = loops->num;
151 loop = loops
262 unswitch_single_loop(struct loops *loops, struct loop *loop, rtx cond_checked, int num) argument
401 unswitch_loop(struct loops *loops, struct loop *loop, basic_block unswitch_on, rtx cond, rtx cinsn) argument
[all...]
H A Dtree-ssa-loop.c43 struct loops *current_loops = NULL;
47 static struct loops *
50 struct loops *loops; local
52 loops = loop_optimizer_init (LOOPS_NORMAL
55 if (!loops)
60 return loops;
315 /* Remove empty loops. */
343 /* Record bounds on numbers of iterations of loops. */
373 /* Complete unrolling of loops
[all...]
H A Dloop-unroll.c38 optimizations on innermost loops (with single exception) because
47 -- complete peeling of once-rolling loops; this is the above mentioned
50 -- complete peeling of loops that roll (small) constant times.
51 -- simple peeling of first iterations of loops that do not roll much
53 -- unrolling of loops that roll constant times; this is almost always
55 -- unrolling of loops that roll number of times that we can compute
58 -- simple unrolling of remaining loops; this is performed only if we
117 static void decide_unrolling_and_peeling (struct loops *, int);
118 static void peel_loops_completely (struct loops *, int);
125 static void peel_loop_simple (struct loops *, struc
145 unroll_and_peel_loops(struct loops *loops, int flags) argument
234 peel_loops_completely(struct loops *loops, int flags) argument
272 decide_unrolling_and_peeling(struct loops *loops, int flags) argument
478 peel_loop_completely(struct loops *loops, struct loop *loop) argument
661 unroll_loop_constant_iterations(struct loops *loops, struct loop *loop) argument
934 unroll_loop_runtime_iterations(struct loops *loops, struct loop *loop) argument
1264 peel_loop_simple(struct loops *loops, struct loop *loop) argument
1414 unroll_loop_stupid(struct loops *loops, struct loop *loop) argument
[all...]
H A Dcfgloopanal.c256 /* Marks blocks and edges that are part of non-recognized loops; i.e. we
269 mark_irreducible_loops (struct loops *loops) argument
276 int *queue1 = XNEWVEC (int, last_basic_block + loops->num);
277 int *queue2 = XNEWVEC (int, last_basic_block + loops->num);
290 g = new_graph (last_basic_block + loops->num);
308 Edges exiting loops should lead from representative
309 of the son of nearest common ancestor of the loops in that
342 for (i = 1; i < (int) loops->num; i++)
343 if (loops
573 mark_loop_exit_edges(struct loops *loops) argument
[all...]
H A Dcfghooks.h115 struct loops *loops,
167 struct loops *loops,
H A Dtree-flow.h392 /* This macro loops over all the referenced vars, one at a time, putting the
408 /* This macro loops over all the referenced vars, one at a time, putting the
803 void vectorize_loops (struct loops *);
812 void tree_ssa_lim (struct loops *);
813 unsigned int tree_ssa_unswitch_loops (struct loops *);
814 unsigned int canonicalize_induction_variables (struct loops *);
815 unsigned int tree_unroll_loops_completely (struct loops *, bool);
816 unsigned int tree_ssa_prefetch_arrays (struct loops *);
817 unsigned int remove_empty_loops (struct loops *);
818 void tree_ssa_iv_optimize (struct loops *);
[all...]
H A Dtree-loop-linear.c162 distances in the inner loops, the fewer the cache misses.
211 1. (spatial locality) Inner loops should have smallest
214 2. (spatial locality) Inner loops should contain more
217 3. (temporal locality) Inner loops should have smallest
242 linear_transform_loops (struct loops *loops) argument
249 for (i = 1; i < loops->num; i++)
254 struct loop *loop_nest = loops->parray[i];
260 We also don't handle sibling loops properly,
261 which are loops o
[all...]
/freebsd-9.3-release/contrib/sendmail/libsm/
H A Db-strl.c32 #define LOOPS 4000000L /* initial number of loops */
67 long loops = LOOPS;
116 for (a = 0; a < loops; a++)
127 for (a = 0; a < loops; a++)
137 loops += loops;
138 if (loops < 0L || one > MAXTIME)
145 loops);
152 loops = LOOPS;
157 for (a = 0; a < loops;
[all...]
H A Db-strcmp.c21 #define LOOPS 4000000L /* initial number of loops */
52 long loops; local
101 loops = LOOPS;
107 for (a = 0; a < loops; a++)
118 for (a = 0; a < loops; a++)
128 loops += loops;
129 if (loops < 0L || one > MAXTIME)
137 loops);
/freebsd-9.3-release/contrib/llvm/include/llvm/CodeGen/
H A DCalcSpillWeights.h59 const MachineLoopInfo &loops,
62 : MF(mf), LIS(lis), Loops(loops), MBFI(mbfi), normalize(norm) {}
58 VirtRegAuxInfo(MachineFunction &mf, LiveIntervals &lis, const MachineLoopInfo &loops, const MachineBlockFrequencyInfo &mbfi, NormalizingFn norm = normalizeSpillWeight) argument
/freebsd-9.3-release/share/examples/perfmon/
H A Dperfmon.c54 int loops, i, sleeptime; local
68 loops = 50;
92 loops = getnum(optarg, 1, INT_MAX - 1);
110 buf = malloc((loops + 1) * sizeof *buf);
112 err(1, "malloc(%lu)", (unsigned long)(loops +1) * sizeof *buf);
129 for (i = 0; i < loops; i++) {
154 for (i = 1; i <= loops; i++) {
158 printf("total: %f\nmean: %f\n", total, total / loops);
/freebsd-9.3-release/contrib/bind9/lib/isc/
H A Dhex.c55 unsigned int loops = 0; local
67 loops++;
69 (int)((loops + 1) * 2) >= wordlength)
71 loops = 0;
H A Dbase64.c57 unsigned int loops = 0; local
73 loops++;
75 (int)((loops + 1) * 4) >= wordlength)
77 loops = 0;
/freebsd-9.3-release/contrib/ntp/lib/isc/
H A Dhex.c55 unsigned int loops = 0; local
67 loops++;
69 (int)((loops + 1) * 2) >= wordlength)
71 loops = 0;
H A Dbase64.c57 unsigned int loops = 0; local
73 loops++;
75 (int)((loops + 1) * 4) >= wordlength)
77 loops = 0;
/freebsd-9.3-release/contrib/llvm/lib/CodeGen/
H A DSpillPlacement.h46 const MachineLoopInfo *loops; member in class:llvm::SpillPlacement
/freebsd-9.3-release/contrib/bmake/mk/
H A Dwarnings.mk73 # This version uses .for loops to avoid a double free bug in old bmake's
74 # but the .for loops are sensitive to when this file is read.
107 # .for loops have the [dis]advantage of being evaluated when read,
110 # Replacing the above .for loops with the WARNINGS+= below solves that

Completed in 153 milliseconds

1234