/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/ |
H A D | 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[ local [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find/ |
H A D | 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)
|
H A D | 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/libcxx/test/std/algorithms/alg.nonmodifying/mismatch/ |
H A D | mismatch.pass.cpp | 30 int ib[] = {1, 3}; local 43 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic)); 44 if (p3.first != ib+2 || p3.second != ic+2) 47 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic)); 48 if (p4.first != ib+2 || p4.second != ic+2) 51 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic))); 52 if (p5.first != II(ib 66 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local [all...] |
H A D | mismatch_pred.pass.cpp | 35 int ib[] = {1, 3}; local 48 auto p3 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), eq); 49 if (p3.first != ib+2 || p3.second != ic+2) 52 auto p4 = std::mismatch(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), eq); 53 if (p4.first != ib+2 || p4.second != ic+2) 56 auto p5 = std::mismatch(II(std::begin(ib)), II(std::end(ib)), II(std::begin(ic)), eq); 57 if (p5.first != II(ib 76 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local [all...] |
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/ |
H A D | includes.pass.cpp | 27 int ib[] = {2, 4}; local 30 return std::includes(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib)) 42 int ib[] = {2, 4}; local 43 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 49 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib))); 50 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib [all...] |
H A D | includes_comp.pass.cpp | 28 int ib[] = {2, 4}; local 32 return std::includes(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), comp) 45 int ib[] = {2, 4}; local 46 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 52 assert(std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib), std::less<int>())); 53 assert(!std::includes(Iter1(ia), Iter1(ia), Iter2(ib), Iter2(ib [all...] |
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/set.difference/ |
H A D | 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),
|
H A D | set_difference_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>()); 45 ce = std::set_difference(Iter1(ib), Iter1(ib+sb),
|
/external/libcxx/test/std/numerics/numeric.ops/adjacent.difference/ |
H A D | 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]);
|
H A D | 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/numerics/numeric.ops/transform.reduce/ |
H A D | transform_reduce_iter_iter_iter_init.pass.cpp | 64 MoveOnly ib[] = {{1}, {2}, {3}}; local 66 std::transform_reduce(std::begin(ia), std::end(ia), std::begin(ib), MoveOnly{0}).get());
|
H A D | transform_reduce_iter_iter_iter_init_op_op.pass.cpp | 66 MoveOnly ib[] = {{1}, {2}, {3}}; local 68 std::transform_reduce(std::begin(ia), std::end(ia), std::begin(ib), MoveOnly{0},
|
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_index_modify.c | 30 struct pipe_index_buffer *ib, 42 if (ib->user_buffer) { 43 in_map = ib->user_buffer; 45 in_map = pipe_buffer_map(context, ib->buffer, 65 struct pipe_index_buffer *ib, 76 if (ib->user_buffer) { 77 in_map = ib->user_buffer; 79 in_map = pipe_buffer_map(context, ib->buffer, 99 struct pipe_index_buffer *ib, 110 if (ib 29 util_shorten_ubyte_elts_to_userptr(struct pipe_context *context, struct pipe_index_buffer *ib, unsigned add_transfer_flags, int index_bias, unsigned start, unsigned count, void *out) argument 64 util_rebuild_ushort_elts_to_userptr(struct pipe_context *context, struct pipe_index_buffer *ib, unsigned add_transfer_flags, int index_bias, unsigned start, unsigned count, void *out) argument 98 util_rebuild_uint_elts_to_userptr(struct pipe_context *context, struct pipe_index_buffer *ib, unsigned add_transfer_flags, int index_bias, unsigned start, unsigned count, void *out) argument [all...] |
/external/mesa3d/src/gallium/drivers/llvmpipe/ |
H A D | lp_state_vertex.c | 98 const struct pipe_index_buffer *ib) 102 if (ib) 103 memcpy(&llvmpipe->index_buffer, ib, sizeof(llvmpipe->index_buffer)); 97 llvmpipe_set_index_buffer(struct pipe_context *pipe, const struct pipe_index_buffer *ib) argument
|
/external/mesa3d/src/gallium/drivers/softpipe/ |
H A D | sp_state_vertex.c | 102 const struct pipe_index_buffer *ib) 106 if (ib) 107 memcpy(&softpipe->index_buffer, ib, sizeof(softpipe->index_buffer)); 101 softpipe_set_index_buffer(struct pipe_context *pipe, const struct pipe_index_buffer *ib) argument
|
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | brw_primitive_restart.c | 45 const struct _mesa_index_buffer *ib) 55 switch (ib->type) { 80 const struct _mesa_index_buffer *ib) 88 if (!can_cut_index_handle_restart_index(ctx, ib)) { 132 const struct _mesa_index_buffer *ib, 138 if (ib == NULL) { 161 if (can_cut_index_handle_prims(ctx, prims, nr_prims, ib)) { 165 brw_draw_prims(ctx, prims, nr_prims, ib, GL_FALSE, -1, -1, NULL, 0, 172 vbo_sw_primitive_restart(ctx, prims, nr_prims, ib, indirect); 195 if (brw->ib 44 can_cut_index_handle_restart_index(struct gl_context *ctx, const struct _mesa_index_buffer *ib) argument 77 can_cut_index_handle_prims(struct gl_context *ctx, const struct _mesa_prim *prim, GLuint nr_prims, const struct _mesa_index_buffer *ib) argument 129 brw_handle_primitive_restart(struct gl_context *ctx, const struct _mesa_prim *prims, GLuint nr_prims, const struct _mesa_index_buffer *ib, struct gl_buffer_object *indirect) argument [all...] |
/external/mesa3d/src/mesa/vbo/ |
H A D | 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, 101 vbo_split_prims( struct gl_context *ctx, const struct gl_vertex_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
|
H A D | vbo_rebase.c | 113 * - if ib != NULL and min_index != 0, otherwise vertices lower than 116 * - if ib == NULL and min_index != 0, just for convenience so this doesn't 128 const struct _mesa_index_buffer *ib, 151 if (0 && ib && ctx->Extensions.ARB_draw_elements_base_vertex) { 168 } else if (ib) { 171 GLboolean map_ib = ib->obj->Name && 172 !ib->obj->Mappings[MAP_INTERNAL].Pointer; 176 ctx->Driver.MapBufferRange(ctx, 0, ib->obj->Size, GL_MAP_READ_BIT, 177 ib->obj, MAP_INTERNAL); 180 ptr = ADD_POINTERS(ib 124 vbo_rebase_prims( struct gl_context *ctx, const struct gl_vertex_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...] |
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/ |
H A D | reverse_copy.pass.cpp | 25 int ib[std::size(ia)] = {0}; local 27 auto it = std::reverse_copy(std::begin(ia), std::end(ia), std::begin(ib)); 29 return std::distance(std::begin(ib), it) == std::size(ia) 30 && std::equal (std::begin(ia), std::end(ia), std::rbegin(ib)) 48 const int ib[] = {0, 1}; local 49 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 51 r = std::reverse_copy(InIter(ib), InIter(ib+sb), OutIter(jb));
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/ |
H A D | find_end.pass.cpp | 26 int ib[] = {4, 5, 6}; local 33 && (std::find_end(FI(std::begin(ic)), FI(std::end(ic)), FI(std::begin(ib)), FI(std::end(ib))) == FI(std::end(ic))) 35 && (std::find_end(BI(std::begin(ic)), BI(std::end(ic)), BI(std::begin(ib)), BI(std::end(ib))) == BI(std::end(ic))) 37 && (std::find_end(RI(std::begin(ic)), RI(std::end(ic)), RI(std::begin(ib)), RI(std::end(ib))) == RI(std::end(ic)))
|
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/ |
H A D | is_permutation_pred.pass.cpp | 34 int ib[] = {1, 1, 0}; local 38 return !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib) , c) 39 && !std::is_permutation(std::begin(ia), std::end(ia), std::begin(ib), std::end(ib), c) 40 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic) , c) 41 && std::is_permutation(std::begin(ib), std::end(ib), std::begin(ic), std::end(ic), c) 51 const int ib[] = {0}; local 55 forward_iterator<const int*>(ib), 76 const int ib[] = {1}; local 93 const int ib[] = {0, 0}; local 114 const int ib[] = {0, 1}; local 130 const int ib[] = {1, 0}; local 146 const int ib[] = {1, 1}; local 162 const int ib[] = {0, 0}; local 178 const int ib[] = {0, 1}; local 199 const int ib[] = {1, 0}; local 220 const int ib[] = {1, 1}; local 236 const int ib[] = {0, 0}; local 252 const int ib[] = {0, 1}; local 273 const int ib[] = {1, 0}; local 294 const int ib[] = {1, 1}; local 310 const int ib[] = {0, 0}; local 326 const int ib[] = {0, 1}; local 342 const int ib[] = {1, 0}; local 358 const int ib[] = {1, 1}; local 380 const int ib[] = {1, 0, 0}; local 396 const int ib[] = {1, 0, 1}; local 412 const int ib[] = {1, 0, 2}; local 428 const int ib[] = {1, 1, 0}; local 444 const int ib[] = {1, 1, 1}; local 460 const int ib[] = {1, 1, 2}; local 476 const int ib[] = {1, 2, 0}; local 492 const int ib[] = {1, 2, 1}; local 508 const int ib[] = {1, 2, 2}; local 524 const int ib[] = {1, 0, 0}; local 545 const int ib[] = {1, 0, 1}; local 561 const int ib[] = {1, 0, 2}; local 582 const int ib[] = {1, 2, 0}; local 603 const int ib[] = {2, 1, 0}; local 624 const int ib[] = {2, 0, 1}; local 645 const int ib[] = {1, 0, 1}; local 661 const int ib[] = {1, 0, 0}; local 687 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 2}; local 727 const int ib[] = {4, 2, 3, 0, 1, 4, 0, 5, 6, 0}; local [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
H A D | search_n_pred.pass.cpp | 91 int ib[] = {0, 0, 1, 1, 2, 2}; local 92 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 93 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib)); 96 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0)); 99 assert(std::search_n(Iter(ib), Ite [all...] |
/external/libvpx/libvpx/vp8/encoder/ |
H A D | encodeintra.c | 46 void vp8_encode_intra4x4block(MACROBLOCK *x, int ib) { argument 47 BLOCKD *b = &x->e_mbd.block[ib]; 48 BLOCK *be = &x->block[ib];
|
/external/clang/test/Analysis/engine/ |
H A D | replay-without-inlining.c | 15 const unsigned char *ib; member in struct:__anon2151 25 return input->ib[(input->cur)++]; 51 int bitmapImageRepFromIFF(IB st, const unsigned char *ib, int il) { argument 53 st.ib = ib;
|