Home
last modified time | relevance | path

Searched refs:ic (Results 1 – 25 of 227) sorted by relevance

12345678910

/external/valgrind/none/tests/s390x/
Dinsert.stdout.exp1 ic 0000000000000000 <- 0000000000000000 = 0000000000000000
2 ic 0000000000000001 <- 0000000000000000 = 0000000000000000
3 ic 000000000000FFFF <- 0000000000000000 = 000000000000FF00
4 ic 0000000000007FFF <- 0000000000000000 = 0000000000007F00
5 ic 0000000000008000 <- 0000000000000000 = 0000000000008000
6 ic 00000000FFFFFFFF <- 0000000000000000 = 00000000FFFFFF00
7 ic 0000000080000000 <- 0000000000000000 = 0000000080000000
8 ic 000000007FFFFFFF <- 0000000000000000 = 000000007FFFFF00
9 ic AAAAAAAAAAAAAAAA <- 0000000000000000 = AAAAAAAAAAAAAA00
10 ic 8000000000000000 <- 0000000000000000 = 8000000000000000
[all …]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.rotate/
Drotate.pass.cpp54 int ic[] = {0, 1, 2}; in test() local
55 const int sc = static_cast<int>(sizeof(ic)/sizeof(ic[0])); in test()
56 r = std::rotate(Iter(ic), Iter(ic), Iter(ic+sc)); in test()
57 assert(base(r) == ic+sc); in test()
58 assert(ic[0] == 0); in test()
59 assert(ic[1] == 1); in test()
60 assert(ic[2] == 2); in test()
61 r = std::rotate(Iter(ic), Iter(ic+1), Iter(ic+sc)); in test()
62 assert(base(r) == ic+2); in test()
63 assert(ic[0] == 1); in test()
[all …]
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
Dsearch_n.pass.cpp60 int ic[] = {0, 0, 0}; in test() local
61 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
62 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0) == Iter(ic)); in test()
63 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0) == Iter(ic)); in test()
64 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0) == Iter(ic)); in test()
65 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0) == Iter(ic)); in test()
66 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0) == Iter(ic+sc)); in test()
69 std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(0), 0); in test()
Dsearch_n_pred.pass.cpp126 int ic[] = {0, 0, 0}; in test() local
127 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
128 assert(std::search_n(Iter(ic), Iter(ic+sc), 0, 0, count_equal()) == Iter(ic)); in test()
131 assert(std::search_n(Iter(ic), Iter(ic+sc), 1, 0, count_equal()) == Iter(ic)); in test()
134 assert(std::search_n(Iter(ic), Iter(ic+sc), 2, 0, count_equal()) == Iter(ic)); in test()
137 assert(std::search_n(Iter(ic), Iter(ic+sc), 3, 0, count_equal()) == Iter(ic)); in test()
140 assert(std::search_n(Iter(ic), Iter(ic+sc), 4, 0, count_equal()) == Iter(ic+sc)); in test()
145 std::search_n(Iter(ic), Iter(ic+sc), UserDefinedIntegral<unsigned>(4), 0, count_equal()); in test()
/external/clang/test/CXX/expr/expr.prim/expr.prim.lambda/
Dp7.cpp13 void test_capture_constness(int i, const int ic) { in test_capture_constness() argument
14 (void)[i,ic] ()->void { in test_capture_constness()
16 float &fr2 = check_const_int(ic); in test_capture_constness()
21 float &fr2 = check_const_int(ic); in test_capture_constness()
24 (void)[i,ic] () mutable ->void { in test_capture_constness()
26 float &fr = check_const_int(ic); in test_capture_constness()
31 float &fr = check_const_int(ic); in test_capture_constness()
34 (void)[&i,&ic] ()->void { in test_capture_constness()
36 float &fr = check_const_int(ic); in test_capture_constness()
41 float &fr = check_const_int(ic); in test_capture_constness()
/external/libcxx/test/std/algorithms/alg.sorting/alg.merge/
Dmerge.pass.cpp37 int* ic = new int[2*N]; in test() local
43 InIter2(ib), InIter2(ib+N), OutIter(ic)); in test()
44 assert(base(r) == ic+2*N); in test()
45 assert(ic[0] == 0); in test()
46 assert(ic[2*N-1] == static_cast<int>(2*N-1)); in test()
47 assert(std::is_sorted(ic, ic+2*N)); in test()
48 delete [] ic; in test()
56 int* ic = new int[2*N]; in test() local
58 ic[i] = i; in test()
59 std::shuffle(ic, ic+2*N, randomness); in test()
[all …]
Dmerge_comp.pass.cpp41 int* ic = new int[2*N]; in test() local
50 InIter2(ib), InIter2(ib+N), OutIter(ic), pred); in test()
51 assert(base(r) == ic+2*N); in test()
52 assert(ic[0] == static_cast<int>(2*N-1)); in test()
53 assert(ic[2*N-1] == 0); in test()
54 assert(std::is_sorted(ic, ic+2*N, std::greater<int>())); in test()
56 delete [] ic; in test()
64 int* ic = new int[2*N]; in test() local
66 ic[i] = i; in test()
67 std::shuffle(ic, ic+2*N, randomness); in test()
[all …]
/external/python/cpython2/Lib/plat-mac/
Dic.py164 def __init__(self, signature='Pyth', ic=None): argument
165 if ic:
166 self.ic = ic
168 self.ic = icglue.ICStart(signature)
169 if hasattr(self.ic, 'ICFindConfigFile'):
170 self.ic.ICFindConfigFile()
175 self.ic.ICBegin(icReadOnlyPerm)
176 num = self.ic.ICCountPref()
178 rv.append(self.ic.ICGetIndPref(i+1))
179 self.ic.ICEnd()
[all …]
/external/libpcap/
Doptimize.c241 find_levels_r(opt_state_t *opt_state, struct icode *ic, struct block *b) in find_levels_r() argument
245 if (isMarked(ic, b)) in find_levels_r()
248 Mark(ic, b); in find_levels_r()
252 find_levels_r(opt_state, ic, JT(b)); in find_levels_r()
253 find_levels_r(opt_state, ic, JF(b)); in find_levels_r()
269 find_levels(opt_state_t *opt_state, struct icode *ic) in find_levels() argument
272 unMarkAll(ic); in find_levels()
273 find_levels_r(opt_state, ic, ic->root); in find_levels()
604 fold_op(compiler_state_t *cstate, struct icode *ic, opt_state_t *opt_state, in fold_op() argument
946 opt_stmt(compiler_state_t *cstate, struct icode *ic, opt_state_t *opt_state, in opt_stmt() argument
[all …]
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.reverse/
Dreverse.pass.cpp39 int ic[] = {0, 1, 2}; in test() local
40 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
41 std::reverse(Iter(ic), Iter(ic+sc)); in test()
42 assert(ic[0] == 2); in test()
43 assert(ic[1] == 1); in test()
44 assert(ic[2] == 0); in test()
Dreverse_copy.pass.cpp42 const int ic[] = {0, 1, 2}; in test() local
43 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
45 r = std::reverse_copy(InIter(ic), InIter(ic+sc), OutIter(jc)); in test()
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.first.of/
Dfind_first_of.pass.cpp33 int ic[] = {7}; in main() local
36 forward_iterator<const int*>(ic), in main()
37 forward_iterator<const int*>(ic + 1)) == in main()
41 forward_iterator<const int*>(ic), in main()
42 forward_iterator<const int*>(ic)) == in main()
46 forward_iterator<const int*>(ic), in main()
47 forward_iterator<const int*>(ic+1)) == in main()
Dfind_first_of_pred.pass.cpp36 int ic[] = {7}; in main() local
39 forward_iterator<const int*>(ic), in main()
40 forward_iterator<const int*>(ic + 1), in main()
45 forward_iterator<const int*>(ic), in main()
46 forward_iterator<const int*>(ic), in main()
51 forward_iterator<const int*>(ic), in main()
52 forward_iterator<const int*>(ic+1), in main()
/external/libcxx/test/std/algorithms/alg.modifying.operations/alg.unique/
Dunique.pass.cpp43 int ic[] = {0, 0}; in test() local
44 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
45 r = std::unique(Iter(ic), Iter(ic+sc)); in test()
46 assert(base(r) == ic + 1); in test()
47 assert(ic[0] == 0); in test()
116 Ptr ic[2]; in test1() local
117 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test1()
118 r = std::unique(Iter(ic), Iter(ic+sc)); in test1()
119 assert(base(r) == ic + 1); in test1()
120 assert(ic[0] == 0); in test1()
Dunique_pred.pass.cpp57 int ic[] = {0, 0}; in test() local
58 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test()
60 r = std::unique(Iter(ic), Iter(ic+sc), count_equal()); in test()
61 assert(base(r) == ic + 1); in test()
62 assert(ic[0] == 0); in test()
146 Ptr ic[2]; in test1() local
147 const unsigned sc = sizeof(ic)/sizeof(ic[0]); in test1()
149 r = std::unique(Iter(ic), Iter(ic+sc), count_equal()); in test1()
150 assert(base(r) == ic + 1); in test1()
151 assert(ic[0] == 0); in test1()
/external/toybox/toys/pending/
Diconv.c30 void *ic;
52 if (iconv(TT.ic, &in, &inleft, &out, &outleft) == -1
70 TT.ic = iconv_open(TT.to ? TT.to : "utf8", TT.from ? TT.from : "utf8"); in iconv_main()
71 if (TT.ic == (iconv_t)-1) error_exit("bad encoding"); in iconv_main()
73 if (CFG_TOYBOX_FREE) iconv_close(TT.ic); in iconv_main()
/external/clang/test/SemaTemplate/
Dtemp_func_order.cpp61 void test_f4(int i, const int ic) { in test_f4() argument
63 float &fr1 = f4(ic); in test_f4()
72 void test_f5(int i, const int ic) { in test_f5() argument
82 void test_f6(int i, const int ic) { in test_f6() argument
84 float &fr = f6(ic, ic); in test_f6()
/external/ltp/tools/pounder21/test_scripts/
Dide_cdrom_copy35 OLD_ERRORS=`egrep -ic "(err|fail|invalid|cannot|denied)" $LOGFILE`
36 OLD_DIFFS=`egrep -ic "^---" $LOGFILE`
82 NEW_ERRORS=`egrep -ic "(err|fail|invalid|cannot|denied)" $LOGFILE`
83 NEW_DIFFS=`egrep -ic "^---" $LOGFILE`
/external/webrtc/webrtc/base/
Dscopedptrcollection_unittest.cc61 InstanceCounter* ic = new InstanceCounter(&num_instances_); in TEST_F() local
62 collection_->PushBack(ic); in TEST_F()
64 collection_->Remove(ic); in TEST_F()
68 delete ic; in TEST_F()
/external/fio/
Diolog.c818 static void free_chunk(struct iolog_compress *ic) in free_chunk() argument
820 free(ic->buf); in free_chunk()
821 free(ic); in free_chunk()
876 static size_t inflate_chunk(struct iolog_compress *ic, int gz_hdr, FILE *f, in inflate_chunk() argument
882 (unsigned long) ic->len, ic->seq); in inflate_chunk()
884 if (ic->seq != iter->seq) { in inflate_chunk()
889 iter->seq = ic->seq; in inflate_chunk()
892 stream->avail_in = ic->len; in inflate_chunk()
893 stream->next_in = ic->buf; in inflate_chunk()
926 ret = (void *) stream->next_in - ic->buf; in inflate_chunk()
[all …]
/external/jacoco/org.jacoco.core/src/org/jacoco/core/internal/analysis/
DLineImpl.java53 final int ic = instructions.getCoveredCount(); in getInstance() local
56 if (im <= SINGLETON_INS_LIMIT && ic <= SINGLETON_INS_LIMIT in getInstance()
58 return SINGLETONS[im][ic][bm][bc]; in getInstance()
84 public Fix(final int im, final int ic, final int bm, final int bc) { in Fix() argument
85 super(CounterImpl.getInstance(im, ic), CounterImpl.getInstance(bm, in Fix()
/external/testng/src/main/java/org/testng/internal/
DTestNGClassFinder.java127 IClass ic= findOrCreateIClass(m_testContext, cls, cim.getXmlClass(cls), thisInstance, in TestNGClassFinder() local
129 if(null != ic) { in TestNGClassFinder()
130 Object[] theseInstances = ic.getInstances(false); in TestNGClassFinder()
132 theseInstances = ic.getInstances(true); in TestNGClassFinder()
135 putIClass(cls, ic); in TestNGClassFinder()
211 IClass ic= getIClass(clazz); in TestNGClassFinder() local
212 if(null != ic) { in TestNGClassFinder()
213 ic.addInstance(instance); in TestNGClassFinder()
/external/v8/
DAndroid.v8.mk64 src/builtins/builtins-ic.cc \
287 src/ic/access-compiler.cc \
288 src/ic/accessor-assembler.cc \
289 src/ic/call-optimization.cc \
290 src/ic/handler-compiler.cc \
291 src/ic/ic-state.cc \
292 src/ic/ic-stats.cc \
293 src/ic/ic.cc \
294 src/ic/keyed-store-generic.cc \
295 src/ic/stub-cache.cc \
[all …]
/external/libcxx/test/std/algorithms/alg.sorting/alg.set.operations/includes/
Dincludes.pass.cpp31 int ic[] = {1, 2}; in test() local
32 const unsigned sc = sizeof(ic)/sizeof(ic[0]); ((void)sc); in test()
44 assert(std::includes(Iter1(ia), Iter1(ia+2), Iter2(ic), Iter2(ic+2))); in test()
/external/swiftshader/third_party/LLVM/test/Bindings/Ocaml/
Dbitwriter.ml15 let ic = open_in_bin name in
16 let len = in_channel_length ic in
19 test ((input ic buf 0 len) = len);
21 close_in ic;

12345678910