Home
last modified time | relevance | path

Searched refs:total (Results 1 – 25 of 28) sorted by relevance

12

/mbedtls-latest/tests/suites/
Dtest_suite_psa_crypto_driver_wrappers.function61 TEST_EQUAL(mbedtls_test_driver_pake_hooks.hits.total,
69 TEST_EQUAL(mbedtls_test_driver_pake_hooks.hits.total,
77 TEST_EQUAL(mbedtls_test_driver_pake_hooks.hits.total,
85 TEST_EQUAL(mbedtls_test_driver_pake_hooks.hits.total,
93 TEST_EQUAL(mbedtls_test_driver_pake_hooks.hits.total,
101 TEST_EQUAL(mbedtls_test_driver_pake_hooks.hits.total,
111 TEST_EQUAL(mbedtls_test_driver_pake_hooks.hits.total,
118 TEST_EQUAL(mbedtls_test_driver_pake_hooks.hits.total,
125 TEST_EQUAL(mbedtls_test_driver_pake_hooks.hits.total,
132 TEST_EQUAL(mbedtls_test_driver_pake_hooks.hits.total,
[all …]
Dtest_suite_asn1write.data208 ASN.1 Write AlgorithmIdentifier, total length=0x7f
211 ASN.1 Write AlgorithmIdentifier, total length=0x80
214 ASN.1 Write AlgorithmIdentifier, total length=0xff
217 ASN.1 Write AlgorithmIdentifier, total length=0x100
220 ASN.1 Write AlgorithmIdentifier, total length=0xffff
223 ASN.1 Write AlgorithmIdentifier, total length=0x10000
226 ASN.1 Write AlgorithmIdentifier, total length=0xffffff
229 ASN.1 Write AlgorithmIdentifier, total length=0x1000000
Dtest_suite_gcm.function553 // Test if potential total AD length overflow is handled properly
595 // Test if potential total input length overflow is handled properly
Dtest_suite_bignum_core.function1078 * extra_limbs may be negative but the total limb count must be positive.
/mbedtls-latest/library/
Dmd5.c52 ctx->total[0] = 0; in mbedtls_md5_starts()
53 ctx->total[1] = 0; in mbedtls_md5_starts()
215 left = ctx->total[0] & 0x3F; in mbedtls_md5_update()
218 ctx->total[0] += (uint32_t) ilen; in mbedtls_md5_update()
219 ctx->total[0] &= 0xFFFFFFFF; in mbedtls_md5_update()
221 if (ctx->total[0] < (uint32_t) ilen) { in mbedtls_md5_update()
222 ctx->total[1]++; in mbedtls_md5_update()
265 used = ctx->total[0] & 0x3F; in mbedtls_md5_finish()
286 high = (ctx->total[0] >> 29) in mbedtls_md5_finish()
287 | (ctx->total[1] << 3); in mbedtls_md5_finish()
[all …]
Dconstant_time.c151 void mbedtls_ct_memmove_left(void *start, size_t total, size_t offset) in mbedtls_ct_memmove_left() argument
154 for (size_t i = 0; i < total; i++) { in mbedtls_ct_memmove_left()
155 mbedtls_ct_condition_t no_op = mbedtls_ct_uint_gt(total - offset, i); in mbedtls_ct_memmove_left()
159 for (size_t n = 0; n < total - 1; n++) { in mbedtls_ct_memmove_left()
164 buf[total-1] = mbedtls_ct_uint_if_else_0(no_op, buf[total-1]); in mbedtls_ct_memmove_left()
Dripemd160.c53 ctx->total[0] = 0; in mbedtls_ripemd160_starts()
54 ctx->total[1] = 0; in mbedtls_ripemd160_starts()
278 left = ctx->total[0] & 0x3F; in mbedtls_ripemd160_update()
281 ctx->total[0] += (uint32_t) ilen; in mbedtls_ripemd160_update()
282 ctx->total[0] &= 0xFFFFFFFF; in mbedtls_ripemd160_update()
284 if (ctx->total[0] < (uint32_t) ilen) { in mbedtls_ripemd160_update()
285 ctx->total[1]++; in mbedtls_ripemd160_update()
335 high = (ctx->total[0] >> 29) in mbedtls_ripemd160_finish()
336 | (ctx->total[1] << 3); in mbedtls_ripemd160_finish()
337 low = (ctx->total[0] << 3); in mbedtls_ripemd160_finish()
[all …]
Dsha1.c52 ctx->total[0] = 0; in mbedtls_sha1_starts()
53 ctx->total[1] = 0; in mbedtls_sha1_starts()
250 left = ctx->total[0] & 0x3F; in mbedtls_sha1_update()
253 ctx->total[0] += (uint32_t) ilen; in mbedtls_sha1_update()
254 ctx->total[0] &= 0xFFFFFFFF; in mbedtls_sha1_update()
256 if (ctx->total[0] < (uint32_t) ilen) { in mbedtls_sha1_update()
257 ctx->total[1]++; in mbedtls_sha1_update()
301 used = ctx->total[0] & 0x3F; in mbedtls_sha1_finish()
322 high = (ctx->total[0] >> 29) in mbedtls_sha1_finish()
323 | (ctx->total[1] << 3); in mbedtls_sha1_finish()
[all …]
Dsha256.c264 ctx->total[0] = 0; in mbedtls_sha256_starts()
265 ctx->total[1] = 0; in mbedtls_sha256_starts()
657 left = ctx->total[0] & 0x3F; in mbedtls_sha256_update()
660 ctx->total[0] += (uint32_t) ilen; in mbedtls_sha256_update()
661 ctx->total[0] &= 0xFFFFFFFF; in mbedtls_sha256_update()
663 if (ctx->total[0] < (uint32_t) ilen) { in mbedtls_sha256_update()
664 ctx->total[1]++; in mbedtls_sha256_update()
711 used = ctx->total[0] & 0x3F; in mbedtls_sha256_finish()
732 high = (ctx->total[0] >> 29) in mbedtls_sha256_finish()
733 | (ctx->total[1] << 3); in mbedtls_sha256_finish()
[all …]
Dsha512.c260 ctx->total[0] = 0; in mbedtls_sha512_starts()
261 ctx->total[1] = 0; in mbedtls_sha512_starts()
772 left = (unsigned int) (ctx->total[0] & 0x7F); in mbedtls_sha512_update()
775 ctx->total[0] += (uint64_t) ilen; in mbedtls_sha512_update()
777 if (ctx->total[0] < (uint64_t) ilen) { in mbedtls_sha512_update()
778 ctx->total[1]++; in mbedtls_sha512_update()
825 used = ctx->total[0] & 0x7F; in mbedtls_sha512_finish()
846 high = (ctx->total[0] >> 61) in mbedtls_sha512_finish()
847 | (ctx->total[1] << 3); in mbedtls_sha512_finish()
848 low = (ctx->total[0] << 3); in mbedtls_sha512_finish()
Dconstant_time_internal.h466 size_t total,
/mbedtls-latest/tests/src/drivers/
Dtest_driver_pake.c28 mbedtls_test_driver_pake_hooks.hits.total++; in mbedtls_test_transparent_pake_setup()
61 mbedtls_test_driver_pake_hooks.hits.total++; in mbedtls_test_transparent_pake_output()
110 mbedtls_test_driver_pake_hooks.hits.total++; in mbedtls_test_transparent_pake_input()
143 mbedtls_test_driver_pake_hooks.hits.total++; in mbedtls_test_transparent_pake_get_implicit_key()
174 mbedtls_test_driver_pake_hooks.hits.total++; in mbedtls_test_transparent_pake_abort()
/mbedtls-latest/scripts/
Dmassif_max.pl30 my $total = $heap + $heap_extra + $stack;
31 if( $total > $max ) {
32 ($max, $max_heap, $max_he, $max_stack) = ($total, $heap, $heap_extra, $stack);
Dcode_size_compare.py487 self.total = dec # total <=> dec
576 size_entry.bss, size_entry.total))
/mbedtls-latest/docs/architecture/psa-migration/
Doutcome-analysis.sh104 total=$(grep -c "$pattern_suite" "$ref")
113 $name $total $nb_ref $nb_new
/mbedtls-latest/include/mbedtls/
Dmd5.h40 uint32_t MBEDTLS_PRIVATE(total)[2]; /*!< number of bytes processed */
Dripemd160.h31 uint32_t MBEDTLS_PRIVATE(total)[2]; /*!< number of bytes processed */
Dsha1.h46 uint32_t MBEDTLS_PRIVATE(total)[2]; /*!< The number of Bytes processed. */
Dsha256.h42 uint32_t MBEDTLS_PRIVATE(total)[2]; /*!< The number of Bytes processed. */
Dsha512.h40 uint64_t MBEDTLS_PRIVATE(total)[2]; /*!< The number of Bytes processed. */
/mbedtls-latest/tests/include/test/drivers/
Dpake.h25 unsigned long total; member
/mbedtls-latest/docs/architecture/
Dpsa-keystore-design.md96 …f size `MBEDTLS_PSA_KEY_SLOT_COUNT`. This value is an upper bound for the total number of volatile…
125 …s to memory consumption are likely to involve calls to `free()` which may total $O(k)$ memory wher…
Dpsa-storage-resilience.md129 …ement state and writing a different state after that, this will require a total of 4 updates to in…
/mbedtls-latest/3rdparty/p256-m/p256-m/
DREADME.md103 2. attackers who can also measure the total computation time of the operation;
/mbedtls-latest/docs/proposed/
Dpsa-driver-interface.md859 …not collect enough entropy, the core makes more similar rounds, until the total amount of collecte…
979 …_i$ and an entropy estimate $e_i$ on the $i$th call. It does so until the total entropy estimate $…
1005 …s nonzero, the core must have called `"add_entropy"` at least once with a total of at least `"init…

12