| Jens Wiklander | ac27ec1 | 2015-07-15 15:23:14 +0200 | [diff] [blame^] | 1 | /* |
| 2 | * Copyright (c) 2015, Linaro Limited |
| 3 | * All rights reserved. |
| 4 | * |
| 5 | * Redistribution and use in source and binary forms, with or without |
| 6 | * modification, are permitted provided that the following conditions are met: |
| 7 | * |
| 8 | * 1. Redistributions of source code must retain the above copyright notice, |
| 9 | * this list of conditions and the following disclaimer. |
| 10 | * |
| 11 | * 2. Redistributions in binary form must reproduce the above copyright notice, |
| 12 | * this list of conditions and the following disclaimer in the documentation |
| 13 | * and/or other materials provided with the distribution. |
| 14 | * |
| 15 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 16 | * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 17 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 18 | * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
| 19 | * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 20 | * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 21 | * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 22 | * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 23 | * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 24 | * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 25 | * POSSIBILITY OF SUCH DAMAGE. |
| 26 | */ |
| 27 | |
| 28 | #ifndef TA_CONCURRENT_H |
| 29 | #define TA_CONCURRENT_H |
| 30 | |
| 31 | /* This UUID is generated with the ITU-T UUID generator at |
| 32 | http://www.itu.int/ITU-T/asn1/uuid.html */ |
| 33 | #define TA_CONCURRENT_UUID { 0xe13010e0, 0x2ae1, 0x11e5, \ |
| 34 | { 0x89, 0x6a, 0x00, 0x02, 0xa5, 0xd5, 0xc5, 0x1b } } |
| 35 | |
| 36 | struct ta_concurrent_shm { |
| 37 | uint32_t active_count; |
| 38 | }; |
| 39 | |
| 40 | /* |
| 41 | * Busy loops and updates max concurrency. params[0].memref should contain |
| 42 | * a struct ta_concurent_shm which can be used to tell how many instances |
| 43 | * of this function is running in parallel. |
| 44 | * |
| 45 | * in/out params[0].memref |
| 46 | * in/out params[1].value.a (input) number times to calcule the hash |
| 47 | * in/out params[1].value.b (output) max concurency |
| 48 | */ |
| 49 | |
| 50 | #define TA_CONCURRENT_CMD_BUSY_LOOP 0 |
| 51 | |
| 52 | /* |
| 53 | * Calculates a sha-256 hash over param[2].memref and stores the result in |
| 54 | * params[3].memref. params[0].memref should contain a struct |
| 55 | * ta_concurent_shm which can be used to tell how many instances of this |
| 56 | * function is running in parallel. |
| 57 | * |
| 58 | * in/out params[0].memref |
| 59 | * in/out params[1].value.a (input) number times to calcule the hash |
| 60 | * in/out params[1].value.b (output) max concurency |
| 61 | * in params[2].memref |
| 62 | * out params[3].memref |
| 63 | */ |
| 64 | #define TA_CONCURRENT_CMD_SHA256 1 |
| 65 | |
| 66 | #endif /*TA_OS_TEST_H */ |