/external/wpa_supplicant_8/src/eap_common/ |
eap_sake_common.c | 19 const u8 *pos) 23 switch (pos[0]) { 26 if (pos[1] != 2 + EAP_SAKE_RAND_LEN) { 28 "invalid length %d", pos[1]); 31 attr->rand_s = pos + 2; 35 if (pos[1] != 2 + EAP_SAKE_RAND_LEN) { 37 "invalid length %d", pos[1]); 40 attr->rand_p = pos + 2; 44 if (pos[1] != 2 + EAP_SAKE_MIC_LEN) { 46 "invalid length %d", pos[1]) 163 const u8 *pos = buf, *end = buf + len; local 214 size_t pos, plen; local 324 u8 *tmp, *pos; local [all...] |
/external/javasqlite/src/main/java/SQLite/ |
Blob.java | 22 private int pos; field in class:BlobR 30 this.pos = 0; 39 int ret = blob.size - pos; 73 pos = 0; 81 long ret = pos + n; 84 pos = 0; 87 pos = blob.size; 89 pos = (int) ret; 101 int n = blob.read(b, 0, pos, b.length); 103 pos += n 168 private int pos; field in class:BlobW [all...] |
/packages/inputmethods/LatinIME/native/jni/src/suggest/policyimpl/dictionary/shortcut/ |
shortcut_list_policy.h | 35 int getStartPos(const int pos) const { 36 if (pos == NOT_A_DICT_POS) { 39 int listPos = pos; 46 int *const pos) const { 48 ShortcutListReadingUtils::getFlagsAndForwardPointer(mShortcutsBuf, pos); 57 mShortcutsBuf, maxCodePointCount, outCodePoint, pos); 61 void skipAllShortcuts(int *const pos) const { 63 ::getShortcutListSizeAndForwardPointer(mShortcutsBuf, pos); 64 *pos += shortcutListSize;
|
/external/chromium_org/third_party/icu/source/i18n/ |
fpositer.cpp | 26 pos = -1; 30 : data(NULL), pos(-1) { 34 : UObject(rhs), data(NULL), pos(rhs.pos) { 43 pos = -1; 52 if (pos != rhs.pos) { 87 pos = adopt == NULL ? -1 : 0; 91 if (pos == -1) { 95 fp.setField(data->elementAti(pos++)) [all...] |
/external/guava/guava/src/com/google/common/io/ |
LineBuffer.java | 51 int pos = off; local 54 if (finishLine(cbuf[pos] == '\n')) { 55 pos++; 59 int start = pos; 60 for (int end = off + len; pos < end; pos++) { 61 switch (cbuf[pos]) { 63 line.append(cbuf, start, pos - start); 65 if (pos + 1 < end) { 66 if (finishLine(cbuf[pos + 1] == '\n')) [all...] |
/libcore/luni/src/main/java/java/io/ |
StringReader.java | 33 private int pos; field in class:StringReader 91 markpos = pos; 126 if (pos != count) { 127 return str.charAt(pos++); 152 if (pos == this.count) { 155 int end = pos + count > this.count ? this.count : pos + count; 156 str.getChars(pos, end, buffer, offset); 157 int read = end - pos; 158 pos = end [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != NULL && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != NULL && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != NULL && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != NULL && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != NULL && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/ext/pb_ds/detail/cc_hash_table_map_/ |
erase_fn_imps.hpp | 62 for (size_type pos = 0; pos < m_num_e; ++pos) 64 while (m_entries[pos] != 0 && pred(m_entries[pos]->m_value)) 67 entry_pointer p_next_e = m_entries[pos]->m_p_next; 68 erase_entry_pointer(m_entries[pos]); 69 m_entries[pos] = p_next_e; 72 entry_pointer p_e = m_entries[pos]; 94 for (size_type pos = 0; pos < m_num_e; ++pos [all...] |
/frameworks/compile/mclinker/lib/Core/ |
InputTree.cpp | 57 bool mcld::isGroup(const InputTree::iterator& pos) 59 return !pos.hasData() && !pos.isRoot(); 62 bool mcld::isGroup(const InputTree::const_iterator& pos) 64 return !pos.hasData() && !pos.isRoot(); 67 bool mcld::isGroup(const InputTree::dfs_iterator& pos) 69 return !pos.hasData() && !pos.isRoot(); 72 bool mcld::isGroup(const InputTree::const_dfs_iterator& pos) [all...] |
/external/linux-tools-perf/util/include/linux/added/ |
list.h | 347 * @pos: the &struct list_head to use as a loop cursor. 350 #define list_for_each(pos, head) \ 351 for (pos = (head)->next; prefetch(pos->next), pos != (head); \ 352 pos = pos->next) 356 * @pos: the &struct list_head to use as a loop cursor. 364 #define __list_for_each(pos, head) \ 365 for (pos = (head)->next; pos != (head); pos = pos->next [all...] |
/external/wpa_supplicant_8/src/tls/ |
tlsv1_server_write.c | 45 u8 *pos, *rhdr, *hs_start, *hs_length; local 49 pos = *msgpos; 52 rhdr = pos; 53 pos += TLS_RECORD_HEADER_LEN; 77 hs_start = pos; 79 *pos++ = TLS_HANDSHAKE_TYPE_SERVER_HELLO; 81 hs_length = pos; 82 pos += 3; 85 WPA_PUT_BE16(pos, conn->rl.tls_version); 86 pos += 2 159 u8 *pos, *rhdr, *hs_start, *hs_length, *cert_start; local 248 u8 *pos, *rhdr, *hs_start, *hs_length; local 438 u8 *pos, *rhdr, *hs_start, *hs_length; local 504 u8 *pos; local 574 u8 *pos, *hs_start; local 666 u8 *msg, *end, *pos; local 720 u8 *msg, *end, *pos; local 768 u8 *alert, *pos, *length; local [all...] |
/external/javassist/src/main/javassist/bytecode/ |
AnnotationsAttribute.java | 318 void parameters(int numParam, int pos) throws Exception { 320 pos = annotationArray(pos); 327 final int annotationArray(int pos) throws Exception { 328 int num = ByteArray.readU16bit(info, pos); 329 return annotationArray(pos + 2, num); 332 int annotationArray(int pos, int num) throws Exception { 334 pos = annotation(pos); 336 return pos; [all...] |
/external/chromium_org/third_party/yasm/source/patched-yasm/modules/arch/x86/tests/ |
negequ.asm | 3 pos equ 4 define 6 mov [ebp+pos], eax 8 mov [ebp-pos], eax
|
/external/dropbear/ |
atomicio.c | 44 size_t pos = 0; local 46 while (n > pos) { 47 res = (f) (fd, s + pos, n - pos); 59 pos += res; 62 return (pos);
|
/external/smack/src/org/xbill/DNS/ |
DNSOutput.java | 15 private int pos; field in class:DNSOutput 25 pos = 0; 42 return pos; 57 if (array.length - pos >= n) { 61 if (newsize < pos + n) { 62 newsize = pos + n; 65 System.arraycopy(array, 0, newarray, 0, pos); 76 if (index > pos) { 80 pos = index; 89 saved_pos = pos; [all...] |