/********************************************************************************/ /* */ /* Hash */ /* Written by Ken Goldman */ /* IBM Thomas J. Watson Research Center */ /* */ /* (c) Copyright IBM Corporation 2015 - 2019 */ /* */ /* All rights reserved. */ /* */ /* Redistribution and use in source and binary forms, with or without */ /* modification, are permitted provided that the following conditions are */ /* met: */ /* */ /* Redistributions of source code must retain the above copyright notice, */ /* this list of conditions and the following disclaimer. */ /* */ /* Redistributions in binary form must reproduce the above copyright */ /* notice, this list of conditions and the following disclaimer in the */ /* documentation and/or other materials provided with the distribution. */ /* */ /* Neither the names of the IBM Corporation nor the names of its */ /* contributors may be used to endorse or promote products derived from */ /* this software without specific prior written permission. */ /* */ /* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS */ /* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT */ /* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR */ /* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT */ /* HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, */ /* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT */ /* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, */ /* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY */ /* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT */ /* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE */ /* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ /********************************************************************************/ /* */ #include #include #include #include #include #include #include #include static void printUsage(void); static void printHash(Hash_Out *out); extern int tssUtilsVerbose; int main(int argc, char *argv[]) { TPM_RC rc = 0; int i; /* argc iterator */ TSS_CONTEXT *tssContext = NULL; Hash_In in; Hash_Out out; char hierarchyChar = 'n'; TPMI_RH_HIERARCHY hierarchy = TPM_RH_NULL; TPMI_ALG_HASH halg = TPM_ALG_SHA256; const char *inFilename = NULL; const char *inString = NULL; const char *hashFilename = NULL; const char *ticketFilename = NULL; int noSpace = FALSE; size_t length = 0; uint8_t *buffer = NULL; /* for the free */ setvbuf(stdout, 0, _IONBF, 0); /* output may be going through pipe to log file */ TSS_SetProperty(NULL, TPM_TRACE_LEVEL, "1"); tssUtilsVerbose = FALSE; /* command line argument defaults */ for (i=1 ; (i sizeof(in.data.t.buffer)) { printf("Input data too long %lu\n", (unsigned long)length); rc = TSS_RC_INSUFFICIENT_BUFFER; } } if (rc == 0) { /* data to be hashed */ in.data.t.size = (uint16_t)length; /* cast safe, range tested above */ memcpy(in.data.t.buffer, buffer, length); } } if (inString != NULL) { if (rc == 0) { length = strlen(inString); if (length > sizeof(in.data.t.buffer)) { printf("Input data too long %lu\n", (unsigned long)length); rc = TSS_RC_INSUFFICIENT_BUFFER; } } if (rc == 0) { /* data to be hashed */ in.data.t.size = (uint16_t)length; /* cast safe, range tested above */ memcpy(in.data.t.buffer, inString, length); } } if (rc == 0) { in.hashAlg = halg; } /* Start a TSS context */ if (rc == 0) { rc = TSS_Create(&tssContext); } /* call TSS to execute the command */ if (rc == 0) { rc = TSS_Execute(tssContext, (RESPONSE_PARAMETERS *)&out, (COMMAND_PARAMETERS *)&in, NULL, TPM_CC_Hash, TPM_RH_NULL, NULL, 0); } { TPM_RC rc1 = TSS_Delete(tssContext); if (rc == 0) { rc = rc1; } } if ((rc == 0) && (hashFilename != NULL)) { rc = TSS_File_WriteBinaryFile(out.outHash.t.buffer, out.outHash.t.size, hashFilename); } if ((rc == 0) && (ticketFilename != NULL)) { rc = TSS_File_WriteStructure(&out.validation, (MarshalFunction_t)TSS_TPMT_TK_HASHCHECK_Marshalu, ticketFilename); } if (rc == 0) { if (tssUtilsVerbose) printHash(&out); if (noSpace) { uint32_t bp; for (bp = 0 ; bp < out.outHash.t.size ; bp++) { printf("%02x", out.outHash.t.buffer[bp]); } printf("\n"); } if (tssUtilsVerbose) printf("hash: success\n"); } else { const char *msg; const char *submsg; const char *num; printf("hash: failed, rc %08x\n", rc); TSS_ResponseCode_toString(&msg, &submsg, &num, rc); printf("%s%s%s\n", msg, submsg, num); rc = EXIT_FAILURE; } free(buffer); /* @1 */ return rc; } static void printHash(Hash_Out *out) { TSS_PrintAll("Hash", out->outHash.t.buffer, out->outHash.t.size); } static void printUsage(void) { printf("\n"); printf("hash\n"); printf("\n"); printf("Runs TPM2_Hash\n"); printf("\n"); printf("\t[-hi\thierarchy (e, o, p, n) (default null)]\n"); printf("\t\te endorsement, o owner, p platform, n null\n"); printf("\t[-halg\t(sha1, sha256, sha384, sha512) (default sha256)]\n"); printf("\t-if\tinput file to be hashed\n"); printf("\t-ic\tdata string to be hashed\n"); printf("\t[-ns\tno space, no text, no newlines]\n"); printf("\t[-oh\thash file name (default do not save)]\n"); printf("\t[-tk\tticket file name (default do not save)]\n"); exit(1); }