Lines Matching refs:Node
33 class Node;
41 Node* top() const { return C->top(); }
42 Node* intcon(jint con) const { return _igvn.intcon(con); }
43 Node* longcon(jlong con) const { return _igvn.longcon(con); }
44 Node* makecon(const Type *t) const { return _igvn.makecon(t); }
45 Node* basic_plus_adr(Node* base, int offset) {
48 Node* basic_plus_adr(Node* base, Node* ptr, int offset) {
51 Node* basic_plus_adr(Node* base, Node* offset) {
54 Node* basic_plus_adr(Node* base, Node* ptr, Node* offset) {
55 Node* adr = new (C) AddPNode(base, ptr, offset);
58 Node* transform_later(Node* n) {
63 void set_eden_pointers(Node* &eden_top_adr, Node* &eden_end_adr);
64 Node* make_load( Node* ctl, Node* mem, Node* base, int offset,
66 Node* make_store(Node* ctl, Node* mem, Node* base, int offset,
67 Node* value, BasicType bt);
83 Node* length,
86 Node *value_from_mem(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc);
87 Node *value_from_mem_phi(Node *mem, BasicType ft, const Type *ftype, const TypeOopPtr *adr_t, Node *alloc, Node_Stack *value_phis, int level);
94 void eliminate_card_mark(Node *cm);
95 void mark_eliminated_box(Node* box, Node* obj);
101 int replace_input(Node *use, Node *oldref, Node *newref);
103 Node* opt_bits_test(Node* ctrl, Node* region, int edge, Node* word, int mask, int bits, bool return_fast_path = false);
104 void copy_predefined_input_for_runtime_call(Node * ctrl, CallNode* oldcall, CallNode* call);
106 const char* leaf_name, Node* slow_path, Node* parm0, Node* parm1);
109 Node* initialize_object(AllocateNode* alloc,
110 Node* control, Node* rawmem, Node* object,
111 Node* klass_node, Node* length,
112 Node* size_in_bytes);
114 Node* prefetch_allocation(Node* i_o,
115 Node*& needgc_false, Node*& contended_phi_rawmem,
116 Node* old_eden_top, Node* new_eden_top,
117 Node* length);