/external/chromium-trace/trace-viewer/src/tracing/trace_model/ |
slice_group_test.js | 38 assertEquals(2, group.slices.length); 39 assertEquals('b', group.slices[0].title); 40 assertEquals(0.5, group.slices[0].duration); 42 assertEquals('a', group.slices[1].title); 43 assertEquals(2, group.slices[1].duration); 55 assertEquals(2, m.slices.length); 57 assertEquals('one', m.slices[0].title); 58 assertEquals(1, m.slices[0].start); 59 assertEquals(1, m.slices[0].duration); 61 assertEquals('two', m.slices[1].title) [all...] |
async_slice_group.js | 19 this.slices = []; 27 * Helper function that pushes the provided slice onto the slices array. 30 this.slices.push(slice); 34 * @return {Number} The number of slices in this group. 37 return this.slices.length; 45 for (var sI = 0; sI < this.slices.length; sI++) { 46 var slice = this.slices[sI]; 54 * Updates the bounds for this group based on the slices it contains. 58 for (var i = 0; i < this.slices.length; i++) { 59 this.bounds.addValue(this.slices[i].start) [all...] |
cpu.js | 23 this.slices = []; 49 for (var sI = 0; sI < this.slices.length; sI++) 50 this.slices[sI].start = (this.slices[sI].start + amount); 56 * Updates the range based on the current slices attached to the cpu. 60 if (this.slices.length) { 61 this.bounds.addValue(this.slices[0].start); 62 this.bounds.addValue(this.slices[this.slices.length - 1].end); 71 for (var i = 0; i < this.slices.length; i++ [all...] |
slice_group.js | 19 * A group of Slices, plus code to create them from B/E events, as 22 * Do not mutate the slices array directly. Modify it only by 27 * opt_sliceConstructor The constructor to use when creating slices. 35 this.slices = []; 43 * @return {Number} The number of slices in this group. 46 return this.slices.length; 50 * Helper function that pushes the provided slice onto the slices array. 51 * @param {Slice} slice The slice to be added to the slices array. 54 this.slices.push(slice); 59 * Helper function that pushes the provided slice onto the slices array [all...] |
cpu_test.js | 22 cpu.slices.push(tracing.test_utils.newSlice(1, 3)); 38 cpu.slices.push(tracing.test_utils.newSlice(1, 3)); 44 cpu.slices.push(tracing.test_utils.newSlice(1, 3)); 47 assertEquals(1.32, cpu.slices[0].start);
|
/external/chromium-trace/trace-viewer/src/tracing/importer/linux_perf/ |
cpufreq_parser_test.js | 26 assertEquals(0, thread.sliceGroup.slices[0].args['cpu']); 27 assertEquals(2, thread.sliceGroup.slices[0].args['load']); 28 assertEquals(2000000, thread.sliceGroup.slices[0].args['cur']); 29 assertEquals(300000, thread.sliceGroup.slices[0].args['targ']); 31 assertEquals(0, thread.sliceGroup.slices[1].args['cpu']); 32 assertEquals(12, thread.sliceGroup.slices[1].args['load']); 33 assertEquals(1000000, thread.sliceGroup.slices[1].args['cur']); 34 assertEquals(1000000, thread.sliceGroup.slices[1].args['actual']); 35 assertEquals(200000, thread.sliceGroup.slices[1].args['targ']); 52 assertEquals(1, thread.sliceGroup.slices[0].args['cpu']) [all...] |
kfunc_parser_test.js | 34 var slices = thread.sliceGroup.slices; 38 assertEquals('sys_write', slices[0].title); 40 // Slices 1 & 2 are a split sys_write 41 assertEquals('sys_write', slices[1].title); 42 assertEquals('sys_write (cont.)', slices[2].title); 44 // Slices 3 & 5 are a split sys_write with the dequeueBuffer in between 45 assertEquals('sys_write', slices[3].title); 46 assertEquals('dequeueBuffer', slices[4].title); 47 assertEquals('sys_write (cont.)', slices[5].title) [all...] |
kfunc_parser.js | 59 var slices = thread.kernelSliceGroup; 60 if (!slices.isTimestampValidForBeginOrEnd(ts)) { 65 var slice = slices.beginSlice(null, name, ts, {}); 81 var slices = thread.kernelSliceGroup; 82 if (!slices.isTimestampValidForBeginOrEnd(ts)) { 87 if (slices.openSliceCount > 0) { 88 slices.endSlice(ts);
|
power_parser_test.js | 24 assertEquals(0, c0.slices.length); 28 assertEquals(0, c1.slices.length); 47 assertEquals(0, c0.slices.length); 51 assertEquals(0, c1.slices.length); 74 assertEquals(0, c0.slices.length); 78 assertEquals(0, c1.slices.length);
|
/external/chromium-trace/trace-viewer/src/tracing/analysis/ |
analyze_slices.css | 6 .analysis-slices-table-col-1, 7 .analysis-slices-table-col-2 {
|
/external/chromium_org/third_party/smhasher/src/ |
Bitslice.cpp | 54 void Bitslice ( std::vector<hashtype> & hashes, slice_vec & slices ) 60 slices.clear(); 61 slices.resize(hashbits); 63 for(int i = 0; i < (int)slices.size(); i++) 65 slices[i].resize(slicelen,0); 70 void * sliceblob = &(slices[j][0]); 81 void FactorSlices ( slice_vec & slices ) 83 std::vector<int> counts(slices.size(),0); 85 for(size_t i = 0; i < slices.size(); i++) 87 counts[i] = countbits(slices[i]) [all...] |
/external/chromium-trace/trace-viewer/src/tracing/tracks/ |
slice_group_track.js | 65 addSliceTrack_: function(slices) { 67 track.slices = slices; 76 return sliceTrack.slices; 90 var slices = tracing.filterSliceArray(this.categoryFilter, 91 this.group_.slices); 92 if (this.areArrayContentsSame_(this.filteredSlices_, slices)) { 97 this.filteredSlices_ = slices; 100 if (!slices.length) 102 var subRows = this.buildSubRows_(slices); [all...] |
async_slice_group_track.js | 30 addSliceTrack_: function(slices) { 33 this, slices); 39 * Breaks up the list of slices into N rows, each of which is a list of 40 * slices that are non overlapping. 42 * It uses a very simple approach: walk through the slices in sorted order 47 var slices = tracing.filterSliceArray(this.categoryFilter, 48 this.group_.slices); 49 slices.sort(function(x, y) { 54 for (var i = 0; i < slices.length; i++) { 55 var slice = slices[i] [all...] |
async_slice_group_track_test.js | 50 assertEquals(g.slices[0].subSlices[0], subRows[0][0]); 51 assertEquals(g.slices[1].subSlices[0], subRows[0][1]); 71 assertEquals(g.slices[0].subSlices[0], subRows[0][0]); 74 assertEquals(g.slices[1].subSlices[0], subRows[1][0]); 92 assertEquals(g.slices[0].subSlices[0], subRows[0][0]); 93 assertEquals(g.slices[2].subSlices[0], subRows[0][1]); 96 assertEquals(g.slices[1].subSlices[0], subRows[1][0]); 116 assertEquals(g.slices[0].subSlices[0], subRows[0][0]); 117 assertEquals(g.slices[2].subSlices[0], subRows[0][1]); 119 assertEquals(g.slices[1].subSlices[0], subRows[1][0]) [all...] |
cpu_track.js | 55 var slices = tracing.filterSliceArray(this.categoryFilter_, 56 this.cpu_.slices); 57 if (slices.length) { 59 track.slices = slices;
|
slice_track_test.js | 31 track.slices = [ 55 var slices = []; 59 slices.push(s); 61 track.slices = slices; 90 track.slices = [ 103 track.slices = [ 114 assertEquals(track.slices[1], selection[0].slice); 115 assertEquals(track.slices[2], selection[1].slice); 133 track.slices = [all...] |
/external/chromium-trace/trace-viewer/src/tracing/ |
selection_test.js | 24 sel.addSlice({}, t1.sliceGroup.slices[0]); 28 assertEquals(t1.sliceGroup.slices[0], sel[0].slice); 30 sel.addSlice({}, t1.sliceGroup.slices[1]); 33 assertEquals(t1.sliceGroup.slices[1], sel[1].slice); 49 track.slices = t1.sliceGroup.slices; 52 sel.addSlice(track, t1.sliceGroup.slices[0]); 56 assertEquals(t1.sliceGroup.slices[1], shifted[0].slice);
|
test_utils.js | 63 function findSliceNamed(slices, name) { 64 if (slices instanceof tracing.trace_model.SliceGroup) 65 slices = slices.slices; 66 for (var i = 0; i < slices.length; i++) 67 if (slices[i].title == name) 68 return slices[i];
|
filter.js | 9 function filterSliceArray(filter, slices) { 11 return slices; 14 for (var i = 0; i < slices.length; ++i) { 15 if (filter.matchSlice(slices[i])) 16 matched.push(slices[i]);
|
/external/chromium_org/v8/test/intl/break-iterator/ |
en-break.js | 35 var slices = []; variable 42 slices.push(textToSegment.slice(pos, nextPos)); 48 assertEquals('Jack', slices[0]); 49 assertEquals(' ', slices[1]); 50 assertEquals('and', slices[2]); 51 assertEquals(' ', slices[3]); 52 assertEquals('Jill', slices[4]); 53 assertEquals(',', slices[5]); 54 assertEquals('!', slices[slices.length - 1]) [all...] |
zh-break.js | 36 var slices = []; variable 43 slices.push(textToSegment.slice(pos, nextPos)); 49 assertEquals('\u56FD\u52A1\u9662', slices[0]); 50 assertEquals('\u5173\u4E8E', slices[1]); 51 assertEquals('\u300A', slices[2]); 52 assertEquals('\u571F\u5730', slices[3]); 53 assertEquals('\u623F\u5C4B', slices[4]); 54 assertEquals('\u7BA1\u7406', slices[5]); 55 assertEquals('\u6761\u4F8B', slices[6]); 56 assertEquals('\u300B', slices[7]) [all...] |
/external/chromium_org/third_party/WebKit/Source/core/css/ |
CSSBorderImageSliceValue.h | 37 static PassRefPtrWillBeRawPtr<CSSBorderImageSliceValue> create(PassRefPtrWillBeRawPtr<CSSPrimitiveValue> slices, bool fill) 39 return adoptRefWillBeNoop(new CSSBorderImageSliceValue(slices, fill)); 44 Quad* slices() { return m_slices ? m_slices->getQuadValue() : 0; } function in class:blink::CSSBorderImageSliceValue 56 CSSBorderImageSliceValue(PassRefPtrWillBeRawPtr<CSSPrimitiveValue> slices, bool fill);
|
CSSBorderImageSliceValue.cpp | 33 CSSBorderImageSliceValue::CSSBorderImageSliceValue(PassRefPtrWillBeRawPtr<CSSPrimitiveValue> slices, bool fill) 35 , m_slices(slices) 42 // Dump the slices first.
|
/external/chromium_org/tools/telemetry/telemetry/web_perf/metrics/ |
mainthread_jank_stats.py | 31 slices whose thread time ranges overlapped with (thread_start, thread_end) 36 top slices whose thread time ranges overlapped with 39 Note: thread duration of each slices is computed using overlapped range 59 slices whose thread time ranges overlapped with any thread time ranges of 64 top slices whose thread time ranges overlapped with any of records' thread
|
/external/chromium_org/third_party/WebKit/Source/core/css/resolver/ |
CSSToStyleMap.cpp | 464 // Map in the image slices. 468 // Map in the border slices. 476 // Set the appropriate rules for stretch/round/repeat of the slices. 482 // We have to preserve the legacy behavior of -webkit-border-image and make the border slices 504 // Set up a length box to represent our image slices. 506 Quad* slices = borderImageSlice->slices(); local 507 if (slices->top()->isPercentage()) 508 box.m_top = Length(slices->top()->getDoubleValue(), Percent); 510 box.m_top = Length(slices->top()->getIntValue(CSSPrimitiveValue::CSS_NUMBER), Fixed) [all...] |