Searched refs:Key (Results 1 - 25 of 258) sorted by relevance

1234567891011

/external/openssh/
H A Dauthfile.h18 int key_save_private(Key *, const char *, const char *, const char *);
20 Key *key_load_cert(const char *);
21 Key *key_load_public(const char *, char **);
22 Key *key_load_public_type(int, const char *, char **);
23 Key *key_parse_private(Buffer *, const char *, const char *, char **);
24 Key *key_load_private(const char *, const char *, char **);
25 Key *key_load_private_cert(int, const char *, const char *, int *);
26 Key *key_load_private_type(int, const char *, const char *, char **, int *);
27 Key *key_load_private_pem(int, int, const char *, char **);
29 int key_in_file(Key *, cons
[all...]
H A Dkey.h36 typedef struct Key Key; typedef in typeref:struct:Key
73 Key *signature_key;
76 struct Key { struct
90 Key *key_new(int);
91 void key_add_private(Key *);
92 Key *key_new_private(int);
93 void key_free(Key *);
94 Key *key_demote(const Key *);
[all...]
H A Dssh-pkcs11.h19 int pkcs11_add_provider(char *, char *, Key ***);
H A Dauthfd.h76 Key *ssh_get_first_identity(AuthenticationConnection *, char **, int);
77 Key *ssh_get_next_identity(AuthenticationConnection *, char **, int);
78 int ssh_add_identity_constrained(AuthenticationConnection *, Key *,
80 int ssh_remove_identity(AuthenticationConnection *, Key *);
87 ssh_decrypt_challenge(AuthenticationConnection *, Key *, BIGNUM *, u_char[16],
91 ssh_agent_sign(AuthenticationConnection *, Key *, u_char **, u_int *, u_char *,
H A Dhostfile.h29 Key *key;
38 HostStatus check_key_in_hostkeys(struct hostkeys *, Key *,
43 int hostfile_read_key(char **, u_int *, Key *);
44 int add_host_to_hostfile(const char *, const char *, const Key *, int);
H A Ddns.h49 int verify_host_key_dns(const char *, struct sockaddr *, Key *, int *);
50 int export_dns_rr(const char *, Key *, FILE *, int);
H A Dauth.h111 int auth_rhosts_rsa(Authctxt *, char *, Key *);
114 int auth_rsa_challenge_dialog(Key *);
115 BIGNUM *auth_rsa_generate_challenge(Key *);
116 int auth_rsa_verify_response(Key *, BIGNUM *, u_char[]);
117 int auth_rsa_key_allowed(struct passwd *, BIGNUM *, Key **);
119 int auth_rhosts_rsa_key_allowed(struct passwd *, char *, char *, Key *);
120 int hostbased_key_allowed(struct passwd *, const char *, char *, Key *);
121 int user_key_allowed(struct passwd *, Key *);
176 int auth_key_is_revoked(Key *);
179 check_key_in_hostfiles(struct passwd *, Key *, cons
[all...]
H A Dmonitor_wrap.h43 int mm_key_sign(Key *, u_char **, u_int *, u_char *, u_int);
48 int mm_key_allowed(enum mm_keytype, char *, char *, Key *);
49 int mm_user_key_allowed(struct passwd *, Key *);
50 int mm_hostbased_key_allowed(struct passwd *, char *, char *, Key *);
51 int mm_auth_rhosts_rsa_key_allowed(struct passwd *, char *, char *, Key *);
52 int mm_key_verify(Key *, u_char *, u_int, u_char *, u_int);
53 int mm_auth_rsa_key_allowed(struct passwd *, BIGNUM *, Key **);
54 int mm_auth_rsa_verify_response(Key *, BIGNUM *, u_char *);
55 BIGNUM *mm_auth_rsa_generate_challenge(Key *);
89 /* Key expor
[all...]
/external/clang/test/Modules/Inputs/submodules/
H A Dhash_map.h1 template<typename Key, typename Data> class hash_map { };
/external/clang/lib/AST/
H A DLambdaMangleContext.cpp26 QualType Key = Context.getFunctionType(Context.VoidTy, local
30 Key = Context.getCanonicalType(Key);
31 return ++ManglingNumbers[Key->castAs<FunctionProtoType>()];
/external/llvm/lib/Support/
H A DStringPool.cpp25 PooledStringPtr StringPool::intern(StringRef Key) { argument
26 table_t::iterator I = InternTable.find(Key);
30 entry_t *S = entry_t::Create(Key.begin(), Key.end());
/external/protobuf/src/google/protobuf/stubs/
H A Dhash.h62 template <typename Key>
65 int operator()(const Key& key) {
70 inline bool operator()(const Key& a, const Key& b) const {
89 template <typename Key, typename Data,
90 typename HashFcn = hash<Key>,
92 class hash_map : public std::map<Key, Data, HashFcn> {
95 template <typename Key,
96 typename HashFcn = hash<Key>,
98 class hash_set : public std::set<Key, HashFc
[all...]
/external/chromium/base/
H A Dglobal_descriptors_posix.h39 typedef uint32_t Key; typedef in class:base::GlobalDescriptors
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
50 int Get(Key key) const;
53 int MaybeGet(Key key) const;
56 void Set(Key key, int fd);
/external/chromium/net/base/
H A Dhost_cache_unittest.cc23 HostCache::Key Key(const std::string& hostname) { function in namespace:net::__anon2796
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());
61 EXPECT_EQ(entry1, cache.Lookup(Key("fooba
[all...]
/external/bison/src/
H A Dmuscle_tab.h35 #define MUSCLE_INSERT_BOOL(Key, Value) \
38 MUSCLE_INSERT_INT (Key, v); \
41 #define MUSCLE_INSERT_INT(Key, Value) \
45 muscle_insert (Key, obstack_finish (&muscle_obstack)); \
48 #define MUSCLE_INSERT_LONG_INT(Key, Value) \
52 muscle_insert (Key, obstack_finish (&muscle_obstack)); \
55 #define MUSCLE_INSERT_STRING(Key, Value) \
59 muscle_insert (Key, obstack_finish (&muscle_obstack)); \
76 #define MUSCLE_INSERT_C_STRING(Key, Value) \
82 muscle_insert (Key, obstack_finis
[all...]
/external/skia/src/gpu/
H A DGrTHashCache.h17 * Key needs
25 template <typename T, typename Key, size_t kHashBits> class GrTHashTable {
31 T* find(const Key&) const;
33 bool insert(const Key&, T*);
34 void remove(const Key&, const T*);
70 int searchArray(const Key&) const;
75 template <typename T, typename Key, size_t kHashBits>
76 int GrTHashTable<T, Key, kHashBits>::searchArray(const Key& key) const {
88 if (Key
[all...]
H A DGrTextStrike_impl.h14 class GrFontCache::Key { class in class:GrFontCache
16 Key(GrFontScaler* scaler) { function in class:GrFontCache::Key
22 static bool LT(const GrTextStrike& strike, const Key& key) {
25 static bool EQ(const GrTextStrike& strike, const Key& key) {
54 Key key(scaler);
76 * This Key just wraps a glyphID, and matches the protocol need for
79 class GrTextStrike::Key { class in class:GrTextStrike
81 Key(GrGlyph::PackedID id) : fPackedID(id) {} function in class:GrTextStrike::Key
85 static bool LT(const GrGlyph& glyph, const Key& key) {
88 static bool EQ(const GrGlyph& glyph, const Key
[all...]
/external/clang/test/SemaCXX/
H A Dflexible-array-test.cpp4 template <class Key, class T> struct QMap
6 void insert(const Key &, const T &);
11 template <class Key, class T>
12 void QMap<Key, T>::insert(const Key &, const T &avalue)
/external/v8/src/
H A Dsplay-tree.h40 // typedef Key: the key type
44 // int (Compare)(Key& a, Key& b) -> {-1, 0, 1}: comparison function
56 typedef typename Config::Key Key; typedef in class:v8::internal::SplayTree
72 bool Insert(const Key& key, Locator* locator);
77 bool Find(const Key& key, Locator* locator);
81 bool FindGreatestLessThan(const Key& key, Locator* locator);
88 bool FindLeastGreaterThan(const Key& key, Locator* locator);
94 bool Move(const Key
[all...]
/external/apache-harmony/security/src/test/api/java/org/apache/harmony/security/tests/java/security/
H A DKeyTest.java23 import java.security.Key;
29 * Tests for <code>Key</code> class field
49 assertEquals("Incorrect serialVersionUID", mk.getSerVerUID(), //Key.serialVersionUID,
53 public class checkKey implements Key {
55 return "Key";
/external/guava/guava-tests/test/com/google/common/cache/
H A DCacheReferencesTest.java40 private static final CacheLoader<Key,String> KEY_TO_STRING_LOADER =
41 new CacheLoader<Key, String>() {
42 @Override public String load(Key key) {
53 private Iterable<LoadingCache<Key, String>> caches() {
56 new Function<CacheBuilder<Object, Object>, LoadingCache<Key, String>>() {
57 @Override public LoadingCache<Key, String> apply(CacheBuilder<Object, Object> builder) {
64 for (LoadingCache<Key, String> cache : caches()) {
66 Key key = new Key(1);
76 for (LoadingCache<Key, Strin
185 static class Key { class in class:CacheReferencesTest
189 Key(int value) { method in class:CacheReferencesTest.Key
[all...]
/external/llvm/include/llvm/MC/
H A DSubtargetFeature.h35 const char *Key; // K-V key string member in struct:llvm::SubtargetFeatureKV
42 return strcmp(Key, S.Key) < 0;
52 const char *Key; // K-V key string member in struct:llvm::SubtargetInfoKV
57 return strcmp(Key, S.Key) < 0;
/external/apache-harmony/crypto/src/test/support/common/java/org/apache/harmony/crypto/tests/support/
H A DMyKeyAgreementSpi.java26 import java.security.Key;
44 protected Key engineDoPhase(Key key, boolean lastPhase)
74 protected void engineInit(Key key, SecureRandom random)
80 protected void engineInit(Key key, AlgorithmParameterSpec params,
H A DMyExemptionMechanismSpi.java27 import java.security.Key;
65 protected void engineInit(Key key) throws InvalidKeyException,
76 protected void engineInit(Key key, AlgorithmParameters params)
88 protected void engineInit(Key key, AlgorithmParameterSpec params)
100 public class tmpKey implements Key {
118 public class tmp1Key implements Key {
/external/llvm/include/llvm/ADT/
H A DSparseSet.h74 unsigned operator()(const KeyT &Key) const {
75 return KeyFunctorT()(Key);
200 assert(Idx < Universe && "Key out of range");
219 /// @param Key A valid key to find.
222 iterator find(const KeyT &Key) {
223 return findIndex(KeyIndexOf(Key));
226 const_iterator find(const KeyT &Key) const {
227 return const_cast<SparseSet*>(this)->findIndex(KeyIndexOf(Key));
230 /// count - Returns true if this set contains an element identified by Key.
232 bool count(const KeyT &Key) cons
[all...]

Completed in 488 milliseconds

1234567891011