summaryrefslogtreecommitdiffstats
path: root/src/tpm2/Memory_fp.h
diff options
context:
space:
mode:
authorDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-27 21:41:43 +0000
committerDaniel Baumann <daniel.baumann@progress-linux.org>2024-04-27 21:41:43 +0000
commit92cccad89d1c12b39165d5f0ed7ccd2d44965a1a (patch)
treef59a2764cd8c50959050a428bd8fc935138df750 /src/tpm2/Memory_fp.h
parentInitial commit. (diff)
downloadlibtpms-92cccad89d1c12b39165d5f0ed7ccd2d44965a1a.tar.xz
libtpms-92cccad89d1c12b39165d5f0ed7ccd2d44965a1a.zip
Adding upstream version 0.9.2.upstream/0.9.2upstream
Signed-off-by: Daniel Baumann <daniel.baumann@progress-linux.org>
Diffstat (limited to 'src/tpm2/Memory_fp.h')
-rw-r--r--src/tpm2/Memory_fp.h139
1 files changed, 139 insertions, 0 deletions
diff --git a/src/tpm2/Memory_fp.h b/src/tpm2/Memory_fp.h
new file mode 100644
index 0000000..082e8db
--- /dev/null
+++ b/src/tpm2/Memory_fp.h
@@ -0,0 +1,139 @@
+/********************************************************************************/
+/* */
+/* Miscellaneous Memory Manipulation Routines */
+/* Written by Ken Goldman */
+/* IBM Thomas J. Watson Research Center */
+/* $Id: Memory_fp.h 1476 2019-06-10 19:32:03Z kgoldman $ */
+/* */
+/* Licenses and Notices */
+/* */
+/* 1. Copyright Licenses: */
+/* */
+/* - Trusted Computing Group (TCG) grants to the user of the source code in */
+/* this specification (the "Source Code") a worldwide, irrevocable, */
+/* nonexclusive, royalty free, copyright license to reproduce, create */
+/* derivative works, distribute, display and perform the Source Code and */
+/* derivative works thereof, and to grant others the rights granted herein. */
+/* */
+/* - The TCG grants to the user of the other parts of the specification */
+/* (other than the Source Code) the rights to reproduce, distribute, */
+/* display, and perform the specification solely for the purpose of */
+/* developing products based on such documents. */
+/* */
+/* 2. Source Code Distribution Conditions: */
+/* */
+/* - Redistributions of Source Code must retain the above copyright licenses, */
+/* this list of conditions and the following disclaimers. */
+/* */
+/* - Redistributions in binary form must reproduce the above copyright */
+/* licenses, this list of conditions and the following disclaimers in the */
+/* documentation and/or other materials provided with the distribution. */
+/* */
+/* 3. Disclaimers: */
+/* */
+/* - THE COPYRIGHT LICENSES SET FORTH ABOVE DO NOT REPRESENT ANY FORM OF */
+/* LICENSE OR WAIVER, EXPRESS OR IMPLIED, BY ESTOPPEL OR OTHERWISE, WITH */
+/* RESPECT TO PATENT RIGHTS HELD BY TCG MEMBERS (OR OTHER THIRD PARTIES) */
+/* THAT MAY BE NECESSARY TO IMPLEMENT THIS SPECIFICATION OR OTHERWISE. */
+/* Contact TCG Administration (admin@trustedcomputinggroup.org) for */
+/* information on specification licensing rights available through TCG */
+/* membership agreements. */
+/* */
+/* - THIS SPECIFICATION IS PROVIDED "AS IS" WITH NO EXPRESS OR IMPLIED */
+/* WARRANTIES WHATSOEVER, INCLUDING ANY WARRANTY OF MERCHANTABILITY OR */
+/* FITNESS FOR A PARTICULAR PURPOSE, ACCURACY, COMPLETENESS, OR */
+/* NONINFRINGEMENT OF INTELLECTUAL PROPERTY RIGHTS, OR ANY WARRANTY */
+/* OTHERWISE ARISING OUT OF ANY PROPOSAL, SPECIFICATION OR SAMPLE. */
+/* */
+/* - Without limitation, TCG and its members and licensors disclaim all */
+/* liability, including liability for infringement of any proprietary */
+/* rights, relating to use of information in this specification and to the */
+/* implementation of this specification, and TCG disclaims all liability for */
+/* cost of procurement of substitute goods or services, lost profits, loss */
+/* of use, loss of data or any incidental, consequential, direct, indirect, */
+/* or special damages, whether under contract, tort, warranty or otherwise, */
+/* arising in any way out of use or reliance upon this specification or any */
+/* information herein. */
+/* */
+/* (c) Copyright IBM Corp. and others, 2016 - 2019 */
+/* */
+/********************************************************************************/
+
+#ifndef MEMORY_FP_H
+#define MEMORY_FP_H
+
+void
+MemoryCopy(
+ void *dest,
+ const void *src,
+ int sSize
+ );
+BOOL
+MemoryEqual(
+ const void *buffer1, // IN: compare buffer1
+ const void *buffer2, // IN: compare buffer2
+ unsigned int size // IN: size of bytes being compared
+ );
+LIB_EXPORT INT16
+MemoryCopy2B(
+ TPM2B *dest, // OUT: receiving TPM2B
+ const TPM2B *source, // IN: source TPM2B
+ unsigned int dSize // IN: size of the receiving buffer
+ );
+void
+MemoryConcat2B(
+ TPM2B *aInOut, // IN/OUT: destination 2B
+ TPM2B *bIn, // IN: second 2B
+ unsigned int aMaxSize // IN: The size of aInOut.buffer (max values for
+ // aInOut.size)
+ );
+BOOL
+MemoryEqual2B(
+ const TPM2B *aIn, // IN: compare value
+ const TPM2B *bIn // IN: compare value
+ );
+void
+MemorySet(
+ void *dest,
+ int value,
+ size_t size
+ );
+void
+MemoryPad2B(
+ TPM2B *b,
+ UINT16 newSize
+ );
+void
+Uint16ToByteArray(
+ UINT16 i,
+ BYTE *a
+ );
+void
+Uint32ToByteArray(
+ UINT32 i,
+ BYTE *a
+ );
+void
+Uint64ToByteArray(
+ UINT64 i,
+ BYTE *a
+ );
+UINT8
+ByteArrayToUint8(
+ BYTE *a
+ );
+UINT16
+ByteArrayToUint16(
+ BYTE *a
+ );
+UINT32
+ByteArrayToUint32(
+ BYTE *a
+ );
+UINT64
+ByteArrayToUint64(
+ BYTE *a
+ );
+
+
+#endif