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 273 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
284 Isolate* isolate() const { return isolate_; } | 284 Isolate* isolate() const { return isolate_; } |
285 Zone* zone() const { return zone_; } | 285 Zone* zone() const { return zone_; } |
286 CompilationInfo* info() const { return info_; } | 286 CompilationInfo* info() const { return info_; } |
287 | 287 |
288 const ZoneList<HBasicBlock*>* blocks() const { return &blocks_; } | 288 const ZoneList<HBasicBlock*>* blocks() const { return &blocks_; } |
289 const ZoneList<HPhi*>* phi_list() const { return phi_list_; } | 289 const ZoneList<HPhi*>* phi_list() const { return phi_list_; } |
290 HBasicBlock* entry_block() const { return entry_block_; } | 290 HBasicBlock* entry_block() const { return entry_block_; } |
291 HEnvironment* start_environment() const { return start_environment_; } | 291 HEnvironment* start_environment() const { return start_environment_; } |
292 | 292 |
293 void FinalizeUniqueValueIds(); | 293 void FinalizeUniqueValueIds(); |
294 void InitializeInferredTypes(); | |
295 void InsertTypeConversions(); | 294 void InsertTypeConversions(); |
296 void MergeRemovableSimulates(); | 295 void MergeRemovableSimulates(); |
297 void InsertRepresentationChanges(); | 296 void InsertRepresentationChanges(); |
298 void MarkDeoptimizeOnUndefined(); | 297 void MarkDeoptimizeOnUndefined(); |
299 void ComputeMinusZeroChecks(); | 298 void ComputeMinusZeroChecks(); |
300 bool ProcessArgumentsObject(); | 299 bool ProcessArgumentsObject(); |
301 void Canonicalize(); | 300 void Canonicalize(); |
302 void OrderBlocks(); | 301 void OrderBlocks(); |
303 void AssignDominators(); | 302 void AssignDominators(); |
304 void SetupInformativeDefinitions(); | 303 void SetupInformativeDefinitions(); |
(...skipping 147 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
452 void MarkAsDeoptimizingRecursively(HBasicBlock* block); | 451 void MarkAsDeoptimizingRecursively(HBasicBlock* block); |
453 void NullifyUnreachableInstructions(); | 452 void NullifyUnreachableInstructions(); |
454 void InsertTypeConversions(HInstruction* instr); | 453 void InsertTypeConversions(HInstruction* instr); |
455 void PropagateMinusZeroChecks(HValue* value, BitVector* visited); | 454 void PropagateMinusZeroChecks(HValue* value, BitVector* visited); |
456 void RecursivelyMarkPhiDeoptimizeOnUndefined(HPhi* phi); | 455 void RecursivelyMarkPhiDeoptimizeOnUndefined(HPhi* phi); |
457 void InsertRepresentationChangeForUse(HValue* value, | 456 void InsertRepresentationChangeForUse(HValue* value, |
458 HValue* use_value, | 457 HValue* use_value, |
459 int use_index, | 458 int use_index, |
460 Representation to); | 459 Representation to); |
461 void InsertRepresentationChangesForValue(HValue* value); | 460 void InsertRepresentationChangesForValue(HValue* value); |
462 void InferTypes(ZoneList<HValue*>* worklist); | |
463 void InitializeInferredTypes(int from_inclusive, int to_inclusive); | |
464 void CheckForBackEdge(HBasicBlock* block, HBasicBlock* successor); | 461 void CheckForBackEdge(HBasicBlock* block, HBasicBlock* successor); |
465 void SetupInformativeDefinitionsInBlock(HBasicBlock* block); | 462 void SetupInformativeDefinitionsInBlock(HBasicBlock* block); |
466 void SetupInformativeDefinitionsRecursively(HBasicBlock* block); | 463 void SetupInformativeDefinitionsRecursively(HBasicBlock* block); |
467 void EliminateRedundantBoundsChecks(HBasicBlock* bb, BoundsCheckTable* table); | 464 void EliminateRedundantBoundsChecks(HBasicBlock* bb, BoundsCheckTable* table); |
468 | 465 |
469 Isolate* isolate_; | 466 Isolate* isolate_; |
470 int next_block_id_; | 467 int next_block_id_; |
471 HBasicBlock* entry_block_; | 468 HBasicBlock* entry_block_; |
472 HEnvironment* start_environment_; | 469 HEnvironment* start_environment_; |
473 ZoneList<HBasicBlock*> blocks_; | 470 ZoneList<HBasicBlock*> blocks_; |
(...skipping 1626 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2100 EmbeddedVector<char, 64> filename_; | 2097 EmbeddedVector<char, 64> filename_; |
2101 HeapStringAllocator string_allocator_; | 2098 HeapStringAllocator string_allocator_; |
2102 StringStream trace_; | 2099 StringStream trace_; |
2103 int indent_; | 2100 int indent_; |
2104 }; | 2101 }; |
2105 | 2102 |
2106 | 2103 |
2107 } } // namespace v8::internal | 2104 } } // namespace v8::internal |
2108 | 2105 |
2109 #endif // V8_HYDROGEN_H_ | 2106 #endif // V8_HYDROGEN_H_ |
OLD | NEW |