HomeSort by relevance Sort by last modified time
    Searched defs:Key (Results 1 - 25 of 102) sorted by null

1 2 3 4 5

  /external/clang/lib/AST/
LambdaMangleContext.cpp 26 QualType Key = Context.getFunctionType(Context.VoidTy,
30 Key = Context.getCanonicalType(Key);
31 return ++ManglingNumbers[Key->castAs<FunctionProtoType>()];
  /external/chromium/base/
global_descriptors_posix.h 34 // It maps from an abstract key to a descriptor. If independent modules each
39 typedef uint32_t Key;
40 typedef std::vector<std::pair<Key, int> > Mapping;
42 // Often we want a canonical descriptor for a given Key. In this case, we add
43 // the following constant to the key value:
49 // Get a descriptor given a key. It is a fatal error if the key is not known.
50 int Get(Key key) const;
52 // Get a descriptor give a key. Returns -1 on error
    [all...]
  /libcore/luni/src/main/java/java/security/
Key.java 23 * {@code Key} is the common interface for all keys.
28 public interface Key extends Serializable {
36 * Returns the name of the algorithm of this key. If the algorithm is
39 * @return the name of the algorithm of this key or {@code null} if the
45 * Returns the name of the format used to encode this key, or {@code null}
48 * @return the name of the format used to encode this key, or {@code null}
54 * Returns the encoded form of this key, or {@code null} if encoding is not
55 * supported by this key.
57 * @return the encoded form of this key, or {@code null} if encoding is not
58 * supported by this key
    [all...]
  /frameworks/compile/llvm-ndk-cc/
llvm-ndk-cc.cpp 49 std::string& Key, std::string& Value) {
52 Key = In;
55 Key = In.substr(0, FoundPos);
83 std::string Key;
85 splitPreDefinedSymbol(PreDefinedSymbols[i], Key, Value);
87 std::pair<std::string, std::string>(Key,Value));
  /gdk/sources/llvm-ndk-cc/
llvm-ndk-cc.cpp 49 std::string& Key, std::string& Value) {
52 Key = In;
55 Key = In.substr(0, FoundPos);
83 std::string Key;
85 splitPreDefinedSymbol(PreDefinedSymbols[i], Key, Value);
87 std::pair<std::string, std::string>(Key,Value));
  /external/clang/tools/diagtool/
DiagnosticNames.cpp 54 DiagnosticRecord Key = {0, DiagID, 0};
59 Key, orderByID);
TreeView.cpp 60 GroupRecord Key = { RootGroup.size(), RootGroup.data(), 0, 0 };
62 std::lower_bound(AllGroups.begin(), AllGroups.end(), Key);
  /external/llvm/include/llvm/MC/
SubtargetFeature.h 31 /// SubtargetFeatureKV - Used to provide key value pairs for feature and
35 const char *Key; // K-V key string
42 return strcmp(Key, S.Key) < 0;
48 /// SubtargetInfoKV - Used to provide key value pairs for CPU and arbitrary
52 const char *Key; // K-V key string
57 return strcmp(Key, S.Key) < 0
    [all...]
  /external/llvm/lib/MC/
MCRegisterInfo.cpp 50 DwarfLLVMRegPair Key = { RegNum, 0 };
51 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key);
61 DwarfLLVMRegPair Key = { RegNum, 0 };
62 const DwarfLLVMRegPair *I = std::lower_bound(M, M+Size, Key);
  /external/skia/src/gpu/
