#include "msg.h"
#include "bearer.h"
-static void tipc_cltr_multicast(struct cluster *c_ptr, struct sk_buff *buf,
- u32 lower, u32 upper);
-static struct sk_buff *tipc_cltr_prepare_routing_msg(u32 data_size, u32 dest);
+void tipc_cltr_multicast(struct cluster *c_ptr, struct sk_buff *buf,
+ u32 lower, u32 upper);
+struct sk_buff *tipc_cltr_prepare_routing_msg(u32 data_size, u32 dest);
-struct node **tipc_local_nodes = NULL;
+struct node **tipc_local_nodes = 0;
struct node_map tipc_cltr_bcast_nodes = {0,{0,}};
u32 tipc_highest_allowed_slave = 0;
c_ptr = (struct cluster *)kmalloc(sizeof(*c_ptr), GFP_ATOMIC);
if (c_ptr == NULL)
- return NULL;
+ return 0;
memset(c_ptr, 0, sizeof(*c_ptr));
c_ptr->addr = tipc_addr(tipc_zone(addr), tipc_cluster(addr), 0);
c_ptr->nodes = (struct node **)kmalloc(alloc, GFP_ATOMIC);
if (c_ptr->nodes == NULL) {
kfree(c_ptr);
- return NULL;
+ return 0;
}
memset(c_ptr->nodes, 0, alloc);
if (in_own_cluster(addr))
}
else {
kfree(c_ptr);
- c_ptr = NULL;
+ c_ptr = 0;
}
return c_ptr;
assert(!in_own_cluster(c_ptr->addr));
if (!c_ptr->highest_node)
- return NULL;
+ return 0;
/* Start entry must be random */
while (mask > c_ptr->highest_node) {
if (tipc_node_has_active_links(c_ptr->nodes[n_num]))
return c_ptr->nodes[n_num];
}
- return NULL;
+ return 0;
}
/*
* Routing table management: See description in node.c
*/
-static struct sk_buff *tipc_cltr_prepare_routing_msg(u32 data_size, u32 dest)
+struct sk_buff *tipc_cltr_prepare_routing_msg(u32 data_size, u32 dest)
{
u32 size = INT_H_SIZE + data_size;
struct sk_buff *buf = buf_acquire(size);
* tipc_cltr_multicast - multicast message to local nodes
*/
-static void tipc_cltr_multicast(struct cluster *c_ptr, struct sk_buff *buf,
+void tipc_cltr_multicast(struct cluster *c_ptr, struct sk_buff *buf,
u32 lower, u32 upper)
{
struct sk_buff *buf_copy;