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