| /device/linaro/bootloader/edk2/ArmPlatformPkg/ArmVExpressPkg/ArmVExpressDxe/ |
| ArmFvpDxe.c | 72 VOID *Key;
106 // Allocate Key
107 Key = AllocatePool (FvProtocol->KeySize);
108 ASSERT (Key != NULL);
109 ZeroMem (Key, FvProtocol->KeySize);
113 Status = FvProtocol->GetNextFile (FvProtocol, Key, &FileType, &NameGuid, &Attributes, &Size);
134 FreePool (Key);
143 FreePool (Key);
|
| /device/linaro/bootloader/edk2/BeagleBoardPkg/Tools/ |
| replace.c | 48 char *Key, *Replace;
100 Key = malloc (MaxLenKey);
101 if (Key == NULL) {
106 // into a buffer that is as big as the maximum search key size.
115 ReadCount = fread (Key, 1, MaxLenKey, In);
118 if (!memcmp (Key, Match[i].Match, Match[i].MatchSize)) {
127 fputc (Key[0], Out);
142 free (Key);
|
| /device/linaro/bootloader/edk2/IntelFrameworkModulePkg/Universal/FirmwareVolume/FwVolDxe/ |
| FwVolRead.c | 62 Given the input key, search for the next matching file in the volume.
65 @param Key Key is a pointer to a caller allocated
111 IN OUT VOID *Key,
133 KeyValue = (UINTN *) Key;
164 // remember the key
196 // remember the key
319 UINTN Key;
362 Key = 0;
367 &Key,
[all...] |
| /device/linaro/bootloader/edk2/Nt32Pkg/Library/PlatformBootManagerLib/ |
| MemoryTest.c | 54 EFI_INPUT_KEY Key;
66 ZeroMem (&Key, sizeof (EFI_INPUT_KEY));
194 KeyStatus = gST->ConIn->ReadKeyStroke (gST->ConIn, &Key);
195 if (!EFI_ERROR (KeyStatus) && (Key.ScanCode == SCAN_ESC)) {
|
| /device/linaro/bootloader/edk2/SecurityPkg/UserIdentification/UserProfileManagerDxe/ |
| ModifyIdentityPolicy.c | 35 EFI_INPUT_KEY Key;
44 &Key,
47 L"Press Any Key to Continue ...",
337 EFI_INPUT_KEY Key;
360 &Key,
363 L"Press Any Key to Continue ...",
376 &Key,
379 L"Press Any Key to Continue ...",
394 &Key,
397 L"Press Any Key to Continue ...",
[all...] |
| UserProfileAdd.c | 25 @retval EFI_ABORTED It is given up by pressing 'ESC' key.
36 EFI_INPUT_KEY Key;
46 &Key,
53 // Check key.
55 if (Key.ScanCode == SCAN_NULL) {
56 if (Key.UnicodeChar == CHAR_CARRIAGE_RETURN) {
63 } else if ((Key.UnicodeChar == CHAR_NULL) ||
64 (Key.UnicodeChar == CHAR_TAB) ||
65 (Key.UnicodeChar == CHAR_LINEFEED)
69 if (Key.UnicodeChar == CHAR_BACKSPACE) {
[all...] |
| UserProfileDelete.c | 187 EFI_INPUT_KEY Key;
242 &Key,
245 L"Please Press Any Key to Continue ...",
254 &Key,
257 L"Please Press Any Key to Continue ...",
|
| UserProfileManager.c | 172 EFI_INPUT_KEY Key;
488 &Key,
496 if (Key.UnicodeChar != CHAR_CARRIAGE_RETURN) {
512 &Key,
520 if (Key.UnicodeChar != CHAR_CARRIAGE_RETURN) {
|
| /external/avb/libavb/ |
| avb_rsa.c | 31 * key for computation. The code extends libmincrypt RSA verification code to
32 * support multiple RSA key lengths and hash digest algorithms.
40 typedef struct Key {
45 } Key;
47 Key* parse_key_data(const uint8_t* data, size_t length) {
49 Key* key = NULL; local
57 avb_error("Invalid key.\n");
63 avb_error("Unexpected key length.\n");
69 avb_error("Key does not match expected length.\n")
[all...] |
| /external/guice/core/test/com/google/inject/ |
| ReflectionTest.java | 44 Binding<Foo> fooBinding = injector.getBinding(Key.get(Foo.class));
48 assertEquals(Key.get(Foo.class), fooBinding.getKey());
58 Binding<?> i = injector.getBinding(Key.get(int.class, I.class));
62 assertEquals(Key.get(int.class, I.class), i.getKey());
71 bind(Key.get(Foo.class)).to(Key.get(Bar.class));
75 Binding<Foo> fooBinding = injector.getBinding(Key.get(Foo.class));
79 assertEquals(Key.get(Foo.class), fooBinding.getKey());
|
| /external/guice/core/test/com/google/inject/spi/ |
| HasDependenciesTest.java | 25 import com.google.inject.Key;
48 assertEquals(ImmutableSet.<Dependency<?>>of(Dependency.get(Key.get(Integer.class))),
61 assertEquals(Key.get(String.class), onlyDependency.getKey());
73 assertEquals(Key.get(String.class), onlyDependency.getKey());
90 return ImmutableSet.<Dependency<?>>of(Dependency.get(Key.get(Integer.class)));
97 return ImmutableSet.<Dependency<?>>of(Dependency.get(Key.get(Integer.class)));
|
| /external/libcxx/test/std/containers/ |
| map_allocator_requirement_test_templates.h | 36 typedef typename Container::key_type Key;
95 CHECKPOINT("Testing C::insert({key, value})");
164 typedef typename Container::key_type Key;
166 typedef typename std::pair<Key, Mapped> NonConstKeyPair;
223 CHECKPOINT("Testing C::insert(p, {key, value})");
255 CHECKPOINT("Testing C::insert(p, pair<Key, Mapped> const&)");
272 CHECKPOINT("Testing C::insert(p, pair<Key, Mapped>&&)");
297 typedef typename Container::key_type Key;
299 typedef typename std::pair<Key, Mapped> NonConstKeyPair;
357 CHECKPOINT("Testing C::emplace(pair<Key, Mapped> const&)")
[all...] |
| /external/llvm/lib/Target/Hexagon/MCTargetDesc/ |
| HexagonShuffler.cpp | 84 bool Key = (1 << s) & getUnits();
93 (Key << (SlotWeight * s)) * ((MaskWeight - countPopulation(getUnits()))
|
| /external/ltp/pan/ |
| reporter.c | 68 * I could get a key (tag), get it's sub-keys (TCIDs), then get the key
69 * again to reset to the top level, _then_ get the next key. That would
84 DBT Key, Data;
107 sym_seq(tags, &Key, &Data, R_FIRST);
117 *tl++ = Key.data;
119 } while (sym_seq(tags, &Key, &Data, R_NEXT) == 0);
177 * a "feature" of the key implimentation: I can insert a key tree
178 * under another key tree with almost zero brainwork because a SY
[all...] |
| /external/lzma/CPP/7zip/Crypto/ |
| 7zAes.h | 25 Byte Key[kKeySize];
46 bool Find(CKeyInfo &key);
47 // HRESULT Calculate(CKeyInfo &key);
48 void Add(CKeyInfo &key);
|
| /external/lzma/CPP/Common/ |
| CommandLineParser.h | 26 const char *Key;
|
| /external/openssh/ |
| key.h | 1 /* $OpenBSD: key.h,v 1.48 2015/07/03 03:43:18 djm Exp $ */
31 typedef struct sshkey Key;
62 void key_add_private(Key *);
63 Key *key_new_private(int);
64 void key_free(Key *);
65 Key *key_demote(const Key *);
66 int key_write(const Key *, FILE *);
67 int key_read(Key *, char **);
69 Key *key_generate(int, u_int)
[all...] |
| /external/skia/src/core/ |
| SkImageFilterCache.cpp | 28 typedef SkImageFilterCacheKey Key;
31 SkTDynamicHash<Value, Key>::Iter iter(&fLookup);
40 Value(const Key& key, SkSpecialImage* image, const SkIPoint& offset)
41 : fKey(key), fImage(SkRef(image)), fOffset(offset) {}
43 Key fKey;
46 static const Key& GetKey(const Value& v) {
49 static uint32_t Hash(const Key& key) {
50 return SkOpts::hash(reinterpret_cast<const uint32_t*>(&key), sizeof(Key))
[all...] |
| /external/smali/dexlib2/src/main/java/org/jf/dexlib2/writer/pool/ |
| TypeListPool.java | 37 import org.jf.dexlib2.writer.pool.TypeListPool.Key;
44 public class TypeListPool extends BaseNullableOffsetPool<Key<? extends Collection<? extends CharSequence>>>
45 implements TypeListSection<CharSequence, Key<? extends Collection<? extends CharSequence>>> {
54 Key<? extends Collection<? extends CharSequence>> key = new Key<Collection<? extends CharSequence>>(types); local
55 Integer prev = internedItems.put(key, 0);
65 public Collection<? extends CharSequence> getTypes(Key<? extends Collection<? extends CharSequence>> typesKey) {
72 @Override public int getNullableItemOffset(@Nullable Key<? extends Collection<? extends CharSequence>> key) {
[all...] |
| /external/v8/src/ast/ |
| context-slot-cache.h | 54 struct Key {
102 Key keys_[kLength];
|
| /external/v8/src/heap/ |
| array-buffer-tracker.h | 62 typedef JSArrayBuffer* Key;
71 inline void Add(Key key, const Value& value);
72 inline Value Remove(Key key);
88 bool IsTracked(Key key) {
89 return array_buffers_.find(key) != array_buffers_.end();
93 typedef std::unordered_map<Key, Value> TrackingData;
|
| /frameworks/native/include/input/ |
| KeyLayoutMap.h | 59 * Describes a mapping from keyboard scan codes and joystick axes to Android key codes and axes.
79 struct Key {
89 KeyedVector<int32_t, Key> mKeysByScanCode;
90 KeyedVector<int32_t, Key> mKeysByUsageCode;
97 const Key* getKey(int32_t scanCode, int32_t usageCode) const;
|
| /hardware/interfaces/drm/1.0/vts/functional/ |
| drm_hal_vendor_module_api.h | 35 * implementation generates a key request message, delivers it to the server
36 * and receives a key response message which is then loaded into the HAL. Once
135 * with a key request/response transaction. It allows the VTS test to
146 * Server to use when requesting a key response. This url will be
148 * key request to perform the key request transaction.
164 * Optional parameters to be associated with the key request
176 * key requests/responses. A vendor module should provide at least
186 struct Key {
188 * Indicate if the key content is configured to require secur
[all...] |
| /packages/apps/Test/connectivity/sl4n/rapidjson/include/rapidjson/ |
| prettywriter.h | 91 bool Key(const Ch* str, SizeType length, bool copy = false) { return String(str, length, copy); }
142 bool Key(const Ch* str) { return Key(str, internal::StrLen(str)); }
|
| /prebuilts/go/darwin-x86/src/internal/syscall/windows/registry/ |
| key.go | 9 // Here is a simple example, opening a registry key and reading a string value from it.
34 // Registry key security and access rights.
51 // Key is a handle to an open Windows registry key.
55 type Key syscall.Handle
61 // but they can also be used anywhere a Key is required.
62 CLASSES_ROOT = Key(syscall.HKEY_CLASSES_ROOT)
63 CURRENT_USER = Key(syscall.HKEY_CURRENT_USER)
64 LOCAL_MACHINE = Key(syscall.HKEY_LOCAL_MACHINE)
65 USERS = Key(syscall.HKEY_USERS
[all...] |
