Support JSON encoding of data for about:tracking information

base/tracked_objects.h

 // Copyright (c) 2011 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.
 
 #ifndef BASE_TRACKED_OBJECTS_H_
 #define BASE_TRACKED_OBJECTS_H_
 #pragma once
 
 #include <map>
 #include <string>
+#include <stack>

[ramant (doing other things), 2011/10/24 18:03:49]

nit: "#include <stack>" should come before #include <string>

[jar (doing other things), 2011/10/24 18:43:27]

Done.

 #include <vector>
 
 #include "base/base_export.h"
 #include "base/location.h"
 #include "base/time.h"
 #include "base/synchronization/lock.h"
 #include "base/threading/thread_local_storage.h"
+#include "base/values.h"
 
 // TrackedObjects provides a database of stats about objects (generally Tasks)
 // that are tracked.  Tracking means their birth, death, duration, birth thread,
 // death thread, and birth place are recorded.  This data is carefully spread
 // across a series of objects so that the counts and times can be rapidly
 // updated without (usually) having to lock the data, and hence there is usually
 // very little contention caused by the tracking.  The data can be viewed via
 // the about:tracking URL, with a variety of sorting and filtering choices.
 //
 // These classes serve as the basis of a profiler of sorts for the Tasks system.
@@ skipping 67 matching lines @@
 // ThreadData instance (for that specific thread only).  The two critical items
 // are lists of DeathData and Births instances.  These lists are maintained in
 // STL maps, which are indexed by Location. As noted earlier, we can compare
 // locations very efficiently as we consider the underlying data (file,
 // function, line) to be atoms, and hence pointer comparison is used rather than
 // (slow) string comparisons.
 //
 // To provide a mechanism for iterating over all "known threads," which means
 // threads that have recorded a birth or a death, we create a singly linked list
 // of ThreadData instances. Each such instance maintains a pointer to the next
-// one.  A static member of ThreadData provides a pointer to the first_ item on
-// this global list, and access to that first_ item requires the use of a lock_.
+// one.  A static member of ThreadData provides a pointer to the first item on
+// this global list, and access via that all_thread_data_list_head_ item
+// requires the use of the list_lock_.
 // When new ThreadData instances is added to the global list, it is pre-pended,
 // which ensures that any prior acquisition of the list is valid (i.e., the
 // holder can iterate over it without fear of it changing, or the necessity of
 // using an additional lock.  Iterations are actually pretty rare (used
 // primarilly for cleanup, or snapshotting data for display), so this lock has
 // very little global performance impact.
 //
 // The above description tries to define the high performance (run time)
 // portions of these classes.  After gathering statistics, calls instigated
 // by visiting about:tracking will assemble and aggregate data for display. The
