Home
last modified time | relevance | path

Searched refs:parray (Results 1 – 25 of 31) sorted by relevance

12

/freebsd-12.1/contrib/gcc/
H A Dcfgloop.c192 if (loops->parray) in flow_loops_free()
209 free (loops->parray); in flow_loops_free()
210 loops->parray = NULL; in flow_loops_free()
282 loop = loops->parray[i]; in mark_single_exit_loops()
316 loop = loops->parray[i]; in mark_single_exit_loops()
673 loops->parray[0]->next = NULL; in flow_loops_find()
676 loops->parray[0]->depth = 0; in flow_loops_find()
1074 if (!loops->parray[i]) in verify_loop_structure()
1088 loop = loops->parray[i]; in verify_loop_structure()
1106 loop = loops->parray[i]; in verify_loop_structure()
[all …]
H A Dcfgloopmanip.c547 loops->parray[loop->num] = NULL; in unloop()
629 loops->parray = in place_new_loop()
630 xrealloc (loops->parray, (loops->num + 1) * sizeof (struct loop *)); in place_new_loop()
631 loops->parray[loops->num] = loop; in place_new_loop()
1180 create_preheader (loops->parray[i], flags); in create_preheaders()
1195 loop = loops->parray[i]; in force_single_succ_latches()
1418 loop = loops->parray[i]; in fix_loop_structure()
1435 loops->parray[loop->num] = NULL; in fix_loop_structure()
1462 loop = loops->parray[i]; in fix_loop_structure()
H A Dloop-init.c116 if (loops->parray[i]) in loop_optimizer_finalize()
117 free_simple_loop_desc (loops->parray[i]); in loop_optimizer_finalize()
H A Dtree-ssa-loop-ivcanon.c342 loop = loops->parray[i]; in canonicalize_induction_variables()
373 loop = loops->parray[i]; in tree_unroll_loops_completely()
H A Dtree-scalar-evolution.c378 struct loop *loop = current_loops->parray[loop_nb]; in chrec_contains_symbols_defined_in_loop()
471 current_loops->parray[CHREC_VARIABLE (evolution_fn)]; in compute_overall_effect_of_inner_loop()
538 (current_loops->parray[CHREC_VARIABLE (chrec)]); in chrec_is_positive()
1022 struct loop *function_body = loops->parray[0]; in select_loops_exit_conditions()
2761 if (loops->parray[i]) in scev_initialize()
2762 loops->parray[i]->nb_iterations = NULL_TREE; in scev_initialize()
2779 loop = current_loops->parray[i]; in scev_reset()
2957 loop = current_loops->parray[i]; in scev_const_prop()
H A Dtree-ssa-loop-ch.c153 loop = loops->parray[i]; in copy_loop_headers()
H A Dtree-ssa-loop-unswitch.c96 loop = loops->parray[i]; in tree_ssa_unswitch_loops()
H A Dcfgloopanal.c343 if (loops->parray[i]) in mark_irreducible_loops()
344 queue1[nq++] = LOOP_REPR (loops->parray[i]); in mark_irreducible_loops()
H A Dcfgloop.h157 struct loop **parray; member
H A Dtree-loop-linear.c254 struct loop *loop_nest = loops->parray[i]; in linear_transform_loops()
H A Dtree-chrec.c942 && expr_invariant_in_loop_p (current_loops->parray[loopnum], in evolution_function_is_invariant_rec_p()
1283 loop = current_loops->parray[CHREC_VARIABLE (chrec)]; in chrec_convert_1()
H A Dloop-unswitch.c151 loop = loops->parray[i]; in unswitch_loops()
H A Dloop-invariant.c1346 if (loops->parray[i]) in move_loop_invariants()
1347 free_loop_data (loops->parray[i]); in move_loop_invariants()
H A Dloop-doloop.c626 loop = loops->parray[i]; in doloop_optimize_loops()
H A Dtree-vectorizer.c2054 struct loop *loop = loops->parray[i]; in vectorize_loops()
2081 struct loop *loop = loops->parray[i]; in vectorize_loops()
H A Dtree-ssa-loop-prefetch.c1050 loop = loops->parray[i]; in tree_ssa_prefetch_arrays()
H A Dtree-ssa-loop-niter.c1904 loop = loops->parray[i]; in estimate_numbers_of_iterations()
2110 loop = loops->parray[i]; in free_numbers_of_iterations_estimates()
H A Dtree-if-conv.c1142 loop = current_loops->parray[i]; in main_tree_if_conversion()
H A Dmodulo-sched.c957 struct loop *loop = loops->parray[i]; in sms_schedule()
1070 struct loop *loop = loops->parray[i]; in sms_schedule()
H A Dtree-data-ref.c2409 tree numiter = number_of_iterations_in_loop (current_loops->parray[loopnum]); in get_number_of_iters_for_loop()
2412 numiter = current_loops->parray[loopnum]->estimated_nb_iterations; in get_number_of_iters_for_loop()
4390 compute_data_dependences_for_loop (loops->parray[0], false,
H A Dloop-unroll.c242 loop = loops->parray[i]; in peel_loops_completely()
/freebsd-12.1/sys/netinet/
H A Dtcp_lro.c442 temp = parray[x]; in tcp_lro_sort()
444 parray[y] = parray[y - 1]; in tcp_lro_sort()
445 parray[y] = temp; in tcp_lro_sort()
454 ones |= parray[x].seq; in tcp_lro_sort()
455 zeros |= ~parray[x].seq; in tcp_lro_sort()
472 if (parray[y].seq & ones) in tcp_lro_sort()
475 temp = parray[x]; in tcp_lro_sort()
476 parray[x] = parray[y]; in tcp_lro_sort()
477 parray[y] = temp; in tcp_lro_sort()
484 tcp_lro_sort(parray, x); in tcp_lro_sort()
[all …]
/freebsd-12.1/contrib/libc++/src/
H A Dios.cpp209 void** parray = static_cast<void**>(realloc(__parray_, newcap * sizeof(void *))); in pword() local
210 if (parray == 0) in pword()
217 __parray_ = parray; in pword()
/freebsd-12.1/sys/dev/pms/RefTisa/sallsdk/spc/
H A Dsahw.c70 LOCAL bit32 siBar4Cpy(agsaRoot_t *agRoot, bit32 offset, bit8 *parray, bit32 array_size);
1844 bit8 * parray, in siBar4Cpy() argument
1871 siPciMemCpy(agRoot, dest_offset, parray, (bit32)(CEILING(cpy_size,4)), PCIBAR2); in siBar4Cpy()
1876 parray = parray + cpy_size; in siBar4Cpy()
/freebsd-12.1/contrib/gcc/doc/
H A Dloop.texi66 the corresponding field of the @code{parray} field of the loops
69 empty (@code{NULL}) entries in the @code{parray} created by deleting

12