Home
last modified time | relevance | path

Searched refs:ARRAY_SIZE (Results 1 – 25 of 364) sorted by relevance

12345678910>>...15

/external/drm_gralloc/pci_ids/
Dpci_id_driver_map.h6 #ifndef ARRAY_SIZE
7 #define ARRAY_SIZE(a) (sizeof(a) / sizeof((a)[0])) macro
69 { 0x8086, "i810", i810_chip_ids, ARRAY_SIZE(i810_chip_ids) },
71 { 0x8086, "i915", i915_chip_ids, ARRAY_SIZE(i915_chip_ids) },
72 { 0x8086, "i965", i965_chip_ids, ARRAY_SIZE(i965_chip_ids) },
74 { 0x1002, "radeon", r100_chip_ids, ARRAY_SIZE(r100_chip_ids) },
75 { 0x1002, "r200", r200_chip_ids, ARRAY_SIZE(r200_chip_ids) },
77 { 0x1002, "r300", r300_chip_ids, ARRAY_SIZE(r300_chip_ids) },
78 { 0x1002, "r600", r600_chip_ids, ARRAY_SIZE(r600_chip_ids) },
80 { 0x15ad, "vmwgfx", vmwgfx_chip_ids, ARRAY_SIZE(vmwgfx_chip_ids) },
/external/mesa3d/include/pci_ids/
Dpci_id_driver_map.h6 #ifndef ARRAY_SIZE
7 #define ARRAY_SIZE(a) (sizeof(a) / sizeof((a)[0])) macro
66 { 0x8086, "i915", i915_chip_ids, ARRAY_SIZE(i915_chip_ids) },
67 { 0x8086, "i965", i965_chip_ids, ARRAY_SIZE(i965_chip_ids) },
69 { 0x1002, "radeon", r100_chip_ids, ARRAY_SIZE(r100_chip_ids) },
70 { 0x1002, "r200", r200_chip_ids, ARRAY_SIZE(r200_chip_ids) },
72 { 0x1002, "r300", r300_chip_ids, ARRAY_SIZE(r300_chip_ids) },
73 { 0x1002, "r600", r600_chip_ids, ARRAY_SIZE(r600_chip_ids) },
74 { 0x1002, "radeonsi", radeonsi_chip_ids, ARRAY_SIZE(radeonsi_chip_ids) },
76 { 0x15ad, "vmwgfx", vmwgfx_chip_ids, ARRAY_SIZE(vmwgfx_chip_ids) },
/external/vixl/examples/
Dadd2-vectors.cc30 #define ARRAY_SIZE(Array) (sizeof(Array) / sizeof((Array)[0])) macro
119 uint8_t vecC[ARRAY_SIZE(vecA)]; in main()
122 assert(ARRAY_SIZE(vecA) == ARRAY_SIZE(vecB)); in main()
125 for (unsigned i = 0; i < ARRAY_SIZE(vecA); i++) { in main()
138 simulator.set_xreg(2, ARRAY_SIZE(vecA)); in main()
139 PrintVector(vecA, ARRAY_SIZE(vecA)); in main()
141 PrintVector(vecB, ARRAY_SIZE(vecB)); in main()
146 PrintVector(vecA, ARRAY_SIZE(vecA)); in main()
153 for (unsigned i = 0; i < ARRAY_SIZE(vecA); i++) { in main()
/external/compiler-rt/lib/sanitizer_common/tests/
Dsanitizer_stackdepot_test.cc22 StackTrace s1(array, ARRAY_SIZE(array)); in TEST()
26 EXPECT_EQ(ARRAY_SIZE(array), stack.size); in TEST()
48 StackTrace s1(array, ARRAY_SIZE(array)); in TEST()
54 EXPECT_EQ(ARRAY_SIZE(array), stack.size); in TEST()
60 StackTrace s1(array1, ARRAY_SIZE(array1)); in TEST()
63 StackTrace s2(array2, ARRAY_SIZE(array2)); in TEST()
74 StackTrace s1(array1, ARRAY_SIZE(array1)); in TEST()
75 StackTrace s2(array2, ARRAY_SIZE(array2)); in TEST()
76 StackTrace s3(array3, ARRAY_SIZE(array3)); in TEST()
77 StackTrace s4(array4, ARRAY_SIZE(array4)); in TEST()
/external/guava/guava-tests/benchmark/com/google/common/math/
DIntMathBenchmark.java20 import static com.google.common.math.MathBenchmarking.ARRAY_SIZE;
36 private static int[] exponent = new int[ARRAY_SIZE];
37 private static int[] factorial = new int[ARRAY_SIZE];
38 private static int[] binomial = new int[ARRAY_SIZE];
39 private static final int[] positive = new int[ARRAY_SIZE];
40 private static final int[] nonnegative = new int[ARRAY_SIZE];
41 private static final int[] ints = new int[ARRAY_SIZE];
45 for (int i = 0; i < ARRAY_SIZE; i++) { in setUp()
DLongMathBenchmark.java20 import static com.google.common.math.MathBenchmarking.ARRAY_SIZE;
36 private static final int[] exponents = new int[ARRAY_SIZE];
37 private static final int[] factorialArguments = new int[ARRAY_SIZE];
38 private static final int[][] binomialArguments = new int[ARRAY_SIZE][2];
39 private static final long[] positive = new long[ARRAY_SIZE];
40 private static final long[] nonnegative = new long[ARRAY_SIZE];
41 private static final long[] longs = new long[ARRAY_SIZE];
45 for (int i = 0; i < ARRAY_SIZE; i++) { in setUp()
DApacheBenchmark.java20 import static com.google.common.math.MathBenchmarking.ARRAY_SIZE;
120 private final int[] factorials = new int[ARRAY_SIZE];
121 private final int[][] binomials = new int[ARRAY_SIZE][2];
122 private final int[][] nonnegInt = new int[ARRAY_SIZE][2];
123 private final long[][] nonnegLong = new long[ARRAY_SIZE][2];
124 private final int[][] intsToAdd = new int[ARRAY_SIZE][2];
125 private final int[][] intsToMul = new int[ARRAY_SIZE][2];
126 private final long[][] longsToAdd = new long[ARRAY_SIZE][2];
127 private final long[][] longsToMul = new long[ARRAY_SIZE][2];
134 for (int i = 0; i < ARRAY_SIZE; i++) { in setUp()
DDoubleMathBenchmark.java20 import static com.google.common.math.MathBenchmarking.ARRAY_SIZE;
34 private static final double[] positiveDoubles = new double[ARRAY_SIZE];
35 private static final int[] factorials = new int[ARRAY_SIZE];
36 private static final double [] doubles = new double[ARRAY_SIZE];
40 for (int i = 0; i < ARRAY_SIZE; i++) { in setUp()
DDoubleMathRoundingBenchmark.java20 import static com.google.common.math.MathBenchmarking.ARRAY_SIZE;
37 private static final double[] doubleInIntRange = new double[ARRAY_SIZE];
38 private static final double[] doubleInLongRange = new double[ARRAY_SIZE];
39 private static final double[] positiveDoubles = new double[ARRAY_SIZE];
46 for (int i = 0; i < ARRAY_SIZE; i++) { in setUp()
DLongMathRoundingBenchmark.java20 import static com.google.common.math.MathBenchmarking.ARRAY_SIZE;
41 private static final long[] positive = new long[ARRAY_SIZE];
42 private static final long[] nonzero = new long[ARRAY_SIZE];
43 private static final long[] longs = new long[ARRAY_SIZE];
47 for (int i = 0; i < ARRAY_SIZE; i++) { in setUp()
DBigIntegerMathRoundingBenchmark.java20 import static com.google.common.math.MathBenchmarking.ARRAY_SIZE;
38 private static final BigInteger[] nonzero1 = new BigInteger[ARRAY_SIZE];
39 private static final BigInteger[] nonzero2 = new BigInteger[ARRAY_SIZE];
40 private static final BigInteger[] positive = new BigInteger[ARRAY_SIZE];
47 for (int i = 0; i < ARRAY_SIZE; i++) { in setUp()
DIntMathRoundingBenchmark.java20 import static com.google.common.math.MathBenchmarking.ARRAY_SIZE;
38 private static final int[] positive = new int[ARRAY_SIZE];
39 private static final int[] nonzero = new int[ARRAY_SIZE];
40 private static final int[] ints = new int[ARRAY_SIZE];
44 for (int i = 0; i < ARRAY_SIZE; i++) { in setUp()
DBigIntegerMathBenchmark.java20 import static com.google.common.math.MathBenchmarking.ARRAY_SIZE;
39 private static final int[] factorials = new int[ARRAY_SIZE];
40 private static final int[] slowFactorials = new int[ARRAY_SIZE];
41 private static final int[] binomials = new int[ARRAY_SIZE];
48 for (int i = 0; i < ARRAY_SIZE; i++) { in setUp()
/external/guava/guava-tests/benchmark/com/google/common/primitives/
DUnsignedLongsBenchmark.java30 private static final int ARRAY_SIZE = 0x10000; field in UnsignedLongsBenchmark
33 private static final long[] longs = new long[ARRAY_SIZE];
34 private static final long[] divisors = new long[ARRAY_SIZE];
35 private static final String[] decimalStrings = new String[ARRAY_SIZE];
36 private static final String[] binaryStrings = new String[ARRAY_SIZE];
37 private static final String[] hexStrings = new String[ARRAY_SIZE];
38 private static final String[] prefixedHexStrings = new String[ARRAY_SIZE];
42 for (int i = 0; i < ARRAY_SIZE; i++) { in setUp()
/external/iptables/extensions/
Dlibxt_CT.c142 info->ct_events = ct_parse_events(ct_event_tbl, ARRAY_SIZE(ct_event_tbl), cb->arg); in ct_parse()
145 info->exp_events = ct_parse_events(exp_event_tbl, ARRAY_SIZE(exp_event_tbl), cb->arg); in ct_parse()
161 ARRAY_SIZE(ct_event_tbl), in ct_parse_v1()
166 ARRAY_SIZE(exp_event_tbl), in ct_parse_v1()
184 ARRAY_SIZE(ct_event_tbl), info->ct_events); in ct_print()
187 ARRAY_SIZE(exp_event_tbl), info->exp_events); in ct_print()
211 ARRAY_SIZE(ct_event_tbl), info->ct_events); in ct_print_v1()
214 ARRAY_SIZE(exp_event_tbl), info->exp_events); in ct_print_v1()
232 ARRAY_SIZE(ct_event_tbl), info->ct_events); in ct_save()
235 ARRAY_SIZE(exp_event_tbl), info->exp_events); in ct_save()
[all …]
Dlibip6t_REJECT.c48 for (i = 0; i < ARRAY_SIZE(reject_table); ++i) { in print_reject_types()
85 for (i = 0; i < ARRAY_SIZE(reject_table); ++i) in REJECT_parse()
104 for (i = 0; i < ARRAY_SIZE(reject_table); ++i) in REJECT_print()
116 for (i = 0; i < ARRAY_SIZE(reject_table); ++i) in REJECT_save()
Dlibip6t_ipv6header.c75 for (i = 0; i < ARRAY_SIZE(chain_protos); ++i) in proto_to_name()
92 for (i = 0; i < ARRAY_SIZE(chain_protos); ++i) in name_to_proto()
98 if (i == ARRAY_SIZE(chain_protos)) in name_to_proto()
111 for (i = 0; i < ARRAY_SIZE(chain_flags); ++i) in add_proto_to_mask()
117 if (i == ARRAY_SIZE(chain_flags)) in add_proto_to_mask()
/external/strace/tests/
Daio.c48 #define ARRAY_SIZE(a) (sizeof(a) / sizeof((a)[0])) macro
99 .aio_nbytes = ARRAY_SIZE(iov0) in main()
107 .aio_nbytes = ARRAY_SIZE(iov1) in main()
116 const long cbs[ARRAY_SIZE(cb) + 2] = { in main()
120 const long cbvs[ARRAY_SIZE(cb) + 2] = { in main()
126 const unsigned int nr = ARRAY_SIZE(cb); in main()
Dksysent.c59 for (i = 0; i < ARRAY_SIZE(ksyslist); ++i) { in main()
62 if (i >= ARRAY_SIZE(syscallent) || !syscallent[i].sys_name) { in main()
97 for (i = 0; i < ARRAY_SIZE(syscallent); ++i) { in main()
114 if (i >= ARRAY_SIZE(ksyslist) || !ksyslist[i]) { in main()
/external/libnl/lib/netfilter/
Dnetfilter.c28 ARRAY_SIZE(nfnl_verdicts)); in nfnl_verdict2str()
33 return __str2type(name, nfnl_verdicts, ARRAY_SIZE(nfnl_verdicts)); in nfnl_str2verdict()
47 ARRAY_SIZE(nfnl_inet_hooks)); in nfnl_inet_hook2str()
52 return __str2type(name, nfnl_inet_hooks, ARRAY_SIZE(nfnl_inet_hooks)); in nfnl_str2inet_hook()
/external/icu/icu4c/source/test/cintltst/
Dstdnmtst.c21 #define ARRAY_SIZE(array) (int32_t)(sizeof array / sizeof array[0]) macro
292 doTestNames("ASCII", "IANA", asciiIANA, ARRAY_SIZE(asciiIANA)); in TestStandardNames()
293 doTestNames("US-ASCII", "IANA", asciiIANA, ARRAY_SIZE(asciiIANA)); in TestStandardNames()
294 doTestNames("ASCII", "MIME", asciiMIME, ARRAY_SIZE(asciiMIME)); in TestStandardNames()
295 doTestNames("ascii", "mime", asciiMIME, ARRAY_SIZE(asciiMIME)); in TestStandardNames()
302 doTestNames("ISO_2022,locale=ko,version=0", "MIME", iso2022MIME, ARRAY_SIZE(iso2022MIME)); in TestStandardNames()
303 doTestNames("csiso2022kr", "MIME", iso2022MIME, ARRAY_SIZE(iso2022MIME)); in TestStandardNames()
306 doTestUCharNames("ASCII", "IANA", asciiIANA, ARRAY_SIZE(asciiIANA)); in TestStandardNames()
/external/libunwind/src/ia64/
DGrbs.c103 c->rbs_curr = (c->rbs_curr + 1) % ARRAY_SIZE (c->rbs_area); in rbs_switch()
107 c->rbs_left_edge = (c->rbs_left_edge + 1) % ARRAY_SIZE (c->rbs_area); in rbs_switch()
143 curr = (curr + ARRAY_SIZE (c->rbs_area) - 1) % ARRAY_SIZE (c->rbs_area); in rbs_find_stacked()
172 curr = (curr + ARRAY_SIZE (c->rbs_area) - 1) % ARRAY_SIZE (c->rbs_area); in rbs_find_stacked()
266 curr = (curr + ARRAY_SIZE (c->rbs_area) - 1) in rbs_cover_and_flush()
267 % ARRAY_SIZE (c->rbs_area); in rbs_cover_and_flush()
/external/libdrm/tests/util/
Dkms.c87 ARRAY_SIZE(encoder_type_names)); in util_lookup_encoder_type_name()
99 ARRAY_SIZE(connector_status_names)); in util_lookup_connector_status_name()
125 ARRAY_SIZE(connector_type_names)); in util_lookup_connector_type_name()
158 for (i = 0; i < ARRAY_SIZE(modules); i++) { in util_open()
/external/libnl/lib/route/
Drtnl.c72 return __type2str(type, buf, size, rtntypes, ARRAY_SIZE(rtntypes)); in nl_rtntype2str()
77 return __str2type(name, rtntypes, ARRAY_SIZE(rtntypes)); in nl_str2rtntype()
97 return __type2str(scope, buf, size, scopes, ARRAY_SIZE(scopes)); in rtnl_scope2str()
102 return __str2type(name, scopes, ARRAY_SIZE(scopes)); in rtnl_str2scope()
/external/icu/icu4c/source/i18n/
Dcsr2022.cpp19 #define ARRAY_SIZE(array) (sizeof array / sizeof array[0]) macro
152 ARRAY_SIZE(escapeSequences_2022JP)); in match()
168 ARRAY_SIZE(escapeSequences_2022KR)); in match()
183 ARRAY_SIZE(escapeSequences_2022CN)); in match()

12345678910>>...15