/* * net/tipc/name_table.c: TIPC name table code * * Copyright (c) 2000-2006, 2014-2018, Ericsson AB * Copyright (c) 2004-2008, 2010-2014, Wind River Systems * Copyright (c) 2020-2021, Red Hat Inc * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions are met: * * 1. Redistributions of source code must retain the above copyright *    notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright *    notice, this list of conditions and the following disclaimer in the *    documentation and/or other materials provided with the distribution. * 3. Neither the names of the copyright holders nor the names of its *    contributors may be used to endorse or promote products derived from *    this software without specific prior written permission. * * Alternatively, this software may be distributed under the terms of the * GNU General Public License ("GPL") version 2 as published by the Free * Software Foundation. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE * POSSIBILITY OF SUCH DAMAGE. */ #include <net/sock.h>#include <linux/list_sort.h>#include <linux/rbtree_augmented.h>#include "core.h"#include "netlink.h"#include "name_table.h"#include "name_distr.h"#include "subscr.h"#include "bcast.h"#include "addr.h"#include "node.h"#include "group.h" /** * struct service_range - container for all bindings of a service range * @lower: service range lower bound * @upper: service range upper bound * @tree_node: member of service range RB tree * @max: largest 'upper' in this node subtree * @local_publ: list of identical publications made from this node *   Used by closest_first lookup and multicast lookup algorithm * @all_publ: all publications identical to this one, whatever node and scope *   Used by round-robin lookup algorithm */struct service_range {	u32 lower;	u32 upper;	struct rb_node tree_node;	u32 max;	struct list_head local_publ;	struct list_head all_publ;}; /** * struct tipc_service - container for all published instances of a service type * @type: 32 bit 'type' value for service * @publ_cnt: increasing counter for publications in this service * @ranges: rb tree containing all service ranges for this service * @service_list: links to adjacent name ranges in hash chain * @subscriptions: list of subscriptions for this service type * @lock: spinlock controlling access to pertaining service ranges/publications * @rcu: RCU callback head used for deferred freeing */struct tipc_service {	u32 type;	u32 publ_cnt;	struct rb_root ranges;	struct hlist_node service_list;	struct list_head subscriptions;	spinlock_t lock; /* Covers service range list */	struct rcu_head rcu;}; #define service_range_upper(sr) ((sr)->upper)RB_DECLARE_CALLBACKS_MAX(static, sr_callbacks,			 struct service_range, tree_node, u32, max,			 service_range_upper) #define service_range_entry(rbtree_node)				\	(container_of(rbtree_node, struct service_range, tree_node)) #define service_range_overlap(sr, start, end)				\	((sr)->lower <= (end) && (sr)->upper >= (start)) /** * service_range_foreach_match - iterate over tipc service rbtree for each *                               range match * @sr: the service range pointer as a loop cursor * @sc: the pointer to tipc service which holds the service range rbtree * @start: beginning of the search range (end >= start) for matching * @end: end of the search range (end >= start) for matching */#define service_range_foreach_match(sr, sc, start, end)			\	for (sr = service_range_match_first((sc)->ranges.rb_node,	\					    start,			\					    end);			\	     sr;							\	     sr = service_range_match_next(&(sr)->tree_node,		\					   start,			\					   end)) /** * service_range_match_first - find first service range matching a range * @n: the root node of service range rbtree for searching * @start: beginning of the search range (end >= start) for matching * @end: end of the search range (end >= start) for matching * * Return: the leftmost service range node in the rbtree that overlaps the * specific range if any. Otherwise, returns NULL. */static struct service_range *service_range_match_first(struct rb_node *n,						       u32 start, u32 end){	struct service_range *sr;	struct rb_node *l, *r; 	/* Non overlaps in tree at all? */	if (!n || service_range_entry(n)->max < start)		return NULL; 	while (n) {		l = n->rb_left;		if (l && service_range_entry(l)->max >= start) {			/* A leftmost overlap range node must be one in the left			 * subtree. If not, it has lower > end, then nodes on			 * the right side cannot satisfy the condition either.			 */			n = l;			continue;		} 		/* No one in the left subtree can match, return if this node is		 * an overlap i.e. leftmost.		 */		sr = service_range_entry(n);		if (service_range_overlap(sr, start, end))			return sr; 		/* Ok, try to lookup on the right side */		r = n->rb_right;		if (sr->lower <= end &&		    r && service_range_entry(r)->max >= start) {			n = r;			continue;		}		break;	} 	return NULL;} /** * service_range_match_next - find next service range matching a range * @n: a node in service range rbtree from which the searching starts * @start: beginning of the search range (end >= start) for matching * @end: end of the search range (end >= start) for matching * * Return: the next service range node to the given node in the rbtree that * overlaps the specific range if any. Otherwise, returns NULL. */static struct service_range *service_range_match_next(struct rb_node *n,						      u32 start, u32 end){	struct service_range *sr;	struct rb_node *p, *r; 	while (n) {		r = n->rb_right;		if (r && service_range_entry(r)->max >= start)			/* A next overlap range node must be one in the right			 * subtree. If not, it has lower > end, then any next			 * successor (- an ancestor) of this node cannot			 * satisfy the condition either.			 */			return service_range_match_first(r, start, end); 		/* No one in the right subtree can match, go up to find an		 * ancestor of this node which is parent of a left-hand child.		 */		while ((p = rb_parent(n)) && n == p->rb_right)			n = p;		if (!p)			break; 		/* Return if this ancestor is an overlap */		sr = service_range_entry(p);		if (service_range_overlap(sr, start, end))			return sr; 		/* Ok, try to lookup more from this ancestor */		if (sr->lower <= end) {			n = p;			continue;		}		break;	} 	return NULL;} static int hash(int x){	return x & (TIPC_NAMETBL_SIZE - 1);} /** * tipc_publ_create - create a publication structure * @ua: the service range the user is binding to * @sk: the address of the socket that is bound * @key: publication key */static struct publication *tipc_publ_create(struct tipc_uaddr *ua,					    struct tipc_socket_addr *sk,					    u32 key){	struct publication *p = kzalloc_obj(*p, GFP_ATOMIC); 	if (!p)		return NULL; 	p->sr = ua->sr;	p->sk = *sk;	p->scope = ua->scope;	p->key = key;	INIT_LIST_HEAD(&p->binding_sock);	INIT_LIST_HEAD(&p->binding_node);	INIT_LIST_HEAD(&p->local_publ);	INIT_LIST_HEAD(&p->all_publ);	INIT_LIST_HEAD(&p->list);	return p;} /** * tipc_service_create - create a service structure for the specified 'type' * @net: network namespace * @ua: address representing the service to be bound * * Allocates a single range structure and sets it to all 0's. */static struct tipc_service *tipc_service_create(struct net *net,						struct tipc_uaddr *ua){	struct name_table *nt = tipc_name_table(net);	struct tipc_service *service;	struct hlist_head *hd; 	service = kzalloc_obj(*service, GFP_ATOMIC);	if (!service) {		pr_warn("Service creation failed, no memory\n");		return NULL;	} 	spin_lock_init(&service->lock);	service->type = ua->sr.type;	service->ranges = RB_ROOT;	INIT_HLIST_NODE(&service->service_list);	INIT_LIST_HEAD(&service->subscriptions);	hd = &nt->services[hash(ua->sr.type)];	hlist_add_head_rcu(&service->service_list, hd);	return service;} /*  tipc_service_find_range - find service range matching publication parameters */static struct service_range *tipc_service_find_range(struct tipc_service *sc,						     struct tipc_uaddr *ua){	struct service_range *sr; 	service_range_foreach_match(sr, sc, ua->sr.lower, ua->sr.upper) {		/* Look for exact match */		if (sr->lower == ua->sr.lower && sr->upper == ua->sr.upper)			return sr;	} 	return NULL;} static struct service_range *tipc_service_create_range(struct tipc_service *sc,						       struct publication *p){	struct rb_node **n, *parent = NULL;	struct service_range *sr;	u32 lower = p->sr.lower;	u32 upper = p->sr.upper; 	n = &sc->ranges.rb_node;	while (*n) {		parent = *n;		sr = service_range_entry(parent);		if (lower == sr->lower && upper == sr->upper)			return sr;		if (sr->max < upper)			sr->max = upper;		if (lower <= sr->lower)			n = &parent->rb_left;		else			n = &parent->rb_right;	}	sr = kzalloc_obj(*sr, GFP_ATOMIC);	if (!sr)		return NULL;	sr->lower = lower;	sr->upper = upper;	sr->max = upper;	INIT_LIST_HEAD(&sr->local_publ);	INIT_LIST_HEAD(&sr->all_publ);	rb_link_node(&sr->tree_node, parent, n);	rb_insert_augmented(&sr->tree_node, &sc->ranges, &sr_callbacks);	return sr;} static bool tipc_service_insert_publ(struct net *net,				     struct tipc_service *sc,				     struct publication *p){	struct tipc_subscription *sub, *tmp;	struct service_range *sr;	struct publication *_p;	u32 node = p->sk.node;	bool first = false;	bool res = false;	u32 key = p->key; 	spin_lock_bh(&sc->lock);	sr = tipc_service_create_range(sc, p);	if (!sr)		goto  exit; 	first = list_empty(&sr->all_publ); 	/* Return if the publication already exists */	list_for_each_entry(_p, &sr->all_publ, all_publ) {		if (_p->key == key && _p->sk.ref == p->sk.ref &&		    (!_p->sk.node || _p->sk.node == node)) {			pr_debug("Failed to bind duplicate %u,%u,%u/%u:%u/%u\n",				 p->sr.type, p->sr.lower, p->sr.upper,				 node, p->sk.ref, key);			goto exit;		}	} 	if (in_own_node(net, p->sk.node))		list_add(&p->local_publ, &sr->local_publ);	list_add(&p->all_publ, &sr->all_publ);	p->id = sc->publ_cnt++; 	/* Any subscriptions waiting for notification?  */	list_for_each_entry_safe(sub, tmp, &sc->subscriptions, service_list) {		tipc_sub_report_overlap(sub, p, TIPC_PUBLISHED, first);	}	res = true;exit:	if (!res)		pr_warn("Failed to bind to %u,%u,%u\n",			p->sr.type, p->sr.lower, p->sr.upper);	spin_unlock_bh(&sc->lock);	return res;} /** * tipc_service_remove_publ - remove a publication from a service * @r: service_range to remove publication from * @sk: address publishing socket * @key: target publication key */static struct publication *tipc_service_remove_publ(struct service_range *r,						    struct tipc_socket_addr *sk,						    u32 key){	struct publication *p;	u32 node = sk->node; 	list_for_each_entry(p, &r->all_publ, all_publ) {		if (p->key != key || p->sk.ref != sk->ref ||		    (node && node != p->sk.node))			continue;		list_del(&p->all_publ);		list_del(&p->local_publ);		return p;	}	return NULL;} /* * Code reused: time_after32() for the same purpose */#define publication_after(pa, pb) time_after32((pa)->id, (pb)->id)static int tipc_publ_sort(void *priv, const struct list_head *a,			  const struct list_head *b){	struct publication *pa, *pb; 	pa = container_of(a, struct publication, list);	pb = container_of(b, struct publication, list);	return publication_after(pa, pb);} /** * tipc_service_subscribe - attach a subscription, and optionally * issue the prescribed number of events if there is any service * range overlapping with the requested range * @service: the tipc_service to attach the @sub to * @sub: the subscription to attach */static void tipc_service_subscribe(struct tipc_service *service,				   struct tipc_subscription *sub){	struct publication *p, *first, *tmp;	struct list_head publ_list;	struct service_range *sr;	u32 filter, lower, upper; 	filter = sub->s.filter;	lower = sub->s.seq.lower;	upper = sub->s.seq.upper; 	tipc_sub_get(sub);	list_add(&sub->service_list, &service->subscriptions); 	if (filter & TIPC_SUB_NO_STATUS)		return; 	INIT_LIST_HEAD(&publ_list);	service_range_foreach_match(sr, service, lower, upper) {		first = NULL;		list_for_each_entry(p, &sr->all_publ, all_publ) {			if (filter & TIPC_SUB_PORTS)				list_add_tail(&p->list, &publ_list);			else if (!first || publication_after(first, p))				/* Pick this range's *first* publication */				first = p;		}		if (first)			list_add_tail(&first->list, &publ_list);	} 	/* Sort the publications before reporting */	list_sort(NULL, &publ_list, tipc_publ_sort);	list_for_each_entry_safe(p, tmp, &publ_list, list) {		tipc_sub_report_overlap(sub, p, TIPC_PUBLISHED, true);		list_del_init(&p->list);	}} static struct tipc_service *tipc_service_find(struct net *net,					      struct tipc_uaddr *ua){	struct name_table *nt = tipc_name_table(net);	struct hlist_head *service_head;	struct tipc_service *service; 	service_head = &nt->services[hash(ua->sr.type)];	hlist_for_each_entry_rcu(service, service_head, service_list) {		if (service->type == ua->sr.type)			return service;	}	return NULL;}; struct publication *tipc_nametbl_insert_publ(struct net *net,					     struct tipc_uaddr *ua,					     struct tipc_socket_addr *sk,					     u32 key){	struct tipc_service *sc;	struct publication *p; 	p = tipc_publ_create(ua, sk, key);	if (!p)		return NULL; 	sc = tipc_service_find(net, ua);	if (!sc)		sc = tipc_service_create(net, ua);	if (sc && tipc_service_insert_publ(net, sc, p))		return p;	kfree(p);	return NULL;} struct publication *tipc_nametbl_remove_publ(struct net *net,					     struct tipc_uaddr *ua,

Lines 1–500 of 1228. Load more