@@ skipping 45 matching lines @@
 class MessageLoop;
 
 namespace tracked_objects {
 
 //------------------------------------------------------------------------------
 // For a specific thread, and a specific birth place, the collection of all
 // death info (with tallies for each death thread, to prevent access conflicts).
 class ThreadData;
 class BASE_EXPORT BirthOnThread {
  public:
-  explicit BirthOnThread(const Location& location);
+  BirthOnThread(const Location& location, const ThreadData& current);
 
   const Location location() const { return location_; }
   const ThreadData* birth_thread() const { return birth_thread_; }
 
  private:
   // File/lineno of birth.  This defines the essence of the task, as the context
   // of the birth (construction) often tell what the item is for.  This field
   // is const, and hence safe to access from any thread.
   const Location location_;
 
   // The thread that records births into this object.  Only this thread is
   // allowed to access birth_count_ (which changes over time).
-  const ThreadData* birth_thread_;  // The thread this birth took place on.
+  const ThreadData* const birth_thread_;
 
   DISALLOW_COPY_AND_ASSIGN(BirthOnThread);
 };
 
 //------------------------------------------------------------------------------
 // A class for accumulating counts of births (without bothering with a map<>).
 
 class BASE_EXPORT Births: public BirthOnThread {
  public:
-  explicit Births(const Location& location);
+  Births(const Location& location, const ThreadData& current);
 
   int birth_count() const { return birth_count_; }
 
   // When we have a birth we update the count for this BirhPLace.
   void RecordBirth() { ++birth_count_; }
 
   // When a birthplace is changed (updated), we need to decrement the counter
   // for the old instance.
   void ForgetBirth() { --birth_count_; }  // We corrected a birth place.
 
@@ skipping 31 matching lines @@
   int count() const { return count_; }
   base::TimeDelta run_duration() const { return run_duration_; }
   int AverageMsRunDuration() const;
   base::TimeDelta queue_duration() const { return queue_duration_; }
   int AverageMsQueueDuration() const;
 
   // Accumulate metrics from other into this.  This method is never used on
   // realtime statistics, and only used in snapshots and aggregatinos.
   void AddDeathData(const DeathData& other);
 
-  // Simple print of internal state.
-  void Write(std::string* output) const;
+  // Simple print of internal state for use in line of HTML.
+  void WriteHTML(std::string* output) const;
+
+  // Constructe a DictionaryValue instance containing all our stats. The caller
+  // assumes ownership of the returned instance.
+  base::DictionaryValue* ToValue() const;
 
   // Reset all tallies to zero. This is used as a hack on realtime data.
   void Clear();
 
  private:
   int count_;                       // Number of destructions.
   base::TimeDelta run_duration_;    // Sum of all Run()time durations.
   base::TimeDelta queue_duration_;  // Sum of all queue time durations.
 };
 
@@ skipping 25 matching lines @@
   int AverageMsRunDuration() const {
     return death_data_.AverageMsRunDuration();
   }
   base::TimeDelta queue_duration() const {
     return death_data_.queue_duration();
   }
   int AverageMsQueueDuration() const {
     return death_data_.AverageMsQueueDuration();
   }
 
-  void Write(std::string* output) const;
+  // Emit contents for use in a line of HTML
+  void WriteHTML(std::string* output) const;
+
+  // Construct a DictionaryValue instance containing all our data recursively.
+  // The caller assumes ownership of the memory in the returned instance.
+  base::DictionaryValue* ToValue() const;
 
   void Add(const Snapshot& other);
 
  private:
   const BirthOnThread* birth_;  // Includes Location and birth_thread.
   const ThreadData* death_thread_;
   DeathData death_data_;
 };
 
 //------------------------------------------------------------------------------
@@ skipping 15 matching lines @@
   void Append(const ThreadData& thread_data);
 
   // After the accumulation phase, the following accessor is used to process the
   // data.
   Collection* collection();
 
   // After collection of death data is complete, we can add entries for all the
   // remaining living objects.
   void AddListOfLivingObjects();
 
