about:gpu support for thread name metadata.

chrome/browser/resources/gpu_internals/timeline_model.js

 // 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.
 
 
 /**
  * @fileoverview TimelineModel is a parsed representation of the
  * TraceEvents obtained from base/trace_event in which the begin-end
  * tokens are converted into a hierarchy of processes, threads,
  * subrows, and slices.
@@ skipping 47 matching lines @@
    * @constructor
    */
   function TimelineThread(parent, tid) {
     this.parent = parent;
     this.tid = tid;
     this.subRows = [[]];
     this.nonNestedSubRows = [];
   }
 
   TimelineThread.prototype = {
+    /**
+     * Name of the thread, if present.
+     */
+    name: undefined,

[James Hawkins, 2011/08/01 18:28:49]

Is this intended to be private?

[nduca, 2011/08/01 20:52:22]

Nope, its public. Should I be exposing this via a getter?

[James Hawkins, 2011/08/01 21:01:24]

Hmm, likely though I won't ask you to do that. It's somewhat difficult to get
protected/private access right in JS.  I'd just leave it as is.

+
     getSubrow: function(i) {
       while (i >= this.subRows.length)
         this.subRows.push([]);
       return this.subRows[i];
     },
 
     addNonNestedSlice: function(slice) {
       for (var i = 0; i < this.nonNestedSubRows.length; i++) {
         var currSubRow = this.nonNestedSubRows[i];
         var lastSlice = currSubRow[currSubRow.length - 1];
         if (slice.start >= lastSlice.start + lastSlice.duration) {
           currSubRow.push(slice);
           return;
         }
       }
       this.nonNestedSubRows.push([slice]);
     },
 
     updateBounds: function() {

[James Hawkins, 2011/08/01 18:28:49]

Document this method.

[nduca, 2011/08/01 20:52:22]

Done.

-      var slices = this.subRows[0];
-      if (slices.length != 0) {
-        this.minTimestamp = slices[0].start;
-        this.maxTimestamp = slices[slices.length - 1].end;
+      var values = [];
+      var slices;
+      if (this.subRows[0].length != 0) {
+        slices = this.subRows[0];
+        values.push(slices[0].start);
+        values.push(slices[slices.length - 1].end);
+      }
+      for (var i = 0; i < this.nonNestedSubRows.length; ++i) {
+        slices = this.nonNestedSubRows[i];
+        values.push(slices[0].start);
+        values.push(slices[slices.length - 1].end);
+      }
+      if (values.length) {
+        this.minTimestamp = Math.min.apply(Math, values);
+        this.maxTimestamp = Math.max.apply(Math, values);
       } else {
         this.minTimestamp = undefined;
         this.maxTimestamp = undefined;
       }
     }
 
   };
+  /**

[James Hawkins, 2011/08/01 18:28:49]

Add blank line between methods.

[nduca, 2011/08/01 20:52:22]

Done.

+   * Comparison between threads that orders first by pid,
+   * then by names, then by tid.
+   */
+  TimelineThread.compare = function(x,y) {
+    if(x.parent.pid == y.parent.pid) {

[James Hawkins, 2011/08/01 18:28:49]

You could save a lot of indentation by reversing this logic and returning early
(from the else block below).

[James Hawkins, 2011/08/01 18:28:49]

Space after if.

[nduca, 2011/08/01 20:52:22]

Done.

+      if (x.name && y.name) {
+        var tmp = x.name.localeCompare(y.name);
+        if (tmp == 0)
+          return x.tid - y.tid;
+        return tmp;
+      } else if(x.name) {
+        return -1;
+      } else if(y.name){
+        return 1;
+      } else {
+        return x.tid - y.tid;
+      }
+    } else {
+      return x.parent.pid - y.parent.pid;
+    }
+  };
+
 
   /**
    * The TimelineProcess represents a single process in the
    * trace. Right now, we keep this around purely for bookkeeping
    * reasons.
    * @constructor
    */
   function TimelineProcess(pid) {
     this.pid = pid;
     this.threads = {};
   };
 
   TimelineProcess.prototype = {
     getThread: function(tid) {
       if (!this.threads[tid])
         this.threads[tid] = new TimelineThread(this, tid);
       return this.threads[tid];
     }
   };
 
   /**
    * Builds a model from an array of TraceEvent objects.
    * @param {Array} events An array of TraceEvents created by
    *     TraceEvent.ToJSON().
    * @constructor
    */
   function TimelineModel(events) {
     this.processes = {};
+    this.importErrors = [];
 
     if (events)
       this.importEvents(events);
   }
 
   TimelineModel.prototype = {
     __proto__: cr.EventTarget.prototype,
 
     getProcess: function(pid) {
       if (!this.processes[pid])
         this.processes[pid] = new TimelineProcess(pid);
       return this.processes[pid];
     },
 
     /**
      * The import takes an array of json-ified TraceEvents and adds them into
      * the TimelineModel as processes, threads, and slices.
      */
     importEvents: function(events) {
       // A ptid is a pid and tid joined together x:y fashion, eg 1024:130
       // The ptid is a unique key for a thread in the trace.
-
+      this.importErrors = [];
 
       // Threadstate
       const numColorIds = 30;
       function ThreadState(tid) {
         this.openSlices = [];
         this.openNonNestedSlices = {};
       }
       var threadStateByPTID = {};
 
       var nameToColorMap = {};
@@ skipping 23 matching lines @@
           var slice =
               { index: eI,
                 slice: new TimelineSlice(event.name, colorId, event.ts,
                                          event.args) };
           if (event.args['ui-nest'] === '0') {
             var sliceID = event.name;
             for (var x in event.args) {
               sliceID += ';' + event.args[x];
             }
             if (state.openNonNestedSlices[sliceID])
-              console.log('Event ' + sliceID + ' already open.');
+              this.importErrors.push('Event ' + sliceID + ' already open.');
             state.openNonNestedSlices[sliceID] = slice;
           } else
             state.openSlices.push(slice);
         } else if (event.ph == 'E') {
           if (event.args['ui-nest'] === '0') {
             var sliceID = event.name;
             for (var x in event.args) {
               sliceID += ';' + event.args[x];
             }
             var slice = state.openNonNestedSlices[sliceID];
@@ skipping 20 matching lines @@
 
             // Add the slice to the subSlices array of its parent.
             if (state.openSlices.length) {
               var parentSlice = state.openSlices[state.openSlices.length - 1];
               parentSlice.slice.subSlices.push(slice);
             }
           }
         } else if (event.ph == 'I') {
           // TODO(nduca): Implement parsing of immediate events.
           console.log('Parsing of I-type events not implemented.');
+        } else if (event.ph == 'M') {
+          if (event.name == 'thread_name') {
+            var thread = this.getProcess(event.pid).getThread(event.tid);
+            thread.name = event.args.name;
+          } else {
+            this.importErrors.push('Unrecognized metadata name: ' + event.name);
+          }
         } else {
-          throw new Error('Unrecognized event phase: ' + event.ph +
+          this.importErrors.push('Unrecognized event phase: ' + event.ph +
                           '(' + event.name + ')');
         }
       }
-
+      this.pruneEmptyThreads();
       this.updateBounds();
 
       // Add end events for any events that are still on the stack. These
       // are events that were still open when trace was ended, and can often
       // indicate deadlock behavior.
       for (var ptid in threadStateByPTID) {
         var state = threadStateByPTID[ptid];
         while (state.openSlices.length > 0) {
           var slice = state.openSlices.pop();
           slice.slice.duration = this.maxTimestamp - slice.slice.start;
@@ skipping 13 matching lines @@
         }
       }
 
       this.shiftWorldToMicroseconds();
 
       var boost = (this.maxTimestamp - this.minTimestamp) * 0.15;
       this.minTimestamp = this.minTimestamp - boost;
       this.maxTimestamp = this.maxTimestamp + boost;
     },
 
+    /**
+     * Removes threads from the model that have no subrows.
+     */
+    pruneEmptyThreads: function() {
+      for (var pid in this.processes) {
+        var process = this.processes[pid];
+        var prunedThreads = [];
+        for (var tid in process.threads) {
+          var thread = process.threads[tid];
+          if (thread.subRows[0].length || thread.nonNestedSubRows.legnth)
+            prunedThreads.push(thread);
+        }
+        process.threads = prunedThreads;
+      }
+    },
+
     updateBounds: function() {
       var wmin = Infinity;
       var wmax = -wmin;
       var threads = this.getAllThreads();
       for (var tI = 0; tI < threads.length; tI++) {
         var thread = threads[tI];
         thread.updateBounds();
-        if (thread.minTimestamp && thread.maxTimestamp) {
+        if (thread.minTimestamp != undefined &&
+            thread.maxTimestamp != undefined) {
           wmin = Math.min(wmin, thread.minTimestamp);
           wmax = Math.max(wmax, thread.maxTimestamp);
         }
       }
       this.minTimestamp = wmin;
       this.maxTimestamp = wmax;
     },
 
     shiftWorldToMicroseconds: function() {
       var timeBase = this.minTimestamp;
@@ skipping 31 matching lines @@
 
   };
 
   return {
     TimelineSlice: TimelineSlice,
     TimelineThread: TimelineThread,
     TimelineProcess: TimelineProcess,
     TimelineModel: TimelineModel
   };
 });