Searched refs:TREE_VISITED (Results 1 - 8 of 8) sorted by relevance

/freebsd-11.0-release/contrib/gcc/
H A Dtree-ssa-propagate.h26 /* Use the TREE_VISITED bitflag to mark statements and PHI nodes that
28 #define DONT_SIMULATE_AGAIN(T) TREE_VISITED (T)
H A Dtree-ssa.c227 if (!TREE_VISITED (ssa_name))
231 TREE_VISITED (ssa_name) = 1;
445 if (!POINTER_TYPE_P (TREE_TYPE (ptr)) || !TREE_VISITED (ptr))
526 if (!TREE_VISITED (ptr)
530 || TREE_VISITED (pi->name_mem_tag))
533 TREE_VISITED (pi->name_mem_tag) = 1;
594 if (!TREE_VISITED (ptr)
599 TREE_VISITED (pi->name_mem_tag) = 0;
695 TREE_VISITED (name) = 0;
H A Dtree-ssa-reassoc.c984 TREE_VISITED (binrhs) = 1;
985 TREE_VISITED (binlhs) = 1;
986 TREE_VISITED (stmt) = 1;
1127 TREE_VISITED (stmt) = 1;
1273 TREE_VISITED (stmt) = 0;
1318 if (TREE_VISITED (stmt))
1339 TREE_VISITED (stmt) = 1;
H A Dgimplify.c827 *TP. If *TP has been visited already (i.e., TREE_VISITED (*TP) == 1),
850 if (TREE_VISITED (t))
853 TREE_VISITED (t) = 1;
858 else if (TREE_VISITED (t))
866 TREE_VISITED (t) = 1;
875 if (TREE_VISITED (*tp))
876 TREE_VISITED (*tp) = 0;
H A Dprint-tree.c310 if (TREE_VISITED (node))
H A Dtree-into-ssa.c239 /* Use TREE_VISITED to keep track of which statements we want to
242 #define REWRITE_THIS_STMT(T) TREE_VISITED (T)
H A Dtree.h2074 #define TREE_VISITED(NODE) ((NODE)->common.visited)
2063 #define TREE_VISITED macro
H A Dtree.c631 TREE_VISITED (t) = 0;

Completed in 119 milliseconds