| /external/chromium_org/net/spdy/ |
| D | write_blocked_list.h | 26 static SpdyPriority ClampPriority(SpdyPriority priority) { in ClampPriority() argument
27 if (priority < kHighestPriority) { in ClampPriority()
28 LOG(DFATAL) << "Invalid priority: " << static_cast<int>(priority); in ClampPriority()
31 if (priority > kLowestPriority) { in ClampPriority()
32 LOG(DFATAL) << "Invalid priority: " << static_cast<int>(priority); in ClampPriority()
35 return priority; in ClampPriority()
48 IdType PopFront(SpdyPriority priority) { in PopFront() argument
49 priority = ClampPriority(priority); in PopFront()
50 DCHECK(!write_blocked_lists_[priority].empty()); in PopFront()
51 IdType stream_id = write_blocked_lists_[priority].front(); in PopFront()
[all …]
|
| D | spdy_write_queue.cc | 45 void SpdyWriteQueue::Enqueue(RequestPriority priority, in Enqueue() argument
50 CHECK_GE(priority, MINIMUM_PRIORITY); in Enqueue()
51 CHECK_LE(priority, MAXIMUM_PRIORITY); in Enqueue()
53 DCHECK_EQ(stream->priority(), priority); in Enqueue()
54 queue_[priority].push_back( in Enqueue()
81 RequestPriority priority = stream->priority(); in RemovePendingWritesForStream() local
82 CHECK_GE(priority, MINIMUM_PRIORITY); in RemovePendingWritesForStream()
83 CHECK_LE(priority, MAXIMUM_PRIORITY); in RemovePendingWritesForStream()
90 if (priority == i) in RemovePendingWritesForStream()
104 std::deque<PendingWrite>* queue = &queue_[priority]; in RemovePendingWritesForStream()
|
| /external/deqp/framework/delibs/depool/ |
| D | dePoolHeap.c | 32 int priority; member
36 DE_INLINE HeapItem HeapItem_create (int priority, int value) in HeapItem_create() argument
39 h.priority = priority; in HeapItem_create()
46 if (a.priority < b.priority) in HeapItem_cmp()
48 if (a.priority > b.priority) in HeapItem_cmp()
70 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 0); in dePoolHeap_selfTest()
71 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 10); in dePoolHeap_selfTest()
72 DE_TEST_ASSERT(TestHeap_popMin(heap).priority == 20); in dePoolHeap_selfTest()
98 DE_TEST_ASSERT(h.priority == i); in dePoolHeap_selfTest()
99 DE_TEST_ASSERT(h.value == -h.priority); in dePoolHeap_selfTest()
[all …]
|
| /external/droiddriver/src/com/google/android/droiddriver/util/ |
| D | Logs.java | 38 public static void log(int priority, String msg) { in log() argument
39 if (Log.isLoggable(TAG, priority)) { in log()
40 Log.println(priority, TAG, msg); in log()
44 public static void log(int priority, Throwable e) { in log() argument
45 if (Log.isLoggable(TAG, priority)) { in log()
46 Log.println(priority, TAG, Log.getStackTraceString(e)); in log()
50 public static void log(int priority, Throwable e, String msg) { in log() argument
51 if (Log.isLoggable(TAG, priority)) { in log()
52 Log.println(priority, TAG, msg + '\n' + Log.getStackTraceString(e)); in log()
56 public static void logfmt(int priority, String format, Object... args) { in logfmt() argument
[all …]
|
| /external/chromium_org/cc/resources/ |
| D | picture_layer_tiling_unittest.cc | 701 TilePriority priority = tile->priority(ACTIVE_TREE); in TEST() local
705 EXPECT_EQ(TilePriority::NOW, priority.priority_bin); in TEST()
706 EXPECT_FLOAT_EQ(0.f, priority.distance_to_visible); in TEST()
709 EXPECT_EQ(TilePriority::SOON, priority.priority_bin); in TEST()
712 EXPECT_EQ(TilePriority::EVENTUALLY, priority.priority_bin); in TEST()
713 EXPECT_GT(priority.distance_to_visible, 0.f); in TEST()
733 TilePriority priority = tiling->TileAt(5, 1)->priority(ACTIVE_TREE); in TEST() local
734 EXPECT_FLOAT_EQ(68.f, priority.distance_to_visible); in TEST()
736 priority = tiling->TileAt(2, 5)->priority(ACTIVE_TREE); in TEST()
737 EXPECT_FLOAT_EQ(68.f, priority.distance_to_visible); in TEST()
[all …]
|
| D | prioritized_tile_set_unittest.cc | 136 for (int priority = 0; priority < 4; ++priority) { in TEST_F() local
139 tile->SetPriority(ACTIVE_TREE, priorities[priority]); in TEST_F()
140 tile->SetPriority(PENDING_TREE, priorities[priority]); in TEST_F()
170 for (int priority = 0; priority < 4; ++priority) { in TEST_F() local
173 tile->SetPriority(ACTIVE_TREE, priorities[priority]); in TEST_F()
174 tile->SetPriority(PENDING_TREE, priorities[priority]); in TEST_F()
206 for (int priority = 0; priority < 4; ++priority) { in TEST_F() local
209 tile->SetPriority(ACTIVE_TREE, priorities[priority]); in TEST_F()
210 tile->SetPriority(PENDING_TREE, priorities[priority]); in TEST_F()
243 for (int priority = 0; priority < 4; ++priority) { in TEST_F() local
[all …]
|
| /external/jmdns/src/javax/jmdns/ |
| D | ServiceInfo.java | 119 …ng type, final String name, final int port, final int weight, final int priority, final String tex… in create() argument
120 return new ServiceInfoImpl(type, name, "", port, weight, priority, false, text); in create()
142 …name, final String subtype, final int port, final int weight, final int priority, final String tex… in create() argument
143 return new ServiceInfoImpl(type, name, subtype, port, weight, priority, false, text); in create()
163 …ng type, final String name, final int port, final int weight, final int priority, final Map<String… in create() argument
164 return new ServiceInfoImpl(type, name, "", port, weight, priority, false, props); in create()
186 …name, final String subtype, final int port, final int weight, final int priority, final Map<String… in create() argument
187 return new ServiceInfoImpl(type, name, subtype, port, weight, priority, false, props); in create()
207 …ng type, final String name, final int port, final int weight, final int priority, final byte[] tex… in create() argument
208 return new ServiceInfoImpl(type, name, "", port, weight, priority, false, text); in create()
[all …]
|
| /external/smack/src/org/jivesoftware/smack/util/dns/ |
| D | SRVRecord.java | 27 private int priority; field in SRVRecord
38 public SRVRecord(String fqdn, int port, int priority, int weight) { in SRVRecord() argument
45 if (priority < 0 || priority > 65535) in SRVRecord()
48 + priority); in SRVRecord()
50 this.priority = priority; in SRVRecord()
56 return priority; in getPriority()
68 int res = other.priority - this.priority; in compareTo()
77 return super.toString() + " prio:" + priority + ":w:" + weight; in toString()
|
| /external/chromium_org/chrome/browser/chromeos/drive/ |
| D | job_queue.cc | 31 for (int priority = 0; priority <= accepted_priority; ++priority) { in PopForRun() local
32 if (!queue_[priority].empty()) { in PopForRun()
33 *id = queue_[priority].front(); in PopForRun()
34 queue_[priority].pop_front(); in PopForRun()
42 void JobQueue::GetQueuedJobs(int priority, std::vector<JobID>* jobs) const { in GetQueuedJobs() argument
43 DCHECK_LT(priority, static_cast<int>(queue_.size())); in GetQueuedJobs()
45 jobs->assign(queue_[priority].begin(), queue_[priority].end()); in GetQueuedJobs()
48 void JobQueue::Push(JobID id, int priority) { in Push() argument
49 DCHECK_LT(priority, static_cast<int>(queue_.size())); in Push()
51 queue_[priority].push_back(id); in Push()
|
| /external/chromium_org/net/quic/ |
| D | quic_http_utils.cc | 10 const RequestPriority priority) { in ConvertRequestPriorityToQuicPriority() argument
11 DCHECK_GE(priority, MINIMUM_PRIORITY); in ConvertRequestPriorityToQuicPriority()
12 DCHECK_LE(priority, MAXIMUM_PRIORITY); in ConvertRequestPriorityToQuicPriority()
13 return static_cast<QuicPriority>(HIGHEST - priority); in ConvertRequestPriorityToQuicPriority()
17 QuicPriority priority) { in ConvertQuicPriorityToRequestPriority() argument
19 return (priority >= 5) ? in ConvertQuicPriorityToRequestPriority()
20 IDLE : static_cast<RequestPriority>(HIGHEST - priority); in ConvertQuicPriorityToRequestPriority()
26 QuicPriority priority, in QuicRequestNetLogCallback() argument
30 dict->SetInteger("quic_priority", static_cast<int>(priority)); in QuicRequestNetLogCallback()
|
| /external/chromium_org/net/base/ |
| D | prioritized_dispatcher.cc | 27 Job* job, Priority priority) { in Add() argument
29 DCHECK_LT(priority, num_priorities()); in Add()
30 if (num_running_jobs_ < max_running_jobs_[priority]) { in Add()
35 return queue_.Insert(job, priority); in Add()
39 Job* job, Priority priority) { in AddAtHead() argument
41 DCHECK_LT(priority, num_priorities()); in AddAtHead()
42 if (num_running_jobs_ < max_running_jobs_[priority]) { in AddAtHead()
47 return queue_.InsertAtFront(job, priority); in AddAtHead()
64 const Handle& handle, Priority priority) { in ChangePriority() argument
66 DCHECK_LT(priority, num_priorities()); in ChangePriority()
[all …]
|
| D | priority_queue.h | 80 Priority priority() const { return priority_; } in priority() function
110 Pointer(Priority priority, const ListIterator& iterator) in Pointer() argument
111 : priority_(priority), iterator_(iterator) { in Pointer()
140 Pointer Insert(const T& value, Priority priority) { in Insert() argument
142 DCHECK_LT(priority, lists_.size()); in Insert()
144 List& list = lists_[priority]; in Insert()
149 return Pointer(priority, list.insert(list.end(), in Insert()
152 return Pointer(priority, list.insert(list.end(), value)); in Insert()
158 Pointer InsertAtFront(const T& value, Priority priority) { in InsertAtFront() argument
160 DCHECK_LT(priority, lists_.size()); in InsertAtFront()
[all …]
|
| /external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/ |
| D | Android.mk | 17 test_makefile := external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/An…
19 test_name := containers/container.adaptors/priority.queue/priqueue.cons/move_noexcept
23 test_name := containers/container.adaptors/priority.queue/priqueue.cons/ctor_copy
27 test_name := containers/container.adaptors/priority.queue/priqueue.cons/default_noexcept
31 test_name := containers/container.adaptors/priority.queue/priqueue.cons/ctor_iter_iter_comp_cont
35 test_name := containers/container.adaptors/priority.queue/priqueue.cons/assign_copy
39 test_name := containers/container.adaptors/priority.queue/priqueue.cons/move_assign_noexcept
43 test_name := containers/container.adaptors/priority.queue/priqueue.cons/ctor_comp
47 test_name := containers/container.adaptors/priority.queue/priqueue.cons/ctor_iter_iter
51 test_name := containers/container.adaptors/priority.queue/priqueue.cons/ctor_iter_iter_comp
[all …]
|
| /external/guava/guava/src/com/google/common/util/concurrent/ |
| D | ThreadFactoryBuilder.java | 48 private Integer priority = null; field in ThreadFactoryBuilder
92 public ThreadFactoryBuilder setPriority(int priority) { in setPriority() argument
95 checkArgument(priority >= Thread.MIN_PRIORITY, in setPriority()
96 "Thread priority (%s) must be >= %s", priority, Thread.MIN_PRIORITY); in setPriority()
97 checkArgument(priority <= Thread.MAX_PRIORITY, in setPriority()
98 "Thread priority (%s) must be <= %s", priority, Thread.MAX_PRIORITY); in setPriority()
99 this.priority = priority; in setPriority()
149 final Integer priority = builder.priority; in build() local
166 if (priority != null) { in build()
167 thread.setPriority(priority); in build()
|
| /external/openssl/crypto/pqueue/ |
| D | pqueue.c | 76 memcpy(item->priority,prio64be,sizeof(item->priority)); in pitem_new()
127 int cmp = memcmp(next->priority, item->priority,8); in pqueue_insert()
178 if ( memcmp(next->priority, prio64be,8) == 0) in pqueue_find()
186 if ( memcmp(next->priority, prio64be,8) ==0) in pqueue_find()
210 item->priority[0],item->priority[1], in pqueue_print()
211 item->priority[2],item->priority[3], in pqueue_print()
212 item->priority[4],item->priority[5], in pqueue_print()
213 item->priority[6],item->priority[7]); in pqueue_print()
|
| /external/smack/src/org/jivesoftware/smack/packet/ |
| D | Presence.java | 63 private int priority = Integer.MIN_VALUE; field in Presence
84 public Presence(Type type, String status, int priority, Mode mode) { in Presence() argument
87 setPriority(priority); in Presence()
168 return priority; in getPriority()
177 public void setPriority(int priority) { in setPriority() argument
178 if (priority < -128 || priority > 128) { in setPriority()
179 throw new IllegalArgumentException("Priority value " + priority + in setPriority()
182 this.priority = priority; in setPriority()
251 if (priority != Integer.MIN_VALUE) { in toXML()
252 buf.append("<priority>").append(priority).append("</priority>"); in toXML()
|
| /external/chromium_org/base/process/ |
| D | process_win.cc | 41 DWORD priority = GetPriority(); in IsProcessBackgrounded() local
42 if (priority == 0) in IsProcessBackgrounded()
44 return ((priority == BELOW_NORMAL_PRIORITY_CLASS) || in IsProcessBackgrounded()
45 (priority == IDLE_PRIORITY_CLASS)); in IsProcessBackgrounded()
54 DWORD priority; in SetProcessBackgrounded() local
57 priority = value ? PROCESS_MODE_BACKGROUND_BEGIN : in SetProcessBackgrounded()
60 priority = value ? BELOW_NORMAL_PRIORITY_CLASS : NORMAL_PRIORITY_CLASS; in SetProcessBackgrounded()
63 return (::SetPriorityClass(process_, priority) != 0); in SetProcessBackgrounded()
|
| /external/smack/src/org/xbill/DNS/ |
| D | SRVRecord.java | 20 private int priority, weight, port; field in SRVRecord
40 SRVRecord(Name name, int dclass, long ttl, int priority, in SRVRecord() argument
44 this.priority = checkU16("priority", priority); in SRVRecord()
52 priority = in.readU16(); in rrFromWire()
60 priority = st.getUInt16(); in rdataFromString()
70 sb.append(priority + " "); in rrToString()
80 return priority; in getPriority()
103 out.writeU16(priority); in rrToWire()
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v5/ |
| D | v8-richards.js | 121 Scheduler.prototype.addIdleTask = function (id, priority, queue, count) { argument
122 this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));
131 Scheduler.prototype.addWorkerTask = function (id, priority, queue) { argument
132 this.addTask(id, priority, queue, new WorkerTask(this, ID_HANDLER_A, 0));
141 Scheduler.prototype.addHandlerTask = function (id, priority, queue) { argument
142 this.addTask(id, priority, queue, new HandlerTask(this));
151 Scheduler.prototype.addDeviceTask = function (id, priority, queue) { argument
152 this.addTask(id, priority, queue, new DeviceTask(this))
162 Scheduler.prototype.addRunningTask = function (id, priority, queue, task) { argument
163 this.addTask(id, priority, queue, task);
[all …]
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
| D | v8-richards.js | 121 Scheduler.prototype.addIdleTask = function (id, priority, queue, count) { argument
122 this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));
131 Scheduler.prototype.addWorkerTask = function (id, priority, queue) { argument
132 this.addTask(id, priority, queue, new WorkerTask(this, ID_HANDLER_A, 0));
141 Scheduler.prototype.addHandlerTask = function (id, priority, queue) { argument
142 this.addTask(id, priority, queue, new HandlerTask(this));
151 Scheduler.prototype.addDeviceTask = function (id, priority, queue) { argument
152 this.addTask(id, priority, queue, new DeviceTask(this))
162 Scheduler.prototype.addRunningTask = function (id, priority, queue, task) { argument
163 this.addTask(id, priority, queue, task);
[all …]
|
| /external/chromium_org/v8/benchmarks/ |
| D | richards.js | 126 Scheduler.prototype.addIdleTask = function (id, priority, queue, count) { argument
127 this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));
136 Scheduler.prototype.addWorkerTask = function (id, priority, queue) { argument
137 this.addTask(id, priority, queue, new WorkerTask(this, ID_HANDLER_A, 0));
146 Scheduler.prototype.addHandlerTask = function (id, priority, queue) { argument
147 this.addTask(id, priority, queue, new HandlerTask(this));
156 Scheduler.prototype.addDeviceTask = function (id, priority, queue) { argument
157 this.addTask(id, priority, queue, new DeviceTask(this))
167 Scheduler.prototype.addRunningTask = function (id, priority, queue, task) { argument
168 this.addTask(id, priority, queue, task);
[all …]
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v4/ |
| D | v8-richards.js | 121 Scheduler.prototype.addIdleTask = function (id, priority, queue, count) { argument
122 this.addRunningTask(id, priority, queue, new IdleTask(this, 1, count));
131 Scheduler.prototype.addWorkerTask = function (id, priority, queue) { argument
132 this.addTask(id, priority, queue, new WorkerTask(this, ID_HANDLER_A, 0));
141 Scheduler.prototype.addHandlerTask = function (id, priority, queue) { argument
142 this.addTask(id, priority, queue, new HandlerTask(this));
151 Scheduler.prototype.addDeviceTask = function (id, priority, queue) { argument
152 this.addTask(id, priority, queue, new DeviceTask(this))
162 Scheduler.prototype.addRunningTask = function (id, priority, queue, task) { argument
163 this.addTask(id, priority, queue, task);
[all …]
|
| /external/glide/library/src/main/java/com/bumptech/glide/volley/ |
| D | VolleyStreamFetcher.java | 37 public InputStream loadData(Priority priority) throws Exception { in loadData() argument
38 … GlideRequest request = new GlideRequest(url, requestFuture, glideToVolleyPriority(priority)); in loadData()
63 private static Request.Priority glideToVolleyPriority(Priority priority) { in glideToVolleyPriority() argument
64 switch (priority) { in glideToVolleyPriority()
79 private Priority priority; field in VolleyStreamFetcher.GlideRequest
81 … public GlideRequest(String url, VolleyRequestFuture<InputStream> future, Priority priority) { in GlideRequest() argument
84 this.priority = priority; in GlideRequest()
89 return priority; in getPriority()
|
| /external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.members/ |
| D | Android.mk | 17 test_makefile := external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.members…
19 test_name := containers/container.adaptors/priority.queue/priqueue.members/push
23 test_name := containers/container.adaptors/priority.queue/priqueue.members/top
27 test_name := containers/container.adaptors/priority.queue/priqueue.members/swap
31 test_name := containers/container.adaptors/priority.queue/priqueue.members/pop
35 test_name := containers/container.adaptors/priority.queue/priqueue.members/size
39 test_name := containers/container.adaptors/priority.queue/priqueue.members/emplace
43 test_name := containers/container.adaptors/priority.queue/priqueue.members/push_rvalue
47 test_name := containers/container.adaptors/priority.queue/priqueue.members/empty
|
| /external/iptables/extensions/ |
| D | libxt_CLASSIFY.c | 44 if (CLASSIFY_string_to_priority(cb->arg, &clinfo->priority)) in CLASSIFY_parse()
50 CLASSIFY_print_class(unsigned int priority, int numeric) in CLASSIFY_print_class() argument
52 printf(" %x:%x", TC_H_MAJ(priority)>>16, TC_H_MIN(priority)); in CLASSIFY_print_class()
63 CLASSIFY_print_class(clinfo->priority, numeric); in CLASSIFY_print()
73 TC_H_MAJ(clinfo->priority)>>16, TC_H_MIN(clinfo->priority)); in CLASSIFY_save()
|