1 /* |
1 /* |
2 * Copyright (c) 2005, 2013, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 2005, 2015, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * |
4 * |
5 * This code is free software; you can redistribute it and/or modify it |
5 * This code is free software; you can redistribute it and/or modify it |
6 * under the terms of the GNU General Public License version 2 only, as |
6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. |
7 * published by the Free Software Foundation. |
181 Node* makecon(const Type *t) const { return _gvn.makecon(t); } |
181 Node* makecon(const Type *t) const { return _gvn.makecon(t); } |
182 |
182 |
183 Node* AddI(Node* l, Node* r) { return transform(new AddINode(l, r)); } |
183 Node* AddI(Node* l, Node* r) { return transform(new AddINode(l, r)); } |
184 Node* SubI(Node* l, Node* r) { return transform(new SubINode(l, r)); } |
184 Node* SubI(Node* l, Node* r) { return transform(new SubINode(l, r)); } |
185 Node* AndI(Node* l, Node* r) { return transform(new AndINode(l, r)); } |
185 Node* AndI(Node* l, Node* r) { return transform(new AndINode(l, r)); } |
|
186 Node* OrI(Node* l, Node* r) { return transform(new OrINode(l, r)); } |
186 Node* MaxI(Node* l, Node* r) { return transform(new MaxINode(l, r)); } |
187 Node* MaxI(Node* l, Node* r) { return transform(new MaxINode(l, r)); } |
187 Node* LShiftI(Node* l, Node* r) { return transform(new LShiftINode(l, r)); } |
188 Node* LShiftI(Node* l, Node* r) { return transform(new LShiftINode(l, r)); } |
188 Node* CmpI(Node* l, Node* r) { return transform(new CmpINode(l, r)); } |
189 Node* CmpI(Node* l, Node* r) { return transform(new CmpINode(l, r)); } |
189 Node* Bool(Node* cmp, BoolTest::mask relop) { return transform(new BoolNode(cmp, relop)); } |
190 Node* Bool(Node* cmp, BoolTest::mask relop) { return transform(new BoolNode(cmp, relop)); } |
190 void increment(IdealVariable& v, Node* j) { set(v, AddI(value(v), j)); } |
191 void increment(IdealVariable& v, Node* j) { set(v, AddI(value(v), j)); } |