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 64 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
75 | 75 |
76 | 76 |
77 template<typename Record> | 77 template<typename Record> |
78 void UnboundQueue<Record>::Enqueue(const Record& rec) { | 78 void UnboundQueue<Record>::Enqueue(const Record& rec) { |
79 Node*& next = reinterpret_cast<Node*>(last_)->next; | 79 Node*& next = reinterpret_cast<Node*>(last_)->next; |
80 next = new Node(rec); | 80 next = new Node(rec); |
81 OS::ReleaseStore(&last_, reinterpret_cast<AtomicWord>(next)); | 81 OS::ReleaseStore(&last_, reinterpret_cast<AtomicWord>(next)); |
82 while (first_ != reinterpret_cast<Node*>(divider_)) DeleteFirst(); | 82 while (first_ != reinterpret_cast<Node*>(divider_)) DeleteFirst(); |
83 } | 83 } |
84 | 84 |
| 85 |
| 86 template<typename Record> |
| 87 Record* UnboundQueue<Record>::Peek() { |
| 88 ASSERT(divider_ != last_); |
| 89 Node* next = reinterpret_cast<Node*>(divider_)->next; |
| 90 return &next->value; |
| 91 } |
| 92 |
85 } } // namespace v8::internal | 93 } } // namespace v8::internal |
86 | 94 |
87 #endif // V8_UNBOUND_QUEUE_INL_H_ | 95 #endif // V8_UNBOUND_QUEUE_INL_H_ |
OLD | NEW |