v8  3.25.30(node0.11.13)
V8 is Google's open source JavaScript engine
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros Pages
task-queue.cc
Go to the documentation of this file.
1 // Copyright 2013 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
4 // met:
5 //
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
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.
27 
28 #include "task-queue.h"
29 
30 // TODO(jochen): We should have our own version of checks.h.
31 #include "../checks.h"
32 
33 namespace v8 {
34 namespace internal {
35 
36 TaskQueue::TaskQueue() : process_queue_semaphore_(0), terminated_(false) {}
37 
38 
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 
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 
74  LockGuard<Mutex> guard(&lock_);
75  ASSERT(!terminated_);
76  terminated_ = true;
77  process_queue_semaphore_.Signal();
78 }
79 
80 } } // namespace v8::internal
enable upcoming ES6 features enable harmony block scoping enable harmony enable harmony proxies enable harmony generators enable harmony numeric enable harmony string enable harmony math functions harmony_scoping harmony_symbols harmony_collections harmony_iteration harmony_strings harmony_scoping harmony_maths tracks arrays with only smi values Optimize object Array DOM strings and string pretenure call new trace pretenuring decisions of HAllocate instructions track fields with only smi values track fields with heap values track_fields track_fields Enables optimizations which favor memory size over execution speed use string slices optimization filter maximum number of GVN fix point iterations use function inlining use allocation folding eliminate write barriers targeting allocations in optimized code maximum source size in bytes considered for a single inlining maximum cumulative number of AST nodes considered for inlining crankshaft harvests type feedback from stub cache trace check elimination phase hydrogen tracing filter NULL
Definition: flags.cc:269
#define ASSERT(condition)
Definition: checks.h:329
void Append(Task *task)
Definition: task-queue.cc:46