/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
H A D | v8-richards.js | 46 var queue = new Packet(null, ID_WORKER, KIND_WORK); 47 queue = new Packet(queue, ID_WORKER, KIND_WORK); 48 scheduler.addWorkerTask(ID_WORKER, 1000, queue); 50 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE); 51 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE); 52 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE); 53 scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue); [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
H A D | v8-richards.js | 46 var queue = new Packet(null, ID_WORKER, KIND_WORK); 47 queue = new Packet(queue, ID_WORKER, KIND_WORK); 48 scheduler.addWorkerTask(ID_WORKER, 1000, queue); 50 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE); 51 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE); 52 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE); 53 scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue); [all...] |
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
H A D | v8-richards.js | 46 var queue = new Packet(null, ID_WORKER, KIND_WORK); 47 queue = new Packet(queue, ID_WORKER, KIND_WORK); 48 scheduler.addWorkerTask(ID_WORKER, 1000, queue); 50 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE); 51 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE); 52 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE); 53 scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue); [all...] |
/external/chromium_org/third_party/WebKit/Source/core/html/forms/ |
H A D | FormController.cpp | 234 const Deque<FormControlState>& queue = it->value; local 235 for (Deque<FormControlState>::const_iterator queIterator = queue.begin(); queIterator != queue.end(); ++queIterator) { 279 const Deque<FormControlState>& queue = it->value; local 280 for (Deque<FormControlState>::const_iterator queIterator = queue.begin(); queIterator != queue.end(); ++queIterator) {
|
/external/chromium_org/v8/benchmarks/ |
H A D | richards.js | 51 var queue = new Packet(null, ID_WORKER, KIND_WORK); 52 queue = new Packet(queue, ID_WORKER, KIND_WORK); 53 scheduler.addWorkerTask(ID_WORKER, 1000, queue); 55 queue = new Packet(null, ID_DEVICE_A, KIND_DEVICE); 56 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE); 57 queue = new Packet(queue, ID_DEVICE_A, KIND_DEVICE); 58 scheduler.addHandlerTask(ID_HANDLER_A, 2000, queue); [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | Iterators.java | 1287 final Queue<PeekingIterator<T>> queue; field in class:Iterators.MergingIterator 1304 queue = new PriorityQueue<PeekingIterator<T>>(2, heapComparator); 1308 queue.add(Iterators.peekingIterator(iterator)); 1315 if (queue.isEmpty()) { 1319 PeekingIterator<T> nextIter = queue.poll(); 1323 queue.add(nextIter);
|
H A D | MinMaxPriorityQueue.java | 42 * A double-ended priority queue, which provides constant-time access to both 43 * its least element and its greatest element, as determined by the queue's 50 * the queue according to the queue's comparator. But unlike a regular priority 51 * queue, the methods {@link #peekLast}, {@link #pollLast} and 53 * in the queue instead. 55 * <p>A min-max priority queue can be configured with a maximum size. If so, 56 * each time the size of the queue exceeds that value, the queue automatically 79 * <li>If you only access one end of the queue, an 222 private Object[] queue; field in class:MinMaxPriorityQueue [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | Iterators.java | 1251 final Queue<PeekingIterator<T>> queue; field in class:Iterators.MergingIterator 1268 queue = new PriorityQueue<PeekingIterator<T>>(2, heapComparator); 1272 queue.add(Iterators.peekingIterator(iterator)); 1279 if (queue.isEmpty()) { 1283 PeekingIterator<T> nextIter = queue.poll(); 1287 queue.add(nextIter);
|
/external/openfst/src/include/fst/ |
H A D | queue.h | 0 // queue.h 45 // // Returns the head of the queue 49 // // Removes the head of the queue 53 // // Does the queue contain no elements? 55 // // Remove all states from queue 59 // State queue types. 61 TRIVIAL_QUEUE = 0, // Single state queue 62 FIFO_QUEUE = 1, // First-in, first-out queue 63 LIFO_QUEUE = 2, // Last-in, first-out queue 64 SHORTEST_FIRST_QUEUE = 3, // Shortest-first queue 447 SccQueue(const vector<StateId> &scc, vector<Queue*> *queue) argument 808 PruneQueue(const vector<Weight> &distance, Q *queue, L comp, const C &class_func, Weight threshold) argument 878 NaturalPruneQueue(const vector<W> &distance, Q *queue, const C &class_func_, Weight threshold) argument 897 FilterQueue(Q *queue, const F &state_filter) argument [all...] |
/external/openssl/crypto/rand/ |
H A D | rand_win.c | 392 GETQUEUESTATUS queue; local 396 queue = (GETQUEUESTATUS) GetProcAddress(user, "GetQueueStatus"); 424 if (queue) 426 /* message queue status */ 428 w = queue(QS_ALLEVENTS);
|
/external/openssl/ssl/ |
H A D | d1_pkt.c | 209 dtls1_buffer_record(SSL *s, record_pqueue *queue, unsigned char *priority) argument 214 /* Limit the size of the queue to prevent DOS attacks */ 215 if (pqueue_size(queue->q) >= 100) 258 if (pqueue_insert(queue->q, item) == NULL) 271 dtls1_retrieve_buffered_record(SSL *s, record_pqueue *queue) argument 275 item = pqueue_pop(queue->q);
|
/external/qemu/hw/input/ |
H A D | ps2.c | 81 PS2Queue queue; member in struct:__anon29671 126 PS2Queue *q = &s->queue; 162 q = &s->queue; 349 (s->common.queue.count < (PS2_QUEUE_SIZE - 16))) { 496 q = &s->queue; 506 qemu_put_be32 (f, s->queue.rptr); 507 qemu_put_be32 (f, s->queue.wptr); 508 qemu_put_be32 (f, s->queue.count); 509 qemu_put_buffer (f, s->queue.data, sizeof (s->queue [all...] |
/external/qemu/telephony/ |
H A D | sysdeps_posix.c | 41 sys_queue_reset( SysQueue queue ) 43 queue->start = queue->end = 0; 47 sys_queue_add( SysQueue queue, void* item ) argument 49 assert( queue->end - queue->start < SYS_MAX_QUEUE ); 50 assert( queue->start == 0 ); 52 queue->pending[ queue->end++ ] = item; 57 sys_queue_remove( SysQueue queue, voi [all...] |
/external/smack/src/org/jivesoftware/smack/util/collections/ |
H A D | AbstractReferenceMap.java | 119 private transient ReferenceQueue queue; field in class:AbstractReferenceMap 155 queue = new ReferenceQueue(); 278 while (queue.poll() != null) { 279 } // drain the queue 359 Reference ref = queue.poll(); 362 ref = queue.poll(); 675 * The reference is registered with the queue for later purging. 686 return new SoftRef<T>(hash, referent, parent.queue); 688 return new WeakRef<T>(hash, referent, parent.queue);
|
/external/smack/src/org/jivesoftware/smackx/workgroup/agent/ |
H A D | AgentSession.java | 436 * Removes a user from the workgroup queue. This is an administrative action that the
548 * @param queueName the name of the queue
549 * @return an instance of WorkgroupQueue for the argument queue name, or null if none exists
657 private void fireQueueUsersEvent(WorkgroupQueue queue, WorkgroupQueue.Status status,
argument 662 listener.statusUpdated(queue, status);
665 listener.averageWaitTimeUpdated(queue, averageWaitTime);
668 listener.oldestEntryUpdated(queue, oldestEntry);
671 listener.usersUpdated(queue, users);
702 WorkgroupQueue queue = queues.get(queueName);
703 // If there isn't already an entry for the queue, creat [all...] |
/external/chromium_org/cc/layers/ |
H A D | tiled_layer.cc | 325 ResourceUpdateQueue* queue, 346 update_rect, paint_rect, left, top, right, bottom, queue, occlusion); 461 ResourceUpdateQueue* queue, 524 queue, source_rect, dest_offset, tile->partial_update); 684 bool TiledLayer::Update(ResourceUpdateQueue* queue, argument 698 updated |= ContentsScalingLayer::Update(queue, occlusion); 715 UpdateTiles(left, top, right, bottom, queue, NULL, &updated); 733 left, top, right, bottom, queue, occlusion, &updated); 746 if (!UpdateTiles(left, top, right, bottom, queue, NULL, &updated) || 776 left, bottom, right, bottom, queue, NUL 321 UpdateTiles(int left, int top, int right, int bottom, ResourceUpdateQueue* queue, const OcclusionTracker<Layer>* occlusion, bool* updated) argument 455 UpdateTileTextures(const gfx::Rect& update_rect, const gfx::Rect& paint_rect, int left, int top, int right, int bottom, ResourceUpdateQueue* queue, const OcclusionTracker<Layer>* occlusion) argument [all...] |
/external/chromium_org/chrome/browser/media/ |
H A D | media_capture_devices_dispatcher.cc | 790 RequestsQueue& queue = pending_requests_[web_contents]; local 791 queue.push_back(PendingAccessRequest(request, callback)); 794 if (queue.size() == 1) 850 RequestsQueue& queue(it->second); 851 if (queue.empty()) 854 content::MediaResponseCallback callback = queue.front().callback; 855 queue.pop_front(); 857 if (!queue.empty()) { 1047 RequestsQueue& queue = rqs_it->second; local 1048 for (RequestsQueue::iterator it = queue [all...] |
/external/chromium_org/extensions/browser/ |
H A D | event_router.cc | 639 LazyBackgroundTaskQueue* queue = ExtensionSystem::Get( 641 if (queue->ShouldEnqueueTask(context, extension)) { 655 queue->AddPendingTask(context, extension->id(), 741 LazyBackgroundTaskQueue* queue = ExtensionSystem::Get( local 743 queue->AddPendingTask(browser_context_, extension->id(),
|
/external/chromium_org/media/filters/ |
H A D | chunk_demuxer.cc | 27 static TimeDelta EndTimestamp(const StreamParser::BufferQueue& queue) { argument 28 return queue.back()->timestamp() + queue.back()->duration();
|
H A D | source_buffer_stream_unittest.cc | 385 BufferQueue queue; local 416 queue.push_back(buffer); 418 if (!queue.empty()) 419 EXPECT_EQ(expect_success, stream_->Append(queue));
|
/external/chromium_org/third_party/libjingle/source/talk/p2p/base/ |
H A D | pseudotcp.cc | 481 int written = queue(buffer, uint32(len), false); 499 uint32 PseudoTcp::queue(const char* data, uint32 len, bool bCtrl) { function in class:cricket::PseudoTcp 836 // If we make room in the send queue, notify the user 1183 queue(buf.Data(), static_cast<uint32>(buf.Length()), true);
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
H A D | EdgeWalker_TestUtility.cpp | 479 State4* State4::queue = NULL; member in class:State4 515 while (!State4::queue) { 519 statePtr = State4::queue; 527 State4::queue = NULL; member in class:State4 530 State4::queue = &threadState[index]; member in class:State4 535 State4::queue ? State4::queue->index : -1); 709 State4::queue = &state; member in class:State4 728 while (!State4::queue) { 732 while (State4::queue) { 746 State4::queue = next; member in class:State4 [all...] |
/external/chromium_org/third_party/webrtc/base/ |
H A D | win32socketserver.cc | 753 void Win32SocketServer::SetMessageQueue(MessageQueue* queue) { argument 754 message_queue_ = queue; 819 // Dispatch all the messages that are currently in our queue. If new messages
|
/external/chromium_org/v8/src/compiler/ |
H A D | scheduler.cc | 6 #include <queue> 689 ZoneQueue<Node*> queue(zone_); 690 queue.push(end); 692 while (!queue.empty()) { 693 Node* node = queue.front(); 694 queue.pop(); 704 // First time seeing {input} during this traversal, queue it. 705 queue.push(input); 786 Zone* zone, SpecialRPOStackFrame* queue, int num_loops, int num_blocks, 805 // Push the member onto the queue an 785 ComputeLoopInfo( Zone* zone, SpecialRPOStackFrame* queue, int num_loops, int num_blocks, ZoneList<std::pair<BasicBlock*, int> >* backedges) argument [all...] |
/external/clang/include/clang/AST/ |
H A D | DataRecursiveASTVisitor.h | 117 /// Stmts are traversed internally using a data queue to avoid a stack overflow 290 StmtQueue.queue(S->getSubExpr()); \ 310 StmtQueue.queue(S->getLHS()); \ 311 StmtQueue.queue(S->getRHS()); \ 442 NewQueueRAII(StmtsTy &queue, RecursiveASTVisitor &RAV) : RAV(RAV) { argument 443 RAV.Queues.push_back(&queue); 461 void queue(Stmt *S) { CurrQueue.push_back(S); } function in class:clang::RecursiveASTVisitor::StmtQueueAction 799 StmtQueue.queue(LE->getBody()); 1857 StmtQueue.queue(*range); \ 1863 StmtQueue.queue( [all...] |