HomeSort by relevance Sort by last modified time
    Searched refs:key (Results 151 - 175 of 9119) sorted by null

1 2 3 4 5 67 8 91011>>

  /external/boringssl/src/crypto/fipsmodule/aes/
mode_wrappers.c 58 const AES_KEY *key, uint8_t ivec[AES_BLOCK_SIZE],
60 CRYPTO_ctr128_encrypt(in, out, len, key, ivec, ecount_buf, num, AES_encrypt);
63 void AES_ecb_encrypt(const uint8_t *in, uint8_t *out, const AES_KEY *key,
65 assert(in && out && key);
69 AES_encrypt(in, out, key);
71 AES_decrypt(in, out, key);
76 const AES_KEY *key, uint8_t *ivec, const int enc) {
78 aes_hw_cbc_encrypt(in, out, len, key, ivec, enc);
84 aes_nohw_cbc_encrypt(in, out, len, key, ivec, enc);
89 CRYPTO_cbc128_encrypt(in, out, len, key, ivec, AES_encrypt)
    [all...]
  /frameworks/av/drm/libdrmframework/plugins/common/util/include/
SessionMap.h 45 * @param key - key or Session ID
48 * @return boolean result of adding value. returns false if key is already exist.
50 bool addValue(int key, TValue value) {
52 if (!isCreatedInternal(key)) {
53 map.add(key, value);
60 * returns the session object by the key
62 * @param key - key or Session ID
64 * @return session object as per the key
    [all...]
  /external/google-breakpad/src/common/
simple_string_dictionary.h 52 // The template parameters control the amount of storage used for the key,
65 // An Entry object is a single entry in the map. If the key is a 0-length
68 char key[KeySize]; member in struct:google_breakpad::NonAllocatingMap::Entry
72 return key[0] != '\0';
131 // Returns the number of active key/value pairs. The upper limit for this
143 // Given |key|, returns its corresponding |value|. |key| must not be NULL. If
144 // the key is not found, NULL is returned.
145 const char* GetValueForKey(const char* key) const {
146 assert(key);
    [all...]
  /external/tensorflow/tensorflow/core/lib/random/
philox_random.h 111 // The type for the 64-bit key stored in the form of two 32-bit uint
113 using Key = Array<uint32, 2>;
133 PhiloxRandom(ResultType counter, Key key) : counter_(counter), key_(key) {}
139 Key const& key() const { return key_; } function in class:tensorflow::random::PhiloxRandom
164 Key key = key_; local
168 counter = ComputeSingleRound(counter, key);
    [all...]
  /device/linaro/bootloader/arm-trusted-firmware/tools/cert_create/include/
key.h 23 /* Supported key algorithms */
37 * One instance of this structure must be created for each key, usually in an
42 int id; /* Key id */
43 const char *opt; /* Command line option to specify a key */
45 const char *desc; /* Key description (debug purposes) */
46 char *fn; /* Filename to load/store the key */
47 EVP_PKEY *key; /* Key container */ member in struct:key_s
53 int key_new(key_t *key);
54 int key_create(key_t *key, int type)
    [all...]
  /external/clang/test/PCH/
objc_container.h 9 - (id)objectForKeyedSubscript:(id)key;
10 - (void)setObject:(id)object forKeyedSubscript:(id)key;
20 id key; local
22 oldObject = dictionary[key];
24 dictionary[key] = newObject;
  /external/guava/guava/src/com/google/common/collect/
ImmutableEntry.java 31 final K key; field in class:ImmutableEntry
34 ImmutableEntry(@Nullable K key, @Nullable V value) {
35 this.key = key;
40 return key;
  /external/icu/icu4j/main/tests/core/src/com/ibm/icu/dev/test/normalizer/
IntHashtable.java 25 public void put(int key, int value) {
27 table.remove(new Integer(key));
29 table.put(new Integer(key), new Integer(value));
33 public int get(int key) {
34 Integer value = table.get(new Integer(key));
IntStringHashtable.java 25 public void put(int key, String value) {
27 table.remove(new Integer(key));
29 table.put(new Integer(key), value);
33 public String get(int key) {
34 String value = table.get(new Integer(key));
LongHashtable.java 24 public void put(long key, int value) {
26 table.remove(new Long(key));
28 table.put(new Long(key), new Integer(value));
32 public int get(long key) {
33 Integer value = table.get(new Long(key));
  /external/kmod/shared/
hash.h 15 int hash_add(struct hash *hash, const char *key, const void *value);
16 int hash_add_unique(struct hash *hash, const char *key, const void *value);
17 int hash_del(struct hash *hash, const char *key);
18 void *hash_find(const struct hash *hash, const char *key);
21 bool hash_iter_next(struct hash_iter *iter, const char **key,
  /external/libdrm/amdgpu/
util_hash_table.h 51 util_hash_table_create(unsigned (*hash)(void *key),
55 util_hash_table_set(struct util_hash_table *ht, void *key, void *value);
57 drm_private void *util_hash_table_get(struct util_hash_table *ht, void *key);
59 drm_private void util_hash_table_remove(struct util_hash_table *ht, void *key);
64 void (*callback)(void *key, void *value, void *data),
  /external/mesa3d/src/gallium/auxiliary/util/
u_hash_table.h 59 util_hash_table_create(unsigned (*hash)(void *key),
65 void *key,
70 void *key);
75 void *key);
85 (void *key, void *value, void *data),
  /external/virglrenderer/src/gallium/auxiliary/util/
u_hash_table.h 59 util_hash_table_create(unsigned (*hash)(void *key),
66 void *key,
71 void *key);
76 void *key);
86 (void *key, void *value, void *data),
  /frameworks/av/camera/include/camera/
CameraParameters2.h 41 void set(const char *key, const char *value);
42 void set(const char *key, int value);
43 void setFloat(const char *key, float value);
44 // Look up string value by key.
45 // -- The string remains valid until the next set/remove of the same key,
47 const char *get(const char *key) const;
48 int getInt(const char *key) const;
49 float getFloat(const char *key) const;
58 // * NAME_NOT_FOUND - if either key has not been set previously
64 void remove(const char *key);
    [all...]
  /external/mesa3d/src/mesa/main/
hash.c 8 * \note key=0 is illegal.
107 _mesa_HashLookup_unlocked(struct _mesa_HashTable *table, GLuint key)
112 assert(key);
114 if (key == DELETED_KEY_VALUE)
118 uint_hash(key),
119 uint_key(key));
131 * \param key the key.
133 * \return pointer to user's data or NULL if key not in table
136 _mesa_HashLookup(struct _mesa_HashTable *table, GLuint key)
393 GLuint key; local
    [all...]
hash.h 41 * The hash table needs a particular pointer to be the marker for a key that
44 * and we use a 1:1 mapping from GLuints to key pointers, so we need to be
45 * able to track a GLuint that happens to match the deleted key outside of
46 * struct hash_table. We tell the hash table to use "1" as the deleted key
47 * value, so that we test the deleted-key-in-the-table path as best we can.
52 * Mapping from our use of GLuint as both the key and the hash value to the
56 * the integers are spread across key space with some patterns. In GL, the
58 * contiguous integers starting from 1. Because of that, we just use the key
61 * table resizes itself when it approaches full, and thus key % table_size ==
62 * key
    [all...]
  /external/tensorflow/tensorflow/compiler/xla/service/
compilation_cache.cc 44 CacheKey key = GetUniqueId(); local
45 VLOG(2) << "inserting cache key: " << key;
46 CHECK_EQ(cache_.count(key), 0);
47 cache_.emplace(key, std::move(executable));
50 handle.set_handle(key);
58 CacheKey key = handle.handle(); local
59 VLOG(2) << "looking up cache key: " << key;
60 if (cache_.count(key) == 0)
    [all...]
  /external/vboot_reference/firmware/2lib/
2rsa.c 7 * Implementation of RSA signature verification which uses a pre-processed key
9 * multiple RSA key lengths and hash digest algorithms.
20 static void subM(const struct vb2_public_key *key, uint32_t *a)
24 for (i = 0; i < key->arrsize; ++i) {
25 A += (uint64_t)a[i] - key->n[i];
34 int vb2_mont_ge(const struct vb2_public_key *key, uint32_t *a)
37 for (i = key->arrsize; i;) {
39 if (a[i] < key->n[i])
41 if (a[i] > key->n[i])
50 static void montMulAdd(const struct vb2_public_key *key,
    [all...]
  /external/webp/src/utils/
color_cache_utils.h 40 const VP8LColorCache* const cc, uint32_t key) {
41 assert((key >> cc->hash_bits_) == 0u);
42 return cc->colors_[key];
46 uint32_t key, uint32_t argb) {
47 assert((key >> cc->hash_bits_) == 0u);
48 cc->colors_[key] = argb;
53 const int key = VP8LHashPix(argb, cc->hash_shift_); local
54 cc->colors_[key] = argb;
62 // Return the key if cc contains argb, and -1 otherwise.
65 const int key = VP8LHashPix(argb, cc->hash_shift_) local
    [all...]
  /external/mesa3d/src/gallium/drivers/svga/
svga_screen_cache.c 42 * Return the size of the surface described by the key (in bytes).
45 surface_size(const struct svga_host_surface_cache_key *key)
49 assert(key->numMipLevels > 0);
50 assert(key->numFaces > 0);
51 assert(key->arraySize > 0);
53 if (key->format == SVGA3D_BUFFER) {
60 svga_format_size(key->format, &bw, &bh, &bpb);
64 for (i = 0; i < key->numMipLevels; i++) {
65 unsigned w = u_minify(key->size.width, i);
66 unsigned h = u_minify(key->size.height, i)
    [all...]
  /bionic/libc/upstream-openbsd/lib/libc/stdlib/
lsearch.c 44 lsearch(const void *key, void *base, size_t *nelp, size_t width,
48 return(linear_base(key, base, nelp, width, compar, 1));
52 lfind(const void *key, const void *base, size_t *nelp, size_t width,
55 return(linear_base(key, base, nelp, width, compar, 0));
59 linear_base(const void *key, const void *base, size_t *nelp, size_t width,
66 if (!compar(key, element)) /* key found */
69 if (!add_flag) /* key not found */
82 memcpy((void *)end, key, width);
  /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Python/
thread.c 184 Per-thread data ("key") support.
186 Use PyThread_create_key() to create a new key. This is typically shared
219 /* A singly-linked list of struct key objects remembers all the key->value
223 struct key { struct
225 struct key *next;
230 /* The key and its associated value. */
231 int key; member in struct:key
235 static struct key *keyhead = NULL;
240 * If the current thread has a mapping for key, the appropriate struct key*
    [all...]
  /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/crypto/params/
AEADParameters.java 11 private KeyParameter key; field in class:AEADParameters
17 * @param key key to be used by underlying cipher
21 public AEADParameters(KeyParameter key, int macSize, byte[] nonce)
23 this(key, macSize, nonce, null);
29 * @param key key to be used by underlying cipher
34 public AEADParameters(KeyParameter key, int macSize, byte[] nonce, byte[] associatedText)
36 this.key = key;
    [all...]
  /external/bouncycastle/repackaged/bcprov/src/main/java/com/android/org/bouncycastle/crypto/params/
AEADParameters.java 15 private KeyParameter key; field in class:AEADParameters
21 * @param key key to be used by underlying cipher
25 public AEADParameters(KeyParameter key, int macSize, byte[] nonce)
27 this(key, macSize, nonce, null);
33 * @param key key to be used by underlying cipher
38 public AEADParameters(KeyParameter key, int macSize, byte[] nonce, byte[] associatedText)
40 this.key = key;
    [all...]

Completed in 1058 milliseconds

1 2 3 4 5 67 8 91011>>