Lines Matching defs:Ideal

221     // Equivalent code in PhiNode::Ideal
266 assert(mem != this, "dead loop in MemNode::Ideal");
383 // Or Region for the check in LoadNode::Ideal();
490 // (Currently, only LoadNode::Ideal has steps (c), (d). More later.)
950 // everywhere. We need to make a coordinated change: first LoadNode::Ideal
1032 // (This can happen after LoadNode::Ideal resets the load's memory input
1089 // Ideal call instead of an Identity call.
1092 // it must be truncated via an Ideal call.
1277 // since Ideal can't return existing nodes
1414 //------------------------------Ideal------------------------------------------
1419 Node *LoadNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1557 // to use one kind of load over the other. See AndINode::Ideal and 4965907.
1786 //--------------------------LoadBNode::Ideal--------------------------------------
1793 Node *LoadBNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1801 return LoadNode::Ideal(phase, can_reshape);
1810 // it must be truncated. We can't delay until Ideal call since
1818 //--------------------------LoadUBNode::Ideal-------------------------------------
1825 Node* LoadUBNode::Ideal(PhaseGVN* phase, bool can_reshape) {
1831 return LoadNode::Ideal(phase, can_reshape);
1840 // it must be truncated. We can't delay until Ideal call since
1848 //--------------------------LoadUSNode::Ideal-------------------------------------
1855 Node *LoadUSNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1861 return LoadNode::Ideal(phase, can_reshape);
1870 // it must be truncated. We can't delay until Ideal call since
1878 //--------------------------LoadSNode::Ideal--------------------------------------
1885 Node *LoadSNode::Ideal(PhaseGVN *phase, bool can_reshape) {
1893 return LoadNode::Ideal(phase, can_reshape);
1902 // it must be truncated. We can't delay until Ideal call since
2166 //-------------------------------Ideal---------------------------------------
2168 Node *LoadRangeNode::Ideal(PhaseGVN *phase, bool can_reshape) {
2287 //------------------------------Ideal------------------------------------------
2291 Node *StoreNode::Ideal(PhaseGVN *phase, bool can_reshape) {
2305 assert(mem != mem->in(MemNode::Memory), "dead loop in StoreNode::Ideal");
2342 // %%% hack to ensure that Ideal returns a new node:
2491 //------------------------------Ideal------------------------------------------
2495 Node *StoreBNode::Ideal(PhaseGVN *phase, bool can_reshape){
2503 return StoreNode::Ideal(phase, can_reshape);
2507 //------------------------------Ideal------------------------------------------
2510 Node *StoreCNode::Ideal(PhaseGVN *phase, bool can_reshape){
2518 return StoreNode::Ideal(phase, can_reshape);
2536 //------------------------------Ideal---------------------------------------
2537 Node *StoreCMNode::Ideal(PhaseGVN *phase, bool can_reshape){
2538 Node* progress = StoreNode::Ideal(phase, can_reshape);
2632 Node *ClearArrayNode::Ideal(PhaseGVN *phase, bool can_reshape){
2786 //------------------------------Ideal------------------------------------------
2789 Node *StrIntrinsicNode::Ideal(PhaseGVN *phase, bool can_reshape) {
2848 //------------------------------Ideal------------------------------------------
2851 Node *MemBarNode::Ideal(PhaseGVN *phase, bool can_reshape) {
3379 // See StoreNode::Ideal 'st->outcnt() == 1' for the reason to disconnect.
3988 // ==Ideal=> MergeMem(<Bot>: Phi<Bot-8>(U, W), Phi<8>(U, Y))
4055 //------------------------------Ideal------------------------------------------
4057 Node *MergeMemNode::Ideal(PhaseGVN *phase, bool can_reshape) {
4194 // Resolve external cycles by calling Ideal on a MergeMem base_memory
4218 // Check if PhiNode::Ideal's "Split phis through memory merges"