Cross Reference: /openjdk7/hotspot/src/cpu/x86/vm/templateTable_x86

Lines Matching defs:array
464   // Load the exception from the system-array which wraps it:
633 void TemplateTable::index_check(Register array, Register index) {
634   // Pop ptr into array
635   __ pop_ptr(array);
636   index_check_without_pop(array, index);
639 void TemplateTable::index_check_without_pop(Register array, Register index) {
641   // check array
642   __ null_check(array, arrayOopDesc::length_offset_in_bytes());
645   __ cmpl(index, Address(array, arrayOopDesc::length_offset_in_bytes()));
648     assert(rbx != array, "different registers");
658   // rdx: array
668   // rdx: array
679   // rdx: array
688   // rdx: array
697   // rdx: array
706   // rdx: array
717   // rdx: array
732   // rdx: array
741   // rdx: array
923   // rdx: array
934   // rcx: array
946   // rdx: array
957   // rdx: array
968   // stack: ..., array, index, value
975   // do array store check - check for NULL value first
984   // Compress array+index*wordSize+12 into a single register.  Frees ECX.
1005   // Have a NULL in EAX, EDX=array, ECX=index.  Store NULL at ary[idx]
1022   // rdx: array
1033   // rdx: array
1924   // int binary_search(int key, LookupswitchPair* array, int n) {
1932   //     // where a stands for the array and assuming that the (inexisting)
1936   //     if (key < array[h].fast_match()) {
1943   //   // (i.e., if key is within array, i is the correct index)
1949   const Register array = rbx;
1954   // setup array
1957   __ lea(array, at_bcp(3*wordSize));             // btw: should be able to get rid of this instruction (change offsets below)
1958   __ andptr(array, -wordSize);
1961   __ movl(j, Address(array, -wordSize));         // j = length(array);
1974     // if (key < array[h].fast_match()) {
1979     // Convert array[h].match to native byte-ordering before compare
1980     __ movl(temp, Address(array, h, Address::times_8, 0*wordSize));
1983     // j = h if (key <  array[h].fast_match())
1985     // i = h if (key >= array[h].fast_match())
1996   // Convert array[i].match to native byte-ordering before compare
1997   __ movl(temp, Address(array, i, Address::times_8, 0*wordSize));
2003   __ movl(j , Address(array, i, Address::times_8, 1*wordSize));
2004   __ profile_switch_case(i, key, array);
2017   __ movl(j, Address(array, -2*wordSize));
3414   __ get_cpool_and_tags(rcx, rdx); // ECX=cpool, EDX=tags array
3465   __ get_cpool_and_tags(rcx, rdx); // ECX=cpool, EDX=tags array
3698   // the latter wordSize to point to the beginning of the array.