| /external/chromium/net/base/ |
| pem_tokenizer.cc | 39 while (pos_ != StringPiece::npos) {
41 pos_ = str_.find(kPEMSearchBlock, pos_);
42 if (pos_ == StringPiece::npos)
48 if (!str_.substr(pos_).starts_with(it->header))
53 StringPiece::size_type footer_pos = str_.find(it->footer, pos_);
55 pos_ = StringPiece::npos;
60 StringPiece::size_type data_begin = pos_ + it->header.size();
61 pos_ = footer_pos + it->footer.size();
77 // continue the search. Otherwise, |pos_| has been updated to the mos
[all...] |
| pem_tokenizer.h | 58 base::StringPiece::size_type pos_; member in class:net::PEMTokenizer
|
| /external/chromium/base/i18n/ |
| break_iterator.cc | 21 pos_(0) {
59 prev_ = pos_;
65 pos_ = npos;
68 pos_ = static_cast<size_t>(pos);
76 pos_ = static_cast<size_t>(pos);
79 if (pos == UBRK_DONE && prev_ == pos_) {
80 pos_ = npos;
97 DCHECK(prev_ != npos && pos_ != npos);
98 return string_->substr(prev_, pos_ - prev_);
|
| break_iterator.h | 78 size_t pos() const { return pos_; }
114 size_t prev_, pos_; member in class:base::BreakIterator
|
| /external/v8/src/ |
| log-utils.cc | 200 pos_(0) {
206 Vector<char> buf(log_->message_buffer_ + pos_,
207 Log::kMessageBufferSize - pos_);
212 ASSERT(pos_ <= Log::kMessageBufferSize);
217 Vector<char> buf(log_->message_buffer_ + pos_,
218 Log::kMessageBufferSize - pos_);
223 pos_ += result;
225 pos_ = Log::kMessageBufferSize;
227 ASSERT(pos_ <= Log::kMessageBufferSize);
232 if (pos_ < Log::kMessageBufferSize)
[all...] |
| scanner-character-streams.cc | 53 pos_--;
59 pos_--;
81 ASSERT(pos_ > 0);
88 pos_--;
103 unsigned length = FillBuffer(pos_, kBufferSize);
129 pos_ = start_position;
137 unsigned old_pos = pos_;
138 pos_ = Min(pos_ + delta, length_);
140 return pos_ - old_pos
[all...] |
| assembler.cc | 136 if (pos_ < 0) return -pos_ - 1;
137 if (pos_ > 0) return pos_ - 1;
257 *--pos_ = b << kLastChunkTagBits;
260 *pos_ = *pos_ | kLastChunkTag;
269 *--pos_ = pc_delta << kTagBits | tag;
274 *--pos_ = static_cast<byte>(data_delta << kLocatableTypeTagBits | tag);
279 *--pos_ = static_cast<int>(top_tag << (kTagBits + kExtraTagBits)
[all...] |
| /external/marisa-trie/lib/marisa/ |
| range.h | 10 Range() : begin_(0), end_(0), pos_(0) {}
12 : begin_(begin), end_(end), pos_(pos) {}
21 pos_ = pos;
31 return pos_;
37 UInt32 pos_; member in class:marisa::Range
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| range.h | 10 Range() : begin_(0), end_(0), pos_(0) {}
12 : begin_(begin), end_(end), pos_(pos) {}
21 pos_ = pos;
31 return pos_;
37 UInt32 pos_; member in class:marisa_alpha::Range
|
| /external/icu4c/common/ |
| bytestrieiterator.cpp | 26 pos_(bytes_), initialPos_(bytes_),
47 : bytes_(trie.bytes_), pos_(trie.pos_), initialPos_(trie.pos_),
70 str_->append(reinterpret_cast<const char *>(pos_), length, errorCode);
71 pos_+=length;
83 pos_=initialPos_;
90 pos_+=length;
97 BytesTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty(); }
104 const uint8_t *pos=pos_;
[all...] |
| ucharstrieiterator.cpp | 25 pos_(uchars_), initialPos_(uchars_),
46 : uchars_(trie.uchars_), pos_(trie.pos_), initialPos_(trie.pos_),
69 str_.append(pos_, length);
70 pos_+=length;
81 pos_=initialPos_;
89 pos_+=length;
96 UCharsTrie::Iterator::hasNext() const { return pos_!=NULL || !stack_->isEmpty(); }
103 const UChar *pos=pos_;
[all...] |
| bytestrie.cpp | 68 const uint8_t *pos=pos_;
132 pos_=pos;
139 pos_=pos;
159 pos_=pos;
182 const uint8_t *pos=pos_;
194 pos_=pos;
212 const uint8_t *pos=pos_;
225 pos_=pos;
245 pos_=pos;
288 pos=pos_; // branchNext() advanced pos and wrote it to pos_
[all...] |
| ucharstrie.cpp | 31 const UChar *pos=pos_;
105 pos_=pos;
112 pos_=pos;
132 pos_=pos;
154 const UChar *pos=pos_;
163 pos_=pos;
181 const UChar *pos=pos_;
194 pos_=pos;
214 pos_=pos;
257 pos=pos_; // branchNext() advanced pos and wrote it to pos_
[all...] |
| /external/skia/legacy/src/images/ |
| bmpdecoderhelper.cpp | 25 pos_ = 0;
91 if (pos_ + (cols * colLen) > len_) {
112 if (pos_ + 12 > len_) {
156 if (offset > 0 && offset > pos_ && offset < len_) {
157 pos_ = offset;
161 if (!rle && (pos_ + (rowLen * height_) > len_ + 1)) {
185 while (pos_ < len_ - 1) {
213 if (pos_ < len_ - 1) {
229 while (cmd-- && pos_ < len_) {
249 if ((bytesRead & 1) && pos_ < len_)
[all...] |
| /external/skia/src/images/ |
| bmpdecoderhelper.cpp | 25 pos_ = 0;
91 if (pos_ + (cols * colLen) > len_) {
112 if (pos_ + 12 > len_) {
156 if (offset > 0 && offset > pos_ && offset < len_) {
157 pos_ = offset;
161 if (!rle && (pos_ + (rowLen * height_) > len_ + 1)) {
185 while (pos_ < len_ - 1) {
213 if (pos_ < len_ - 1) {
229 while (cmd-- && pos_ < len_) {
249 if ((bytesRead & 1) && pos_ < len_)
[all...] |
| /external/openfst/src/include/fst/ |
| heap.h | 68 pos_[key_[size_]] = size_;
71 pos_.push_back(size_);
84 int i = pos_[key];
147 pos_[key_[j] = key_[k]] = j;
148 pos_[key_[k] = tkey] = k;
196 vector<int> pos_; member in class:fst::Heap
|
| complement.h | 241 : aiter_(0), s_(s), pos_(0) {
250 return pos_ > 0 && aiter_->Done();
252 return pos_ > 0;
257 if (pos_ == 0) {
269 if (s_ != 0 && pos_ > 0)
271 ++pos_;
275 return pos_;
281 pos_ = 0;
292 pos_ = a;
316 size_t pos_; member in class:fst::ArcIterator
[all...] |
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| heap.h | 62 pos_[key_[size_]] = size_;
65 pos_.push_back(size_);
78 int i = pos_[key];
139 pos_[key_[j] = key_[k]] = j;
140 pos_[key_[k] = tkey] = k;
184 vector<int> pos_; member in class:fst::Heap
|
| complement.h | 222 : aiter_(0), s_(s), pos_(0) {
230 return pos_ > 0 && aiter_->Done();
232 return pos_ > 0;
237 if (pos_ == 0) {
248 if (s_ != 0 && pos_ > 0)
250 ++pos_;
255 pos_ = 0;
265 pos_ = a;
271 size_t pos_; member in class:fst::ArcIterator
|
| symbol-table.h | 330 pos_ = 0;
341 return (pos_ == size_);
346 return impl_->Find(impl_->symbols_[pos_]);
351 return impl_->symbols_[pos_];
357 ++pos_;
362 pos_ = 0;
367 size_t pos_; member in class:fst::SymbolTableIterator
|
| /external/icu4c/common/unicode/ |
| ucharstrie.h | 66 pos_(uchars_), remainingMatchLength_(-1) {}
82 pos_(other.pos_), remainingMatchLength_(other.remainingMatchLength_) {}
90 pos_=uchars_;
124 state.pos=pos_;
141 pos_=state.pos;
221 const UChar *pos=pos_;
238 const UChar *pos=pos_;
332 pos_=NULL;
340 const UChar *pos_; member in class:UCharsTrie::Iterator
569 const UChar *pos_; member in class:UCharsTrie
[all...] |
| bytestrie.h | 66 pos_(bytes_), remainingMatchLength_(-1) {}
82 pos_(other.pos_), remainingMatchLength_(other.remainingMatchLength_) {}
90 pos_=bytes_;
124 state.pos=pos_;
141 pos_=state.pos;
207 const uint8_t *pos=pos_;
223 const uint8_t *pos=pos_;
322 const uint8_t *pos_; member in class:BytesTrie::Iterator
354 pos_(bytes_), remainingMatchLength_(-1) {
512 const uint8_t *pos_; member in class:BytesTrie
[all...] |
| /external/webp/src/utils/ |
| bit_reader.c | 136 br->pos_ = 0;
141 br->val_ |= ((vp8l_val_t)br->buf_[br->pos_]) << (8 * i);
142 ++br->pos_;
151 br->eos_ = (br->pos_ >= len);
158 while (br->bit_pos_ >= 8 && br->pos_ < br->len_) {
160 br->val_ |= ((vp8l_val_t)br->buf_[br->pos_]) << (LBITS - 8);
161 ++br->pos_;
169 if (br->pos_ + sizeof(br->val_) < br->len_) {
174 br->val_ |= *(const vp8l_val_t*)(br->buf_ + br->pos_) << (LBITS - WBITS);
175 br->pos_ += LOG8_WBITS
[all...] |
| bit_writer.h | 31 size_t pos_; member in struct:VP8BitWriter
55 return (uint64_t)(bw->pos_ + bw->run_) * 8 + 8 + bw->nb_bits_;
64 return bw->pos_;
|
| /external/chromium/chrome/browser/resources/file_manager/js/ |
| exif_reader.js | 189 this.pos_ = 0;
207 return this.pos_ >= this.ary_.length;
219 rv = this.ary_[this.pos_++] << 24;
221 rv |= this.ary_[this.pos_++] << 16;
223 rv |= this.ary_[this.pos_++] << 8;
225 rv |= this.ary_[this.pos_++];
238 rv = this.ary_[this.pos_ + 3] << 24;
240 rv |= this.ary_[this.pos_ + 2] << 16;
242 rv |= this.ary_[this.pos_+ 1] << 8;
244 rv |= this.ary_[this.pos_];
[all...] |
