Searched refs:visited (Results 1 - 25 of 80) sorted by relevance

1234

/netbsd-6-1-5-RELEASE/usr.bin/nbperf/
H A Dnbperf-bdz.c73 uint32_t *visited; member in struct:state
93 if (!state->visited[e->left]) {
96 } else if (!state->visited[e->middle]) {
100 if (state->visited[e->right])
106 state->visited[t] = 2 + j;
107 if (state->visited[e->left] == 0)
108 state->visited[e->left] = 1;
109 if (state->visited[e->middle] == 0)
110 state->visited[e->middle] = 1;
111 if (state->visited[
[all...]
H A Dgraph2.h55 uint8_t *visited; member in struct:graph2
H A Dnbperf-chm.c87 uint8_t *visited; member in struct:state
106 if (!state->visited[e->left]) {
110 } else if (!state->visited[e->middle]) {
119 state->visited[e->left] = 1;
120 state->visited[e->middle] = 1;
121 state->visited[e->right] = 1;
123 if (!state->visited[e->left]) {
130 state->visited[e->left] = 1;
131 state->visited[e->right] = 1;
241 state.visited
[all...]
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/
H A Dcfganal.c170 sbitmap visited;
181 /* Allocate bitmap to track nodes that have been visited. */
182 visited = sbitmap_alloc (last_basic_block);
184 /* None of the nodes in the CFG have been visited yet. */
185 sbitmap_zero (visited);
202 /* Check if the edge destination has been visited yet. */
203 if (dest != EXIT_BLOCK_PTR && ! TEST_BIT (visited, dest->index))
205 /* Mark that we have visited the destination. */
206 SET_BIT (visited, dest->index);
211 /* Since the DEST node has been visited fo
168 sbitmap visited; local
662 sbitmap visited; local
771 sbitmap visited = sbitmap_alloc (last_basic_block); local
819 sbitmap visited; local
957 sbitmap visited; local
1165 static sbitmap visited; local
[all...]
H A Dtree-ssa-alias.c1469 tree vuse, bitmap *visited)
1471 if (!*visited)
1472 *visited = BITMAP_ALLOC (NULL);
1474 bitmap_set_bit (*visited, SSA_NAME_VERSION (PHI_RESULT (phi)));
1483 /* An already visited PHI node ends the walk successfully. */
1484 if (bitmap_bit_p (*visited, SSA_NAME_VERSION (PHI_RESULT (def_stmt))))
1486 vuse = get_continuation_for_phi (def_stmt, ref, visited);
1507 get_continuation_for_phi (gimple phi, ao_ref *ref, bitmap *visited) argument
1532 if (maybe_skip_until (phi, arg0, ref, arg1, visited))
1539 if (maybe_skip_until (phi, arg1, ref, arg0, visited))
1468 maybe_skip_until(gimple phi, tree target, ao_ref *ref, tree vuse, bitmap *visited) argument
1590 bitmap visited = NULL; local
1655 walk_aliased_vdefs_1(ao_ref *ref, tree vdef, bool (*walker)(ao_ref *, tree, void *), void *data, bitmap *visited, unsigned int cnt) argument
1693 walk_aliased_vdefs(ao_ref *ref, tree vdef, bool (*walker)(ao_ref *, tree, void *), void *data, bitmap *visited) argument
[all...]
H A Dmatrix-reorg.c793 int level, sbitmap visited)
803 analyze_matrix_allocation_site (mi, def, level, visited);
1135 int current_indirect_level, sbitmap visited,
1177 if (!TEST_BIT (visited, SSA_NAME_VERSION (PHI_RESULT (use_stmt))))
1179 SET_BIT (visited, SSA_NAME_VERSION (PHI_RESULT (use_stmt)));
1181 current_indirect_level, false, visited,
1183 RESET_BIT (visited, SSA_NAME_VERSION (PHI_RESULT (use_stmt)));
1194 bool last_op, sbitmap visited,
1239 analyze_matrix_allocation_site (mi, def_stmt, l, visited);
1327 analyze_matrix_allocation_site (mi, use_stmt, l, visited);
792 analyze_matrix_allocation_site(struct matrix_info *mi, gimple stmt, int level, sbitmap visited) argument
1134 analyze_accesses_for_phi_node(struct matrix_info *mi, gimple use_stmt, int current_indirect_level, sbitmap visited, bool record_accesses) argument
1192 analyze_accesses_for_assign_stmt(struct matrix_info *mi, tree ssa_var, gimple use_stmt, int current_indirect_level, bool last_op, sbitmap visited, bool record_accesses) argument
1354 analyze_matrix_accesses(struct matrix_info *mi, tree ssa_var, int current_indirect_level, bool last_op, sbitmap visited, bool record_accesses) argument
1448 can_calculate_stmt_before_stmt(gimple stmt, sbitmap visited) argument
1520 can_calculate_expr_before_stmt(tree expr, sbitmap visited) argument
1574 sbitmap visited; local
[all...]
H A Dtree-outof-ssa.c78 sbitmap visited; member in struct:_elim_graph
80 /* Stack for visited nodes. */
349 g->visited = sbitmap_alloc (size);
371 sbitmap_free (g->visited);
551 SET_BIT (g->visited, T);
554 if (!TEST_BIT (g->visited, S))
571 if (!TEST_BIT (g->visited, P))
585 SET_BIT (g->visited, T);
588 if (!TEST_BIT (g->visited, P))
630 if (!TEST_BIT (g->visited,
[all...]
H A Dtree-ssa-copy.c428 sbitmap visited; local
435 visited = sbitmap_alloc (num_ssa_names);
436 sbitmap_zero (visited);
437 SET_BIT (visited, SSA_NAME_VERSION (var));
450 if (TEST_BIT (visited, SSA_NAME_VERSION (val)))
452 SET_BIT (visited, SSA_NAME_VERSION (val));
463 sbitmap_free (visited);
H A Dtree-ssa-live.c884 LIVE into the predecessors. VISITED is the bitmap of visited blocks.
889 loe_visit_block (tree_live_info_p live, basic_block bb, sbitmap visited, argument
897 gcc_assert (!TEST_BIT (visited, bb->index));
899 SET_BIT (visited, bb->index);
914 changes, and pred_bb has been visited already, add it to the
917 if (TEST_BIT (visited, pred_bb->index) && change)
919 RESET_BIT (visited, pred_bb->index);
934 sbitmap visited = sbitmap_alloc (last_basic_block + 1); local
937 sbitmap_zero (visited);
942 loe_visit_block (live, bb, visited, tm
[all...]
H A Dtree-stdarg.c52 sbitmap visited; local
61 visited = sbitmap_alloc (last_basic_block);
62 sbitmap_zero (visited);
93 if (! TEST_BIT (visited, src->index))
95 SET_BIT (visited, src->index);
102 sbitmap_free (visited);
H A Dtree-if-conv.c1052 /* Return TRUE iff, all pred blocks of BB are visited.
1053 Bitmap VISITED keeps history of visited blocks. */
1056 pred_blocks_visited_p (basic_block bb, bitmap *visited) argument
1061 if (!bitmap_bit_p (*visited, e->src->index))
1078 bitmap visited; local
1086 visited = BITMAP_ALLOC (NULL);
1098 BITMAP_FREE (visited);
1102 if (!bitmap_bit_p (visited, bb->index))
1104 if (pred_blocks_visited_p (bb, &visited)
1107 /* This block is now visited
[all...]
H A Dbb-reorder.c40 If the successor has not been visited in this trace it is added to the trace
42 If the successor has been visited in this trace the loop has been found.
299 /* The best edge is preferred when its destination is not visited yet
312 && e->dest->il.rtl->visited != trace_n
319 if (!e->dest->il.rtl->visited
335 if (!e->dest->il.rtl->visited
403 /* This function marks BB that it was visited in trace number TRACE. */
408 bb->il.rtl->visited = trace;
489 fprintf (dump_file, "Basic block %d was visited in trace %d\n",
502 if (e->dest->il.rtl->visited
[all...]
/netbsd-6-1-5-RELEASE/gnu/dist/gcc4/gcc/
H A Dcfganal.c168 sbitmap visited;
179 /* Allocate bitmap to track nodes that have been visited. */
180 visited = sbitmap_alloc (last_basic_block);
182 /* None of the nodes in the CFG have been visited yet. */
183 sbitmap_zero (visited);
200 /* Check if the edge destination has been visited yet. */
201 if (dest != EXIT_BLOCK_PTR && ! TEST_BIT (visited, dest->index))
203 /* Mark that we have visited the destination. */
204 SET_BIT (visited, dest->index);
209 /* Since the DEST node has been visited fo
166 sbitmap visited; local
656 sbitmap visited; local
725 sbitmap visited; local
912 static sbitmap visited; local
[all...]
H A Dtracer.c69 #define seen(bb) (bb->il.rtl->visited || bb->aux)
297 bb2->il.rtl->visited = 1;
338 && !e->dest->il.rtl->visited
345 best->dest->il.rtl->visited = 1;
350 if (!bb->il.rtl->visited)
353 bb->il.rtl->visited = 1;
H A Dtree-ssa-copy.c503 sbitmap visited; local
510 visited = sbitmap_alloc (num_ssa_names);
511 sbitmap_zero (visited);
512 SET_BIT (visited, SSA_NAME_VERSION (var));
525 if (TEST_BIT (visited, SSA_NAME_VERSION (val)))
527 SET_BIT (visited, SSA_NAME_VERSION (val));
538 sbitmap_free (visited);
H A Dtree-ssa.c101 /* Return true if SSA_NAME is malformed and mark it visited.
377 bitmap visited = BITMAP_ALLOC (NULL); local
393 bitmap_set_bit (visited, DECL_UID (alias));
411 && !bitmap_bit_p (visited, DECL_UID (var)))
418 BITMAP_FREE (visited);
589 /* Lastly, clear out the visited flags. */
995 VISITED is a pointer set used to mark visited SSA_NAMEs to avoid
997 SSA versions we had visited. But non-sparse bitmaps are way too
1003 visited first and then FN is called with each of the visited
1007 walk_use_def_chains_1(tree var, walk_use_def_chains_fn fn, void *data, struct pointer_set_t *visited, bool is_dfs) argument
1092 struct pointer_set_t *visited = pointer_set_create (); local
[all...]
H A Dtree-stdarg.c53 sbitmap visited; local
65 visited = sbitmap_alloc (last_basic_block);
66 sbitmap_zero (visited);
98 if (! TEST_BIT (visited, src->index))
100 SET_BIT (visited, src->index);
107 sbitmap_free (visited);
H A Dtree-if-conv.c1036 /* Return TRUE iff, all pred blocks of BB are visited.
1037 Bitmap VISITED keeps history of visited blocks. */
1040 pred_blocks_visited_p (basic_block bb, bitmap *visited) argument
1045 if (!bitmap_bit_p (*visited, e->src->index))
1062 bitmap visited; local
1070 visited = BITMAP_ALLOC (NULL);
1082 BITMAP_FREE (visited);
1086 if (!bitmap_bit_p (visited, bb->index))
1088 if (pred_blocks_visited_p (bb, &visited)
1091 /* This block is now visited
[all...]
H A Dbb-reorder.c40 If the successor has not been visited in this trace it is added to the trace
42 If the successor has been visited in this trace the loop has been found.
302 /* The best edge is preferred when its destination is not visited yet
315 && e->dest->il.rtl->visited != trace_n
322 if (!e->dest->il.rtl->visited
338 if (!e->dest->il.rtl->visited
406 /* This function marks BB that it was visited in trace number TRACE. */
411 bb->il.rtl->visited = trace;
492 fprintf (dump_file, "Basic block %d was visited in trace %d\n",
505 if (e->dest->il.rtl->visited
[all...]
/netbsd-6-1-5-RELEASE/sbin/fsck_lfs/
H A Dpass0.c108 char *visited; local
115 visited = ecalloc(maxino, sizeof(*visited));
130 if (visited[ino]) {
141 visited[ino] = 1;
171 if (visited[ino])
/netbsd-6-1-5-RELEASE/external/gpl3/gcc/dist/gcc/testsuite/gcc.dg/
H A D20070725-1.c35 unsigned visited:1; member in struct:tree_base
/netbsd-6-1-5-RELEASE/lib/libc/cdb/
H A Dcdbw.c302 char *visited; member in struct:state
457 if (!state->visited[e->left]) {
462 } else if (!state->visited[e->middle]) {
473 state->visited[e->left] = 1;
474 state->visited[e->middle] = 1;
475 state->visited[e->right] = 1;
592 NALLOC(state.visited, state.entries);
598 if (state.g == NULL || state.visited == NULL || state.verts == NULL ||
617 free(state.visited);
/netbsd-6-1-5-RELEASE/dist/bzip2/
H A Dbzip.css13 a, a:link, a:visited, a:active { color: #336699; }
/netbsd-6-1-5-RELEASE/sys/dev/raidframe/
H A Drf_dag.h124 int visited; /* used to avoid re-visiting nodes on DAG member in struct:RF_DagNode_s
H A Drf_dagutils.c123 node->visited = 0;
567 node->visited = (unvisited) ? 0 : 1;
600 if (node->succedents[i]->visited == unvisited)
626 /* find out if visited bits are currently set or clear */
627 unvisited = dag_h->succedents[0]->visited;
639 if (dag_h->succedents[i]->visited == unvisited)
652 unvisited = dag_h->succedents[0]->visited;
657 if (node->visited == unvisited) {
669 node->visited = (unvisited) ? 0 : 1;
673 if (node->succedents[i]->visited
[all...]

Completed in 414 milliseconds

1234