Home
last modified time | relevance | path

Searched refs:TPMU_HA (Results 1 – 17 of 17) sorted by relevance

/external/tpm2/
DGetRandom.c20 if(in->bytesRequested > sizeof(TPMU_HA)) in TPM2_GetRandom()
21 out->randomBytes.t.size = sizeof(TPMU_HA); in TPM2_GetRandom()
DContext_spt.c31 BYTE kdfResult[sizeof(TPMU_HA) * 2];// Value produced by the KDF in ComputeContextProtectionKey()
Dmarshal_test.c353 value.t.size = sizeof(TPMU_HA)-1; in StructureSuccessArrayTest()
355 UINT16 expected_bytes = sizeof(UINT16)+(sizeof(TPMU_HA)-1)*sizeof(BYTE); in StructureSuccessArrayTest()
DEntity.c232 MemoryCopy(auth, authValue.t.buffer, authValue.t.size, sizeof(TPMU_HA)); in EntityGetAuthValue()
DPropertyCap.c190 *value = sizeof(TPMU_HA); in TPMPropertyIsDefined()
Dtpm_types.h612 } TPMU_HA; typedef
617 TPMU_HA digest;
624 BYTE buffer[sizeof(TPMU_HA)];
DGlobal.h97 typedef BYTE AUTH_VALUE[sizeof(TPMU_HA)];
DSession.c607 pAssert(auth.t.size <= sizeof(TPMU_HA)); in SessionComputeBoundEntity()
Dtpm_generated.h1359 UINT16 TPMU_HA_Marshal(TPMU_HA* source,
1364 TPM_RC TPMU_HA_Unmarshal(TPMU_HA* target,
Dtpm_generated.c497 if (target->t.size > sizeof(TPMU_HA)) { in TPM2B_DIGEST_Unmarshal()
5330 UINT16 TPMU_HA_Marshal(TPMU_HA* source, in TPMU_HA_Marshal()
5387 TPM_RC TPMU_HA_Unmarshal(TPMU_HA* target, in TPMU_HA_Unmarshal()
Dpart4.txt1662 An AUTH_VALUE is a BYTE array containing a digest (TPMU_HA)
1664 39 typedef BYTE AUTH_VALUE[sizeof(TPMU_HA)];
6278 16 BYTE kdfResult[sizeof(TPMU_HA) * 2];// Value produced by the KDF
14869 522 pAssert(auth.t.size <= sizeof(TPMU_HA));
16801 199 MemoryCopy(auth, authValue.t.buffer, authValue.t.size, sizeof(TPMU_HA));
18551 169 *value = sizeof(TPMU_HA);
Dpart3.txt6369 14 if(in->bytesRequested > sizeof(TPMU_HA))
6370 15 out->randomBytes.t.size = sizeof(TPMU_HA);
/external/tpm2/generator/
Dstructures.txt923 _TYPE TPMU_HA
930 _MAX size sizeof(TPMU_HA)
1568 _UNION TPMU_HA
Draw_structures.txt368 TPMU_HA (Hash) ....................................................................................…
888 Table 67 — Definition of TPMU_HA Union <IN/OUT, S> ................................................…
10224 10.2.1 TPMU_HA (Hash)
10225 A TPMU_HA is a union of all the hash algorithms implemented on a TPM. Table 67 is exemplary and
10234 Table 67 — Definition of TPMU_HA Union <IN/OUT, S>
10298 largest hash algorithm in the TPMU_HA union.
10317 TPMU_HA
10397 buffer[size]{:sizeof(TPMU_HA)}
Draw_structures_fixed.txt368 TPMU_HA (Hash) ....................................................................................…
888 Table 67 — Definition of TPMU_HA Union <IN/OUT, S> ................................................…
10237 10.2.1 TPMU_HA (Hash)
10238 A TPMU_HA is a union of all the hash algorithms implemented on a TPM. Table 67 is exemplary and
10247 Table 67 — Definition of TPMU_HA Union <IN/OUT, S>
10311 largest hash algorithm in the TPMU_HA union.
10330 TPMU_HA
10410 buffer [size] {:sizeof(TPMU_HA)}
Draw_commands_fixed.txt11104 if(in->bytesRequested > sizeof(TPMU_HA))
11105 out->randomBytes.t.size = sizeof(TPMU_HA);
Draw_commands.txt11093 if(in->bytesRequested > sizeof(TPMU_HA))
11094 out->randomBytes.t.size = sizeof(TPMU_HA);