| /external/ImageMagick/MagickCore/ |
| D | thread.c | 96 **keys; in CreateMagickThreadKey()
98 keys=(MagickThreadValue **) key; in CreateMagickThreadKey()
99 *keys=(MagickThreadValue *) AcquireQuantumMemory(1,sizeof(*keys)); in CreateMagickThreadKey()
100 if (*keys != (MagickThreadValue *) NULL) in CreateMagickThreadKey()
102 (*keys)->number_threads=GetOpenMPMaximumThreads(); in CreateMagickThreadKey()
103 (*keys)->values=AcquireQuantumMemory((*keys)->number_threads, in CreateMagickThreadKey()
105 if ((*keys)->values == (void *) NULL) in CreateMagickThreadKey()
106 *keys=RelinquishMagickMemory(*keys); in CreateMagickThreadKey()
108 (void) memset((*keys)->values,0,(*keys)->number_threads* in CreateMagickThreadKey()
110 (*keys)->destructor=destructor; in CreateMagickThreadKey()
[all …]
|
| /external/libcxx/test/libcxx/localization/locale.categories/ |
| D | __scan_keyword.pass.cpp | 49 std::string keys[] = {"a", "abb"}; in main() local
52 keys, keys+sizeof(keys)/sizeof(keys[0]), in main()
54 assert(k - keys == 0); in main()
61 std::string keys[] = {"a", "abb"}; in main() local
64 keys, keys+sizeof(keys)/sizeof(keys[0]), in main()
66 assert(k - keys == 2); in main()
73 std::string keys[] = {"a", "abb"}; in main() local
76 keys, keys+sizeof(keys)/sizeof(keys[0]), in main()
78 assert(k - keys == 1); in main()
85 std::string keys[] = {"Mon", "Monday", "Tue", "Tuesday"}; in main() local
[all …]
|
| /external/wpa_supplicant_8/src/eap_common/ |
| D | ikev2_common.c | 371 struct ikev2_keys *keys, int initiator, in ikev2_derive_auth_data() argument
380 const u8 *SK_p = initiator ? keys->SK_pi : keys->SK_pr; in ikev2_derive_auth_data()
394 if (ikev2_prf_hash(prf->id, SK_p, keys->SK_prf_len, in ikev2_derive_auth_data()
429 struct ikev2_keys *keys, int initiator, in ikev2_decrypt_payload() argument
440 const u8 *SK_e = initiator ? keys->SK_ei : keys->SK_er; in ikev2_decrypt_payload()
441 const u8 *SK_a = initiator ? keys->SK_ai : keys->SK_ar; in ikev2_decrypt_payload()
476 if (ikev2_integ_hash(integ_id, SK_a, keys->SK_integ_len, in ikev2_decrypt_payload()
499 if (ikev2_encr_decrypt(encr_alg->id, SK_e, keys->SK_encr_len, iv, pos, in ikev2_decrypt_payload()
530 int ikev2_build_encrypted(int encr_id, int integ_id, struct ikev2_keys *keys, in ikev2_build_encrypted() argument
540 const u8 *SK_e = initiator ? keys->SK_ei : keys->SK_er; in ikev2_build_encrypted()
[all …]
|
| /external/r8/src/main/java/com/android/tools/r8/ir/code/ |
| D | Switch.java | 18 private final int[] keys; field in Switch
24 int[] keys, in Switch() argument
28 this.keys = keys; in Switch()
35 assert keys.length <= Constants.U16BIT_MAX; in valid()
37 assert keys.length == targetBlockIndices.length; in valid()
38 for (int i = 1; i < keys.length - 1; i++) { in valid()
39 assert keys[i - 1] < keys[i]; in valid()
42 assert targetBlockIndices[keys.length - 1] != fallthroughBlockIndex; in valid()
52 return ((long) keys[keys.length - 1]) - ((long) keys[0]) + 1;
73 return (keys.length * 4) + 2;
[all …]
|
| /external/ltp/pan/ |
| D | tag_report.c | 109 int cuts_report(SYM tags, SYM keys, char *at, char *tag) in cuts_report() argument
187 (char *)Data.data, keys); in cuts_report()
193 test_result(tag, "*", "*", result, keys); in cuts_report()
196 test_result(tag, "-", "-", "TC count wrong", keys); in cuts_report()
225 int tag_report(SYM alltags, SYM ctag, SYM keys) in tag_report() argument
239 if ((tag = (char *)sym_get(keys, key_get)) == NULL) { in tag_report()
245 if ((is = (char *)sym_get(keys, key_get)) == NULL) { in tag_report()
246 test_result(tag, NULL, NULL, "no init status", keys); in tag_report()
251 test_result(tag, NULL, NULL, is, keys); in tag_report()
255 if ((info = (char *)sym_get(keys, key_get)) != NULL) in tag_report()
[all …]
|
| D | scan.l | 72 SYM keys=NULL; /* stored keywords */ variable
108 if(keys != NULL)
109 sym_rm(keys, RM_KEY | RM_DATA);
111 keys = sym_open(0, 0, 0);
123 sym_dump_s(keys, 0);
131 sym_put(alltags, "_RTS", (void *)keys, PUT_REPLACE);
132 keys = NULL;
149 if(keys != NULL)
150 sym_rm(keys, RM_KEY | RM_DATA);
151 keys = sym_open(0, 0, 0);
[all …]
|
| D | symbol.c | 196 const char **keys; /* key split into a 2d string array */ in sym_put() local
206 keys = splitstr(key, ",", NULL); in sym_put()
208 if (keys == NULL) { in sym_put()
213 for (kk = (char **)keys, csym = sym; in sym_put()
222 splitstr_free(keys); in sym_put()
227 splitstr_free(keys); in sym_put()
234 splitstr_free(keys); in sym_put()
255 splitstr_free(keys); in sym_put()
268 const char **keys; /* key split into a 2d string array */ in sym_get() local
277 keys = splitstr(nkey, ",", NULL); in sym_get()
[all …]
|
| /external/r8/src/main/java/com/android/tools/r8/code/ |
| D | SparseSwitchPayload.java | 15 public final int[] keys; field in SparseSwitchPayload
21 keys = new int[size]; in SparseSwitchPayload()
23 keys[i] = readSigned32BitValue(stream); in SparseSwitchPayload()
32 public SparseSwitchPayload(int[] keys, int[] targets) { in SparseSwitchPayload() argument
35 this.keys = keys; in SparseSwitchPayload()
47 write32BitValue(keys[i], dest); in write()
60 return size == that.size && Arrays.equals(keys, that.keys) && Arrays in equals()
68 result = 31 * result + Arrays.hashCode(keys); in hashCode()
74 return 2 + (2 * keys.length) + (2 * targets.length); in getSize()
83 public int[] keys() { in keys() method in SparseSwitchPayload
[all …]
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| D | MapBenchmark.java | 45 @Override Map<Element, Element> create(Collection<Element> keys) { in create() argument
47 for (Element element: keys) { in create()
54 @Override Map<Element, Element> create(Collection<Element> keys) { in create() argument
56 for (Element element: keys) { in create()
63 @Override Map<Element, Element> create(Collection<Element> keys) { in create() argument
64 return Collections.unmodifiableMap(Hash.create(keys)); in create()
68 @Override Map<Element, Element> create(Collection<Element> keys) { in create() argument
69 return Collections.synchronizedMap(Hash.create(keys)); in create()
73 @Override Map<Element, Element> create(Collection<Element> keys) { in create() argument
75 for (Element element: keys) { in create()
[all …]
|
| D | BinaryTreeTraverserBenchmark.java | 86 int[] keys = new int[size]; in createTree() local
88 keys[i] = rng.nextInt(); in createTree()
90 return createTreap(Ints.asList(keys)); in createTree()
94 private Optional<BinaryNode> createTreap(List<Integer> keys) { in createTreap() argument
95 if (keys.isEmpty()) { in createTreap()
99 for (int i = 1; i < keys.size(); i++) { in createTreap()
100 if (keys.get(i) < keys.get(minIndex)) { in createTreap()
104 Optional<BinaryNode> leftChild = createTreap(keys.subList(0, minIndex)); in createTreap()
105 Optional<BinaryNode> rightChild = createTreap(keys.subList(minIndex + 1, keys.size())); in createTreap()
106 return Optional.of(new BinaryNode(keys.get(minIndex), leftChild, rightChild)); in createTreap()
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
| D | MultimapKeysTester.java | 49 Multiset<K> keys = multimap().keys(); in testKeys() local
50 assertEquals(2, keys.count(sampleKeys().e0)); in testKeys()
51 assertEquals(1, keys.count(sampleKeys().e1)); in testKeys()
52 assertEquals(3, keys.size()); in testKeys()
53 assertThat(keys).has().allOf(sampleKeys().e0, sampleKeys().e1); in testKeys()
54 assertThat(keys.entrySet()).has().allOf( in testKeys()
61 assertEquals(0, multimap().keys().count(null)); in testKeysCountAbsentNullKey()
71 Multiset<K> keys = multimap().keys(); in testKeysWithNullKey() local
72 assertEquals(2, keys.count(null)); in testKeysWithNullKey()
73 assertEquals(1, keys.count(sampleKeys().e1)); in testKeysWithNullKey()
[all …]
|
| /external/mp4parser/isoparser/src/main/java/com/coremedia/iso/boxes/mdat/ |
| D | DummyMap.java | 14 HashSet<K> keys = new HashSet<K>(); field in DummyMap
25 public void addKeys(K[] keys) { in addKeys() argument
26 Collections.addAll(this.keys, keys); in addKeys()
31 return keys.size(); in size()
35 return keys.isEmpty(); in isEmpty()
39 return keys.contains(key); in containsKey()
47 return keys.contains(key) ? value : null; in get()
52 keys.add(key); in put()
58 keys.remove(key); in remove()
65 this.keys.add(k); in putAll()
[all …]
|
| /external/jemalloc/test/unit/ |
| D | rtree.c | 62 uintptr_t keys[] = {0, 1, in TEST_BEGIN() local
70 for (j = 0; j < sizeof(keys)/sizeof(uintptr_t); j++) { in TEST_BEGIN()
71 assert_false(rtree_set(&rtree, keys[j], &node), in TEST_BEGIN()
73 for (k = 0; k < sizeof(keys)/sizeof(uintptr_t); k++) { in TEST_BEGIN()
74 assert_ptr_eq(rtree_get(&rtree, keys[k], true), in TEST_BEGIN()
79 j, k, keys[j], keys[k]); in TEST_BEGIN()
85 assert_false(rtree_set(&rtree, keys[j], NULL), in TEST_BEGIN()
103 uintptr_t keys[NSET]; in TEST_BEGIN() local
112 keys[j] = (uintptr_t)gen_rand64(sfmt); in TEST_BEGIN()
113 assert_false(rtree_set(&rtree, keys[j], &node), in TEST_BEGIN()
[all …]
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ |
| D | ACBTree.m | 66 @synthesize keys;
90 keys = keyArray;
110 //tmp.keys[0] = kp;
174 [tnew insert:self.keys[numkeys-1] value:self index:0 split:&h];
175 [tnew insert:q.keys[q.numkeys-1] value:q index:1 split:&h];
202 ret = [t.keys[i].key compare:kstr];
235 ret = [keys[i].key compare:kstr];
289 self.keys[i] = tsb.keys[nkey];
315 self.keys[i] = tsb.keys[nkey];
335 ret = [keys[i].key compare:kp.key];
[all …]
|
| /external/icu/icu4c/source/samples/legacy/ |
| D | legacy.cpp | 31 extern "C" void test_current(UChar data[][5], uint32_t size, uint32_t maxLen, uint8_t keys[][32]);
32 extern "C" void test_legacy(UChar data[][5], uint32_t size, uint32_t maxlen, uint8_t keys[][32]);
55 void printKeys(const char *comment, uint8_t keys[][32], int32_t keySize) { in printKeys()
60 currentKey = keys[i]; in printKeys()
94 static uint8_t keys[4][32]; in main() local
102 test_current(uTest, 4, 5, keys); in main()
104 printKeys("Current keys", keys, 4); in main()
110 test_legacy(uTest, 4, 5, keys); in main()
112 printKeys("Legacy keys", keys, 4); in main()
|
| /external/skia/src/core/ |
| D | SkScalar.cpp | 12 SkScalar SkScalarInterpFunc(SkScalar searchKey, const SkScalar keys[], in SkScalarInterpFunc() argument
15 SkASSERT(keys != nullptr); in SkScalarInterpFunc()
19 SkASSERT(keys[i] >= keys[i-1]); in SkScalarInterpFunc()
22 while (right < length && searchKey > keys[right]) in SkScalarInterpFunc()
31 SkScalar rightKey = keys[right]; in SkScalarInterpFunc()
32 SkScalar leftKey = keys[right-1]; in SkScalarInterpFunc()
|
| /external/python/cpython2/Lib/test/ |
| D | test_anydbm.py | 39 self.assertEqual(f.keys(), [])
61 keys = self.keys_helper(f)
65 keys = self.keys_helper(f)
76 keys = f.keys()
77 keys.sort()
78 dkeys = self._dict.keys()
80 self.assertEqual(keys, dkeys)
81 return keys
|
| D | test_call.py | 50 {}.keys()
53 self.assertRaises(TypeError, {}.keys, 0)
56 self.assertRaises(TypeError, {}.keys, 0, 1)
59 {}.keys(*())
63 {}.keys(*(0,))
71 {}.keys(*(1, 2))
79 {}.keys(x=2)
86 self.assertRaises(TypeError, {}.keys, x=2)
89 self.assertRaises(TypeError, {}.keys, x=2, y=2)
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/util/ |
| D | OpenIntToDoubleHashMap.java | 71 private int[] keys; field in OpenIntToDoubleHashMap
122 keys = new int[capacity]; in OpenIntToDoubleHashMap()
134 final int length = source.keys.length; in OpenIntToDoubleHashMap()
135 keys = new int[length]; in OpenIntToDoubleHashMap()
136 System.arraycopy(source.keys, 0, keys, 0, length); in OpenIntToDoubleHashMap()
259 return findInsertionIndex(keys, states, key, mask); in findInsertionIndex()
270 private static int findInsertionIndex(final int[] keys, final byte[] states, in findInsertionIndex() argument
276 } else if (states[index] == FULL && keys[index] == key) { in findInsertionIndex()
288 if (states[index] != FULL || keys[index] == key) { in findInsertionIndex()
309 } else if (states[index] == FULL && keys[index] == key) { in findInsertionIndex()
[all …]
|
| /external/toybox/toys/pending/ |
| D | getfattr.c | 36 char *keys, *key; local
47 keys = xmalloc(keys_len);
48 if (lister(file, keys, keys_len) == keys_len) break;
49 free(keys);
55 for (key = keys, key_count = 0; key-keys < keys_len; key += strlen(key)+1)
58 for (key = keys, i = 0; key-keys < keys_len; key += strlen(key)+1)
|
| /external/v8/src/ |
| D | keys.cc | 55 OrderedHashSet::ConvertToKeysArray(keys(), convert); in GetKeys()
80 keys_ = OrderedHashSet::Add(keys(), key); in AddKey()
101 Handle<FixedArray> keys, in FilterProxyKeys() argument
105 return keys; in FilterProxyKeys()
109 for (int i = 0; i < keys->length(); ++i) { in FilterProxyKeys()
110 Handle<Name> key(Name::cast(keys->get(i)), isolate); in FilterProxyKeys()
125 keys->set(store_position, *key); in FilterProxyKeys()
130 keys->Shrink(store_position); in FilterProxyKeys()
131 return keys; in FilterProxyKeys()
136 Handle<FixedArray> keys) { in AddKeysFromJSProxy() argument
[all …]
|
| /external/protobuf/objectivec/ |
| D | GPBDictionary.h | 55 forKeys:(const uint32_t [])keys
61 forKeys:(const uint32_t [])keys
90 forKeys:(const uint32_t [])keys
96 forKeys:(const uint32_t [])keys
125 forKeys:(const uint32_t [])keys
131 forKeys:(const uint32_t [])keys
160 forKeys:(const uint32_t [])keys
166 forKeys:(const uint32_t [])keys
195 forKeys:(const uint32_t [])keys
201 forKeys:(const uint32_t [])keys
[all …]
|
| /external/guava/guava-tests/test/com/google/common/cache/ |
| D | EmptyCachesTest.java | 118 Set<Object> keys = cache.asMap().keySet(); in testKeySet_nullToArray() local
120 keys.toArray(null); in testKeySet_nullToArray()
151 Set<Object> keys = cache.asMap().keySet(); in testKeySet_clear() local
152 keys.clear(); in testKeySet_clear()
153 checkEmpty(keys); in testKeySet_clear()
160 Set<Object> keys = cache.asMap().keySet(); in testKeySet_empty_remove() local
161 assertFalse(keys.remove(null)); in testKeySet_empty_remove()
162 assertFalse(keys.remove(6)); in testKeySet_empty_remove()
163 assertFalse(keys.remove(-6)); in testKeySet_empty_remove()
164 assertFalse(keys.removeAll(asList(null, 0, 15, 1500))); in testKeySet_empty_remove()
[all …]
|
| /external/libvncserver/examples/ |
| D | vncev.c | 20 static char* keys[0x400]; variable
39 memset(keys,0,0x400*sizeof(char*)); in read_keys()
56 if(keys[j&0x3ff]) { in read_keys()
57 char* x=(char*)malloc(1+strlen(keys[j&0x3ff])+1+strlen(buffer+strlen("#define "))); in read_keys()
58 strcpy(x,keys[j&0x3ff]); in read_keys()
61 free(keys[j&0x3ff]); in read_keys()
62 keys[j&0x3ff]=x; in read_keys()
64 keys[j&0x3ff] = strdup(buffer+strlen("#define ")); in read_keys()
84 down?"down":"up",keys[k&0x3ff]?keys[k&0x3ff]:"",(unsigned int)k); in dokey()
|
| /external/skia/tests/ |
| D | DynamicHashTest.cpp | 160 int keys[3] = {0, 0, 0}; in TestIter() local
163 keys[count] = key; in TestIter()
168 ASSERT(keys[0] != keys[1]); in TestIter()
169 ASSERT(keys[0] != keys[2]); in TestIter()
170 ASSERT(keys[1] != keys[2]); in TestIter()
175 memset(keys, 0, sizeof(keys)); in TestIter()
178 keys[count] = key; in TestIter()
184 ASSERT(keys[0] != keys[1]); in TestIter()
|