HomeSort by relevance Sort by last modified time
    Searched refs:pos (Results 276 - 300 of 2626) sorted by null

<<11121314151617181920>>

  /external/bluetooth/glib/gio/tests/
memory-input-stream.c 35 gsize bytes_read, pos, len, chunk_size; local
50 pos = 0;
51 while (pos < len)
55 g_assert_cmpint (bytes_read, ==, MIN (chunk_size, len - pos));
56 g_assert (strncmp (buffer, result + pos, bytes_read) == 0);
58 pos += bytes_read;
61 g_assert_cmpint (pos, ==, len);
memory-output-stream.c 61 int pos; local
68 pos = g_memory_output_stream_get_data_size (G_MEMORY_OUTPUT_STREAM (mo));
69 g_assert_cmpint (pos, ==, 1);
72 pos = g_seekable_tell (G_SEEKABLE (mo));
73 g_assert_cmpint (pos, ==, 1);
78 pos = g_seekable_tell (G_SEEKABLE (mo));
79 g_assert_cmpint (pos, ==, 0);
81 pos = g_memory_output_stream_get_data_size (G_MEMORY_OUTPUT_STREAM (mo));
82 g_assert_cmpint (pos, ==, 1);
  /external/icu4c/test/intltest/
trnserr.cpp 62 UTransPosition pos; local
69 pos.contextLimit = 0;
70 pos.contextStart = 0;
71 pos.limit = 0;
72 pos.start = 0;
88 pos.start = 100;
89 pos.limit = testString.length();
90 t->transliterate(testString, pos, status);
95 pos.limit = 100;
96 pos.start = 0
    [all...]
  /external/iproute2/lib/
dnet_pton.c 44 int pos; local
46 pos = dnet_num(src, &area);
47 if ((pos == 0) || (area > 63) || (*(src + pos) != '.'))
49 pos = dnet_num(src + pos + 1, &node);
50 if ((pos == 0) || (node > 1023))
  /external/javassist/src/main/javassist/bytecode/
ByteStream.java 99 int pos = count; local
103 buffer[pos++] = (byte)(sLen >>> 8);
104 buffer[pos++] = (byte)sLen;
108 buffer[pos++] = (byte)c;
115 count = pos;
133 int pos = count; local
135 buffer[pos] = (byte)(size >>> 8);
136 buffer[pos + 1] = (byte)size;
137 pos += 2 + offset;
141 buffer[pos++] = (byte) c
    [all...]
  /external/qemu/android/
audio-test.c 25 int pos; member in struct:__anon9348
34 //printf("%s: pos=%d free=%d\n", __FUNCTION__, ta->pos, free);
37 int avail = SAMPLE_SIZE - ta->pos;
41 AUD_write(ta->voice, ta->sample + ta->pos, avail);
42 ta->pos += avail;
43 if (ta->pos >= SAMPLE_SIZE)
44 ta->pos = 0;
74 ta->pos = 0;
  /external/srec/seti/setiUtils/src/
