cregit-Linux how code gets into the kernel

Release 4.8 net/tipc/name_table.c

Directory: net/tipc
/*
 * net/tipc/name_table.c: TIPC name table code
 *
 * Copyright (c) 2000-2006, 2014-2015, Ericsson AB
 * Copyright (c) 2004-2008, 2010-2014, Wind River Systems
 * 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 "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 <net/genetlink.h>


#define TIPC_NAMETBL_SIZE 1024		
/* must be a power of 2 */

/**
 * struct name_info - name sequence publication info
 * @node_list: circular list of publications made by own node
 * @cluster_list: circular list of publications made by own cluster
 * @zone_list: circular list of publications made by own zone
 * @node_list_size: number of entries in "node_list"
 * @cluster_list_size: number of entries in "cluster_list"
 * @zone_list_size: number of entries in "zone_list"
 *
 * Note: The zone list always contains at least one entry, since all
 *       publications of the associated name sequence belong to it.
 *       (The cluster and node lists may be empty.)
 */

struct name_info {
	
struct list_head node_list;
	
struct list_head cluster_list;
	
struct list_head zone_list;
	
u32 node_list_size;
	
u32 cluster_list_size;
	
u32 zone_list_size;
};

/**
 * struct sub_seq - container for all published instances of a name sequence
 * @lower: name sequence lower bound
 * @upper: name sequence upper bound
 * @info: pointer to name sequence publication info
 */

struct sub_seq {
	
u32 lower;
	
u32 upper;
	
struct name_info *info;
};

/**
 * struct name_seq - container for all published instances of a name type
 * @type: 32 bit 'type' value for name sequence
 * @sseq: pointer to dynamically-sized array of sub-sequences of this 'type';
 *        sub-sequences are sorted in ascending order
 * @alloc: number of sub-sequences currently in array
 * @first_free: array index of first unused sub-sequence entry
 * @ns_list: links to adjacent name sequences in hash chain
 * @subscriptions: list of subscriptions for this 'type'
 * @lock: spinlock controlling access to publication lists of all sub-sequences
 * @rcu: RCU callback head used for deferred freeing
 */

struct name_seq {
	
u32 type;
	
struct sub_seq *sseqs;
	
u32 alloc;
	
u32 first_free;
	
struct hlist_node ns_list;
	
struct list_head subscriptions;
	
spinlock_t lock;
	
struct rcu_head rcu;
};


static int hash(int x) { return x & (TIPC_NAMETBL_SIZE - 1); }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden1794.44%150.00%
ying xueying xue15.56%150.00%
Total18100.00%2100.00%

/** * publ_create - create a publication structure */
static struct publication *publ_create(u32 type, u32 lower, u32 upper, u32 scope, u32 node, u32 port_ref, u32 key) { struct publication *publ = kzalloc(sizeof(*publ), GFP_ATOMIC); if (publ == NULL) { pr_warn("Publication creation failure, no memory\n"); return NULL; } publ->type = type; publ->lower = lower; publ->upper = upper; publ->scope = scope; publ->node = node; publ->ref = port_ref; publ->key = key; INIT_LIST_HEAD(&publ->pport_list); return publ; }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden11096.49%120.00%
erik hugneerik hugne10.88%120.00%
panagiotis issaris*panagiotis issaris*10.88%120.00%
sam ravnborgsam ravnborg10.88%120.00%
allan stephensallan stephens10.88%120.00%
Total114100.00%5100.00%

/** * tipc_subseq_alloc - allocate a specified number of sub-sequence structures */
static struct sub_seq *tipc_subseq_alloc(u32 cnt) { return kcalloc(cnt, sizeof(struct sub_seq), GFP_ATOMIC); }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden1664.00%240.00%
panagiotis issaris*panagiotis issaris*728.00%120.00%
wang weidongwang weidong14.00%120.00%
adrian bunkadrian bunk14.00%120.00%
Total25100.00%5100.00%

