| /*-*- Mode: C; c-basic-offset: 8; indent-tabs-mode: nil -*-*/ |
| |
| /*** |
| This file is part of systemd. |
| |
| Copyright 2014 Lennart Poettering |
| Copyright 2014 Tom Gundersen |
| |
| systemd is free software; you can redistribute it and/or modify it |
| under the terms of the GNU Lesser General Public License as published by |
| the Free Software Foundation; either version 2.1 of the License, or |
| (at your option) any later version. |
| |
| systemd is distributed in the hope that it will be useful, but |
| WITHOUT ANY WARRANTY; without even the implied warranty of |
| MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
| Lesser General Public License for more details. |
| |
| You should have received a copy of the GNU Lesser General Public License |
| along with systemd; If not, see <http://www.gnu.org/licenses/>. |
| ***/ |
| |
| #include <net/if.h> |
| |
| #include "sd-network.h" |
| #include "strv.h" |
| |
| #include "networkd-wait-online-link.h" |
| |
| int link_new(Manager *m, Link **ret, int ifindex, const char *ifname) { |
| _cleanup_(link_freep) Link *l = NULL; |
| int r; |
| |
| assert(m); |
| assert(ifindex > 0); |
| |
| r = hashmap_ensure_allocated(&m->links, NULL); |
| if (r < 0) |
| return r; |
| |
| r = hashmap_ensure_allocated(&m->links_by_name, &string_hash_ops); |
| if (r < 0) |
| return r; |
| |
| l = new0(Link, 1); |
| if (!l) |
| return -ENOMEM; |
| |
| l->manager = m; |
| |
| l->ifname = strdup(ifname); |
| if (!l->ifname) |
| return -ENOMEM; |
| |
| r = hashmap_put(m->links_by_name, l->ifname, l); |
| if (r < 0) |
| return r; |
| |
| l->ifindex = ifindex; |
| |
| r = hashmap_put(m->links, INT_TO_PTR(ifindex), l); |
| if (r < 0) |
| return r; |
| |
| if (ret) |
| *ret = l; |
| l = NULL; |
| |
| return 0; |
| } |
| |
| Link *link_free(Link *l) { |
| |
| if (!l) |
| return NULL; |
| |
| if (l->manager) { |
| hashmap_remove(l->manager->links, INT_TO_PTR(l->ifindex)); |
| hashmap_remove(l->manager->links_by_name, l->ifname); |
| } |
| |
| free(l->ifname); |
| free(l); |
| return NULL; |
| } |
| |
| int link_update_rtnl(Link *l, sd_rtnl_message *m) { |
| const char *ifname; |
| int r; |
| |
| assert(l); |
| assert(l->manager); |
| assert(m); |
| |
| r = sd_rtnl_message_link_get_flags(m, &l->flags); |
| if (r < 0) |
| return r; |
| |
| r = sd_rtnl_message_read_string(m, IFLA_IFNAME, &ifname); |
| if (r < 0) |
| return r; |
| |
| if (!streq(l->ifname, ifname)) { |
| char *new_ifname; |
| |
| new_ifname = strdup(ifname); |
| if (!new_ifname) |
| return -ENOMEM; |
| |
| hashmap_remove(l->manager->links_by_name, l->ifname); |
| free(l->ifname); |
| l->ifname = new_ifname; |
| |
| r = hashmap_put(l->manager->links_by_name, l->ifname, l); |
| if (r < 0) |
| return r; |
| } |
| |
| return 0; |
| } |
| |
| int link_update_monitor(Link *l) { |
| assert(l); |
| |
| free(l->operational_state); |
| l->operational_state = NULL; |
| |
| sd_network_link_get_operational_state(l->ifindex, &l->operational_state); |
| |
| free(l->state); |
| l->state = NULL; |
| |
| sd_network_link_get_setup_state(l->ifindex, &l->state); |
| |
| return 0; |
| } |
| |
| bool link_relevant(Link *l) { |
| assert(l); |
| |
| if (l->flags & IFF_LOOPBACK) |
| return false; |
| |
| return true; |
| } |