HomeSort by relevance Sort by last modified time
    Searched refs:table (Results 651 - 675 of 3741) sorted by null

<<21222324252627282930>>

  /external/icu/icu4j/tools/misc/src/com/ibm/icu/dev/tool/layout/
OpenTypeTableWriter.java 24 private short[] table; field in class:OpenTypeTableWriter.OpenTypeTableDumper
29 table = data;
40 short value = table[index];
  /external/lzma/C/
XzCrc64.c 25 UInt64 MY_FAST_CALL XzCrc64UpdateT1_BeT4(UInt64 v, const void *data, size_t size, const UInt64 *table);
29 UInt64 MY_FAST_CALL XzCrc64UpdateT4(UInt64 v, const void *data, size_t size, const UInt64 *table);
32 typedef UInt64 (MY_FAST_CALL *CRC_FUNC)(UInt64 v, const void *data, size_t size, const UInt64 *table);
  /frameworks/base/libs/androidfw/tests/
BenchmarkHelpers.cpp 37 const ResTable& table = assetmanager.getResources(true); local
48 ssize_t block = table.getResource(resid, &value, false /*may_be_bag*/, 0u /*density*/, &flags,
50 table.resolveReference(&value, block, &last_ref, &flags, &selected_config);
  /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...]
  /art/tools/ahat/src/main/com/android/ahat/
