[telemetry] Timeline model cleanups

tools/telemetry/telemetry/core/timeline/tracing/thread.py

Index: tools/telemetry/telemetry/core/timeline/tracing/thread.py
diff --git a/tools/telemetry/telemetry/core/timeline/tracing/thread.py b/tools/telemetry/telemetry/core/timeline/tracing/thread.py
deleted file mode 100644
index 8bb184a8b4f905bed5ddca79568e9185132311a4..0000000000000000000000000000000000000000
--- a/tools/telemetry/telemetry/core/timeline/tracing/thread.py
+++ /dev/null
@@ -1,182 +0,0 @@
-# Copyright 2013 The Chromium Authors. All rights reserved.
-# Use of this source code is governed by a BSD-style license that can be
-# found in the LICENSE file.
-
-import telemetry.core.timeline.event as timeline_event
-import telemetry.core.timeline.tracing.sample as tracing_sample
-import telemetry.core.timeline.tracing.slice as tracing_slice
-
-class Thread(timeline_event.TimelineEvent):
-  ''' A Thread stores all the trace events collected for a particular
-  thread. We organize the synchronous slices on a thread by "subrows," where
-  subrow 0 has all the root slices, subrow 1 those nested 1 deep, and so on.
-  The asynchronous slices are stored in an AsyncSliceGroup object.
-  '''
-  def __init__(self, process, tid):
-    super(Thread, self).__init__('thread %s' % tid, 0, 0, parent=process)
-    self.tid = tid
-    self._open_slices = []
-    self._async_slices = []
-    self._samples = []
-    self._slices = []
-
-  @property
-  def slices(self):
-    return self._slices
-
-  @property
-  def samples(self):
-    return self._samples
-
-  @property
-  def open_slice_count(self):
-    return len(self._open_slices)
-
-  @property
-  def async_slices(self):
-    return self._async_slices
-
-  def AddSample(self, category, name, timestamp, args=None):
-    if len(self._samples) and timestamp < self._samples[-1].start:
-      raise ValueError(
-          'Samples must be added in increasing timestamp order')
-    sample = tracing_sample.Sample(
-        category, name, timestamp, args=args, parent=self)
-    self._samples.append(sample)
-    self.children.append(sample)
-
-  def AddAsyncSlice(self, async_slice):
-    self._async_slices.append(async_slice)
-    async_slice.parent = self
-    self.children.append(async_slice)
-
-  def BeginSlice(self, category, name, timestamp, args=None):
-    """Opens a new slice for the thread.
-    Calls to beginSlice and endSlice must be made with
-    non-monotonically-decreasing timestamps.
-
-    * category: Category to which the slice belongs.
-    * name: Name of the slice to add.
-    * timestamp: The timetsamp of the slice, in milliseconds.
-    * args: Arguments associated with
-
-    Returns newly opened slice
-    """
-    if len(self._open_slices) > 0 and timestamp < self._open_slices[-1].start:
-      raise ValueError(
-          'Slices must be added in increasing timestamp order')
-    self._open_slices.append(
-        tracing_slice.Slice(category, name, timestamp, args=args, parent=self))
-
-  def EndSlice(self, end_timestamp):
-    """ Ends the last begun slice in this group and pushes it onto the slice
-    array.
-
-    * end_timestamp: Timestamp when the slice ended in milliseconds
-
-    returns completed slice.
-    """
-    if not len(self._open_slices):
-      raise ValueError(
-          'EndSlice called without an open slice')
-    curr_slice = self._open_slices.pop()
-    if end_timestamp < curr_slice.start:
-      raise ValueError(
-          'Slice %s end time is before its start.' % curr_slice.name)
-    curr_slice.duration = end_timestamp - curr_slice.start
-    return self.PushSlice(curr_slice)
-
-  def PushSlice(self, new_slice):
-    self._slices.append(new_slice)
-    self.children.append(new_slice)
-    return new_slice
-
-  def AutoCloseOpenSlices(self, max_timestamp=None):
-    if max_timestamp is None:
-      self.UpdateBounds()
-      max_timestamp = self.end
-    while len(self._open_slices) > 0:
-      curr_slice = self.EndSlice(max_timestamp)
-      curr_slice.did_not_finish = True
-
-  def IsTimestampValidForBeginOrEnd(self, timestamp):
-    if not len(self._open_slices):
-      return True
-    return timestamp >= self._open_slices[-1].start
-
-  def UpdateBounds(self):
-    super(Thread, self).UpdateBounds()
-
-    # Take open slices into account for the start and duration of thread event
-    if len(self._open_slices) > 0:
-      if not len(self.slices) or self.start > self._open_slices[0].start:
-        self.start = self._open_slices[0].start
-      if not len(self.slices) or self.end < self._open_slices[-1].start:
-        self.duration = self._open_slices[-1].start - self.start
-
-  def FinalizeImport(self):
-    self._BuildSliceSubRows()
-
-  def _BuildSliceSubRows(self):
-    '''This function works by walking through slices by start time.
-
-     The basic idea here is to insert each slice as deep into the subrow
-     list as it can go such that every subslice is fully contained by its
-     parent slice.
-
-     Visually, if we start with this:
-      0:  [    a       ]
-      1:    [  b  ]
-      2:    [c][d]
-
-     To place this slice:
-                   [e]
-     We first check row 2's last item, [d]. [e] wont fit into [d] (they dont
-     even intersect). So we go to row 1. That gives us [b], and [d] wont fit
-     into that either. So, we go to row 0 and its last slice, [a]. That can
-     completely contain [e], so that means we should add [e] as a subslice
-     of [a]. That puts it on row 1, yielding:
-      0:  [    a       ]
-      1:    [  b  ][e]
-      2:    [c][d]
-
-     If we then get this slice:
-                          [f]
-     We do the same deepest-to-shallowest walk of the subrows trying to fit
-     it. This time, it doesn't fit in any open slice. So, we simply append
-     it to row 0 (a root slice):
-      0:  [    a       ]  [f]
-      1:    [  b  ][e]
-    '''
-    def CompareSlices(s1, s2):
-      if s1.start == s2.start:
-        # Break ties by having the slice with the greatest
-        # end timestamp come first.
-        return cmp(s2.end, s1.end)
-      return cmp(s1.start, s2.start)
-
-    if not len(self._slices):
-      return
-
-    sorted_slices = sorted(self._slices, cmp=CompareSlices)
-    root_slice = sorted_slices[0]
-    for s in sorted_slices[1:]:
-      if not self._AddSliceIfBounds(root_slice, s):
-        root_slice = s
-
-  def _AddSliceIfBounds(self, root, child):
-    ''' Adds a child slice to a root slice its proper row.
-    Return False if the child slice is not in the bounds
-    of the root slice.
-
-    Because we know that the start time of child is >= the start time
-    of all other slices seen so far, we can just check the last slice
-    of each row for bounding.
-    '''
-    if child.start >= root.start and child.end <= root.end:
-      if len(root.sub_slices) > 0:
-        if self._AddSliceIfBounds(root.sub_slices[-1], child):
-          return True
-      root.AddSubSlice(child)
-      return True
-    return False