Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:ib (Results 1 - 25 of 318) sorted by null

1 2 3 4 5 6 7 8 91011>>

/external/mesa3d/src/gallium/drivers/r600/
r600_translate.c	32 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;
/external/mesa3d/src/gallium/drivers/radeonsi/
r600_translate.c	32 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;
/external/libcxx/test/std/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
compare.pass.cpp	26 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+1, ib+3) == -1) 39 const wchar_t ib[] = L"123"; local     [all...]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/localization/locale.categories/category.collate/locale.collate/locale.collate.members/
compare.pass.cpp	26 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+1, ib+3) == -1) 39 const wchar_t ib[] = L"123"; local     [all...]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/
rotate_copy.pass.cpp	27 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...]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.modifying.operations/alg.rotate/
rotate_copy.pass.cpp	27 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/std/algorithms/alg.nonmodifying/alg.is_permutation/
is_permutation.pass.cpp	30 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[] = {1} 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...]
is_permutation_pred.pass.cpp	39 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...]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.is_permutation/
is_permutation.pass.cpp	30 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[] = {1} 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...]
is_permutation_pred.pass.cpp	39 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/std/algorithms/alg.nonmodifying/mismatch/
mismatch.pass.cpp	28 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local 29 const unsigned sb = sizeof(ib)/sizeof(ib[0]); ((void)sb); // unused in c++11 34 assert(std::mismatch(II(ia), II(ia + sa), II(ib)) 35 == (std::pair<II, II>(II(ia+3), II(ib+3)))); 37 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib)) 38 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 41 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib+sb)) 42 == (std::pair<II, II>(II(ia+3), II(ib+3))))     [all...]
mismatch_pred.pass.cpp	34 int ib[] = {0, 1, 2, 3, 0, 1, 2, 3}; local 35 const unsigned sb = sizeof(ib)/sizeof(ib[0]); ((void)sb); // unused in c++11 41 assert(std::mismatch(II(ia), II(ia + sa), II(ib), EQ()) 42 == (std::pair<II, II>(II(ia+3), II(ib+3)))); 43 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), EQ()) 44 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 47 assert(std::mismatch(RAI(ia), RAI(ia + sa), RAI(ib), std::ref(bcp)) 48 == (std::pair<RAI, RAI>(RAI(ia+3), RAI(ib+3)))); 53 assert(std::mismatch(II(ia), II(ia + sa), II(ib), II(ib + sb), EQ()     [all...]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/mismatch/
mismatch.pass.cpp	30 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))));
mismatch_pred.pass.cpp	33 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 + sa, std::equal_to<int>()) =     [all...]
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
search_n.pass.cpp	42 int ib[] = {0, 0, 1, 1, 2, 2}; local 43 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 44 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0) == Iter(ib)); 45 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0) == Iter(ib+0)); 46 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0) == Iter(ib+0))     [all...]
search_n_pred.pass.cpp	78 int ib[] = {0, 0, 1, 1, 2, 2}; local 79 const unsigned sb = sizeof(ib)/sizeof(ib[0]); 80 assert(std::search_n(Iter(ib), Iter(ib+sb), 0, 0, count_equal()) == Iter(ib)); 83 assert(std::search_n(Iter(ib), Iter(ib+sb), 1, 0, count_equal()) == Iter(ib+0)); 86 assert(std::search_n(Iter(ib), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0))     [all...]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.nonmodifying/alg.search/
search_n.pass.cpp	41 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), Iter(ib+sb), 2, 0) == Iter(ib+0))     [all...]
search_n_pred.pass.cpp	76 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), Iter(ib+sb), 2, 0, count_equal()) == Iter(ib+0))     [all...]
/external/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/
lexicographical_compare.pass.cpp	29 int ib[] = {1, 2, 3}; local 30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2))); 31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa))); 32 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3))); 33 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); 34 assert( std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3)))     [all...]
lexicographical_compare_comp.pass.cpp	31 int ib[] = {1, 2, 3}; local 34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c)); 35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c)); 36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c)); 37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); 38 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3), c))     [all...]
/ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.lex.comparison/
lexicographical_compare.pass.cpp	29 int ib[] = {1, 2, 3}; local 30 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2))); 31 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa))); 32 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3))); 33 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa))); 34 assert( std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3)))     [all...]
lexicographical_compare_comp.pass.cpp	31 int ib[] = {1, 2, 3}; local 34 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+2), c)); 35 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+2), Iter2(ia), Iter2(ia+sa), c)); 36 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib), Iter2(ib+3), c)); 37 assert( std::lexicographical_compare(Iter1(ib), Iter1(ib+3), Iter2(ia), Iter2(ia+sa), c)); 38 assert(!std::lexicographical_compare(Iter1(ia), Iter1(ia+sa), Iter2(ib+1), Iter2(ib+3), c))     [all...]
/external/mesa3d/src/gallium/auxiliary/util/
u_index_modify.h	31 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/std/algorithms/alg.modifying.operations/alg.remove/
remove_copy.pass.cpp	28 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);
remove_copy_if.pass.cpp	30 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);

Completed in 451 milliseconds

1 2 3 4 5 6 7 8 91011>>