| /external/svox/pico/lib/ |
| D | picosa.c | 246 sa_subobj_t * sa; in saInitialize() local
259 sa = (sa_subobj_t *) this->subObj; in saInitialize()
263 sa->procState = SA_STEPSTATE_COLLECT; in saInitialize()
265 sa->inspaceok = TRUE; in saInitialize()
266 sa->needsmoreitems = TRUE; in saInitialize()
268 sa->headxBottom = 0; in saInitialize()
269 sa->headxLen = 0; in saInitialize()
270 sa->cbuf1BufSize = PICOSA_MAXSIZE_CBUF; in saInitialize()
271 sa->cbuf2BufSize = PICOSA_MAXSIZE_CBUF; in saInitialize()
272 sa->cbuf1Len = 0; in saInitialize()
[all …]
|
| /external/libcxx/test/algorithms/alg.nonmodifying/alg.is_permutation/ |
| D | is_permutation.pass.cpp | 31 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
42 forward_iterator<const int*>(ia + sa), in main()
46 forward_iterator<const int*>(ia + sa), in main()
48 forward_iterator<const int*>(ib + sa)) == true); in main()
50 forward_iterator<const int*>(ia + sa), in main()
52 forward_iterator<const int*>(ib + sa - 1)) == false); in main()
58 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
60 forward_iterator<const int*>(ia + sa), in main()
64 forward_iterator<const int*>(ia + sa), in main()
66 forward_iterator<const int*>(ib + sa)) == false); in main()
[all …]
|
| D | is_permutation_pred.pass.cpp | 40 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
46 forward_iterator<const int*>(ia + sa), in main()
51 forward_iterator<const int*>(ia + sa), in main()
53 forward_iterator<const int*>(ib + sa), in main()
56 forward_iterator<const int*>(ia + sa), in main()
58 forward_iterator<const int*>(ib + sa - 1), in main()
65 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in main() local
67 forward_iterator<const int*>(ia + sa), in main()
72 forward_iterator<const int*>(ia + sa), in main()
74 forward_iterator<const int*>(ib + sa), in main()
[all …]
|
| /external/libcxx/test/algorithms/alg.sorting/alg.sort/is.sorted/ |
| D | is_sorted_until.pass.cpp | 28 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
30 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
35 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
36 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
40 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
41 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
45 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
46 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+1)); in test()
50 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
51 assert(std::is_sorted_until(Iter(a), Iter(a+sa)) == Iter(a+sa)); in test()
[all …]
|
| D | is_sorted.pass.cpp | 28 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
30 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
35 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
36 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
40 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
41 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
45 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
46 assert(!std::is_sorted(Iter(a), Iter(a+sa))); in test()
50 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
51 assert(std::is_sorted(Iter(a), Iter(a+sa))); in test()
[all …]
|
| D | is_sorted_until_comp.pass.cpp | 29 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
31 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
36 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
37 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
41 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
42 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+1)); in test()
46 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
47 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
51 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
52 assert(std::is_sorted_until(Iter(a), Iter(a+sa), std::greater<int>()) == Iter(a+sa)); in test()
[all …]
|
| D | is_sorted_comp.pass.cpp | 29 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
31 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
36 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
37 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
41 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
42 assert(!std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
46 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
47 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
51 unsigned sa = sizeof(a) / sizeof(a[0]); in test() local
52 assert(std::is_sorted(Iter(a), Iter(a+sa), std::greater<int>())); in test()
[all …]
|
| /external/icu/icu4c/source/data/curr/ |
| D | rof.txt | 16 "heleri sa Falme za Kiarabu",
20 "heleri sa Angola",
24 "heleri sa Australia",
28 "heleri sa Bahareni",
32 "heleri sa Burundi",
36 "heleri sa Botswana",
40 "heleri sa Kanada",
44 "heleri sa Kongo",
48 "heleri sa Uswisi",
52 "heleri sa China",
[all …]
|
| /external/chromium_org/third_party/icu/source/data/curr/ |
| D | rof.txt | 16 "heleri sa Falme za Kiarabu",
20 "heleri sa Angola",
24 "heleri sa Australia",
28 "heleri sa Bahareni",
32 "heleri sa Burundi",
36 "heleri sa Botswana",
40 "heleri sa Kanada",
44 "heleri sa Kongo",
48 "heleri sa Uswisi",
52 "heleri sa China",
[all …]
|
| /external/strace/tests/ |
| D | sigaction.c | 14 struct sigaction sa, sa0; in main() local
16 sa.sa_handler = SIG_IGN; in main()
17 sigemptyset(&sa.sa_mask); in main()
18 sigaddset(&sa.sa_mask, SIGHUP); in main()
19 sigaddset(&sa.sa_mask, SIGINT); in main()
20 sa.sa_flags = SA_RESTART; in main()
21 assert(!sigaction(SIGUSR2, &sa, &sa0)); in main()
23 sa.sa_handler = handle_signal; in main()
24 sigemptyset(&sa.sa_mask); in main()
25 sigaddset(&sa.sa_mask, SIGQUIT); in main()
[all …]
|
| /external/icu/icu4c/source/data/locales/ |
| D | nnh.txt | 164 "saŋ tsetsɛ̀ɛ lùm",
165 "saŋ kàg ngwóŋ",
166 "saŋ lepyè shúm",
167 "saŋ cÿó",
168 "saŋ tsɛ̀ɛ cÿó",
169 "saŋ njÿoláʼ",
170 "saŋ tyɛ̀b tyɛ̀b mbʉ̀",
171 "saŋ mbʉ̀ŋ",
172 "saŋ ngwɔ̀ʼ mbÿɛ",
173 "saŋ tàŋa tsetsáʼ",
[all …]
|
| D | jgo.txt | 180 "Pɛsaŋ Pɛ́pá",
181 "Pɛsaŋ Pɛ́tát",
182 "Pɛsaŋ Pɛ́nɛ́kwa",
183 "Pɛsaŋ Pataa",
184 "Pɛsaŋ Pɛ́nɛ́ntúkú",
185 "Pɛsaŋ Saambá",
186 "Pɛsaŋ Pɛ́nɛ́fɔm",
187 "Pɛsaŋ Pɛ́nɛ́pfúꞋú",
188 "Pɛsaŋ Nɛgɛ́m",
189 "Pɛsaŋ Ntsɔ̌pmɔ́",
[all …]
|
| /external/chromium_org/third_party/icu/source/data/locales/ |
| D | nnh.txt | 164 "saŋ tsetsɛ̀ɛ lùm",
165 "saŋ kàg ngwóŋ",
166 "saŋ lepyè shúm",
167 "saŋ cÿó",
168 "saŋ tsɛ̀ɛ cÿó",
169 "saŋ njÿoláʼ",
170 "saŋ tyɛ̀b tyɛ̀b mbʉ̀",
171 "saŋ mbʉ̀ŋ",
172 "saŋ ngwɔ̀ʼ mbÿɛ",
173 "saŋ tàŋa tsetsáʼ",
[all …]
|
| D | jgo.txt | 180 "Pɛsaŋ Pɛ́pá",
181 "Pɛsaŋ Pɛ́tát",
182 "Pɛsaŋ Pɛ́nɛ́kwa",
183 "Pɛsaŋ Pataa",
184 "Pɛsaŋ Pɛ́nɛ́ntúkú",
185 "Pɛsaŋ Saambá",
186 "Pɛsaŋ Pɛ́nɛ́fɔm",
187 "Pɛsaŋ Pɛ́nɛ́pfúꞋú",
188 "Pɛsaŋ Nɛgɛ́m",
189 "Pɛsaŋ Ntsɔ̌pmɔ́",
[all …]
|
| /external/pixman/pixman/ |
| D | pixman-combine-float.c | 45 typedef float (* combine_channel_t) (float sa, float s, float da, float d);
58 float sa = src[i + 0]; in combine_inner() local
68 dest[i + 0] = combine_a (sa, sa, da, da); in combine_inner()
69 dest[i + 1] = combine_c (sa, sr, da, dr); in combine_inner()
70 dest[i + 2] = combine_c (sa, sg, da, dg); in combine_inner()
71 dest[i + 3] = combine_c (sa, sb, da, db); in combine_inner()
78 float sa, sr, sg, sb; in combine_inner() local
82 sa = src[i + 0]; in combine_inner()
98 ma *= sa; in combine_inner()
99 mr *= sa; in combine_inner()
[all …]
|
| /external/chromium_org/third_party/icu/source/common/ |
| D | uchar.c | 649 const USetAdder *sa=(const USetAdder *)context; in _enumPropertyStartsRange() local
650 sa->add(sa->set, start); in _enumPropertyStartsRange()
654 #define USET_ADD_CP_AND_NEXT(sa, cp) sa->add(sa->set, cp); sa->add(sa->set, cp+1) argument
657 uchar_addPropertyStarts(const USetAdder *sa, UErrorCode *pErrorCode) { in uchar_addPropertyStarts() argument
663 utrie2_enum(&propsTrie, NULL, _enumPropertyStartsRange, sa); in uchar_addPropertyStarts()
668 USET_ADD_CP_AND_NEXT(sa, TAB); in uchar_addPropertyStarts()
671 sa->add(sa->set, CR+1); /* range TAB..CR */ in uchar_addPropertyStarts()
672 sa->add(sa->set, 0x1c); in uchar_addPropertyStarts()
673 sa->add(sa->set, 0x1f+1); in uchar_addPropertyStarts()
674 USET_ADD_CP_AND_NEXT(sa, NL); in uchar_addPropertyStarts()
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | uchar.c | 649 const USetAdder *sa=(const USetAdder *)context; in _enumPropertyStartsRange() local
650 sa->add(sa->set, start); in _enumPropertyStartsRange()
654 #define USET_ADD_CP_AND_NEXT(sa, cp) sa->add(sa->set, cp); sa->add(sa->set, cp+1) argument
657 uchar_addPropertyStarts(const USetAdder *sa, UErrorCode *pErrorCode) { in uchar_addPropertyStarts() argument
663 utrie2_enum(&propsTrie, NULL, _enumPropertyStartsRange, sa); in uchar_addPropertyStarts()
668 USET_ADD_CP_AND_NEXT(sa, TAB); in uchar_addPropertyStarts()
671 sa->add(sa->set, CR+1); /* range TAB..CR */ in uchar_addPropertyStarts()
672 sa->add(sa->set, 0x1c); in uchar_addPropertyStarts()
673 sa->add(sa->set, 0x1f+1); in uchar_addPropertyStarts()
674 USET_ADD_CP_AND_NEXT(sa, NL); in uchar_addPropertyStarts()
[all …]
|
| /external/tcpdump/ |
| D | print-esp.c | 102 struct sa_list *sa; in esp_print_decrypt_buffer_by_ikev2() local
111 for (sa = ndo->ndo_sa_list_head; sa != NULL; sa = sa->next) { in esp_print_decrypt_buffer_by_ikev2()
112 if (sa->spi == 0 in esp_print_decrypt_buffer_by_ikev2()
113 && initiator == sa->initiator in esp_print_decrypt_buffer_by_ikev2()
114 && memcmp(spii, sa->spii, 8) == 0 in esp_print_decrypt_buffer_by_ikev2()
115 && memcmp(spir, sa->spir, 8) == 0) in esp_print_decrypt_buffer_by_ikev2()
119 if(sa == NULL) return 0; in esp_print_decrypt_buffer_by_ikev2()
120 if(sa->evp == NULL) return 0; in esp_print_decrypt_buffer_by_ikev2()
126 end = end - sa->authlen; in esp_print_decrypt_buffer_by_ikev2()
128 buf = buf + sa->ivlen; in esp_print_decrypt_buffer_by_ikev2()
[all …]
|
| /external/libcxx/test/algorithms/alg.nonmodifying/alg.search/ |
| D | search_pred.pass.cpp | 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
39 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), count_equal()) == Iter1(ia)); in test()
42 … assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), count_equal()) == Iter1(ia)); in test()
43 assert(count_equal::count <= sa); in test()
45 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), count_equal()) == Iter1(ia+1… in test()
46 assert(count_equal::count <= sa); in test()
48 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), count_equal()) == Iter1(ia)); in test()
51 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2… in test()
52 assert(count_equal::count <= sa); in test()
54 …assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), count_equal()) == Iter1(ia+2… in test()
[all …]
|
| D | search_n_pred.pass.cpp | 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
39 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia)); in test()
40 assert(count_equal::count <= sa); in test()
42 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0)); in test()
43 assert(count_equal::count <= sa); in test()
45 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa)); in test()
46 assert(count_equal::count <= sa); in test()
48 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa)); in test()
49 assert(count_equal::count <= sa); in test()
51 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia)); in test()
[all …]
|
| D | search.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
28 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia)) == Iter1(ia)); in test()
29 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1)) == Iter1(ia)); in test()
30 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2)) == Iter1(ia+1)); in test()
31 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2)) == Iter1(ia)); in test()
32 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); in test()
33 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3)) == Iter1(ia+2)); in test()
35 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa)) == Iter1(ia+sa-1)); in test()
36 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa)) == Iter1(ia+sa-3)); in test()
37 assert(std::search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa)) == Iter1(ia)); in test()
[all …]
|
| D | search_n.pass.cpp | 27 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
28 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0) == Iter(ia)); in test()
29 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0) == Iter(ia+0)); in test()
30 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0) == Iter(ia+sa)); in test()
31 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0) == Iter(ia+sa)); in test()
32 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3) == Iter(ia)); in test()
33 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 3) == Iter(ia+3)); in test()
34 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 3) == Iter(ia+sa)); in test()
35 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 3) == Iter(ia+sa)); in test()
36 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 5) == Iter(ia)); in test()
[all …]
|
| /external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/ |
| D | partition.pass.cpp | 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
38 Iter r = std::partition(Iter(ia), Iter(ia + sa), is_odd()); in test()
42 for (int* i = base(r); i < ia+sa; ++i) in test()
48 for (unsigned i = 0; i < sa; ++i) in test()
50 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
53 for (unsigned i = 0; i < sa; ++i) in test()
55 r = std::partition(Iter(ia), Iter(ia+sa), is_odd()); in test()
56 assert(base(r) == ia+sa); in test()
58 for (unsigned i = 0; i < sa; ++i) in test()
60 ia[sa-1] = 10; in test()
[all …]
|
| /external/llvm/test/CodeGen/X86/ |
| D | 2009-04-27-CoalescerAssert.ll | 24 %Opq.sa.calc = add i32 0, 2 ; <i32> [#uses=2]
33 %Opq.sa.calc747 = add i32 %Opq.sa.calc921, 70 ; <i32> [#uses=0]
41 %Opq.sa.calc863 = add i32 %Opq.sa.calc921, -50 ; <i32> [#uses=4]
49 %Opq.sa.calc460 = add i32 %Opq.sa.calc863, 50 ; <i32> [#uses=0]
55 %Opq.sa.calc976 = add i32 %Opq.sa.calc863, 13 ; <i32> [#uses=3]
63 %Opq.sa.calc462 = sub i32 %Opq.sa.calc976, -152 ; <i32> [#uses=5]
64 %Opq.sa.calc461 = sub i32 %Opq.sa.calc462, 168 ; <i32> [#uses=2]
69 %Opq.sa.calc467 = xor i32 %Opq.sa.calc462, 171 ; <i32> [#uses=2]
70 %Opq.sa.calc465 = sub i32 %Opq.sa.calc467, %Opq.sa.calc462 ; <i32> [#uses=1]
71 %Opq.sa.calc466 = xor i32 %Opq.sa.calc465, -164 ; <i32> [#uses=1]
[all …]
|
| /external/libcxx/test/algorithms/alg.nonmodifying/alg.find.end/ |
| D | find_end_pred.pass.cpp | 38 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
41 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(b), Iter2(b+1), count_equal()) == Iter1(ia+sa-… in test()
42 assert(count_equal::count <= 1*(sa-1+1)); in test()
45 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(c), Iter2(c+2), count_equal()) == Iter1(ia+18)… in test()
46 assert(count_equal::count <= 2*(sa-2+1)); in test()
49 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(d), Iter2(d+3), count_equal()) == Iter1(ia+15)… in test()
50 assert(count_equal::count <= 3*(sa-3+1)); in test()
53 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(e), Iter2(e+4), count_equal()) == Iter1(ia+11)… in test()
54 assert(count_equal::count <= 4*(sa-4+1)); in test()
57 …assert(std::find_end(Iter1(ia), Iter1(ia+sa), Iter2(f), Iter2(f+5), count_equal()) == Iter1(ia+6)); in test()
[all …]
|