Searched refs:idx (Results 1 - 25 of 759) sorted by relevance

1234567891011>>

/external/iptables/include/linux/netfilter/
H A Dxt_TCPOPTSTRIP.h4 #define tcpoptstrip_set_bit(bmap, idx) \
5 (bmap[(idx) >> 5] |= 1U << (idx & 31))
6 #define tcpoptstrip_test_bit(bmap, idx) \
7 (((1U << (idx & 31)) & bmap[(idx) >> 5]) != 0)
/external/clang/lib/Index/
H A DIndexProvider.cpp17 using namespace idx;
H A DHandlers.cpp17 using namespace idx;
/external/dropbear/libtomcrypt/src/misc/crypt/
H A Dcrypt_cipher_is_valid.c20 @param idx The index of the cipher to search for
23 int cipher_is_valid(int idx) argument
26 if (idx < 0 || idx >= TAB_SIZE || cipher_descriptor[idx].name == NULL) {
H A Dcrypt_hash_is_valid.c20 @param idx The index of the hash to search for
23 int hash_is_valid(int idx) argument
26 if (idx < 0 || idx >= TAB_SIZE || hash_descriptor[idx].name == NULL) {
H A Dcrypt_prng_is_valid.c20 @param idx The index of the PRNG to search for
23 int prng_is_valid(int idx) argument
26 if (idx < 0 || idx >= TAB_SIZE || prng_descriptor[idx].name == NULL) {
/external/tcpdump/
H A Dprint-sip.c38 u_int idx; local
46 for (idx = 0; idx < len; idx++) {
47 if (EXTRACT_16BITS(pptr+idx) != 0x0d0a) { /* linefeed ? */
48 safeputchar(*(pptr+idx));
51 idx+=1;
/external/iproute2/include/
H A Dll_map.h8 extern const char *ll_index_to_name(unsigned idx);
9 extern const char *ll_idx_n2a(unsigned idx, char *buf);
10 extern int ll_index_to_type(unsigned idx);
11 extern unsigned ll_index_to_flags(unsigned idx);
12 extern unsigned ll_index_to_addr(unsigned idx, unsigned char *addr,
/external/v8/test/mjsunit/regress/
H A Dregress-732.js28 // idx is a valid array index but is too big to be cached in hash field.
29 var idx = 10000000; variable
36 obj[idx] = "obj" + idx;
39 var str = "" + idx;
46 assertEquals(obj[str], obj[idx])
H A Dsplice-missing-wb.js34 for (var i = 0; i < a.length; i++) a[i] = {idx:i};
42 a[0] = {idx:0};
52 // Try accessing a[0].idx. It will segfault if write-barrier was accidentally
54 assertEquals(0, a[0].idx);
55 assertEquals(1, a[1].idx);
56 assertEquals(202, a[2].idx);
/external/elfutils/libdw/
H A Ddwarf_filesrc.c23 dwarf_filesrc (Dwarf_Files *file, size_t idx, Dwarf_Word *mtime, argument
26 if (file == NULL || idx >= file->nfiles)
30 *mtime = file->info[idx].mtime;
33 *length = file->info[idx].length;
35 return file->info[idx].name;
H A Ddwarf_onearange.c23 dwarf_onearange (Dwarf_Aranges *aranges, size_t idx) argument
28 if (idx >= aranges->naranges)
34 return &aranges->info[idx];
H A Ddwarf_onesrcline.c23 dwarf_onesrcline (Dwarf_Lines *lines, size_t idx) argument
28 if (idx >= lines->nlines)
34 return &lines->info[idx];
/external/srtp/test/
H A Dreplay_driver.c89 rdb_check_add(rdb_t *rdb, uint32_t idx) { argument
91 if (rdb_check(rdb, idx) != err_status_ok) {
92 printf("rdb_check failed at index %u\n", idx);
95 if (rdb_add_index(rdb, idx) != err_status_ok) {
96 printf("rdb_add_index failed at index %u\n", idx);
104 rdb_check_expect_failure(rdb_t *rdb, uint32_t idx) { argument
107 err = rdb_check(rdb, idx);
109 printf("rdb_check failed at index %u (false positive)\n", idx);
117 rdb_check_unordered(rdb_t *rdb, uint32_t idx) { argument
120 /* printf("index: %u\n", idx); */
132 uint32_t idx, ircvd; local
[all...]
H A Drdbx_driver.c142 * rdbx_check_add(rdbx, idx) checks a known-to-be-good idx against
150 rdbx_check_add(rdbx_t *rdbx, uint32_t idx) { argument
154 delta = index_guess(&rdbx->index, &est, idx);
157 printf("replay_check failed at index %u\n", idx);
162 * in practice, we'd authenticate the packet containing idx, using
167 printf("rdbx_add_index failed at index %u\n", idx);
175 * rdbx_check_expect_failure(rdbx_t *rdbx, uint32_t idx)
177 * checks that a sequence number idx is in the replay database
182 rdbx_check_expect_failure(rdbx_t *rdbx, uint32_t idx) { argument
200 rdbx_check_unordered(rdbx_t *rdbx, uint32_t idx) argument
214 uint32_t idx, ircvd; local
[all...]
/external/elfutils/lib/
H A Ddynamicsizehash.c38 size_t idx = 1 + hval % htab->size; local
40 if (htab->table[idx].hashval != 0)
44 if (htab->table[idx].hashval == hval
45 && COMPARE (htab->table[idx].data, val) == 0)
46 return idx;
53 if (idx <= hash)
54 idx = htab->size + idx - hash;
56 idx -= hash;
59 if (htab->table[idx]
70 insert_entry_2(NAME *htab, unsigned long int hval, size_t idx, TYPE data) argument
205 size_t idx; local
232 size_t idx; local
255 size_t idx; local
[all...]
/external/bluetooth/glib/gio/fen/
H A Dfen-missing.c51 GList *idx = NULL; local
57 for (idx = missing_list; idx; idx = idx->next) {
58 f = (fdata*)idx->data;
63 existing_list = g_list_prepend (existing_list, idx);
67 for (idx = existing_list; idx; idx
90 GList *idx; local
[all...]
/external/ipsec-tools/src/racoon/
H A Dpolicy.h118 #define KEY_SETSECSPIDX(_dir, s, d, ps, pd, ulp, _priority, _created, idx) \
120 bzero((idx), sizeof(struct policyindex)); \
121 (idx)->dir = (_dir); \
122 (idx)->prefs = (ps); \
123 (idx)->prefd = (pd); \
124 (idx)->ul_proto = (ulp); \
125 (idx)->priority = (_priority); \
126 (idx)->created = (_created); \
127 memcpy(&(idx)->src, (s), sysdep_sa_len((struct sockaddr *)(s))); \
128 memcpy(&(idx)
[all...]
/external/elfutils/src/
H A Dxelf.h51 # define xelf_getphdr(elf, idx, name) name = elf32_getphdr (elf) + idx
52 # define xelf_getphdr_ptr(elf, idx, name) name = elf32_getphdr (elf) + idx
53 # define xelf_update_phdr(elf, idx, phdr) \
54 /* nothing */ ((void) (elf), (void) (idx), (void) (phdr), 1)
64 # define xelf_getsym(data, idx, name) \
65 name = &((Elf32_Sym *) (data)->d_buf)[idx]
66 # define xelf_getsym_ptr(data, idx, name) \
67 name = &((Elf32_Sym *) (data)->d_buf)[idx]
[all...]
/external/clang/include/clang/Index/
H A DGlobalSelector.h24 namespace idx { namespace in namespace:clang
70 } // namespace idx
78 struct DenseMapInfo<clang::idx::GlobalSelector> {
79 static inline clang::idx::GlobalSelector getEmptyKey() {
80 return clang::idx::GlobalSelector::getEmptyMarker();
83 static inline clang::idx::GlobalSelector getTombstoneKey() {
84 return clang::idx::GlobalSelector::getTombstoneMarker();
87 static unsigned getHashValue(clang::idx::GlobalSelector);
90 isEqual(clang::idx::GlobalSelector LHS, clang::idx
[all...]
/external/valgrind/tsan/
H A Dts_simple_cache.h48 size_t idx = ptr % kSize; local
49 arr_[idx] = ptr;
51 bits_[idx / 32] |= 1U << (idx % 32);
53 bits_[idx / 32] &= ~(1U << (idx % 32));
57 size_t idx = ptr % kSize; local
58 if (arr_[idx] == ptr) {
59 *val = (bits_[idx / 32] >> (idx
102 uint32_t idx(uint32_t a, uint32_t b) { function in class:IntPairToBoolCache
[all...]
/external/chromium/chrome/browser/importer/
H A Dmork_reader.cc129 size_t idx = 0; local
131 while (idx < len && line[idx] == ' ')
132 ++idx;
133 if (idx >= len)
137 if (StartsWithASCII(&line[idx], "< <(a=c)>", true)) {
140 ParseMap(line, idx, &column_name_map);
155 } else if (StartsWithASCII(&line[idx], "<(", true)) {
157 ParseMap(line, idx, &value_map_);
158 } else if (line[idx]
180 size_t idx = start_index; local
258 size_t idx = start_index; local
[all...]
/external/iproute2/lib/
H A Dll_map.c91 const char *ll_idx_n2a(unsigned idx, char *buf) argument
95 if (idx == 0)
97 for (im = idxmap[idx&0xF]; im; im = im->next)
98 if (im->index == idx)
100 snprintf(buf, 16, "if%d", idx);
105 const char *ll_index_to_name(unsigned idx) argument
109 return ll_idx_n2a(idx, nbuf);
112 int ll_index_to_type(unsigned idx) argument
116 if (idx == 0)
118 for (im = idxmap[idx
124 ll_index_to_flags(unsigned idx) argument
137 ll_index_to_addr(unsigned idx, unsigned char *addr, unsigned alen) argument
164 unsigned idx; local
[all...]
/external/llvm/lib/DebugInfo/
H A DDWARFAbbreviationDeclaration.h35 uint16_t getAttrByIndex(uint32_t idx) const {
36 return Attributes.size() > idx ? Attributes[idx].getAttribute() : 0;
38 uint16_t getFormByIndex(uint32_t idx) const {
39 return Attributes.size() > idx ? Attributes[idx].getForm() : 0;
/external/dropbear/libtomcrypt/src/pk/ecc/
H A Decc_get_size.c34 if (ltc_ecc_is_valid_idx(key->idx))

Completed in 1481 milliseconds

1234567891011>>