/** * tipc_nameseq_create - create a name sequence structure for the specified 'type' * * Allocates a single sub-sequence structure and sets it to all 0's. */
static struct name_seq *tipc_nameseq_create(u32 type, struct hlist_head *seq_head) { struct name_seq *nseq = kzalloc(sizeof(*nseq), GFP_ATOMIC); struct sub_seq *sseq = tipc_subseq_alloc(1); if (!nseq || !sseq) { pr_warn("Name sequence creation failed, no memory\n"); kfree(nseq); kfree(sseq); return NULL; } spin_lock_init(&nseq->lock); nseq->type = type; nseq->sseqs = sseq; nseq->alloc = 1; INIT_HLIST_NODE(&nseq->ns_list); INIT_LIST_HEAD(&nseq->subscriptions); hlist_add_head_rcu(&nseq->ns_list, seq_head); return nseq; }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden11592.00%222.22%
ingo molnaringo molnar43.20%111.11%
allan stephensallan stephens10.80%111.11%
adrian bunkadrian bunk10.80%111.11%
ying xueying xue10.80%111.11%
sam ravnborgsam ravnborg10.80%111.11%
erik hugneerik hugne10.80%111.11%
panagiotis issaris*panagiotis issaris*10.80%111.11%
Total125100.00%9100.00%

/** * nameseq_find_subseq - find sub-sequence (if any) matching a name instance * * Very time-critical, so binary searches through sub-sequence array. */
static struct sub_seq *nameseq_find_subseq(struct name_seq *nseq, u32 instance) { struct sub_seq *sseqs = nseq->sseqs; int low = 0; int high = nseq->first_free - 1; int mid; while (low <= high) { mid = (low + high) / 2; if (instance < sseqs[mid].lower) high = mid - 1; else if (instance > sseqs[mid].upper) low = mid + 1; else return &sseqs[mid]; } return NULL; }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden10599.06%150.00%
sam ravnborgsam ravnborg10.94%150.00%
Total106100.00%2100.00%

/** * nameseq_locate_subseq - determine position of name instance in sub-sequence * * Returns index in sub-sequence array of the entry that contains the specified * instance value; if no entry contains that value, returns the position * where a new entry for it would be inserted in the array. * * Note: Similar to binary search code for locating a sub-sequence. */
static u32 nameseq_locate_subseq(struct name_seq *nseq, u32 instance) { struct sub_seq *sseqs = nseq->sseqs; int low = 0; int high = nseq->first_free - 1; int mid; while (low <= high) { mid = (low + high) / 2; if (instance < sseqs[mid].lower) high = mid - 1; else if (instance > sseqs[mid].upper) low = mid + 1; else return mid; } return low; }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden100100.00%1100.00%
Total100100.00%1100.00%

