equal
deleted
inserted
replaced
1413 ProfileData* MethodData::bci_to_extra_data_helper(int bci, Method* m, DataLayout*& dp, bool concurrent) { |
1413 ProfileData* MethodData::bci_to_extra_data_helper(int bci, Method* m, DataLayout*& dp, bool concurrent) { |
1414 DataLayout* end = args_data_limit(); |
1414 DataLayout* end = args_data_limit(); |
1415 |
1415 |
1416 for (;; dp = next_extra(dp)) { |
1416 for (;; dp = next_extra(dp)) { |
1417 assert(dp < end, "moved past end of extra data"); |
1417 assert(dp < end, "moved past end of extra data"); |
1418 // No need for "OrderAccess::load_acquire" ops, |
1418 // No need for "Atomic::load_acquire" ops, |
1419 // since the data structure is monotonic. |
1419 // since the data structure is monotonic. |
1420 switch(dp->tag()) { |
1420 switch(dp->tag()) { |
1421 case DataLayout::no_tag: |
1421 case DataLayout::no_tag: |
1422 return NULL; |
1422 return NULL; |
1423 case DataLayout::arg_info_data_tag: |
1423 case DataLayout::arg_info_data_tag: |
1548 st->print_cr("--- Extra data:"); |
1548 st->print_cr("--- Extra data:"); |
1549 DataLayout* dp = extra_data_base(); |
1549 DataLayout* dp = extra_data_base(); |
1550 DataLayout* end = args_data_limit(); |
1550 DataLayout* end = args_data_limit(); |
1551 for (;; dp = next_extra(dp)) { |
1551 for (;; dp = next_extra(dp)) { |
1552 assert(dp < end, "moved past end of extra data"); |
1552 assert(dp < end, "moved past end of extra data"); |
1553 // No need for "OrderAccess::load_acquire" ops, |
1553 // No need for "Atomic::load_acquire" ops, |
1554 // since the data structure is monotonic. |
1554 // since the data structure is monotonic. |
1555 switch(dp->tag()) { |
1555 switch(dp->tag()) { |
1556 case DataLayout::no_tag: |
1556 case DataLayout::no_tag: |
1557 continue; |
1557 continue; |
1558 case DataLayout::bit_data_tag: |
1558 case DataLayout::bit_data_tag: |