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

/freebsd-11.0-release/contrib/gcc/
H A Dtree-ssa-threadedge.c131 SSA_NAME_VALUE (dest) = prev_value;
142 tree prev_x = SSA_NAME_VALUE (x);
146 tree tmp = SSA_NAME_VALUE (y);
150 SSA_NAME_VALUE (x) = y;
289 tmp = SSA_NAME_VALUE (use);
383 tree tmp = SSA_NAME_VALUE (op0);
390 tree tmp = SSA_NAME_VALUE (op1);
454 It is possible to get loops in the SSA_NAME_VALUE chains
459 && SSA_NAME_VALUE (cached_lhs))
460 cached_lhs = SSA_NAME_VALUE (cached_lh
[all...]
H A Dtree-ssa-dom.c328 /* Finally, remove everything except invariants in SSA_NAME_VALUE.
330 Long term we will be able to let everything in SSA_NAME_VALUE
340 value = SSA_NAME_VALUE (name);
342 SSA_NAME_VALUE (name) = NULL;
544 SSA_NAME_VALUE (dest) = prev_value;
766 SSA_NAME_VALUE (lhs) = rhs;
1076 SSA_NAME_VALUE (x) = y;
1118 tree prev_x = SSA_NAME_VALUE (x);
1122 tree tmp = SSA_NAME_VALUE (y);
1139 prev_x = SSA_NAME_VALUE (
[all...]
H A Dtree-vn.c182 SSA_NAME_VALUE (e) = v;
437 return SSA_NAME_VALUE (expr);
H A Dprint-tree.c838 || SSA_NAME_VALUE (node))
843 if (SSA_NAME_VALUE (node))
844 dump_addr (file, " value ", SSA_NAME_VALUE (node));
H A Dtree-ssa-ccp.c315 3- If SSA_NAME_VALUE is set and it is a constant, its value is
338 else if (SSA_NAME_VALUE (var)
339 && is_gimple_min_invariant (SSA_NAME_VALUE (var)))
342 val.value = SSA_NAME_VALUE (var);
H A Dtree-ssa-propagate.c503 SSA_NAME_VALUE (ssa_name (i)) = NULL_TREE;
H A Dtree-ssa-pre.c3875 if (SSA_NAME_VALUE (name)
3876 && TREE_CODE (SSA_NAME_VALUE (name)) == VALUE_HANDLE)
3877 SSA_NAME_VALUE (name) = NULL;
H A Dtree.h1736 #define SSA_NAME_VALUE(N) \
1729 #define SSA_NAME_VALUE macro

Completed in 116 milliseconds