+  // Generate a ListValue representation of the vector of snapshots.  The caller
+  // assumes ownership of the memory in the returned instance.
+  base::ListValue* ToValue() const;
+
  private:
   typedef std::map<const BirthOnThread*, int> BirthCount;
 
   // The array that we collect data into.
   Collection collection_;
 
   // The total number of births recorded at each location for which we have not
   // seen a death count.
   BirthCount global_birth_count_;
 
   DISALLOW_COPY_AND_ASSIGN(DataCollector);
 };
 
 //------------------------------------------------------------------------------
 // Aggregation contains summaries (totals and subtotals) of groups of Snapshot
 // instances to provide printing of these collections on a single line.
 
 class BASE_EXPORT Aggregation: public DeathData {
  public:
   Aggregation();
   ~Aggregation();
 
   void AddDeathSnapshot(const Snapshot& snapshot);
   void AddBirths(const Births& births);
   void AddBirth(const BirthOnThread& birth);
   void AddBirthPlace(const Location& location);
-  void Write(std::string* output) const;
+  void WriteHTML(std::string* output) const;
   void Clear();
 
  private:
   int birth_count_;
   std::map<std::string, int> birth_files_;
   std::map<Location, int> locations_;
   std::map<const ThreadData*, int> birth_threads_;
   DeathData death_data_;
   std::map<const ThreadData*, int> death_threads_;
 
@@ skipping 73 matching lines @@
 
   // Parse a query to decide on sort ordering.
   bool ParseQuery(const std::string& query);
 
   // Output a header line that can be used to indicated what items will be
   // collected in the group.  It lists all (potentially) tested attributes and
   // their values (in the sample item).
   bool WriteSortGrouping(const Snapshot& sample, std::string* output) const;
 
   // Output a sample, with SortGroup details not displayed.
-  void WriteSnapshot(const Snapshot& sample, std::string* output) const;
+  void WriteSnapshotHTML(const Snapshot& sample, std::string* output) const;
 
  private:
   // The selector directs this instance to compare based on the specified
   // members of the tested elements.
   enum Selector selector_;
 
   // For filtering into acceptable and unacceptable snapshot instance, the
   // following is required to be a substring of the selector_ field.
   std::string required_;
 
@@ skipping 24 matching lines @@
 
   // Initialize the current thread context with a new instance of ThreadData.
   // This is used by all threads that have names, and can be explicitly
   // set *before* any births are threads have taken place.  It is generally
   // only used by the message loop, which has a well defined name.
   static void InitializeThreadContext(const std::string& suggested_name);
 
   // Using Thread Local Store, find the current instance for collecting data.
   // If an instance does not exist, construct one (and remember it for use on
   // this thread.
-  // If shutdown has already started, and we don't yet have an instance, then
-  // return null.
+  // This may return NULL if the system is disabled for any reason.
   static ThreadData* Get();
 
   // For a given (unescaped) about:tracking query, develop resulting HTML, and
   // append to output.
   static void WriteHTML(const std::string& query, std::string* output);
 
+  // Constructe a ListValue instance containing all recursive results in our
+  // process.  The caller assumes ownership of the memory in the returned
+  // instance.  The |process_type| should become an enum, which corresponds
+  // to all possible process types.  I'm using an int as a placeholder.
+  static base::Value* ToValue(int process_type);
+
   // For a given accumulated array of results, use the comparator to sort and
   // subtotal, writing the results to the output.
   static void WriteHTMLTotalAndSubtotals(
       const DataCollector::Collection& match_array,
       const Comparator& comparator, std::string* output);
 
-  // In this thread's data, record a new birth.
-  Births* TallyABirth(const Location& location);
-
-  // Find a place to record a death on this thread.
-  void TallyADeath(const Births& the_birth,
-                   const base::TimeDelta& queue_duration,
-                   const base::TimeDelta& duration);
-
-  // Helper methods to only tally if the current thread has tracking active.
-  //
+  // Find (or create) a place to count births from the given location in this
+  // thread, and increment that tally.
   // TallyABirthIfActive will returns NULL if the birth cannot be tallied.
   static Births* TallyABirthIfActive(const Location& location);
 
-  // Record the end of a timed run of an object.  The |the_birth| is the record
-  // for the instance, the |time_posted| and |start_of_run| are times of posting
+  // Record the end of a timed run of an object.  The |birth| is the record for
+  // the instance, the |time_posted| and |start_of_run| are times of posting
   // into a message loop queue, and of starting to perform the run of the task.
-  // Implied is that the run just (Now()) ended.  The current_message_loop is
-  // optional, and only used in DEBUG mode (when supplied) to verify that the
-  // ThreadData has a thread name that does indeed match the given loop's
-  // associated thread name (in RELEASE mode, its use is compiled away).
-  static void TallyADeathIfActive(const Births* the_birth,
+  // The |end_of_run| is was just obtained by a call to Now() (just after the

[ramant (doing other things), 2011/10/24 18:03:49]

nit: "is was" -> should we say was?

[jar (doing other things), 2011/10/24 18:43:27]

Done.

+  // task finished).
+  static void TallyADeathIfActive(const Births* birth,
                                   const base::TimeTicks& time_posted,
                                   const base::TimeTicks& delayed_start_time,
-                                  const base::TimeTicks& start_of_run);
-
-  // (Thread safe) Get start of list of instances.
-  static ThreadData* first();
-  // Iterate through the null terminated list of instances.
-  ThreadData* next() const { return next_; }
+                                  const base::TimeTicks& start_of_run,
+                                  const base::TimeTicks& end_of_run);
 
   const std::string thread_name() const { return thread_name_; }
 
+  // ---------------------
+  // The following functions should all be private, and are only public because
+  // the collection is done externally.  We need to relocate that code from the
+  // collection class into this class, and then all these methods can be made
+  // private.
+  // (Thread safe) Get start of list of all ThreadData instances.
+  static ThreadData* first();
+  // Iterate through the null terminated list of ThreadData instances.
+  ThreadData* next() const { return next_; }
   // Using our lock, make a copy of the specified maps.  These calls may arrive
   // from non-local threads, and are used to quickly scan data from all threads
   // in order to build an HTML page for about:tracking.
   void SnapshotBirthMap(BirthMap *output) const;
   void SnapshotDeathMap(DeathMap *output) const;
+  // -------- end of should be private methods.
 
   // Hack: asynchronously clear all birth counts and death tallies data values
   // in all ThreadData instances.  The numerical (zeroing) part is done without
   // use of a locks or atomics exchanges, and may (for int64 values) produce
   // bogus counts VERY rarely.
   static void ResetAllThreadData();
 
-  // Using our lock to protect the iteration, Clear all birth and death data.
-  void Reset();
-
   // Set internal status_ to either become ACTIVE, or later, to be SHUTDOWN,
   // based on argument being true or false respectively.
   // IF tracking is not compiled in, this function will return false.
   static bool StartTracking(bool status);
   static bool IsActive();
 
   // Provide a time function that does nothing (runs fast) when we don't have
   // the profiler enabled.  It will generally be optimized away when it is
   // ifdef'ed to be small enough (allowing the profiler to be "compiled out" of
   // the code).
   static base::TimeTicks Now();
 
   // WARNING: ONLY call this function when you are running single threaded
   // (again) and all message loops and threads have terminated.  Until that
   // point some threads may still attempt to write into our data structures.
   // Delete recursively all data structures, starting with the list of
   // ThreadData instances.
   static void ShutdownSingleThreadedCleanup();
 
  private:
-  // Worker thread construction creates a name.
-  ThreadData();
-  // Message loop based construction should provide a name.
-  explicit ThreadData(const std::string& suggested_name);
-
-  ~ThreadData();
-
-  // Enter a new instance into Thread Local Store.
-  // Return the instance, or null if we can't register it (because we're
-  // shutting down).
-  static ThreadData* RegisterCurrentContext(ThreadData* unregistered);
-
   // Current allowable states of the tracking system.  The states always
   // proceed towards SHUTDOWN, and never go backwards.
   enum Status {
     UNINITIALIZED,
     ACTIVE,
     SHUTDOWN,
   };
 
+  typedef std::stack<const ThreadData*> ThreadDataPool;
+
+  // Worker thread construction creates a name since there is none.
+  ThreadData();
+  // Message loop based construction should provide a name.
+  explicit ThreadData(const std::string& suggested_name);
+
+  ~ThreadData();
+
+  // Push this instance to the head of all_thread_data_list_head_, linking it to
+  // the previous head.  This is performed after each construction, and leaves
+  // the instance permanently on that list.
+  void PushToHeadOfList();
+
+  // In this thread's data, record a new birth.
+  Births* TallyABirth(const Location& location);
+
+  // Find a place to record a death on this thread.
+  void TallyADeath(const Births& birth,
+                   const base::TimeDelta& queue_duration,
+                   const base::TimeDelta& duration);
+
+  // Using our lock to protect the iteration, Clear all birth and death data.
+  void Reset();
+
+  // This method is called by the TLS system when a thread terminates.
+  // The argument may be NULL if this thread has never tracked a birth or death.
+  static void OnThreadTermination(void* thread_data);
+
+  // This method should be called when a worker thread terminates, so that we
+  // can save all the thread data into a cache of reusable ThreadData instances.
+  void OnThreadTerminationCleanup() const;
+
   // We use thread local store to identify which ThreadData to interact with.
   static base::ThreadLocalStorage::Slot tls_index_;
 
   // Link to the most recently created instance (starts a null terminated list).
-  static ThreadData* first_;
-  // Protection for access to first_.
+  // The list is traversed by about:tracking when it needs to snapshot data.
+  static ThreadData* all_thread_data_list_head_;
+  // Set of ThreadData instances for use with worker threads. When a worker
+  // thread is done (terminating), we push it into this pool.  When a new worker
+  // thread is created, we first try to re-use a ThreadData instance from the
+  // pool, and if none are available, construct a new one.
+  static ThreadDataPool* unregistered_thread_data_pool_;
+  // Protection for access to all_thread_data_list_head_, and to
+  // unregistered_thread_data_pool_.
   static base::Lock list_lock_;
 
   // We set status_ to SHUTDOWN when we shut down the tracking service.
   static Status status_;
 
   // Link to next instance (null terminated list). Used to globally track all
   // registered instances (corresponds to all registered threads where we keep
   // data).
   ThreadData* next_;
 
   // The name of the thread that is being recorded.  If this thread has no
   // message_loop, then this is a worker thread, with a sequence number postfix.
   std::string thread_name_;
 
+  // Indicate if this is a worker thread, and the ThreadData contexts should be
+  // stored in the unregistered_thread_data_pool_ when not in use.
+  bool is_a_worker_thread_;
+
   // A map used on each thread to keep track of Births on this thread.
   // This map should only be accessed on the thread it was constructed on.
   // When a snapshot is needed, this structure can be locked in place for the
   // duration of the snapshotting activity.
   BirthMap birth_map_;
 
   // Similar to birth_map_, this records informations about death of tracked
   // instances (i.e., when a tracked instance was destroyed on this thread).
   // It is locked before changing, and hence other threads may access it by
   // locking before reading it.
   DeathMap death_map_;
 
   // Lock to protect *some* access to BirthMap and DeathMap.  The maps are
   // regularly read and written on this thread, but may only be read from other
   // threads.  To support this, we acquire this lock if we are writing from this
   // thread, or reading from another thread.  For reading from this thread we
   // don't need a lock, as there is no potential for a conflict since the
   // writing is only done from this thread.
   mutable base::Lock lock_;
 
   // The next available thread number.  This should only be accessed when the
   // list_lock_ is held.
   static int thread_number_counter;
 
   DISALLOW_COPY_AND_ASSIGN(ThreadData);
 };
 
 //------------------------------------------------------------------------------
 // Provide simple way to to start global tracking, and to tear down tracking
