Searched defs:ib (Results 26 - 50 of 190) sorted by relevance

12345678

/external/libcxx/test/numerics/numeric.ops/partial.sum/
H A Dpartial_sum.pass.cpp32 int ib[s] = {0}; local
33 OutIter r = std::partial_sum(InIter(ia), InIter(ia+s), OutIter(ib));
34 assert(base(r) == ib + s);
36 assert(ib[i] == ir[i]);
H A Dpartial_sum_op.pass.cpp34 int ib[s] = {0}; local
35 OutIter r = std::partial_sum(InIter(ia), InIter(ia+s), OutIter(ib), std::minus<int>());
36 assert(base(r) == ib + s);
38 assert(ib[i] == ir[i]);
/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/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/
H A Dr300_render_translate.c29 struct pipe_index_buffer *ib,
44 &r300->context, ib, index_offset,
57 util_rebuild_ushort_elts_to_userptr(&r300->context, ib,
71 util_rebuild_uint_elts_to_userptr(&r300->context, ib,
28 r300_translate_index_buffer(struct r300_context *r300, struct pipe_index_buffer *ib, struct pipe_resource **out_buffer, unsigned *index_size, unsigned index_offset, unsigned *start, unsigned count) argument
/external/libcxx/test/algorithms/alg.modifying.operations/alg.copy/
H A Dcopy_if.pass.cpp36 int ib[N] = {0}; local
38 OutIter r = std::copy_if(InIter(ia), InIter(ia+N), OutIter(ib), Pred());
39 assert(base(r) == ib+N/3+1);
41 assert(ib[i] % 3 == 0);
/external/libcxx/test/algorithms/alg.modifying.operations/alg.reverse/
H A Dreverse.pass.cpp33 int ib[] = {0, 1}; local
34 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
35 std::reverse(Iter(ib), Iter(ib+sb));
36 assert(ib[0] == 1);
37 assert(ib[1] == 0);
H A Dreverse_copy.pass.cpp34 const int ib[] = {0, 1}; local
35 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
37 r = std::reverse_copy(InIter(ib), InIter(ib+sb), OutIter(jb));
/external/libcxx/test/algorithms/alg.nonmodifying/alg.equal/
H A Dequal_pred.pass.cpp39 int ib[s] = {0, 1, 2, 5, 4, 5}; local
73 input_iterator<const int*>(ib),
78 input_iterator<const int*>(ib),
79 input_iterator<const int*>(ib+s),
83 random_access_iterator<const int*>(ib),
84 random_access_iterator<const int*>(ib+s),
/external/libcxx/test/algorithms/alg.nonmodifying/alg.is_permutation/
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/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...]
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/includes/
H A Dincludes.pass.cpp29 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), Iter
[all...]
H A Dincludes_comp.pass.cpp30 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), Iter
[all...]
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.intersection/
H A Dset_intersection.pass.cpp32 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),
H A Dset_intersection_comp.pass.cpp34 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),
/external/libcxx/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/
H A Dset_symmetric_difference.pass.cpp33 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),
H A Dset_symmetric_difference_comp.pass.cpp35 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/algorithms/alg.sorting/alg.set.operations/set.union/
H A Dset_union.pass.cpp32 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),
H A Dset_union_comp.pass.cpp34 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),
/external/mesa3d/src/gallium/drivers/r300/
H A Dr300_render_translate.c29 struct pipe_index_buffer *ib,
44 &r300->context, ib, index_offset,
57 util_rebuild_ushort_elts_to_userptr(&r300->context, ib,
71 util_rebuild_uint_elts_to_userptr(&r300->context, ib,
28 r300_translate_index_buffer(struct r300_context *r300, struct pipe_index_buffer *ib, struct pipe_resource **out_buffer, unsigned *index_size, unsigned index_offset, unsigned *start, unsigned count) argument
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/
H A Dlp_state_vertex.c97 const struct pipe_index_buffer *ib)
101 if (ib)
102 memcpy(&llvmpipe->index_buffer, ib, sizeof(llvmpipe->index_buffer));
96 llvmpipe_set_index_buffer(struct pipe_context *pipe, const struct pipe_index_buffer *ib) argument
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/softpipe/
H A Dsp_state_vertex.c101 const struct pipe_index_buffer *ib)
105 if (ib)
106 memcpy(&softpipe->index_buffer, ib, sizeof(softpipe->index_buffer));
100 softpipe_set_index_buffer(struct pipe_context *pipe, const struct pipe_index_buffer *ib) argument
/external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/
H A Dbrw_primitive_restart.c43 const struct _mesa_index_buffer *ib)
53 switch (ib->type) {
79 const struct _mesa_index_buffer *ib)
93 if (!can_cut_index_handle_restart_index(ctx, ib)) {
133 const struct _mesa_index_buffer *ib)
138 if (ib == NULL) {
169 if (can_cut_index_handle_prims(ctx, prim, nr_prims, ib)) {
173 brw_draw_prims(ctx, prim, nr_prims, ib, GL_FALSE, -1, -1, NULL);
179 vbo_sw_primitive_restart(ctx, prim, nr_prims, ib);
42 can_cut_index_handle_restart_index(struct gl_context *ctx, const struct _mesa_index_buffer *ib) argument
76 can_cut_index_handle_prims(struct gl_context *ctx, const struct _mesa_prim *prim, GLuint nr_prims, const struct _mesa_index_buffer *ib) argument
130 brw_handle_primitive_restart(struct gl_context *ctx, const struct _mesa_prim *prim, GLuint nr_prims, const struct _mesa_index_buffer *ib) argument
/external/chromium_org/third_party/mesa/src/src/mesa/vbo/
H A Dvbo_split.c105 const struct _mesa_index_buffer *ib,
119 if (ib) {
137 vbo_split_copy(ctx, arrays, prim, nr_prims, ib,
140 else if (ib->count > limits->max_indices) {
145 vbo_split_inplace(ctx, arrays, prim, nr_prims, ib,
159 vbo_split_inplace(ctx, arrays, prim, nr_prims, ib,
101 vbo_split_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, const struct split_limits *limits ) argument
/external/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/
H A Drotate.pass.cpp40 int ib[] = {0, 1}; local
41 const unsigned sb = sizeof(ib)/sizeof(ib[0]);
42 r = std::rotate(Iter(ib), Iter(ib), Iter(ib+sb));
43 assert(base(r) == ib+sb);
44 assert(ib[0] == 0);
45 assert(ib[1] == 1);
46 r = std::rotate(Iter(ib), Ite
236 std::unique_ptr<int> ib[2]; local
[all...]

Completed in 2694 milliseconds

12345678