platform_utils.c 48 char *pos; local
56 pos = input_str;
60 if (*pos == seps[j]) {
70 pos++;
78 if (pos[k-i] == seps[j]) {
80 return pos;
87 return pos;
  /external/wpa_supplicant/
driver_ndis_.c 53 u8 *pos, *data = NULL; local
61 pos = buf + sizeof(int);
64 if (buf + len - pos > 2) {
65 data_len = (int) *pos++ << 8;
66 data_len += *pos++;
67 if (data_len > (size_t) (buf + len - pos)) {
71 data = pos;
  /external/wpa_supplicant_6/wpa_supplicant/src/drivers/
driver_ndis_.c 50 u8 *pos, *data = NULL; local
58 pos = buf + sizeof(int);
61 if (buf + len - pos > 2) {
62 data_len = (int) *pos++ << 8;
63 data_len += *pos++;
64 if (data_len > (size_t) (buf + len - pos)) {
68 data = pos;
  /external/wpa_supplicant_6/wpa_supplicant/src/eap_common/
eap_peap_common.c 26 size_t pos, plen; local
74 pos = 0;
75 while (pos < buf_len) {
77 plen = buf_len - pos;
80 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN);
81 pos += SHA1_MAC_LEN;
83 os_memcpy(&buf[pos], hash, plen);
  /external/wpa_supplicant_8/src/crypto/
sha1-tprf.c 39 size_t pos, plen; local
59 pos = 0;
60 while (pos < buf_len) {
62 plen = buf_len - pos;
66 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN);
67 pos += SHA1_MAC_LEN;
69 os_memcpy(&buf[pos], hash, plen);
  /external/wpa_supplicant_8/src/drivers/
driver_ndis_.c 50 u8 *pos, *data = NULL; local
58 pos = buf + sizeof(int);
61 if (buf + len - pos > 2) {
62 data_len = (int) *pos++ << 8;
63 data_len += *pos++;
64 if (data_len > (size_t) (buf + len - pos)) {
68 data = pos;
  /external/wpa_supplicant_8/src/eap_common/
eap_peap_common.c 26 size_t pos, plen; local
74 pos = 0;
75 while (pos < buf_len) {
77 plen = buf_len - pos;
80 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN);
81 pos += SHA1_MAC_LEN;
83 os_memcpy(&buf[pos], hash, plen);
  /external/wpa_supplicant_8/src/ap/
beacon.c 105 static u8 * hostapd_eid_country_add(u8 *pos, u8 *end, int chan_spacing,
109 if (end - pos < 3)
110 return pos;
113 *pos++ = start->chan;
115 *pos++ = (prev->chan - start->chan) / chan_spacing + 1;
117 *pos++ = start->max_tx_power;
119 return pos;
126 u8 *pos = eid; local
137 *pos++ = WLAN_EID_COUNTRY;
138 pos++; /* length will be set later *
206 u8 *pos, *epos; local
398 u8 *pos, *tail, *tailpos; local
    [all...]
  /external/icu4c/common/
unisetspan.cpp 645 int32_t pos=spanLength, rest=length-pos; local
658 // Try to match this string at pos-overlap..pos.
673 if(!offsets.containsOffset(inc) && matches16CPB(s, pos-overlap, length, s16, length16)) {
697 // Try to match this string at pos-overlap..pos.
713 matches16CPB(s, pos-overlap, length, s16, length16)
727 pos+=maxInc;
736 // Finished trying to match all strings at pos
794 int32_t pos=spanSet.spanBack(s, length, USET_SPAN_CONTAINED); local
967 int32_t pos=spanLength, rest=length-pos; local
1136 int32_t pos=spanSet.spanBackUTF8((const char *)s, length, USET_SPAN_CONTAINED); local
1338 int32_t pos=0, rest=length; local
1380 int32_t pos=length; local
1422 int32_t pos=0, rest=length; local
1467 int32_t pos=length; local
    [all...]
  /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
DTMTreeWalker.java 102 * @param pos Node in the tree at which to start (and end) traversal --
106 public void traverse(int pos) throws org.xml.sax.SAXException
108 // %REVIEW% Why isn't this just traverse(pos,pos)?
110 int top = pos; // Remember the root of this subtree
112 while (DTM.NULL != pos)
114 startNode(pos);
115 int nextNode = m_dtm.getFirstChild(pos);
118 endNode(pos);
120 if (top == pos)
    [all...]
  /external/chromium/crypto/
rsa_private_key_win.cc 149 uint8* pos = blob.get(); local
150 PUBLICKEYSTRUC *publickey_struct = reinterpret_cast<PUBLICKEYSTRUC*>(pos);
151 pos += sizeof(PUBLICKEYSTRUC);
153 RSAPUBKEY *rsa_pub_key = reinterpret_cast<RSAPUBKEY*>(pos);
154 pos += sizeof(RSAPUBKEY);
161 pki.modulus()->assign(pos, pos + mod_size);
162 pos += mod_size;
164 pki.prime1()->assign(pos, pos + primes_size)
    [all...]
  /external/webkit/Source/WebCore/storage/
IDBPendingTransactionMonitor.cpp 48 size_t pos = m_transactions->find(transaction);
49 if (pos == notFound)
52 m_transactions->remove(pos);
  /external/webkit/Source/WebCore/svg/
SVGElementInstanceList.cpp 47 unsigned pos = 0; local
49 while (instance && pos < index) {
51 pos++;
  /external/wpa_supplicant_8/src/tls/
tlsv1_cred.c 99 const u8 *pos, *end; local
103 pos = search_tag(pem_cert_begin, buf, len);
104 if (!pos) {
113 while (pos) {
114 pos += os_strlen(pem_cert_begin);
115 end = search_tag(pem_cert_end, pos, buf + len - pos);
122 der = base64_decode(pos, end - pos, &der_len);
139 pos = search_tag(pem_cert_begin, end, buf + len - end)
220 const u8 *pos, *end; local
254 const u8 *pos, *end; local
343 const u8 *pos, *end; local
420 const u8 *pos, *end; local
    [all...]
  /external/wpa_supplicant_8/src/utils/
common.c 106 const char *pos = txt; local
111 while (*pos == ':' || *pos == '.' || *pos == '-')
112 pos++;
114 a = hex2num(*pos++);
117 b = hex2num(*pos++);
123 return pos - txt;
164 int pos = len - 1; local
165 while (pos >= 0)
197 char *pos = buf, *end = buf + buf_size; local
370 char *pos; local
    [all...]
wpabuf.h 110 u8 *pos = wpabuf_put(buf, 1); local
111 *pos = data;
116 u8 *pos = wpabuf_put(buf, 2); local
117 WPA_PUT_LE16(pos, data);
122 u8 *pos = wpabuf_put(buf, 4); local
123 WPA_PUT_LE32(pos, data);
128 u8 *pos = wpabuf_put(buf, 2); local
129 WPA_PUT_BE16(pos, data);
134 u8 *pos = wpabuf_put(buf, 3); local
135 WPA_PUT_BE24(pos, data)
140 u8 *pos = wpabuf_put(buf, 4); local
    [all...]
  /libcore/luni/src/main/java/java/text/
ParsePosition.java 56 ParsePosition pos = (ParsePosition) object; local
57 return currentPosition == pos.currentPosition
58 && errorIndex == pos.errorIndex;
  /libcore/luni/src/test/java/tests/api/javax/net/ssl/
SSLEngineResultTest.java 95 int[] pos = { 0, 1, 1000, Integer.MAX_VALUE, (Integer.MAX_VALUE - 1) }; local
102 for (int n = 0; n < pos.length; n++) {
103 for (int l = 0; l < pos.length; l++) {
105 enHS[j], pos[n], pos[l]);
106 assertEquals("Incorrect bytesConsumed", pos[n],
118 int[] pos = { 0, 1, 1000, Integer.MAX_VALUE, (Integer.MAX_VALUE - 1) }; local
125 for (int n = 0; n < pos.length; n++) {
126 for (int l = 0; l < pos.length; ++l) {
128 enHS[j], pos[n], pos[l])
141 int[] pos = { 0, 1, 1000, Integer.MAX_VALUE, (Integer.MAX_VALUE - 1) }; local
164 int[] pos = { 0, 1, 1000, Integer.MAX_VALUE, (Integer.MAX_VALUE - 1) }; local
187 int[] pos = { 0, 1, 1000, Integer.MAX_VALUE, (Integer.MAX_VALUE - 1) }; local
    [all...]
  /packages/apps/QuickSearchBox/src/com/android/quicksearchbox/
LevenshteinSuggestionFormatter.java 100 int pos = 0; local
106 while (pos < len) {
107 while (pos < len && (chars[pos] == ' ' || chars[pos] == '\t')) {
108 pos++;
110 int start = pos;
111 while (pos < len && !(chars[pos] == ' ' || chars[pos] == '\t'))
    [all...]

Completed in 518 milliseconds

<<11121314151617181920>>