From ae22f04769b754904a0b6fc188a54319381b702b Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Manuel=20P=C3=A9gouri=C3=A9-Gonnard?= Date: Fri, 12 Apr 2024 10:18:27 +0200 Subject: [PATCH] Refine paragraphs about incomplete entry points MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit Signed-off-by: Manuel Pégourié-Gonnard --- docs/architecture/testing/driver-interface-test-strategy.md | 6 ++++-- 1 file changed, 4 insertions(+), 2 deletions(-) diff --git a/docs/architecture/testing/driver-interface-test-strategy.md b/docs/architecture/testing/driver-interface-test-strategy.md index 89f3c9b843..ecd13a5dc3 100644 --- a/docs/architecture/testing/driver-interface-test-strategy.md +++ b/docs/architecture/testing/driver-interface-test-strategy.md @@ -177,8 +177,10 @@ they're available); Ideally, we'd want build options for the test drivers so that we can test with different combinations of entry points present, and make sure the core behaves appropriately when some entry points are absent but other entry points allow -implementing the operation. This is currently not supported by our test -drivers. +implementing the operation. This will remain hard to test until we have proper +support for JSON-defined drivers with auto-generation of dispatch code. +(The `MBEDTLS_PSA_ACCEL_xxx` macros we currently use are not expressive enough +to specify which entry points are support for a given mechanism.) Our implementation of PSA Crypto is structured in a way that the built-in implementation of each operation follows the driver API, see