Chromium Code Reviews| OLD | NEW |
|---|---|
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| (...skipping 8920 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 8931 | 8931 |
| 8932 void Code::FindAllCode(CodeHandleList* code_list, int length) { | 8932 void Code::FindAllCode(CodeHandleList* code_list, int length) { |
| 8933 ASSERT(is_inline_cache_stub()); | 8933 ASSERT(is_inline_cache_stub()); |
| 8934 AssertNoAllocation no_allocation; | 8934 AssertNoAllocation no_allocation; |
| 8935 int mask = RelocInfo::ModeMask(RelocInfo::CODE_TARGET); | 8935 int mask = RelocInfo::ModeMask(RelocInfo::CODE_TARGET); |
| 8936 int i = 0; | 8936 int i = 0; |
| 8937 for (RelocIterator it(this, mask); !it.done(); it.next()) { | 8937 for (RelocIterator it(this, mask); !it.done(); it.next()) { |
| 8938 if (i++ == length) return; | 8938 if (i++ == length) return; |
| 8939 RelocInfo* info = it.rinfo(); | 8939 RelocInfo* info = it.rinfo(); |
| 8940 Code* code = Code::GetCodeFromTargetAddress(info->target_address()); | 8940 Code* code = Code::GetCodeFromTargetAddress(info->target_address()); |
| 8941 ASSERT(code->kind() == Code::STUB); | |
|
danno
2013/03/12 11:16:16
Why did you have to remove this? Should still be v
| |
| 8942 code_list->Add(Handle<Code>(code)); | 8941 code_list->Add(Handle<Code>(code)); |
| 8943 } | 8942 } |
| 8944 UNREACHABLE(); | 8943 UNREACHABLE(); |
| 8945 } | 8944 } |
| 8946 | 8945 |
| 8947 | 8946 |
| 8948 void Code::ClearInlineCaches() { | 8947 void Code::ClearInlineCaches() { |
| 8949 int mask = RelocInfo::ModeMask(RelocInfo::CODE_TARGET) | | 8948 int mask = RelocInfo::ModeMask(RelocInfo::CODE_TARGET) | |
| 8950 RelocInfo::ModeMask(RelocInfo::CONSTRUCT_CALL) | | 8949 RelocInfo::ModeMask(RelocInfo::CONSTRUCT_CALL) | |
| 8951 RelocInfo::ModeMask(RelocInfo::CODE_TARGET_WITH_ID) | | 8950 RelocInfo::ModeMask(RelocInfo::CODE_TARGET_WITH_ID) | |
| (...skipping 5332 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
| 14284 set_year(Smi::FromInt(year), SKIP_WRITE_BARRIER); | 14283 set_year(Smi::FromInt(year), SKIP_WRITE_BARRIER); |
| 14285 set_month(Smi::FromInt(month), SKIP_WRITE_BARRIER); | 14284 set_month(Smi::FromInt(month), SKIP_WRITE_BARRIER); |
| 14286 set_day(Smi::FromInt(day), SKIP_WRITE_BARRIER); | 14285 set_day(Smi::FromInt(day), SKIP_WRITE_BARRIER); |
| 14287 set_weekday(Smi::FromInt(weekday), SKIP_WRITE_BARRIER); | 14286 set_weekday(Smi::FromInt(weekday), SKIP_WRITE_BARRIER); |
| 14288 set_hour(Smi::FromInt(hour), SKIP_WRITE_BARRIER); | 14287 set_hour(Smi::FromInt(hour), SKIP_WRITE_BARRIER); |
| 14289 set_min(Smi::FromInt(min), SKIP_WRITE_BARRIER); | 14288 set_min(Smi::FromInt(min), SKIP_WRITE_BARRIER); |
| 14290 set_sec(Smi::FromInt(sec), SKIP_WRITE_BARRIER); | 14289 set_sec(Smi::FromInt(sec), SKIP_WRITE_BARRIER); |
| 14291 } | 14290 } |
| 14292 | 14291 |
| 14293 } } // namespace v8::internal | 14292 } } // namespace v8::internal |
| OLD | NEW |