HomeSort by relevance Sort by last modified time
    Searched full:priority (Results 1 - 25 of 3413) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/kernel-headers/original/linux/netfilter/
xt_CLASSIFY.h 5 u_int32_t priority; member in struct:xt_classify_target_info
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/netfilter/
xt_CLASSIFY.h 5 u_int32_t priority; member in struct:xt_classify_target_info
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/netfilter/
xt_CLASSIFY.h 5 u_int32_t priority; member in struct:xt_classify_target_info
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/netfilter/
xt_CLASSIFY.h 5 u_int32_t priority; member in struct:xt_classify_target_info
  /external/iptables/include/linux/netfilter/
xt_CLASSIFY.h 7 __u32 priority; member in struct:xt_classify_target_info
  /external/droiddriver/src/com/google/android/droiddriver/util/
Logs.java 39 public static void log(int priority, String msg) {
40 if (Log.isLoggable(TAG, priority)) {
41 Log.println(priority, TAG, msg);
45 public static void log(int priority, Throwable e) {
46 if (Log.isLoggable(TAG, priority)) {
47 Log.println(priority, TAG, Log.getStackTraceString(e));
51 public static void log(int priority, Throwable e, String msg) {
52 if (Log.isLoggable(TAG, priority)) {
53 Log.println(priority, TAG, msg + '\n' + Log.getStackTraceString(e));
57 public static void logfmt(int priority, String format, Object... args)
    [all...]
  /external/smack/src/org/xbill/DNS/
MXRecord.java 24 * @param priority The priority of this MX. Records with lower priority
29 MXRecord(Name name, int dclass, long ttl, int priority, Name target) {
30 super(name, Type.MX, dclass, ttl, priority, "priority",
40 /** Returns the priority of this MX record */
SRVRecord.java 20 private int priority, weight, port; field in class:SRVRecord
32 * @param priority The priority of this SRV. Records with lower priority
35 * priority.
40 SRVRecord(Name name, int dclass, long ttl, int priority,
44 this.priority = checkU16("priority", priority);
52 priority = in.readU16()
    [all...]
  /external/smack/src/org/jivesoftware/smack/util/dns/
SRVRecord.java 27 private int priority; field in class:SRVRecord
34 * @param priority Priority of the target host
35 * @param weight Relative weight for records with same priority
38 public SRVRecord(String fqdn, int port, int priority, int weight) {
45 if (priority < 0 || priority > 65535)
47 "DNS SRV records priority must be a 16-bit unsiged integer (i.e. between 0-65535. Priority was: "
48 + priority);
    [all...]
  /external/nist-sip/java/gov/nist/javax/sip/parser/
PriorityParser.java 33 * Parser for Priority header.
48 * @param priority the header to parse
50 public PriorityParser(String priority) {
51 super(priority);
64 * @return SIPHeader (Priority object)
71 Priority priority = new Priority(); local
73 headerName(TokenTypes.PRIORITY);
75 priority.setHeaderName(SIPHeaderNames.PRIORITY)
    [all...]
  /external/chromium_org/net/cookies/
cookie_constants.h 21 // Returns the Set-Cookie header priority token corresponding to |priority|.
22 NET_EXPORT const std::string CookiePriorityToString(CookiePriority priority);
24 // Converts the Set-Cookie header priority token |priority| to a CookiePriority.
26 NET_EXPORT CookiePriority StringToCookiePriority(const std::string& priority);
  /external/chromium_org/net/base/
prioritized_dispatcher.cc 11 PrioritizedDispatcher::Limits::Limits(Priority num_priorities,
37 Job* job, Priority priority) {
39 DCHECK_LT(priority, num_priorities());
40 if (num_running_jobs_ < max_running_jobs_[priority]) {
45 return queue_.Insert(job, priority);
62 const Handle& handle, Priority priority) {
64 DCHECK_LT(priority, num_priorities());
65 DCHECK_GE(num_running_jobs_, max_running_jobs_[handle.priority()]) <<
    [all...]
prioritized_dispatcher.h 15 // A priority-based dispatcher of jobs. Dispatch order is by priority (highest
21 // non-thread-safe PriorityQueue. All operations are O(p) time for p priority
28 typedef PriorityQueue<Job*>::Priority Priority;
32 // for at most 30 running jobs in total. Jobs at priority 0 can't use slots
35 // jobs at priority 1 or below can start. After one more job starts, no jobs
36 // at priority 2 or below can start, since the remaining 5 slots are reserved
37 // for priority 3 or above.
39 Limits(Priority num_priorities, size_t total_jobs)
    [all...]
priority_queue.h 22 // A simple priority queue. The order of values is by priority and then FIFO.
24 // from the queue, and all operations are O(p) time for p priority levels.
25 // The queue is agnostic to priority ordering (whether 0 precedes 1).
26 // If the highest priority is 0, FirstMin() returns the first in order.
42 typedef uint32 Priority;
73 Priority priority() const { return priority_; } function in class:net::PriorityQueue::Pointer
98 static const Priority kNullPriority = static_cast<Priority>(-1)
    [all...]
  /external/chromium_org/net/url_request/
url_request_http_job_unittest.cc 23 // Inherit from URLRequestHttpJob to expose the priority and some
34 using URLRequestHttpJob::priority;
54 // priority, both before and after start.
57 EXPECT_EQ(DEFAULT_PRIORITY, job->priority());
60 EXPECT_EQ(LOWEST, job->priority());
63 EXPECT_EQ(LOW, job->priority());
66 EXPECT_EQ(LOW, job->priority());
69 EXPECT_EQ(MEDIUM, job->priority());
72 // Make sure that URLRequestHttpJob passes on its priority to its
83 EXPECT_EQ(LOW, network_layer_.last_transaction()->priority());
    [all...]
  /external/chromium_org/chrome/browser/chromeos/drive/
job_queue.h 16 // Priority queue for managing jobs in JobScheduler.
20 // execution and has |num_priority_levels| levels of priority.
24 // Pushes a job |id| of |priority|. The job with the smallest priority value
25 // is popped first (lower values are higher priority). In the same priority,
27 void Push(JobID id, int priority);
30 // the queue with equal or higher priority (lower value)), and the limit of
33 // For instance, if |accepted_priority| is 1, the first job with priority 0
34 // (higher priority) in the queue is picked even if a job with priority 1 wa
    [all...]
job_queue.cc 30 // Looks up the queue in the order of priority upto |accepted_priority|.
31 for (int priority = 0; priority <= accepted_priority; ++priority) {
32 if (!queue_[priority].empty()) {
33 *id = queue_[priority].front();
34 queue_[priority].pop_front();
42 void JobQueue::GetQueuedJobs(int priority, std::vector<JobID>* jobs) const {
43 DCHECK_LT(priority, static_cast<int>(queue_.size()));
45 jobs->assign(queue_[priority].begin(), queue_[priority].end())
    [all...]
  /frameworks/volley/tests/src/com/android/volley/
RequestTest.java 21 import com.android.volley.Request.Priority;
34 TestRequest low = new TestRequest(Priority.LOW);
36 TestRequest low2 = new TestRequest(Priority.LOW);
38 TestRequest high = new TestRequest(Priority.HIGH);
40 TestRequest immediate = new TestRequest(Priority.IMMEDIATE);
52 private Priority mPriority = Priority.NORMAL;
53 public TestRequest(Priority priority) {
55 mPriority = priority;
    [all...]
  /external/nist-sip/java/javax/sip/header/
PriorityHeader.java 6 String NAME = "Priority";
14 void setPriority(String priority) throws ParseException;
  /dalvik/vm/os/
os.h 20 * Raises the scheduling priority of the current thread. Returns the
21 * original priority if successful, or INT_MAX on failure.
29 * Sets the current thread scheduling priority. Used to undo the effects
37 * Changes the priority of a system thread to match that of the Thread object.
39 * We map a priority value from 1-10 to Linux "nice" values, where lower
40 * numbers indicate higher priority.
45 * Returns the thread priority for the current thread by querying the system.
  /external/chromium_org/chrome/installer/linux/debian/
postinst 27 PRIORITY=200
32 # not setting our priority below it. Anyone want to poke Firefox to raise
33 # their priority?)
34 PRIORITY=150
37 # Unstable, give it the "lowest" priority.
38 PRIORITY=120
41 PRIORITY=0
46 /usr/bin/@@PACKAGE@@ $PRIORITY
48 /usr/bin/@@PACKAGE@@ $PRIORITY
  /external/chromium/net/url_request/
url_request_netlog_params.cc 15 RequestPriority priority)
19 priority_(priority) {
27 dict->SetInteger("priority", static_cast<int>(priority_));
  /external/clang/bindings/python/tests/cindex/
test_code_completion.py 31 "{'int', ResultType} | {'test1', TypedText} || Priority: 50 || Availability: Available || Brief comment: Aaa.",
32 "{'void', ResultType} | {'test2', TypedText} | {'(', LeftParen} | {')', RightParen} || Priority: 50 || Availability: Available || Brief comment: Bbb.",
33 "{'return', TypedText} || Priority: 40 || Availability: Available || Brief comment: None"
60 "{'const', TypedText} || Priority: 40 || Availability: Available || Brief comment: None",
61 "{'volatile', TypedText} || Priority: 40 || Availability: Available || Brief comment: None",
62 "{'operator', TypedText} || Priority: 40 || Availability: Available || Brief comment: None",
63 "{'P', TypedText} | {'::', Text} || Priority: 75 || Availability: Available || Brief comment: None",
64 "{'Q', TypedText} | {'::', Text} || Priority: 75 || Availability: Available || Brief comment: None"
70 "{'P', TypedText} | {'::', Text} || Priority: 75 || Availability: Available || Brief comment: None",
71 "{'P &', ResultType} | {'operator=', TypedText} | {'(', LeftParen} | {'const P &', Placeholder} | {')', RightParen} || Priority: 34 || Availability: Available || Brief comment: None"
    [all...]
  /external/nist-sip/java/gov/nist/javax/sip/header/
Priority.java 35 * the Priority header.
43 public class Priority extends SIPHeader implements PriorityHeader {
65 /** priority field
67 protected String priority; field in class:Priority
71 public Priority() {
80 return priority;
84 * get the priority value.
88 return priority;
92 * Set the priority member
99 + "Priority, setPriority(), the priority parameter is null")
    [all...]
  /external/wpa_supplicant_8/wpa_supplicant/wpa_gui-qt4/
wpamsg.h 18 : msg(_msg), priority(_priority)
24 int getPriority() const { return priority; }
29 int priority; member in class:WpaMsg

Completed in 2608 milliseconds

1 2 3 4 5 6 7 8 91011>>