-// when done.  Note that construction and destruction of this object must be
-// done when running in  threaded mode (before spawning a lot of threads
-// for construction, and after shutting down all the threads for destruction).
-
-// To prevent grabbing thread local store resources time and again if someone
-// chooses to try to re-run the browser many times, we maintain global state and
-// only allow the tracking system to be started up at most once, and shutdown
-// at most once.  See bug 31344 for an example.
+// when done.  The design has evolved to *not* do any teardown (and just leak
+// all ollocated data structures).  As a result, we don't have any code in this

[ramant (doing other things), 2011/10/24 18:03:49]

nit: allocated

[jar (doing other things), 2011/10/24 18:43:27]

Done.

+// destructor, and perhaps this whole class should go away.
 
 class BASE_EXPORT AutoTracking {
  public:
   AutoTracking() {
     if (state_ != kNeverBeenRun)
       return;
     ThreadData::StartTracking(true);
     state_ = kRunning;
   }
 
   ~AutoTracking() {
-#ifndef NDEBUG
-    if (state_ != kRunning)
-      return;
-    // We don't do cleanup of any sort in Release build because it is a
-    // complete waste of time.  Since Chromium doesn't join all its thread and
-    // guarantee we're in a single threaded mode, we don't even do cleanup in
-    // debug mode, as it will generate race-checker warnings.
-#endif
   }
 
  private:
   enum State {
     kNeverBeenRun,
     kRunning,
-    kTornDownAndStopped,
   };
   static State state_;
 
   DISALLOW_COPY_AND_ASSIGN(AutoTracking);
 };
 
-
 }  // namespace tracked_objects
 
 #endif  // BASE_TRACKED_OBJECTS_H_