/** * tipc_nameseq_insert_publ */
static struct publication *tipc_nameseq_insert_publ(struct net *net, struct name_seq *nseq, u32 type, u32 lower, u32 upper, u32 scope, u32 node, u32 port, u32 key) { struct tipc_subscription *s; struct tipc_subscription *st; struct publication *publ; struct sub_seq *sseq; struct name_info *info; int created_subseq = 0; sseq = nameseq_find_subseq(nseq, lower); if (sseq) { /* Lower end overlaps existing entry => need an exact match */ if ((sseq->lower != lower) || (sseq->upper != upper)) { return NULL; } info = sseq->info; /* Check if an identical publication already exists */ list_for_each_entry(publ, &info->zone_list, zone_list) { if ((publ->ref == port) && (publ->key == key) && (!publ->node || (publ->node == node))) return NULL; } } else { u32 inspos; struct sub_seq *freesseq; /* Find where lower end should be inserted */ inspos = nameseq_locate_subseq(nseq, lower); /* Fail if upper end overlaps into an existing entry */ if ((inspos < nseq->first_free) && (upper >= nseq->sseqs[inspos].lower)) { return NULL; } /* Ensure there is space for new sub-sequence */ if (nseq->first_free == nseq->alloc) { struct sub_seq *sseqs = tipc_subseq_alloc(nseq->alloc * 2); if (!sseqs) { pr_warn("Cannot publish {%u,%u,%u}, no memory\n", type, lower, upper); return NULL; } memcpy(sseqs, nseq->sseqs, nseq->alloc * sizeof(struct sub_seq)); kfree(nseq->sseqs); nseq->sseqs = sseqs; nseq->alloc *= 2; } info = kzalloc(sizeof(*info), GFP_ATOMIC); if (!info) { pr_warn("Cannot publish {%u,%u,%u}, no memory\n", type, lower, upper); return NULL; } INIT_LIST_HEAD(&info->node_list); INIT_LIST_HEAD(&info->cluster_list); INIT_LIST_HEAD(&info->zone_list); /* Insert new sub-sequence */ sseq = &nseq->sseqs[inspos]; freesseq = &nseq->sseqs[nseq->first_free]; memmove(sseq + 1, sseq, (freesseq - sseq) * sizeof(*sseq)); memset(sseq, 0, sizeof(*sseq)); nseq->first_free++; sseq->lower = lower; sseq->upper = upper; sseq->info = info; created_subseq = 1; } /* Insert a publication */ publ = publ_create(type, lower, upper, scope, node, port, key); if (!publ) return NULL; list_add(&publ->zone_list, &info->zone_list); info->zone_list_size++; if (in_own_cluster(net, node)) { list_add(&publ->cluster_list, &info->cluster_list); info->cluster_list_size++; } if (in_own_node(net, node)) { list_add(&publ->node_list, &info->node_list); info->node_list_size++; } /* Any subscriptions waiting for notification? */ list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { tipc_subscrp_report_overlap(s, publ->lower, publ->upper, TIPC_PUBLISHED, publ->ref, publ->node, created_subseq); } return publ; }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden38165.24%213.33%
allan stephensallan stephens18331.34%640.00%
ying xueying xue101.71%213.33%
paul gortmakerpaul gortmaker40.68%213.33%
sam ravnborgsam ravnborg30.51%16.67%
erik hugneerik hugne20.34%16.67%
adrian bunkadrian bunk10.17%16.67%
Total584100.00%15100.00%

/** * tipc_nameseq_remove_publ * * NOTE: There may be cases where TIPC is asked to remove a publication * that is not in the name table. For example, if another node issues a * publication for a name sequence that overlaps an existing name sequence * the publication will not be recorded, which means the publication won't * be found when the name sequence is later withdrawn by that node. * A failed withdraw request simply returns a failure indication and lets the * caller issue any error or warning messages associated with such a problem. */
static struct publication *tipc_nameseq_remove_publ(struct net *net, struct name_seq *nseq, u32 inst, u32 node, u32 ref, u32 key) { struct publication *publ; struct sub_seq *sseq = nameseq_find_subseq(nseq, inst); struct name_info *info; struct sub_seq *free; struct tipc_subscription *s, *st; int removed_subseq = 0; if (!sseq) return NULL; info = sseq->info; /* Locate publication, if it exists */ list_for_each_entry(publ, &info->zone_list, zone_list) { if ((publ->key == key) && (publ->ref == ref) && (!publ->node || (publ->node == node))) goto found; } return NULL; found: /* Remove publication from zone scope list */ list_del(&publ->zone_list); info->zone_list_size--; /* Remove publication from cluster scope list, if present */ if (in_own_cluster(net, node)) { list_del(&publ->cluster_list); info->cluster_list_size--; } /* Remove publication from node scope list, if present */ if (in_own_node(net, node)) { list_del(&publ->node_list); info->node_list_size--; } /* Contract subseq list if no more publications for that subseq */ if (list_empty(&info->zone_list)) { kfree(info); free = &nseq->sseqs[nseq->first_free--]; memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq)); removed_subseq = 1; } /* Notify any waiting subscriptions */ list_for_each_entry_safe(s, st, &nseq->subscriptions, nameseq_list) { tipc_subscrp_report_overlap(s, publ->lower, publ->upper, TIPC_WITHDRAWN, publ->ref, publ->node, removed_subseq); } return publ; }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden20367.44%216.67%
allan stephensallan stephens8528.24%541.67%
ying xueying xue103.32%216.67%
sam ravnborgsam ravnborg10.33%18.33%
paul gortmakerpaul gortmaker10.33%18.33%
adrian bunkadrian bunk10.33%18.33%
Total301100.00%12100.00%

