| OLD | NEW |
| 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 294 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 305 | 305 |
| 306 // The minimal number of cases in a switch before the fast-case switch | 306 // The minimal number of cases in a switch before the fast-case switch |
| 307 // optimization is enabled. Each platform should return a value that | 307 // optimization is enabled. Each platform should return a value that |
| 308 // is optimal compared to the default code generated for a switch statement | 308 // is optimal compared to the default code generated for a switch statement |
| 309 // on that platform. | 309 // on that platform. |
| 310 int FastCaseSwitchMinCaseCount(); | 310 int FastCaseSwitchMinCaseCount(); |
| 311 | 311 |
| 312 // Allocate a jump table and create code to jump through it. | 312 // Allocate a jump table and create code to jump through it. |
| 313 // Should call GenerateFastCaseSwitchCases to generate the code for | 313 // Should call GenerateFastCaseSwitchCases to generate the code for |
| 314 // all the cases at the appropriate point. | 314 // all the cases at the appropriate point. |
| 315 void GenerateFastCaseSwitchJumpTable(SwitchStatement* node, int min_index, | 315 void GenerateFastCaseSwitchJumpTable(SwitchStatement* node, |
| 316 int range, Label *fail_label, | 316 int min_index, |
| 317 SmartPointer<Label*> &case_targets, | 317 int range, |
| 318 SmartPointer<Label>& case_labels); | 318 Label* fail_label, |
| 319 Vector<Label*> case_targets, |
| 320 Vector<Label> case_labels); |
| 319 | 321 |
| 320 // Generate the code for cases for the fast case switch. | 322 // Generate the code for cases for the fast case switch. |
| 321 // Called by GenerateFastCaseSwitchJumpTable. | 323 // Called by GenerateFastCaseSwitchJumpTable. |
| 322 void GenerateFastCaseSwitchCases(SwitchStatement* node, | 324 void GenerateFastCaseSwitchCases(SwitchStatement* node, |
| 323 SmartPointer<Label> &case_labels); | 325 Vector<Label> case_labels); |
| 324 | 326 |
| 325 // Fast support for constant-Smi switches. | 327 // Fast support for constant-Smi switches. |
| 326 void GenerateFastCaseSwitchStatement(SwitchStatement *node, int min_index, | 328 void GenerateFastCaseSwitchStatement(SwitchStatement* node, |
| 327 int range, int default_index); | 329 int min_index, |
| 330 int range, |
| 331 int default_index); |
| 328 | 332 |
| 329 // Fast support for constant-Smi switches. Tests whether switch statement | 333 // Fast support for constant-Smi switches. Tests whether switch statement |
| 330 // permits optimization and calls GenerateFastCaseSwitch if it does. | 334 // permits optimization and calls GenerateFastCaseSwitch if it does. |
| 331 // Returns true if the fast-case switch was generated, and false if not. | 335 // Returns true if the fast-case switch was generated, and false if not. |
| 332 bool TryGenerateFastCaseSwitchStatement(SwitchStatement *node); | 336 bool TryGenerateFastCaseSwitchStatement(SwitchStatement* node); |
| 333 | 337 |
| 334 | 338 |
| 335 // Bottle-neck interface to call the Assembler to generate the statement | 339 // Bottle-neck interface to call the Assembler to generate the statement |
| 336 // position. This allows us to easily control whether statement positions | 340 // position. This allows us to easily control whether statement positions |
| 337 // should be generated or not. | 341 // should be generated or not. |
| 338 void RecordStatementPosition(Node* node); | 342 void RecordStatementPosition(Node* node); |
| 339 | 343 |
| 340 // Activation frames. | 344 // Activation frames. |
| 341 void EnterJSFrame(); | 345 void EnterJSFrame(); |
| 342 void ExitJSFrame(); | 346 void ExitJSFrame(); |
| (...skipping 20 matching lines...) Expand all Loading... |
| 363 friend class Property; | 367 friend class Property; |
| 364 friend class VariableProxy; | 368 friend class VariableProxy; |
| 365 friend class Slot; | 369 friend class Slot; |
| 366 | 370 |
| 367 DISALLOW_COPY_AND_ASSIGN(CodeGenerator); | 371 DISALLOW_COPY_AND_ASSIGN(CodeGenerator); |
| 368 }; | 372 }; |
| 369 | 373 |
| 370 } } // namespace v8::internal | 374 } } // namespace v8::internal |
| 371 | 375 |
| 372 #endif // V8_CODEGEN_ARM_H_ | 376 #endif // V8_CODEGEN_ARM_H_ |
| OLD | NEW |