/external/chromium/base/i18n/ |
H A D | 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_);
|
H A D | break_iterator.h | 78 size_t pos() const { return pos_; } 114 size_t prev_, pos_; member in class:base::BreakIterator
|
/external/chromium/net/base/ |
H A D | 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_| ha [all...] |
H A D | pem_tokenizer.h | 58 base::StringPiece::size_type pos_; member in class:net::PEMTokenizer
|
/external/chromium/chrome/browser/resources/file_manager/js/ |
H A D | 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...] |
/external/v8/src/ |
H A D | 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_ < Lo [all...] |
H A D | 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_ [all...] |
H A D | 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_ [all...] |
H A D | assembler.h | 97 INLINE(void Unuse()) { pos_ = 0; } 100 INLINE(bool is_bound() const) { return pos_ < 0; } 101 INLINE(bool is_unused() const) { return pos_ == 0 && near_link_pos_ == 0; } 102 INLINE(bool is_linked() const) { return pos_ > 0; } 111 // pos_ encodes both the binding state (via its sign) 114 // pos_ < 0 bound label, pos() returns the jump target position 115 // pos_ == 0 unused label 116 // pos_ > 0 linked label, pos() returns the last reference position 117 int pos_; member in class:v8::internal::BASE_EMBEDDED 119 // Behaves like |pos_| i 423 byte* pos_; member in class:v8::internal::BASE_EMBEDDED 482 byte* pos_; member in class:v8::internal::RelocIterator [all...] |
H A D | preparser-api.cc | 80 ASSERT(pos_ > 0); 82 pos_--; 114 pos_--;
|
/external/webp/src/enc/ |
H A D | bit_writer.h | 31 size_t pos_; member in struct:VP8BitWriter 47 return (uint64_t)(bw->pos_ + bw->run_) * 8 + 8 + bw->nb_bits_; 54 return bw->pos_;
|
H A D | bit_writer.c | 26 const size_t needed_size = bw->pos_ + extra_size; 37 if (bw->pos_ > 0) memcpy(new_buf, bw->buf_, bw->pos_); 51 size_t pos = bw->pos_; 65 bw->pos_ = pos; 157 bw->pos_ = 0; 176 memcpy(bw->buf_ + bw->pos_, data, size); 177 bw->pos_ += size;
|
/external/icu4c/common/ |
H A D | 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...] |
H A D | 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...] |
H A D | 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_; // branchNex [all...] |
H A D | ucharstrie.cpp | 30 const UChar *pos=pos_; 86 pos_=pos; 93 pos_=pos; 113 pos_=pos; 135 const UChar *pos=pos_; 144 pos_=pos; 162 const UChar *pos=pos_; 175 pos_=pos; 195 pos_=pos; 238 pos=pos_; // branchNex [all...] |
/external/skia/src/images/ |
H A D | 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/ |
H A D | 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
|
H A D | 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...] |
H A D | symbol-table.h | 419 pos_(0), 427 return (pos_ == nsymbols_); 442 ++pos_; 443 if (pos_ < nsymbols_) key_ = table_.GetNthKey(pos_); 448 pos_ = 0; 454 ssize_t pos_; member in class:fst::SymbolTableIterator
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | 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
|
H A D | 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
|
H A D | 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
|
/external/icu4c/common/unicode/ |
H A D | 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; 233 const UChar *pos=pos_; 250 const UChar *pos=pos_; 344 pos_=NULL; 352 const UChar *pos_; member in class:UCharsTrie::Iterator 581 const UChar *pos_; member in class:UCharsTrie [all...] |
H A D | 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 512 const uint8_t *pos_; member in class:BytesTrie [all...] |