| /src/external/gpl3/gcc/dist/gcc/ |
| tree-ssa-operands.cc | 129 /* The built VDEF operand. */ 157 /* Add VAR to the set of variables that require a VDEF operator. */ 186 escape, add them to the VDEF/VUSE lists for it. */ 391 /* Pre-pend the vdef we may have built. */ 402 /* Clear and unlink a no longer necessary VDEF. */ 414 /* If we have a non-SSA_NAME VDEF, mark it for renaming. */ 531 /* Add VAR to the set of variables that require a VDEF operator. */ 683 escape, add them to the VDEF/VUSE lists for it. */ 690 /* If aliases have been computed already, add VDEF or VUSE 1369 tree vdef = gimple_vdef (stmt) local [all...] |
| tree-ssa-operands.cc | 129 /* The built VDEF operand. */ 157 /* Add VAR to the set of variables that require a VDEF operator. */ 186 escape, add them to the VDEF/VUSE lists for it. */ 391 /* Pre-pend the vdef we may have built. */ 402 /* Clear and unlink a no longer necessary VDEF. */ 414 /* If we have a non-SSA_NAME VDEF, mark it for renaming. */ 531 /* Add VAR to the set of variables that require a VDEF operator. */ 683 escape, add them to the VDEF/VUSE lists for it. */ 690 /* If aliases have been computed already, add VDEF or VUSE 1369 tree vdef = gimple_vdef (stmt) local [all...] |
| gimple-pretty-print.cc | 2629 tree vdef = gimple_vdef (gs); local 2632 if (vdef != NULL_TREE) 2635 dump_generic_node (buffer, vdef, spc + 2, flags, false); 2636 pp_string (buffer, " = VDEF <");
|
| tree-ssa-dce.cc | 119 /* True if we should treat any stmt with a vdef as necessary. */ 491 true whenever the defining statement of the current VDEF is 497 mark_aliased_reaching_defs_necessary_1 (ao_ref *ref, tree vdef, void *data) 499 gimple *def_stmt = SSA_NAME_DEF_STMT (vdef); 503 mark_operand_necessary (vdef); 580 tree vdef, void *data ATTRIBUTE_UNUSED) 582 gimple *def_stmt = SSA_NAME_DEF_STMT (vdef); 587 && bitmap_bit_p (processed, SSA_NAME_VERSION (vdef))) 632 mark_operand_necessary (vdef); 820 VDEF operands in this statement. Mark all the statement 1046 tree vdef = gimple_phi_result (phi); local [all...] |
| tree-ssa-dse.cc | 888 Look at all the immediate uses of the VDEF (which are obviously 1173 tree vdef = (gimple_code (def) == GIMPLE_PHI local 1188 else if (has_zero_uses (vdef)) 1202 else if (single_imm_use (vdef, &use_p, &use_stmt)
|
| tree-ssa.cc | 693 tree vdef = gimple_vdef (stmt); local 694 if (vdef) 696 current_vdef = vdef; 797 IS_VIRTUAL is true if SSA_NAME is created by a VDEF. */
|
| gimple-pretty-print.cc | 2629 tree vdef = gimple_vdef (gs); local 2632 if (vdef != NULL_TREE) 2635 dump_generic_node (buffer, vdef, spc + 2, flags, false); 2636 pp_string (buffer, " = VDEF <");
|
| tree-ssa-dce.cc | 119 /* True if we should treat any stmt with a vdef as necessary. */ 491 true whenever the defining statement of the current VDEF is 497 mark_aliased_reaching_defs_necessary_1 (ao_ref *ref, tree vdef, void *data) 499 gimple *def_stmt = SSA_NAME_DEF_STMT (vdef); 503 mark_operand_necessary (vdef); 580 tree vdef, void *data ATTRIBUTE_UNUSED) 582 gimple *def_stmt = SSA_NAME_DEF_STMT (vdef); 587 && bitmap_bit_p (processed, SSA_NAME_VERSION (vdef))) 632 mark_operand_necessary (vdef); 820 VDEF operands in this statement. Mark all the statement 1046 tree vdef = gimple_phi_result (phi); local [all...] |
| tree-ssa-dse.cc | 888 Look at all the immediate uses of the VDEF (which are obviously 1173 tree vdef = (gimple_code (def) == GIMPLE_PHI local 1188 else if (has_zero_uses (vdef)) 1202 else if (single_imm_use (vdef, &use_p, &use_stmt)
|
| tree-ssa.cc | 693 tree vdef = gimple_vdef (stmt); local 694 if (vdef) 696 current_vdef = vdef; 797 IS_VIRTUAL is true if SSA_NAME is created by a VDEF. */
|
| tree-loop-distribution.cc | 1328 tree vdef = gimple_vdef (stmt); local 1329 if (vdef && TREE_CODE (vdef) == SSA_NAME) 1330 mark_virtual_operand_for_renaming (vdef);
|
| tree-loop-distribution.cc | 1328 tree vdef = gimple_vdef (stmt); local 1329 if (vdef && TREE_CODE (vdef) == SSA_NAME) 1330 mark_virtual_operand_for_renaming (vdef);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-ssa-operands.cc | 129 /* The built VDEF operand. */ 157 /* Add VAR to the set of variables that require a VDEF operator. */ 186 escape, add them to the VDEF/VUSE lists for it. */ 391 /* Pre-pend the vdef we may have built. */ 402 /* Clear and unlink a no longer necessary VDEF. */ 414 /* If we have a non-SSA_NAME VDEF, mark it for renaming. */ 531 /* Add VAR to the set of variables that require a VDEF operator. */ 683 escape, add them to the VDEF/VUSE lists for it. */ 690 /* If aliases have been computed already, add VDEF or VUSE 1370 tree vdef = gimple_vdef (stmt) local [all...] |
| tree-ssa-operands.cc | 129 /* The built VDEF operand. */ 157 /* Add VAR to the set of variables that require a VDEF operator. */ 186 escape, add them to the VDEF/VUSE lists for it. */ 391 /* Pre-pend the vdef we may have built. */ 402 /* Clear and unlink a no longer necessary VDEF. */ 414 /* If we have a non-SSA_NAME VDEF, mark it for renaming. */ 531 /* Add VAR to the set of variables that require a VDEF operator. */ 683 escape, add them to the VDEF/VUSE lists for it. */ 690 /* If aliases have been computed already, add VDEF or VUSE 1370 tree vdef = gimple_vdef (stmt) local [all...] |
| gimple-pretty-print.cc | 2630 tree vdef = gimple_vdef (gs); local 2633 if (vdef != NULL_TREE) 2636 dump_generic_node (buffer, vdef, spc + 2, flags, false); 2637 pp_string (buffer, " = VDEF <");
|
| tree-ssa-dce.cc | 119 /* True if we should treat any stmt with a vdef as necessary. */ 477 true whenever the defining statement of the current VDEF is 483 mark_aliased_reaching_defs_necessary_1 (ao_ref *ref, tree vdef, void *data) 485 gimple *def_stmt = SSA_NAME_DEF_STMT (vdef); 489 mark_operand_necessary (vdef); 566 tree vdef, void *data ATTRIBUTE_UNUSED) 568 gimple *def_stmt = SSA_NAME_DEF_STMT (vdef); 573 && bitmap_bit_p (processed, SSA_NAME_VERSION (vdef))) 618 mark_operand_necessary (vdef); 806 VDEF operands in this statement. Mark all the statement 1031 tree vdef = gimple_phi_result (phi); local [all...] |
| tree-ssa-dse.cc | 844 Look at all the immediate uses of the VDEF (which are obviously 1056 tree vdef = (gimple_code (def) == GIMPLE_PHI local 1070 else if (has_zero_uses (vdef)) 1084 else if (single_imm_use (vdef, &use_p, &use_stmt)
|
| tree-ssa.cc | 701 tree vdef = gimple_vdef (stmt); local 702 if (vdef) 704 current_vdef = vdef; 805 IS_VIRTUAL is true if SSA_NAME is created by a VDEF. */
|
| gimple-pretty-print.cc | 2630 tree vdef = gimple_vdef (gs); local 2633 if (vdef != NULL_TREE) 2636 dump_generic_node (buffer, vdef, spc + 2, flags, false); 2637 pp_string (buffer, " = VDEF <");
|
| tree-ssa-dce.cc | 119 /* True if we should treat any stmt with a vdef as necessary. */ 477 true whenever the defining statement of the current VDEF is 483 mark_aliased_reaching_defs_necessary_1 (ao_ref *ref, tree vdef, void *data) 485 gimple *def_stmt = SSA_NAME_DEF_STMT (vdef); 489 mark_operand_necessary (vdef); 566 tree vdef, void *data ATTRIBUTE_UNUSED) 568 gimple *def_stmt = SSA_NAME_DEF_STMT (vdef); 573 && bitmap_bit_p (processed, SSA_NAME_VERSION (vdef))) 618 mark_operand_necessary (vdef); 806 VDEF operands in this statement. Mark all the statement 1031 tree vdef = gimple_phi_result (phi); local [all...] |
| tree-ssa-dse.cc | 844 Look at all the immediate uses of the VDEF (which are obviously 1056 tree vdef = (gimple_code (def) == GIMPLE_PHI local 1070 else if (has_zero_uses (vdef)) 1084 else if (single_imm_use (vdef, &use_p, &use_stmt)
|
| tree-ssa.cc | 701 tree vdef = gimple_vdef (stmt); local 702 if (vdef) 704 current_vdef = vdef; 805 IS_VIRTUAL is true if SSA_NAME is created by a VDEF. */
|
| tree-loop-distribution.cc | 1290 tree vdef = gimple_vdef (stmt); local 1291 if (vdef && TREE_CODE (vdef) == SSA_NAME) 1292 mark_virtual_operand_for_renaming (vdef);
|
| tree-ssa-loop-manip.cc | 572 tree vdef = gimple_vdef (stmt); local 573 if (vdef != NULL) 574 find_uses_to_rename_def (vdef, use_blocks, need_phis);
|
| tree-loop-distribution.cc | 1290 tree vdef = gimple_vdef (stmt); local 1291 if (vdef && TREE_CODE (vdef) == SSA_NAME) 1292 mark_virtual_operand_for_renaming (vdef);
|