| /device/google/bluejay/vibrator/cs40l26/proto/ |
| D | capo.proto | 109 // The amount of time that the algorithm's computed stillness confidence
111 // state. Increasing this value will make the algorithm take longer to
116 // this value will effectively smooth the input data, making the algorithm
122 // algorithm must be 100% certain that the device is moving before entering
124 // is ignored and the algorithm is immediately transitioned into the in
130 // algorithm must be 100% certain that the device is stationary before
134 // The variance threshold for the StillnessDetector algorithm. Increasing
135 // this value causes the algorithm to be less likely to detect motion.
138 // The variance threshold delta for the StillnessDetector algorithm about
|
| /device/google/lynx/vibrator/cs40l26/proto/ |
| D | capo.proto | 109 // The amount of time that the algorithm's computed stillness confidence
111 // state. Increasing this value will make the algorithm take longer to
116 // this value will effectively smooth the input data, making the algorithm
122 // algorithm must be 100% certain that the device is moving before entering
124 // is ignored and the algorithm is immediately transitioned into the in
130 // algorithm must be 100% certain that the device is stationary before
134 // The variance threshold for the StillnessDetector algorithm. Increasing
135 // this value causes the algorithm to be less likely to detect motion.
138 // The variance threshold delta for the StillnessDetector algorithm about
|
| /device/google/cuttlefish/host/commands/secure_env/ |
| D | tpm_keymaster_context.cpp | 120 keymaster_algorithm_t algorithm) const { in GetKeyFactory()
121 auto it = key_factories_.find(algorithm); in GetKeyFactory()
123 LOG(ERROR) << "Could not find key factory for " << algorithm; in GetKeyFactory()
130 keymaster_algorithm_t algorithm, keymaster_purpose_t purpose) const { in GetOperationFactory() argument
131 auto key_factory = GetKeyFactory(algorithm); in GetOperationFactory()
134 << " for invalid algorithm " << algorithm; in GetOperationFactory()
140 << " from key factory for " << algorithm; in GetOperationFactory()
247 keymaster_algorithm_t algorithm; in ParseKeyBlob() local
248 if (!hw_enforced.GetTagValue(keymaster::TAG_ALGORITHM, &algorithm) && in ParseKeyBlob()
249 !sw_enforced.GetTagValue(keymaster::TAG_ALGORITHM, &algorithm)) { in ParseKeyBlob()
[all …]
|
| D | tpm_attestation_record.cpp | 79 TpmAttestationRecordContext::GetAttestationKey(keymaster_algorithm_t algorithm, in GetAttestationKey() argument
81 return keymaster::KeymasterKeyBlob(*keymaster::getAttestationKey(algorithm, error)); in GetAttestationKey()
85 TpmAttestationRecordContext::GetAttestationChain(keymaster_algorithm_t algorithm, in GetAttestationChain() argument
87 return keymaster::getAttestationChain(algorithm, error); in GetAttestationChain()
|
| D | proxy_keymaster_context.h | 63 keymaster_algorithm_t algorithm) const override { in GetKeyFactory() argument
64 return wrapped_.GetKeyFactory(algorithm); in GetKeyFactory()
67 keymaster_algorithm_t algorithm, in GetOperationFactory() argument
69 return wrapped_.GetOperationFactory(algorithm, purpose); in GetOperationFactory()
|
| D | tpm_attestation_record.h | 43 keymaster_algorithm_t algorithm, keymaster_error_t* error) const override;
45 keymaster_algorithm_t algorithm, keymaster_error_t* error) const override;
|
| D | tpm_keymaster_context.h | 73 keymaster_algorithm_t algorithm) const override;
75 keymaster_algorithm_t algorithm,
|
| D | primary_key_builder.cpp | 48 .algorithm = TPM2_ALG_AES, in ParentKey()
|
| D | encrypted_serializable.cpp | 63 .algorithm = TPM2_ALG_AES, in CreateKey()
|
| /device/generic/vulkan-cereal/third-party/angle/src/libANGLE/renderer/vulkan/doc/ |
| D | OpenGLLineSegmentRasterization.md | 6 For single sample rendering Vulkan uses an algorithm based on quad coverage. A small shape is
10 OpenGL's algorithm is based on [Bresenham's line algorithm][Bresenham]. Bresenham's algorithm
12 multisampling. When compared visually you can see the Vulkan line segment rasterization algorithm
|
| /device/mediatek/wembley-sepolicy/non_plat/ |
| D | thermalloadalgod.te | 17 # Purpose : thermal algorithm daemon for access driver node
29 # Purpose : thermal algorithm daemon for SPA
|
| D | cameraserver.te | 208 # Purpose : 3A algorithm need to access sensor service
|
| D | mediaserver.te | 230 # Purpose : 3A algorithm need to access sensor service
|
| /device/generic/vulkan-cereal/third-party/angle/src/common/third_party/xxhash/ |
| D | README.chromium | 8 Extremely fast non-cryptographic hash algorithm
|
| D | README.md | 1 xxHash - Extremely fast hash algorithm
4 xxHash is an Extremely fast Hash algorithm, running at RAM speed limits.
|
| /device/generic/vulkan-cereal/third-party/angle/src/common/third_party/base/ |
| D | README.angle | 15 base::SHA1 is a secure hashing algorithm.
|
| /device/generic/vulkan-cereal/third-party/angle/extensions/ |
| D | ANGLE_texture_compression_dxt.txt | 92 algorithm support only 2D images without borders.
|
| D | ANGLE_lossy_etc_decode.txt | 107 The GL and the ETC texture compression algorithm support only 2D images
|
| D | ANGLE_texture_multisample.txt | 493 compression algorithm is likely data-dependent, the returned component sizes
|
| /device/generic/vulkan-cereal/third-party/angle/tools/flex-bison/third_party/m4sugar/ |
| D | m4sugar.m4 | 943 # When developing an m4sugar algorithm, you could temporarily use
1016 # checked for consistency. The algorithm is robust to indirect
1113 # But wait - now the algorithm is quadratic, because every recursion of
1114 # the algorithm keeps the entire LIST and merely adds another m4_shift to
1765 # expanded, the Axel Thimm algorithm states that we can treat it as a
2385 # .* portion. The algorithm is simpler by avoiding `?' at the end. The
2386 # algorithm correctly strips everything if STRING is just ` '.
2534 # as the algorithm no longer guarantees uniqueness.
2628 # which complicates it a bit. The algorithm is otherwise stupid and simple:
2632 # The algorithm uses a helper that uses $2 through $4 directly, rather than
[all …]
|
| D | foreach.m4 | 32 # algorithm on n arguments that recurses with one less argument each
|
| /device/generic/vulkan-cereal/third-party/angle/src/libANGLE/renderer/metal/ |
| D | mtl_resources.mm | 14 #include <algorithm>
|
| /device/generic/vulkan-cereal/fake-android-guest/libvulkan/ |
| D | code-generator.tmpl | 95 #include <algorithm>
276 #include <algorithm>
|
| /device/generic/vulkan-cereal/protocols/vulkan/chapters/ |
| D | tessellation.txt | 356 The algorithm used to subdivide the triangular domain in (u,v,w) space into
452 The algorithm used to subdivide the rectangular domain in (u,v) space into
|
| D | primsrast.txt | 2649 from the non-strict line algorithm described above in the following ways:
2696 image::{images}/bresenham.svg[title="Visualization of Bresenham's algorithm",align="center",opts="{…
2714 characterization of fragments reduces to Bresenham's algorithm with one
2719 Bresenham's algorithm).
2724 * The coordinates of a fragment produced by the algorithm must: not
2727 * The total number of fragments produced by the algorithm must: not differ
3145 produced by the rasterization algorithm.
3163 One algorithm that achieves the required behavior is to triangulate a
|