/** * tipc_nameseq_subscribe - attach a subscription, and issue * the prescribed number of events if there is any sub- * sequence overlapping with the requested sequence */
static void tipc_nameseq_subscribe(struct name_seq *nseq, struct tipc_subscription *s) { struct sub_seq *sseq = nseq->sseqs; struct tipc_name_seq ns; tipc_subscrp_convert_seq(&s->evt.s.seq, s->swap, &ns); list_add(&s->nameseq_list, &nseq->subscriptions); if (!sseq) return; while (sseq != &nseq->sseqs[nseq->first_free]) { if (tipc_subscrp_check_overlap(&ns, sseq->lower, sseq->upper)) { struct publication *crs; struct name_info *info = sseq->info; int must_report = 1; list_for_each_entry(crs, &info->zone_list, zone_list) { tipc_subscrp_report_overlap(s, sseq->lower, sseq->upper, TIPC_PUBLISHED, crs->ref, crs->node, must_report); must_report = 0; } } sseq++; } }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden11772.22%228.57%
parthasarathy bhuvaraganparthasarathy bhuvaragan2515.43%114.29%
allan stephensallan stephens169.88%114.29%
ying xueying xue21.23%114.29%
paul gortmakerpaul gortmaker10.62%114.29%
florian westphalflorian westphal10.62%114.29%
Total162100.00%7100.00%


static struct name_seq *nametbl_find_seq(struct net *net, u32 type) { struct tipc_net *tn = net_generic(net, tipc_net_id); struct hlist_head *seq_head; struct name_seq *ns; seq_head = &tn->nametbl->seq_hlist[hash(type)]; hlist_for_each_entry_rcu(ns, seq_head, ns_list) { if (ns->type == type) return ns; } return NULL; }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden5368.83%120.00%
ying xueying xue2329.87%360.00%
sam ravnborgsam ravnborg11.30%120.00%
Total77100.00%5100.00%

;
struct publication *tipc_nametbl_insert_publ(struct net *net, u32 type, u32 lower, u32 upper, u32 scope, u32 node, u32 port, u32 key) { struct tipc_net *tn = net_generic(net, tipc_net_id); struct publication *publ; struct name_seq *seq = nametbl_find_seq(net, type); int index = hash(type); if ((scope < TIPC_ZONE_SCOPE) || (scope > TIPC_NODE_SCOPE) || (lower > upper)) { pr_debug("Failed to publish illegal {%u,%u,%u} with scope %u\n", type, lower, upper, scope); return NULL; } if (!seq) seq = tipc_nameseq_create(type, &tn->nametbl->seq_hlist[index]); if (!seq) return NULL; spin_lock_bh(&seq->lock); publ = tipc_nameseq_insert_publ(net, seq, type, lower, upper, scope, node, port, key); spin_unlock_bh(&seq->lock); return publ; }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden9955.00%222.22%
ying xueying xue6133.89%444.44%
allan stephensallan stephens179.44%111.11%
sam ravnborgsam ravnborg21.11%111.11%
erik hugneerik hugne10.56%111.11%
Total180100.00%9100.00%