GrTextStrike_impl.h 14 class GrFontCache::Key {
16 Key(GrFontScaler* scaler) {
22 static bool LT(const GrTextStrike& strike, const Key& key) {
23 return *strike.getFontScalerKey() < *key.fFontScalerKey;
25 static bool EQ(const GrTextStrike& strike, const Key& key) {
26 return *strike.getFontScalerKey() == *key.fFontScalerKey;
54 Key key(scaler)
    [all...]
GrResourceCache.cpp 14 GrResourceEntry::GrResourceEntry(const GrResourceKey& key, GrResource* resource)
15 : fKey(key), fResource(resource) {
130 class GrResourceCache::Key {
135 Key(const GrResourceKey& key) : fKey(key) {}
139 static bool LT(const T& entry, const Key& key) {
140 return entry.key() < key.fKey
    [all...]
  /packages/apps/MusicFX/src/com/android/musicfx/
ControlPanelEffect.java 61 static enum Key {
167 final boolean isGlobalEnabled = prefs.getBoolean(Key.global_enabled.toString(),
169 editor.putBoolean(Key.global_enabled.toString(), isGlobalEnabled);
173 final boolean isVIEnabled = prefs.getBoolean(Key.virt_enabled.toString(),
175 final int vIStrength = prefs.getInt(Key.virt_strength.toString(),
177 editor.putBoolean(Key.virt_enabled.toString(), isVIEnabled);
178 editor.putInt(Key.virt_strength.toString(), vIStrength);
185 editor.putBoolean(Key.virt_strength_supported.toString(),
197 final boolean isBBEnabled = prefs.getBoolean(Key.bb_enabled.toString(),
199 final int bBStrength = prefs.getInt(Key.bb_strength.toString()
    [all...]
  /external/chromium/net/base/
host_cache.h 41 struct Key {
42 Key(const std::string& hostname, AddressFamily address_family,
48 bool operator==(const Key& other) const {
57 bool operator<(const Key& other) const {
73 typedef std::map<Key, scoped_refptr<Entry> > EntryMap;
84 // Returns a pointer to the entry for |key|, which is valid at time
86 const Entry* Lookup(const Key& key, base::TimeTicks now) const;
88 // Overwrites or creates an entry for |key|. Returns the pointer to the
92 Entry* Set(const Key& key
    [all...]
host_cache_unittest.cc 22 // Builds a key for |hostname|, defaulting the address family to unspecified.
23 HostCache::Key Key(const std::string& hostname) {
24 return HostCache::Key(hostname, ADDRESS_FAMILY_UNSPECIFIED, 0);
41 EXPECT_TRUE(cache.Lookup(Key("foobar.com"), base::TimeTicks()) == NULL);
42 cache.Set(Key("foobar.com"), OK, AddressList(), now);
43 entry1 = cache.Lookup(Key("foobar.com"), base::TimeTicks());
51 EXPECT_TRUE(cache.Lookup(Key("foobar2.com"), base::TimeTicks()) == NULL);
52 cache.Set(Key("foobar2.com"), OK, AddressList(), now);
53 entry2 = cache.Lookup(Key("foobar2.com"), base::TimeTicks())
    [all...]
host_resolver_impl.h 137 typedef HostCache::Key Key;
138 typedef std::map<Key, scoped_refptr<Job> > JobMap;
150 // Returns the outstanding job for |key|, or NULL if there is none.
151 Job* FindOutstandingJob(const Key& key);
209 // Returns the (hostname, address_family) key to use for |info|, choosing an
212 Key GetEffectiveKeyForRequest(const RequestInfo& info) const;
  /external/v8/src/
scopeinfo.h 83 struct Key {
125 Key keys_[kLength];
splay-tree.h 40 // typedef Key: the key type
42 // static const kNoKey: the dummy key used when no key is set
44 // int (Compare)(Key& a, Key& b) -> {-1, 0, 1}: comparison function
56 typedef typename Config::Key Key;
69 // Inserts the given key in this tree with the given value. Returns
71 // is enabled and provides access to the mapping for the key
122 Key key() { return key_; } function in class:v8::internal::SplayTree::Node
142 const Key& key() { return node_->key_; } function in class:v8::internal::SplayTree::BASE_EMBEDDED
    [all...]
  /external/openfst/src/include/fst/
generic-register.h 29 // a) be such as can be stored as a key in a map<>
43 typedef KeyType Key;
53 void SetEntry(const KeyType &key,
57 register_table_.insert(make_pair(key, entry));
60 EntryType GetEntry(const KeyType &key) const {
61 const EntryType *entry = LookupEntry(key);
65 return LoadEntryFromSharedObject(key);
74 virtual EntryType LoadEntryFromSharedObject(const KeyType &key) const {
75 string so_filename = ConvertKeyToSoFilename(key);
86 const EntryType *entry = this->LookupEntry(key);
    [all...]
  /external/smali/baksmali/src/main/java/org/jf/baksmali/Adaptors/Format/
SparseSwitchMethodItem.java 58 sparseSwitchLabelTarget.Key = target.key;
71 sparseSwitchOffsetTarget.Key = target.key;
84 IntegerRenderer.writeTo(writer, target.Key);
95 public int Key;
  /frameworks/base/include/androidfw/
KeyLayoutMap.h 59 * Describes a mapping from keyboard scan codes and joystick axes to Android key codes and axes.
77 struct Key {
82 KeyedVector<int32_t, Key> mKeysByScanCode;
83 KeyedVector<int32_t, Key> mKeysByUsageCode;
88 const Key* getKey(int32_t scanCode, int32_t usageCode) const;
  /external/dropbear/libtomcrypt/
crypt.tex 121 public key cryptography (via PKCS \#1 RSA, DH or ECCDH), and a plethora of support routines.
172 that for the PRNG needs within the library (\textit{e.g. making a RSA key}). All the developer has to do
183 the key setup, ECB decrypt and encrypt and test vector routines. After that all five chaining mode routines
254 related issue is if you use the same symmetric cipher, hash or public key state data in multiple threads. Normally
326 rsa_key key;
331 /* ... Make up the RSA key somehow ... */
333 /* lets export the key, set x to the size of the
336 if ((err = rsa_export(buffer, &x, PK_PUBLIC, &key)) != CRYPT_OK) {
343 printf("RSA exported key takes %d bytes\n", x);
351 In the above example if the size of the RSA public key was more than 1024 bytes this function would return an error cod
    [all...]
  /external/clang/lib/Lex/
HeaderMap.cpp 38 uint32_t Key; // Offset (into strings) of key.
137 /// this return a bucket with an empty key (0).
140 Result.Key = HMAP_EmptyBucketKey;
154 Result.Key = getEndianAdjustedWord(BucketPtr->Key);
191 if (B.Key == HMAP_EmptyBucketKey) continue;
193 const char *Key = getString(B.Key);
196 fprintf(stderr, " %d. %s -> '%s' '%s'\n", i, Key, Prefix, Suffix)
    [all...]
  /external/openssh/
key.h 1 /* $OpenBSD: key.h,v 1.33 2010/10/28 11:22:09 djm Exp $ */
36 typedef struct Key Key;
59 /* key is stored in external hardware */
73 Key *signature_key;
76 struct Key {
90 Key *key_new(int);
91 void key_add_private(Key *);
92 Key *key_new_private(int);
93 void key_free(Key *);
    [all...]
  /external/stlport/test/unit/
find_test.cpp 51 struct Key
90 Key keys[10] = { {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0}, {0} };
91 Key const* k = find(keys + 0, keys + 10, 5);
  /external/webkit/Source/JavaScriptCore/runtime/
StructureTransitionTable.h 44 typedef std::pair<RefPtr<StringImpl>, unsigned> Key;
45 static unsigned hash(const Key& p)
50 static bool equal(const Key& a, const Key& b)
73 static void* finalizerContextFor(Hash::Key)
78 static inline Hash::Key keyForFinalizer(void* context, Structure* structure)
84 typedef WeakGCMap<Hash::Key, Structure, WeakGCMapFinalizerCallback, Hash, HashTraits> TransitionMap;
86 static Hash::Key keyForWeakGCMapFinalizer(void* context, Structure*);

Completed in 501 milliseconds

1 2 3 4 5