Home
last modified time | relevance | path

Searched refs:l (Results 201 – 225 of 13066) sorted by last modified time

12345678910>>...523

/netbsd/external/gpl3/gcc/dist/gcc/
H A Dvalue-range.h275 tree l = m_base[0]; in varying_compatible_p() local
277 tree t = TREE_TYPE (l); in varying_compatible_p()
285 return (wi::to_wide (l) == wi::min_value (prec, sign) in varying_compatible_p()
288 return (wi::to_wide (l) == 0 in varying_compatible_p()
H A Dvar-tracking.cc2151 for (l = var->var_part[0].loc_chain; l; l = l->next) in get_addr_from_local_cache()
2482 if (l && GET_CODE (l->loc) == VALUE) in val_bind()
2483 l = canonical_cselib_val (CSELIB_VAL_PTR (l->loc))->locs; in val_bind()
2488 while (l) in val_bind()
2492 l = l->next; in val_bind()
2494 if (!l) in val_bind()
2530 for (l = v->locs; l; l = l->next) in val_store()
5907 for (l = v->locs, count = 0; l; l = l->next, count++) in reverse_op()
6487 for (l = val->locs; l; l = l->next) in prepare_call_arguments()
8653 if ((l) && MEM_P (l)) \
[all …]
H A Dtree-vect-stmts.cc4315 unsigned int k, l, m, o; in vectorizable_simd_clone_call() local
4369 for (l = 0; l < k; l++) in vectorizable_simd_clone_call()
4371 if (m == 0 && l == 0) in vectorizable_simd_clone_call()
4512 unsigned int k, l; in vectorizable_simd_clone_call() local
4518 for (l = 0; l < k; l++) in vectorizable_simd_clone_call()
4525 build_int_cst (TREE_TYPE (t), l * bytes)); in vectorizable_simd_clone_call()
4529 bitsize_int (prec), bitsize_int (l * prec)); in vectorizable_simd_clone_call()
4533 if (j == 0 && l == 0) in vectorizable_simd_clone_call()
H A Dtree.cc1694 int l = pcst.get_len (); in wide_int_to_tree_1() local
1695 if (l > 1) in wide_int_to_tree_1()
1697 if (pcst.elt (l - 1) == 0) in wide_int_to_tree_1()
3077 if (l >= 0) in tree_ctz()
3080 ret2 = l; in tree_ctz()
13859 for (tree l = TYPE_VALUES (t); l; l = TREE_CHAIN (l)) in verify_type() local
13861 tree value = TREE_VALUE (l); in verify_type()
13862 tree name = TREE_PURPOSE (l); in verify_type()
13969 for (tree l = TYPE_ARG_TYPES (t); l; l = TREE_CHAIN (l)) in verify_type() local
13975 debug_tree (l); in verify_type()
[all …]
H A Dtree-vect-slp.cc5414 unsigned l = gimple_bb (cost->stmt_info->stmt)->loop_father->num; in vect_bb_vectorization_profitable_p() local
5415 li_scalar_costs.quick_push (std::make_pair (l, cost)); in vect_bb_vectorization_profitable_p()
5419 unsigned l = li_scalar_costs[0].first; in vect_bb_vectorization_profitable_p() local
5425 l = gimple_bb (cost->stmt_info->stmt)->loop_father->num; in vect_bb_vectorization_profitable_p()
5426 li_vector_costs.quick_push (std::make_pair (l, cost)); in vect_bb_vectorization_profitable_p()
H A Dtree-switch-conversion.cc1183 unsigned l = clusters.length (); in find_jump_tables() local
1185 min.reserve (l + 1); in find_jump_tables()
1230 if (min[l].m_count == l) in find_jump_tables()
1237 for (unsigned int end = l;;) in find_jump_tables()
1323 unsigned l = clusters.length (); in find_bit_tests() local
1325 min.reserve (l + 1); in find_bit_tests()
1345 if (min[l].m_count == l) in find_bit_tests()
1352 for (unsigned end = l;;) in find_bit_tests()
1767 clusters.create (l - 1); in analyze_switch_statement()
1770 m_case_bbs.reserve (l); in analyze_switch_statement()
[all …]
H A Dtree-vect-data-refs.cc6451 unsigned int k = 0, l = 0; in vect_shift_permute_load_chain() local
6457 if (3 * k + (l % 3) >= nelt) in vect_shift_permute_load_chain()
6460 l += (3 - (nelt % 3)); in vect_shift_permute_load_chain()
6462 sel[i] = 3 * k + (l % 3); in vect_shift_permute_load_chain()
H A Dtree-vect-loop-manip.cc3630 class loop *l = loop; in vect_loop_versioning() local
3631 while (gimple *call = vect_loop_vectorized_call (l)) in vect_loop_versioning()
3635 l = loop_outer (l); in vect_loop_versioning()
H A Dtree-ssa-loop.cc616 int l = strlen (s) + lsm_tmp_name_length; in lsm_tmp_name_add() local
617 if (l > MAX_LSM_NAME_LENGTH) in lsm_tmp_name_add()
621 lsm_tmp_name_length = l; in lsm_tmp_name_add()
H A Dtree-ssa-reassoc.cc3533 int l = wi::clz (w); in optimize_range_tests_cmp_bitwise() local
3535 if (l <= 0 in optimize_range_tests_cmp_bitwise()
3536 || l >= prec in optimize_range_tests_cmp_bitwise()
3537 || w != wi::mask (prec - l, false, prec)) in optimize_range_tests_cmp_bitwise()
3648 unsigned l = candidates.length (); in optimize_range_tests_cmp_bitwise() local
3683 if (id == l) in optimize_range_tests_cmp_bitwise()
3692 if (id >= l && !useless_type_conversion_p (type1, type)) in optimize_range_tests_cmp_bitwise()
3702 g = gimple_build_assign (make_ssa_name (id >= l ? type1 : type2), in optimize_range_tests_cmp_bitwise()
H A Dtree-ssa-loop-ch.cc52 entry_loop_condition_is_static (class loop *l, path_range_query *query) in entry_loop_condition_is_static() argument
54 edge e = loop_preheader_edge (l); in entry_loop_condition_is_static()
66 if (!loop_exit_edge_p (l, true_e) && !loop_exit_edge_p (l, false_e)) in entry_loop_condition_is_static()
70 if (loop_exit_edge_p (l, true_e)) in entry_loop_condition_is_static()
H A Dtree-ssa-loop-im.cc1885 mem_ref_loc *l = &ref->accesses_in_loop[i]; in for_all_locs_in_loop() local
1886 if (!flow_bb_inside_loop_p (loop, gimple_bb (l->stmt))) in for_all_locs_in_loop()
1888 if (fn (l)) in for_all_locs_in_loop()
1894 mem_ref_loc *l = &ref->accesses_in_loop[i]; in for_all_locs_in_loop() local
1895 if (!flow_bb_inside_loop_p (loop, gimple_bb (l->stmt))) in for_all_locs_in_loop()
1897 if (fn (l)) in for_all_locs_in_loop()
3116 ref_in_loop_hot_body (class loop *loop_) : l (loop_) {} in ref_in_loop_hot_body()
3118 class loop *l; member in ref_in_loop_hot_body
3130 return get_coldest_out_loop (l, inner_loop, curr_bb); in operator ()()
H A Dtree-predcom.cc393 pcom_worker (loop_p l) : m_loop (l), m_cache (NULL) {} in pcom_worker() argument
H A Dtree-pretty-print.cc207 int l = 2; in dump_fancy_name() local
208 while (ISDIGIT (n[l])) in dump_fancy_name()
209 l++; in dump_fancy_name()
210 if (n[l] == '\0' || n[l] == '$') in dump_fancy_name()
213 length += 5 - l; in dump_fancy_name()
215 n += l; in dump_fancy_name()
239 int l = 2; in dump_fancy_name() local
241 l++; in dump_fancy_name()
242 if (q[l] == '\0' || q[l] == '$') in dump_fancy_name()
247 n = q + l; in dump_fancy_name()
[all …]
H A Dtree-diagnostic.cc189 location_t l = in maybe_unwind_expanded_macro_loc() local
192 if (l < RESERVED_LOCATION_COUNT || LINEMAP_SYSP (m)) in maybe_unwind_expanded_macro_loc()
199 int resolved_def_loc_line = SOURCE_LINE (m, l); in maybe_unwind_expanded_macro_loc()
H A Dtrans-mem.cc1095 struct tm_log_entry l, *lp; in tm_log_add() local
1097 l.addr = addr; in tm_log_add()
1098 slot = tm_log->find_slot (&l, INSERT); in tm_log_add()
1297 struct tm_log_entry l, *lp; in tm_log_emit_saves() local
1301 l.addr = tm_log_save_addresses[i]; in tm_log_emit_saves()
1302 lp = *(tm_log->find_slot (&l, NO_INSERT)); in tm_log_emit_saves()
1331 struct tm_log_entry l, *lp; in tm_log_emit_restores() local
1337 l.addr = tm_log_save_addresses[i]; in tm_log_emit_restores()
1338 lp = *(tm_log->find_slot (&l, NO_INSERT)); in tm_log_emit_restores()
H A Dtree-cfg.cc7764 struct loops *l = loops_for_fn (saved_cfun); in move_sese_region_to_fn() local
7766 = l->exits->find_slot_with_hash (e, htab_hash_pointer (e), in move_sese_region_to_fn()
7769 l->exits->clear_slot (slot); in move_sese_region_to_fn()
H A Dtree-cfgcleanup.cc596 location_t l = gimple_phi_arg_location_from_edge (phi, succ); in remove_forwarder_block() local
598 add_phi_arg (phi, unshare_expr (def), s, l); in remove_forwarder_block()
H A Dtree-chrec.cc563 tree l = chrec_convert (ctype, CHREC_LEFT (chrec), NULL); in chrec_evaluate() local
564 arg0 = fold_build2 (MULT_EXPR, ctype, l, binomial_n_k); in chrec_evaluate()
H A Dtree-complex.cc766 tree l = get_component_ssa_name (gimple_phi_result (phi), j > 0); in update_phi_components() local
767 if (TREE_CODE (l) == SSA_NAME) in update_phi_components()
768 p[j] = create_phi_node (l, bb); in update_phi_components()
1868 for (unsigned int l = 0; l < m; ++l) in tree_lower_complex() local
1870 tree op = gimple_phi_arg_def (phi, l); in tree_lower_complex()
1874 tree arg = gimple_phi_arg_def (phis_to_revisit[j], l); in tree_lower_complex()
1876 SET_PHI_ARG_DEF (phi, l, op); in tree_lower_complex()
H A Dsymtab.cc578 unsigned l = strlen (fname); in get_dump_name() local
580 char *s = (char *)ggc_internal_cleared_alloc (l + EXTRA); in get_dump_name()
581 snprintf (s, l + EXTRA, "%s/%d", fname, order); in get_dump_name()
H A Dsel-sched.cc5180 ilist_t l = BND_PTR (bnd); in prepare_place_to_insert() local
5181 while ((l = ILIST_NEXT (l)) && in prepare_place_to_insert()
5182 DEBUG_INSN_P (ILIST_INSN (l))) in prepare_place_to_insert()
5184 if (!l) in prepare_place_to_insert()
H A Dsort.cc210 char *mid = in + sz, *r = out + sz, *l = in == out ? tmp : in; in mergesort() local
214 mergesort (in, c, nl, l, mid); in mergesort()
218 intptr_t mr = c->cmp (r, l) >> 31; \ in mergesort()
219 intptr_t lr = (intptr_t)l ^ (intptr_t)r; \ in mergesort()
220 lr = (intptr_t)l ^ (lr & mr); \ in mergesort()
225 l += ~mr & SIZE; \ in mergesort()
228 if (likely (c->cmp(r, l + (r - out) - c->size) < 0)) in mergesort()
238 memcpy (out, l, r - out); in mergesort()
H A Dsel-sched-dump.cc517 dump_flist (flist_t l) in dump_flist() argument
519 while (l) in dump_flist()
521 dump_insn_1 (FENCE_INSN (FLIST_FENCE (l)), dump_flist_insn_flags); in dump_flist()
523 l = FLIST_NEXT (l); in dump_flist()
H A Dsel-sched-ir.cc167 ilist_copy (ilist_t l) in ilist_copy() argument
171 while (l) in ilist_copy()
175 l = ILIST_NEXT (l); in ilist_copy()
183 ilist_invert (ilist_t l) in ilist_invert() argument
187 while (l) in ilist_invert()
190 l = ILIST_NEXT (l); in ilist_invert()
229 FLIST_TAIL_HEAD (l) = NULL; in flist_tail_init()
230 FLIST_TAIL_TAILP (l) = &FLIST_TAIL_HEAD (l); in flist_tail_init()
237 while (l) in flist_lookup()
240 return FLIST_FENCE (l); in flist_lookup()
[all …]

12345678910>>...523