| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | is_permutation.pass.cpp | 30 const int ib[] = {0}; in main() local
34 forward_iterator<const int*>(ib)) == true); in main()
38 forward_iterator<const int*>(ib), in main()
39 forward_iterator<const int*>(ib + 0)) == true); in main()
43 forward_iterator<const int*>(ib)) == true); in main()
47 forward_iterator<const int*>(ib), in main()
48 forward_iterator<const int*>(ib + sa)) == true); in main()
51 forward_iterator<const int*>(ib), in main()
52 forward_iterator<const int*>(ib + sa - 1)) == false); in main()
57 const int ib[] = {1}; in main() local
[all …]
|
| D | is_permutation_pred.pass.cpp | 39 const int ib[] = {0}; in main() local
43 forward_iterator<const int*>(ib), in main()
47 forward_iterator<const int*>(ib), in main()
52 forward_iterator<const int*>(ib), in main()
53 forward_iterator<const int*>(ib + sa), in main()
57 forward_iterator<const int*>(ib), in main()
58 forward_iterator<const int*>(ib + sa - 1), in main()
64 const int ib[] = {1}; in main() local
68 forward_iterator<const int*>(ib), in main()
73 forward_iterator<const int*>(ib), in main()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/ |
| D | rotate_copy.pass.cpp | 27 int ib[sa] = {0}; in test() local
29 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib)); in test()
30 assert(base(r) == ib); in test()
32 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib)); in test()
33 assert(base(r) == ib+1); in test()
34 assert(ib[0] == 0); in test()
36 r = std::rotate_copy(InIter(ia), InIter(ia+1), InIter(ia+1), OutIter(ib)); in test()
37 assert(base(r) == ib+1); in test()
38 assert(ib[0] == 0); in test()
40 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+2), OutIter(ib)); in test()
[all …]
|
| D | rotate.pass.cpp | 40 int ib[] = {0, 1}; in test() local
41 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
42 r = std::rotate(Iter(ib), Iter(ib), Iter(ib+sb)); in test()
43 assert(base(r) == ib+sb); in test()
44 assert(ib[0] == 0); in test()
45 assert(ib[1] == 1); in test()
46 r = std::rotate(Iter(ib), Iter(ib+1), Iter(ib+sb)); in test()
47 assert(base(r) == ib+1); in test()
48 assert(ib[0] == 1); in test()
49 assert(ib[1] == 0); in test()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
| D | search_n.pass.cpp | 42 int ib[] = {0, 0, 1, 1, 2, 2}; in test() local
43 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
44 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib)); in test()
45 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0)); in test()
46 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0)); in test()
47 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0) == Iter(ib+sb)); in test()
48 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0) == Iter(ib+sb)); in test()
49 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1) == Iter(ib)); in test()
50 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1) == Iter(ib+2)); in test()
51 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1) == Iter(ib+2)); in test()
[all …]
|
| D | search_n_pred.pass.cpp | 78 int ib[] = {0, 0, 1, 1, 2, 2}; in test() local
79 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
80 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib)); in test()
83 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0)); in test()
86 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0)); in test()
89 assert(std::search_n(Iter(ib), Iter(ib+sb), 3, 0, count_equal()) == Iter(ib+sb)); in test()
92 assert(std::search_n(Iter(ib), Iter(ib+sb), sb, 0, count_equal()) == Iter(ib+sb)); in test()
95 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 1, count_equal()) == Iter(ib)); in test()
98 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 1, count_equal()) == Iter(ib+2)); in test()
101 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 1, count_equal()) == Iter(ib+2)); in test()
[all …]
|
| D | search.pass.cpp | 40 int ib[] = {0, 1, 2, 0, 1, 2, 3, 0, 1, 2, 3, 4}; in test() local
41 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
43 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ic), Iter2(ic+1)) == Iter1(ib+1)); in test()
45 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(id), Iter2(id+2)) == Iter1(ib+1)); in test()
47 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ie), Iter2(ie+3)) == Iter1(ib+4)); in test()
49 assert(std::search(Iter1(ib), Iter1(ib+sb), Iter2(ig), Iter2(ig+4)) == Iter1(ib+8)); in test()
|
| /external/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/ |
| D | compare.pass.cpp | 26 const char ib[] = "123"; in main() local
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1); in main()
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1); in main()
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1); in main()
32 assert(f.compare(ia, ia+sa, ib+1, ib+3) == -1); in main()
33 assert(f.compare(ib+1, ib+3, ia, ia+sa) == 1); in main()
34 assert(f.compare(ia, ia+3, ib, ib+3) == 0); in main()
39 const wchar_t ib[] = L"123"; in main() local
41 assert(f.compare(ia, ia+sa, ib, ib+2) == 1); in main()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
| D | mismatch_pred.pass.cpp | 33 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; in main() local
34 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in main()
40 assert(std::mismatch(II(ia), II(ia + sa), II(ib), EQ()) in main()
41 == (std::pair<II, II>(II(ia+3), II(ib+3)))); in main()
42 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), EQ()) in main()
43 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
46 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp)) in main()
47 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
52 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), EQ()) in main()
53 == (std::pair<II, II>(II(ia+3), II(ib+3)))); in main()
[all …]
|
| D | mismatch.pass.cpp | 30 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; in main() local
31 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in main()
36 assert(std::mismatch(II(ia), II(ia + sa), II(ib)) in main()
37 == (std::pair<II, II>(II(ia+3), II(ib+3)))); in main()
39 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib)) in main()
40 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
43 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+sb)) in main()
44 == (std::pair<II, II>(II(ia+3), II(ib+3)))); in main()
46 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), RAI(ib+sb)) in main()
47 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); in main()
[all …]
|
| /external/drm_gralloc/ |
| D | gralloc_drm_intel.c | 204 struct intel_buffer *ib = (struct intel_buffer *) bo; in intel_resolve_format() local
210 pitches[0] = ib->base.handle->stride; in intel_resolve_format()
211 handles[0] = ib->base.fb_handle; in intel_resolve_format()
213 switch(ib->base.handle->format) { in intel_resolve_format()
222 pitches[0] * ib->base.handle->height; in intel_resolve_format()
224 pitches[2] * ib->base.handle->height/2; in intel_resolve_format()
234 pitches[0] * ib->base.handle->height; in intel_resolve_format()
342 struct intel_buffer *ib; in intel_alloc() local
344 ib = calloc(1, sizeof(*ib)); in intel_alloc()
345 if (!ib) in intel_alloc()
[all …]
|
| /external/mesa3d/src/gallium/auxiliary/util/ |
| D | u_index_modify.c | 30 struct pipe_index_buffer *ib, in util_shorten_ubyte_elts_to_userptr() argument
41 if (ib->user_buffer) { in util_shorten_ubyte_elts_to_userptr()
42 in_map = ib->user_buffer; in util_shorten_ubyte_elts_to_userptr()
44 in_map = pipe_buffer_map(context, ib->buffer, in util_shorten_ubyte_elts_to_userptr()
62 struct pipe_index_buffer *ib, in util_shorten_ubyte_elts() argument
79 util_shorten_ubyte_elts_to_userptr(context, ib, index_bias, in util_shorten_ubyte_elts()
91 struct pipe_index_buffer *ib, in util_rebuild_ushort_elts_to_userptr() argument
101 if (ib->user_buffer) { in util_rebuild_ushort_elts_to_userptr()
102 in_map = ib->user_buffer; in util_rebuild_ushort_elts_to_userptr()
104 in_map = pipe_buffer_map(context, ib->buffer, in util_rebuild_ushort_elts_to_userptr()
[all …]
|
| /external/mesa3d/src/mesa/vbo/ |
| D | vbo_rebase.c | 122 const struct _mesa_index_buffer *ib, in vbo_rebase_prims() argument
145 if (0 && ib && ctx->Extensions.ARB_draw_elements_base_vertex) { in vbo_rebase_prims()
157 } else if (ib) { in vbo_rebase_prims()
160 GLboolean map_ib = ib->obj->Name && !ib->obj->Pointer; in vbo_rebase_prims()
164 ctx->Driver.MapBufferRange(ctx, 0, ib->obj->Size, GL_MAP_READ_BIT, in vbo_rebase_prims()
165 ib->obj); in vbo_rebase_prims()
168 ptr = ADD_POINTERS(ib->obj->Pointer, ib->ptr); in vbo_rebase_prims()
173 switch (ib->type) { in vbo_rebase_prims()
175 tmp_indices = rebase_GLuint( ptr, ib->count, min_index ); in vbo_rebase_prims()
178 tmp_indices = rebase_GLushort( ptr, ib->count, min_index ); in vbo_rebase_prims()
[all …]
|
| D | vbo_split_inplace.c | 48 const struct _mesa_index_buffer *ib; member
67 struct _mesa_index_buffer ib; in flush_vertex() local
73 if (split->ib) { in flush_vertex()
74 ib = *split->ib; in flush_vertex()
76 ib.count = split->max_index - split->min_index + 1; in flush_vertex()
77 ib.ptr = (const void *)((const char *)ib.ptr + in flush_vertex()
78 split->min_index * _mesa_sizeof_type(ib.type)); in flush_vertex()
93 split->ib ? &ib : NULL, in flush_vertex()
94 !split->ib, in flush_vertex()
208 else if (split->ib == NULL) { in split_prims()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| D | lexicographical_compare.pass.cpp | 29 int ib[] = {1, 2, 3}; in test() local
30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2))); in test()
31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa))); in test()
32 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3))); in test()
33 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
34 assert( std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3))); in test()
35 assert(!std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); in test()
|
| D | lexicographical_compare_comp.pass.cpp | 31 int ib[] = {1, 2, 3}; in test() local
34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c)); in test()
35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c)); in test()
36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c)); in test()
37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
38 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3), c)); in test()
39 assert( std::lexicographical_compare(Iter1(ib+1), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); in test()
|
| /external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
| D | includes.pass.cpp | 29 int ib[] = {2, 4}; in test() local
30 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
36 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib))); in test()
37 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1))); in test()
38 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib))); in test()
41 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb))); in test()
42 assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa))); in test()
45 assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2))); in test()
|
| D | includes_comp.pass.cpp | 30 int ib[] = {2, 4}; in test() local
31 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
37 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>())); in test()
38 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib+1), std::less<int>())); in test()
39 assert(std::includes(Iter1(ia), Iter1(ia+1), Iter2(ib), Iter2(ib), std::less<int>())); in test()
42 assert(std::includes(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+sb), std::less<int>())); in test()
43 assert(!std::includes(Iter1(ib), Iter1(ib+sb), Iter2(ia), Iter2(ia+sa), std::less<int>())); in test()
46 assert(!std::includes(Iter1(ia), Iter1(ia+2), Iter2(ib), Iter2(ib+2), std::less<int>())); in test()
|
| /external/mesa3d/src/gallium/drivers/radeonsi/ |
| D | r600_translate.c | 32 struct pipe_index_buffer *ib, in r600_translate_index_buffer() argument
39 switch (ib->index_size) { in r600_translate_index_buffer()
45 &r600->context, ib, 0, ib->offset, count, ptr); in r600_translate_index_buffer()
47 pipe_resource_reference(&ib->buffer, NULL); in r600_translate_index_buffer()
48 ib->buffer = out_buffer; in r600_translate_index_buffer()
49 ib->offset = out_offset; in r600_translate_index_buffer()
50 ib->index_size = 2; in r600_translate_index_buffer()
|
| /external/mesa3d/src/gallium/drivers/r600/ |
| D | r600_translate.c | 32 struct pipe_index_buffer *ib, in r600_translate_index_buffer() argument
39 switch (ib->index_size) { in r600_translate_index_buffer()
45 &r600->context, ib, 0, ib->offset, count, ptr); in r600_translate_index_buffer()
47 pipe_resource_reference(&ib->buffer, NULL); in r600_translate_index_buffer()
48 ib->buffer = out_buffer; in r600_translate_index_buffer()
49 ib->offset = out_offset; in r600_translate_index_buffer()
50 ib->index_size = 2; in r600_translate_index_buffer()
|
| /external/sqlite/android/ |
| D | OldPhoneNumberUtils.cpp | 197 int ia, ib; in phone_number_compare_loose() local
207 ib = strlen(b); in phone_number_compare_loose()
208 if (ia == 0 || ib == 0) { in phone_number_compare_loose()
214 ib--; in phone_number_compare_loose()
218 while (ia >= 0 && ib >=0) { in phone_number_compare_loose()
230 cb = b[ib]; in phone_number_compare_loose()
233 ib--; in phone_number_compare_loose()
242 ia--; ib--; matched++; in phone_number_compare_loose()
260 if (matched >= MIN_MATCH && (ia < 0 || ib < 0)) { in phone_number_compare_loose()
273 if (matchIntlPrefix(a, ia + 1) && matchIntlPrefix(b, ib +1)) { in phone_number_compare_loose()
[all …]
|
| /external/jmonkeyengine/engine/src/core/com/jme3/scene/shape/ |
| D | Dome.java | 275 ShortBuffer ib = BufferUtils.createShortBuffer(3 * triCount); in updateGeometry() local
276 setBuffer(Type.Index, 3, ib); in updateGeometry()
286 ib.put((short) (bottomPlaneStart + sample)); in updateGeometry()
287 ib.put((short) (bottomPlaneStart + sample + 1)); in updateGeometry()
288 ib.put((short) (topPlaneStart + sample)); in updateGeometry()
289 ib.put((short) (bottomPlaneStart + sample + 1)); in updateGeometry()
290 ib.put((short) (topPlaneStart + sample + 1)); in updateGeometry()
291 ib.put((short) (topPlaneStart + sample)); in updateGeometry()
293 ib.put((short) (bottomPlaneStart + sample)); in updateGeometry()
294 ib.put((short) (topPlaneStart + sample)); in updateGeometry()
[all …]
|
| /external/jmonkeyengine/engine/src/lwjgl/com/jme3/audio/lwjgl/ |
| D | LwjglAudioRenderer.java | 63 private IntBuffer ib = BufferUtils.createIntBuffer(1); field in LwjglAudioRenderer
186 ib = BufferUtils.createIntBuffer(channels.length); in initInThread()
193 ib.position(0).limit(1); in initInThread()
194 ALC10.alcGetInteger(device, EFX10.ALC_EFX_MAJOR_VERSION, ib); in initInThread()
195 int major = ib.get(0); in initInThread()
196 ib.position(0).limit(1); in initInThread()
197 ALC10.alcGetInteger(device, EFX10.ALC_EFX_MINOR_VERSION, ib); in initInThread()
198 int minor = ib.get(0); in initInThread()
201 ALC10.alcGetInteger(device, EFX10.ALC_MAX_AUXILIARY_SENDS, ib); in initInThread()
202 auxSends = ib.get(0); in initInThread()
[all …]
|
| /external/mesa3d/src/mesa/drivers/dri/nouveau/ |
| D | nouveau_vbo_t.c | 55 vbo_init_arrays(struct gl_context *ctx, const struct _mesa_index_buffer *ib, in vbo_init_arrays() argument
62 if (ib) in vbo_init_arrays()
63 nouveau_init_array(&render->ib, 0, 0, ib->count, ib->type, in vbo_init_arrays()
64 ib->obj, ib->ptr, GL_TRUE, ctx); in vbo_init_arrays()
78 vbo_deinit_arrays(struct gl_context *ctx, const struct _mesa_index_buffer *ib, in vbo_deinit_arrays() argument
84 if (ib) in vbo_deinit_arrays()
85 nouveau_cleanup_array(&render->ib); in vbo_deinit_arrays()
222 const struct _mesa_index_buffer *ib,
230 const struct _mesa_index_buffer *ib, in vbo_maybe_split() argument
239 idx_avail = get_max_vertices(ctx, ib, pushbuf_avail); in vbo_maybe_split()
[all …]
|
| /external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/ |
| D | unique.pass.cpp | 36 int ib[] = {0, 1}; in test() local
37 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test()
38 r = std::unique(Iter(ib), Iter(ib+sb)); in test()
39 assert(base(r) == ib + sb); in test()
40 assert(ib[0] == 0); in test()
41 assert(ib[1] == 1); in test()
108 Ptr ib[2]; in test1() local
109 ib[1].reset(&one); in test1()
110 const unsigned sb = sizeof(ib)/sizeof(ib[0]); in test1()
111 r = std::unique(Iter(ib), Iter(ib+sb)); in test1()
[all …]
|