OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:Advance
(Results
26 - 50
of
300
) sorted by null
1
2
3
4
5
6
7
8
9
10
11
>>
/external/v8/src/crankshaft/
hydrogen-infer-types.cc
19
for (HInstructionIterator it(block); !it.Done(); it.
Advance
()) {
40
for (HUseIterator it(current->uses()); !it.Done(); it.
Advance
()) {
hydrogen-infer-representation.cc
42
for (HUseIterator it(phi->uses()); !it.Done(); it.
Advance
()) {
66
it.
Advance
()) {
79
it.
Advance
()) {
88
it.
Advance
()) {
108
it.
Advance
()) {
123
for (HInstructionIterator it(block); !it.Done(); it.
Advance
()) {
147
for (HInstructionIterator it(block); !it.Done(); it.
Advance
()) {
hydrogen-mark-unreachable.cc
22
for (HPredecessorIterator it(block); !it.Done(); it.
Advance
()) {
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/cris/
rd-dw2-10.d
9
\[0x.*\] Special opcode .*:
advance
Address by 0 to 0x0 and Line by 6 to 7
10
\[0x.*\]
Advance
PC by 4 to 0x4
rd-dw2-3.d
9
\[0x.*\] Special opcode .*:
advance
Address by 0 to 0x0 and Line by 7 to 8
10
\[0x.*\] Special opcode .*:
advance
Address by 12 to 0xc and Line by 1 to 9
11
\[0x.*\]
Advance
PC by 2 to 0xe
/toolchain/binutils/binutils-2.25/gas/testsuite/gas/mips/
loc-swap-3.d
15
.* Special opcode 6:
advance
Address by 0 to 0x[01] and Line by 1 to 2
16
.*
Advance
PC by .*
/art/compiler/optimizing/
licm.cc
33
for (HInputIterator it(instruction); !it.Done(); it.
Advance
()) {
93
for (HPostOrderIterator it(*graph_); !it.Done(); it.
Advance
()) {
104
for (HBlocksInLoopIterator it_loop(*loop_info); !it_loop.Done(); it_loop.
Advance
()) {
130
inst_it.
Advance
()) {
ssa_phi_elimination.cc
37
for (HReversePostOrderIterator it(*graph_); !it.Done(); it.
Advance
()) {
39
for (HInstructionIterator inst_it(block->GetPhis()); !inst_it.Done(); inst_it.
Advance
()) {
70
for (HInputIterator it(phi); !it.Done(); it.
Advance
()) {
87
for (HPostOrderIterator it(*graph_); !it.Done(); it.
Advance
()) {
124
for (HReversePostOrderIterator it(*graph_); !it.Done(); it.
Advance
()) {
126
for (HInstructionIterator inst_it(block->GetPhis()); !inst_it.Done(); inst_it.
Advance
()) {
select_generator.cc
33
for (HInstructionIterator it(block->GetInstructions()); !it.Done(); it.
Advance
()) {
60
for (HInstructionIterator it(block->GetPhis()); !it.Done(); it.
Advance
()) {
79
for (HPostOrderIterator it(*graph_); !it.Done(); it.
Advance
()) {
/external/protobuf/src/google/protobuf/io/
coded_stream.cc
194
Advance
(count);
199
// We hit a limit inside this buffer.
Advance
to the limit and fail.
200
Advance
(original_buffer_size);
239
Advance
(current_buffer_size);
244
Advance
(size);
277
Advance
(current_buffer_size);
282
Advance
(size);
295
Advance
(sizeof(*value));
312
Advance
(sizeof(*value));
459
Advance
(1)
[
all
...]
coded_stream.h
183
//
advance
the stream's current position. This will always either produce
528
//
Advance
the buffer by a given number of bytes.
529
void
Advance
(int amount);
542
//
Advance
(BufferSize()).
637
// buffer, but does not
advance
the stream's current position. This will
[
all
...]
/external/v8/src/
bit-vector.cc
28
void BitVector::Iterator::
Advance
() {
json-parser.cc
122
//
Advance
to the first character (possibly EOS)
177
void JsonParser<seq_one_byte>::
Advance
() {
191
Advance
();
198
Advance
();
204
Advance
();
295
Advance
();
301
Advance
();
343
Advance
();
435
Advance
();
524
Advance
();
[
all
...]
bit-vector.h
25
Advance
();
30
void
Advance
();
201
void
Advance
() { it_.
Advance
(); }
223
for (Iterator it(&other, zone); !it.Done(); it.
Advance
()) {
prototype.h
42
if (where_to_start == kStartAtPrototype)
Advance
();
53
if (where_to_start == kStartAtPrototype)
Advance
();
97
void
Advance
() {
127
// TODO(neis): This should probably replace
Advance
().
/external/v8/src/compiler/
bytecode-branch-analysis.cc
29
iterator.
Advance
();
/external/v8/src/interpreter/
bytecode-array-iterator.h
21
void
Advance
();
source-position-table.cc
147
encoded.
Advance
(), raw++) {
161
Advance
();
164
void SourcePositionTableIterator::
Advance
() {
/external/v8/test/cctest/interpreter/
source-position-matcher.cc
186
iterator->
Advance
();
198
iterator.
Advance
();
210
iterator->
Advance
();
219
iterator->
Advance
();
/external/v8/src/snapshot/
snapshot-source-sink.h
39
void
Advance
(int by) { position_ += by; }
52
Advance
(bytes);
/prebuilts/tools/darwin-x86_64/protoc/include/google/protobuf/io/
coded_stream.h
186
//
advance
the stream's current position. This will always either produce
568
//
Advance
the buffer by a given number of bytes.
569
void
Advance
(int amount);
582
//
Advance
(BufferSize()).
689
// buffer, but does not
advance
the stream's current position. This will
[
all
...]
/external/autotest/client/site_tests/network_3GScanningProperty/
network_3GScanningProperty.py
207
itesting_scan_machine.
Advance
()
267
enable_machine.
Advance
()
284
enable_machine.
Advance
()
293
enable_machine.
Advance
()
316
register_machine.
Advance
()
326
enable_machine.
Advance
()
334
register_machine.
Advance
()
/prebuilts/misc/darwin-x86_64/protobuf2.5/include/google/protobuf/io/
coded_stream.h
183
//
advance
the stream's current position. This will always either produce
513
//
Advance
the buffer by a given number of bytes.
514
void
Advance
(int amount);
527
//
Advance
(BufferSize()).
622
// buffer, but does not
advance
the stream's current position. This will
[
all
...]
/prebuilts/misc/linux-x86_64/protobuf2.5/include/google/protobuf/io/
coded_stream.h
183
//
advance
the stream's current position. This will always either produce
513
//
Advance
the buffer by a given number of bytes.
514
void
Advance
(int amount);
527
//
Advance
(BufferSize()).
622
// buffer, but does not
advance
the stream's current position. This will
[
all
...]
/prebuilts/misc/windows/protobuf2.5/include/google/protobuf/io/
coded_stream.h
183
//
advance
the stream's current position. This will always either produce
513
//
Advance
the buffer by a given number of bytes.
514
void
Advance
(int amount);
527
//
Advance
(BufferSize()).
622
// buffer, but does not
advance
the stream's current position. This will
[
all
...]
Completed in 645 milliseconds
1
2
3
4
5
6
7
8
9
10
11
>>