OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 991 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1002 isolate_->heap()->mark_compact_collector()-> | 1002 isolate_->heap()->mark_compact_collector()-> |
1003 RecordSlot(code_slot, code_slot, *code_slot); | 1003 RecordSlot(code_slot, code_slot, *code_slot); |
1004 | 1004 |
1005 candidate = next_candidate; | 1005 candidate = next_candidate; |
1006 } | 1006 } |
1007 | 1007 |
1008 shared_function_info_candidates_head_ = NULL; | 1008 shared_function_info_candidates_head_ = NULL; |
1009 } | 1009 } |
1010 | 1010 |
1011 | 1011 |
1012 bool CodeFlusher::ContainsCandidate(SharedFunctionInfo* shared_info) { | |
1013 SharedFunctionInfo* candidate = shared_function_info_candidates_head_; | |
1014 while (candidate != NULL) { | |
1015 if (candidate == shared_info) return true; | |
1016 candidate = GetNextCandidate(candidate); | |
1017 } | |
1018 return false; | |
1019 } | |
1020 | |
1021 | |
1022 void CodeFlusher::EvictCandidate(SharedFunctionInfo* shared_info) { | 1012 void CodeFlusher::EvictCandidate(SharedFunctionInfo* shared_info) { |
1023 // Make sure previous flushing decisions are revisited. | 1013 // Make sure previous flushing decisions are revisited. |
1024 isolate_->heap()->incremental_marking()->RecordWrites(shared_info); | 1014 isolate_->heap()->incremental_marking()->RecordWrites(shared_info); |
1025 | 1015 |
1026 SharedFunctionInfo* candidate = shared_function_info_candidates_head_; | 1016 SharedFunctionInfo* candidate = shared_function_info_candidates_head_; |
1027 SharedFunctionInfo* next_candidate; | 1017 SharedFunctionInfo* next_candidate; |
1028 if (candidate == shared_info) { | 1018 if (candidate == shared_info) { |
1029 next_candidate = GetNextCandidate(shared_info); | 1019 next_candidate = GetNextCandidate(shared_info); |
1030 shared_function_info_candidates_head_ = next_candidate; | 1020 shared_function_info_candidates_head_ = next_candidate; |
1031 ClearNextCandidate(shared_info); | 1021 ClearNextCandidate(shared_info); |
(...skipping 3014 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
4046 while (buffer != NULL) { | 4036 while (buffer != NULL) { |
4047 SlotsBuffer* next_buffer = buffer->next(); | 4037 SlotsBuffer* next_buffer = buffer->next(); |
4048 DeallocateBuffer(buffer); | 4038 DeallocateBuffer(buffer); |
4049 buffer = next_buffer; | 4039 buffer = next_buffer; |
4050 } | 4040 } |
4051 *buffer_address = NULL; | 4041 *buffer_address = NULL; |
4052 } | 4042 } |
4053 | 4043 |
4054 | 4044 |
4055 } } // namespace v8::internal | 4045 } } // namespace v8::internal |
OLD | NEW |