| /dports/databases/arrow/apache-arrow-6.0.1/cpp/src/arrow/util/ |
| H A D | bpacking.cc | 43 int num_loops = batch_size / 32; in unpack32_default() local
50 for (int i = 0; i < num_loops; ++i) in = unpack1_32(in, out + i * 32); in unpack32_default()
53 for (int i = 0; i < num_loops; ++i) in = unpack2_32(in, out + i * 32); in unpack32_default()
56 for (int i = 0; i < num_loops; ++i) in = unpack3_32(in, out + i * 32); in unpack32_default()
59 for (int i = 0; i < num_loops; ++i) in = unpack4_32(in, out + i * 32); in unpack32_default()
62 for (int i = 0; i < num_loops; ++i) in = unpack5_32(in, out + i * 32); in unpack32_default()
65 for (int i = 0; i < num_loops; ++i) in = unpack6_32(in, out + i * 32); in unpack32_default()
68 for (int i = 0; i < num_loops; ++i) in = unpack7_32(in, out + i * 32); in unpack32_default()
71 for (int i = 0; i < num_loops; ++i) in = unpack8_32(in, out + i * 32); in unpack32_default()
74 for (int i = 0; i < num_loops; ++i) in = unpack9_32(in, out + i * 32); in unpack32_default()
[all …]
|
| H A D | bpacking_simd_internal.h | 28 int num_loops = batch_size / 32; in unpack32_specialized() local
32 for (int i = 0; i < num_loops; ++i) in = UnpackBits::unpack0_32(in, out + i * 32); in unpack32_specialized()
35 for (int i = 0; i < num_loops; ++i) in = UnpackBits::unpack1_32(in, out + i * 32); in unpack32_specialized()
38 for (int i = 0; i < num_loops; ++i) in = UnpackBits::unpack2_32(in, out + i * 32); in unpack32_specialized()
41 for (int i = 0; i < num_loops; ++i) in = UnpackBits::unpack3_32(in, out + i * 32); in unpack32_specialized()
44 for (int i = 0; i < num_loops; ++i) in = UnpackBits::unpack4_32(in, out + i * 32); in unpack32_specialized()
47 for (int i = 0; i < num_loops; ++i) in = UnpackBits::unpack5_32(in, out + i * 32); in unpack32_specialized()
50 for (int i = 0; i < num_loops; ++i) in = UnpackBits::unpack6_32(in, out + i * 32); in unpack32_specialized()
53 for (int i = 0; i < num_loops; ++i) in = UnpackBits::unpack7_32(in, out + i * 32); in unpack32_specialized()
56 for (int i = 0; i < num_loops; ++i) in = UnpackBits::unpack8_32(in, out + i * 32); in unpack32_specialized()
[all …]
|
| /dports/www/grafana8/grafana-8.3.6/vendor/github.com/apache/arrow/cpp/src/arrow/util/ |
| H A D | bpacking_avx2.cc | 27 int num_loops = batch_size / 32; in unpack32_avx2() local
31 for (int i = 0; i < num_loops; ++i) in = unpack0_32_avx2(in, out + i * 32); in unpack32_avx2()
34 for (int i = 0; i < num_loops; ++i) in = unpack1_32_avx2(in, out + i * 32); in unpack32_avx2()
37 for (int i = 0; i < num_loops; ++i) in = unpack2_32_avx2(in, out + i * 32); in unpack32_avx2()
40 for (int i = 0; i < num_loops; ++i) in = unpack3_32_avx2(in, out + i * 32); in unpack32_avx2()
43 for (int i = 0; i < num_loops; ++i) in = unpack4_32_avx2(in, out + i * 32); in unpack32_avx2()
46 for (int i = 0; i < num_loops; ++i) in = unpack5_32_avx2(in, out + i * 32); in unpack32_avx2()
49 for (int i = 0; i < num_loops; ++i) in = unpack6_32_avx2(in, out + i * 32); in unpack32_avx2()
52 for (int i = 0; i < num_loops; ++i) in = unpack7_32_avx2(in, out + i * 32); in unpack32_avx2()
55 for (int i = 0; i < num_loops; ++i) in = unpack8_32_avx2(in, out + i * 32); in unpack32_avx2()
[all …]
|
| H A D | bpacking_avx512.cc | 27 int num_loops = batch_size / 32; in unpack32_avx512() local
31 for (int i = 0; i < num_loops; ++i) in = unpack0_32_avx512(in, out + i * 32); in unpack32_avx512()
34 for (int i = 0; i < num_loops; ++i) in = unpack1_32_avx512(in, out + i * 32); in unpack32_avx512()
37 for (int i = 0; i < num_loops; ++i) in = unpack2_32_avx512(in, out + i * 32); in unpack32_avx512()
40 for (int i = 0; i < num_loops; ++i) in = unpack3_32_avx512(in, out + i * 32); in unpack32_avx512()
43 for (int i = 0; i < num_loops; ++i) in = unpack4_32_avx512(in, out + i * 32); in unpack32_avx512()
46 for (int i = 0; i < num_loops; ++i) in = unpack5_32_avx512(in, out + i * 32); in unpack32_avx512()
49 for (int i = 0; i < num_loops; ++i) in = unpack6_32_avx512(in, out + i * 32); in unpack32_avx512()
52 for (int i = 0; i < num_loops; ++i) in = unpack7_32_avx512(in, out + i * 32); in unpack32_avx512()
55 for (int i = 0; i < num_loops; ++i) in = unpack8_32_avx512(in, out + i * 32); in unpack32_avx512()
[all …]
|
| H A D | bpacking.cc | 38 int num_loops = batch_size / 32; in unpack32_default() local
45 for (int i = 0; i < num_loops; ++i) in = unpack1_32(in, out + i * 32); in unpack32_default()
48 for (int i = 0; i < num_loops; ++i) in = unpack2_32(in, out + i * 32); in unpack32_default()
51 for (int i = 0; i < num_loops; ++i) in = unpack3_32(in, out + i * 32); in unpack32_default()
54 for (int i = 0; i < num_loops; ++i) in = unpack4_32(in, out + i * 32); in unpack32_default()
57 for (int i = 0; i < num_loops; ++i) in = unpack5_32(in, out + i * 32); in unpack32_default()
60 for (int i = 0; i < num_loops; ++i) in = unpack6_32(in, out + i * 32); in unpack32_default()
63 for (int i = 0; i < num_loops; ++i) in = unpack7_32(in, out + i * 32); in unpack32_default()
66 for (int i = 0; i < num_loops; ++i) in = unpack8_32(in, out + i * 32); in unpack32_default()
69 for (int i = 0; i < num_loops; ++i) in = unpack9_32(in, out + i * 32); in unpack32_default()
[all …]
|
| /dports/security/vault/vault-1.8.2/vendor/github.com/apache/arrow/cpp/src/arrow/util/ |
| H A D | bpacking.h | 33 int num_loops = batch_size / 32; in unpack32() local
40 for (int i = 0; i < num_loops; ++i) in = unpack1_32(in, out + i * 32); in unpack32()
43 for (int i = 0; i < num_loops; ++i) in = unpack2_32(in, out + i * 32); in unpack32()
46 for (int i = 0; i < num_loops; ++i) in = unpack3_32(in, out + i * 32); in unpack32()
49 for (int i = 0; i < num_loops; ++i) in = unpack4_32(in, out + i * 32); in unpack32()
52 for (int i = 0; i < num_loops; ++i) in = unpack5_32(in, out + i * 32); in unpack32()
55 for (int i = 0; i < num_loops; ++i) in = unpack6_32(in, out + i * 32); in unpack32()
58 for (int i = 0; i < num_loops; ++i) in = unpack7_32(in, out + i * 32); in unpack32()
61 for (int i = 0; i < num_loops; ++i) in = unpack8_32(in, out + i * 32); in unpack32()
64 for (int i = 0; i < num_loops; ++i) in = unpack9_32(in, out + i * 32); in unpack32()
[all …]
|
| /dports/graphics/R-cran-s2/s2/src/s2/ |
| H A D | s2lax_polygon_shape.cc | 98 if (num_loops() > 1) { in ~S2LaxPolygonShape()
104 if (num_loops() <= 1) { in num_vertices()
113 if (num_loops() == 1) { in num_loop_vertices()
123 if (num_loops() == 1) { in loop_vertex()
137 if (num_loops() > 1) { in Encode()
148 uint32 num_loops; in Init() local
150 num_loops_ = num_loops; in Init()
179 if (num_loops() == 1) { in edge()
202 if (num_loops() == 1) { in chain()
215 if (num_loops() == 1) { in chain_edge()
[all …]
|
| H A D | s2polygon.cc | 324 if (num_loops() == 1) { in InitNested()
421 if (num_loops() > 0) { in InitOriented()
990 if (num_loops() == 0) { in InitFromBuilder()
1100 if (num_loops() == 0) { in InitToSimplifiedInCell()
1299 if (num_loops() == 0) { in InitToCellUnionBorder()
1336 if (num_loops() != b->num_loops()) return false; in Equals()
1348 if (num_loops() != b->num_loops()) return false; in BoundaryEquals()
1368 if (num_loops() != b.num_loops()) return false; in BoundaryApproxEquals()
1390 if (num_loops() != b.num_loops()) return false; in BoundaryNear()
1438 uint32 num_loops; in DecodeCompressed() local
[all …]
|
| /dports/graphics/s2/s2geometry-0.9.0/src/s2/ |
| H A D | s2lax_polygon_shape.cc | 98 if (num_loops() > 1) { in ~S2LaxPolygonShape()
104 if (num_loops() <= 1) { in num_vertices()
113 if (num_loops() == 1) { in num_loop_vertices()
123 if (num_loops() == 1) { in loop_vertex()
137 if (num_loops() > 1) { in Encode()
148 uint32 num_loops; in Init() local
150 num_loops_ = num_loops; in Init()
179 if (num_loops() == 1) { in edge()
202 if (num_loops() == 1) { in chain()
215 if (num_loops() == 1) { in chain_edge()
[all …]
|
| H A D | s2polygon.cc | 324 if (num_loops() == 1) { in InitNested()
421 if (num_loops() > 0) { in InitOriented()
990 if (num_loops() == 0) { in InitFromBuilder()
1100 if (num_loops() == 0) { in InitToSimplifiedInCell()
1299 if (num_loops() == 0) { in InitToCellUnionBorder()
1336 if (num_loops() != b->num_loops()) return false; in Equals()
1348 if (num_loops() != b->num_loops()) return false; in BoundaryEquals()
1368 if (num_loops() != b.num_loops()) return false; in BoundaryApproxEquals()
1390 if (num_loops() != b.num_loops()) return false; in BoundaryNear()
1438 uint32 num_loops; in DecodeCompressed() local
[all …]
|
| /dports/graphics/py-s2/s2geometry-0.9.0/src/s2/ |
| H A D | s2lax_polygon_shape.cc | 98 if (num_loops() > 1) { in ~S2LaxPolygonShape()
104 if (num_loops() <= 1) { in num_vertices()
113 if (num_loops() == 1) { in num_loop_vertices()
123 if (num_loops() == 1) { in loop_vertex()
137 if (num_loops() > 1) { in Encode()
148 uint32 num_loops; in Init() local
150 num_loops_ = num_loops; in Init()
179 if (num_loops() == 1) { in edge()
202 if (num_loops() == 1) { in chain()
215 if (num_loops() == 1) { in chain_edge()
[all …]
|
| H A D | s2polygon.cc | 324 if (num_loops() == 1) { in InitNested()
421 if (num_loops() > 0) { in InitOriented()
990 if (num_loops() == 0) { in InitFromBuilder()
1100 if (num_loops() == 0) { in InitToSimplifiedInCell()
1299 if (num_loops() == 0) { in InitToCellUnionBorder()
1336 if (num_loops() != b->num_loops()) return false; in Equals()
1348 if (num_loops() != b->num_loops()) return false; in BoundaryEquals()
1368 if (num_loops() != b.num_loops()) return false; in BoundaryApproxEquals()
1390 if (num_loops() != b.num_loops()) return false; in BoundaryNear()
1438 uint32 num_loops; in DecodeCompressed() local
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/libs/pool/example/ |
| H A D | time_pool_alloc.cpp | 21 unsigned long num_loops = 10; variable
44 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
53 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
61 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
69 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
77 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
85 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
119 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
128 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
136 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
[all …]
|
| /dports/devel/boost-python-libs/boost_1_72_0/libs/pool/example/ |
| H A D | time_pool_alloc.cpp | 21 unsigned long num_loops = 10; variable
44 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
53 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
61 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
69 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
77 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
85 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
119 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
128 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
136 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
[all …]
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/libs/pool/example/ |
| H A D | time_pool_alloc.cpp | 21 unsigned long num_loops = 10; variable
44 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
53 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
61 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
69 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
77 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
85 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
119 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
128 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
136 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
[all …]
|
| /dports/databases/mysqlwsrep57-server/boost_1_59_0/libs/pool/example/ |
| H A D | time_pool_alloc.cpp | 21 unsigned long num_loops = 10; variable
44 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
53 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
61 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
69 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
77 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
85 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
119 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
128 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
136 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
[all …]
|
| /dports/databases/percona57-server/boost_1_59_0/libs/pool/example/ |
| H A D | time_pool_alloc.cpp | 21 unsigned long num_loops = 10; variable
44 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
53 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
61 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
69 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
77 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
85 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
119 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
128 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
136 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
[all …]
|
| /dports/databases/xtrabackup/boost_1_59_0/libs/pool/example/ |
| H A D | time_pool_alloc.cpp | 21 unsigned long num_loops = 10; variable
44 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
53 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
61 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
69 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
77 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
85 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
119 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
128 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
136 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
[all …]
|
| /dports/databases/percona57-client/boost_1_59_0/libs/pool/example/ |
| H A D | time_pool_alloc.cpp | 21 unsigned long num_loops = 10; variable
44 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
53 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
61 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
69 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
77 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
85 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
119 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
128 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
136 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
[all …]
|
| /dports/devel/boost-libs/boost_1_72_0/libs/pool/example/ |
| H A D | time_pool_alloc.cpp | 21 unsigned long num_loops = 10; variable
44 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
53 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
61 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
69 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
77 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
85 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
119 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
128 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
136 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
[all …]
|
| /dports/devel/hyperscan/boost_1_75_0/libs/pool/example/ |
| H A D | time_pool_alloc.cpp | 21 unsigned long num_loops = 10; variable
44 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
53 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
61 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
69 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
77 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
85 for(l = 0; l < num_loops; ++l) in timing_test_alloc_larger()
119 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
128 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
136 for(l = 0; l < num_loops; ++l) in timing_test_alloc()
[all …]
|
| /dports/databases/mongodb36/mongodb-src-r3.6.23/src/third_party/s2/ |
| H A D | s2polygon.cc | 72 DCHECK_EQ(0, num_loops()); in Copy()
378 if (num_loops() == 1 && b->num_loops() == 1) { in Contains()
417 if (num_loops() == 1 && b->num_loops() == 1) { in Intersects()
445 if (num_loops() == 1) { in Contains()
470 if (num_loops() == 1) { in MayIntersect()
489 if (num_loops() == 1) { in Contains()
533 loops_.reserve(num_loops); in DecodeInternal()
787 DCHECK_EQ(0, num_loops()); in InitToIntersectionSloppy()
1121 if (num_loops() != b->num_loops()) return false; in BoundaryEquals()
1141 if (num_loops() != b->num_loops()) return false; in BoundaryApproxEquals()
[all …]
|
| /dports/net/mpich2/mpich2-1.5/test/mpi/spawn/ |
| H A D | disconnect_reconnect.c | 27 int rank, size, rsize, i, j, data, num_loops = 100; in main() local
47 num_loops = atoi(argv[1]); in main()
48 if (num_loops < 0) in main()
49 num_loops = 0; in main()
50 if (num_loops > 100) in main()
51 num_loops = 100; in main()
90 if (rank == 0 && num_loops > 0) in main()
98 for (i=0; i<num_loops; i++) in main()
144 if (rank == 0 && num_loops > 0) in main()
152 for (i=0; i<num_loops; i++) in main()
|
| /dports/net/mpich/mpich-3.4.3/test/mpi/spawn/ |
| H A D | disconnect_reconnect.c | 26 int rank, size, rsize, i, j, data, num_loops = 100; in main() local
49 num_loops = atoi(argv[1]); in main()
50 if (num_loops < 0) in main()
51 num_loops = 0; in main()
52 if (num_loops > 100) in main()
53 num_loops = 100; in main()
85 if (rank == 0 && num_loops > 0) { in main()
92 for (i = 0; i < num_loops; i++) { in main()
131 if (rank == 0 && num_loops > 0) { in main()
138 for (i = 0; i < num_loops; i++) { in main()
|
| /dports/devel/efl/efl-1.25.1/src/tests/eina/ |
| H A D | eina_test_hash.c | 185 unsigned int num_loops = 3011; in EFL_START_TEST() local
193 array = malloc(num_loops * 10); in EFL_START_TEST()
196 for (i = 0; i < num_loops; ++i) in EFL_START_TEST()
274 unsigned int num_loops = 10000; in EFL_START_TEST() local
282 for (i = 0; i < num_loops; ++i) in EFL_START_TEST()
313 uint64_t num_loops = 10000; in EFL_START_TEST() local
320 for (i = 0; i < num_loops; ++i) in EFL_START_TEST()
352 unsigned int num_loops = 100; in EFL_START_TEST() local
359 array = malloc(num_loops * 10); in EFL_START_TEST()
362 for (i = 0; i < num_loops; ++i) in EFL_START_TEST()
[all …]
|