OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:cur_
(Results
1 - 16
of
16
) sorted by null
/external/chromium_org/chrome/browser/ui/tab_contents/
tab_contents_iterator.cc
14
cur_
(NULL) {
15
// Load the first WebContents into |
cur_
|.
21
DCHECK(
cur_
|| web_view_index_ == -1) << "Trying to advance past the end";
23
// Update |
cur_
| to the next WebContents in the list.
35
cur_
= next_tab;
40
cur_
= NULL;
tab_contents_iterator.h
34
bool done() const { return
cur_
== NULL; }
46
return
cur_
;
49
return
cur_
;
52
// Loads the next host into |
cur_
|. This is designed so that for the initial
64
content::WebContents*
cur_
;
member in class:TabContentsIterator
/external/chromium_org/tools/gn/
tokenizer.h
59
bool CanIncrement() const { return
cur_
< input_.size(); }
71
bool at_end() const { return
cur_
== input_.size(); }
72
char cur_char() const { return input_[
cur_
]; }
81
size_t
cur_
; // Byte offset into input buffer.
member in class:Tokenizer
tokenizer.cc
74
cur_
(0),
101
size_t token_begin =
cur_
;
105
size_t token_end =
cur_
;
211
char following_char = input_[
cur_
+ 1];
267
if (CanIncrement() && CouldBeTwoCharOperatorEnd(input_[
cur_
+ 1]))
306
char c = input_[
cur_
];
319
for (int i = static_cast<int>(
cur_
) - 1; i >= 0 && input_[i] == '\\'; i--)
328
return IsNewline(input_,
cur_
);
332
DCHECK(
cur_
< input_.size());
339
cur_
++
[
all
...]
parser.h
87
const Token& cur_token() const { return tokens_[
cur_
]; }
90
bool at_end() const { return
cur_
>= tokens_.size(); }
100
size_t
cur_
;
member in class:Parser
parser.cc
81
: tokens_(tokens), err_(err),
cur_
(0) {
145
cur_
++;
159
return tokens_[
cur_
++];
166
return tokens_[
cur_
++];
/external/chromium_org/net/dns/
dns_response.h
53
bool AtEnd() const { return
cur_
== packet_ + length_; }
56
size_t GetOffset() const { return
cur_
- packet_; }
77
const char*
cur_
;
member in class:net::DnsRecordParser
dns_response.cc
25
DnsRecordParser::DnsRecordParser() : packet_(NULL), length_(0),
cur_
(0) {
33
cur_
(packet_ + offset) {
113
size_t consumed = ReadName(
cur_
, &out->name);
116
base::BigEndianReader reader(
cur_
+ consumed,
117
packet_ + length_ - (
cur_
+ consumed));
124
cur_
= reader.ptr();
131
size_t consumed = ReadName(
cur_
, NULL);
135
const char* next =
cur_
+ consumed + 2 * sizeof(uint16); // QTYPE + QCLASS
139
cur_
= next;
/external/chromium_org/third_party/libwebp/utils/
bit_writer.h
86
uint8_t*
cur_
; // current write position
member in struct:__anon16914
97
return (bw->
cur_
- bw->buf_) + ((bw->used_ + 7) >> 3);
bit_writer.c
213
const size_t current_size = bw->
cur_
- bw->buf_;
235
bw->
cur_
= bw->buf_ + current_size;
274
if (bw->
cur_
+ VP8L_WRITER_BYTES > bw->end_) {
278
bw->
cur_
= bw->buf_;
283
*(vp8l_wtype_t*)bw->
cur_
= (vp8l_wtype_t)WSWAP((vp8l_wtype_t)lbits);
284
bw->
cur_
+= VP8L_WRITER_BYTES;
298
*bw->
cur_
++ = (uint8_t)bw->bits_;
quant_levels_dec.c
58
uint16_t*
cur_
;
member in struct:__anon16921
82
uint16_t* const cur = p->
cur_
;
96
p->top_ = p->
cur_
;
97
p->
cur_
+= w;
98
if (p->
cur_
== p->end_) p->
cur_
= p->start_; // roll-over
225
p->
cur_
= p->start_;
/external/webp/src/utils/
bit_writer.h
86
uint8_t*
cur_
; // current write position
member in struct:__anon37083
97
return (bw->
cur_
- bw->buf_) + ((bw->used_ + 7) >> 3);
bit_writer.c
213
const size_t current_size = bw->
cur_
- bw->buf_;
235
bw->
cur_
= bw->buf_ + current_size;
274
if (bw->
cur_
+ VP8L_WRITER_BYTES > bw->end_) {
278
bw->
cur_
= bw->buf_;
283
*(vp8l_wtype_t*)bw->
cur_
= (vp8l_wtype_t)WSWAP((vp8l_wtype_t)lbits);
284
bw->
cur_
+= VP8L_WRITER_BYTES;
298
*bw->
cur_
++ = (uint8_t)bw->bits_;
quant_levels_dec.c
58
uint16_t*
cur_
;
member in struct:__anon37090
82
uint16_t* const cur = p->
cur_
;
96
p->top_ = p->
cur_
;
97
p->
cur_
+= w;
98
if (p->
cur_
== p->end_) p->
cur_
= p->start_; // roll-over
225
p->
cur_
= p->start_;
/system/extras/memtrack/
memtrack.cpp
153
if (
cur_
.count(cmd_name_) == 0) {
154
cur_
[cmd_name_] = process_info;
156
cur_
[cmd_name_].pss_kb += process_info.pss_kb;
158
cur_
[cmd_name_].pids.push_back(pid);
179
cur_
.clear();
199
for (cur_processes_t::const_iterator it =
cur_
.begin();
200
it !=
cur_
.end(); ++it) {
memtrack.h
112
cur_processes_t
cur_
;
member in class:ProcessInfo
Completed in 427 milliseconds