Home
last modified time | relevance | path

Searched full:start (Results 1 – 25 of 10150) sorted by relevance

12345678910>>...406

/external/chromium-trace/catapult/tracing/tracing/importer/
Duser_model_builder_test.html22 {start: event.start, end: event.end, isTopLevel: true});
25 start: event.start,
45 model, INPUT_TYPE.MOUSE_DOWN, {start: 0, end: 10});
47 model, INPUT_TYPE.MOUSE_MOVE, {start: 10, end: 20, id: '0x100'});
51 model, INPUT_TYPE.MOUSE_MOVE, {start: 70, end: 80, id: '0x101'});
55 model, INPUT_TYPE.MOUSE_MOVE, {start: 130, end: 140, id: '0x102'});
59 {title: 'Idle', start: 0, end: 10, eventCount: 0},
60 {title: 'Mouse Response', start: 10, end: 20, eventCount: 4},
61 {title: 'Idle', start: 20, end: 70, eventCount: 0},
62 {title: 'Mouse Response', start: 70, end: 80, eventCount: 3},
[all …]
/external/chromium-trace/catapult/tracing/test_data/
Dv8.log204 timer-event-start,"V8.GCCompactor",1936
430 timer-event-start,"V8.GCCompactor",5042
554 timer-event-start,"V8.GCCompactor",7451
780 timer-event-start,"V8.GCCompactor",10021
1153 timer-event-start,"V8.ParseLazy",323077
1155 timer-event-start,"V8.CompileLazy",323402
1156 timer-event-start,"V8.CompileFullCode",323490
1165 timer-event-start,"V8.ParseLazy",324350
1167 timer-event-start,"V8.CompileLazy",324501
1168 timer-event-start,"V8.CompileFullCode",324521
[all …]
/external/nist-sip/java/gov/nist/javax/sip/parser/
DTokenTypes.java35 public static final int START = LexerCore.START; field
40 public static final int SIP = START + 3;
41 public static final int REGISTER = START + 4;
42 public static final int INVITE = START + 5;
43 public static final int ACK = START + 6;
44 public static final int BYE = START + 7;
45 public static final int OPTIONS = START + 8;
46 public static final int CANCEL = START + 9;
47 public static final int ERROR_INFO = START + 10;
48 public static final int IN_REPLY_TO = START + 11;
[all …]
/external/e2fsprogs/lib/ext2fs/
Dblkmap64_rb.c35 __u64 start; member
61 static int rb_insert_extent(__u64 start, __u64 count,
79 ext->start, ext->start + ext->count); in print_tree()
94 printf("extent: %llu -> %llu (%u)\n", ext->start, in check_tree()
95 ext->start + ext->count, ext->count); in check_tree()
98 if (ext->start < 0) { in check_tree()
99 printf("Tree Error: start is crazy\n"); in check_tree()
100 printf("extent: %llu -> %llu (%u)\n", ext->start, in check_tree()
101 ext->start + ext->count, ext->count); in check_tree()
106 if (old->start > ext->start) { in check_tree()
[all …]
Dgen_bitmap.c33 __u32 start, end; member
77 __u32 start, __u32 end, __u32 real_end, in ext2fs_make_generic_bitmap() argument
92 bitmap->start = start; in ext2fs_make_generic_bitmap()
115 size = (size_t) (((bitmap->real_end - bitmap->start) / 8) + 1); in ext2fs_make_generic_bitmap()
133 errcode_t ext2fs_allocate_generic_bitmap(__u32 start, in ext2fs_allocate_generic_bitmap() argument
140 start, end, real_end, descr, 0, ret); in ext2fs_allocate_generic_bitmap()
147 src->start, src->end, in ext2fs_copy_generic_bitmap()
185 if ((bitno < bitmap->start) || (bitno > bitmap->end)) { in ext2fs_test_generic_bitmap()
189 return ext2fs_test_bit(bitno - bitmap->start, bitmap->bitmap); in ext2fs_test_generic_bitmap()
207 if ((bitno < bitmap->start) || (bitno > bitmap->end)) { in ext2fs_mark_generic_bitmap()
[all …]
/external/v8/test/cctest/
Dtest-fixed-dtoa.cc49 CHECK_EQ(0, strcmp("1", buffer.start())); in TEST()
53 CHECK_EQ(0, strcmp("1", buffer.start())); in TEST()
57 CHECK_EQ(0, strcmp("1", buffer.start())); in TEST()
61 CHECK_EQ(0, strcmp("4294967295", buffer.start())); in TEST()
65 CHECK_EQ(0, strcmp("4294967296", buffer.start())); in TEST()
69 CHECK_EQ(0, strcmp("1", buffer.start())); in TEST()
74 CHECK_EQ(0, strcmp("999999999999999868928", buffer.start())); in TEST()
79 CHECK_EQ(0, strcmp("6999999999999998951424", buffer.start())); in TEST()
83 CHECK_EQ(0, strcmp("15", buffer.start())); in TEST()
87 CHECK_EQ(0, strcmp("155", buffer.start())); in TEST()
[all …]
/external/v8/test/unittests/compiler/
Dschedule-unittest.cc88 EXPECT_NE(nullptr, schedule.start()); in TEST_F()
89 EXPECT_EQ(schedule.start(), in TEST_F()
93 EXPECT_NE(schedule.start(), schedule.end()); in TEST_F()
99 BasicBlock* start = schedule.start(); in TEST_F() local
103 schedule.AddNode(start, node0); in TEST_F()
104 EXPECT_EQ(start, schedule.block(node0)); in TEST_F()
105 EXPECT_THAT(*start, ElementsAre(node0)); in TEST_F()
109 schedule.AddNode(start, node1); in TEST_F()
110 EXPECT_EQ(start, schedule.block(node1)); in TEST_F()
111 EXPECT_THAT(*start, ElementsAre(node0, node1)); in TEST_F()
[all …]
Dscheduler-unittest.cc157 EXPECT_EQ(schedule.start(), order->at(0)); in TEST_F()
164 schedule.AddGoto(schedule.start(), schedule.end()); in TEST_F()
167 EXPECT_EQ(schedule.start(), order->at(0)); in TEST_F()
176 BasicBlock* last = schedule.start(); in TEST_F()
198 schedule.AddSuccessorForTesting(schedule.start(), schedule.start()); in TEST_F()
201 BasicBlock* loop[] = {schedule.start()}; in TEST_F()
209 schedule.AddSuccessorForTesting(schedule.start(), body); in TEST_F()
210 schedule.AddSuccessorForTesting(body, schedule.start()); in TEST_F()
213 BasicBlock* loop[] = {schedule.start(), body}; in TEST_F()
221 schedule.AddSuccessorForTesting(schedule.start(), loop1->header()); in TEST_F()
[all …]
Dcontrol-equivalence-unittest.cc26 Store(graph()->start()); in ControlEquivalenceTest()
107 Node* start = graph()->start(); in TEST_F() local
108 ComputeEquivalence(start); in TEST_F()
110 ASSERT_EQUIVALENCE(start); in TEST_F()
115 Node* start = graph()->start(); in TEST_F() local
116 Node* merge1 = Merge1(start); in TEST_F()
119 ASSERT_EQUIVALENCE(start, merge1); in TEST_F()
124 Node* start = graph()->start(); in TEST_F() local
125 Node* b = Branch(start); in TEST_F()
131 ASSERT_EQUIVALENCE(b, m, start); in TEST_F()
[all …]
/external/icu/icu4c/source/test/cintltst/
Dtrietest.c39 UChar32 start, limit; member
56 _testFoldedValue32(UNewTrie *trie, UChar32 start, int32_t offset) { in _testFoldedValue32() argument
63 limit=start+0x400; in _testFoldedValue32()
64 while(start<limit) { in _testFoldedValue32()
65 value=utrie_get32(trie, start, &inBlockZero); in _testFoldedValue32()
67 start+=UTRIE_DATA_BLOCK_LENGTH; in _testFoldedValue32()
70 ++start; in _testFoldedValue32()
87 _testFoldedValue16(UNewTrie *trie, UChar32 start, int32_t offset) { in _testFoldedValue16() argument
94 limit=start+0x400; in _testFoldedValue16()
95 while(start<limit) { in _testFoldedValue16()
[all …]
/external/icu/icu4c/source/test/intltest/
Dbidiconf.cpp42 UBool parseLevels(const char *&start);
43 UBool parseOrdering(const char *start);
44 UBool parseInputStringFromBiDiClasses(const char *&start);
80 UBool BiDiConformanceTest::parseLevels(const char *&start) { in parseLevels() argument
83 while(*start!=0 && *(start=u_skipWhitespace(start))!=0 && *start!=';') { in parseLevels()
84 if(*start=='x') { in parseLevels()
86 ++start; in parseLevels()
89 uint32_t value=(uint32_t)strtoul(start, &end, 10); in parseLevels()
90 if(end<=start || (!U_IS_INV_WHITESPACE(*end) && *end!=0 && *end!=';') in parseLevels()
92 errln("\nError on line %d: Levels parse error at %s", (int)lineNumber, start); in parseLevels()
[all …]
/external/chromium-trace/catapult/third_party/WebOb/webob/
Dbyterange.py13 def __init__(self, start, end): argument
15 self.start = start
21 the given length, then return a (start, end) non-inclusive range
26 start, end = self.start, self.end
29 if start < 0:
30 start += length
31 if _is_content_range_valid(start, end, length):
33 return (start, stop)
53 s,e = self.start, self.end
64 self.start, self.end)
[all …]
/external/mesa3d/src/mesa/tnl_dd/
Dt_dd_dmatmp2.h94 GLuint start, GLuint nr ) in TAG()
99 for ( i = 0 ; i+1 < nr ; i+=2, start += 2 ) { in TAG()
100 EMIT_TWO_ELTS( dest, 0, start, start+1 ); in TAG()
104 EMIT_ELT( dest, 0, start ); in TAG()
118 GLuint start, in TAG()
122 if (start < count) { in TAG()
125 EMIT_PRIM( ctx, GL_POINTS, HW_POINTS, start, count ); in TAG()
130 GLuint start, in TAG()
136 count -= (count-start) & 1; in TAG()
138 if (start+1 >= count) in TAG()
[all …]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/output1/
DSimpleCParser.h12 #pragma mark Cyclic DFA interface start DFA2
47 #pragma mark Rule Return Scopes start
50 ANTLRCommonTree *tree; // start of memVars()
53 // start properties
56 // this is start of set and get methods
64 ANTLRCommonTree *tree; // start of memVars()
67 // start properties
70 // this is start of set and get methods
78 ANTLRCommonTree *tree; // start of memVars()
81 // start properties
[all …]
/external/icu/icu4c/source/common/unicode/
Dunistr.h388 * [<TT>start</TT>, <TT>start + length</TT>) with the characters
390 * (The parameters "start" and "length" are not applied to the other text "text".)
391 * @param start the offset at which the compare operation begins
401 inline int8_t compare(int32_t start,
407 * [<TT>start</TT>, <TT>start + length</TT>) with the characters
410 * @param start the offset at which the compare operation begins
413 * @param srcStart the offset into <TT>srcText</TT> to start comparison
422 inline int8_t compare(int32_t start,
445 * [<TT>start</TT>, <TT>start + length</TT>) with the first
447 * @param start the offset at which the compare operation begins
[all …]
/external/antlr/antlr-3.4/runtime/ObjC/Framework/examples/simplecTreeParser/
DSimpleCParser.h25 #pragma mark Cyclic DFA interface start DFA2
64 #pragma mark Rule Return Scopes start
68 ANTLRCommonTree *tree; /* ObjC start of memVars() */
70 /* start properties */
74 /* this is start of set and get methods */
87 ANTLRCommonTree *tree; /* ObjC start of memVars() */
89 /* start properties */
93 /* this is start of set and get methods */
106 ANTLRCommonTree *tree; /* ObjC start of memVars() */
108 /* start properties */
[all …]
/external/pdfium/core/src/fxcrt/
Dfx_bidi_unittest.cpp17 int32_t start = -1; in TEST() local
23 dir = bidi.GetBidiInfo(&start, nullptr); in TEST()
25 EXPECT_EQ(0, start); in TEST()
31 start = -1; in TEST()
33 dir = bidi.GetBidiInfo(&start, &count); in TEST()
35 EXPECT_EQ(0, start); in TEST()
42 int32_t start = -1; in TEST() local
47 CFX_BidiChar::Direction dir = bidi.GetBidiInfo(&start, &count); in TEST()
48 EXPECT_EQ(0, start); in TEST()
54 dir = bidi.GetBidiInfo(&start, &count); in TEST()
[all …]
/external/llvm/unittests/ADT/
DIntervalMapTest.cpp82 EXPECT_EQ(100u, I.start()); in TEST()
95 EXPECT_EQ(100u, I.start()); in TEST()
104 EXPECT_EQ(100u, I.start()); in TEST()
111 EXPECT_EQ(0u, I.start()); in TEST()
117 EXPECT_EQ(0u, I.start()); in TEST()
124 EXPECT_EQ(150u, I.start()); in TEST()
130 EXPECT_EQ(150u, I.start()); in TEST()
149 EXPECT_EQ(90u, map.start()); in TEST()
155 EXPECT_EQ(90u, map.start()); in TEST()
161 EXPECT_EQ(60u, map.start()); in TEST()
[all …]
/external/webrtc/webrtc/libjingle/xmllite/
Dxmlparser_unittest.cc28 ss_ << "START (" << pctx->ResolveQName(name, false).Merged(); in StartElement()
71 EXPECT_EQ("START (testing) END ", handler.Str()); in TEST()
78 EXPECT_EQ("START (testing, a='b') END ", handler.Str()); in TEST()
83 EXPECT_EQ("START (testing, e='', long='some text') END ", handler.Str()); in TEST()
92 EXPECT_EQ("START (top) START (first) END START (second) START (third) " in TEST()
100 EXPECT_EQ("START (top) START (fifth) START (deeper) START (and) START " in TEST()
101 "(deeper) END END START (sibling) START (leaf) END END END " in TEST()
102 "END START (first) END START (second) START (third) END END END ", in TEST()
111 EXPECT_EQ("START (testing) END ", handler.Str()); in TEST()
117 EXPECT_EQ("START (testing) END ", handler.Str()); in TEST()
[all …]
/external/icu/icu4c/source/common/
Dstringtriebuilder.cpp81 // Requires start<limit,
82 // and all strings of the [start..limit[ elements must be sorted and
85 StringTrieBuilder::writeNode(int32_t start, int32_t limit, int32_t unitIndex) { in writeNode() argument
89 if(unitIndex==getElementStringLength(start)) { in writeNode()
91 value=getElementValue(start++); in writeNode()
92 if(start==limit) { in writeNode()
97 // Now all [start..limit[ strings are longer than unitIndex. in writeNode()
98 int32_t minUnit=getElementUnit(start, unitIndex); in writeNode()
102 int32_t lastUnitIndex=getLimitOfLinearMatch(start, limit-1, unitIndex); in writeNode()
103 writeNode(start, limit, lastUnitIndex); in writeNode()
[all …]
/external/chromium-trace/catapult/tracing/tracing/extras/chrome/cc/
Dinput_latency_async_slice_test.html28 start: 0,
46 start: 2,
65 start: 2,
86 start: 2,
122 { title: 's0', start: 0.0, duration: 1.0 }));
124 { title: 's1', start: 6.0, duration: 1.0 }));
126 { title: 's2', start: 2.0, duration: 1.0 }));
128 { title: 's3', start: 4.0, duration: 1.0 }));
130 { title: 's4', start: 0.5, duration: 1.0 }));
134 start: 0,
[all …]
/external/e2fsprogs/e2fsck/
Dregion.c23 region_addr_t start; member
59 int region_allocate(region_t region, region_addr_t start, int n) in region_allocate() argument
64 end = start+n; in region_allocate()
65 if ((start < region->min) || (end > region->max)) in region_allocate()
78 if (((start >= r->start) && (start < r->end)) || in region_allocate()
79 ((end > r->start) && (end <= r->end)) || in region_allocate()
80 ((start <= r->start) && (end >= r->end))) in region_allocate()
82 if (end == r->start) { in region_allocate()
83 r->start = start; in region_allocate()
86 if (start == r->end) { in region_allocate()
[all …]
/external/chromium-trace/catapult/third_party/mapreduce/mapreduce/
Dproperty_range.py64 self.prop, self.start, self.end = self._get_range_from_filters(
83 start and the end of the range. (None, None, None) if no range is found.
146 "Start value %s should be smaller than end value %s",
162 name = self.start[0]
166 self.start[2], self.end[2], n,
167 self.start[1] == ">=", self.end[1] == "<=")
175 self.start[2], self.end[2], n)
176 start_filter = self.start
223 def _split_datetime_property(start, end, n, include_start, include_end): argument
226 start += datetime.timedelta(microseconds=1)
[all …]
/external/chromium-trace/catapult/tracing/tracing/model/
Dslice_test.html24 { title: 'sA', start: 0.0, duration: 10.0 }));
26 { title: 'sB', start: 0.0, duration: 4.0 }));
28 { title: 'sC', start: 0.0, duration: 2.0 }));
41 { title: 'sA', start: 0.0, duration: 10.0 }));
43 { title: 'sB', start: 0.0, duration: 4.0 }));
45 { title: 'sC', start: 0.0, duration: 2.0 }));
57 { title: 'sA', start: 0.0, duration: 10.0 }));
59 { title: 'sB', start: 0.0, duration: 4.0 }));
61 { title: 'sC', start: 0.0, duration: 2.0 }));
74 { title: 'sA', start: 0.0, duration: 10.0 }));
[all …]
/external/dbus/dbus/
Ddbus-string.c460 * string, not at start + len.
463 * @param start byte offset to return
469 int start, in _dbus_string_get_data_len() argument
473 _dbus_assert (start >= 0); in _dbus_string_get_data_len()
475 _dbus_assert (start <= real->len); in _dbus_string_get_data_len()
476 _dbus_assert (len <= real->len - start); in _dbus_string_get_data_len()
478 return (char*) real->str + start; in _dbus_string_get_data_len()
487 * @param start byte offset to return
493 int start, in _dbus_string_get_const_data_len() argument
497 _dbus_assert (start >= 0); in _dbus_string_get_const_data_len()
[all …]

12345678910>>...406