Searched refs:vuse (Results 1 - 5 of 5) sorted by relevance

/freebsd-9.3-release/contrib/gcc/
H A Dtree-vn.c198 tree vuse; local
204 FOR_EACH_SSA_TREE_OPERAND (vuse, stmt, iter, SSA_OP_VUSE)
205 VEC_safe_push (tree, gc, vuses, vuse);
221 tree vuse; local
228 FOR_EACH_SSA_TREE_OPERAND (vuse, stmt, iter, SSA_OP_VUSE)
229 VEC_safe_push (tree, gc, shared_lookup_vuses, vuse);
340 tree vuse; local
343 for (i = 0; VEC_iterate (tree, vuses, i, vuse); i++)
345 print_generic_expr (dump_file, vuse, dump_flags);
384 quicker on two vuse vec
[all...]
H A Dtree-ssa-propagate.c773 tree vuse; local
777 FOR_EACH_SSA_TREE_OPERAND (vuse, stmt, i, SSA_OP_VIRTUAL_USES)
779 val = &values[SSA_NAME_VERSION (vuse)];
910 use_operand_p vuse; local
956 FOR_EACH_SSA_USE_OPERAND (vuse, stmt, iter, SSA_OP_VIRTUAL_USES)
958 tree var = USE_FROM_PTR (vuse);
970 propagate_value (vuse, val);
H A Dtree-ssa-operands.c418 ALLOC_OPTYPE (new, vuse);
710 /* Takes elements from build_vuses and turns them into vuse operands of
745 MOVE_HEAD_TO_FREELIST (old_ops, vuse);
810 tree vuse; local
811 vuse = VEC_index (tree, build_vuses, vuse_index);
812 if (TREE_CODE (vuse) != SSA_NAME)
814 var_ann_t ann = var_ann (vuse);
H A Dtree-ssa-pre.c1501 /* Given the vuse representative map, MAP, and an SSA version number,
1513 /* A vuse is anticipable at the top of block x, from the bottom of the
1515 block. In effect, we are trying to see if the vuse is transparent
1522 tree vuse; local
1524 for (i = 0; VEC_iterate (tree, vuses, i, vuse); i++)
1529 if (!bitmap_bit_p (RVUSE_IN (block), SSA_NAME_VERSION (vuse))
1530 || bitmap_bit_p (RVUSE_KILL (block), SSA_NAME_VERSION (vuse)))
1840 /* Compute a set of representative vuse versions for each phi. This
2550 tree vuse; local
2552 VEC_iterate (tree, VALUE_HANDLE_VUSES (vh), i, vuse);
3099 tree vuse; local
[all...]
H A Dtree-ssa-dom.c1987 tree vuse; local
2002 /* Add the SSA version numbers of every vuse operand. This is important
2006 FOR_EACH_SSA_TREE_OPERAND (vuse, stmt, iter, SSA_OP_VUSE)
2007 val = iterative_hash_expr (vuse, val);

Completed in 109 milliseconds