HomeSort by relevance Sort by last modified time
    Searched defs:pos (Results 76 - 100 of 5226) sorted by null

1 2 34 5 6 7 8 91011>>

  /external/lzma/C/
Bra86.c 12 SizeT pos = 0; local
21 Byte *p = data + pos;
28 SizeT d = (SizeT)(p - data - pos);
29 pos = (SizeT)(p - data);
33 return pos;
43 pos++;
52 UInt32 cur = ip + (UInt32)pos;
53 pos += 5;
79 pos++;
  /external/lzma/Java/Tukaani/src/org/tukaani/xz/
SeekableInputStream.java 46 long pos = position(); local
47 if (pos >= size)
50 if (size - pos < n)
51 n = size - pos;
53 seek(pos + n);
75 * @param pos new read position in the stream
77 * @throws IOException if <code>pos</code> is negative or if
80 public abstract void seek(long pos) throws IOException;
  /external/mp4parser/isoparser/src/main/java/com/googlecode/mp4parser/h264/
CharCache.java 25 private int pos; field in class:CharCache
33 int available = cache.length - pos;
35 System.arraycopy(chars, 0, cache, pos, toWrite);
36 pos += toWrite;
40 return new String(cache, 0, pos);
44 pos = 0;
48 if (pos < cache.length - 1) {
49 cache[pos] = c;
50 pos++;
55 return pos;
    [all...]
  /external/pdfium/testing/utils/
path_service.cpp 57 std::size_t pos = path->size() - 1; local
59 pos--;
60 std::size_t found = path->find_last_of(PATH_SEPARATOR, pos);
  /external/perfetto/src/protozero/
proto_utils.cc 43 const uint8_t* pos = start; local
47 if (PERFETTO_UNLIKELY(pos >= end)) {
52 *value |= static_cast<uint64_t>(*pos & 0x7f) << shift;
54 } while (*pos++ & 0x80);
55 return pos;
70 const uint8_t* pos = start;
71 PERFETTO_CHECK_PTR_LE(pos, end - 1);
72 *field_type = static_cast<FieldType>(*pos & kFieldTypeMask);
75 pos = ParseVarInt(pos, end, &raw_field_id)
    [all...]
  /external/selinux/libsepol/cil/src/
cil_stack.h 36 int pos; member in struct:cil_stack
44 #define cil_stack_for_each_starting_at(stack, start, pos, item) \
45 for (pos = start, item = cil_stack_peek_at(stack, pos); item != NULL; pos++, item = cil_stack_peek_at(stack, pos))
47 #define cil_stack_for_each(stack, pos, item) cil_stack_for_each_starting_at(stack, 0, pos, item)
59 struct cil_stack_item *cil_stack_peek_at(struct cil_stack *stack, int pos);
  /external/skia/src/core/
SkBuffer.cpp 16 const void* pos = fPos; local
18 return pos;
33 intptr_t pos = reinterpret_cast<intptr_t>(fPos); local
34 size_t n = SkAlign4(pos) - pos;
61 size_t pos = this->pos(); local
62 size_t n = SkAlign4(pos) - pos;
  /external/skqp/src/core/
SkBuffer.cpp 28 intptr_t pos = reinterpret_cast<intptr_t>(fPos); local
29 size_t n = SkAlign4(pos) - pos;
55 size_t pos = this->pos(); local
56 size_t n = SkAlign4(pos) - pos;
  /external/tensorflow/tensorflow/compiler/xla/service/gpu/llvm_gpu_backend/
utils.cc 57 auto pos = filename.rfind('.'); local
59 pos == tensorflow::StringPiece::npos
61 : tensorflow::StringPiece(filename.data(), pos);
  /external/tensorflow/tensorflow/contrib/input_pipeline/kernels/
input_pipeline_kernels.cc 47 int64* pos = &counter_tensor.scalar<int64>()(); variable
48 *pos = (*pos + 1) % num_elements;
51 output_tensor->scalar<string>()() = list_flat(*pos);
  /external/toybox/toys/other/
shred.c 51 off_t pos = 0, len = TT.size; local
76 if (pos >= len) {
77 pos = -1;
85 if (pos < TT.offset) {
90 pos = TT.offset;
97 if (len-pos < throw) throw = len-pos;
101 pos += throw;
  /external/toybox/toys/pending/
fold.c 42 int pos = 0, split = -1; local
44 while (pos < bufsz) {
45 switch (buf[pos]) {
48 if ((toys.optflags & FLAG_u) && buf[pos-1] != '\n'
49 && buf[pos+1] != '\n') {
50 xwrite(1, buf, pos);
51 bufsz -= pos + 1;
52 buf += pos + 1;
53 pos = 0;
73 split = pos;
    [all...]
  /external/v8/src/runtime/
runtime-function.cc 105 int pos = fun->shared()->start_position(); local
106 return Smi::FromInt(pos);
  /external/v8/src/wasm/
signature-map.cc 12 auto pos = map_.find(sig); local
13 if (pos != map_.end()) {
14 return pos->second;
23 auto pos = map_.find(sig); local
24 if (pos != map_.end()) {
25 return static_cast<int32_t>(pos->second);
  /external/webrtc/webrtc/modules/audio_coding/codecs/ilbc/
frame_classify.c 38 size_t pos; local
85 pos = WebRtcSpl_MaxIndexW32(ssqEn, iLBCenc_inst->nsub - 1) + 1;
87 return(pos);
vq3.c 34 int16_t pos, minindex=0; local
38 pos = 0;
43 tmp = X[0] - CB[pos];
46 tmp = X[i] - CB[pos + i];
54 pos += 3;
vq4.c 34 int16_t pos, minindex=0; local
38 pos = 0;
43 tmp = X[0] - CB[pos];
46 tmp = X[i] - CB[pos + i];
54 pos += 4;
  /external/wpa_supplicant_8/src/crypto/
aes-cbc.c 28 u8 *pos = data; local
42 cbc[j] ^= pos[j];
44 os_memcpy(pos, cbc, AES_BLOCK_SIZE);
45 pos += AES_BLOCK_SIZE;
64 u8 *pos = data; local
77 os_memcpy(tmp, pos, AES_BLOCK_SIZE);
78 aes_decrypt(ctx, pos, pos);
80 pos[j] ^= cbc[j];
82 pos += AES_BLOCK_SIZE
    [all...]
aes-ctr.c 31 u8 *pos = data; local
44 pos[j] ^= buf[j];
45 pos += len;
rc4.c 20 u8 S[256], *pos; local
45 pos = data;
50 *pos++ ^= S[(S[i] + S[j]) & 0xff];
sha1-prf.c 34 size_t pos, plen; local
47 pos = 0;
48 while (pos < buf_len) {
49 plen = buf_len - pos;
52 &buf[pos]))
54 pos += SHA1_MAC_LEN;
59 os_memcpy(&buf[pos], hash, plen);
sha1-tprf.c 33 size_t pos, plen; local
53 pos = 0;
54 while (pos < buf_len) {
56 plen = buf_len - pos;
60 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN);
61 pos += SHA1_MAC_LEN;
63 os_memcpy(&buf[pos], hash, plen);
  /external/wpa_supplicant_8/src/eap_common/
eap_peap_common.c 20 size_t pos, plen; local
68 pos = 0;
69 while (pos < buf_len) {
71 plen = buf_len - pos;
75 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN);
76 pos += SHA1_MAC_LEN;
78 os_memcpy(&buf[pos], hash, plen);
  /external/wpa_supplicant_8/src/utils/
uuid.c 17 const char *pos; local
20 pos = str;
23 if (hexstr2bin(pos, opos, 4))
25 pos += 8;
28 if (*pos++ != '-' || hexstr2bin(pos, opos, 2))
30 pos += 4;
33 if (*pos++ != '-' || hexstr2bin(pos, opos, 2))
35 pos += 4
    [all...]
  /external/wpa_supplicant_8/wpa_supplicant/
nfc_pw_token.c 21 const u8 *pos; local
28 pos = wpabuf_head(buf);
31 printf("%02X", *pos++);

Completed in 448 milliseconds

1 2 34 5 6 7 8 91011>>