1 /* Microsoft Reference Implementation for TPM 2.0 2 * 3 * The copyright in this software is being made available under the BSD License, 4 * included below. This software may be subject to other third party and 5 * contributor rights, including patent rights, and no such rights are granted 6 * under this license. 7 * 8 * Copyright (c) Microsoft Corporation 9 * 10 * All rights reserved. 11 * 12 * BSD License 13 * 14 * Redistribution and use in source and binary forms, with or without modification, 15 * are permitted provided that the following conditions are met: 16 * 17 * Redistributions of source code must retain the above copyright notice, this list 18 * of conditions and the following disclaimer. 19 * 20 * Redistributions in binary form must reproduce the above copyright notice, this 21 * list of conditions and the following disclaimer in the documentation and/or 22 * other materials provided with the distribution. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ""AS IS"" 25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 27 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR 28 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES 29 * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; 30 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON 31 * ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 32 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 33 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 34 */ 35 // This file contains constant definitions used for self-test. 36 37 #ifndef _CRYPT_TEST_H 38 #define _CRYPT_TEST_H 39 40 // This is the definition of a bit array with one bit per algorithm. 41 // NOTE: Since bit numbering starts at zero, when TPM_ALG_LAST is a multiple of 8, 42 // ALGORITHM_VECTOR will need to have byte for the single bit in the last byte. So, 43 // for example, when TPM_ALG_LAST is 8, ALGORITHM_VECTOR will need 2 bytes. 44 #define ALGORITHM_VECTOR_BYTES ((TPM_ALG_LAST + 8) / 8) 45 typedef BYTE ALGORITHM_VECTOR[ALGORITHM_VECTOR_BYTES]; 46 47 #ifdef TEST_SELF_TEST 48 LIB_EXPORT extern ALGORITHM_VECTOR LibToTest; 49 #endif 50 51 // This structure is used to contain self-test tracking information for the 52 // cryptographic modules. Each of the major modules is given a 32-bit value in 53 // which it may maintain its own self test information. The convention for this 54 // state is that when all of the bits in this structure are 0, all functions need 55 // to be tested. 56 typedef struct 57 { 58 UINT32 rng; 59 UINT32 hash; 60 UINT32 sym; 61 #if ALG_RSA 62 UINT32 rsa; 63 #endif 64 #if ALG_ECC 65 UINT32 ecc; 66 #endif 67 } CRYPTO_SELF_TEST_STATE; 68 69 70 #endif // _CRYPT_TEST_H 71