HomeSort by relevance Sort by last modified time
    Searched defs:pos (Results 101 - 125 of 4019) sorted by null

1 2 3 45 6 7 8 91011>>

  /external/wpa_supplicant_8/wpa_supplicant/
nfc_pw_token.c 21 const u8 *pos; local
28 pos = wpabuf_head(buf);
31 printf("%02X", *pos++);
  /frameworks/av/media/libstagefright/codecs/amrwb/src/
dec_acelp_4p_in_64.cpp 123 void add_pulses(int16 pos[], int16 nb_pulse, int16 track, int16 code[]);
160 int16 k, pos[6]; local
173 dec_1p_N1(L_index, 4, 0, pos);
174 add_pulses(pos, 1, k, code);
182 dec_2p_2N1(L_index, 4, 0, pos);
183 add_pulses(pos, 2, k, code);
190 dec_3p_3N1(L_index, 4, 0, pos);
191 add_pulses(pos, 3, k, code);
196 dec_2p_2N1(L_index, 4, 0, pos);
197 add_pulses(pos, 2, k, code)
    [all...]
  /frameworks/compile/mclinker/lib/Core/
GeneralOptions.cpp 72 size_t pos = pName.find_last_of(sys::fs::separator); local
73 if (std::string::npos == pos)
76 m_SOName = pName.substr(pos + 1);
  /hardware/bsp/intel/peripheral/libupm/examples/c++/
lpd8806.cxx 70 int i, j, pos, dir; local
72 pos = 0;
76 // Draw 5 pixels centered on pos. setPixelColor() will clip
80 sensor->setPixelColor(pos - 2, r/4, g/4, b/4);
81 sensor->setPixelColor(pos - 1, r/2, g/2, b/2);
82 sensor->setPixelColor(pos, r, g, b);
83 sensor->setPixelColor(pos + 1, r/2, g/2, b/2);
84 sensor->setPixelColor(pos + 2, r/4, g/4, b/4);
92 sensor->setPixelColor(pos+j, 0,0,0);
95 pos += dir
    [all...]
  /libcore/luni/src/test/java/libcore/java/io/
