| /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/std/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/std/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_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.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_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 | 13 "heleri sa Falme za Kiarabu",
17 "heleri sa Angola",
21 "heleri sa Australia",
25 "heleri sa Bahareni",
29 "heleri sa Burundi",
33 "heleri sa Botswana",
37 "heleri sa Kanada",
41 "heleri sa Kongo",
45 "heleri sa Uswisi",
49 "heleri sa China",
[all …]
|
| /external/icu/icu4c/source/data/zone/ |
| D | fil.txt | 983 ld{"Standard na Oras sa Ireland"}
1017 ld{"Oras sa Tag-init ng Britain"}
1266 ls{"Oras sa Afghanistan"}
1269 ls{"Oras sa Gitnang Africa"}
1272 ls{"Oras sa Silangang Africa"}
1275 ls{"Oras sa Timog Africa"}
1278 ld{"Oras sa Tag-init ng Kanlurang Africa"}
1279 lg{"Oras sa Kanlurang Africa"}
1280 ls{"Standard na Oras sa Kanlurang Africa"}
1283 ld{"Daylight Time sa Alaska"}
[all …]
|
| /external/autotest/client/tests/ipv6connect/src/ |
| D | ipv6connect.c | 39 struct sockaddr_in6 sa; in ConnectAndAccept() local
46 memset(&sa, 0, sizeof(sa)); in ConnectAndAccept()
52 inet_pton(AF_INET6, "::1", &sa.sin6_addr); in ConnectAndAccept()
54 inet_pton(AF_INET6, "::ffff:127.0.0.1", &sa.sin6_addr); in ConnectAndAccept()
56 if (!inet_ntop(AF_INET6, &sa.sin6_addr, buf, INET6_ADDRSTRLEN)) { in ConnectAndAccept()
60 addr_len = sizeof(sa); in ConnectAndAccept()
61 sa.sin6_family = AF_INET6; in ConnectAndAccept()
62 sa.sin6_port = port; in ConnectAndAccept()
63 if (connect(client_fd, (struct sockaddr*)(&sa), in ConnectAndAccept()
87 addr_len = sizeof(sa); in ConnectAndAccept()
[all …]
|
| /external/strace/tests/ |
| D | sigaction.c | 41 struct sigaction sa, sa0; in main() local
43 sa.sa_handler = SIG_IGN; in main()
44 sigemptyset(&sa.sa_mask); in main()
45 sigaddset(&sa.sa_mask, SIGHUP); in main()
46 sigaddset(&sa.sa_mask, SIGINT); in main()
47 sa.sa_flags = SA_RESTART; in main()
48 assert(!sigaction(SIGUSR2, &sa, &sa0)); in main()
50 sa.sa_handler = handle_signal; in main()
51 sigemptyset(&sa.sa_mask); in main()
52 sigaddset(&sa.sa_mask, SIGQUIT); in main()
[all …]
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
| D | default.pred.pass.cpp | 63 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
64 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
65 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
66 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
67 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
68 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
69 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
71 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
72 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
73 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
|
| D | default.pass.cpp | 51 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
52 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test()
53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test()
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test()
55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test()
56 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)); in test()
60 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3)); in test()
61 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia)); in test()
[all …]
|
| /external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
| D | make_default_searcher.pred.pass.cpp | 49 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
50 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia), 0); in test()
51 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia), sa); in test()
52 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1), sa); in test()
53 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia), 0); in test()
54 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
55 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2), sa); in test()
57 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1), sa); in test()
58 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3), 3*sa); in test()
59 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia), sa*sa); in test()
[all …]
|
| D | make_default_searcher.pass.cpp | 37 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
38 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia), Iter1(ia)); in test()
39 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+1), Iter1(ia)); in test()
40 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+1), Iter2(ia+2), Iter1(ia+1)); in test()
41 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+2), Iter1(ia)); in test()
42 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
43 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+2), Iter2(ia+3), Iter1(ia+2)); in test()
45 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-1), Iter2(ia+sa), Iter1(ia+sa-1)); in test()
46 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia+sa-3), Iter2(ia+sa), Iter1(ia+sa-3)); in test()
47 do_search(Iter1(ia), Iter1(ia+sa), Iter2(ia), Iter2(ia+sa), Iter1(ia)); in test()
[all …]
|
| /external/icu/icu4c/source/data/locales/ |
| D | nnh.txt | 162 "saŋ tsetsɛ̀ɛ lùm",
163 "saŋ kàg ngwóŋ",
164 "saŋ lepyè shúm",
165 "saŋ cÿó",
166 "saŋ tsɛ̀ɛ cÿó",
167 "saŋ njÿoláʼ",
168 "saŋ tyɛ̀b tyɛ̀b mbʉ̀ŋ",
169 "saŋ mbʉ̀ŋ",
170 "saŋ ngwɔ̀ʼ mbÿɛ",
171 "saŋ tàŋa tsetsáʼ",
[all …]
|
| D | jgo.txt | 178 "Pɛsaŋ Pɛ́pá",
179 "Pɛsaŋ Pɛ́tát",
180 "Pɛsaŋ Pɛ́nɛ́kwa",
181 "Pɛsaŋ Pataa",
182 "Pɛsaŋ Pɛ́nɛ́ntúkú",
183 "Pɛsaŋ Saambá",
184 "Pɛsaŋ Pɛ́nɛ́fɔm",
185 "Pɛsaŋ Pɛ́nɛ́pfúꞋú",
186 "Pɛsaŋ Nɛgɛ́m",
187 "Pɛsaŋ Ntsɔ̌pmɔ́",
[all …]
|
| /external/tcpdump/ |
| D | print-esp.c | 131 struct sa_list *sa; in esp_print_decrypt_buffer_by_ikev2() local
140 for (sa = ndo->ndo_sa_list_head; sa != NULL; sa = sa->next) { in esp_print_decrypt_buffer_by_ikev2()
141 if (sa->spi == 0 in esp_print_decrypt_buffer_by_ikev2()
142 && initiator == sa->initiator in esp_print_decrypt_buffer_by_ikev2()
143 && memcmp(spii, sa->spii, 8) == 0 in esp_print_decrypt_buffer_by_ikev2()
144 && memcmp(spir, sa->spir, 8) == 0) in esp_print_decrypt_buffer_by_ikev2()
148 if(sa == NULL) return 0; in esp_print_decrypt_buffer_by_ikev2()
149 if(sa->evp == NULL) return 0; in esp_print_decrypt_buffer_by_ikev2()
155 end = end - sa->authlen; in esp_print_decrypt_buffer_by_ikev2()
157 buf = buf + sa->ivlen; in esp_print_decrypt_buffer_by_ikev2()
[all …]
|
| /external/icu/icu4c/source/common/ |
| D | uchar.c | 647 const USetAdder *sa=(const USetAdder *)context; in _enumPropertyStartsRange() local
648 sa->add(sa->set, start); in _enumPropertyStartsRange()
652 #define USET_ADD_CP_AND_NEXT(sa, cp) sa->add(sa->set, cp); sa->add(sa->set, cp+1) argument
655 uchar_addPropertyStarts(const USetAdder *sa, UErrorCode *pErrorCode) { in uchar_addPropertyStarts() argument
661 utrie2_enum(&propsTrie, NULL, _enumPropertyStartsRange, sa); in uchar_addPropertyStarts()
666 USET_ADD_CP_AND_NEXT(sa, TAB); in uchar_addPropertyStarts()
669 sa->add(sa->set, CR+1); /* range TAB..CR */ in uchar_addPropertyStarts()
670 sa->add(sa->set, 0x1c); in uchar_addPropertyStarts()
671 sa->add(sa->set, 0x1f+1); in uchar_addPropertyStarts()
672 USET_ADD_CP_AND_NEXT(sa, NL); in uchar_addPropertyStarts()
[all …]
|
| /external/libcxx/test/std/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 | 39 const unsigned sa = sizeof(ia)/sizeof(ia[0]); in test() local
41 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 0, count_equal()) == Iter(ia)); in test()
42 assert(count_equal::count <= sa); in test()
44 assert(std::search_n(Iter(ia), Iter(ia+sa), 1, 0, count_equal()) == Iter(ia+0)); in test()
45 assert(count_equal::count <= sa); in test()
47 assert(std::search_n(Iter(ia), Iter(ia+sa), 2, 0, count_equal()) == Iter(ia+sa)); in test()
48 assert(count_equal::count <= sa); in test()
50 assert(std::search_n(Iter(ia), Iter(ia+sa), sa, 0, count_equal()) == Iter(ia+sa)); in test()
51 assert(count_equal::count <= sa); in test()
53 assert(std::search_n(Iter(ia), Iter(ia+sa), 0, 3, count_equal()) == Iter(ia)); in test()
[all …]
|
| /external/skia/src/core/ |
| D | SkXfermode.cpp | 93 Sk4f sa = alpha(s); in overlay_4f() local
97 sa * da - two * (da - d) * (sa - s)); in overlay_4f()
98 return pin_1(s + d - s * da + color_alpha(rc - d * sa, 0)); in overlay_4f()
106 Sk4f sa = alpha(s); in darken_4f() local
108 return s + d - Sk4f::Max(s * da, d * sa); in darken_4f()
112 Sk4f sa = alpha(s); in lighten_4f() local
114 return s + d - Sk4f::Min(s * da, d * sa); in lighten_4f()
118 Sk4f sa = alpha(s); in colordodge_4f() local
120 Sk4f isa = Sk4f(1) - sa; in colordodge_4f()
125 Sk4f otherwise = sa * Sk4f::Min(da, (d * sa) / (sa - s)) + s * ida + d * isa; in colordodge_4f()
[all …]
|
| /external/libcxx/test/std/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/avahi/avahi-core/ |
| D | addr-util.c | 33 AvahiAddress *avahi_address_from_sockaddr(const struct sockaddr* sa, AvahiAddress *ret_addr) { in avahi_address_from_sockaddr() argument
34 assert(sa); in avahi_address_from_sockaddr()
37 assert(sa->sa_family == AF_INET || sa->sa_family == AF_INET6); in avahi_address_from_sockaddr()
39 ret_addr->proto = avahi_af_to_proto(sa->sa_family); in avahi_address_from_sockaddr()
41 if (sa->sa_family == AF_INET) in avahi_address_from_sockaddr()
42 …memcpy(&ret_addr->data.ipv4, &((const struct sockaddr_in*) sa)->sin_addr, sizeof(ret_addr->data.ip… in avahi_address_from_sockaddr()
44 …memcpy(&ret_addr->data.ipv6, &((const struct sockaddr_in6*) sa)->sin6_addr, sizeof(ret_addr->data.… in avahi_address_from_sockaddr()
49 uint16_t avahi_port_from_sockaddr(const struct sockaddr* sa) { in avahi_port_from_sockaddr() argument
50 assert(sa); in avahi_port_from_sockaddr()
52 assert(sa->sa_family == AF_INET || sa->sa_family == AF_INET6); in avahi_port_from_sockaddr()
[all …]
|