Home
last modified time | relevance | path

Searched refs:num_edges (Results 1 – 20 of 20) sorted by relevance

/dflybsd-src/contrib/gcc-4.7/gcc/
H A Dlcm.c184 int x, num_edges; in compute_earliest() local
187 num_edges = NUM_EDGES (edge_list); in compute_earliest()
192 for (x = 0; x < num_edges; x++) in compute_earliest()
250 int num_edges, i; in compute_laterin() local
256 num_edges = NUM_EDGES (edge_list); in compute_laterin()
265 for (i = 0; i < num_edges; i++) in compute_laterin()
278 sbitmap_vector_ones (later, num_edges); in compute_laterin()
386 int num_edges; in pre_edge_lcm() local
389 num_edges = NUM_EDGES (edge_list); in pre_edge_lcm()
424 earliest = sbitmap_vector_alloc (num_edges, n_exprs); in pre_edge_lcm()
[all …]
H A Dprofile.c115 int num_edges = NUM_EDGES (el); in instrument_edges() local
139 total_num_blocks_created += num_edges; in instrument_edges()
236 unsigned num_edges = 0; in get_exec_counts() local
248 num_edges++; in get_exec_counts()
251 counts = get_coverage_counts (GCOV_COUNTER_ARCS, num_edges, cfg_checksum, in get_exec_counts()
387 int num_edges = 0; in read_profile_edge_counts() local
402 num_edges++; in read_profile_edge_counts()
437 return num_edges; in read_profile_edge_counts()
483 int num_edges = 0; in compute_branch_probabilities() local
525 num_edges = read_profile_edge_counts (exec_counts); in compute_branch_probabilities()
[all …]
H A Dcfganal.c347 int num_edges; in create_edge_list() local
354 num_edges = 0; in create_edge_list()
360 num_edges += EDGE_COUNT (bb->succs); in create_edge_list()
365 elist->num_edges = num_edges; in create_edge_list()
366 elist->index_to_edge = XNEWVEC (edge, num_edges); in create_edge_list()
368 num_edges = 0; in create_edge_list()
373 elist->index_to_edge[num_edges++] = e; in create_edge_list()
398 elist->num_blocks, elist->num_edges); in print_edge_list()
400 for (x = 0; x < elist->num_edges; x++) in print_edge_list()
543 flow_edge_list_print (const char *str, const edge *edge_list, int num_edges, FILE *file) in flow_edge_list_print() argument
[all …]
H A Dmcf.c119 int num_edges; member
290 fnum_edges = fixup_graph->num_edges; in dump_fixup_graph()
375 fixup_edge_p curr_edge = fixup_graph->edge_list + fixup_graph->num_edges; in add_edge()
379 fixup_graph->num_edges++; in add_edge()
554 gcc_assert (fixup_graph->num_edges <= fnum_edges_after_transform); in create_fixup_graph()
556 fnum_edges_after_transform = fixup_graph->num_edges; in create_fixup_graph()
655 fnum_edges = fixup_graph->num_edges; in create_fixup_graph()
802 fnum_edges = fixup_graph->num_edges; in cancel_negative_cycle()
942 fnum_edges = fixup_graph->num_edges; in compute_residual_flow()
1042 fnum_edges = fixup_graph->num_edges; in find_max_flow()
[all …]
H A Dcfglayout.c1436 edge *edges, unsigned num_edges, edge *new_edges, in copy_bbs() argument
1474 for (j = 0; j < num_edges; j++) in copy_bbs()
1484 for (j = 0; j < num_edges; j++) in copy_bbs()
H A Dbasic-block.h503 int num_edges; member
526 #define NUM_EDGES(el) ((el)->num_edges)
H A Dgcse.c2222 int e, i, j, num_edges, set_size, did_insert = 0; in pre_edge_insert() local
2229 num_edges = NUM_EDGES (edge_list); in pre_edge_insert()
2230 inserted = sbitmap_vector_alloc (num_edges, expr_hash_table.n_elems); in pre_edge_insert()
2231 sbitmap_vector_zero (inserted, num_edges); in pre_edge_insert()
2233 for (e = 0; e < num_edges; e++) in pre_edge_insert()
H A Dtree-cfg.c2130 long num_edges; in dump_cfg_stats() local
2152 num_edges = 0; in dump_cfg_stats()
2154 num_edges += EDGE_COUNT (bb->succs); in dump_cfg_stats()
2155 size = num_edges * sizeof (struct edge_def); in dump_cfg_stats()
2157 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size)); in dump_cfg_stats()
H A Dtree-ssa-structalias.c237 unsigned int num_edges; member
1149 stats.num_edges++; in add_graph_edge()
6254 fprintf (outfile, "Number of edges: %d\n", stats.num_edges); in dump_sa_points_to_info()
/dflybsd-src/contrib/gcc-8.0/gcc/
H A Dlcm.c173 int x, num_edges; in compute_earliest() local
176 num_edges = NUM_EDGES (edge_list); in compute_earliest()
179 for (x = 0; x < num_edges; x++) in compute_earliest()
234 int num_edges, i; in compute_laterin() local
240 num_edges = NUM_EDGES (edge_list); in compute_laterin()
249 for (i = 0; i < num_edges; i++) in compute_laterin()
262 bitmap_vector_ones (later, num_edges); in compute_laterin()
377 int num_edges; in pre_edge_lcm_avs() local
380 num_edges = NUM_EDGES (edge_list); in pre_edge_lcm_avs()
418 earliest = sbitmap_vector_alloc (num_edges, n_exprs); in pre_edge_lcm_avs()
[all …]
H A Dprofile.c126 int num_edges = NUM_EDGES (el); in instrument_edges() local
150 total_num_blocks_created += num_edges; in instrument_edges()
271 unsigned num_edges = 0; in get_exec_counts() local
283 num_edges++; in get_exec_counts()
286 counts = get_coverage_counts (GCOV_COUNTER_ARCS, num_edges, cfg_checksum, in get_exec_counts()
425 int num_edges = 0; in read_profile_edge_counts() local
440 num_edges++; in read_profile_edge_counts()
476 return num_edges; in read_profile_edge_counts()
490 int num_edges = 0; in compute_branch_probabilities() local
534 num_edges = read_profile_edge_counts (exec_counts); in compute_branch_probabilities()
[all …]
H A Dcfganal.c220 int num_edges; in create_edge_list() local
226 num_edges = 0; in create_edge_list()
230 num_edges += EDGE_COUNT (bb->succs); in create_edge_list()
234 elist->num_edges = num_edges; in create_edge_list()
235 elist->index_to_edge = XNEWVEC (edge, num_edges); in create_edge_list()
237 num_edges = 0; in create_edge_list()
243 elist->index_to_edge[num_edges++] = e; in create_edge_list()
268 n_basic_blocks_for_fn (cfun), elist->num_edges); in print_edge_list()
270 for (x = 0; x < elist->num_edges; x++) in print_edge_list()
432 int num_edges = 0; in control_dependences() local
[all …]
H A Dmcf.c111 int num_edges; member
282 fnum_edges = fixup_graph->num_edges; in dump_fixup_graph()
367 fixup_edge_p curr_edge = fixup_graph->edge_list + fixup_graph->num_edges; in add_edge()
371 fixup_graph->num_edges++; in add_edge()
550 gcc_assert (fixup_graph->num_edges <= fnum_edges_after_transform); in create_fixup_graph()
552 fnum_edges_after_transform = fixup_graph->num_edges; in create_fixup_graph()
651 fnum_edges = fixup_graph->num_edges; in create_fixup_graph()
798 fnum_edges = fixup_graph->num_edges; in cancel_negative_cycle()
938 fnum_edges = fixup_graph->num_edges; in compute_residual_flow()
1038 fnum_edges = fixup_graph->num_edges; in find_max_flow()
[all …]
H A Dcfganal.h28 int num_edges; member
H A Dcfghooks.c1334 edge *edges, unsigned num_edges, edge *new_edges, in copy_bbs() argument
1383 for (j = 0; j < num_edges; j++) in copy_bbs()
1393 for (j = 0; j < num_edges; j++) in copy_bbs()
H A Dgcse.c2117 int e, i, j, num_edges, set_size, did_insert = 0; in pre_edge_insert() local
2124 num_edges = NUM_EDGES (edge_list); in pre_edge_insert()
2125 inserted = sbitmap_vector_alloc (num_edges, expr_hash_table.n_elems); in pre_edge_insert()
2126 bitmap_vector_clear (inserted, num_edges); in pre_edge_insert()
2128 for (e = 0; e < num_edges; e++) in pre_edge_insert()
H A Dbasic-block.h290 #define NUM_EDGES(el) ((el)->num_edges)
H A Dtree-cfg.c2568 long num_edges; in dump_cfg_stats() local
2588 num_edges = 0; in dump_cfg_stats()
2590 num_edges += EDGE_COUNT (bb->succs); in dump_cfg_stats()
2591 size = num_edges * sizeof (struct edge_def); in dump_cfg_stats()
2593 fprintf (file, fmt_str_2, "Edges", num_edges, SCALE (size), LABEL (size)); in dump_cfg_stats()
H A Dtree-ssa-structalias.c233 unsigned int num_edges; member
1185 stats.num_edges++; in add_graph_edge()
6851 fprintf (outfile, "Number of edges: %d\n", stats.num_edges); in dump_sa_points_to_info()
/dflybsd-src/sys/contrib/dev/ath/ath_hal/ar9300/
H A Dar9300_eeprom.c2436 u_int16_t num_edges = is_2ghz ? in ar9300_eep_def_get_max_edge_power() local
2441 for (i = 0; (i < num_edges) && (ctl_freqbin[i] != AR9300_BCHAN_UNUSED); i++) in ar9300_eep_def_get_max_edge_power()