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 8676 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
8687 if (FLAG_deopt_every_n_times) { | 8687 if (FLAG_deopt_every_n_times) { |
8688 return Smi::FromInt(6); // 6 == "maybe deopted". | 8688 return Smi::FromInt(6); // 6 == "maybe deopted". |
8689 } | 8689 } |
8690 return function->IsOptimized() ? Smi::FromInt(1) // 1 == "yes". | 8690 return function->IsOptimized() ? Smi::FromInt(1) // 1 == "yes". |
8691 : Smi::FromInt(2); // 2 == "no". | 8691 : Smi::FromInt(2); // 2 == "no". |
8692 } | 8692 } |
8693 | 8693 |
8694 | 8694 |
8695 RUNTIME_FUNCTION(MaybeObject*, Runtime_UnblockConcurrentRecompilation) { | 8695 RUNTIME_FUNCTION(MaybeObject*, Runtime_UnblockConcurrentRecompilation) { |
8696 RUNTIME_ASSERT(FLAG_block_concurrent_recompilation); | 8696 RUNTIME_ASSERT(FLAG_block_concurrent_recompilation); |
| 8697 RUNTIME_ASSERT(isolate->concurrent_recompilation_enabled()); |
8697 isolate->optimizing_compiler_thread()->Unblock(); | 8698 isolate->optimizing_compiler_thread()->Unblock(); |
8698 return isolate->heap()->undefined_value(); | 8699 return isolate->heap()->undefined_value(); |
8699 } | 8700 } |
8700 | 8701 |
8701 | 8702 |
8702 RUNTIME_FUNCTION(MaybeObject*, Runtime_GetOptimizationCount) { | 8703 RUNTIME_FUNCTION(MaybeObject*, Runtime_GetOptimizationCount) { |
8703 HandleScope scope(isolate); | 8704 HandleScope scope(isolate); |
8704 ASSERT(args.length() == 1); | 8705 ASSERT(args.length() == 1); |
8705 CONVERT_ARG_HANDLE_CHECKED(JSFunction, function, 0); | 8706 CONVERT_ARG_HANDLE_CHECKED(JSFunction, function, 0); |
8706 return Smi::FromInt(function->shared()->opt_count()); | 8707 return Smi::FromInt(function->shared()->opt_count()); |
(...skipping 6391 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
15098 // Handle last resort GC and make sure to allow future allocations | 15099 // Handle last resort GC and make sure to allow future allocations |
15099 // to grow the heap without causing GCs (if possible). | 15100 // to grow the heap without causing GCs (if possible). |
15100 isolate->counters()->gc_last_resort_from_js()->Increment(); | 15101 isolate->counters()->gc_last_resort_from_js()->Increment(); |
15101 isolate->heap()->CollectAllGarbage(Heap::kNoGCFlags, | 15102 isolate->heap()->CollectAllGarbage(Heap::kNoGCFlags, |
15102 "Runtime::PerformGC"); | 15103 "Runtime::PerformGC"); |
15103 } | 15104 } |
15104 } | 15105 } |
15105 | 15106 |
15106 | 15107 |
15107 } } // namespace v8::internal | 15108 } } // namespace v8::internal |
OLD | NEW |