| /src/external/apache2/llvm/dist/clang/include/clang/Tooling/ |
| ReplacementsYaml.h | 53 Keys(Io, R);
54 Io.mapRequired("FilePath", Keys->FilePath);
55 Io.mapRequired("Offset", Keys->Offset);
56 Io.mapRequired("Length", Keys->Length);
57 Io.mapRequired("ReplacementText", Keys->ReplacementText);
|
| DiagnosticsYaml.h | 86 MappingNormalization<NormalizedDiagnostic, clang::tooling::Diagnostic> Keys(
88 Io.mapRequired("DiagnosticName", Keys->DiagnosticName);
89 Io.mapRequired("DiagnosticMessage", Keys->Message);
90 Io.mapOptional("Notes", Keys->Notes);
91 Io.mapOptional("Level", Keys->DiagLevel);
92 Io.mapOptional("BuildDirectory", Keys->BuildDirectory);
|
| /src/external/apache2/llvm/dist/libcxx/benchmarks/ |
| ordered_set.bench.cpp | 36 void sortKeysBy(std::vector<uint64_t>& Keys, AccessPattern AP) {
40 std::shuffle(std::begin(Keys), std::end(Keys), M);
46 std::vector<uint64_t> Keys;
56 R.Keys.push_back(Hit == HitType::Hit ? 2 * I : 2 * I + 1);
59 sortKeysBy(R.Keys, Access);
85 std::vector<uint64_t> Keys(TableSize);
86 std::iota(Keys.begin(), Keys.end(), uint64_t{0});
87 sortKeysBy(Keys, Access())
[all...] |
| map.bench.cpp | 51 std::vector<uint64_t> Keys;
58 enum class Shuffle { None, Keys, Hints };
71 R.Keys.push_back(mode == Mode::Hit ? 2 * I + 2 : 2 * I + 1);
73 if (shuffle == Shuffle::Keys)
74 std::shuffle(R.Keys.begin(), R.Keys.end(), std::mt19937());
243 Order::value == ::Order::Random ? Shuffle::Keys : Shuffle::None, 1000);
246 for (auto K : Data.Keys) {
264 Order::value == ::Order::Random ? Shuffle::Keys
288 for (auto K : Data.Keys) {
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| DebugCheckers.cpp | 273 SmallVector<const Table::MapEntryTy *, 32> Keys;
276 Keys.push_back(&*I);
277 llvm::array_pod_sort(Keys.begin(), Keys.end(), compareEntry);
280 for (unsigned I = 0, E = Keys.size(); I != E; ++I)
281 llvm::errs() << Keys[I]->getKey() << " = "
282 << (Keys[I]->second.empty() ? "\"\"" : Keys[I]->second)
|
| /src/external/apache2/llvm/dist/llvm/lib/TextAPI/ |
| TextStub.cpp | 1024 MappingNormalization<NormalizedTBD, const InterfaceFile *> Keys(IO, File);
1025 IO.mapRequired("archs", Keys->Architectures);
1027 IO.mapOptional("uuids", Keys->UUIDs);
1028 IO.mapRequired("platform", Keys->Platforms);
1030 IO.mapOptional("flags", Keys->Flags, TBDFlags::None);
1031 IO.mapRequired("install-name", Keys->InstallName);
1032 IO.mapOptional("current-version", Keys->CurrentVersion,
1034 IO.mapOptional("compatibility-version", Keys->CompatibilityVersion,
1037 IO.mapOptional("swift-version", Keys->SwiftABIVersion, SwiftVersion(0));
1039 IO.mapOptional("swift-abi-version", Keys->SwiftABIVersion
[all...] |
| /src/external/mpl/bind/dist/bin/tests/system/kasp/ns4/ |
| purgekeys1.conf | 15 keys {
20 * Initially set to 0, so no keys are purged. Keys that are no longer
22 * reconfig the purge-keys value is set to 7 days, at least one key
26 purge-keys 0;
27 //purge-keys P7D;
|
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Refactoring/ |
| AtomicChange.cpp | 70 Keys(Io, Doc);
71 Io.mapRequired("Key", Keys->Key);
72 Io.mapRequired("FilePath", Keys->FilePath);
73 Io.mapRequired("Error", Keys->Error);
74 Io.mapRequired("InsertedHeaders", Keys->InsertedHeaders);
75 Io.mapRequired("RemovedHeaders", Keys->RemovedHeaders);
76 Io.mapRequired("Replacements", Keys->Replaces);
|
| /src/crypto/external/bsd/heimdal/lib/libhdb/ |
| Makefile | 25 ASN1_OPTS.hdb.asn1+= --one-code-file --sequence=HDB-Ext-KeySet --sequence=Keys
39 keys.c \
|
| /src/crypto/external/bsd/heimdal/dist/lib/hdb/ |
| hdb-protos.h | 58 * set with a historical keyset. If no historical keys are found then
180 const Keys */*keyset*/,
320 Key */*keys*/);
342 Key **/*keys*/,
352 Key **/*keys*/,
377 const Keys *
427 const Keys */*keyset*/,
453 * This function prunes an HDB entry's keys that are too old to have been used
|
| hdb.c | 124 const Keys *
134 return &e->keys;
143 return &hist_keys->val[i].keys;
152 const Keys *keyset,
156 const Keys *keys = keyset ? keyset : &e->keys; local
159 for (k = *key ? (*key) + 1 : keys->val; k < keys->val + keys->len; k++)
[all...] |
| NTMakefile | 40 $(BINDIR)\asn1_compile.exe --sequence=HDB-Ext-KeySet --sequence=Keys --one-code-file $(SRCDIR)\hdb.asn1 hdb_asn1
78 keys.c \
95 $(OBJ)\keys.obj \
|
| hdb-mitdb.c | 250 * MIT stores keys encrypted keys as {16-bit length
309 add_1des_dup(krb5_context context, Keys *keys, Key *key, krb5_keytype keytype)
312 return add_Keys(keys, key);
317 * similarity checking in the KDC. This helper function dups 1DES keys
318 * in a keyset for all the similar 1DES enctypes for which keys are
319 * missing. And, of course, we do this only if there's any 1DES keys in
323 dup_similar_keys_in_keyset(krb5_context context, Keys *keys)
[all...] |
| /src/crypto/external/bsd/heimdal/include/ |
| hdb-protos.h | 56 * set with a historical keyset. If no historical keys are found then
178 const Keys */*keyset*/,
318 Key */*keys*/);
340 Key **/*keys*/,
350 Key **/*keys*/,
375 const Keys *
425 const Keys */*keyset*/,
451 * This function prunes an HDB entry's keys that are too old to have been used
|
| /src/sbin/efi/ |
| showvar.c | 236 EFI_INPUT_KEY Keys[3];
285 printf(" {%04x, %04x}", u.ko->Keys[i].ScanCode,
286 u.ko->Keys[i].UnicodeChar);
294 printf(" Keys[%u].ScanCode: 0x%04x\n", i,
295 u.ko->Keys[i].ScanCode);
296 printf(" Keys[%u].UnicodeChar: 0x%04x\n", i,
297 u.ko->Keys[i].UnicodeChar);
|
| /src/external/apache2/llvm/dist/clang/lib/ASTMatchers/ |
| ASTMatchFinder.cpp | 62 // generation of keys for each type.
934 // Memoization keys that can be updated with the result.
937 std::vector<MatchKey> Keys;
940 for (const auto &Key : Keys) {
953 Keys.emplace_back();
954 Keys.back().MatcherID = Matcher.getID();
955 Keys.back().Node = Node;
956 Keys.back().BoundNodes = *Builder;
957 Keys.back().Traversal = Ctx.getParentMapContext().getTraversalKind();
958 Keys.back().Type = MatchType::Ancestors
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Edit/ |
| RewriteObjCFoundationAPI.cpp | 569 SmallVector<const Expr *, 8> Keys;
570 if (!getNSArrayObjects(Msg->getArg(1), NS, Keys))
573 if (Vals.size() != Keys.size())
583 objectifyExpr(Keys[i], commit);
586 SourceRange KeyRange = Keys[i]->getSourceRange();
593 SourceRange ArgRange(Keys.front()->getBeginLoc(), Keys.back()->getEndLoc());
625 SmallVector<const Expr *, 8> Keys;
626 if (!getNSArrayObjects(Msg->getArg(1), NS, Keys))
629 if (Vals.size() != Keys.size()
[all...] |
| /src/external/gpl2/gettext/dist/gettext-runtime/intl-csharp/ |
| intl.cs | 28 * - In the .NET resource approach, the keys are abstract textual shortcuts.
29 * In the GNU gettext approach, the keys are the English/ASCII version
458 /// Returns the keys of this resource set, i.e. the strings for which
461 public virtual ICollection Keys {
463 return Table.Keys;
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
| SIMachineFunctionInfo.h | 166 auto Keys = YamlIO.keys();
167 if (is_contained(Keys, "reg")) {
170 } else if (is_contained(Keys, "offset"))
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| VirtualFileSystem.cpp | 1346 DenseMap<StringRef, KeyStatus> &Keys) {
1347 if (!Keys.count(Key)) {
1351 KeyStatus &S = Keys[Key];
1361 bool checkMissingKeys(yaml::Node *Obj, DenseMap<StringRef, KeyStatus> &Keys) {
1362 for (const auto &I : Keys) {
1465 DenseMap<StringRef, KeyStatus> Keys(std::begin(Fields), std::end(Fields));
1484 if (!checkDuplicateOrUnknownKey(I.getKey(), Key, Keys))
1561 llvm_unreachable("key missing from Keys");
1568 // check for missing keys
1573 if (!checkMissingKeys(N, Keys))
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Tooling/Syntax/ |
| Tokens.cpp | 897 std::vector<FileID> Keys;
899 Keys.push_back(F.first);
900 llvm::sort(Keys);
902 for (FileID ID : Keys) {
|
| /src/crypto/external/bsd/heimdal/dist/lib/kadm5/ |
| set_keys.c | 41 * Set the keys of `ent' to the string-to-key of `password'
51 Key *keys; local
59 &keys, &num_keys);
63 _kadm5_free_keys (context->context, ent->keys.len, ent->keys.val);
64 ent->keys.val = keys;
65 ent->keys.len = num_keys;
99 * Set the keys of `ent' to (`n_key_data', `key_data')
115 Keys keys local
288 Key *keys; local
349 Key *keys; local
[all...] |
| /src/external/gpl2/gettext/dist/gettext-tools/src/ |
| msgunfmt.cs | 93 foreach (String key in catalog.Keys)
|
| /src/external/gpl3/gcc.old/dist/libphobos/src/std/ |
| array.d | 553 or from a range of keys and a range of values.
557 of tuples of keys and values.
558 keys = An $(REF_ALTTEXT input range, isInputRange, std,range,primitives) of keys
565 a range of keys and a range of values. If given two ranges of unequal
569 Duplicates: Associative arrays have unique keys. If r contains duplicate keys,
595 auto assocArray(Keys, Values)(Keys keys, Values values
[all...] |
| /src/external/bsd/ntp/dist/ntpd/ |
| ntp.conf.def | 502 if other than default, which symmetric keys are trusted
583 65,535 keys, each distinguished by a 32-bit key identifier, to
588 Keys and
591 .Pa ntp.keys ,
594 Besides the keys used
596 additional keys can be used as passwords for the
605 .Ic keys
606 configuration command and installs the keys
609 individual keys must be activated with the
614 several batches of keys an
[all...] |
