ifupdown-ng/libifupdown/state.c

176 lines
3.8 KiB
C
Raw Normal View History

2020-07-20 13:42:16 +00:00
/*
2020-07-20 14:19:23 +00:00
* libifupdown/state.c
2020-07-20 13:42:16 +00:00
* Purpose: state management
*
* Copyright (c) 2020 Ariadne Conill <ariadne@dereferenced.org>
*
* Permission to use, copy, modify, and/or distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* This software is provided 'as is' and without any warranty, express or
* implied. In no event shall the authors be liable for any damages arising
* from the use of this software.
*/
#include <string.h>
#include "libifupdown/state.h"
2020-07-20 14:19:23 +00:00
#include "libifupdown/fgetline.h"
#include "libifupdown/tokenize.h"
2020-07-20 14:19:23 +00:00
bool
lif_state_read(struct lif_dict *state, FILE *fd)
{
char linebuf[4096];
2020-07-20 14:19:23 +00:00
while (lif_fgetline(linebuf, sizeof linebuf, fd))
{
char *bufp = linebuf;
char *ifname = lif_next_token(&bufp);
char *refcount = lif_next_token(&bufp);
size_t rc = 1;
2020-07-20 14:19:23 +00:00
char *equals_p = strchr(linebuf, '=');
if (*refcount)
rc = strtoul(refcount, NULL, 10);
2020-07-20 14:19:23 +00:00
if (equals_p == NULL)
{
lif_state_upsert(state, ifname, &(struct lif_interface){ .ifname = ifname, .refcount = rc });
2020-07-20 14:19:23 +00:00
continue;
}
*equals_p++ = '\0';
lif_state_upsert(state, ifname, &(struct lif_interface){ .ifname = equals_p, .refcount = rc });
2020-07-20 14:19:23 +00:00
}
return true;
}
bool
lif_state_read_path(struct lif_dict *state, const char *path)
{
FILE *fd = fopen(path, "r");
bool ret;
/* if file cannot be opened, assume an empty state */
2020-07-20 14:19:23 +00:00
if (fd == NULL)
return true;
2020-07-20 14:19:23 +00:00
ret = lif_state_read(state, fd);
fclose(fd);
return ret;
}
2020-07-20 13:42:16 +00:00
void
lif_state_ref_if(struct lif_dict *state, const char *ifname, struct lif_interface *iface)
{
iface->refcount++;
lif_state_upsert(state, ifname, iface);
}
void
lif_state_unref_if(struct lif_dict *state, const char *ifname, struct lif_interface *iface)
{
if (iface->refcount == 0)
return;
iface->refcount--;
if (iface->refcount)
lif_state_upsert(state, ifname, iface);
else
lif_state_delete(state, ifname);
}
2020-07-20 13:42:16 +00:00
void
lif_state_upsert(struct lif_dict *state, const char *ifname, struct lif_interface *iface)
{
2020-09-08 21:02:39 +00:00
lif_state_delete(state, ifname);
struct lif_state_record *rec = calloc(1, sizeof(*rec));
rec->mapped_if = strdup(iface->ifname);
rec->refcount = iface->refcount;
lif_dict_add(state, ifname, rec);
2020-07-20 13:42:16 +00:00
}
void
lif_state_delete(struct lif_dict *state, const char *ifname)
{
struct lif_dict_entry *entry = lif_dict_find(state, ifname);
if (entry == NULL)
return;
struct lif_state_record *rec = entry->data;
free(rec->mapped_if);
free(rec);
2020-07-20 13:42:16 +00:00
lif_dict_delete_entry(state, entry);
}
void
lif_state_write(const struct lif_dict *state, FILE *f)
{
struct lif_node *iter;
LIF_DICT_FOREACH(iter, state)
{
struct lif_dict_entry *entry = iter->data;
struct lif_state_record *rec = entry->data;
2020-07-20 13:42:16 +00:00
fprintf(f, "%s=%s %zu\n", entry->key, rec->mapped_if, rec->refcount);
2020-07-20 13:42:16 +00:00
}
}
2020-07-20 13:45:39 +00:00
2020-07-20 14:19:23 +00:00
bool
lif_state_write_path(const struct lif_dict *state, const char *path)
{
FILE *fd = fopen(path, "w");
if (fd == NULL)
return false;
lif_state_write(state, fd);
fclose(fd);
return true;
}
2020-07-20 13:45:39 +00:00
struct lif_interface *
lif_state_lookup(struct lif_dict *state, struct lif_dict *if_collection, const char *ifname)
{
struct lif_dict_entry *entry = lif_dict_find(state, ifname);
if (entry == NULL)
return NULL;
struct lif_state_record *rec = entry->data;
struct lif_dict_entry *if_entry = lif_dict_find(if_collection, rec->mapped_if);
2020-07-20 13:45:39 +00:00
if (if_entry == NULL)
return NULL;
return if_entry->data;
}
bool
lif_state_sync(struct lif_dict *state, struct lif_dict *if_collection)
{
struct lif_node *iter;
LIF_DICT_FOREACH(iter, state)
{
struct lif_dict_entry *entry = iter->data;
struct lif_state_record *rec = entry->data;
struct lif_interface *iface = lif_interface_collection_find(if_collection, entry->key);
iface->refcount = rec->refcount;
}
return true;
}