Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(543)

Side by Side Diff: src/heap.cc

Issue 8700008: New approach to Crankshaft decision-making (Closed) Base URL: https://v8.googlecode.com/svn/branches/bleeding_edge
Patch Set: fix function self-optimization; address first comment Created 9 years ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch | Annotate | Revision Log
OLDNEW
1 // Copyright 2011 the V8 project authors. All rights reserved. 1 // Copyright 2011 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 1139 matching lines...) Expand 10 before | Expand all | Expand 10 after
1150 isolate_->global_handles()->IterateNewSpaceWeakIndependentRoots( 1150 isolate_->global_handles()->IterateNewSpaceWeakIndependentRoots(
1151 &scavenge_visitor); 1151 &scavenge_visitor);
1152 new_space_front = DoScavenge(&scavenge_visitor, new_space_front); 1152 new_space_front = DoScavenge(&scavenge_visitor, new_space_front);
1153 1153
1154 UpdateNewSpaceReferencesInExternalStringTable( 1154 UpdateNewSpaceReferencesInExternalStringTable(
1155 &UpdateNewSpaceReferenceInExternalStringTableEntry); 1155 &UpdateNewSpaceReferenceInExternalStringTableEntry);
1156 1156
1157 promotion_queue_.Destroy(); 1157 promotion_queue_.Destroy();
1158 1158
1159 LiveObjectList::UpdateReferencesForScavengeGC(); 1159 LiveObjectList::UpdateReferencesForScavengeGC();
1160 isolate()->runtime_profiler()->UpdateSamplesAfterScavenge();
1161 incremental_marking()->UpdateMarkingDequeAfterScavenge(); 1160 incremental_marking()->UpdateMarkingDequeAfterScavenge();
1162 1161
1163 ASSERT(new_space_front == new_space_.top()); 1162 ASSERT(new_space_front == new_space_.top());
1164 1163
1165 // Set age mark. 1164 // Set age mark.
1166 new_space_.set_age_mark(new_space_.top()); 1165 new_space_.set_age_mark(new_space_.top());
1167 1166
1168 new_space_.LowerInlineAllocationLimit( 1167 new_space_.LowerInlineAllocationLimit(
1169 new_space_.inline_allocation_limit_step()); 1168 new_space_.inline_allocation_limit_step());
1170 1169
(...skipping 2194 matching lines...) Expand 10 before | Expand all | Expand 10 after
3365 Object* prototype) { 3364 Object* prototype) {
3366 ASSERT(!prototype->IsMap()); 3365 ASSERT(!prototype->IsMap());
3367 function->initialize_properties(); 3366 function->initialize_properties();
3368 function->initialize_elements(); 3367 function->initialize_elements();
3369 function->set_shared(shared); 3368 function->set_shared(shared);
3370 function->set_code(shared->code()); 3369 function->set_code(shared->code());
3371 function->set_prototype_or_initial_map(prototype); 3370 function->set_prototype_or_initial_map(prototype);
3372 function->set_context(undefined_value()); 3371 function->set_context(undefined_value());
3373 function->set_literals_or_bindings(empty_fixed_array()); 3372 function->set_literals_or_bindings(empty_fixed_array());
3374 function->set_next_function_link(undefined_value()); 3373 function->set_next_function_link(undefined_value());
3374 function->set_profiler_ticks(0);
3375 } 3375 }
3376 3376
3377 3377
3378 MaybeObject* Heap::AllocateFunctionPrototype(JSFunction* function) { 3378 MaybeObject* Heap::AllocateFunctionPrototype(JSFunction* function) {
3379 // Allocate the prototype. Make sure to use the object function 3379 // Allocate the prototype. Make sure to use the object function
3380 // from the function's context, since the function can be from a 3380 // from the function's context, since the function can be from a
3381 // different context. 3381 // different context.
3382 JSFunction* object_function = 3382 JSFunction* object_function =
3383 function->context()->global_context()->object_function(); 3383 function->context()->global_context()->object_function();
3384 3384
(...skipping 3198 matching lines...) Expand 10 before | Expand all | Expand 10 after
6583 isolate_->heap()->store_buffer()->Compact(); 6583 isolate_->heap()->store_buffer()->Compact();
6584 isolate_->heap()->store_buffer()->Filter(MemoryChunk::ABOUT_TO_BE_FREED); 6584 isolate_->heap()->store_buffer()->Filter(MemoryChunk::ABOUT_TO_BE_FREED);
6585 for (chunk = chunks_queued_for_free_; chunk != NULL; chunk = next) { 6585 for (chunk = chunks_queued_for_free_; chunk != NULL; chunk = next) {
6586 next = chunk->next_chunk(); 6586 next = chunk->next_chunk();
6587 isolate_->memory_allocator()->Free(chunk); 6587 isolate_->memory_allocator()->Free(chunk);
6588 } 6588 }
6589 chunks_queued_for_free_ = NULL; 6589 chunks_queued_for_free_ = NULL;
6590 } 6590 }
6591 6591
6592 } } // namespace v8::internal 6592 } } // namespace v8::internal
OLDNEW
« no previous file with comments | « src/full-codegen.cc ('k') | src/ia32/code-stubs-ia32.cc » ('j') | src/ia32/full-codegen-ia32.cc » ('J')

Powered by Google App Engine
This is Rietveld 408576698