/freebsd-10.0-release/contrib/gcc/ |
H A D | cfgloop.h | 1 /* Natural loop functions 46 /* The structure describing a bound on number of iterations of a loop. */ 53 a loop. */ 58 /* Structure to hold information for each natural loop. */ 59 struct loop struct 64 /* Basic block of loop header. */ 67 /* Basic block of loop latch. */ 70 /* For loop unrolling/peeling decision. */ 73 /* Number of loop insns. */ 79 /* Number of blocks contained within the loop 363 simple_loop_desc(struct loop *loop) argument [all...] |
H A D | tree-scalar-evolution.h | 25 extern tree number_of_iterations_in_loop (struct loop *); 26 extern tree get_loop_exit_condition (struct loop *); 31 extern tree analyze_scalar_evolution (struct loop *, tree); 32 extern tree instantiate_parameters (struct loop *, tree); 37 extern bool simple_iv (struct loop *, tree, tree, affine_iv *, bool);
|
H A D | cfgloop.c | 1 /* Natural loop discovery code for GNU compiler. 37 considered to belong to inner loop with same header. */ 44 static int flow_loop_level_compute (struct loop *); 46 static void establish_preds (struct loop *); 51 /* Dump loop related CFG information. */ 97 flow_loop_nested_p (const struct loop *outer, const struct loop *loop) 99 return (loop->depth > outer->depth 100 && loop 96 flow_loop_nested_p(const struct loop *outer, const struct loop *loop) argument 106 superloop_at_depth(struct loop *loop, unsigned depth) argument 120 flow_loop_dump(const struct loop *loop, FILE *file, void (*loop_dump_aux) (const struct loop *, FILE *, int), int verbose) argument 166 struct loop *loop = loops->parray[i]; local 180 flow_loop_free(struct loop *loop) argument 201 struct loop *loop = loops->parray[i]; local 224 flow_loop_nodes_find(basic_block header, struct loop *loop) argument 277 struct loop *loop; local 328 establish_preds(struct loop *loop) argument 352 flow_loop_tree_node_add(struct loop *father, struct loop *loop) argument 364 flow_loop_tree_node_remove(struct loop *loop) argument 389 flow_loop_level_compute(struct loop *loop) argument 583 struct loop *loop = loops->parray[i]; local 708 struct loop *loop; local 762 flow_bb_inside_loop_p(const struct loop *loop, const basic_block bb) argument 784 get_loop_body(const struct loop *loop) argument 817 fill_sons_in_loop(const struct loop *loop, basic_block bb, basic_block *tovisit, int *tv) argument 847 get_loop_body_in_dom_order(const struct loop *loop) argument 869 get_loop_body_in_bfs_order(const struct loop *loop) argument 919 get_loop_exit_edges(const struct loop *loop, unsigned int *num_edges) argument 949 num_loop_branches(const struct loop *loop) argument 968 add_bb_to_loop(basic_block bb, struct loop *loop) argument 984 struct loop *loop = bb->loop_father; local 1016 cancel_loop(struct loops *loops, struct loop *loop) argument 1040 cancel_loop_tree(struct loops *loops, struct loop *loop) argument 1060 struct loop *loop; local 1275 loop_latch_edge(const struct loop *loop) argument 1282 loop_preheader_edge(const struct loop *loop) argument 1297 loop_exit_edge_p(const struct loop *loop, edge e) argument [all...] |
H A D | tree-ssa-loop-unswitch.c | 40 /* This file implements the loop unswitching, i.e. transformation of loops like 53 where inv is the loop invariant, into 73 tree-ssa-loop-im.c ensures that all the suitable conditions are in this 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); 79 static tree tree_may_unswitch_on (basic_block, struct loop *); 81 /* Main entry point. Perform loop unswitching on all suitable LOOPS. */ 87 struct loop *loop; local 115 tree_may_unswitch_on(basic_block bb, struct loop *loop) argument 151 simplify_using_entry_checks(struct loop *loop, tree cond) argument 180 tree_unswitch_single_loop(struct loops *loops, struct loop *loop, int num) argument 280 tree_unswitch_loop(struct loops *loops, struct loop *loop, basic_block unswitch_on, tree cond) argument [all...] |
H A D | tree-ssa-loop-ivcanon.c | 33 loop completely, we do it right here to expose the optimization 73 create_canonical_iv (struct loop *loop, edge exit, tree niter) argument 82 fprintf (dump_file, "Added canonical iv to loop %d, ", loop->num); 104 NULL_TREE, loop, 117 tree_num_loop_insns (struct loop *loop) argument 119 basic_block *body = get_loop_body (loop); 123 for (i = 0; i < loop 162 try_unroll_loop_completely(struct loops *loops ATTRIBUTE_UNUSED, struct loop *loop, edge exit, tree niter, enum unroll_level ul) argument 276 canonicalize_loop_induction_variables(struct loops *loops, struct loop *loop, bool create_iv, enum unroll_level ul, bool try_eval) argument 337 struct loop *loop; local 367 struct loop *loop; local 399 empty_loop_p(struct loop *loop) argument 494 remove_empty_loop(struct loop *loop) argument 548 try_remove_empty_loop(struct loop *loop, bool *changed) argument 571 struct loop *loop; local [all...] |
H A D | cfgloopmanip.c | 34 static void duplicate_subloops (struct loops *, struct loop *, struct loop *); 35 static void copy_loops_to (struct loops *, struct loop **, int, 36 struct loop *); 43 static void add_loop (struct loops *, struct loop *); 44 static void fix_loop_placements (struct loops *, struct loop *, bool *); 47 static void place_new_loop (struct loops *, struct loop *); 48 static void scale_loop_frequencies (struct loop *, int, int); 49 static basic_block create_preheader (struct loop *, int); 50 static void unloop (struct loops *, struct loop *, boo 104 struct loop *loop = loops->tree_root, *act; local 369 add_loop(struct loops *loops, struct loop *loop) argument 392 scale_loop_frequencies(struct loop *loop, int num, int den) argument 420 struct loop *loop = XCNEW (struct loop); local 511 unloop(struct loops *loops, struct loop *loop, bool *irred_invalidated) argument 564 fix_loop_placement(struct loop *loop) 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 737 can_duplicate_loop_p(struct loop *loop) argument 752 update_single_exits_after_duplication(basic_block *bbs, unsigned nbbs, struct loop *loop) 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 1078 struct loop *loop = single_succ (jump)->loop_father; local 1092 create_preheader(struct loop *loop, int flags) argument 1190 struct loop *loop; local 1294 loop_version(struct loops *loops, struct loop * loop, void *cond_expr, basic_block *condition_bb, bool place_after) argument 1404 struct loop *loop, *ploop; local [all...] |
H A D | tree-ssa-loop-ch.c | 42 in the loop body are always executed when the loop is entered. This 44 for loop preconditioning. */ 51 should_duplicate_loop_header_p (basic_block header, struct loop *loop, argument 58 loop peeling here). */ 65 if (flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 0)->dest) 66 && flow_bb_inside_loop_p (loop, EDGE_SUCC (header, 1)->dest)) 69 /* If this is not the original loop header, we want it to have just 71 if (header != loop 101 do_while_loop_p(struct loop *loop) argument 128 struct loop *loop; local [all...] |
H A D | tree-ssa-loop-im.c | 78 struct loop *max_loop; /* The outermost loop in that the statement 81 struct loop *tgt_loop; /* The loop out of that we want to move the 84 struct loop *always_executed_in; 85 /* The outermost loop for that we are sure 86 the statement is executed if the loop 97 out of the loop when this statement is 100 MAX_LOOP loop. */ 123 in the loop 301 outermost_invariant_loop(tree def, struct loop *loop) argument 331 outermost_invariant_loop_expr(tree expr, struct loop *loop) argument 375 add_dependency(tree def, struct lim_aux_data *data, struct loop *loop, bool add_cost) argument 483 struct loop *loop = bb->loop_father; local 792 struct loop *loop = data, *max_loop; local 821 force_move_till_expr(tree expr, struct loop *orig_loop, struct loop *loop) argument 844 force_move_till_expr (TREE_OPERAND (expr, i), orig_loop, loop); local 853 struct loop *loop; member in struct:fmt_data 1044 schedule_sm(struct loop *loop, edge *exits, unsigned n_exits, tree ref, struct mem_ref_loc *mem_refs) argument 1099 determine_lsm_ref(struct loop *loop, edge *exits, unsigned n_exits, bitmap clobbered_vops, struct mem_ref *ref) argument 1153 hoist_memory_references(struct loop *loop, struct mem_ref *mem_refs, bitmap clobbered_vops, edge *exits, unsigned n_exits) argument 1206 gather_mem_refs_stmt(struct loop *loop, htab_t mem_refs, bitmap clobbered_vops, tree stmt, struct mem_ref **mem_ref_list) argument 1290 gather_mem_refs(struct loop *loop, bitmap clobbered_vops) argument 1365 determine_lsm_loop(struct loop *loop) argument 1399 struct loop *loop; local 1436 fill_always_executed_in(struct loop *loop, sbitmap contains_call) argument 1506 struct loop *loop; local [all...] |
H A D | loop-unroll.c | 37 /* This pass performs loop unrolling and peeling. We only perform these 48 exception, as this causes loop to be cancelled completely and 68 how many times we should unroll the loop; the experiments I have made 104 the unrolled loop. */ 113 basic_block loop_exit; /* The loop exit basic block. */ 114 basic_block loop_preheader; /* The loop preheader basic block. */ 119 static void decide_peel_simple (struct loop *, int); 120 static void decide_peel_once_rolling (struct loop *, int); 121 static void decide_peel_completely (struct loop *, int); 122 static void decide_unroll_stupid (struct loop *, in 147 struct loop *loop, *next; local 214 loop_exit_at_end_p(struct loop *loop) argument 236 struct loop *loop; local 274 struct loop *loop = loops->tree_root, *next; local 345 decide_peel_once_rolling(struct loop *loop, int flags ATTRIBUTE_UNUSED) argument 384 decide_peel_completely(struct loop *loop, int flags ATTRIBUTE_UNUSED) argument 478 peel_loop_completely(struct loops *loops, struct loop *loop) argument 545 decide_unroll_constant_iterations(struct loop *loop, int flags) argument 661 unroll_loop_constant_iterations(struct loops *loops, struct loop *loop) argument 826 decide_unroll_runtime_iterations(struct loop *loop, int flags) argument 934 unroll_loop_runtime_iterations(struct loops *loops, struct loop *loop) argument 1166 decide_peel_simple(struct loop *loop, int flags) argument 1264 peel_loop_simple(struct loops *loops, struct loop *loop) argument 1320 decide_unroll_stupid(struct loop *loop, int flags) argument 1414 unroll_loop_stupid(struct loops *loops, struct loop *loop) argument 1506 referenced_in_one_insn_in_loop_p(struct loop *loop, rtx reg) argument 1551 analyze_insn_to_expand_var(struct loop *loop, rtx insn) argument 1698 analyze_insns_in_loop(struct loop *loop) argument [all...] |
H A D | tree-if-conv.c | 27 o Decide if a loop is if-convertible or not. 28 o Walk all loop basic blocks in breadth first order (BFS order). 106 static tree tree_if_convert_stmt (struct loop *loop, tree, tree, 108 static void tree_if_convert_cond_expr (struct loop *, tree, tree, 110 static bool if_convertible_phi_p (struct loop *, basic_block, tree); 111 static bool if_convertible_modify_expr_p (struct loop *, basic_block, tree); 112 static bool if_convertible_stmt_p (struct loop *, basic_block, tree); 113 static bool if_convertible_bb_p (struct loop *, basic_block, basic_block); 114 static bool if_convertible_loop_p (struct loop *, boo 143 tree_if_conversion(struct loop *loop, bool for_vectorizer) argument 218 tree_if_convert_stmt(struct loop * loop, tree t, tree cond, block_stmt_iterator *bsi) argument 261 tree_if_convert_cond_expr(struct loop *loop, tree stmt, tree cond, block_stmt_iterator *bsi) argument 302 if_convertible_phi_p(struct loop *loop, basic_block bb, tree phi) argument 344 if_convertible_modify_expr_p(struct loop *loop, basic_block bb, tree m_expr) argument 399 if_convertible_stmt_p(struct loop *loop, basic_block bb, tree stmt) argument 439 if_convertible_bb_p(struct loop *loop, basic_block bb, basic_block exit_bb) argument 496 if_convertible_loop_p(struct loop *loop, bool for_vectorizer ATTRIBUTE_UNUSED) argument 612 add_to_dst_predicate_list(struct loop * loop, edge e, tree prev_cond, tree cond, block_stmt_iterator *bsi) argument 661 clean_predicate_lists(struct loop *loop) argument 683 find_phi_replacement_condition(struct loop *loop, basic_block bb, tree *cond, block_stmt_iterator *bsi) argument 853 process_phi_nodes(struct loop *loop) argument 894 combine_blocks(struct loop *loop) argument 1058 get_loop_body_in_if_conv_order(const struct loop *loop) argument 1112 bb_with_exit_edge_p(struct loop *loop, basic_block bb) argument 1134 struct loop *loop; local [all...] |
H A D | tree-scalar-evolution.c | 25 This pass analyzes the evolution of scalar variables in loop 27 and on the loop hierarchy tree. This algorithm is not based on 36 when entering in the loop_1 and has a step 2 in this loop, in other 63 - When the definition is a loop-phi-node: determine its initial 64 condition, that is the SSA edge defined in an outer loop, and 66 in the body of the loop. Follow the inner edges until ending on 67 another loop-phi-node of the same analyzed loop. If the reached 68 loop-phi-node is not the starting loop 378 struct loop *loop = current_loops->parray[loop_nb]; local 459 compute_overall_effect_of_inner_loop(struct loop *loop, tree evolution_fn) argument 895 set_nb_iterations_in_loop(struct loop *loop, tree res) argument 966 get_loop_exit_condition(struct loop *loop) argument 996 get_exit_conditions_rec(struct loop *loop, VEC(tree,heap) **exit_conditions) argument 1043 follow_ssa_edge_in_rhs(struct loop *loop, tree at_stmt, tree rhs, tree halting_phi, tree *evolution_of_loop, int limit) argument 1238 follow_ssa_edge_in_condition_phi_branch(int i, struct loop *loop, tree condition_phi, tree halting_phi, tree *evolution_of_branch, tree init_cond, int limit) argument 1274 follow_ssa_edge_in_condition_phi(struct loop *loop, tree condition_phi, tree halting_phi, tree *evolution_of_loop, int limit) argument 1323 struct loop *loop = loop_containing_stmt (loop_phi_node); local 1365 follow_ssa_edge(struct loop *loop, tree def, tree halting_phi, tree *evolution_of_loop, int limit) argument 1435 struct loop *loop = loop_containing_stmt (loop_phi_node); local 1504 struct loop *loop = bb_for_stmt (loop_phi_node)->loop_father; local 1556 interpret_loop_phi(struct loop *loop, tree loop_phi_node) argument 1588 interpret_condition_phi(struct loop *loop, tree condition_phi) argument 1620 interpret_rhs_modify_expr(struct loop *loop, tree at_stmt, tree opnd1, tree type) argument 1906 analyze_scalar_evolution_1(struct loop *loop, tree var, tree res) argument 1999 analyze_scalar_evolution(struct loop *loop, tree var) argument 2101 struct loop *loop; local 2138 instantiate_parameters_1(struct loop *loop, tree chrec, int flags, htab_t cache, int size_expr) argument 2407 instantiate_parameters(struct loop *loop, tree chrec) argument 2443 resolve_mixers(struct loop *loop, tree chrec) argument 2472 number_of_iterations_in_loop(struct loop *loop) argument 2674 struct loop *loop; local 2771 struct loop *loop; local 2792 simple_iv(struct loop *loop, tree stmt, tree op, affine_iv *iv, bool allow_nonconstant_step) argument 2891 struct loop *loop, *ex_loop; local [all...] |
H A D | loop-unswitch.c | 35 /* This pass moves constant conditions out of loops, duplicating the loop 50 where nothing inside the loop alters cond is transformed 75 Duplicating the loop might lead to code growth exponential in number of 76 branches inside loop, so we limit the number of unswitchings performed 77 in a single loop to PARAM_MAX_UNSWITCH_LEVEL. We only perform the 82 static struct loop *unswitch_loop (struct loops *, struct loop *, 84 static void unswitch_single_loop (struct loops *, struct loop *, rtx, int); 85 static rtx may_unswitch_on (basic_block, struct loop *, rtx *); 138 /* Main entry point. Perform loop unswitchin 143 struct loop *loop; local 173 may_unswitch_on(basic_block bb, struct loop *loop, rtx *cinsn) argument 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 D | tree-vectorizer.c | 29 For example, the vectorizer transforms the following simple loop: 72 loop, as well as general information about the loop as a whole, which is 73 recorded in a "loop_vec_info" struct attached to each loop. 77 The loop transformation phase scans all the stmts in the loop, and 79 the loop that needs to be vectorized. It insert the vector code sequence 152 static struct loop *slpeel_tree_duplicate_loop_to_edge_cfg 153 (struct loop *, struct loops *, edge); 155 (struct loop *, struc 228 struct loop *loop = bb->loop_father; local 251 rename_variables_in_loop(struct loop *loop) argument 505 slpeel_update_phi_nodes_for_guard1(edge guard_edge, struct loop *loop, bool is_new_loop, basic_block *new_exit_bb, bitmap *defs) argument 632 slpeel_update_phi_nodes_for_guard2(edge guard_edge, struct loop *loop, bool is_new_loop, basic_block *new_exit_bb) argument 766 slpeel_make_loop_iterate_ntimes(struct loop *loop, tree niters) argument 827 slpeel_tree_duplicate_loop_to_edge_cfg(struct loop *loop, struct loops *loops, edge e) argument 971 slpeel_can_duplicate_loop_p(struct loop *loop, edge e) argument 1068 slpeel_tree_peel_loop_to_edge(struct loop *loop, struct loops *loops, edge e, tree first_niters, tree niters, bool update_first_loop_count) argument 1229 find_loop_location(struct loop *loop) argument 1385 new_loop_vec_info(struct loop *loop) argument 1443 struct loop *loop; local 1643 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); local 1812 vect_is_simple_reduction(struct loop *loop, tree phi) argument 2054 struct loop *loop = loops->parray[i]; local 2081 struct loop *loop = loops->parray[i]; local [all...] |
H A D | cfglayout.h | 34 edge *, unsigned, edge *, struct loop *,
|
H A D | tree-ssa-loop-niter.c | 1 /* Functions to determine/estimate number of iterations of a loop. 129 /* Determines number of iterations of loop whose ending condition 172 /* Let nsd (step, size of mode) = d. If d does not divide c, the loop 186 /* If we cannot assume that the loop is not infinite, record the 203 of the loop with ending condition IV0 < IV1 (computed in TYPE). 277 /* Add assertions to NITER that ensure that the control variable of the loop 347 /* Add an assumption to NITER that a loop whose ending condition 405 /* Determines number of iterations of loop whose ending condition 482 otherwise the loop does not roll. */ 492 /* Determines number of iterations of loop whos 907 simplify_using_initial_conditions(struct loop *loop, tree expr, tree *conds_used) argument 955 simplify_using_outer_evolutions(struct loop *loop, tree expr) argument 1008 loop_only_exit_p(struct loop *loop, edge exit) argument 1045 number_of_iterations_exit(struct loop *loop, edge exit, struct tree_niter_desc *niter, bool warn) argument 1177 find_loop_niter(struct loop *loop, edge *exit) argument 1256 chain_of_csts_start(struct loop *loop, tree x) argument 1301 get_base_for(struct loop *loop, tree x) argument 1374 loop_niter_by_eval(struct loop *loop, edge exit) argument 1471 find_loop_niter_by_eval(struct loop *loop, edge *exit) argument 1683 record_estimate(struct loop *loop, tree bound, tree additional, tree at_stmt) argument 1711 compute_estimated_nb_iterations(struct loop *loop) argument 1738 infer_loop_bounds_from_undefined(struct loop *loop) argument 1851 estimate_numbers_of_iterations_loop(struct loop *loop) argument 1896 struct loop *loop; local 2000 scev_probably_wraps_p(tree base, tree step, tree at_stmt, struct loop *loop, bool use_overflow_semantics) argument 2085 free_numbers_of_iterations_estimates_loop(struct loop *loop) argument 2106 struct loop *loop; local 2120 substitute_in_loop_info(struct loop *loop, tree name, tree val) argument [all...] |
/freebsd-10.0-release/contrib/ntp/scripts/stats/ |
H A D | loop.S | 2 loop <- scan(file1, list(day=0, sec=0, offset=0, freq=0, tc=0)) label 3 loop$offset <- loop$offset * 1e6 7 plot(loop$sec, loop$offset, type="l", xlab=paste("MJD", loop$day, "Time (s)"), ylab="PLL Offset (us)", ylim=c(-400, 400))
|
/freebsd-10.0-release/crypto/openssl/crypto/engine/ |
H A D | enginetest.c | 78 int loop; local 81 loop = 0; 86 loop++, ENGINE_get_id(h), ENGINE_get_name(h)); 101 int loop; local 220 for(loop = 0; loop < 512; loop++) 222 sprintf(buf, "id%i", loop); 224 sprintf(buf, "Fake engine type %i", loop); 226 if(((block[loop] [all...] |
/freebsd-10.0-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/i386/ustack/ |
H A D | tst.circstack.s | 38 loop: label 40 jmp loop
|
/freebsd-10.0-release/cddl/contrib/opensolaris/cmd/dtrace/test/tst/sparc/ustack/ |
H A D | tst.circstack.s | 37 loop: label 40 ba loop
|
/freebsd-10.0-release/contrib/apr-util/dbm/sdbm/ |
H A D | sdbm_hash.c | 40 #define DUFF /* go ahead and use the loop-unrolled version */ 46 register int loop = (len + 8 - 1) >> 3; local 54 } while (--loop);
|
/freebsd-10.0-release/share/doc/smm/12.timed/ |
H A D | Makefile | 6 EXTRA= date loop time unused
|
/freebsd-10.0-release/crypto/openssl/crypto/ |
H A D | mem_clr.c | 67 size_t loop = len, ctr = cleanse_ctr; local 68 while(loop--)
|
/freebsd-10.0-release/lib/libc/db/hash/ |
H A D | hash_func.c | 105 * units. On the first time through the loop we get the "leftover bytes" 115 u_int32_t n, loop; local 123 loop = (len + 8 - 1) >> 3; 143 } while (--loop); 155 u_int32_t h, loop; local 165 loop = (len + 8 - 1) >> 3; 185 } while (--loop);
|
/freebsd-10.0-release/contrib/llvm/lib/Target/NVPTX/ |
H A D | NVPTXLowerAggrCopies.cpp | 32 // Lower MemTransferInst or load-store pair to loop 55 IRBuilder<> loop(loopBB); 56 // The loop index (ind) is a phi node. 57 PHINode *ind = loop.CreatePHI(indType, 0); 62 Value *val = loop.CreateLoad(loop.CreateGEP(srcAddr, ind), srcVolatile); 64 loop.CreateStore(val, loop.CreateGEP(dstAddr, ind), dstVolatile); 67 Value *newind = loop.CreateAdd(ind, ConstantInt::get(indType, 1)); 70 loop [all...] |
/freebsd-10.0-release/usr.bin/what/ |
H A D | what.c | 118 loop: if (c != '@') 121 goto loop; 123 goto loop; 125 goto loop;
|