/external/chromium_org/cc/resources/ |
H A D | raster_worker_pool_perftest.cc | 202 void BuildRasterTaskQueue(RasterTaskQueue* queue, argument 209 queue->items.push_back( 304 // Avoid unnecessary heap allocations by reusing the same queue. 305 RasterTaskQueue queue; local 309 queue.Reset(); 310 BuildRasterTaskQueue(&queue, raster_tasks); 311 raster_worker_pool_->AsRasterizer()->ScheduleTasks(&queue); 340 // Avoid unnecessary heap allocations by reusing the same queue. 341 RasterTaskQueue queue; local 346 queue 375 RasterTaskQueue queue; local 498 RasterTaskQueue queue; local [all...] |
H A D | raster_worker_pool_unittest.cc | 211 RasterTaskQueue queue; local 218 queue.items.push_back(RasterTaskQueue::Item(it->get(), task_sets)); 221 raster_worker_pool_->AsRasterizer()->ScheduleTasks(&queue);
|
H A D | tile_manager_perftest.cc | 42 virtual void ScheduleTasks(RasterTaskQueue* queue) OVERRIDE { 44 queue->items.begin(); 45 it != queue->items.end(); 199 RasterTilePriorityQueue queue; local 200 host_impl_.BuildRasterQueue(&queue, priorities[priority_count]); 230 RasterTilePriorityQueue queue; local 231 host_impl_.BuildRasterQueue(&queue, priorities[priority_count]); 233 ASSERT_FALSE(queue.IsEmpty()); 234 ASSERT_TRUE(queue.Top() != NULL); 235 queue 271 EvictionTilePriorityQueue queue; local 308 EvictionTilePriorityQueue queue; local [all...] |
H A D | resource_update_controller_unittest.cc | 344 scoped_ptr<ResourceUpdateQueue> queue, 347 client, task_runner, queue.Pass(), resource_provider)); 370 scoped_ptr<ResourceUpdateQueue> queue, 373 client, task_runner, queue.Pass(), resource_provider), 341 Create( ResourceUpdateControllerClient* client, base::TestSimpleTaskRunner* task_runner, scoped_ptr<ResourceUpdateQueue> queue, ResourceProvider* resource_provider) argument 368 FakeResourceUpdateController(ResourceUpdateControllerClient* client, base::TestSimpleTaskRunner* task_runner, scoped_ptr<ResourceUpdateQueue> queue, ResourceProvider* resource_provider) argument
|
H A D | tile_manager_unittest.cc | 98 virtual void BuildRasterQueue(RasterTilePriorityQueue* queue, 100 virtual void BuildEvictionQueue(EvictionTilePriorityQueue* queue, 606 RasterTilePriorityQueue queue; local 607 host_impl_.BuildRasterQueue(&queue, SAME_PRIORITY_FOR_BOTH_TREES); 608 EXPECT_FALSE(queue.IsEmpty()); 612 while (!queue.IsEmpty()) { 613 EXPECT_TRUE(queue.Top()); 614 all_tiles.insert(queue.Top()); 616 queue.Pop(); 624 queue 791 EvictionTilePriorityQueue queue; local 1012 EvictionTilePriorityQueue queue; local 1054 RasterTilePriorityQueue queue; local 1119 EvictionTilePriorityQueue queue; local [all...] |
/external/chromium_org/chrome/browser/chromeos/file_manager/ |
H A D | file_browser_handlers.cc | 338 extensions::LazyBackgroundTaskQueue* queue = local 341 if (!queue->ShouldEnqueueTask(profile_, extension_.get())) { 345 queue->AddPendingTask(
|
/external/chromium_org/chrome/browser/extensions/activity_log/ |
H A D | counting_policy.cc | 208 // queue, flush the queue out now to prevent any false merging (actions 236 ActionQueue queue; local 237 queue.swap(queued_actions_); 247 if (queue.empty() && !clean_database) 285 for (ActionQueue::iterator i = queue.begin(); i != queue.end(); ++i) {
|
/external/chromium_org/chrome/browser/net/ |
H A D | url_info.cc | 86 case QUEUED: // In queue. 119 DLogResultsStats("DNS Prefetch in queue"); 311 MinMaxAverage queue, when; local 315 queue.sample((it->queue_duration_.InMilliseconds())); 330 queue.minimum(), queue.average(), queue.maximum());
|
/external/chromium_org/net/spdy/ |
H A D | spdy_priority_tree.h | 11 #include <queue> 448 List queue; local 454 queue.push_back(*it); 456 while (!queue.empty()) { 457 NodeId current_node_id = queue.front(); 471 queue.push_back(*it); 486 // Remove this node from the queue. 487 queue.pop_front();
|
/external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/ |
H A D | webrunner.js | 210 var queue = []; variable 352 // Remove the next test from the queue and execute it 354 if ( interval && queue.length ) { 357 status: { current: totalTestItems - queue.length, 361 queue.shift()(); 362 } else if ( queue.length == 0 ) { 412 queue = queue.concat( queues[ names[n] ] ); 415 totalTestItems = queue.length;
|
/external/chromium_org/third_party/WebKit/Source/core/inspector/ |
H A D | DOMPatchSupport.cpp | 489 Deque<Digest*> queue; local 490 queue.append(digest); 491 while (!queue.isEmpty()) { 492 Digest* first = queue.takeFirst(); 495 queue.append(first->m_children[i].get());
|
/external/chromium_org/third_party/boringssl/src/ssl/ |
H A D | d1_pkt.c | 207 dtls1_buffer_record(SSL *s, record_pqueue *queue, unsigned char *priority) argument 212 /* Limit the size of the queue to prevent DOS attacks */ 213 if (pqueue_size(queue->q) >= 100) 248 if (pqueue_insert(queue->q, item) == NULL) 261 dtls1_retrieve_buffered_record(SSL *s, record_pqueue *queue) argument 265 item = pqueue_pop(queue->q);
|
/external/chromium_org/third_party/libevent/ |
H A D | event.c | 42 #include <sys/queue.h> 188 /* allocate a single active event queue */ 912 event_queue_remove(struct event_base *base, struct event *ev, int queue) argument 914 if (!(ev->ev_flags & queue)) 915 event_errx(1, "%s: %p(fd %d) not on queue %x", __func__, 916 ev, ev->ev_fd, queue); 921 ev->ev_flags &= ~queue; 922 switch (queue) { 935 event_errx(1, "%s: unknown queue %x", __func__, queue); 940 event_queue_insert(struct event_base *base, struct event *ev, int queue) argument [all...] |
/external/compiler-rt/lib/asan/ |
H A D | asan_mac.cc | 247 // http://libdispatch.macosforge.org/trac/browser/trunk/src/queue.c 361 void dispatch_after(dispatch_time_t when, dispatch_queue_t queue, 399 dispatch_time_t when, dispatch_queue_t queue, void(^work)(void)) { 402 REAL(dispatch_after)(when, queue, asan_block); 398 INTERCEPTOR(void, dispatch_after, dispatch_time_t when, dispatch_queue_t queue, void(^work)(void)) argument
|
/external/fio/ |
H A D | ioengine.h | 122 * io_ops->queue() return values 138 int (*queue)(struct thread_data *, struct io_u *); member in struct:ioengine_ops 157 FIO_SYNCIO = 1 << 0, /* io engine has synchronous ->queue */
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | Iterables.java | 972 * queue's elements in queue order 998 private final Queue<T> queue; field in class:Iterables.ConsumingQueueIterator 1000 private ConsumingQueueIterator(Queue<T> queue) { argument 1001 this.queue = queue; 1006 return queue.remove();
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | Iterables.java | 930 * queue's elements in queue order 956 private final Queue<T> queue; field in class:Iterables.ConsumingQueueIterator 958 private ConsumingQueueIterator(Queue<T> queue) { argument 959 this.queue = queue; 964 return queue.remove();
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | MinMaxPriorityQueueTest.java | 52 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue 54 assertEquals(11, queue.capacity()); 55 checkUnbounded(queue); 56 checkNatural(queue); 60 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue 63 assertEquals(11, queue.capacity()); 64 checkUnbounded(queue); 65 assertSame(SOME_COMPARATOR, queue.comparator()); 69 MinMaxPriorityQueue<Integer> queue = MinMaxPriorityQueue 72 assertEquals(8, queue 175 checkNatural(MinMaxPriorityQueue<Integer> queue) argument 179 checkUnbounded(MinMaxPriorityQueue<Integer> queue) argument [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | queue.h | 0 // queue.h 41 // // Returns the head of the queue 45 // // Removes the head of the queue 49 // // Does the queue contain no elements? 51 // // Remove all states from queue 55 // State queue types. 57 TRIVIAL_QUEUE = 0, // Single state queue 58 FIFO_QUEUE = 1, // First-in, first-out queue 59 LIFO_QUEUE = 2, // Last-in, first-out queue 60 SHORTEST_FIRST_QUEUE = 3, // Shortest-first queue 410 SccQueue(const vector<StateId> &scc, vector<Queue*> *queue) argument [all...] |
/external/strace/ |
H A D | unwind.c | 88 static void queue_print(struct queue_t *queue); 110 tcp->queue = malloc(sizeof(*tcp->queue)); 111 if (!tcp->queue) 113 tcp->queue->head = NULL; 114 tcp->queue->tail = NULL; 120 queue_print(tcp->queue); 121 free(tcp->queue); 122 tcp->queue = NULL; 481 * queue manipulator 484 queue_put(struct queue_t *queue, const char *binary_filename, const char *symbol_name, unw_word_t function_offset, unsigned long true_offset, const char *error) argument 514 queue_put_call(void *queue, const char *binary_filename, const char *symbol_name, unw_word_t function_offset, unsigned long true_offset) argument 529 queue_put_error(void *queue, const char *error, unsigned long ip) argument 537 queue_print(struct queue_t *queue) argument [all...] |
/external/bluetooth/bluedroid/stack/rfcomm/ |
H A D | port_int.h | 56 BUFFER_Q queue; /* Queue of buffers waiting to be sent */ member in struct:__anon1688 59 UINT32 queue_size; /* Number of data bytes in the queue */ 203 UINT16 rx_buf_critical; /* port receive queue critical watermark level */
|
/external/chromium_org/cc/layers/ |
H A D | scrollbar_layer_unittest.cc | 743 ResourceUpdateQueue queue; local 749 scrollbar_layer->Update(&queue, &occlusion_tracker); 822 ResourceUpdateQueue queue; local 832 EXPECT_TRUE(scrollbar_layer->Update(&queue, &occlusion_tracker)); 843 EXPECT_TRUE(scrollbar_layer->Update(&queue, &occlusion_tracker)); 854 EXPECT_FALSE(scrollbar_layer->Update(&queue, &occlusion_tracker)); 865 EXPECT_TRUE(scrollbar_layer->Update(&queue, &occlusion_tracker)); 876 EXPECT_TRUE(scrollbar_layer->Update(&queue, &occlusion_tracker)); 887 EXPECT_TRUE(scrollbar_layer->Update(&queue, &occlusion_tracker)); 899 EXPECT_TRUE(scrollbar_layer->Update(&queue, 973 ResourceUpdateQueue queue; local 1050 ResourceUpdateQueue queue; local [all...] |
/external/chromium_org/cc/trees/ |
H A D | single_thread_proxy.cc | 181 scoped_ptr<ResourceUpdateQueue> queue = local 184 layer_tree_host_->UpdateLayers(queue.get()); 211 queue.Pass(),
|
/external/chromium_org/components/gcm_driver/ |
H A D | gcm_stats_recorder_impl_unittest.cc | 289 const std::deque<CheckinActivity>& queue, 293 EXPECT_EQ(event, queue.front().event) << remark; 294 EXPECT_EQ(details, queue.front().details) << remark; 298 const std::deque<ConnectionActivity>& queue, 302 EXPECT_EQ(event, queue.front().event) << remark; 303 EXPECT_EQ(details, queue.front().details) << remark; 307 const std::deque<RegistrationActivity>& queue, 312 EXPECT_EQ(kAppId, queue.front().app_id) << remark; 313 EXPECT_EQ(sender_ids, queue.front().sender_ids) << remark; 314 EXPECT_EQ(event, queue 288 VerifyCheckin( const std::deque<CheckinActivity>& queue, const std::string& event, const std::string& details, const std::string& remark) argument 297 VerifyConnection( const std::deque<ConnectionActivity>& queue, const std::string& event, const std::string& details, const std::string& remark) argument 306 VerifyRegistration( const std::deque<RegistrationActivity>& queue, const std::string& sender_ids, const std::string& event, const std::string& details, const std::string& remark) argument 318 VerifyReceivingData( const std::deque<ReceivingActivity>& queue, const std::string& event, const std::string& details, const std::string& remark) argument 330 VerifySendingData( const std::deque<SendingActivity>& queue, const std::string& event, const std::string& details, const std::string& remark) argument [all...] |
/external/chromium_org/content/child/ |
H A D | resource_dispatcher.cc | 727 // we need to work with a stack reference to the deferred queue. 881 void ResourceDispatcher::ReleaseResourcesInMessageQueue(MessageQueue* queue) { argument 882 while (!queue->empty()) { 883 IPC::Message* message = queue->front(); 885 queue->pop_front();
|