unbound/daemon/acl_list.c

81 	struct acl_addr* node = regional_alloc_zero(acl->region,
83 	if(!node)
85 	node->control = control;
86 	if(!addr_tree_insert(&acl->tree, &node->node, addr, addrlen, net)) {
90 	return node;
132 /** find or create node (NULL on parse or error) */
136 	struct acl_addr* node;
144 	/* find or create node */
145 	if(!(node=(struct acl_addr*)addr_tree_find(&acl->tree, &addr,
147 		/* create node, type 'allow' since otherwise tags are
149 		if(!(node=(struct acl_addr*)acl_list_insert(acl, &addr,
155 	return node;
163 	struct acl_addr* node;
164 	if(!(node=acl_find_or_create(acl, str)))
166 	node->taglen = bitmaplen;
167 	node->taglist = regional_alloc_init(acl->region, bitmap, bitmaplen);
168 	if(!node->taglist) {
180 	struct acl_addr* node;
181 	if(!(node=acl_find_or_create(acl, str)))
183 	node->view = views_find_view(vs, str2, 0 /* get read lock*/);
184 	if(!node->view) {
188 	lock_rw_unlock(&node->view->lock);
197 	struct acl_addr* node;
200 	if(!(node=acl_find_or_create(acl, str)))
203 	if(!node->tag_actions) {
204 		node->tag_actions = (uint8_t*)regional_alloc_zero(acl->region,
205 			sizeof(*node->tag_actions)*cfg->num_tags);
206 		if(!node->tag_actions) {
210 		node->tag_actions_size = (size_t)cfg->num_tags;
217 	if((size_t)tagid >= node->tag_actions_size) {
226 	node->tag_actions[tagid] = (uint8_t)t;
286 	struct acl_addr* node;
289 	if(!(node=acl_find_or_create(acl, str)))
292 	if(!node->tag_datas) {
293 		node->tag_datas = (struct config_strlist**)regional_alloc_zero(
294 			acl->region, sizeof(*node->tag_datas)*cfg->num_tags);
295 		if(!node->tag_datas) {
299 		node->tag_datas_size = (size_t)cfg->num_tags;
306 	if((size_t)tagid >= node->tag_datas_size) {
312 	if(!check_data(data, node->tag_datas[tagid])) {
324 		&(node->tag_datas[tagid]), dupdata)) {