| 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 | 
| 11 //       with the distribution. | 11 //       with the distribution. | 
| 12 //     * Neither the name of Google Inc. nor the names of its | 12 //     * Neither the name of Google Inc. nor the names of its | 
| 13 //       contributors may be used to endorse or promote products derived | 13 //       contributors may be used to endorse or promote products derived | 
| 14 //       from this software without specific prior written permission. | 14 //       from this software without specific prior written permission. | 
| 15 // | 15 // | 
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 
| 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 
| 27 | 27 | 
| 28 #ifndef V8_HYDROGEN_INFER_TYPES_H_ | 28 #include "task-queue.h" | 
| 29 #define V8_HYDROGEN_INFER_TYPES_H_ |  | 
| 30 | 29 | 
| 31 #include "hydrogen.h" | 30 // TODO(jochen): We should have our own version of checks.h. | 
|  | 31 #include "../checks.h" | 
| 32 | 32 | 
| 33 namespace v8 { | 33 namespace v8 { | 
| 34 namespace internal { | 34 namespace internal { | 
| 35 | 35 | 
| 36 | 36 TaskQueue::TaskQueue() : process_queue_semaphore_(0), terminated_(false) {} | 
| 37 class HInferTypesPhase : public HPhase { |  | 
| 38  public: |  | 
| 39   explicit HInferTypesPhase(HGraph* graph) |  | 
| 40       : HPhase("H_Inferring types", graph), worklist_(8, zone()), |  | 
| 41         in_worklist_(graph->GetMaximumValueID(), zone()) { } |  | 
| 42 |  | 
| 43   void Run() { |  | 
| 44     InferTypes(0, graph()->blocks()->length() - 1); |  | 
| 45   } |  | 
| 46 |  | 
| 47  private: |  | 
| 48   void InferTypes(int from_inclusive, int to_inclusive); |  | 
| 49 |  | 
| 50   ZoneList<HValue*> worklist_; |  | 
| 51   BitVector in_worklist_; |  | 
| 52 |  | 
| 53   DISALLOW_COPY_AND_ASSIGN(HInferTypesPhase); |  | 
| 54 }; |  | 
| 55 | 37 | 
| 56 | 38 | 
|  | 39 TaskQueue::~TaskQueue() { | 
|  | 40   LockGuard<Mutex> guard(&lock_); | 
|  | 41   ASSERT(terminated_); | 
|  | 42   ASSERT(task_queue_.empty()); | 
|  | 43 } | 
|  | 44 | 
|  | 45 | 
|  | 46 void TaskQueue::Append(Task* task) { | 
|  | 47   LockGuard<Mutex> guard(&lock_); | 
|  | 48   ASSERT(!terminated_); | 
|  | 49   task_queue_.push(task); | 
|  | 50   process_queue_semaphore_.Signal(); | 
|  | 51 } | 
|  | 52 | 
|  | 53 | 
|  | 54 Task* TaskQueue::GetNext() { | 
|  | 55   for (;;) { | 
|  | 56     { | 
|  | 57       LockGuard<Mutex> guard(&lock_); | 
|  | 58       if (!task_queue_.empty()) { | 
|  | 59         Task* result = task_queue_.front(); | 
|  | 60         task_queue_.pop(); | 
|  | 61         return result; | 
|  | 62       } | 
|  | 63       if (terminated_) { | 
|  | 64         process_queue_semaphore_.Signal(); | 
|  | 65         return NULL; | 
|  | 66       } | 
|  | 67     } | 
|  | 68     process_queue_semaphore_.Wait(); | 
|  | 69   } | 
|  | 70 } | 
|  | 71 | 
|  | 72 | 
|  | 73 void TaskQueue::Terminate() { | 
|  | 74   LockGuard<Mutex> guard(&lock_); | 
|  | 75   ASSERT(!terminated_); | 
|  | 76   terminated_ = true; | 
|  | 77   process_queue_semaphore_.Signal(); | 
|  | 78 } | 
|  | 79 | 
| 57 } }  // namespace v8::internal | 80 } }  // namespace v8::internal | 
| 58 |  | 
| 59 #endif  // V8_HYDROGEN_INFER_TYPES_H_ |  | 
| OLD | NEW | 
|---|