SizeTable.java 25 * Class for rendering a table that includes all categories of Size.
26 * Two table formats are supported, one where a custom left column can be
35 * Start a size table with a custom left column.
39 * This should be followed by calls to the 'row' method to fill in the table
40 * contents and the 'end' method to end the table.
44 static void table(Doc doc, Column left, boolean showDiff, Column... columns) { method in class:SizeTable
54 doc.table(cols.toArray(new Column[cols.size()]));
58 * Add a row to the currently active size table with custom left column.
60 * currently active table.
77 * Start a size table without a custom left column
85 static void table(Doc doc, boolean showDiff, Column... columns) { method in class:SizeTable
88 table(doc, new Column("", Column.Align.LEFT, false), showDiff, columns); method
    [all...]
  /bionic/libc/bionic/
malloc_common.cpp 277 static bool InitMallocFunctions(void* impl_handler, MallocDispatch* table, const char* prefix) {
278 if (!InitMallocFunction<MallocCalloc>(impl_handler, &table->calloc, prefix, "calloc")) {
281 if (!InitMallocFunction<MallocFree>(impl_handler, &table->free, prefix, "free")) {
284 if (!InitMallocFunction<MallocMallinfo>(impl_handler, &table->mallinfo, prefix, "mallinfo")) {
287 if (!InitMallocFunction<MallocMallopt>(impl_handler, &table->mallopt, prefix, "mallopt")) {
290 if (!InitMallocFunction<MallocMalloc>(impl_handler, &table->malloc, prefix, "malloc")) {
293 if (!InitMallocFunction<MallocMallocUsableSize>(impl_handler, &table->malloc_usable_size, prefix,
297 if (!InitMallocFunction<MallocMemalign>(impl_handler, &table->memalign, prefix, "memalign")) {
300 if (!InitMallocFunction<MallocPosixMemalign>(impl_handler, &table->posix_memalign, prefix,
304 if (!InitMallocFunction<MallocAlignedAlloc>(impl_handler, &table->aligned_alloc
    [all...]
  /bionic/libc/kernel/uapi/linux/netfilter_bridge/
ebt_among.h 29 int table[257]; member in struct:ebt_mac_wormhash
  /device/linaro/bootloader/arm-trusted-firmware/lib/xlat_tables/
xlat_tables_private.h 46 * Returns the bit mask that has to be ORed to the rest of a translation table
52 void init_xlation_table(uintptr_t base_va, uint64_t *table,
  /device/linaro/hikey/hikey/
BoardConfig.mk 26 ifeq ($(TARGET_USERDATAIMAGE_4GB), true) # to build for aosp-4g partition table
29 ifeq ($(TARGET_WITH_SWAP), true) # to build for swap-8g partition table
  /external/autotest/frontend/client/src/autotest/common/table/
BooleanFilter.java 1 package autotest.common.table;
FieldFilter.java 1 package autotest.common.table;
  /external/autotest/frontend/client/src/autotest/tko/
TestViewDataSource.java 3 import autotest.common.table.RpcDataSource;
  /external/boringssl/src/crypto/fipsmodule/ec/
p256-x86_64_test.cc 42 // Fill a table with some garbage input.
43 alignas(64) P256_POINT table[16]; local
45 OPENSSL_memset(table[i].X, 3 * i, sizeof(table[i].X));
46 OPENSSL_memset(table[i].Y, 3 * i + 1, sizeof(table[i].Y));
47 OPENSSL_memset(table[i].Z, 3 * i + 2, sizeof(table[i].Z));
52 ecp_nistz256_select_w5(&val, table, i);
58 expected = table[i-1]
68 alignas(64) P256_POINT_AFFINE table[64]; local
    [all...]
  /external/boringssl/src/fipstools/
cavp_rsa2_keygen_test.cc 30 std::string mod_str, table, count_str; local
32 !t->GetInstruction(&table, "Table for M-R Test") ||
33 table != "C.2" ||
39 printf("[Table for M-R Test = %s]\r\n\r\n", table.c_str());
  /external/e2fsprogs/lib/et/
error_message.c 143 if ((et->table->base & 0xffffffL) == (table_num & 0xffffffL)) {
144 /* This is the right table */
145 if (et->table->n_msgs <= offset) {
148 const char *msg = et->table->msgs[offset];
158 if ((et->table->base & 0xffffffL) == (table_num & 0xffffffL)) {
159 /* This is the right table */
160 if (et->table->n_msgs <= offset) {
163 const char *msg = et->table->msgs[offset];
283 el->table = et;
311 if (el->table->base == et->base)
    [all...]
init_et.c 45 new_et->etl.table = &new_et->et;
  /external/flatbuffers/src/
idl_gen_text.cpp 26 static bool GenStruct(const StructDef &struct_def, const Table *table,
120 reinterpret_cast<const Table *>(val),
158 const Table *table, bool fixed,
163 reinterpret_cast<const Struct *>(table)->GetField<T>(fd.value.offset) :
164 table->GetField<T>(fd.value.offset, 0), fd.value.type, indent, nullptr,
168 static bool GenStruct(const StructDef &struct_def, const Table *table,
173 static bool GenFieldOffset(const FieldDef &fd, const Table *table, bool fixed
    [all...]
  /external/flatbuffers/tests/MyGame/Example2/
Monster.py 19 self._tab = flatbuffers.table.Table(buf, pos)
  /external/flatbuffers/tests/MyGame/
InParentNamespace.py 19 self._tab = flatbuffers.table.Table(buf, pos)
  /external/freetype/include/freetype/
ftotval.h 81 * Validate BASE table.
84 * Validate GDEF table.
87 * Validate GPOS table.
90 * Validate GSUB table.
93 * Validate JSTF table.
96 * Validate MATH table.
137 * A pointer to the BASE table.
140 * A pointer to the GDEF table.
143 * A pointer to the GPOS table.
146 * A pointer to the GSUB table
    [all...]
  /external/icu/icu4c/source/tools/makeconv/
makeconv.h 32 /* converter table type for writing */
55 (*U_CALLCONV_FPTR addTable)(NewConverter *cnvData, UCMTable *table, UConverterStaticData *staticData);
  /external/iproute2/include/
ip6tables.h 10 extern int do_command6(int argc, char *argv[], char **table,
iptables.h 10 extern int do_command4(int argc, char *argv[], char **table,
  /external/iptables/include/
ip6tables.h 10 extern int do_command6(int argc, char *argv[], char **table,

Completed in 904 milliseconds

<<21222324252627282930>>