InputStreamReaderTest.java 33 PipedOutputStream pos = new PipedOutputStream(pin); local
34 pos.write("hello".getBytes("UTF-8"));
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/strings/basic.string/string.ops/string_rfind/
pointer_size.pass.cpp 12 // size_type rfind(const charT* s, size_type pos = npos) const;
21 test(const S& s, const typename S::value_type* str, typename S::size_type pos,
24 assert(s.rfind(str, pos) == x);
28 assert(x <= pos && x + n <= s.size());
39 typename S::size_type pos = s.size(); local
41 assert(x <= pos && x + n <= s.size());
  /packages/inputmethods/LatinIME/native/jni/tests/dictionary/utils/
buffer_with_extendable_buffer_test.cpp 28 int pos = 0; local
31 EXPECT_TRUE(buffer.writeUint(data_1, 1 /* size */, pos));
32 EXPECT_EQ(data_1, buffer.readUint(1, pos));
33 pos += 1;
36 EXPECT_TRUE(buffer.writeUint(data_2, 2 /* size */, pos));
37 EXPECT_EQ(data_2, buffer.readUint(2, pos));
38 pos += 2;
41 EXPECT_TRUE(buffer.writeUint(data_3, 3 /* size */, pos));
42 EXPECT_EQ(data_3, buffer.readUint(3, pos));
43 pos += 3
85 int pos = 0; local
    [all...]
byte_array_utils_test.cpp 29 int pos = 0; local
31 EXPECT_EQ(0x6f, ByteArrayUtils::readCodePointAndAdvancePosition(buffer, codePointTable, &pos));
33 EXPECT_EQ(0x6b, ByteArrayUtils::readCodePointAndAdvancePosition(buffer, codePointTable, &pos));
36 EXPECT_EQ(0x100, ByteArrayUtils::readCodePointAndAdvancePosition(buffer, codePointTable, &pos));
53 int pos = 0; local
54 EXPECT_EQ(0x18A00, ByteArrayUtils::readSint24AndAdvancePosition(buffer, &pos));
55 pos = 1;
56 EXPECT_EQ(-0xA00AA, ByteArrayUtils::readSint24AndAdvancePosition(buffer, &pos));
62 int pos = 0; local
64 ByteArrayUtils::writeUintAndAdvancePosition(buffer, data_1B, 1, &pos);
81 int pos = 0; local
95 int pos = 0; local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/gp_hash_table_map_/
insert_no_store_hash_fn_imps.hpp 57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e);
59 entry* const p_e = m_entries + pos;
66 return (ins_pos == m_num_e) ? pos : ins_pos;
71 ins_pos = pos;
78 return pos;
99 const size_type pos = find_ins_pos(r_key, local
102 if (m_entries[pos].m_stat == valid_entry_status)
105 return std::make_pair(&(m_entries + pos)->m_value, false);
109 return std::make_pair(insert_new_imp(r_val, pos), true)
    [all...]
insert_store_hash_fn_imps.hpp 59 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i); local
61 entry* const p_e = m_entries + pos;
70 std::make_pair(pos, pos_hash_pair.second) :
76 ins_pos = pos;
84 return std::make_pair(pos, pos_hash_pair.second);
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/ext/pb_ds/detail/gp_hash_table_map_/
insert_no_store_hash_fn_imps.hpp 57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e);
59 entry* const p_e = m_entries + pos;
66 return (ins_pos == m_num_e) ? pos : ins_pos;
71 ins_pos = pos;
78 return pos;
99 const size_type pos = find_ins_pos(r_key, local
102 if (m_entries[pos].m_stat == valid_entry_status)
105 return std::make_pair(&(m_entries + pos)->m_value, false);
109 return std::make_pair(insert_new_imp(r_val, pos), true)
    [all...]
insert_store_hash_fn_imps.hpp 59 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i); local
61 entry* const p_e = m_entries + pos;
70 std::make_pair(pos, pos_hash_pair.second) :
76 ins_pos = pos;
84 return std::make_pair(pos, pos_hash_pair.second);
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/gp_hash_table_map_/
insert_no_store_hash_fn_imps.hpp 57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e);
59 entry* const p_e = m_entries + pos;
66 return (ins_pos == m_num_e) ? pos : ins_pos;
71 ins_pos = pos;
78 return pos;
99 const size_type pos = find_ins_pos(r_key, local
102 if (m_entries[pos].m_stat == valid_entry_status)
105 return std::make_pair(&(m_entries + pos)->m_value, false);
109 return std::make_pair(insert_new_imp(r_val, pos), true)
    [all...]
insert_store_hash_fn_imps.hpp 59 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i); local
61 entry* const p_e = m_entries + pos;
70 std::make_pair(pos, pos_hash_pair.second) :
76 ins_pos = pos;
84 return std::make_pair(pos, pos_hash_pair.second);
  /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/gp_hash_table_map_/
