Searched refs:optimizable (Results 1 – 12 of 12) sorted by relevance
1 ; Test ensures that non-optimizable array mallocs are not optimized; specifically2 ; GlobalOpt was treating a non-optimizable array malloc as a non-array malloc
133 if (!shared->code()->optimizable()) return; in AttemptOnStackReplacement()
52 case Code::FUNCTION: return code->optimizable() ? "~" : ""; in ComputeMarker()
4702 bool Code::optimizable() { in optimizable() function5810 return code()->kind() == Code::FUNCTION && code()->optimizable(); in IsOptimizable()
9100 code()->optimizable()); in MarkForOptimization()9111 DCHECK(shared()->allows_lazy_compilation() || code()->optimizable()); in MarkForConcurrentOptimization()9130 DCHECK(shared()->allows_lazy_compilation() || code()->optimizable()); in MarkInOptimizationQueue()9779 return code()->optimizable(); in IsInlineable()
8692 function->code()->optimizable())); in RUNTIME_FUNCTION()8786 if (!isolate->use_crankshaft() || !current_code->optimizable()) return false; in IsSuitableForOnStackReplacement()
5087 inline bool optimizable();
110 ; An undef in the shuffle list should still be optimizable
127 ; An undef in the shuffle list should still be optimizable
453 ;;;;;; Shuffles optimizable with a single insertps or blend instruction
304 generate the most optimizable C code from the modern C compiler point of
2061 This would allow for rebust and optimizable sorting