File: task_source_sort_key.cc

package info (click to toggle)
chromium 139.0.7258.127-2
  • links: PTS, VCS
  • area: main
  • in suites: forky
  • size: 6,122,156 kB
  • sloc: cpp: 35,100,771; ansic: 7,163,530; javascript: 4,103,002; python: 1,436,920; asm: 946,517; xml: 746,709; pascal: 187,653; perl: 88,691; sh: 88,436; objc: 79,953; sql: 51,488; cs: 44,583; fortran: 24,137; makefile: 22,147; tcl: 15,277; php: 13,980; yacc: 8,984; ruby: 7,485; awk: 3,720; lisp: 3,096; lex: 1,327; ada: 727; jsp: 228; sed: 36
file content (33 lines) | stat: -rw-r--r-- 1,151 bytes parent folder | download | duplicates (6) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
 
// Copyright 2016 The Chromium Authors
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.

#include "base/task/thread_pool/task_source_sort_key.h"

namespace base::internal {

static_assert(sizeof(TaskSourceSortKey) <= 2 * sizeof(uint64_t),
              "Members in TaskSourceSortKey should be ordered to be compact.");


bool TaskSourceSortKey::operator<(const TaskSourceSortKey& other) const {
  // This TaskSourceSortKey is considered more important than |other| if it has
  // a higher priority or if it has the same priority but fewer workers, or if
  // it has the same priority and same worker count but its next task was
  // posted sooner than |other|'s.

  // A lower priority is considered less important.
  if (priority_ != other.priority_) {
    return priority_ < other.priority_;
  }

  // A greater worker count is considered less important.
  if (worker_count_ != other.worker_count_) {
    return worker_count_ > other.worker_count_;
  }

  // Lastly, a greater ready time is considered less important.
  return ready_time_ > other.ready_time_;
}

}  // namespace base::internal