Home
last modified time | relevance | path

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

/system/tpm/trunks/
Dtpm_generated.h952 union TPMU_HA { union
962 TPMU_HA digest;
967 BYTE buffer[sizeof(TPMU_HA)];
3587 const TPMU_HA& value,
3592 TPMU_HA* value,
Dtpm_generated.cc2273 const TPMU_HA& value, in Serialize_TPMU_HA()
2348 TPMU_HA* value, in Parse_TPMU_HA()
/system/tpm/trunks/generator/
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> ................................................…
10252 10.2.1 TPMU_HA (Hash)
10253 A TPMU_HA is a union of all the hash algorithms implemented on a TPM. Table 67 is exemplary and
10262 Table 67 — Definition of TPMU_HA Union <IN/OUT, S>
10326 largest hash algorithm in the TPMU_HA union.
10345 TPMU_HA
10425 buffer[size]{:sizeof(TPMU_HA)}
Draw_commands.txt11093 if(in->bytesRequested > sizeof(TPMU_HA))
11094 out->randomBytes.t.size = sizeof(TPMU_HA);
Draw_commands_fixed.txt11104 if(in->bytesRequested > sizeof(TPMU_HA))
11105 out->randomBytes.t.size = sizeof(TPMU_HA);