Skip to content

cloud-kernel
cloud-kernel

openanolis / cloud-kernel
1 年多 前同步成功

通知 160
Star 36
Fork 7
cloud-kernel
cloud-kernel
提交 b52124a5 编写于 作者: A Allan Stephens 提交者： Paul Gortmaker
浏览文件
操作

tipc: Partition name table instance array info into two parts 

Modifies the name table array structure that contains the name
sequence instances for a given name type so that the publication
lists associated with a given instance are stored in a dynamically
allocated structure, rather than being embedded within the array
entry itself. This change is being done for several reasons:

1) It reduces the amount of data that needs to be copied whenever
a given array is expanded or contracted to accommodate the first
publication of a new name sequence or the removal of the last
publication of an existing name sequence.

2) It reduces the amount of memory associated with array entries that
are currently unused.

3) It facilitates the upcoming conversion of the publication lists
from TIPC-specific circular lists to standard kernel lists. (Standard
lists cannot be used with the former array structure because the
relocation of array entries during array expansion and contraction
would corrupt the lists.)

Note that, aside from introducing a small amount of code to dynamically
allocate and free the structure that now holds publication list info,
this change is largely a simple renaming exercise that replaces
references to "sseq->LIST" with "sseq->info->LIST" (or "info->LIST").
Signed-off-by: NAllan Stephens <allan.stephens@windriver.com>
Signed-off-by: NPaul Gortmaker <paul.gortmaker@windriver.com>
上级 7eb878ed
隐藏空白更改
内联 并排
Showing with 89 addition and 61 deletion
net/tipc/name_table.c
浏览文件 @ b52124a5
...@@ -44,9 +44,7 @@ ...@@ -44,9 +44,7 @@
static int tipc_nametbl_size = 1024; /* must be a power of 2 */ static int tipc_nametbl_size = 1024; /* must be a power of 2 */
/** /**
* struct sub_seq - container for all published instances of a name sequence * struct name_info - name sequence publication info
* @lower: name sequence lower bound
* @upper: name sequence upper bound
* @node_list: circular list of publications made by own node * @node_list: circular list of publications made by own node
* @cluster_list: circular list of publications made by own cluster * @cluster_list: circular list of publications made by own cluster
* @zone_list: circular list of publications made by own zone * @zone_list: circular list of publications made by own zone
...@@ -59,9 +57,7 @@ static int tipc_nametbl_size = 1024; /* must be a power of 2 */ ...@@ -59,9 +57,7 @@ static int tipc_nametbl_size = 1024; /* must be a power of 2 */
* (The cluster and node lists may be empty.) * (The cluster and node lists may be empty.)
*/ */
struct sub_seq { struct name_info {
u32 lower;
u32 upper;
struct publication *node_list; struct publication *node_list;
struct publication *cluster_list; struct publication *cluster_list;
struct publication *zone_list; struct publication *zone_list;
...@@ -70,6 +66,19 @@ struct sub_seq { ...@@ -70,6 +66,19 @@ struct sub_seq {
u32 zone_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 * struct name_seq - container for all published instances of a name type
* @type: 32 bit 'type' value for name sequence * @type: 32 bit 'type' value for name sequence
...@@ -246,6 +255,7 @@ static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq, ...@@ -246,6 +255,7 @@ static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq,
struct subscription *st; struct subscription *st;
struct publication *publ; struct publication *publ;
struct sub_seq *sseq; struct sub_seq *sseq;
struct name_info *info;
int created_subseq = 0; int created_subseq = 0;
sseq = nameseq_find_subseq(nseq, lower); sseq = nameseq_find_subseq(nseq, lower);
...@@ -258,6 +268,8 @@ static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq, ...@@ -258,6 +268,8 @@ static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq,
type, lower, upper); type, lower, upper);
return NULL; return NULL;
} }
info = sseq->info;
} else { } else {
u32 inspos; u32 inspos;
struct sub_seq *freesseq; struct sub_seq *freesseq;
...@@ -292,6 +304,13 @@ static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq, ...@@ -292,6 +304,13 @@ static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq,
nseq->alloc *= 2; nseq->alloc *= 2;
} }
info = kzalloc(sizeof(*info), GFP_ATOMIC);
if (!info) {
warn("Cannot publish {%u,%u,%u}, no memory\n",
type, lower, upper);
return NULL;
}
/* Insert new sub-sequence */ /* Insert new sub-sequence */
sseq = &nseq->sseqs[inspos]; sseq = &nseq->sseqs[inspos];
...@@ -301,6 +320,7 @@ static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq, ...@@ -301,6 +320,7 @@ static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq,
nseq->first_free++; nseq->first_free++;
sseq->lower = lower; sseq->lower = lower;
sseq->upper = upper; sseq->upper = upper;
sseq->info = info;
created_subseq = 1; created_subseq = 1;
} }
...@@ -310,32 +330,32 @@ static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq, ...@@ -310,32 +330,32 @@ static struct publication *tipc_nameseq_insert_publ(struct name_seq *nseq,
if (!publ) if (!publ)
return NULL; return NULL;
sseq->zone_list_size++; info->zone_list_size++;
if (!sseq->zone_list) if (!info->zone_list)
sseq->zone_list = publ->zone_list_next = publ; info->zone_list = publ->zone_list_next = publ;
else { else {
publ->zone_list_next = sseq->zone_list->zone_list_next; publ->zone_list_next = info->zone_list->zone_list_next;
sseq->zone_list->zone_list_next = publ; info->zone_list->zone_list_next = publ;
} }
if (in_own_cluster(node)) { if (in_own_cluster(node)) {
sseq->cluster_list_size++; info->cluster_list_size++;
if (!sseq->cluster_list) if (!info->cluster_list)
sseq->cluster_list = publ->cluster_list_next = publ; info->cluster_list = publ->cluster_list_next = publ;
else { else {
publ->cluster_list_next = publ->cluster_list_next =
sseq->cluster_list->cluster_list_next; info->cluster_list->cluster_list_next;
sseq->cluster_list->cluster_list_next = publ; info->cluster_list->cluster_list_next = publ;
} }
} }
if (node == tipc_own_addr) { if (node == tipc_own_addr) {
sseq->node_list_size++; info->node_list_size++;
if (!sseq->node_list) if (!info->node_list)
sseq->node_list = publ->node_list_next = publ; info->node_list = publ->node_list_next = publ;
else { else {
publ->node_list_next = sseq->node_list->node_list_next; publ->node_list_next = info->node_list->node_list_next;
sseq->node_list->node_list_next = publ; info->node_list->node_list_next = publ;
} }
} }
...@@ -373,6 +393,7 @@ static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 i ...@@ -373,6 +393,7 @@ static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 i
struct publication *curr; struct publication *curr;
struct publication *prev; struct publication *prev;
struct sub_seq *sseq = nameseq_find_subseq(nseq, inst); struct sub_seq *sseq = nameseq_find_subseq(nseq, inst);
struct name_info *info;
struct sub_seq *free; struct sub_seq *free;
struct subscription *s, *st; struct subscription *s, *st;
int removed_subseq = 0; int removed_subseq = 0;
...@@ -380,40 +401,42 @@ static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 i ...@@ -380,40 +401,42 @@ static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 i
if (!sseq) if (!sseq)
return NULL; return NULL;
info = sseq->info;
/* Remove publication from zone scope list */ /* Remove publication from zone scope list */
prev = sseq->zone_list; prev = info->zone_list;
publ = sseq->zone_list->zone_list_next; publ = info->zone_list->zone_list_next;
while ((publ->key != key) || (publ->ref != ref) || while ((publ->key != key) || (publ->ref != ref) ||
(publ->node && (publ->node != node))) { (publ->node && (publ->node != node))) {
prev = publ; prev = publ;
publ = publ->zone_list_next; publ = publ->zone_list_next;
if (prev == sseq->zone_list) { if (prev == info->zone_list) {
/* Prevent endless loop if publication not found */ /* Prevent endless loop if publication not found */
return NULL; return NULL;
} }
} }
if (publ != sseq->zone_list) if (publ != info->zone_list)
prev->zone_list_next = publ->zone_list_next; prev->zone_list_next = publ->zone_list_next;
else if (publ->zone_list_next != publ) { else if (publ->zone_list_next != publ) {
prev->zone_list_next = publ->zone_list_next; prev->zone_list_next = publ->zone_list_next;
sseq->zone_list = publ->zone_list_next; info->zone_list = publ->zone_list_next;
} else { } else {
sseq->zone_list = NULL; info->zone_list = NULL;
} }
sseq->zone_list_size--; info->zone_list_size--;
/* Remove publication from cluster scope list, if present */ /* Remove publication from cluster scope list, if present */
if (in_own_cluster(node)) { if (in_own_cluster(node)) {
prev = sseq->cluster_list; prev = info->cluster_list;
curr = sseq->cluster_list->cluster_list_next; curr = info->cluster_list->cluster_list_next;
while (curr != publ) { while (curr != publ) {
prev = curr; prev = curr;
curr = curr->cluster_list_next; curr = curr->cluster_list_next;
if (prev == sseq->cluster_list) { if (prev == info->cluster_list) {
/* Prevent endless loop for malformed list */ /* Prevent endless loop for malformed list */
...@@ -424,27 +447,27 @@ static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 i ...@@ -424,27 +447,27 @@ static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 i
goto end_cluster; goto end_cluster;
} }
} }
if (publ != sseq->cluster_list) if (publ != info->cluster_list)
prev->cluster_list_next = publ->cluster_list_next; prev->cluster_list_next = publ->cluster_list_next;
else if (publ->cluster_list_next != publ) { else if (publ->cluster_list_next != publ) {
prev->cluster_list_next = publ->cluster_list_next; prev->cluster_list_next = publ->cluster_list_next;
sseq->cluster_list = publ->cluster_list_next; info->cluster_list = publ->cluster_list_next;
} else { } else {
sseq->cluster_list = NULL; info->cluster_list = NULL;
} }
sseq->cluster_list_size--; info->cluster_list_size--;
} }
end_cluster: end_cluster:
/* Remove publication from node scope list, if present */ /* Remove publication from node scope list, if present */
if (node == tipc_own_addr) { if (node == tipc_own_addr) {
prev = sseq->node_list; prev = info->node_list;
curr = sseq->node_list->node_list_next; curr = info->node_list->node_list_next;
while (curr != publ) { while (curr != publ) {
prev = curr; prev = curr;
curr = curr->node_list_next; curr = curr->node_list_next;
if (prev == sseq->node_list) { if (prev == info->node_list) {
/* Prevent endless loop for malformed list */ /* Prevent endless loop for malformed list */
...@@ -455,21 +478,22 @@ static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 i ...@@ -455,21 +478,22 @@ static struct publication *tipc_nameseq_remove_publ(struct name_seq *nseq, u32 i
goto end_node; goto end_node;
} }
} }
if (publ != sseq->node_list) if (publ != info->node_list)
prev->node_list_next = publ->node_list_next; prev->node_list_next = publ->node_list_next;
else if (publ->node_list_next != publ) { else if (publ->node_list_next != publ) {
prev->node_list_next = publ->node_list_next; prev->node_list_next = publ->node_list_next;
sseq->node_list = publ->node_list_next; info->node_list = publ->node_list_next;
} else { } else {
sseq->node_list = NULL; info->node_list = NULL;
} }
sseq->node_list_size--; info->node_list_size--;
} }
end_node: end_node:
/* Contract subseq list if no more publications for that subseq */ /* Contract subseq list if no more publications for that subseq */
if (!sseq->zone_list) { if (!info->zone_list) {
kfree(info);
free = &nseq->sseqs[nseq->first_free--]; free = &nseq->sseqs[nseq->first_free--];
memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq)); memmove(sseq, sseq + 1, (free - (sseq + 1)) * sizeof(*sseq));
removed_subseq = 1; removed_subseq = 1;
...@@ -506,7 +530,7 @@ static void tipc_nameseq_subscribe(struct name_seq *nseq, struct subscription *s ...@@ -506,7 +530,7 @@ static void tipc_nameseq_subscribe(struct name_seq *nseq, struct subscription *s
return; return;
while (sseq != &nseq->sseqs[nseq->first_free]) { while (sseq != &nseq->sseqs[nseq->first_free]) {
struct publication *zl = sseq->zone_list; struct publication *zl = sseq->info->zone_list;
if (zl && tipc_subscr_overlap(s, sseq->lower, sseq->upper)) { if (zl && tipc_subscr_overlap(s, sseq->lower, sseq->upper)) {
struct publication *crs = zl; struct publication *crs = zl;
int must_report = 1; int must_report = 1;
...@@ -591,6 +615,7 @@ struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower, ...@@ -591,6 +615,7 @@ struct publication *tipc_nametbl_remove_publ(u32 type, u32 lower,
u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode) u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode)
{ {
struct sub_seq *sseq; struct sub_seq *sseq;
struct name_info *info;
struct publication *publ = NULL; struct publication *publ = NULL;
struct name_seq *seq; struct name_seq *seq;
u32 ref; u32 ref;
...@@ -606,12 +631,13 @@ u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode) ...@@ -606,12 +631,13 @@ u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode)
if (unlikely(!sseq)) if (unlikely(!sseq))
goto not_found; goto not_found;
spin_lock_bh(&seq->lock); spin_lock_bh(&seq->lock);
info = sseq->info;
/* Closest-First Algorithm: */ /* Closest-First Algorithm: */
if (likely(!*destnode)) { if (likely(!*destnode)) {
publ = sseq->node_list; publ = info->node_list;
if (publ) { if (publ) {
sseq->node_list = publ->node_list_next; info->node_list = publ->node_list_next;
found: found:
ref = publ->ref; ref = publ->ref;
*destnode = publ->node; *destnode = publ->node;
...@@ -619,35 +645,35 @@ u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode) ...@@ -619,35 +645,35 @@ u32 tipc_nametbl_translate(u32 type, u32 instance, u32 *destnode)
read_unlock_bh(&tipc_nametbl_lock); read_unlock_bh(&tipc_nametbl_lock);
return ref; return ref;
} }
publ = sseq->cluster_list; publ = info->cluster_list;
if (publ) { if (publ) {
sseq->cluster_list = publ->cluster_list_next; info->cluster_list = publ->cluster_list_next;
goto found; goto found;
} }
publ = sseq->zone_list; publ = info->zone_list;
if (publ) { if (publ) {
sseq->zone_list = publ->zone_list_next; info->zone_list = publ->zone_list_next;
goto found; goto found;
} }
} }
/* Round-Robin Algorithm: */ /* Round-Robin Algorithm: */
else if (*destnode == tipc_own_addr) { else if (*destnode == tipc_own_addr) {
publ = sseq->node_list; publ = info->node_list;
if (publ) { if (publ) {
sseq->node_list = publ->node_list_next; info->node_list = publ->node_list_next;
goto found; goto found;
} }
} else if (in_own_cluster(*destnode)) { } else if (in_own_cluster(*destnode)) {
publ = sseq->cluster_list; publ = info->cluster_list;
if (publ) { if (publ) {
sseq->cluster_list = publ->cluster_list_next; info->cluster_list = publ->cluster_list_next;
goto found; goto found;
} }
} else { } else {
publ = sseq->zone_list; publ = info->zone_list;
if (publ) { if (publ) {
sseq->zone_list = publ->zone_list_next; info->zone_list = publ->zone_list_next;
goto found; goto found;
} }
} }
...@@ -676,6 +702,7 @@ int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit, ...@@ -676,6 +702,7 @@ int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit,
struct name_seq *seq; struct name_seq *seq;
struct sub_seq *sseq; struct sub_seq *sseq;
struct sub_seq *sseq_stop; struct sub_seq *sseq_stop;
struct name_info *info;
int res = 0; int res = 0;
read_lock_bh(&tipc_nametbl_lock); read_lock_bh(&tipc_nametbl_lock);
...@@ -693,16 +720,17 @@ int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit, ...@@ -693,16 +720,17 @@ int tipc_nametbl_mc_translate(u32 type, u32 lower, u32 upper, u32 limit,
if (sseq->lower > upper) if (sseq->lower > upper)
break; break;
publ = sseq->node_list; info = sseq->info;
publ = info->node_list;
if (publ) { if (publ) {
do { do {
if (publ->scope <= limit) if (publ->scope <= limit)
tipc_port_list_add(dports, publ->ref); tipc_port_list_add(dports, publ->ref);
publ = publ->node_list_next; publ = publ->node_list_next;
} while (publ != sseq->node_list); } while (publ != info->node_list);
} }
if (sseq->cluster_list_size != sseq->node_list_size) if (info->cluster_list_size != info->node_list_size)
res = 1; res = 1;
} }
...@@ -840,7 +868,7 @@ static void subseq_list(struct sub_seq *sseq, struct print_buf *buf, u32 depth, ...@@ -840,7 +868,7 @@ static void subseq_list(struct sub_seq *sseq, struct print_buf *buf, u32 depth,
{ {
char portIdStr[27]; char portIdStr[27];
const char *scope_str[] = {"", " zone", " cluster", " node"}; const char *scope_str[] = {"", " zone", " cluster", " node"};
struct publication *publ = sseq->zone_list; struct publication *publ = sseq->info->zone_list;
tipc_printf(buf, "%-10u %-10u ", sseq->lower, sseq->upper); tipc_printf(buf, "%-10u %-10u ", sseq->lower, sseq->upper);
...@@ -860,7 +888,7 @@ static void subseq_list(struct sub_seq *sseq, struct print_buf *buf, u32 depth, ...@@ -860,7 +888,7 @@ static void subseq_list(struct sub_seq *sseq, struct print_buf *buf, u32 depth,
} }
publ = publ->zone_list_next; publ = publ->zone_list_next;
if (publ == sseq->zone_list) if (publ == sseq->info->zone_list)
break; break;
tipc_printf(buf, "\n%33s", " "); tipc_printf(buf, "\n%33s", " ");
......
Markdown is supported
0% 或 .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑！
想要评论请 注册 或