Searched refs:ib (Results 1 - 25 of 246) sorted by relevance

12345678910

/external/chromium_org/third_party/mesa/src/src/gallium/drivers/r600/
H A Dr600_translate.c32 struct pipe_index_buffer *ib,
39 switch (ib->index_size) {
45 &r600->context, ib, 0, ib->offset, count, ptr);
47 pipe_resource_reference(&ib->buffer, NULL);
48 ib->buffer = out_buffer;
49 ib->offset = out_offset;
50 ib->index_size = 2;
31 r600_translate_index_buffer(struct r600_context *r600, struct pipe_index_buffer *ib, unsigned count) argument
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeonsi/
H A Dr600_translate.c32 struct pipe_index_buffer *ib,
39 switch (ib->index_size) {
45 &r600->context, ib, 0, ib->offset, count, ptr);
47 pipe_resource_reference(&ib->buffer, NULL);
48 ib->buffer = out_buffer;
49 ib->offset = out_offset;
50 ib->index_size = 2;
31 r600_translate_index_buffer(struct r600_context *r600, struct pipe_index_buffer *ib, unsigned count) argument
/external/mesa3d/src/gallium/drivers/r600/
H A Dr600_translate.c32 struct pipe_index_buffer *ib,
39 switch (ib->index_size) {
45 &r600->context, ib, 0, ib->offset, count, ptr);
47 pipe_resource_reference(&ib->buffer, NULL);
48 ib->buffer = out_buffer;
49 ib->offset = out_offset;
50 ib->index_size = 2;
31 r600_translate_index_buffer(struct r600_context *r600, struct pipe_index_buffer *ib, unsigned count) argument
/external/mesa3d/src/gallium/drivers/radeonsi/
H A Dr600_translate.c32 struct pipe_index_buffer *ib,
39 switch (ib->index_size) {
45 &r600->context, ib, 0, ib->offset, count, ptr);
47 pipe_resource_reference(&ib->buffer, NULL);
48 ib->buffer = out_buffer;
49 ib->offset = out_offset;
50 ib->index_size = 2;
31 r600_translate_index_buffer(struct r600_context *r600, struct pipe_index_buffer *ib, unsigned count) argument
/external/libcxx/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
H A Dcompare.pass.cpp26 const char ib[] = "123"; local
28 assert(f.compare(ia, ia+sa, ib, ib+2) == 1);
29 assert(f.compare(ib, ib+2, ia, ia+sa) == -1);
30 assert(f.compare(ia, ia+sa, ib, ib+3) == 1);
31 assert(f.compare(ib, ib+3, ia, ia+sa) == -1);
32 assert(f.compare(ia, ia+sa, ib
39 const wchar_t ib[] = L"123"; local
[all...]
/external/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/
H A Drotate_copy.pass.cpp27 int ib[sa] = {0}; local
29 OutIter r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia), OutIter(ib));
30 assert(base(r) == ib);
32 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+1), OutIter(ib));
33 assert(base(r) == ib+1);
34 assert(ib[0] == 0);
36 r = std::rotate_copy(InIter(ia), InIter(ia+1), InIter(ia+1), OutIter(ib));
37 assert(base(r) == ib+1);
38 assert(ib[0] == 0);
40 r = std::rotate_copy(InIter(ia), InIter(ia), InIter(ia+2), OutIter(ib));
[all...]
/external/libcxx/test/algorithms/alg.nonmodifying/alg.is_permutation/
H A Dis_permutation.pass.cpp30 const int ib[] = {0}; local
34 forward_iterator<const int*>(ib)) == true);
38 forward_iterator<const int*>(ib),
39 forward_iterator<const int*>(ib + 0)) == true);
43 forward_iterator<const int*>(ib)) == true);
47 forward_iterator<const int*>(ib),
48 forward_iterator<const int*>(ib + sa)) == true);
51 forward_iterator<const int*>(ib),
52 forward_iterator<const int*>(ib + sa - 1)) == false);
57 const int ib[] local
72 const int ib[] = {0, 0}; local
90 const int ib[] = {0, 1}; local
104 const int ib[] = {1, 0}; local
118 const int ib[] = {1, 1}; local
132 const int ib[] = {0, 0}; local
146 const int ib[] = {0, 1}; local
164 const int ib[] = {1, 0}; local
178 const int ib[] = {1, 1}; local
192 const int ib[] = {0, 0}; local
206 const int ib[] = {0, 1}; local
220 const int ib[] = {1, 0}; local
234 const int ib[] = {1, 1}; local
248 const int ib[] = {0, 0}; local
262 const int ib[] = {0, 1}; local
276 const int ib[] = {1, 0}; local
290 const int ib[] = {1, 1}; local
305 const int ib[] = {1, 0, 0}; local
319 const int ib[] = {1, 0, 1}; local
333 const int ib[] = {1, 0, 2}; local
347 const int ib[] = {1, 1, 0}; local
361 const int ib[] = {1, 1, 1}; local
375 const int ib[] = {1, 1, 2}; local
389 const int ib[] = {1, 2, 0}; local
403 const int ib[] = {1, 2, 1}; local
417 const int ib[] = {1, 2, 2}; local
431 const int ib[] = {1, 0, 0}; local
449 const int ib[] = {1, 0, 1}; local
463 const int ib[] = {1, 0, 2}; local
481 const int ib[] = {1, 2, 0}; local
499 const int ib[] = {2, 1, 0}; local
517 const int ib[] = {2, 0, 1}; local
535 const int ib[] = {1, 0, 1}; local
549 const int ib[] = {1, 0, 0}; local
571 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local
593 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local
[all...]
H A Dis_permutation_pred.pass.cpp39 const int ib[] = {0}; local
43 forward_iterator<const int*>(ib),
47 forward_iterator<const int*>(ib),
52 forward_iterator<const int*>(ib),
53 forward_iterator<const int*>(ib + sa),
57 forward_iterator<const int*>(ib),
58 forward_iterator<const int*>(ib + sa - 1),
64 const int ib[] = {1}; local
68 forward_iterator<const int*>(ib),
73 forward_iterator<const int*>(ib),
81 const int ib[] = {0, 0}; local
102 const int ib[] = {0, 1}; local
118 const int ib[] = {1, 0}; local
134 const int ib[] = {1, 1}; local
150 const int ib[] = {0, 0}; local
166 const int ib[] = {0, 1}; local
187 const int ib[] = {1, 0}; local
208 const int ib[] = {1, 1}; local
224 const int ib[] = {0, 0}; local
240 const int ib[] = {0, 1}; local
261 const int ib[] = {1, 0}; local
282 const int ib[] = {1, 1}; local
298 const int ib[] = {0, 0}; local
314 const int ib[] = {0, 1}; local
330 const int ib[] = {1, 0}; local
346 const int ib[] = {1, 1}; local
368 const int ib[] = {1, 0, 0}; local
384 const int ib[] = {1, 0, 1}; local
400 const int ib[] = {1, 0, 2}; local
416 const int ib[] = {1, 1, 0}; local
432 const int ib[] = {1, 1, 1}; local
448 const int ib[] = {1, 1, 2}; local
464 const int ib[] = {1, 2, 0}; local
480 const int ib[] = {1, 2, 1}; local
496 const int ib[] = {1, 2, 2}; local
512 const int ib[] = {1, 0, 0}; local
533 const int ib[] = {1, 0, 1}; local
549 const int ib[] = {1, 0, 2}; local
570 const int ib[] = {1, 2, 0}; local
591 const int ib[] = {2, 1, 0}; local
612 const int ib[] = {2, 0, 1}; local
633 const int ib[] = {1, 0, 1}; local
649 const int ib[] = {1, 0, 0}; local
675 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local
715 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local
[all...]
/external/libcxx/test/algorithms/alg.nonmodifying/mismatch/
H A Dmismatch.pass.cpp30 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
33 input_iterator<const int*>(ib)) ==
37 input_iterator<const int*>(ib+3))));
42 input_iterator<const int*>(ib),
43 input_iterator<const int*>(ib + sa)) ==
47 input_iterator<const int*>(ib+3))));
51 input_iterator<const int*>(ib),
52 input_iterator<const int*>(ib + 2)) ==
56 input_iterator<const int*>(ib+2))));
H A Dmismatch_pred.pass.cpp33 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local
36 input_iterator<const int*>(ib),
41 input_iterator<const int*>(ib+3))));
45 input_iterator<const int*>(ib),
46 input_iterator<const int*>(ib + sa),
51 input_iterator<const int*>(ib+3))));
54 assert(std::mismatch(ia, ia + sa, ib, std::equal_to<int>()) ==
55 (std::pair<int*,int*>(ia+3,ib+3)));
57 assert(std::mismatch(ia, ia + sa, ib, ib
[all...]
/external/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/
H A Dlexicographical_compare.pass.cpp29 int ib[] = {1, 2, 3}; local
30 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2));
31 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa));
32 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3));
33 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa));
34 assert(std::lexicographical_compare(ia, ia+sa, ib
[all...]
H A Dlexicographical_compare_comp.pass.cpp31 int ib[] = {1, 2, 3}; local
34 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+2, c));
35 assert(std::lexicographical_compare(ib, ib+2, ia, ia+sa, c));
36 assert(!std::lexicographical_compare(ia, ia+sa, ib, ib+3, c));
37 assert(std::lexicographical_compare(ib, ib+3, ia, ia+sa, c));
38 assert(!std::lexicographical_compare(ia, ia+sa, ib
[all...]
/external/libcxx/test/algorithms/alg.nonmodifying/alg.search/
H A Dsearch_n.pass.cpp41 int ib[] = {0, 0, 1, 1, 2, 2}; local
42 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
43 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib));
44 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0));
45 assert(std::search_n(Iter(ib), Ite
[all...]
H A Dsearch_n_pred.pass.cpp76 int ib[] = {0, 0, 1, 1, 2, 2}; local
77 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
78 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib));
81 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0));
84 assert(std::search_n(Iter(ib), Ite
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/
H A Du_index_modify.h31 struct pipe_index_buffer *ib,
38 struct pipe_index_buffer *ib,
47 struct pipe_index_buffer *ib,
53 struct pipe_index_buffer *ib,
61 struct pipe_index_buffer *ib,
67 struct pipe_index_buffer *ib,
H A Du_index_modify.c30 struct pipe_index_buffer *ib,
41 if (ib->user_buffer) {
42 in_map = ib->user_buffer;
44 in_map = pipe_buffer_map(context, ib->buffer,
62 struct pipe_index_buffer *ib,
79 util_shorten_ubyte_elts_to_userptr(context, ib, index_bias,
91 struct pipe_index_buffer *ib,
101 if (ib->user_buffer) {
102 in_map = ib->user_buffer;
104 in_map = pipe_buffer_map(context, ib
29 util_shorten_ubyte_elts_to_userptr(struct pipe_context *context, struct pipe_index_buffer *ib, int index_bias, unsigned start, unsigned count, void *out) argument
61 util_shorten_ubyte_elts(struct pipe_context *context, struct pipe_index_buffer *ib, struct pipe_resource **out_buf, int index_bias, unsigned start, unsigned count) argument
90 util_rebuild_ushort_elts_to_userptr(struct pipe_context *context, struct pipe_index_buffer *ib, int index_bias, unsigned start, unsigned count, void *out) argument
121 util_rebuild_ushort_elts(struct pipe_context *context, struct pipe_index_buffer *ib, struct pipe_resource **out_buf, int index_bias, unsigned start, unsigned count) argument
149 util_rebuild_uint_elts_to_userptr(struct pipe_context *context, struct pipe_index_buffer *ib, int index_bias, unsigned start, unsigned count, void *out) argument
180 util_rebuild_uint_elts(struct pipe_context *context, struct pipe_index_buffer *ib, struct pipe_resource **out_buf, int index_bias, unsigned start, unsigned count) argument
[all...]
/external/mesa3d/src/gallium/auxiliary/util/
H A Du_index_modify.h31 struct pipe_index_buffer *ib,
38 struct pipe_index_buffer *ib,
47 struct pipe_index_buffer *ib,
53 struct pipe_index_buffer *ib,
61 struct pipe_index_buffer *ib,
67 struct pipe_index_buffer *ib,
/external/libcxx/test/algorithms/alg.modifying.operations/alg.remove/
H A Dremove_copy.pass.cpp28 int ib[sa]; local
29 OutIter r = std::remove_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2);
30 assert(base(r) == ib + sa-3);
31 assert(ib[0] == 0);
32 assert(ib[1] == 1);
33 assert(ib[2] == 3);
34 assert(ib[3] == 4);
35 assert(ib[4] == 3);
36 assert(ib[5] == 4);
H A Dremove_copy_if.pass.cpp30 int ib[sa]; local
31 OutIter r = std::remove_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
33 assert(base(r) == ib + sa-3);
34 assert(ib[0] == 0);
35 assert(ib[1] == 1);
36 assert(ib[2] == 3);
37 assert(ib[3] == 4);
38 assert(ib[4] == 3);
39 assert(ib[5] == 4);
/external/libcxx/test/algorithms/alg.modifying.operations/alg.replace/
H A Dreplace_copy.pass.cpp31 int ib[sa] = {0}; local
32 OutIter r = std::replace_copy(InIter(ia), InIter(ia+sa), OutIter(ib), 2, 5);
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 0);
35 assert(ib[1] == 1);
36 assert(ib[2] == 5);
37 assert(ib[3] == 3);
38 assert(ib[4] == 4);
H A Dreplace_copy_if.pass.cpp32 int ib[sa] = {0}; local
33 OutIter r = std::replace_copy_if(InIter(ia), InIter(ia+sa), OutIter(ib),
35 assert(base(r) == ib + sa);
36 assert(ib[0] == 0);
37 assert(ib[1] == 1);
38 assert(ib[2] == 5);
39 assert(ib[3] == 3);
40 assert(ib[4] == 4);
/external/libcxx/test/algorithms/alg.modifying.operations/alg.transform/
H A Dunary_transform.pass.cpp30 int ib[sa] = {0}; local
31 OutIter r = std::transform(InIter(ia), InIter(ia+sa), OutIter(ib),
33 assert(base(r) == ib + sa);
34 assert(ib[0] == 1);
35 assert(ib[1] == 2);
36 assert(ib[2] == 3);
37 assert(ib[3] == 4);
38 assert(ib[4] == 5);
/external/libcxx/test/algorithms/alg.nonmodifying/alg.find.first.of/
H A Dfind_first_of.pass.cpp26 int ib[] = {1, 3, 5, 7}; local
27 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
30 forward_iterator<const int*>(ib),
31 forward_iterator<const int*>(ib + sb)) ==
H A Dfind_first_of_pred.pass.cpp28 int ib[] = {1, 3, 5, 7}; local
29 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
32 forward_iterator<const int*>(ib),
33 forward_iterator<const int*>(ib + sb),
/external/chromium_org/third_party/mesa/src/src/mesa/vbo/
H A Dvbo_rebase.c107 * - if ib != NULL and min_index != 0, otherwise vertices lower than
110 * - if ib == NULL and min_index != 0, just for convenience so this doesn't
122 const struct _mesa_index_buffer *ib,
145 if (0 && ib && ctx->Extensions.ARB_draw_elements_base_vertex) {
157 } else if (ib) {
160 GLboolean map_ib = ib->obj->Name && !ib->obj->Pointer;
164 ctx->Driver.MapBufferRange(ctx, 0, ib->obj->Size, GL_MAP_READ_BIT,
165 ib->obj);
168 ptr = ADD_POINTERS(ib
118 vbo_rebase_prims( struct gl_context *ctx, const struct gl_client_array *arrays[], const struct _mesa_prim *prim, GLuint nr_prims, const struct _mesa_index_buffer *ib, GLuint min_index, GLuint max_index, vbo_draw_func draw ) argument
[all...]

Completed in 326 milliseconds

12345678910