insert_no_store_hash_fn_imps.hpp 57 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i); local
58 _GLIBCXX_DEBUG_ASSERT(pos < m_num_e);
59 entry* const p_e = m_entries + pos;
66 return (ins_pos == m_num_e) ? pos : ins_pos;
71 ins_pos = pos;
78 return pos;
99 const size_type pos = find_ins_pos(r_key, local
102 if (m_entries[pos].m_stat == valid_entry_status)
105 return std::make_pair(&(m_entries + pos)->m_value, false);
109 return std::make_pair(insert_new_imp(r_val, pos), true)
    [all...]
insert_store_hash_fn_imps.hpp 59 const size_type pos = ranged_probe_fn_base::operator()(r_key, pos_hash_pair.second, i); local
61 entry* const p_e = m_entries + pos;
70 std::make_pair(pos, pos_hash_pair.second) :
76 ins_pos = pos;
84 return std::make_pair(pos, pos_hash_pair.second);
  /bionic/libc/dns/net/
base64.c 222 char *pos; local
237 pos = strchr(Base64, ch);
238 if (pos == 0) /* A non-base64 character. */
246 target[tarindex] = (pos - Base64) << 2;
255 (u_int32_t)(pos - Base64) >> 4;
256 target[tarindex+1] = ((pos - Base64) & 0x0f)
267 (u_int32_t)(pos - Base64) >> 2;
268 target[tarindex+1] = ((pos - Base64) & 0x03)
278 target[tarindex] |= (pos - Base64);
  /device/google/contexthub/firmware/src/cpu/x86/
atomicBitset.c 63 uint32_t pos, i, numWords = (set->numBits + 31) / 32; local
74 pos = __builtin_ctz(~old); /* This will allocate in diff order than ARM. Since we never made any promises on order of bits returned, this is ok */
75 new = old | (1 << pos);
78 return 32 * i + pos;
  /device/huawei/angler/camera/QCamera2/stack/common/
cam_queue.h 75 struct cam_list *pos = NULL; local
79 pos = head->next;
80 if (pos != head) {
81 node = member_of(pos, cam_node_t, list);
99 struct cam_list *pos = NULL; local
103 pos = head->next;
105 while(pos != head) {
106 node = member_of(pos, cam_node_t, list);
107 pos = pos->next
    [all...]
  /device/huawei/angler/camera/QCamera2/stack/mm-camera-test/src/
mm_qcamera_queue.c 111 struct cam_list *pos = NULL; local
116 pos = head->next;
118 pos = head->prev;
120 if (pos != head) {
121 node = member_of(pos, camera_q_node, list);
139 struct cam_list *pos = NULL; local
147 pos = head->next;
149 while(pos != head) {
150 node = member_of(pos, camera_q_node, list);
151 pos = pos->next
    [all...]
  /device/huawei/angler/camera/QCamera2/stack/mm-jpeg-interface/src/
mm_jpeg_queue.c 66 struct cam_list *pos = NULL; local
78 pos = head->next;
81 cam_list_insert_before_node(&node->list, pos);
93 struct cam_list *pos = NULL; local
99 pos = head->next;
100 if (pos != head) {
101 node = member_of(pos, mm_jpeg_q_node_t, list);
138 struct cam_list *pos = NULL; local
142 pos = head->next;
144 while(pos != head)
167 struct cam_list *pos = NULL; local
    [all...]
  /device/lge/bullhead/camera/QCamera2/stack/common/
cam_queue.h 75 struct cam_list *pos = NULL; local
79 pos = head->next;
80 if (pos != head) {
81 node = member_of(pos, cam_node_t, list);
99 struct cam_list *pos = NULL; local
103 pos = head->next;
105 while(pos != head) {
106 node = member_of(pos, cam_node_t, list);
107 pos = pos->next
    [all...]
  /device/lge/bullhead/camera/QCamera2/stack/mm-camera-test/src/
mm_qcamera_queue.c 111 struct cam_list *pos = NULL; local
116 pos = head->next;
118 pos = head->prev;
120 if (pos != head) {
121 node = member_of(pos, camera_q_node, list);
139 struct cam_list *pos = NULL; local
147 pos = head->next;
149 while(pos != head) {
150 node = member_of(pos, camera_q_node, list);
151 pos = pos->next
    [all...]
  /device/lge/bullhead/camera/QCamera2/stack/mm-jpeg-interface/src/
mm_jpeg_queue.c 66 struct cam_list *pos = NULL; local
78 pos = head->next;
81 cam_list_insert_before_node(&node->list, pos);
93 struct cam_list *pos = NULL; local
99 pos = head->next;
100 if (pos != head) {
101 node = member_of(pos, mm_jpeg_q_node_t, list);
138 struct cam_list *pos = NULL; local
142 pos = head->next;
144 while(pos != head)
167 struct cam_list *pos = NULL; local
    [all...]
  /device/moto/shamu/camera/QCamera/stack/mm-jpeg-interface/src/
mm_jpeg_queue.c 69 struct cam_list *pos = NULL; local
73 pos = head->next;
74 if (pos != head) {
75 node = member_of(pos, mm_jpeg_q_node_t, list);
90 struct cam_list *pos = NULL; local
94 pos = head->next;
95 if (pos != head) {
96 node = member_of(pos, mm_jpeg_q_node_t, list);
134 struct cam_list *pos = NULL; local
138 pos = head->next
    [all...]

Completed in 800 milliseconds

1 2 3 45 6 7 8 91011>>