| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/numerics/numeric.ops/adjacent.difference/ |
| adjacent_difference.pass.cpp | 35 int ib[s] = {0}; local
36 OutIter r = std::adjacent_difference(InIter(ia), InIter(ia+s), OutIter(ib));
37 assert(base(r) == ib + s);
39 assert(ib[i] == ir[i]);
|
| adjacent_difference_op.pass.cpp | 36 int ib[s] = {0}; local
37 OutIter r = std::adjacent_difference(InIter(ia), InIter(ia+s), OutIter(ib),
39 assert(base(r) == ib + s);
41 assert(ib[i] == ir[i]);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique_copy_pred.pass.cpp | 30 int ib[] = {0, 0, 0, 0, 0}; local
33 auto it = std::unique_copy(std::begin(ia), std::end(ia), std::begin(ib),
35 return it == (std::begin(ib) + std::size(expected))
37 && std::equal(std::begin(ib), it, std::begin(expected), std::end(expected))
65 const int ib[] = {0, 1}; local
66 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
69 r = std::unique_copy(InIter(ib), InIter(ib+sb), OutIter(jb), count_equal());
|
| /prebuilts/go/darwin-x86/test/ |
| cmp.go | 60 var ib interface{} = b
68 isfalse(ia == ib)
71 isfalse(ib == ic)
72 isfalse(ib == id)
76 istrue(ia != ib)
79 istrue(ib != ic)
80 istrue(ib != id)
85 //isfalse(a == ib)
97 isfalse(ib == c)
98 isfalse(ib == d
[all...] |
| /prebuilts/go/linux-x86/test/ |
| cmp.go | 60 var ib interface{} = b
68 isfalse(ia == ib)
71 isfalse(ib == ic)
72 isfalse(ib == id)
76 istrue(ia != ib)
79 istrue(ib != ic)
80 istrue(ib != id)
85 //isfalse(a == ib)
97 isfalse(ib == c)
98 isfalse(ib == d
[all...] |
| /external/mesa3d/src/mesa/vbo/ |
| vbo_split_copy.c | 58 const struct _mesa_index_buffer *ib; member in struct:copy_context
146 const struct _mesa_index_buffer *ib,
156 printf(" IB: %p\n", (void*) ib);
473 if (_mesa_is_bufferobj(copy->ib->obj) &&
474 !_mesa_bufferobj_mapped(copy->ib->obj, MAP_INTERNAL))
475 ctx->Driver.MapBufferRange(ctx, 0, copy->ib->obj->Size, GL_MAP_READ_BIT,
476 copy->ib->obj, MAP_INTERNAL);
479 ADD_POINTERS(copy->ib->obj->Mappings[MAP_INTERNAL].Pointer,
480 copy->ib->ptr)
[all...] |
| /external/llvm/lib/CodeGen/ |
| SpillPlacement.cpp | 263 unsigned ib = bundles->getBundle(I->Number, 0); local
264 activate(ib);
265 nodes[ib].addBias(Freq, I->Entry);
284 unsigned ib = bundles->getBundle(*I, 0); local
286 activate(ib);
288 nodes[ib].addBias(Freq, PrefSpill);
297 unsigned ib = bundles->getBundle(Number, 0); local
301 if (ib == ob)
303 activate(ib);
306 nodes[ib].addLink(ob, Freq)
[all...] |
| /external/cn-cbor/src/ |
| cn-encoder.c | 80 uint8_t ib; local
84 ib = _xlate[typ];
85 if (ib == 0xFF) {
92 write_byte(ib | val);
95 write_byte(ib | 24);
101 write_byte_and_data(ib | 25, (const void*)&be16, 2);
106 write_byte_and_data(ib | 26, (const void*)&be32, 4);
111 write_byte_and_data(ib | 27, (const void*)&be64, 8);
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.move/ |
| move.pass.cpp | 32 int ib[N] = {0}; local
34 OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib));
35 assert(base(r) == ib+N);
37 assert(ia[i] == ib[i]);
49 std::unique_ptr<int> ib[N]; local
51 OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib));
52 assert(base(r) == ib+N);
54 assert(*ib[i] == static_cast<int>(i));
|
| /external/mesa3d/src/mesa/state_tracker/ |
| st_draw_feedback.c | 116 const struct _mesa_index_buffer *ib,
148 vbo_get_minmax_indices(ctx, prims, ib, &min_index, &max_index, nr_prims);
242 if (ib) {
243 struct gl_buffer_object *bufobj = ib->obj;
245 ibuffer.index_size = vbo_sizeof_ib_type(ib->type);
253 ibuffer.offset = pointer_to_offset(ib->ptr);
260 mapped_indices = ib->ptr;
283 if (ib) {
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.move/ |
| move.pass.cpp | 32 int ib[N] = {0}; local
34 OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib));
35 assert(base(r) == ib+N);
37 assert(ia[i] == ib[i]);
49 std::unique_ptr<int> ib[N]; local
51 OutIter r = std::move(InIter(ia), InIter(ia+N), OutIter(ib));
52 assert(base(r) == ib+N);
54 assert(*ib[i] == static_cast<int>(i));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| unique_copy.pass.cpp | 36 const int ib[] = {0, 1}; local
37 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
39 r = std::unique_copy(InIter(ib), InIter(ib+sb), OutIter(jb));
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.transform/ |
| binary_transform.pass.cpp | 30 int ib[sa] = {1, 2, 3, 4, 5}; local
31 OutIter r = std::transform(InIter1(ib), InIter1(ib+sa), InIter2(ia),
32 OutIter(ib), std::minus<int>());
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 1);
35 assert(ib[1] == 1);
36 assert(ib[2] == 1);
37 assert(ib[3] == 1);
38 assert(ib[4] == 1)
[all...] |
| /external/mesa3d/src/gallium/drivers/radeonsi/ |
| si_state_draw.c | 535 const struct pipe_index_buffer *ib)
568 if (ib->index_size != sctx->last_index_size) {
572 switch (ib->index_size) {
591 sctx->last_index_size = ib->index_size;
594 index_max_size = (ib->buffer->width0 - ib->offset) /
595 ib->index_size;
596 index_va = r600_resource(ib->buffer)->gpu_address + ib->offset;
599 (struct r600_resource *)ib->buffer
1004 struct pipe_index_buffer ib = {}; local
[all...] |
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
| find_end_pred.pass.cpp | 35 int ib[] = {4, 5, 6}; local
42 && (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib)), eq) == FI(std::end(ic)))
44 && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib)), eq) == BI(std::end(ic)))
46 && (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib)), eq) == RI(std::end(ic)))
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| set_difference.pass.cpp | 32 int ib[] = {2, 4, 4, 6}; local
33 const int sb = sizeof(ib)/sizeof(ib[0]);
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
43 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| set_symmetric_difference.pass.cpp | 33 int ib[] = {2, 4, 4, 6}; local
34 const int sb = sizeof(ib)/sizeof(ib[0]);
39 Iter2(ib), Iter2(ib+sb), OutIter(ic));
42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
|
| set_symmetric_difference_comp.pass.cpp | 35 int ib[] = {2, 4, 4, 6}; local
36 const int sb = sizeof(ib)/sizeof(ib[0]);
41 Iter2(ib), Iter2(ib+sb),
45 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.union/ |
| set_union.pass.cpp | 32 int ib[] = {2, 4, 4, 6}; local
33 const int sb = sizeof(ib)/sizeof(ib[0]);
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
41 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
|
| set_union_comp.pass.cpp | 34 int ib[] = {2, 4, 4, 6}; local
35 const int sb = sizeof(ib)/sizeof(ib[0]);
40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>());
43 ce = std::set_union(Iter1(ib), Iter1(ib+sb),
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| set_difference.pass.cpp | 32 int ib[] = {2, 4, 4, 6}; local
33 const int sb = sizeof(ib)/sizeof(ib[0]);
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
43 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| set_intersection.pass.cpp | 32 int ib[] = {2, 4, 4, 6}; local
33 const int sb = sizeof(ib)/sizeof(ib[0]);
38 Iter2(ib), Iter2(ib+sb), OutIter(ic));
41 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
|
| set_intersection_comp.pass.cpp | 34 int ib[] = {2, 4, 4, 6}; local
35 const int sb = sizeof(ib)/sizeof(ib[0]);
40 Iter2(ib), Iter2(ib+sb), OutIter(ic), std::less<int>());
43 ce = std::set_intersection(Iter1(ib), Iter1(ib+sb),
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| set_symmetric_difference.pass.cpp | 33 int ib[] = {2, 4, 4, 6}; local
34 const int sb = sizeof(ib)/sizeof(ib[0]);
39 Iter2(ib), Iter2(ib+sb), OutIter(ic));
42 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
|
| set_symmetric_difference_comp.pass.cpp | 35 int ib[] = {2, 4, 4, 6}; local
36 const int sb = sizeof(ib)/sizeof(ib[0]);
41 Iter2(ib), Iter2(ib+sb),
45 ce = std::set_symmetric_difference(Iter1(ib), Iter1(ib+sb),
|
