OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 27 matching lines...) Expand all Loading... |
38 // Trims live ranges of environment slots by doing explicit liveness analysis. | 38 // Trims live ranges of environment slots by doing explicit liveness analysis. |
39 // Values in the environment are kept alive by every subsequent LInstruction | 39 // Values in the environment are kept alive by every subsequent LInstruction |
40 // that is assigned an LEnvironment, which creates register pressure and | 40 // that is assigned an LEnvironment, which creates register pressure and |
41 // unnecessary spill slot moves. Therefore it is beneficial to trim the | 41 // unnecessary spill slot moves. Therefore it is beneficial to trim the |
42 // live ranges of environment slots by zapping them with a constant after | 42 // live ranges of environment slots by zapping them with a constant after |
43 // the last lookup that refers to them. | 43 // the last lookup that refers to them. |
44 // Slots are identified by their index and only affected if whitelisted in | 44 // Slots are identified by their index and only affected if whitelisted in |
45 // HOptimizedGraphBuilder::IsEligibleForEnvironmentLivenessAnalysis(). | 45 // HOptimizedGraphBuilder::IsEligibleForEnvironmentLivenessAnalysis(). |
46 class EnvironmentSlotLivenessAnalyzer { | 46 class EnvironmentSlotLivenessAnalyzer { |
47 public: | 47 public: |
48 explicit EnvironmentSlotLivenessAnalyzer(HGraph* graph); | 48 EnvironmentSlotLivenessAnalyzer(HGraph* graph, Zone* phase_zone); |
49 | 49 |
50 void AnalyzeAndTrim(); | 50 void Run(); |
51 | 51 |
52 private: | 52 private: |
53 void ZapEnvironmentSlot(int index, HSimulate* simulate); | 53 void ZapEnvironmentSlot(int index, HSimulate* simulate); |
54 void ZapEnvironmentSlotsInSuccessors(HBasicBlock* block, BitVector* live); | 54 void ZapEnvironmentSlotsInSuccessors(HBasicBlock* block, BitVector* live); |
55 void ZapEnvironmentSlotsForInstruction(HEnvironmentMarker* marker); | 55 void ZapEnvironmentSlotsForInstruction(HEnvironmentMarker* marker); |
56 void UpdateLivenessAtBlockEnd(HBasicBlock* block, BitVector* live); | 56 void UpdateLivenessAtBlockEnd(HBasicBlock* block, BitVector* live); |
57 void UpdateLivenessAtInstruction(HInstruction* instr, BitVector* live); | 57 void UpdateLivenessAtInstruction(HInstruction* instr, BitVector* live); |
58 | 58 |
59 Zone* zone() { return &zone_; } | 59 Zone* phase_zone() { return phase_zone_; } |
60 | 60 |
61 HGraph* graph_; | 61 HGraph* graph_; |
62 // Use a dedicated Zone for this phase, with a ZoneScope to ensure it | 62 Zone* phase_zone_; |
63 // gets freed. | 63 ZoneScope phase_zone_scope_; |
64 Zone zone_; | |
65 ZoneScope zone_scope_; | |
66 | 64 |
67 int block_count_; | 65 int block_count_; |
68 | 66 |
69 // Largest number of local variables in any environment in the graph | 67 // Largest number of local variables in any environment in the graph |
70 // (including inlined environments). | 68 // (including inlined environments). |
71 int maximum_environment_size_; | 69 int maximum_environment_size_; |
72 | 70 |
73 // Per-block data. All these lists are indexed by block_id. | 71 // Per-block data. All these lists are indexed by block_id. |
74 ZoneList<BitVector*>* live_at_block_start_; | 72 ZoneList<BitVector*>* live_at_block_start_; |
75 ZoneList<HSimulate*>* first_simulate_; | 73 ZoneList<HSimulate*>* first_simulate_; |
76 ZoneList<BitVector*>* first_simulate_invalid_for_index_; | 74 ZoneList<BitVector*>* first_simulate_invalid_for_index_; |
77 | 75 |
78 // List of all HEnvironmentMarker instructions for quick iteration/deletion. | 76 // List of all HEnvironmentMarker instructions for quick iteration/deletion. |
79 // It is populated during the first pass over the graph, controlled by | 77 // It is populated during the first pass over the graph, controlled by |
80 // |collect_markers_|. | 78 // |collect_markers_|. |
81 ZoneList<HEnvironmentMarker*>* markers_; | 79 ZoneList<HEnvironmentMarker*>* markers_; |
82 bool collect_markers_; | 80 bool collect_markers_; |
83 | 81 |
84 // Keeps track of the last simulate seen, as well as the environment slots | 82 // Keeps track of the last simulate seen, as well as the environment slots |
85 // for which a new live range has started since (so they must not be zapped | 83 // for which a new live range has started since (so they must not be zapped |
86 // in that simulate when the end of another live range of theirs is found). | 84 // in that simulate when the end of another live range of theirs is found). |
87 HSimulate* last_simulate_; | 85 HSimulate* last_simulate_; |
88 BitVector* went_live_since_last_simulate_; | 86 BitVector* went_live_since_last_simulate_; |
89 }; | 87 }; |
90 | 88 |
91 | 89 |
92 } } // namespace v8::internal | 90 } } // namespace v8::internal |
93 | 91 |
94 #endif /* V8_HYDROGEN_ENVIRONMENT_LIVENESS_H_ */ | 92 #endif /* V8_HYDROGEN_ENVIRONMENT_LIVENESS_H_ */ |
OLD | NEW |