OLD | NEW |
1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 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 439 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
450 // through the context chain. | 450 // through the context chain. |
451 void LoadTypeofExpression(Expression* x); | 451 void LoadTypeofExpression(Expression* x); |
452 | 452 |
453 // Translate the value on top of the frame into control flow to the | 453 // Translate the value on top of the frame into control flow to the |
454 // control destination. | 454 // control destination. |
455 void ToBoolean(ControlDestination* destination); | 455 void ToBoolean(ControlDestination* destination); |
456 | 456 |
457 // Generate code that computes a shortcutting logical operation. | 457 // Generate code that computes a shortcutting logical operation. |
458 void GenerateLogicalBooleanOperation(BinaryOperation* node); | 458 void GenerateLogicalBooleanOperation(BinaryOperation* node); |
459 | 459 |
460 void GenericBinaryOperation( | 460 void GenericBinaryOperation(BinaryOperation* expr, |
461 Token::Value op, | 461 OverwriteMode overwrite_mode); |
462 StaticType* type, | |
463 OverwriteMode overwrite_mode); | |
464 | 462 |
465 // If possible, combine two constant smi values using op to produce | 463 // If possible, combine two constant smi values using op to produce |
466 // a smi result, and push it on the virtual frame, all at compile time. | 464 // a smi result, and push it on the virtual frame, all at compile time. |
467 // Returns true if it succeeds. Otherwise it has no effect. | 465 // Returns true if it succeeds. Otherwise it has no effect. |
468 bool FoldConstantSmis(Token::Value op, int left, int right); | 466 bool FoldConstantSmis(Token::Value op, int left, int right); |
469 | 467 |
470 // Emit code to perform a binary operation on a constant | 468 // Emit code to perform a binary operation on a constant |
471 // smi and a likely smi. Consumes the Result *operand. | 469 // smi and a likely smi. Consumes the Result *operand. |
472 Result ConstantSmiBinaryOperation(Token::Value op, | 470 Result ConstantSmiBinaryOperation(BinaryOperation* expr, |
473 Result* operand, | 471 Result* operand, |
474 Handle<Object> constant_operand, | 472 Handle<Object> constant_operand, |
475 StaticType* type, | |
476 bool reversed, | 473 bool reversed, |
477 OverwriteMode overwrite_mode); | 474 OverwriteMode overwrite_mode); |
478 | 475 |
479 // Emit code to perform a binary operation on two likely smis. | 476 // Emit code to perform a binary operation on two likely smis. |
480 // The code to handle smi arguments is produced inline. | 477 // The code to handle smi arguments is produced inline. |
481 // Consumes the Results *left and *right. | 478 // Consumes the Results *left and *right. |
482 Result LikelySmiBinaryOperation(Token::Value op, | 479 Result LikelySmiBinaryOperation(BinaryOperation* expr, |
483 Result* left, | 480 Result* left, |
484 Result* right, | 481 Result* right, |
485 OverwriteMode overwrite_mode); | 482 OverwriteMode overwrite_mode); |
486 | 483 |
487 void Comparison(AstNode* node, | 484 void Comparison(AstNode* node, |
488 Condition cc, | 485 Condition cc, |
489 bool strict, | 486 bool strict, |
490 ControlDestination* destination); | 487 ControlDestination* destination); |
491 void GenerateInlineNumberComparison(Result* left_side, | 488 void GenerateInlineNumberComparison(Result* left_side, |
492 Result* right_side, | 489 Result* right_side, |
(...skipping 501 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
994 void Print() { | 991 void Print() { |
995 PrintF("NumberToStringStub\n"); | 992 PrintF("NumberToStringStub\n"); |
996 } | 993 } |
997 #endif | 994 #endif |
998 }; | 995 }; |
999 | 996 |
1000 | 997 |
1001 } } // namespace v8::internal | 998 } } // namespace v8::internal |
1002 | 999 |
1003 #endif // V8_X64_CODEGEN_X64_H_ | 1000 #endif // V8_X64_CODEGEN_X64_H_ |
OLD | NEW |