177079be7Ssthen /*
277079be7Ssthen * services/view.c - named views containing local zones authority service.
377079be7Ssthen *
477079be7Ssthen * Copyright (c) 2016, NLnet Labs. All rights reserved.
577079be7Ssthen *
677079be7Ssthen * This software is open source.
777079be7Ssthen *
877079be7Ssthen * Redistribution and use in source and binary forms, with or without
977079be7Ssthen * modification, are permitted provided that the following conditions
1077079be7Ssthen * are met:
1177079be7Ssthen *
1277079be7Ssthen * Redistributions of source code must retain the above copyright notice,
1377079be7Ssthen * this list of conditions and the following disclaimer.
1477079be7Ssthen *
1577079be7Ssthen * Redistributions in binary form must reproduce the above copyright notice,
1677079be7Ssthen * this list of conditions and the following disclaimer in the documentation
1777079be7Ssthen * and/or other materials provided with the distribution.
1877079be7Ssthen *
1977079be7Ssthen * Neither the name of the NLNET LABS nor the names of its contributors may
2077079be7Ssthen * be used to endorse or promote products derived from this software without
2177079be7Ssthen * specific prior written permission.
2277079be7Ssthen *
2377079be7Ssthen * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
2477079be7Ssthen * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
2577079be7Ssthen * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
2677079be7Ssthen * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
2777079be7Ssthen * HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
2877079be7Ssthen * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED
2977079be7Ssthen * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
3077079be7Ssthen * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
3177079be7Ssthen * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
3277079be7Ssthen * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
3377079be7Ssthen * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
3477079be7Ssthen */
3577079be7Ssthen
3677079be7Ssthen /**
3777079be7Ssthen * \file
3877079be7Ssthen *
3977079be7Ssthen * This file contains functions to enable named views that can hold local zone
4077079be7Ssthen * authority service.
4177079be7Ssthen */
4277079be7Ssthen #include "config.h"
4377079be7Ssthen #include "services/view.h"
4477079be7Ssthen #include "services/localzone.h"
4577079be7Ssthen #include "util/config_file.h"
4677079be7Ssthen
4777079be7Ssthen int
view_cmp(const void * v1,const void * v2)4877079be7Ssthen view_cmp(const void* v1, const void* v2)
4977079be7Ssthen {
5077079be7Ssthen struct view* a = (struct view*)v1;
5177079be7Ssthen struct view* b = (struct view*)v2;
5277079be7Ssthen
5377079be7Ssthen return strcmp(a->name, b->name);
5477079be7Ssthen }
5577079be7Ssthen
5677079be7Ssthen struct views*
views_create(void)5777079be7Ssthen views_create(void)
5877079be7Ssthen {
5977079be7Ssthen struct views* v = (struct views*)calloc(1,
6077079be7Ssthen sizeof(*v));
6177079be7Ssthen if(!v)
6277079be7Ssthen return NULL;
6377079be7Ssthen rbtree_init(&v->vtree, &view_cmp);
6477079be7Ssthen lock_rw_init(&v->lock);
6577079be7Ssthen lock_protect(&v->lock, &v->vtree, sizeof(v->vtree));
6677079be7Ssthen return v;
6777079be7Ssthen }
6877079be7Ssthen
69*45872187Ssthen /* \noop (ignore this comment for doxygen)
70*45872187Ssthen * This prototype is defined in in respip.h, but we want to avoid
712be9e038Ssthen * unnecessary dependencies */
722be9e038Ssthen void respip_set_delete(struct respip_set *set);
732be9e038Ssthen
7477079be7Ssthen void
view_delete(struct view * v)7577079be7Ssthen view_delete(struct view* v)
7677079be7Ssthen {
7777079be7Ssthen if(!v)
7877079be7Ssthen return;
7977079be7Ssthen lock_rw_destroy(&v->lock);
8077079be7Ssthen local_zones_delete(v->local_zones);
812be9e038Ssthen respip_set_delete(v->respip_set);
8277079be7Ssthen free(v->name);
8377079be7Ssthen free(v);
8477079be7Ssthen }
8577079be7Ssthen
8677079be7Ssthen static void
delviewnode(rbnode_type * n,void * ATTR_UNUSED (arg))8777079be7Ssthen delviewnode(rbnode_type* n, void* ATTR_UNUSED(arg))
8877079be7Ssthen {
8977079be7Ssthen struct view* v = (struct view*)n;
9077079be7Ssthen view_delete(v);
9177079be7Ssthen }
9277079be7Ssthen
9377079be7Ssthen void
views_delete(struct views * v)9477079be7Ssthen views_delete(struct views* v)
9577079be7Ssthen {
9677079be7Ssthen if(!v)
9777079be7Ssthen return;
9877079be7Ssthen lock_rw_destroy(&v->lock);
9977079be7Ssthen traverse_postorder(&v->vtree, delviewnode, NULL);
10077079be7Ssthen free(v);
10177079be7Ssthen }
10277079be7Ssthen
10377079be7Ssthen /** create a new view */
10477079be7Ssthen static struct view*
view_create(char * name)10577079be7Ssthen view_create(char* name)
10677079be7Ssthen {
10777079be7Ssthen struct view* v = (struct view*)calloc(1, sizeof(*v));
10877079be7Ssthen if(!v)
10977079be7Ssthen return NULL;
11077079be7Ssthen v->node.key = v;
11177079be7Ssthen if(!(v->name = strdup(name))) {
11277079be7Ssthen free(v);
11377079be7Ssthen return NULL;
11477079be7Ssthen }
11577079be7Ssthen lock_rw_init(&v->lock);
11677079be7Ssthen lock_protect(&v->lock, &v->name, sizeof(*v)-sizeof(rbnode_type));
11777079be7Ssthen return v;
11877079be7Ssthen }
11977079be7Ssthen
12077079be7Ssthen /** enter a new view returns with WRlock */
12177079be7Ssthen static struct view*
views_enter_view_name(struct views * vs,char * name)12277079be7Ssthen views_enter_view_name(struct views* vs, char* name)
12377079be7Ssthen {
12477079be7Ssthen struct view* v = view_create(name);
12577079be7Ssthen if(!v) {
12677079be7Ssthen log_err("out of memory");
12777079be7Ssthen return NULL;
12877079be7Ssthen }
12977079be7Ssthen
13077079be7Ssthen /* add to rbtree */
13177079be7Ssthen lock_rw_wrlock(&vs->lock);
13277079be7Ssthen lock_rw_wrlock(&v->lock);
13377079be7Ssthen if(!rbtree_insert(&vs->vtree, &v->node)) {
13477079be7Ssthen log_warn("duplicate view: %s", name);
13577079be7Ssthen lock_rw_unlock(&v->lock);
13677079be7Ssthen view_delete(v);
13777079be7Ssthen lock_rw_unlock(&vs->lock);
13877079be7Ssthen return NULL;
13977079be7Ssthen }
14077079be7Ssthen lock_rw_unlock(&vs->lock);
14177079be7Ssthen return v;
14277079be7Ssthen }
14377079be7Ssthen
14477079be7Ssthen int
views_apply_cfg(struct views * vs,struct config_file * cfg)14577079be7Ssthen views_apply_cfg(struct views* vs, struct config_file* cfg)
14677079be7Ssthen {
14777079be7Ssthen struct config_view* cv;
14877079be7Ssthen struct view* v;
14977079be7Ssthen struct config_file lz_cfg;
15077079be7Ssthen /* Check existence of name in first view (last in config). Rest of
15177079be7Ssthen * views are already checked when parsing config. */
15277079be7Ssthen if(cfg->views && !cfg->views->name) {
15377079be7Ssthen log_err("view without a name");
15477079be7Ssthen return 0;
15577079be7Ssthen }
15677079be7Ssthen for(cv = cfg->views; cv; cv = cv->next) {
15777079be7Ssthen /* create and enter view */
15877079be7Ssthen if(!(v = views_enter_view_name(vs, cv->name)))
15977079be7Ssthen return 0;
16077079be7Ssthen v->isfirst = cv->isfirst;
16177079be7Ssthen if(cv->local_zones || cv->local_data) {
16277079be7Ssthen if(!(v->local_zones = local_zones_create())){
16377079be7Ssthen lock_rw_unlock(&v->lock);
16477079be7Ssthen return 0;
16577079be7Ssthen }
16677079be7Ssthen memset(&lz_cfg, 0, sizeof(lz_cfg));
16777079be7Ssthen lz_cfg.local_zones = cv->local_zones;
16877079be7Ssthen lz_cfg.local_data = cv->local_data;
16977079be7Ssthen lz_cfg.local_zones_nodefault =
17077079be7Ssthen cv->local_zones_nodefault;
1712be9e038Ssthen if(v->isfirst) {
1722be9e038Ssthen /* Do not add defaults to view-specific
1732be9e038Ssthen * local-zone when global local zone will be
1742be9e038Ssthen * used. */
1752be9e038Ssthen struct config_strlist* nd;
1762be9e038Ssthen lz_cfg.local_zones_disable_default = 1;
1772be9e038Ssthen /* Add nodefault zones to list of zones to add,
1782be9e038Ssthen * so they will be used as if they are
1792be9e038Ssthen * configured as type transparent */
1802be9e038Ssthen for(nd = cv->local_zones_nodefault; nd;
1812be9e038Ssthen nd = nd->next) {
1822be9e038Ssthen char* nd_str, *nd_type;
1832be9e038Ssthen nd_str = strdup(nd->str);
1842be9e038Ssthen if(!nd_str) {
1852be9e038Ssthen log_err("out of memory");
1862be9e038Ssthen lock_rw_unlock(&v->lock);
1872be9e038Ssthen return 0;
1882be9e038Ssthen }
1892be9e038Ssthen nd_type = strdup("nodefault");
1902be9e038Ssthen if(!nd_type) {
1912be9e038Ssthen log_err("out of memory");
1922be9e038Ssthen free(nd_str);
1932be9e038Ssthen lock_rw_unlock(&v->lock);
1942be9e038Ssthen return 0;
1952be9e038Ssthen }
1962be9e038Ssthen if(!cfg_str2list_insert(
1972be9e038Ssthen &lz_cfg.local_zones, nd_str,
1982be9e038Ssthen nd_type)) {
1992be9e038Ssthen log_err("failed to insert "
2002be9e038Ssthen "default zones into "
2012be9e038Ssthen "local-zone list");
2022be9e038Ssthen lock_rw_unlock(&v->lock);
2032be9e038Ssthen return 0;
2042be9e038Ssthen }
2052be9e038Ssthen }
2062be9e038Ssthen }
20777079be7Ssthen if(!local_zones_apply_cfg(v->local_zones, &lz_cfg)){
20877079be7Ssthen lock_rw_unlock(&v->lock);
20977079be7Ssthen return 0;
21077079be7Ssthen }
21177079be7Ssthen /* local_zones, local_zones_nodefault and local_data
21277079be7Ssthen * are free'd from config_view by local_zones_apply_cfg.
21377079be7Ssthen * Set pointers to NULL. */
21477079be7Ssthen cv->local_zones = NULL;
21577079be7Ssthen cv->local_data = NULL;
21677079be7Ssthen cv->local_zones_nodefault = NULL;
21777079be7Ssthen }
21877079be7Ssthen lock_rw_unlock(&v->lock);
21977079be7Ssthen }
22077079be7Ssthen return 1;
22177079be7Ssthen }
22277079be7Ssthen
22377079be7Ssthen /** find a view by name */
22477079be7Ssthen struct view*
views_find_view(struct views * vs,const char * name,int write)22577079be7Ssthen views_find_view(struct views* vs, const char* name, int write)
22677079be7Ssthen {
22777079be7Ssthen struct view* v;
22877079be7Ssthen struct view key;
22977079be7Ssthen key.node.key = &v;
23077079be7Ssthen key.name = (char *)name;
23177079be7Ssthen lock_rw_rdlock(&vs->lock);
23277079be7Ssthen if(!(v = (struct view*)rbtree_search(&vs->vtree, &key.node))) {
23377079be7Ssthen lock_rw_unlock(&vs->lock);
23477079be7Ssthen return 0;
23577079be7Ssthen }
23677079be7Ssthen if(write) {
23777079be7Ssthen lock_rw_wrlock(&v->lock);
23877079be7Ssthen } else {
23977079be7Ssthen lock_rw_rdlock(&v->lock);
24077079be7Ssthen }
24177079be7Ssthen lock_rw_unlock(&vs->lock);
24277079be7Ssthen return v;
24377079be7Ssthen }
24477079be7Ssthen
views_print(struct views * v)24577079be7Ssthen void views_print(struct views* v)
24677079be7Ssthen {
24777079be7Ssthen /* TODO implement print */
24877079be7Ssthen (void)v;
24977079be7Ssthen }
250