mirror of
				https://github.com/tc39/test262.git
				synced 2025-10-31 19:53:50 +01:00 
			
		
		
		
	sourceRevisionAtLastExport: 33f2fb0e53d135f0ee17cfccd9d993eb2a6f47de targetRevisionAtLastExport: 31340cbd9add103f586d501b0c3354b7b182abc0
		
			
				
	
	
		
			36 lines
		
	
	
		
			753 B
		
	
	
	
		
			JavaScript
		
	
	
	
	
	
			
		
		
	
	
			36 lines
		
	
	
		
			753 B
		
	
	
	
		
			JavaScript
		
	
	
	
	
	
| // Copyright 2015 the V8 project authors. All rights reserved.
 | |
| // Use of this source code is governed by a BSD-style license that can be
 | |
| // found in the LICENSE file.
 | |
| 
 | |
| // Flags: --allow-natives-syntax
 | |
| 
 | |
| function f(a, i, bool) {
 | |
|   var result;
 | |
|   if (bool) {
 | |
|     // Make sure i - -0x80000000 doesn't overflow in BCE, missing a check for
 | |
|     // x-0 later on.
 | |
|     result = f2(a, 0x7fffffff, i, i, -0x80000000);
 | |
|   } else {
 | |
|     result = f2(a, -3, 4, i, 0);
 | |
|   }
 | |
|   return result;
 | |
| }
 | |
| 
 | |
| function f2(a, c, x, i, d) {
 | |
|   return a[x + c] + a[x - 0] + a[i - d];
 | |
| }
 | |
| 
 | |
| 
 | |
| var a = [];
 | |
| var i = 0;
 | |
| a.push(i++);
 | |
| a.push(i++);
 | |
| a.push(i++);
 | |
| a.push(i++);
 | |
| a.push(i++);
 | |
| f(a, 0, false);
 | |
| f(a, 0, false);
 | |
| f(a, 0, false);
 | |
| %OptimizeFunctionOnNextCall(f);
 | |
| %DebugPrint(f(a, -0x7fffffff, true));
 |