/openjdk7/hotspot/src/cpu/x86/vm/ |
H A D | interp_masm_x86_64.cpp | 281 addptr(cache, tmp); // construct pointer to cache entry 415 // Jump to from_interpreted entry of a call unless single stepping is possible 416 // in this thread in which case we must call the i2i entry 583 Label loop, exception, entry, restart; local 593 movptr(c_rarg1, monitor_block_top); // points to current entry, starting 594 // with top-most entry 597 jmp(entry); 627 // check if current entry is used 631 addptr(c_rarg1, entry_size); // otherwise advance to next entry 632 bind(entry); [all...] |
H A D | c1_LIRAssembler_x86.cpp | 345 // insert some nops so that the verified entry point is aligned on CodeEntryAlignment 444 __ unlock_object(rdi, rbx, rax, *stub->entry()); 501 // OSR-entry and therefore, we generate a slow version for OSR's 1539 __ jcc(Assembler::equal, *op->stub()->entry()); 1576 __ jcc(Assembler::notEqual, *op->stub()->entry()); 1584 *op->stub()->entry()); 1595 __ jmp(*op->stub()->entry()); 1616 *op->stub()->entry()); 1834 Label *failure_target = op->should_profile() ? &profile_cast_failure : stub->entry(); 1884 __ jmp(*stub->entry()); 3473 address entry = StubRoutines::select_arraycopy_function(basic_type, aligned, disjoint, name, false); local [all...] |
H A D | stubGenerator_x86_32.cpp | 388 // NOTE: At entry of this stub, exception-pc must be on stack !! 400 // Upon entry, the sp points to the return address returning into Java 937 address* entry, const char *name, 961 if (entry != NULL) { 962 *entry = __ pc(); // Entry point from conjoint arraycopy stub. 1103 address* entry, const char *name, 1128 if (entry != NULL) { 1129 *entry = __ pc(); // Entry point from generic arraycopy stub. 1263 address generate_disjoint_long_copy(address* entry, const char *name) { argument 1279 *entry 935 generate_disjoint_copy(BasicType t, bool aligned, Address::ScaleFactor sf, address* entry, const char *name, bool dest_uninitialized = false) argument 1100 generate_conjoint_copy(BasicType t, bool aligned, Address::ScaleFactor sf, address nooverlap_target, address* entry, const char *name, bool dest_uninitialized = false) argument 1307 generate_conjoint_long_copy(address nooverlap_target, address* entry, const char *name) argument 1434 generate_checkcast_copy(const char *name, address* entry, bool dest_uninitialized = false) argument 2008 address entry; local [all...] |
H A D | templateTable_x86_32.cpp | 1907 // entry found -> get offset 1965 Label entry; local 1966 __ jmp(entry); 1988 __ bind(entry); 2002 // entry found -> j = offset 2093 // This kind of CP cache entry does not need to match bytecode_1 or bytecode_2, because 2094 // there is a 1-1 relation between bytecode type and CP entry type. 2110 address entry; local 2115 case Bytecodes::_putfield : entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_get_put); break; 2119 case Bytecodes::_invokeinterface: entry 3577 { Label entry, loop, exit; local 3599 { Label entry, loop; local 3649 { Label entry, loop; local [all...] |
H A D | templateTable_x86_64.cpp | 1943 // entry found -> get offset 2006 Label entry; local 2007 __ jmp(entry); 2030 __ bind(entry); 2044 // entry found -> j = offset 2135 // This kind of CP cache entry does not need to match bytecode_1 or bytecode_2, because 2136 // there is a 1-1 relation between bytecode type and CP entry type. 2152 address entry; local 2158 entry = CAST_FROM_FN_PTR(address, InterpreterRuntime::resolve_get_put); 2164 entry 3646 Label entry, loop, exit; local 3677 Label entry, loop; local 3737 Label entry, loop; local [all...] |
H A D | stubGenerator_x86_64.cpp | 113 // c_rarg4: (interpreter) entry point address 131 // -2 [ entry point ] 143 // 48(rbp): (interpreter) entry point address 168 // 6 [ entry point ] 484 // NOTE: At entry of this stub, exception-pc must be on stack !! 490 // Upon entry, the sp points to the return address returning into 1312 // L_copy_bytes - entry label 1318 DEBUG_ONLY(__ stop("enter at entry label, not here")); 1388 // L_copy_bytes - entry label 1394 DEBUG_ONLY(__ stop("enter at entry labe 1478 generate_disjoint_byte_copy(bool aligned, address* entry, const char *name) argument 1580 generate_conjoint_byte_copy(bool aligned, address nooverlap_target, address* entry, const char *name) argument 1678 generate_disjoint_short_copy(bool aligned, address *entry, const char *name) argument 1792 generate_conjoint_short_copy(bool aligned, address nooverlap_target, address *entry, const char *name) argument 1882 generate_disjoint_int_oop_copy(bool aligned, bool is_oop, address* entry, const char *name, bool dest_uninitialized = false) argument 1972 generate_conjoint_int_oop_copy(bool aligned, bool is_oop, address nooverlap_target, address *entry, const char *name, bool dest_uninitialized = false) argument 2065 generate_disjoint_long_oop_copy(bool aligned, bool is_oop, address *entry, const char *name, bool dest_uninitialized = false) argument 2156 generate_conjoint_long_oop_copy(bool aligned, bool is_oop, address nooverlap_target, address *entry, const char *name, bool dest_uninitialized = false) argument 2266 generate_checkcast_copy(const char *name, address *entry, bool dest_uninitialized = false) argument 2833 address entry; local [all...] |
/openjdk7/hotspot/src/share/vm/prims/ |
H A D | methodHandles.cpp | 89 address entry = MethodHandles::generate_method_handle_interpreter_entry(_masm, iid); local 90 if (entry != NULL) { 91 Interpreter::set_entry_for_kind(mk, entry); 93 // If the entry is not set, it will throw AbstractMethodError. 878 negate_name_test = true; // if we see the name, we *omit* the entry
|
H A D | jni.cpp | 3984 static bool register_native(KlassHandle k, Symbol* name, Symbol* signature, address entry, TRAPS) { argument 4005 if (entry != NULL) { 4006 method->set_native_function(entry,
|
/openjdk7/hotspot/src/share/vm/runtime/ |
H A D | fprofiler.cpp | 95 int ThreadProfiler::entry(int value) { function in class:ThreadProfiler 665 int index = entry(ProfilerNode::hash(method)); 682 int index = entry(ProfilerNode::hash(method)); 699 int index = entry(ProfilerNode::hash(method)); 772 int index = entry(vmNode::hash(name));
|
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/fastinfoset/ |
H A D | Encoder.java | 997 LocalNameQualifiedNamesMap.Entry entry = _v.elementName.obtainEntry(localName); 998 if (entry._valueIndex > 0) { 999 QualifiedName[] names = entry._value; 1000 for (int i = 0; i < entry._valueIndex; i++) { 1010 localName, entry); 1023 LocalNameQualifiedNamesMap.Entry entry) throws IOException { 1025 entry.addQualifiedName(name); 1083 LocalNameQualifiedNamesMap.Entry entry = _v.attributeName.obtainEntry(localName); 1084 if (entry._valueIndex > 0) { 1085 QualifiedName[] names = entry 1022 encodeLiteralElementQualifiedNameOnThirdBit(String namespaceURI, String prefix, String localName, LocalNameQualifiedNamesMap.Entry entry) argument 1108 encodeLiteralAttributeQualifiedNameOnSecondBit(String namespaceURI, String prefix, String localName, LocalNameQualifiedNamesMap.Entry entry) argument [all...] |
/openjdk7/jdk/src/share/classes/sun/misc/ |
H A D | ProxyGenerator.java | 734 * an entry in the "exception_table" item of the "Code" attribute of 871 * the code and exception table entry. 1678 * value can be assigned and used when an entry is first created. 1702 * This map is used to look up the index of an existing entry for 1711 * Get or assign the index for a CONSTANT_Utf8 entry. 1721 * Get or assign the index for a CONSTANT_Integer entry. 1728 * Get or assign the index for a CONSTANT_Float entry. 1735 * Get or assign the index for a CONSTANT_Class entry. 1744 * Get or assign the index for a CONSTANT_String entry. 1753 * Get or assign the index for a CONSTANT_FieldRef entry 1831 addEntry(Entry entry) argument [all...] |
/openjdk7/hotspot/src/share/vm/ci/ |
H A D | ciTypeFlow.hpp | 78 // class represents a call to the routine at some entry address 120 // of the set and replacing any element with the same entry address. 547 // This block is entry to irreducible loop. 550 // This block has monitor entry point. 591 // access to entry state 755 // Mark non-single entry to loop 756 void set_irreducible(Block* entry) { argument 758 entry->set_irreducible_entry(true); 895 // Make a JsrRecord for a given (entry, return) pair, if such a record
|
/openjdk7/hotspot/src/share/vm/classfile/ |
H A D | systemDictionary.cpp | 285 // where the placeholder entry is created which claims this 418 // We recalculate the entry here -- we've called out to java since 426 // Note that we have an entry, and entries can be deleted only during GC, 427 // so we cannot allow GC to occur while we're holding this entry. 489 // to force placeholder entry creation for this class for circularity detection 511 // entry on error. 667 // add placeholder entry to record loading instance class 730 // add placeholder entry even if error - callers will remove on error 848 // Note that we have an entry, and entries can be deleted only during GC, 849 // so we cannot allow GC to occur while we're holding this entry 2148 ResolutionErrorEntry* entry = resolution_errors()->find_entry(index, hash, pool, which); local [all...] |
/openjdk7/hotspot/src/share/vm/oops/ |
H A D | methodOop.hpp | 150 // The entry point for calling both from and to compiled code is 297 // Finds the first entry point bci of an exception handler for an 361 // nmethod/verified compiler entry 372 // setup entry points 374 // clear entry points. Used by sharing code 392 // interpreter entry 395 void set_interpreter_entry(address entry) { _i2i_entry = entry; _from_interpreted_entry = entry; } argument 494 // true if method needs no dynamic dispatch (final and/or no vtable entry) [all...] |
/openjdk7/hotspot/src/share/vm/opto/ |
H A D | loopTransform.cpp | 500 Node* entry = head->in(LoopNode::EntryControl); local
|
H A D | loopnode.cpp | 1589 // entry 0 1858 Node* entry = _head->in(LoopNode::EntryControl); local 1860 Node* predicate = PhaseIdealLoop::find_predicate_insertion_point(entry, Deoptimization::Reason_loop_limit_check); 1863 entry = entry->in(0)->in(0); 1867 entry = PhaseIdealLoop::find_predicate_insertion_point(entry, Deoptimization::Reason_predicate); 1868 if (entry != NULL) { 1954 Node* entry = lpn->in(LoopNode::EntryControl); local 1955 Node* predicate_proj = find_predicate(entry); // loop_limit_chec [all...] |
H A D | output.cpp | 73 Block *entry = _cfg->_blocks[1]; local 76 const StartNode *start = entry->_nodes[0]->as_Start(); 80 entry->_nodes.map( 0, prolog ); 81 bbs.map( prolog->_idx, entry ); 84 // Virtual methods need an unverified entry point 93 // Insert unvalidated entry point 100 // Break before main entry point 110 _cfg->insert( entry, 1, new (this) MachBreakpointNode() ); 357 // Start with 2-bytes of reloc info for the unvalidated entry point 568 reloc_size += 1; // Relo entry fo [all...] |
H A D | superword.cpp | 1584 Node* entry = bb(); local 1618 assert(n != entry, "can't be entry"); 1646 // Push all non-control nodes with no inputs from within block, then control entry 1652 visited_set(entry); 1653 _stk.push(entry); 1668 (!use->is_Phi() || n == entry)) { 1697 tty->print_cr("\ndata entry nodes: %s", _data_entry.length() > 0 ? "" : "NONE");
|
/openjdk7/hotspot/src/cpu/sparc/vm/ |
H A D | c1_LIRAssembler_sparc.cpp | 166 // On-stack-replacement entry sequence (interpreter frame layout described in interpreter_sparc.cpp): 173 // OSR entry point 232 // OSR-entry and therefore, we generate a slow version for OSR's 370 __ unlock_object(hdr, obj_reg, lock_reg, *slow_case->entry()); 378 __ br(Assembler::always, false, Assembler::pt, *slow_case->entry()); 444 __ unlock_object(I3, I2, I1, *stub->entry()); 2113 __ cmp_zero_and_br(Assembler::less, O0, *stub->entry()); 2116 __ cmp_zero_and_br(Assembler::less, O0, *stub->entry()); 2128 __ brx(Assembler::equal, false, Assembler::pn, *stub->entry()); 2134 __ brx(Assembler::equal, false, Assembler::pn, *stub->entry()); 2383 address entry = StubRoutines::select_arraycopy_function(basic_type, aligned, disjoint, name, false); local [all...] |
H A D | interp_masm_sparc.cpp | 67 // Note: this algorithm is also used by C1's OSR entry sequence. 96 ld_ptr(IdispatchTables, Lbyte_code, IdispatchAddress);// get entry addr 103 ld_ptr(G3_scratch, Lbyte_code, IdispatchAddress); // get entry addr 292 //verify_thread(); //too slow; we will just verify on method entry & exit 300 ld_ptr(IdispatchTables, Lbyte_code, G3_scratch); // get entry addr 307 ld_ptr(G3_scratch, Lbyte_code, G3_scratch); // get entry addr 606 // Load compiled (i2c) or interpreter entry when calling from interpreted and 635 stop("null entry point"); 794 // construct pointer to cache entry 856 assert(throw_entry_point != NULL, "entry poin 1037 { Label loop, exception, entry, restart; local [all...] |
H A D | stubGenerator_sparc.cpp | 112 // o4 : (interpreter) entry point 371 // Upon entry, O7 has the return address returning into Java 429 // exceptions (e.g., NullPointerException or AbstractMethodError on entry) are 1381 address generate_disjoint_byte_copy(bool aligned, address *entry, const char *name) { argument 1397 if (entry != NULL) { 1398 *entry = __ pc(); 1491 address *entry, const char *name) { 1509 if (entry != NULL) { 1510 *entry = __ pc(); 1602 address generate_disjoint_short_copy(bool aligned, address *entry, cons argument 1490 generate_conjoint_byte_copy(bool aligned, address nooverlap_target, address *entry, const char *name) argument 1941 generate_conjoint_short_copy(bool aligned, address nooverlap_target, address *entry, const char *name) argument 2194 generate_disjoint_int_copy(bool aligned, address *entry, const char *name) argument 2327 generate_conjoint_int_copy(bool aligned, address nooverlap_target, address *entry, const char *name) argument 2480 generate_disjoint_long_copy(bool aligned, address *entry, const char *name) argument 2552 generate_conjoint_long_copy(bool aligned, address nooverlap_target, address *entry, const char *name) argument 2587 generate_disjoint_oop_copy(bool aligned, address *entry, const char *name, bool dest_uninitialized = false) argument 2638 generate_conjoint_oop_copy(bool aligned, address nooverlap_target, address *entry, const char *name, bool dest_uninitialized = false) argument 2732 generate_checkcast_copy(const char *name, address *entry, bool dest_uninitialized = false) argument 3247 address entry; local [all...] |
/openjdk7/hotspot/src/share/vm/c1/ |
H A D | c1_GraphBuilder.cpp | 135 // generate exception entry blocks 140 BlockBegin* entry = make_block_at(h->handler_bci(), NULL); local 141 entry->set(BlockBegin::exception_entry_flag); 142 h->set_entry_block(entry); 191 BlockBegin* entry = h->entry_block(); local 192 assert(entry != NULL && entry == _bci2block->at(h->handler_bci()), "entry must be set"); 193 assert(entry->is_set(BlockBegin::exception_entry_flag), "flag must be set"); 196 if (!current->is_successor(entry)) { 2830 header_block(BlockBegin* entry, BlockBegin::Flag f, ValueStack* state) argument [all...] |
H A D | c1_LIRGenerator.cpp | 991 // At entry of a basic block, the block_prolog sets up the content of phi nodes 2517 // need to free up storage used for OSR entry point 3085 LIR_Opr result = call_runtime(signature, args, x->entry(), x->type(), NULL); 3093 LIR_Opr LIRGenerator::call_runtime(Value arg1, address entry, ValueType* result_type, CodeEmitInfo* info) { argument 3100 return call_runtime(&signature, &args, entry, result_type, info); 3104 LIR_Opr LIRGenerator::call_runtime(Value arg1, Value arg2, address entry, ValueType* result_type, CodeEmitInfo* info) { argument 3114 return call_runtime(&signature, &args, entry, result_type, info); 3119 address entry, ValueType* result_type, CodeEmitInfo* info) { 3152 __ call_runtime(entry, getThreadTemp(), phys_reg, cc->args(), info); 3154 __ call_runtime_leaf(entry, getThreadTem 3118 call_runtime(BasicTypeArray* signature, LIR_OprList* args, address entry, ValueType* result_type, CodeEmitInfo* info) argument 3163 call_runtime(BasicTypeArray* signature, LIRItemList* args, address entry, ValueType* result_type, CodeEmitInfo* info) argument [all...] |
/openjdk7/jdk/src/windows/native/sun/windows/ |
H A D | awt_Font.cpp | 1558 ENTRY entry; local 1560 VERIFY(::ReadFile(m_hTmpFile, &entry, sizeof(entry), &dwRead, NULL)); 1562 if (entry.tag == CMAPHEX) 1565 DASSERT(entry.tag == CMAPHEX); 1566 SwapULong(entry.offset); 1567 m_hTmpCMapOffset = entry.offset;
|
/openjdk7/jdk/src/share/native/com/sun/java/util/jar/pack/ |
H A D | unpack.cpp | 123 struct entry { struct 138 entry* *refs; 153 entry* ref(int refnum) { 164 entry* className() { 169 entry* memberClass() { 174 entry* memberDescr() { 179 entry* descrName() { 184 entry* descrType() { 217 entry* cpindex::get(uint i) { 228 inline bytes& entry [all...] |