struct publication *tipc_nametbl_remove_publ(struct net *net, u32 type, u32 lower, u32 node, u32 ref, u32 key) { struct publication *publ; struct name_seq *seq = nametbl_find_seq(net, type); if (!seq) return NULL; spin_lock_bh(&seq->lock); publ = tipc_nameseq_remove_publ(net, seq, lower, node, ref, key); if (!seq->first_free && list_empty(&seq->subscriptions)) { hlist_del_init_rcu(&seq->ns_list); kfree(seq->sseqs); spin_unlock_bh(&seq->lock); kfree_rcu(seq, rcu); return publ; } spin_unlock_bh(&seq->lock); return publ; }

Contributors

PersonTokensPropCommitsCommitProp
ying xueying xue7151.45%457.14%
per lidenper liden6647.83%228.57%
sam ravnborgsam ravnborg10.72%114.29%
Total138100.00%7100.00%

/** * tipc_nametbl_translate - perform name translation * * On entry, 'destnode' is the search domain used during translation. * * On exit: * - if name translation is deferred to another node/cluster/zone, * leaves 'destnode' unchanged (will be non-zero) and returns 0 * - if name translation is attempted and succeeds, sets 'destnode' * to publishing node and returns port reference (will be non-zero) * - if name translation is attempted and fails, sets 'destnode' to 0 * and returns 0 */
u32 tipc_nametbl_translate(struct net *net, u32 type, u32 instance, u32 *destnode) { struct tipc_net *tn = net_generic(net, tipc_net_id); struct sub_seq *sseq; struct name_info *info; struct publication *publ; struct name_seq *seq; u32 ref = 0; u32 node = 0; if (!tipc_in_scope(*destnode, tn->own_addr)) return 0; rcu_read_lock(); seq = nametbl_find_seq(net, type); if (unlikely(!seq)) goto not_found; spin_lock_bh(&seq->lock); sseq = nameseq_find_subseq(seq, instance); if (unlikely(!sseq)) goto no_match; info = sseq->info; /* Closest-First Algorithm */ if (likely(!*destnode)) { if (!list_empty(&info->node_list)) { publ = list_first_entry(&info->node_list, struct publication, node_list); list_move_tail(&publ->node_list, &info->node_list); } else if (!list_empty(&info->cluster_list)) { publ = list_first_entry(&info->cluster_list, struct publication, cluster_list); list_move_tail(&publ->cluster_list, &info->cluster_list); } else { publ = list_first_entry(&info->zone_list, struct publication, zone_list); list_move_tail(&publ->zone_list, &info->zone_list); } } /* Round-Robin Algorithm */ else if (*destnode == tn->own_addr) { if (list_empty(&info->node_list)) goto no_match; publ = list_first_entry(&info->node_list, struct publication, node_list); list_move_tail(&publ->node_list, &info->node_list); } else if (in_own_cluster_exact(net, *destnode)) { if (list_empty(&info->cluster_list)) goto no_match; publ = list_first_entry(&info->cluster_list, struct publication, cluster_list); list_move_tail(&publ->cluster_list, &info->cluster_list); } else { publ = list_first_entry(&info->zone_list, struct publication, zone_list); list_move_tail(&publ->zone_list, &info->zone_list); } ref = publ->ref; node = publ->node; no_match: spin_unlock_bh(&seq->lock); not_found: rcu_read_unlock(); *destnode = node; return ref; }

Contributors

PersonTokensPropCommitsCommitProp
allan stephensallan stephens20045.98%646.15%
per lidenper liden19344.37%215.38%
ying xueying xue409.20%430.77%
paul gortmakerpaul gortmaker20.46%17.69%
Total435100.00%13100.00%

