pub struct ProfileQueue {
pub profile: String,
pub jobs: u32,
pub waited_ms: u64,
pub causes: Vec<CauseWait>,
pub before_listed_ms: u64,
pub uncovered_ms: u64,
pub unrecorded: u32,
pub estimated: u32,
}Expand description
Why one profile’s jobs queued over a window, from what each plan that held them said (ADR 0154). Unlike the rest
of insights, its times are milliseconds, so shares of short waits come out right. A wait runs from GitHub queueing
a job to its start, less what passed while no runnerd ran, summed over the jobs counted; the causes and the two
parts no cause covers add up to waited_ms.
Fields§
§profile: StringThe profile.
jobs: u32The jobs whose waits it splits.
waited_ms: u64Their waits together.
causes: Vec<CauseWait>What each cause held them for, longest first; none of 0.
before_listed_ms: u64Of waited_ms, what passed before runnerd first listed the jobs queued: GitHub’s listing lag and the time to
runnerd’s next listing, less any downtime in it.
uncovered_ms: u64Of waited_ms, what no plan held them for once listed: after a restart until the first plan, and between a
planned start and its runner.
unrecorded: u32The jobs left out as their history rows are from before runnerd counted why jobs wait.
estimated: u32The jobs whose causes were counted past their start, as when a runner took one before runnerd read it, and were scaled down into the wait left after the time before the listing: their causes are estimates.
Implementations§
Source§impl ProfileQueue
impl ProfileQueue
Sourcepub const TITLE: &'static str = "Why jobs queued"
pub const TITLE: &'static str = "Why jobs queued"
What the split of the profiles’ queue time is called where it shows.
Sourcepub const BEFORE_LISTED: &'static str = "Before runnerd listed it"
pub const BEFORE_LISTED: &'static str = "Before runnerd listed it"
The label of the wait before runnerd first listed a job.
Sourcepub const UNCOVERED: &'static str = "No plan covered"
pub const UNCOVERED: &'static str = "No plan covered"
The label of the wait no plan held a job for.
Sourcepub fn line(&self) -> String
pub fn line(&self) -> String
It in a line: jvm: 42 jobs waited 12h 30m in all, then ; 3 jobs from before runnerd counted why are left out when some are, and ; 2 jobs' causes are estimates, scaled into their waits when some are;
jvm: 3 jobs ended from before runnerd counted why jobs wait when none is counted.
Sourcepub fn figures(&self) -> Vec<LabelledFigure>
pub fn figures(&self) -> Vec<LabelledFigure>
What held the jobs, longest first, each with its share of their waits, taken from the milliseconds:
Host memory 6h 10m 49%; then the wait before runnerd listed them and the wait no plan covered, when there
was some. Empty when no job was counted.
Trait Implementations§
Source§impl Clone for ProfileQueue
impl Clone for ProfileQueue
Source§impl Debug for ProfileQueue
impl Debug for ProfileQueue
Source§impl<'de> Deserialize<'de> for ProfileQueue
impl<'de> Deserialize<'de> for ProfileQueue
Source§fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>where
__D: Deserializer<'de>,
impl Eq for ProfileQueue
Source§impl PartialEq for ProfileQueue
impl PartialEq for ProfileQueue
Source§impl Serialize for ProfileQueue
impl Serialize for ProfileQueue
impl StructuralPartialEq for ProfileQueue
Auto Trait Implementations§
impl Forget for ProfileQueue
impl Freeze for ProfileQueue
impl Move for ProfileQueue
impl RefUnwindSafe for ProfileQueue
impl Send for ProfileQueue
impl Sync for ProfileQueue
impl Unpin for ProfileQueue
impl UnsafeUnpin for ProfileQueue
impl UnwindSafe for ProfileQueue
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> DeserializeOwned for Twhere
T: for<'de> Deserialize<'de>,
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§impl<Q, K> Equivalent<K> for Q
impl<Q, K> Equivalent<K> for Q
Source§fn equivalent(&self, key: &K) -> bool
fn equivalent(&self, key: &K) -> bool
key and return true if they are equal.