OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 the V8 project authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "src/v8.h" | 5 #include "src/v8.h" |
6 | 6 |
7 #if V8_TARGET_ARCH_ARM64 | 7 #if V8_TARGET_ARCH_ARM64 |
8 | 8 |
9 #include "src/arm64/decoder-arm64.h" | 9 #include "src/arm64/decoder-arm64.h" |
10 #include "src/globals.h" | 10 #include "src/globals.h" |
(...skipping 21 matching lines...) Expand all Loading... |
32 visitors_.remove(new_visitor); | 32 visitors_.remove(new_visitor); |
33 std::list<DecoderVisitor*>::iterator it; | 33 std::list<DecoderVisitor*>::iterator it; |
34 for (it = visitors_.begin(); it != visitors_.end(); it++) { | 34 for (it = visitors_.begin(); it != visitors_.end(); it++) { |
35 if (*it == registered_visitor) { | 35 if (*it == registered_visitor) { |
36 visitors_.insert(it, new_visitor); | 36 visitors_.insert(it, new_visitor); |
37 return; | 37 return; |
38 } | 38 } |
39 } | 39 } |
40 // We reached the end of the list. The last element must be | 40 // We reached the end of the list. The last element must be |
41 // registered_visitor. | 41 // registered_visitor. |
42 ASSERT(*it == registered_visitor); | 42 DCHECK(*it == registered_visitor); |
43 visitors_.insert(it, new_visitor); | 43 visitors_.insert(it, new_visitor); |
44 } | 44 } |
45 | 45 |
46 | 46 |
47 void DispatchingDecoderVisitor::InsertVisitorAfter( | 47 void DispatchingDecoderVisitor::InsertVisitorAfter( |
48 DecoderVisitor* new_visitor, DecoderVisitor* registered_visitor) { | 48 DecoderVisitor* new_visitor, DecoderVisitor* registered_visitor) { |
49 visitors_.remove(new_visitor); | 49 visitors_.remove(new_visitor); |
50 std::list<DecoderVisitor*>::iterator it; | 50 std::list<DecoderVisitor*>::iterator it; |
51 for (it = visitors_.begin(); it != visitors_.end(); it++) { | 51 for (it = visitors_.begin(); it != visitors_.end(); it++) { |
52 if (*it == registered_visitor) { | 52 if (*it == registered_visitor) { |
53 it++; | 53 it++; |
54 visitors_.insert(it, new_visitor); | 54 visitors_.insert(it, new_visitor); |
55 return; | 55 return; |
56 } | 56 } |
57 } | 57 } |
58 // We reached the end of the list. The last element must be | 58 // We reached the end of the list. The last element must be |
59 // registered_visitor. | 59 // registered_visitor. |
60 ASSERT(*it == registered_visitor); | 60 DCHECK(*it == registered_visitor); |
61 visitors_.push_back(new_visitor); | 61 visitors_.push_back(new_visitor); |
62 } | 62 } |
63 | 63 |
64 | 64 |
65 void DispatchingDecoderVisitor::RemoveVisitor(DecoderVisitor* visitor) { | 65 void DispatchingDecoderVisitor::RemoveVisitor(DecoderVisitor* visitor) { |
66 visitors_.remove(visitor); | 66 visitors_.remove(visitor); |
67 } | 67 } |
68 | 68 |
69 | 69 |
70 #define DEFINE_VISITOR_CALLERS(A) \ | 70 #define DEFINE_VISITOR_CALLERS(A) \ |
71 void DispatchingDecoderVisitor::Visit##A(Instruction* instr) { \ | 71 void DispatchingDecoderVisitor::Visit##A(Instruction* instr) { \ |
72 if (!(instr->Mask(A##FMask) == A##Fixed)) { \ | 72 if (!(instr->Mask(A##FMask) == A##Fixed)) { \ |
73 ASSERT(instr->Mask(A##FMask) == A##Fixed); \ | 73 DCHECK(instr->Mask(A##FMask) == A##Fixed); \ |
74 } \ | 74 } \ |
75 std::list<DecoderVisitor*>::iterator it; \ | 75 std::list<DecoderVisitor*>::iterator it; \ |
76 for (it = visitors_.begin(); it != visitors_.end(); it++) { \ | 76 for (it = visitors_.begin(); it != visitors_.end(); it++) { \ |
77 (*it)->Visit##A(instr); \ | 77 (*it)->Visit##A(instr); \ |
78 } \ | 78 } \ |
79 } | 79 } |
80 VISITOR_LIST(DEFINE_VISITOR_CALLERS) | 80 VISITOR_LIST(DEFINE_VISITOR_CALLERS) |
81 #undef DEFINE_VISITOR_CALLERS | 81 #undef DEFINE_VISITOR_CALLERS |
82 | 82 |
83 | 83 |
84 } } // namespace v8::internal | 84 } } // namespace v8::internal |
85 | 85 |
86 #endif // V8_TARGET_ARCH_ARM64 | 86 #endif // V8_TARGET_ARCH_ARM64 |
OLD | NEW |