/** * tipc_nametbl_mc_translate - find multicast destinations * * Creates list of all local ports that overlap the given multicast address; * also determines if any off-node ports overlap. * * Note: Publications with a scope narrower than 'limit' are ignored. * (i.e. local node-scope publications mustn't receive messages arriving * from another node, even if the multcast link brought it here) * * Returns non-zero if any off-node ports overlap */
int tipc_nametbl_mc_translate(struct net *net, u32 type, u32 lower, u32 upper, u32 limit, struct tipc_plist *dports) { struct name_seq *seq; struct sub_seq *sseq; struct sub_seq *sseq_stop; struct name_info *info; int res = 0; rcu_read_lock(); seq = nametbl_find_seq(net, type); if (!seq) goto exit; spin_lock_bh(&seq->lock); sseq = seq->sseqs + nameseq_locate_subseq(seq, lower); sseq_stop = seq->sseqs + seq->first_free; for (; sseq != sseq_stop; sseq++) { struct publication *publ; if (sseq->lower > upper) break; info = sseq->info; list_for_each_entry(publ, &info->node_list, node_list) { if (publ->scope <= limit) tipc_plist_push(dports, publ->ref); } if (info->cluster_list_size != info->node_list_size) res = 1; } spin_unlock_bh(&seq->lock); exit: rcu_read_unlock(); return res; }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden14475.00%222.22%
allan stephensallan stephens3518.23%444.44%
ying xueying xue115.73%222.22%
jon paul maloyjon paul maloy21.04%111.11%
Total192100.00%9100.00%

/* * tipc_nametbl_publish - add name publication to network name tables */
struct publication *tipc_nametbl_publish(struct net *net, u32 type, u32 lower, u32 upper, u32 scope, u32 port_ref, u32 key) { struct publication *publ; struct sk_buff *buf = NULL; struct tipc_net *tn = net_generic(net, tipc_net_id); spin_lock_bh(&tn->nametbl_lock); if (tn->nametbl->local_publ_count >= TIPC_MAX_PUBLICATIONS) { pr_warn("Publication failed, local publication limit reached (%u)\n", TIPC_MAX_PUBLICATIONS); spin_unlock_bh(&tn->nametbl_lock); return NULL; } publ = tipc_nametbl_insert_publ(net, type, lower, upper, scope, tn->own_addr, port_ref, key); if (likely(publ)) { tn->nametbl->local_publ_count++; buf = tipc_named_publish(net, publ); /* Any pending external events? */ tipc_named_process_backlog(net); } spin_unlock_bh(&tn->nametbl_lock); if (buf) tipc_node_broadcast(net, buf); return publ; }

Contributors

PersonTokensPropCommitsCommitProp
per lidenper liden7846.43%212.50%
ying xueying xue7645.24%850.00%
allan stephensallan stephens95.36%318.75%
erik hugneerik hugne42.38%212.50%
jon paul maloyjon paul maloy10.60%16.25%
Total168100.00%16100.00%

/** * tipc_nametbl_withdraw - withdraw name publication from network name tables */
int tipc_nametbl_withdraw(struct net *net, u32 type, u32 lower, u32 ref, u32 key) { struct publication *publ; struct sk_buff *skb = NULL; struct tipc_net *tn = net_generic(net, tipc_net_id); spin_lock_bh(&tn->nametbl_lock); publ = tipc_nametbl_remove_publ(net, type, lower, tn->own_addr, ref, key); if (likely(publ)) { tn->nametbl->local_publ_count--; skb = tipc_named_withdraw(net, publ); /* Any pending external events? */ tipc_named_process_backlog(net); list_del_init(&publ->pport_list); kfree_rcu(publ, rcu); } else { pr_err("Unable to remove local publication\n" "(type=%u, lower=%u, ref=%u, key=%u)\n", type, lower, ref, key); } spin_unlock_bh(&tn->nametbl_lock); if (skb) { tipc_node_broadcast(net, skb); return 1; } return 0; }

Contributors

PersonTokensPropCommitsCommitProp
ying xueying xue7344.79%753.85%
per lidenper liden6942.33%215.38%
allan stephensallan stephens169.82%17.69%
erik hugneerik hugne42.45%215.38%
jon paul maloyjon paul maloy10.61%17.69%
Total163100.00%13100.00%

/** * tipc_nametbl_subscribe - add a subscription object to the name table */
void tipc_nametbl_subscribe(struct tipc_subscription *s) { struct