1 /* 1
2 * net/tipc/subscr.c: TIPC network topology se
3 *
4 * Copyright (c) 2000-2017, Ericsson AB
5 * Copyright (c) 2005-2007, 2010-2013, Wind Ri
6 * Copyright (c) 2020-2021, Red Hat Inc
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary
10 * modification, are permitted provided that t
11 *
12 * 1. Redistributions of source code must reta
13 * notice, this list of conditions and the
14 * 2. Redistributions in binary form must repr
15 * notice, this list of conditions and the
16 * documentation and/or other materials pro
17 * 3. Neither the names of the copyright holde
18 * contributors may be used to endorse or p
19 * this software without specific prior wri
20 *
21 * Alternatively, this software may be distrib
22 * GNU General Public License ("GPL") version
23 * Software Foundation.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT
26 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCL
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND F
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYR
29 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT L
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THE
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUD
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS S
35 * POSSIBILITY OF SUCH DAMAGE.
36 */
37
38 #include "core.h"
39 #include "name_table.h"
40 #include "subscr.h"
41
42 static void tipc_sub_send_event(struct tipc_su
43 struct publica
44 u32 event)
45 {
46 struct tipc_subscr *s = &sub->evt.s;
47 struct tipc_event *evt = &sub->evt;
48
49 if (sub->inactive)
50 return;
51 tipc_evt_write(evt, event, event);
52 if (p) {
53 tipc_evt_write(evt, found_lowe
54 tipc_evt_write(evt, found_uppe
55 tipc_evt_write(evt, port.ref,
56 tipc_evt_write(evt, port.node,
57 } else {
58 tipc_evt_write(evt, found_lowe
59 tipc_evt_write(evt, found_uppe
60 tipc_evt_write(evt, port.ref,
61 tipc_evt_write(evt, port.node,
62 }
63 tipc_topsrv_queue_evt(sub->net, sub->c
64 }
65
66 /**
67 * tipc_sub_check_overlap - test for subscript
68 * @subscribed: the service range subscribed f
69 * @found: the service range we are checking f
70 *
71 * Returns true if there is overlap, otherwise
72 */
73 static bool tipc_sub_check_overlap(struct tipc
74 struct tipc
75 {
76 u32 found_lower = found->lower;
77 u32 found_upper = found->upper;
78
79 if (found_lower < subscribed->lower)
80 found_lower = subscribed->lowe
81 if (found_upper > subscribed->upper)
82 found_upper = subscribed->uppe
83 return found_lower <= found_upper;
84 }
85
86 void tipc_sub_report_overlap(struct tipc_subsc
87 struct publicatio
88 u32 event, bool m
89 {
90 struct tipc_service_range *sr = &sub->
91 u32 filter = sub->s.filter;
92
93 if (!tipc_sub_check_overlap(sr, &p->sr
94 return;
95 if (!must && !(filter & TIPC_SUB_PORTS
96 return;
97 if (filter & TIPC_SUB_CLUSTER_SCOPE &&
98 return;
99 if (filter & TIPC_SUB_NODE_SCOPE && p-
100 return;
101 spin_lock(&sub->lock);
102 tipc_sub_send_event(sub, p, event);
103 spin_unlock(&sub->lock);
104 }
105
106 static void tipc_sub_timeout(struct timer_list
107 {
108 struct tipc_subscription *sub = from_t
109
110 spin_lock(&sub->lock);
111 tipc_sub_send_event(sub, NULL, TIPC_SU
112 sub->inactive = true;
113 spin_unlock(&sub->lock);
114 }
115
116 static void tipc_sub_kref_release(struct kref
117 {
118 kfree(container_of(kref, struct tipc_s
119 }
120
121 void tipc_sub_put(struct tipc_subscription *su
122 {
123 kref_put(&subscription->kref, tipc_sub
124 }
125
126 void tipc_sub_get(struct tipc_subscription *su
127 {
128 kref_get(&subscription->kref);
129 }
130
131 struct tipc_subscription *tipc_sub_subscribe(s
132 s
133 i
134 {
135 u32 lower = tipc_sub_read(s, seq.lower
136 u32 upper = tipc_sub_read(s, seq.upper
137 u32 filter = tipc_sub_read(s, filter);
138 struct tipc_subscription *sub;
139 u32 timeout;
140
141 if ((filter & TIPC_SUB_PORTS && filter
142 lower > upper) {
143 pr_warn("Subscription rejected
144 return NULL;
145 }
146 sub = kmalloc(sizeof(*sub), GFP_ATOMIC
147 if (!sub) {
148 pr_warn("Subscription rejected
149 return NULL;
150 }
151 INIT_LIST_HEAD(&sub->service_list);
152 INIT_LIST_HEAD(&sub->sub_list);
153 sub->net = net;
154 sub->conid = conid;
155 sub->inactive = false;
156 memcpy(&sub->evt.s, s, sizeof(*s));
157 sub->s.seq.type = tipc_sub_read(s, seq
158 sub->s.seq.lower = lower;
159 sub->s.seq.upper = upper;
160 sub->s.filter = filter;
161 sub->s.timeout = tipc_sub_read(s, time
162 memcpy(sub->s.usr_handle, s->usr_handl
163 spin_lock_init(&sub->lock);
164 kref_init(&sub->kref);
165 if (!tipc_nametbl_subscribe(sub)) {
166 kfree(sub);
167 return NULL;
168 }
169 timer_setup(&sub->timer, tipc_sub_time
170 timeout = tipc_sub_read(&sub->evt.s, t
171 if (timeout != TIPC_WAIT_FOREVER)
172 mod_timer(&sub->timer, jiffies
173 return sub;
174 }
175
176 void tipc_sub_unsubscribe(struct tipc_subscrip
177 {
178 tipc_nametbl_unsubscribe(sub);
179 if (sub->evt.s.timeout != TIPC_WAIT_FO
180 del_timer_sync(&sub->timer);
181 list_del(&sub->sub_list);
182 tipc_sub_put(sub);
183 }
184
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.