/device/linaro/bootloader/edk2/SecurityPkg/Tcg/Tcg2Smm/ |
Tcg2Smm.c | 2 It updates TPM2 items in ACPI table and registers SMI2 callback
165 Find the operation region in TCG ACPI table by given Name and Size,
168 @param[in, out] Table The TPM item in ACPI table.
169 @param[in] Name The name string to find in TPM table.
177 EFI_ACPI_DESCRIPTION_HEADER *Table,
191 for (OpRegion = (AML_OP_REGION_32_8 *) (Table + 1);
192 OpRegion <= (AML_OP_REGION_32_8 *) ((UINT8 *) Table + Table->Length);
212 Initialize and publish TPM items in ACPI table. [all...] |
/external/sfntly/cpp/src/test/ |
verify_hmtx.cc | 19 #include "sfntly/table/core/horizontal_metrics_table.h" 49 static bool VerifyHMTX(Table* table) { 50 HorizontalMetricsTablePtr hmtx = down_cast<HorizontalMetricsTable*>(table); 70 bool VerifyHMTX(Table* original, Table* target) {
|
verify_maxp.cc | 20 #include "sfntly/table/core/maximum_profile_table.h" 40 static bool VerifyMAXP(Table* table) { 41 MaximumProfileTablePtr maxp = down_cast<MaximumProfileTable*>(table); 66 bool VerifyMAXP(Table* original, Table* target) {
|
verify_name.cc | 19 #include "sfntly/table/core/name_table.h" 40 static bool VerifyNAME(Table* table) { 43 NameTablePtr name = down_cast<NameTable*>(table); 62 bool VerifyNAME(Table* original, Table* target) {
|
/external/guava/guava-tests/test/com/google/common/collect/ |
TableCollectionTest.java | 25 import com.google.common.collect.Table.Cell; 53 * Collection tests for {@link Table} implementations. 118 // Not testing rowKeySet() or columnKeySet() of Table.transformValues() 123 Table<String, Integer, Character> table 126 populateForRowKeySet(table, elements); 127 return table.rowKeySet(); 139 Table<String, Integer, Character> table = HashBasedTable.create(); 140 populateForRowKeySet(table, elements) 619 Table<String, Integer, Character> table = createTable(); local 676 Table<Character, String, Integer> table = makeTable(); local 749 Table<Character, String, Integer> table = HashBasedTable.create(); local 754 Table<Character, String, Integer> table = HashBasedTable.create(); local 769 Table<Character, String, Integer> table = HashBasedTable.create(); local 774 Table<Character, String, Integer> table = HashBasedTable.create(); local 789 RowSortedTable<Character, String, Integer> table = TreeBasedTable.create(); local 794 RowSortedTable<Character, String, Integer> table = TreeBasedTable.create(); local 817 Table<String, Character, Integer> table = makeTable(); local 883 Table<String, Character, Integer> table = HashBasedTable.create(); local 888 Table<String, Character, Integer> table = HashBasedTable.create(); local 903 Table<String, Character, Integer> table = HashBasedTable.create(); local 908 Table<String, Character, Integer> table = HashBasedTable.create(); local 923 RowSortedTable<String, Character, Integer> table = TreeBasedTable.create(); local 928 RowSortedTable<String, Character, Integer> table = TreeBasedTable.create(); local 1001 Table<String, Integer, Character> table = makeTable(); local 1059 TreeBasedTable<String, Integer, Character> table = local 1067 TreeBasedTable<String, Integer, Character> table = makeTable(); local 1087 TreeBasedTable<String, Integer, Character> table = local 1095 TreeBasedTable<String, Integer, Character> table = makeTable(); local 1115 TreeBasedTable<String, Integer, Character> table = local 1124 TreeBasedTable<String, Integer, Character> table = makeTable(); local 1158 Table<String, Integer, String> table = HashBasedTable.create(); local 1178 Table<String, Integer, Character> table = HashBasedTable.create(); local 1198 RowSortedTable<String, Integer, Character> table = TreeBasedTable.create(); local 1217 Table<Integer, String, Character> table = makeTable(); local 1277 Table<Integer, String, String> table = HashBasedTable.create(); local 1297 Table<Integer, String, Character> table = HashBasedTable.create(); local 1317 RowSortedTable<Integer, String, Character> table = TreeBasedTable.create(); local [all...] |
ImmutableTableTest.java | 31 @Override protected Table<String, Integer, Character> create(Object... data) { 48 Table<Character, Integer, String> expectedTable = HashBasedTable.create(); 52 Table<Character, Integer, String> otherTable = HashBasedTable.create(); 101 Table.Cell<Character, Integer, String> mutableCell = 160 private static <R, C, V> void validateTableCopies(Table<R, C, V> original) { 161 Table<R, C, V> copy = ImmutableTable.copyOf(original); 165 Table<R, C, V> built 172 Table<R, C, V> original, Table<R, C, V> copy) { 179 Table<Character, Integer, String> table = TreeBasedTable.create() local 194 Table<Character, Integer, String> table = TreeBasedTable.create(); local 208 Table<Character, Integer, String> table = TreeBasedTable.create(); local 221 Table<Character, Integer, String> table = HashBasedTable.create(); local 251 Table<Character, Integer, String> table = builder.build(); local 273 Table<Character, Integer, String> table = builder.build(); local 295 Table<Character, Integer, String> table = builder.build(); local 312 Table<Character, Integer, String> table = builder.build(); local 330 Table<Character, Integer, String> table = builder.build(); local 347 Table<Character, Integer, String> table = builder.build(); local [all...] |
AbstractTableReadTest.java | 30 * Test cases for {@link Table} read operations. 36 protected Table<String, Integer, Character> table; field in class:AbstractTableReadTest 39 * Creates a table with the specified data. 41 * @param data the table data, repeating the sequence row key, column key, 47 protected abstract Table<String, Integer, Character> 51 assertEquals(expectedSize, table.size()); 56 table = create(); 60 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); 61 assertTrue(table.contains("foo", 1)) [all...] |
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
ImmutableTableTest.java | 30 @Override protected Table<String, Integer, Character> create(Object... data) { 47 Table<Character, Integer, String> expectedTable = HashBasedTable.create(); 51 Table<Character, Integer, String> otherTable = HashBasedTable.create(); 100 Table.Cell<Character, Integer, String> mutableCell = 159 private static <R, C, V> void validateTableCopies(Table<R, C, V> original) { 160 Table<R, C, V> copy = ImmutableTable.copyOf(original); 164 Table<R, C, V> built 171 Table<R, C, V> original, Table<R, C, V> copy) { 178 Table<Character, Integer, String> table = TreeBasedTable.create() local 193 Table<Character, Integer, String> table = TreeBasedTable.create(); local 207 Table<Character, Integer, String> table = TreeBasedTable.create(); local 220 Table<Character, Integer, String> table = HashBasedTable.create(); local 250 Table<Character, Integer, String> table = builder.build(); local 272 Table<Character, Integer, String> table = builder.build(); local 294 Table<Character, Integer, String> table = builder.build(); local 311 Table<Character, Integer, String> table = builder.build(); local 329 Table<Character, Integer, String> table = builder.build(); local 346 Table<Character, Integer, String> table = builder.build(); local [all...] |
AbstractTableReadTest.java | 28 * Test cases for {@link Table} read operations. 34 protected Table<String, Integer, Character> table; field in class:AbstractTableReadTest 37 * Creates a table with the specified data. 39 * @param data the table data, repeating the sequence row key, column key, 45 protected abstract Table<String, Integer, Character> 49 assertEquals(expectedSize, table.size()); 54 table = create(); 58 table = create("foo", 1, 'a', "bar", 1, 'b', "foo", 3, 'c'); 59 assertTrue(table.contains("foo", 1)) [all...] |
/device/linaro/bootloader/edk2/BaseTools/Source/Python/Common/ |
Parsing.py | 23 # Search whole table to find all defined Macro and replaced them with the real values
25 def ParseDefineMacro2(Table, RecordSets, GlobalMacro):
32 and Enabled > -1""" % (Table.Table, MODEL_META_DATA_DEFINE)
33 RecordSet = Table.Exec(SqlCommand)
53 # Search whole table to find all defined Macro and replaced them with the real values
55 def ParseDefineMacro(Table, GlobalMacro):
62 and Enabled > -1""" % (Table.Table, MODEL_META_DATA_DEFINE)
63 RecordSet = Table.Exec(SqlCommand) [all...] |
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/Dxe/Print/ |
BoxDraw.c | 132 UNICODE_TO_CHAR *Table;
143 for (Table = UnicodeToPcAnsiOrAscii; Table->Unicode != 0x0000; Table++) {
144 if (Graphic == Table->Unicode) {
146 *PcAnsi = Table->PcAnsi;
149 *Ascii = Table->Ascii;
|
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/Dxe/PrintLite/ |
BoxDraw.c | 132 UNICODE_TO_CHAR *Table;
143 for (Table = UnicodeToPcAnsiOrAscii; Table->Unicode != 0x0000; Table++) {
144 if (Graphic == Table->Unicode) {
146 *PcAnsi = Table->PcAnsi;
149 *Ascii = Table->Ascii;
|
/device/linaro/bootloader/edk2/BaseTools/Source/Python/Eot/ |
Database.py | 23 from Table.TableDataModel import TableDataModel
24 from Table.TableFile import TableFile
25 from Table.TableFunction import TableFunction
26 from Table.TableIdentifier import TableIdentifier
27 from Table.TableEotReport import TableEotReport
28 from Table.TableInf import TableInf
29 from Table.TableDec import TableDec
30 from Table.TableDsc import TableDsc
31 from Table.TableFdf import TableFdf
32 from Table.TableQuery import TableQuery [all...] |
/prebuilts/go/darwin-x86/src/hash/crc32/ |
crc32_generic.go | 8 // The simple (and slow) CRC32 implementation only uses a 256*4 bytes table. 11 // table (8*256*4 bytes). 15 // simpleMakeTable allocates and constructs a Table for the specified 16 // polynomial. The table is suitable for use with the simple algorithm 18 func simpleMakeTable(poly uint32) *Table { 19 t := new(Table) 24 // simplePopulateTable constructs a Table for the specified polynomial, suitable 26 func simplePopulateTable(poly uint32, t *Table) { 40 // simpleUpdate uses the simple algorithm to update the CRC, given a table that 42 func simpleUpdate(crc uint32, tab *Table, p []byte) uint32 [all...] |
/prebuilts/go/linux-x86/src/hash/crc32/ |
crc32_generic.go | 8 // The simple (and slow) CRC32 implementation only uses a 256*4 bytes table. 11 // table (8*256*4 bytes). 15 // simpleMakeTable allocates and constructs a Table for the specified 16 // polynomial. The table is suitable for use with the simple algorithm 18 func simpleMakeTable(poly uint32) *Table { 19 t := new(Table) 24 // simplePopulateTable constructs a Table for the specified polynomial, suitable 26 func simplePopulateTable(poly uint32, t *Table) { 40 // simpleUpdate uses the simple algorithm to update the CRC, given a table that 42 func simpleUpdate(crc uint32, tab *Table, p []byte) uint32 [all...] |
/device/linaro/bootloader/edk2/AppPkg/Applications/Lua/src/ |
ltable.c | 14 ** Hash uses a mix of chained scatter table with Brent's variation. 80 static Node *hashnum (const Table *t, lua_Number n) { 94 ** returns the `main' position of an element in a table (that is, the index 97 static Node *mainposition (const Table *t, const TValue *key) { 125 ** the array part of the table, -1 otherwise. 140 ** returns the index of a `key' for table traversals. First goes all 144 static int findindex (lua_State *L, Table *t, StkId key) { 157 i = cast_int(n - gnode(t, 0)); /* key index in hash table */ 169 int luaH_next (lua_State *L, Table *t, StkId key) { 229 static int numusearray (const Table *t, int *nums) [all...] |
/external/flatbuffers/include/flatbuffers/ |
reflection.h | 54 inline Table *GetAnyRoot(uint8_t *flatbuf) { 55 return GetMutableRoot<Table>(flatbuf); 57 inline const Table *GetAnyRoot(const uint8_t *flatbuf) { 58 return GetRoot<Table>(flatbuf); 62 template<typename T> T GetFieldI(const Table &table, 65 return table.GetField<T>(field.offset(), 70 template<typename T> T GetFieldF(const Table &table, 73 return table.GetField<T>(field.offset() [all...] |
/external/skia/third_party/lua/src/ |
ltable.c | 14 ** Hash uses a mix of chained scatter table with Brent's variation. 80 static Node *hashnum (const Table *t, lua_Number n) { 94 ** returns the `main' position of an element in a table (that is, the index 97 static Node *mainposition (const Table *t, const TValue *key) { 125 ** the array part of the table, -1 otherwise. 140 ** returns the index of a `key' for table traversals. First goes all 144 static int findindex (lua_State *L, Table *t, StkId key) { 157 i = cast_int(n - gnode(t, 0)); /* key index in hash table */ 169 int luaH_next (lua_State *L, Table *t, StkId key) { 229 static int numusearray (const Table *t, int *nums) [all...] |
/external/syslinux/com32/lua/src/ |
ltable.c | 14 ** Hash uses a mix of chained scatter table with Brent's variation. 82 static Node *hashnum (const Table *t, lua_Number n) { 95 ** returns the `main' position of an element in a table (that is, the index 98 static Node *mainposition (const Table *t, const TValue *key) { 126 ** the array part of the table, -1 otherwise. 141 ** returns the index of a `key' for table traversals. First goes all 145 static int findindex (lua_State *L, Table *t, StkId key) { 158 i = cast_int(n - gnode(t, 0)); /* key index in hash table */ 170 int luaH_next (lua_State *L, Table *t, StkId key) { 230 static int numusearray (const Table *t, int *nums) [all...] |
/external/clang/lib/Basic/ |
Builtins.cpp | 81 void Builtin::Context::initializeBuiltins(IdentifierTable &Table, 86 Table.get(BuiltinInfo[i].Name).setBuiltinID(i); 92 Table.get(TSRecords[i].Name).setBuiltinID(i + Builtin::FirstTSBuiltin); 96 Table.get(AuxTSRecords[i].Name) 100 void Builtin::Context::forgetBuiltin(unsigned ID, IdentifierTable &Table) { 101 Table.get(getRecord(ID).Name).setBuiltinID(0);
|
/external/elfutils/tests/ |
run-readelf-aranges.sh | 118 Table at offset 0: 128 Table at offset 32: 139 Table at offset 72:
|
/external/flatbuffers/tests/MyGame/Example/ |
Test.go | 18 func (rcv *Test) Table() flatbuffers.Table { 19 return rcv._tab.Table
|
TestSimpleTableWithEnum.go | 10 _tab flatbuffers.Table 25 func (rcv *TestSimpleTableWithEnum) Table() flatbuffers.Table {
|
/external/flatbuffers/tests/namespace_test/NamespaceA/NamespaceB/ |
StructInNestedNS.go | 18 func (rcv *StructInNestedNS) Table() flatbuffers.Table { 19 return rcv._tab.Table
|
TableInNestedNS.go | 10 _tab flatbuffers.Table 25 func (rcv *TableInNestedNS) Table() flatbuffers.Table {
|