resolved-dns-server.c revision 91b14d6ff362b938a72db17b095ee9903d07381b
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering/*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering This file is part of systemd.
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering Copyright 2014 Lennart Poettering
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering systemd is free software; you can redistribute it and/or modify it
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering under the terms of the GNU Lesser General Public License as published by
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering the Free Software Foundation; either version 2.1 of the License, or
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering (at your option) any later version.
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering systemd is distributed in the hope that it will be useful, but
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering WITHOUT ANY WARRANTY; without even the implied warranty of
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering Lesser General Public License for more details.
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering You should have received a copy of the GNU Lesser General Public License
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering along with systemd; If not, see <http://www.gnu.org/licenses/>.
178cc7700c23ac088cd7190d7854282075028d91Lennart Poettering assert((type == DNS_SERVER_LINK) == !!l);
b92bea5d2a9481de69bb627a7b442a9f58fca43dZbigniew Jędrzejewski-Szmek LIST_FIND_TAIL(servers, l->dns_servers, tail);
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering LIST_INSERT_AFTER(servers, l->dns_servers, tail, s);
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering LIST_FIND_TAIL(servers, m->dns_servers, tail);
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering LIST_INSERT_AFTER(servers, m->dns_servers, tail, s);
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering } else if (type == DNS_SERVER_FALLBACK) {
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering LIST_FIND_TAIL(servers, m->fallback_dns_servers, tail);
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering LIST_INSERT_AFTER(servers, m->fallback_dns_servers, tail, s);
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering assert_not_reached("Unknown server type");
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering /* A new DNS server that isn't fallback is added and the one
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering * we used so far was a fallback one? Then let's try to pick
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering * the new one */
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering m->current_dns_server->type == DNS_SERVER_FALLBACK)
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poetteringstatic DnsServer* dns_server_free(DnsServer *s) {
ccf23ad5faf228d450d263d7291156a948b61af2Christian Seiler if (s->link && s->link->current_dns_server == s)
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering if (s->manager && s->manager->current_dns_server == s)
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering manager_set_dns_server(s->manager, NULL);
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart PoetteringDnsServer* dns_server_unref(DnsServer *s) {
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poetteringstatic unsigned long dns_server_hash_func(const void *p, const uint8_t hash_key[HASH_KEY_SIZE]) {
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering siphash24((uint8_t*) &u, &s->address, FAMILY_ADDRESS_SIZE(s->family), hash_key);
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poetteringstatic int dns_server_compare_func(const void *a, const void *b) {
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering const DnsServer *x = a, *y = b;
35e2e347d38cc2f8bd7c38a0d8a5129f5fbb0ab9Lennart Poettering return memcmp(&x->address, &y->address, FAMILY_ADDRESS_SIZE(x->family));