| OLD | NEW |
| 1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2011 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #ifndef BASE_PENDING_TASK_H_ | 5 #ifndef BASE_PENDING_TASK_H_ |
| 6 #define BASE_PENDING_TASK_H_ | 6 #define BASE_PENDING_TASK_H_ |
| 7 | 7 |
| 8 #include <array> |
| 8 #include <queue> | 9 #include <queue> |
| 9 | 10 |
| 10 #include "base/base_export.h" | 11 #include "base/base_export.h" |
| 11 #include "base/callback.h" | 12 #include "base/callback.h" |
| 12 #include "base/location.h" | 13 #include "base/location.h" |
| 13 #include "base/time/time.h" | 14 #include "base/time/time.h" |
| 14 #include "base/tracking_info.h" | 15 #include "base/tracking_info.h" |
| 15 | 16 |
| 16 namespace base { | 17 namespace base { |
| 17 | 18 |
| (...skipping 12 matching lines...) Expand all Loading... |
| 30 | 31 |
| 31 // Used to support sorting. | 32 // Used to support sorting. |
| 32 bool operator<(const PendingTask& other) const; | 33 bool operator<(const PendingTask& other) const; |
| 33 | 34 |
| 34 // The task to run. | 35 // The task to run. |
| 35 OnceClosure task; | 36 OnceClosure task; |
| 36 | 37 |
| 37 // The site this PendingTask was posted from. | 38 // The site this PendingTask was posted from. |
| 38 tracked_objects::Location posted_from; | 39 tracked_objects::Location posted_from; |
| 39 | 40 |
| 41 // Task backtrace. |
| 42 std::array<const void*, 4> task_backtrace; |
| 43 |
| 40 // Secondary sort key for run time. | 44 // Secondary sort key for run time. |
| 41 int sequence_num; | 45 int sequence_num; |
| 42 | 46 |
| 43 // OK to dispatch from a nested loop. | 47 // OK to dispatch from a nested loop. |
| 44 bool nestable; | 48 bool nestable; |
| 45 | 49 |
| 46 // Needs high resolution timers. | 50 // Needs high resolution timers. |
| 47 bool is_high_res; | 51 bool is_high_res; |
| 48 }; | 52 }; |
| 49 | 53 |
| 50 using TaskQueue = std::queue<PendingTask>; | 54 using TaskQueue = std::queue<PendingTask>; |
| 51 | 55 |
| 52 // PendingTasks are sorted by their |delayed_run_time| property. | 56 // PendingTasks are sorted by their |delayed_run_time| property. |
| 53 using DelayedTaskQueue = std::priority_queue<base::PendingTask>; | 57 using DelayedTaskQueue = std::priority_queue<base::PendingTask>; |
| 54 | 58 |
| 55 } // namespace base | 59 } // namespace base |
| 56 | 60 |
| 57 #endif // BASE_PENDING_TASK_H_ | 61 #endif // BASE_PENDING_TASK_H_ |
| OLD | NEW |