| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-phiprop.cc | 98 tree vuse; member in struct:phiprop_d
107 tree vuse = phivn[SSA_NAME_VERSION (name)].vuse; local
113 gcc_assert (vuse != NULL_TREE);
115 FOR_EACH_IMM_USE_STMT (use_stmt, ui2, vuse)
196 tree vuse = NULL_TREE; local
201 vuse = PHI_ARG_DEF_FROM_EDGE (vphi, e);
203 vuse = gimple_vuse (use_stmt);
208 to split the existing VUSE lifetime. Leave that to
220 if (vuse)
341 tree vuse; local
[all...] |
| tree-ssa-sccvn.cc | 546 /* Return the SSA value of the VUSE x, supporting released VDEFs
548 associated VUSE (but not substitute in the whole lattice). */
567 and thus should stop at unvisited VUSE to not walk across region
571 vuse_valueize (tree vuse)
576 vuse = SSA_VAL (vuse, &visited);
579 gcc_assert (vuse != VN_TOP);
581 while (SSA_NAME_IN_FREE_LIST (vuse));
582 return vuse;
755 if (vr1->vuse)
4147 tree vuse = gimple_vuse (call); local
5726 tree vuse = vuse_ssa_val (gimple_vuse (stmt)); local
5835 tree vuse = gimple_vuse (stmt); local
5909 tree vuse = gimple_vuse (stmt); local
7044 tree vuse = gimple_vuse (stmt); local
7207 tree vuse = gimple_vuse (stmt); local
[all...] |
| gimple-ssa.h | 96 USE or a VUSE. In those cases, the SSA renamer creates an SSA name
138 /* Return the set of VUSE operand for statement G. */
150 && USE_OP_PTR (ops)->use == &mem_ops_stmt->vuse)
|
| tree-ssa-pre.cc | 1069 if (ref->vuse)
1072 print_generic_expr (outfile, ref->vuse);
1223 /* Translate the VUSE backwards through phi nodes in E->dest, so that
1225 in case the new vuse doesn't change the value id of the OPERANDS. */
1230 tree type, tree vuse, edge e, bool *same_valid)
1233 gimple *phi = SSA_NAME_DEF_STMT (vuse);
1244 return vuse;
1247 prune_clobbered_mems but we have not rewritten the VUSE to the one
1249 through return the VUSE live at entry. Otherwise the VUSE to translat
1522 tree vuse = ref->vuse; local
1844 tree vuse = PRE_EXPR_REFERENCE (expr)->vuse; local
[all...] |
| tree-ssa-alias.cc | 3680 /* Walk the virtual use-def chain of VUSE until hitting the virtual operand
3682 case false is returned. The walk starts with VUSE, one argument of PHI. */
3686 ao_ref *ref, tree vuse, bool tbaa_p, unsigned int &limit,
3703 while (vuse != target)
3705 gimple *def_stmt = SSA_NAME_DEF_STMT (vuse);
3706 /* If we are searching for the target VUSE by walking up to
3715 target = vuse;
3725 vuse = get_continuation_for_phi (def_stmt, ref, tbaa_p, limit,
3728 if (!vuse)
3744 && (*translate) (ref, vuse, data, &tf) == NULL
[all...] |
| sese.cc | 383 /* A VUSE may or may not be variant following the VDEFs. */
384 if (tree vuse = gimple_vuse (stmt))
385 return invariant_in_sese_p_rec (vuse, region, has_vdefs);
|
| gimple-ssa-store-merging.cc | 179 vuse as the corresponding store. */
233 tree vuse; member in struct:__anon1171::symbolic_number
339 n->base_addr = n->offset = n->alias_set = n->vuse = NULL_TREE;
433 n->vuse = gimple_vuse (stmt);
552 n->vuse = n_start->vuse;
797 if (n1.vuse != n2.vuse)
936 a memory source, and if so alias-set and vuse. At last, the
1000 if (n->vuse != n1.vuse
[all...] |
| tree-ssa-sccvn.h | 133 the vuse, representing the memory state at the time of
145 tree vuse; member in struct:vn_reference_s
|
| tree-ssa-strlen.cc | 284 bool count_nonzero_bytes (tree exp, tree vuse,
291 bool count_nonzero_bytes_addr (tree exp, tree vuse,
1784 tree vuse, callee, len; local
1796 vuse = gimple_vuse (stmt);
1797 if (vuse == NULL_TREE
1798 || SSA_NAME_DEF_STMT (vuse) != last.stmt
1799 || !has_single_use (vuse))
4547 bytes in the representation of EXP at memory state VUSE and set
4562 strlen_pass::count_nonzero_bytes (tree exp, tree vuse, gimple *stmt,
4582 return count_nonzero_bytes (exp, vuse, stmt
[all...] |
| tree-ssa-dce.cc | 819 /* Propagate through the operands. Examine all the USE, VUSE and
891 /* For statements that may load from memory (have a VUSE) we
1047 tree vuse = gimple_phi_arg_def (phi, 0); local
1054 SET_USE (use_p, vuse);
1056 && TREE_CODE (vuse) == SSA_NAME)
1057 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (vuse) = 1;
|
| tree-ssa-operands.cc | 71 i.e., if a stmt had a VUSE of 'a_5', and 'a' occurs in the new
72 operand vector for VUSE, then the new vector will also be modified
89 generate a USE of 'i' but it should not generate a VUSE for 'a' nor a
90 VUSE for 'b'. */
132 /* The built VUSE operand. */
160 /* Add VAR to the set of variables that require a VUSE operator. */
186 escape, add them to the VDEF/VUSE lists for it. */
433 /* Pre-pend the VUSE we may have built. */
451 /* Clear a no longer necessary VUSE. */
466 /* If we added a VUSE, make sure to set the operand if it is not alread
1370 tree vuse = gimple_vuse (stmt); local
[all...] |
| tree-ssa.cc | 681 tree vuse = gimple_vuse (stmt); local
682 if (vuse)
684 if (vuse != current_vdef)
686 error ("stmt with wrong VUSE");
716 error ("PHI node with wrong VUSE on edge from BB %d",
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-phiprop.cc | 97 tree vuse; member in struct:phiprop_d
106 tree vuse = phivn[SSA_NAME_VERSION (name)].vuse; local
112 gcc_assert (vuse != NULL_TREE);
114 FOR_EACH_IMM_USE_STMT (use_stmt, ui2, vuse)
325 tree vuse; local
355 vuse = gimple_vuse (use_stmt);
356 def_stmt = SSA_NAME_DEF_STMT (vuse);
357 if (!SSA_NAME_IS_DEFAULT_DEF (vuse)
387 FOR_EACH_IMM_USE_FAST (vuse_p, vui, vuse)
[all...] |
| tree-ssa-sccvn.cc | 540 /* Return the SSA value of the VUSE x, supporting released VDEFs
542 associated VUSE (but not substitute in the whole lattice). */
561 and thus should stop at unvisited VUSE to not walk across region
565 vuse_valueize (tree vuse)
570 vuse = SSA_VAL (vuse, &visited);
573 gcc_assert (vuse != VN_TOP);
575 while (SSA_NAME_IN_FREE_LIST (vuse));
576 return vuse;
747 if (vr1->vuse)
3848 tree vuse = gimple_vuse (call); local
5310 tree vuse = vuse_ssa_val (gimple_vuse (stmt)); local
5417 tree vuse = gimple_vuse (stmt); local
5488 tree vuse = gimple_vuse (stmt); local
6545 tree vuse = gimple_vuse (stmt); local
6705 tree vuse = gimple_vuse (stmt); local
[all...] |
| gimple-ssa.h | 94 USE or a VUSE. In those cases, the SSA renamer creates an SSA name
136 /* Return the set of VUSE operand for statement G. */
148 && USE_OP_PTR (ops)->use == &mem_ops_stmt->vuse)
|
| tree-ssa-pre.cc | 1081 if (ref->vuse)
1084 print_generic_expr (outfile, ref->vuse);
1235 /* Translate the VUSE backwards through phi nodes in E->dest, so that
1237 in case the new vuse doesn't change the value id of the OPERANDS. */
1242 tree type, tree vuse, edge e, bool *same_valid)
1245 gimple *phi = SSA_NAME_DEF_STMT (vuse);
1256 return vuse;
1259 prune_clobbered_mems but we have not rewritten the VUSE to the one
1261 through return the VUSE live at entry. Otherwise the VUSE to translat
1534 tree vuse = ref->vuse; local
1855 tree vuse = PRE_EXPR_REFERENCE (expr)->vuse; local
[all...] |
| tree-ssa-alias.cc | 3610 /* Walk the virtual use-def chain of VUSE until hitting the virtual operand
3612 case false is returned. The walk starts with VUSE, one argument of PHI. */
3616 ao_ref *ref, tree vuse, bool tbaa_p, unsigned int &limit,
3630 while (vuse != target)
3632 gimple *def_stmt = SSA_NAME_DEF_STMT (vuse);
3633 /* If we are searching for the target VUSE by walking up to
3642 target = vuse;
3652 vuse = get_continuation_for_phi (def_stmt, ref, tbaa_p, limit,
3655 if (!vuse)
3671 && (*translate) (ref, vuse, data, &tf) == NULL
[all...] |
| sese.cc | 385 /* A VUSE may or may not be variant following the VDEFs. */
386 if (tree vuse = gimple_vuse (stmt))
387 return invariant_in_sese_p_rec (vuse, region, has_vdefs);
|
| gimple-ssa-store-merging.cc | 179 vuse as the corresponding store. */
233 tree vuse; member in struct:__anon11208::symbolic_number
339 n->base_addr = n->offset = n->alias_set = n->vuse = NULL_TREE;
433 n->vuse = gimple_vuse (stmt);
552 n->vuse = n_start->vuse;
792 if (n1.vuse != n2.vuse)
900 a memory source, and if so alias-set and vuse. At last, the
964 if (n->vuse != n1.vuse
[all...] |
| tree-ssa-sccvn.h | 133 the vuse, representing the memory state at the time of
145 tree vuse; member in struct:vn_reference_s
|
| tree-ssa-dce.cc | 805 /* Propagate through the operands. Examine all the USE, VUSE and
877 /* For statements that may load from memory (have a VUSE) we
1032 tree vuse = gimple_phi_arg_def (phi, 0); local
1039 SET_USE (use_p, vuse);
1041 && TREE_CODE (vuse) == SSA_NAME)
1042 SSA_NAME_OCCURS_IN_ABNORMAL_PHI (vuse) = 1;
|
| tree-ssa-operands.cc | 71 i.e., if a stmt had a VUSE of 'a_5', and 'a' occurs in the new
72 operand vector for VUSE, then the new vector will also be modified
89 generate a USE of 'i' but it should not generate a VUSE for 'a' nor a
90 VUSE for 'b'. */
132 /* The built VUSE operand. */
160 /* Add VAR to the set of variables that require a VUSE operator. */
186 escape, add them to the VDEF/VUSE lists for it. */
433 /* Pre-pend the VUSE we may have built. */
451 /* Clear a no longer necessary VUSE. */
466 /* If we added a VUSE, make sure to set the operand if it is not alread
1371 tree vuse = gimple_vuse (stmt); local
[all...] |
| tree-ssa-strlen.cc | 1797 tree vuse, callee, len; local
1809 vuse = gimple_vuse (stmt);
1810 if (vuse == NULL_TREE
1811 || SSA_NAME_DEF_STMT (vuse) != last.stmt
1812 || !has_single_use (vuse))
5687 tree vuse = gimple_phi_arg_def (phi, i);
5688 gimple *stmt = SSA_NAME_DEF_STMT (vuse);
5711 vuse = gimple_vuse (stmt);
5712 stmt = SSA_NAME_DEF_STMT (vuse);
|
| tree-ssa.cc | 689 tree vuse = gimple_vuse (stmt); local
690 if (vuse)
692 if (vuse != current_vdef)
694 error ("stmt with wrong VUSE");
724 error ("PHI node with wrong VUSE on edge from BB %d",
|
| gimple-pretty-print.cc | 2631 tree vuse = gimple_vuse (gs); local
2638 dump_generic_node (buffer, vuse, spc + 2, flags, false);
2642 else if (vuse != NULL_TREE)
2644 pp_string (buffer, "# VUSE <");
2645 dump_generic_node (buffer, vuse, spc + 2, flags, false);
|
