| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find/ |
| find.pass.cpp | 26 int ib[] = {1, 2, 3, 4, 5, 6}; local
28 && (std::find(std::begin(ib), std::end(ib), 9) == ib+6)
|
| find_if.pass.cpp | 33 int ib[] = {1, 2, 3, 7, 5, 6}; local
36 && (std::find_if(std::begin(ib), std::end(ib), c) == ib+6)
|
| find_if_not.pass.cpp | 33 int ib[] = {1, 2, 3, 7, 5, 6}; local
36 && (std::find_if_not(std::begin(ib), std::end(ib), c) == ib+6)
|
| /external/mesa3d/src/gallium/drivers/r300/ |
| r300_render_translate.c | 29 struct pipe_index_buffer *ib,
44 &r300->context, ib, PIPE_TRANSFER_UNSYNCHRONIZED, index_offset,
57 util_rebuild_ushort_elts_to_userptr(&r300->context, ib,
72 util_rebuild_uint_elts_to_userptr(&r300->context, ib,
|
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.modifying.operations/alg.copy/ |
| copy_backward.pass.cpp | 30 int ib[N] = {0}; local
32 OutIter r = std::copy_backward(InIter(ia), InIter(ia+N), OutIter(ib+N));
33 assert(base(r) == ib);
35 assert(ia[i] == ib[i]);
|
| /external/drm_gralloc/ |
| gralloc_drm_intel.c | 205 struct intel_buffer *ib = (struct intel_buffer *) bo; local
211 pitches[0] = ib->base.handle->stride;
212 handles[0] = ib->base.fb_handle;
214 switch(ib->base.handle->format) {
223 pitches[0] * ib->base.handle->height;
225 pitches[2] * ib->base.handle->height/2;
235 pitches[0] * ib->base.handle->height;
343 struct intel_buffer *ib; local
345 ib = calloc(1, sizeof(*ib));
401 struct intel_buffer *ib = (struct intel_buffer *) bo; local
412 struct intel_buffer *ib = (struct intel_buffer *) bo; local
429 struct intel_buffer *ib = (struct intel_buffer *) bo; local
[all...] |
| /external/mesa3d/src/mesa/vbo/ |
| vbo_split.c | 105 const struct _mesa_index_buffer *ib,
111 if (ib) {
129 vbo_split_copy(ctx, arrays, prim, nr_prims, ib,
132 else if (ib->count > limits->max_indices) {
137 vbo_split_inplace(ctx, arrays, prim, nr_prims, ib,
151 vbo_split_inplace(ctx, arrays, prim, nr_prims, ib,
|
| vbo_split_inplace.c | 48 const struct _mesa_index_buffer *ib; member in struct:split_context
67 struct _mesa_index_buffer ib; local
73 if (split->ib) {
74 ib = *split->ib;
76 ib.count = split->max_index - split->min_index + 1;
77 ib.ptr = (const void *)((const char *)ib.ptr +
78 split->min_index * _mesa_sizeof_type(ib.type));
93 split->ib ? &ib : NULL
217 struct _mesa_index_buffer ib; local
[all...] |
| /prebuilts/go/darwin-x86/src/vendor/golang_org/x/text/unicode/norm/ |
| example_iter_test.go | 20 var ia, ib norm.Iter
22 ib.InitString(norm.NFKD, b)
23 for !ia.Done() && !ib.Done() {
24 if !bytes.Equal(ia.Next(), ib.Next()) {
28 return ia.Done() && ib.Done()
45 var ia, ib norm.Iter
47 ib.InitString(norm.NFKD, b)
48 for !ia.Done() && !ib.Done() {
49 if !bytes.Equal(ia.Next(), ib.Next()) {
52 if n := int64(FindPrefix(a[ia.Pos():], b[ib.Pos():])); n != 0
[all...] |
| /prebuilts/go/linux-x86/src/vendor/golang_org/x/text/unicode/norm/ |
| example_iter_test.go | 20 var ia, ib norm.Iter
22 ib.InitString(norm.NFKD, b)
23 for !ia.Done() && !ib.Done() {
24 if !bytes.Equal(ia.Next(), ib.Next()) {
28 return ia.Done() && ib.Done()
45 var ia, ib norm.Iter
47 ib.InitString(norm.NFKD, b)
48 for !ia.Done() && !ib.Done() {
49 if !bytes.Equal(ia.Next(), ib.Next()) {
52 if n := int64(FindPrefix(a[ia.Pos():], b[ib.Pos():])); n != 0
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.equal/ |
| equal.pass.cpp | 28 int ib[s] = {0, 1, 2, 5, 4, 5}; local
44 input_iterator<const int*>(ib)));
48 input_iterator<const int*>(ib),
49 input_iterator<const int*>(ib+s)));
52 random_access_iterator<const int*>(ib),
53 random_access_iterator<const int*>(ib+s)));
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
| equal_pred.pass.cpp | 38 int ib[] = {1, 3}; local
45 && std::equal(std::begin(ib), std::end(ib), std::begin(ic) , eq)
46 && !std::equal(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq)
48 && std::equal(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)) , eq)
49 && !std::equal(BI(std::begin(ib)), BI(std::end(ib)), BI(std::begin(ic)), BI(std::end(ic)), eq)
66 int ib[s] = {0, 1, 2, 5, 4, 5} local
[all...] |
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| default.pass.cpp | 65 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
66 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
68 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
70 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
72 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4))
[all...] |
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| make_default_searcher.pass.cpp | 50 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
51 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
53 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
55 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
57 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4))
[all...] |
| make_default_searcher.pred.pass.cpp | 62 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
63 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
65 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
67 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
69 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
[all...] |
| /external/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
| default.pass.cpp | 65 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
66 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
68 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
70 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
72 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4))
[all...] |
| default.pred.pass.cpp | 77 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
78 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
80 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
82 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
84 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
[all...] |
| /libcore/luni/src/test/java/libcore/java/nio/ |
| OldAndroidNIOTest.java | 60 IntBuffer ib = IntBuffer.wrap(intArray); local
61 intBufferTest(ib);
365 IntBuffer ib = bb.asIntBuffer(); local
367 checkBuffer(ib);
368 assertEquals(1, ib.capacity());
369 assertEquals(0xA4A3A2A1, ib.get());
372 ib = bb.asIntBuffer();
374 checkBuffer(ib);
375 assertEquals(1, ib.capacity());
376 assertEquals(0xA1A2A3A4, ib.get())
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.nonmodifying/alg.search/ |
| search.pass.cpp | 40 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
41 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
43 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1));
45 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2)) == Iter1(ib+1));
47 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3)) == Iter1(ib+4))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| includes.pass.cpp | 29 int ib[] = {2, 4}; local
30 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
36 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib)));
37 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1)));
38 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib)));
41 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb)))
[all...] |
| includes_comp.pass.cpp | 30 int ib[] = {2, 4}; local
31 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>()));
38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>()));
39 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib), std::less<int>()));
42 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), std::less<int>()))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.default/ |
| default.pass.cpp | 65 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
66 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
68 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
70 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
72 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4))
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| make_default_searcher.pass.cpp | 50 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
51 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
53 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
55 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
57 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4))
[all...] |
| make_default_searcher.pred.pass.cpp | 62 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
63 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
65 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1), sb);
67 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1), sb*2);
69 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4), sb*3)
[all...] |
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
| default.pass.cpp | 65 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
66 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
68 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1), Iter1(ib+1));
70 do_search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2), Iter1(ib+1));
72 do_search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3), Iter1(ib+4))
104 char ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; local
[all...] |
