/external/chromium_org/net/spdy/ |
H A D | spdy_write_queue.cc | 87 // |stream| should not have pending writes in a queue not matching 99 // Defer deletion until queue iteration is complete, as 104 std::deque<PendingWrite>* queue = &queue_[priority]; local 105 std::deque<PendingWrite>::iterator out_it = queue->begin(); 106 for (std::deque<PendingWrite>::const_iterator it = queue->begin(); 107 it != queue->end(); ++it) { 115 queue->erase(out_it, queue->end()); 128 std::deque<PendingWrite>* queue = &queue_[i]; local 129 std::deque<PendingWrite>::iterator out_it = queue [all...] |
H A D | spdy_write_queue_unittest.cc | 56 RequeingBufferProducer(SpdyWriteQueue* queue) { argument 59 base::Bind(RequeingBufferProducer::ConsumeCallback, queue)); 66 static void ConsumeCallback(SpdyWriteQueue* queue, argument 73 queue->Enqueue( 265 // Enqueue a bunch of writes and then call Clear(). The write queue 285 SpdyWriteQueue queue; local 286 queue.Enqueue( 289 scoped_ptr<SpdyBufferProducer>(new RequeingBufferProducer(&queue)), 296 EXPECT_TRUE(queue.Dequeue(&frame_type, &producer, &stream)); 297 EXPECT_TRUE(queue 312 SpdyWriteQueue queue; local 334 SpdyWriteQueue queue; local 356 SpdyWriteQueue queue; local [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/clover/core/ |
H A D | event.cpp | 86 pipe_screen *screen = queue()->dev.pipe; 92 pipe_screen *screen = queue()->dev.pipe; 108 hard_event::queue() const { function in class:hard_event 119 pipe_screen *screen = queue()->dev.pipe; 122 queue()->flush(); 131 pipe_screen *screen = queue()->dev.pipe; 159 soft_event::queue() const { function in class:soft_event
|
/external/fio/engines/ |
H A D | fusion-aw.c | 37 static int queue(struct thread_data *td, struct io_u *io_u) function 168 .queue = queue,
|
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/ |
H A D | ResourceRunner.java | 69 public void queue() { method in class:ResourceRunner
|
/external/guava/guava/src/com/google/common/base/ |
H A D | FinalizableReferenceQueue.java | 30 * A reference queue with an associated background thread that dequeues references and invokes 57 * thread keeps an indirect strong reference to the queue in ReferenceMap, which keeps the 90 * The actual reference queue that our background thread will poll. 92 final ReferenceQueue<Object> queue; field in class:FinalizableReferenceQueue 100 * Constructs a new queue. 105 ReferenceQueue<Object> queue; 108 queue = (ReferenceQueue<Object>) 116 queue = new ReferenceQueue<Object>(); 119 this.queue = queue; [all...] |
/external/guava/guava/src/com/google/common/base/internal/ |
H A D | Finalizer.java | 84 return finalizer.queue; 89 private final ReferenceQueue<Object> queue = new ReferenceQueue<Object>(); field in class:Finalizer 102 this.frqReference = new PhantomReference<Object>(frq, queue); 119 * Loops continuously, pulling references off the queue and cleaning them up. 127 cleanUp(queue.remove()); 163 } while ((reference = queue.poll()) != null);
|
/external/javassist/src/main/javassist/scopedpool/ |
H A D | SoftValueHashMap.java | 62 /* Reference queue for cleared WeakKeys */ 63 private ReferenceQueue queue = new ReferenceQueue(); field in class:SoftValueHashMap 71 while ((ref = (SoftValueRef)queue.poll()) != null) { 204 Object rtn = hash.put(key, SoftValueRef.create(key, value, queue));
|
/external/libnl/src/ |
H A D | nf-queue.c | 2 * src/nf-queue.c Monitor netfilter queue events 19 #include <netlink/netfilter/queue.h> 26 struct nfnl_queue *queue; local 28 queue = nfnl_queue_alloc(); 29 if (!queue) 30 nl_cli_fatal(ENOMEM, "Unable to allocate queue object"); 32 return queue; 87 struct nfnl_queue *queue; local 101 printf("Usage: nf-queue famil [all...] |
/external/lldb/source/Plugins/Process/Utility/ |
H A D | ThreadMemory.cpp | 36 const char *queue, 47 if (queue) 48 m_queue = queue; 33 ThreadMemory(Process &process, lldb::tid_t tid, const char *name, const char *queue, lldb::addr_t register_data_addr) argument
|
/external/mesa3d/src/gallium/state_trackers/clover/core/ |
H A D | event.cpp | 86 pipe_screen *screen = queue()->dev.pipe; 92 pipe_screen *screen = queue()->dev.pipe; 108 hard_event::queue() const { function in class:hard_event 119 pipe_screen *screen = queue()->dev.pipe; 122 queue()->flush(); 131 pipe_screen *screen = queue()->dev.pipe; 159 soft_event::queue() const { function in class:soft_event
|
/external/openfst/src/include/fst/script/ |
H A D | shortest-path.h | 72 Queue *queue = QueueConstructor<Queue, Arc, local 75 queue, ArcFilter(), opts.nshortest, opts.unique, 79 delete queue; 84 Queue *queue = QueueConstructor<Queue, Arc, local 87 queue, ArcFilter(), opts.nshortest, opts.unique, 91 delete queue; 96 Queue *queue = QueueConstructor<Queue, Arc, local 99 queue, ArcFilter(), opts.nshortest, opts.unique, 103 delete queue; 108 Queue *queue local 120 Queue *queue = QueueConstructor<Queue, Arc, local 132 Queue *queue = QueueConstructor<Queue, Arc, local [all...] |
/external/smack/src/org/jivesoftware/smack/ |
H A D | PacketWriter.java | 46 private final BlockingQueue<Packet> queue; field in class:PacketWriter 55 this.queue = new ArrayBlockingQueue<Packet>(500, true); 89 queue.put(packet); 95 synchronized (queue) { 96 queue.notifyAll(); 124 synchronized (queue) { 125 queue.notifyAll(); 141 * Returns the next available packet from the queue for writing. 148 while (!done && (packet = queue.poll()) == null) { 150 synchronized (queue) { [all...] |
/external/smack/src/org/jivesoftware/smackx/workgroup/packet/ |
H A D | RoomInvitation.java | 48 * JID of the entity being invited. The entity could be another agent, user , a queue or a workgroup. In
49 * the case of a queue or a workgroup the server will select the best agent to invite.
134 * Some agent of the specified queue will be invited to the groupchat support session.
136 queue,
enum constant in enum:RoomInvitation.Type
|
H A D | RoomTransfer.java | 48 * JID of the entity being invited. The entity could be another agent, user , a queue or a workgroup. In
49 * the case of a queue or a workgroup the server will select the best agent to invite.
134 * Some agent of the specified queue will be invited to the groupchat support session.
136 queue,
enum constant in enum:RoomTransfer.Type
|
/external/chromium_org/cc/layers/ |
H A D | content_layer.cc | 77 bool ContentLayer::Update(ResourceUpdateQueue* queue, argument 87 bool updated = TiledLayer::Update(queue, occlusion);
|
H A D | picture_layer.cc | 81 bool PictureLayer::Update(ResourceUpdateQueue* queue, argument 84 bool updated = Layer::Update(queue, occlusion);
|
/external/chromium_org/cc/resources/ |
H A D | bitmap_content_layer_updater.cc | 25 ResourceUpdateQueue* queue, 30 queue, texture(), source_rect, dest_offset, partial_update); 87 void BitmapContentLayerUpdater::UpdateTexture(ResourceUpdateQueue* queue, argument 96 queue->AppendPartialUpload(upload); 98 queue->AppendFullUpload(upload); 24 Update( ResourceUpdateQueue* queue, const gfx::Rect& source_rect, const gfx::Vector2d& dest_offset, bool partial_update) argument
|
H A D | bitmap_raster_worker_pool.cc | 78 void BitmapRasterWorkerPool::ScheduleTasks(RasterTaskQueue* queue) { argument 106 for (RasterTaskQueue::Item::Vector::const_iterator it = queue->items.begin(); 107 it != queue->items.end();
|
H A D | gpu_raster_worker_pool.cc | 118 void GpuRasterWorkerPool::ScheduleTasks(RasterTaskQueue* queue) { argument 143 for (RasterTaskQueue::Item::Vector::const_iterator it = queue->items.begin(); 144 it != queue->items.end();
|
H A D | zero_copy_raster_worker_pool.cc | 106 void ZeroCopyRasterWorkerPool::ScheduleTasks(RasterTaskQueue* queue) { argument 134 for (RasterTaskQueue::Item::Vector::const_iterator it = queue->items.begin(); 135 it != queue->items.end();
|
/external/chromium_org/chrome/browser/predictors/ |
H A D | resource_prefetcher_unittest.cc | 89 void CheckPrefetcherState(size_t inflight, size_t queue, size_t host) { argument 91 EXPECT_EQ(prefetcher_->request_queue_.size(), queue);
|
/external/chromium_org/content/browser/appcache/ |
H A D | appcache_quota_client.cc | 27 void RunFront(content::AppCacheQuotaClient::RequestQueue* queue) { argument 28 base::Closure request = queue->front(); 29 queue->pop_front(); 156 // Start the next in the queue.
|
/external/chromium_org/mojo/public/cpp/bindings/tests/ |
H A D | router_unittest.cc | 37 explicit MessageAccumulator(internal::MessageQueue* queue) : queue_(queue) { argument
|
/external/chromium_org/net/socket/ |
H A D | websocket_endpoint_lock_manager.cc | 34 lock_info_in_map.queue.reset(new LockInfo::WaiterQueue); 38 lock_info_in_map.queue->Append(waiter); 92 DCHECK(!rhs.queue); 106 LockInfo::WaiterQueue* queue = lock_info_it->second.queue.get(); local 107 DCHECK(queue); 108 if (queue->empty()) { 116 Waiter* next_job = queue->head()->value();
|