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-2006, 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 <<
7 * All rights reserved. 6 * All rights reserved.
8 * 7 *
9 * Redistribution and use in source and binary 8 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that t 9 * modification, are permitted provided that the following conditions are met:
11 * 10 *
12 * 1. Redistributions of source code must reta 11 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the 12 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must repr 13 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the 14 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials pro 15 * documentation and/or other materials provided with the distribution.
17 * 3. Neither the names of the copyright holde 16 * 3. Neither the names of the copyright holders nor the names of its
18 * contributors may be used to endorse or p 17 * contributors may be used to endorse or promote products derived from
19 * this software without specific prior wri 18 * this software without specific prior written permission.
20 * 19 *
21 * Alternatively, this software may be distrib 20 * Alternatively, this software may be distributed under the terms of the
22 * GNU General Public License ("GPL") version 21 * GNU General Public License ("GPL") version 2 as published by the Free
23 * Software Foundation. 22 * Software Foundation.
24 * 23 *
25 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT 24 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
26 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCL 25 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND F 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYR 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
29 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL 28 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT L 29 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 30 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THE 31 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUD 32 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 * ARISING IN ANY WAY OUT OF THE USE OF THIS S 33 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 * POSSIBILITY OF SUCH DAMAGE. 34 * POSSIBILITY OF SUCH DAMAGE.
36 */ 35 */
37 36
38 #include "core.h" 37 #include "core.h"
39 #include "name_table.h" 38 #include "name_table.h"
40 #include "subscr.h" 39 #include "subscr.h"
41 40
42 static void tipc_sub_send_event(struct tipc_su !! 41 /**
43 struct publica !! 42 * struct tipc_subscriber - TIPC network topology subscriber
44 u32 event) !! 43 * @kref: reference counter to tipc_subscription object
>> 44 * @conid: connection identifier to server connecting to subscriber
>> 45 * @lock: control access to subscriber
>> 46 * @subscrp_list: list of subscription objects for this subscriber
>> 47 */
>> 48 struct tipc_subscriber {
>> 49 struct kref kref;
>> 50 int conid;
>> 51 spinlock_t lock;
>> 52 struct list_head subscrp_list;
>> 53 };
>> 54
>> 55 static void tipc_subscrp_delete(struct tipc_subscription *sub);
>> 56 static void tipc_subscrb_put(struct tipc_subscriber *subscriber);
>> 57
>> 58 /**
>> 59 * htohl - convert value to endianness used by destination
>> 60 * @in: value to convert
>> 61 * @swap: non-zero if endianness must be reversed
>> 62 *
>> 63 * Returns converted value
>> 64 */
>> 65 static u32 htohl(u32 in, int swap)
45 { 66 {
46 struct tipc_subscr *s = &sub->evt.s; !! 67 return swap ? swab32(in) : in;
47 struct tipc_event *evt = &sub->evt; !! 68 }
48 69
49 if (sub->inactive) !! 70 static void tipc_subscrp_send_event(struct tipc_subscription *sub,
50 return; !! 71 u32 found_lower, u32 found_upper,
51 tipc_evt_write(evt, event, event); !! 72 u32 event, u32 port_ref, u32 node)
52 if (p) { !! 73 {
53 tipc_evt_write(evt, found_lowe !! 74 struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
54 tipc_evt_write(evt, found_uppe !! 75 struct tipc_subscriber *subscriber = sub->subscriber;
55 tipc_evt_write(evt, port.ref, !! 76 struct kvec msg_sect;
56 tipc_evt_write(evt, port.node, !! 77
57 } else { !! 78 msg_sect.iov_base = (void *)&sub->evt;
58 tipc_evt_write(evt, found_lowe !! 79 msg_sect.iov_len = sizeof(struct tipc_event);
59 tipc_evt_write(evt, found_uppe !! 80 sub->evt.event = htohl(event, sub->swap);
60 tipc_evt_write(evt, port.ref, !! 81 sub->evt.found_lower = htohl(found_lower, sub->swap);
61 tipc_evt_write(evt, port.node, !! 82 sub->evt.found_upper = htohl(found_upper, sub->swap);
62 } !! 83 sub->evt.port.ref = htohl(port_ref, sub->swap);
63 tipc_topsrv_queue_evt(sub->net, sub->c !! 84 sub->evt.port.node = htohl(node, sub->swap);
>> 85 tipc_conn_sendmsg(tn->topsrv, subscriber->conid, NULL,
>> 86 msg_sect.iov_base, msg_sect.iov_len);
64 } 87 }
65 88
66 /** 89 /**
67 * tipc_sub_check_overlap - test for subscript !! 90 * tipc_subscrp_check_overlap - test for subscription overlap with the
68 * @subscribed: the service range subscribed f !! 91 * given values
69 * @found: the service range we are checking f <<
70 * 92 *
71 * Returns true if there is overlap, otherwise !! 93 * Returns 1 if there is overlap, otherwise 0.
72 */ 94 */
73 static bool tipc_sub_check_overlap(struct tipc !! 95 int tipc_subscrp_check_overlap(struct tipc_name_seq *seq, u32 found_lower,
74 struct tipc !! 96 u32 found_upper)
>> 97 {
>> 98 if (found_lower < seq->lower)
>> 99 found_lower = seq->lower;
>> 100 if (found_upper > seq->upper)
>> 101 found_upper = seq->upper;
>> 102 if (found_lower > found_upper)
>> 103 return 0;
>> 104 return 1;
>> 105 }
>> 106
>> 107 u32 tipc_subscrp_convert_seq_type(u32 type, int swap)
75 { 108 {
76 u32 found_lower = found->lower; !! 109 return htohl(type, swap);
77 u32 found_upper = found->upper; !! 110 }
78 111
79 if (found_lower < subscribed->lower) !! 112 void tipc_subscrp_convert_seq(struct tipc_name_seq *in, int swap,
80 found_lower = subscribed->lowe !! 113 struct tipc_name_seq *out)
81 if (found_upper > subscribed->upper) !! 114 {
82 found_upper = subscribed->uppe !! 115 out->type = htohl(in->type, swap);
83 return found_lower <= found_upper; !! 116 out->lower = htohl(in->lower, swap);
>> 117 out->upper = htohl(in->upper, swap);
84 } 118 }
85 119
86 void tipc_sub_report_overlap(struct tipc_subsc !! 120 void tipc_subscrp_report_overlap(struct tipc_subscription *sub, u32 found_lower,
87 struct publicatio !! 121 u32 found_upper, u32 event, u32 port_ref,
88 u32 event, bool m !! 122 u32 node, int must)
89 { 123 {
90 struct tipc_service_range *sr = &sub-> !! 124 struct tipc_name_seq seq;
91 u32 filter = sub->s.filter; <<
92 125
93 if (!tipc_sub_check_overlap(sr, &p->sr !! 126 tipc_subscrp_convert_seq(&sub->evt.s.seq, sub->swap, &seq);
94 return; !! 127 if (!tipc_subscrp_check_overlap(&seq, found_lower, found_upper))
95 if (!must && !(filter & TIPC_SUB_PORTS <<
96 return; <<
97 if (filter & TIPC_SUB_CLUSTER_SCOPE && <<
98 return; 128 return;
99 if (filter & TIPC_SUB_NODE_SCOPE && p- !! 129 if (!must &&
>> 130 !(htohl(sub->evt.s.filter, sub->swap) & TIPC_SUB_PORTS))
100 return; 131 return;
101 spin_lock(&sub->lock); !! 132
102 tipc_sub_send_event(sub, p, event); !! 133 tipc_subscrp_send_event(sub, found_lower, found_upper, event, port_ref,
103 spin_unlock(&sub->lock); !! 134 node);
104 } 135 }
105 136
106 static void tipc_sub_timeout(struct timer_list !! 137 static void tipc_subscrp_timeout(unsigned long data)
107 { 138 {
108 struct tipc_subscription *sub = from_t !! 139 struct tipc_subscription *sub = (struct tipc_subscription *)data;
>> 140 struct tipc_subscriber *subscriber = sub->subscriber;
>> 141
>> 142 spin_lock_bh(&subscriber->lock);
>> 143 tipc_nametbl_unsubscribe(sub);
>> 144 list_del(&sub->subscrp_list);
>> 145 spin_unlock_bh(&subscriber->lock);
109 146
110 spin_lock(&sub->lock); !! 147 /* Notify subscriber of timeout */
111 tipc_sub_send_event(sub, NULL, TIPC_SU !! 148 tipc_subscrp_send_event(sub, sub->evt.s.seq.lower, sub->evt.s.seq.upper,
112 sub->inactive = true; !! 149 TIPC_SUBSCR_TIMEOUT, 0, 0);
113 spin_unlock(&sub->lock); !! 150
>> 151 tipc_subscrp_put(sub);
114 } 152 }
115 153
116 static void tipc_sub_kref_release(struct kref !! 154 static void tipc_subscrb_kref_release(struct kref *kref)
117 { 155 {
118 kfree(container_of(kref, struct tipc_s !! 156 kfree(container_of(kref,struct tipc_subscriber, kref));
119 } 157 }
120 158
121 void tipc_sub_put(struct tipc_subscription *su !! 159 static void tipc_subscrb_put(struct tipc_subscriber *subscriber)
122 { 160 {
123 kref_put(&subscription->kref, tipc_sub !! 161 kref_put(&subscriber->kref, tipc_subscrb_kref_release);
124 } 162 }
125 163
126 void tipc_sub_get(struct tipc_subscription *su !! 164 static void tipc_subscrb_get(struct tipc_subscriber *subscriber)
>> 165 {
>> 166 kref_get(&subscriber->kref);
>> 167 }
>> 168
>> 169 static void tipc_subscrp_kref_release(struct kref *kref)
>> 170 {
>> 171 struct tipc_subscription *sub = container_of(kref,
>> 172 struct tipc_subscription,
>> 173 kref);
>> 174 struct tipc_net *tn = net_generic(sub->net, tipc_net_id);
>> 175 struct tipc_subscriber *subscriber = sub->subscriber;
>> 176
>> 177 atomic_dec(&tn->subscription_count);
>> 178 kfree(sub);
>> 179 tipc_subscrb_put(subscriber);
>> 180 }
>> 181
>> 182 void tipc_subscrp_put(struct tipc_subscription *subscription)
>> 183 {
>> 184 kref_put(&subscription->kref, tipc_subscrp_kref_release);
>> 185 }
>> 186
>> 187 void tipc_subscrp_get(struct tipc_subscription *subscription)
127 { 188 {
128 kref_get(&subscription->kref); 189 kref_get(&subscription->kref);
129 } 190 }
130 191
131 struct tipc_subscription *tipc_sub_subscribe(s !! 192 /* tipc_subscrb_subscrp_delete - delete a specific subscription or all
132 s !! 193 * subscriptions for a given subscriber.
133 i !! 194 */
134 { !! 195 static void tipc_subscrb_subscrp_delete(struct tipc_subscriber *subscriber,
135 u32 lower = tipc_sub_read(s, seq.lower !! 196 struct tipc_subscr *s)
136 u32 upper = tipc_sub_read(s, seq.upper !! 197 {
137 u32 filter = tipc_sub_read(s, filter); !! 198 struct list_head *subscription_list = &subscriber->subscrp_list;
>> 199 struct tipc_subscription *sub, *temp;
>> 200
>> 201 spin_lock_bh(&subscriber->lock);
>> 202 list_for_each_entry_safe(sub, temp, subscription_list, subscrp_list) {
>> 203 if (s && memcmp(s, &sub->evt.s, sizeof(struct tipc_subscr)))
>> 204 continue;
>> 205
>> 206 tipc_nametbl_unsubscribe(sub);
>> 207 list_del(&sub->subscrp_list);
>> 208 tipc_subscrp_delete(sub);
>> 209
>> 210 if (s)
>> 211 break;
>> 212 }
>> 213 spin_unlock_bh(&subscriber->lock);
>> 214 }
>> 215
>> 216 static struct tipc_subscriber *tipc_subscrb_create(int conid)
>> 217 {
>> 218 struct tipc_subscriber *subscriber;
>> 219
>> 220 subscriber = kzalloc(sizeof(*subscriber), GFP_ATOMIC);
>> 221 if (!subscriber) {
>> 222 pr_warn("Subscriber rejected, no memory\n");
>> 223 return NULL;
>> 224 }
>> 225 INIT_LIST_HEAD(&subscriber->subscrp_list);
>> 226 kref_init(&subscriber->kref);
>> 227 subscriber->conid = conid;
>> 228 spin_lock_init(&subscriber->lock);
>> 229
>> 230 return subscriber;
>> 231 }
>> 232
>> 233 static void tipc_subscrb_delete(struct tipc_subscriber *subscriber)
>> 234 {
>> 235 tipc_subscrb_subscrp_delete(subscriber, NULL);
>> 236 tipc_subscrb_put(subscriber);
>> 237 }
>> 238
>> 239 static void tipc_subscrp_delete(struct tipc_subscription *sub)
>> 240 {
>> 241 u32 timeout = htohl(sub->evt.s.timeout, sub->swap);
>> 242
>> 243 if (timeout == TIPC_WAIT_FOREVER || del_timer(&sub->timer))
>> 244 tipc_subscrp_put(sub);
>> 245 }
>> 246
>> 247 static void tipc_subscrp_cancel(struct tipc_subscr *s,
>> 248 struct tipc_subscriber *subscriber)
>> 249 {
>> 250 tipc_subscrb_subscrp_delete(subscriber, s);
>> 251 }
>> 252
>> 253 static struct tipc_subscription *tipc_subscrp_create(struct net *net,
>> 254 struct tipc_subscr *s,
>> 255 int swap)
>> 256 {
>> 257 struct tipc_net *tn = net_generic(net, tipc_net_id);
138 struct tipc_subscription *sub; 258 struct tipc_subscription *sub;
139 u32 timeout; !! 259 u32 filter = htohl(s->filter, swap);
140 260
141 if ((filter & TIPC_SUB_PORTS && filter !! 261 /* Refuse subscription if global limit exceeded */
142 lower > upper) { !! 262 if (atomic_read(&tn->subscription_count) >= TIPC_MAX_SUBSCRIPTIONS) {
143 pr_warn("Subscription rejected !! 263 pr_warn("Subscription rejected, limit reached (%u)\n",
>> 264 TIPC_MAX_SUBSCRIPTIONS);
144 return NULL; 265 return NULL;
145 } 266 }
>> 267
>> 268 /* Allocate subscription object */
146 sub = kmalloc(sizeof(*sub), GFP_ATOMIC 269 sub = kmalloc(sizeof(*sub), GFP_ATOMIC);
147 if (!sub) { 270 if (!sub) {
148 pr_warn("Subscription rejected 271 pr_warn("Subscription rejected, no memory\n");
149 return NULL; 272 return NULL;
150 } 273 }
151 INIT_LIST_HEAD(&sub->service_list); !! 274
152 INIT_LIST_HEAD(&sub->sub_list); !! 275 /* Initialize subscription object */
153 sub->net = net; 276 sub->net = net;
154 sub->conid = conid; !! 277 if (((filter & TIPC_SUB_PORTS) && (filter & TIPC_SUB_SERVICE)) ||
155 sub->inactive = false; !! 278 (htohl(s->seq.lower, swap) > htohl(s->seq.upper, swap))) {
156 memcpy(&sub->evt.s, s, sizeof(*s)); !! 279 pr_warn("Subscription rejected, illegal request\n");
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); 280 kfree(sub);
167 return NULL; 281 return NULL;
168 } 282 }
169 timer_setup(&sub->timer, tipc_sub_time !! 283
170 timeout = tipc_sub_read(&sub->evt.s, t !! 284 sub->swap = swap;
>> 285 memcpy(&sub->evt.s, s, sizeof(*s));
>> 286 atomic_inc(&tn->subscription_count);
>> 287 kref_init(&sub->kref);
>> 288 return sub;
>> 289 }
>> 290
>> 291 static void tipc_subscrp_subscribe(struct net *net, struct tipc_subscr *s,
>> 292 struct tipc_subscriber *subscriber, int swap)
>> 293 {
>> 294 struct tipc_net *tn = net_generic(net, tipc_net_id);
>> 295 struct tipc_subscription *sub = NULL;
>> 296 u32 timeout;
>> 297
>> 298 sub = tipc_subscrp_create(net, s, swap);
>> 299 if (!sub)
>> 300 return tipc_conn_terminate(tn->topsrv, subscriber->conid);
>> 301
>> 302 spin_lock_bh(&subscriber->lock);
>> 303 list_add(&sub->subscrp_list, &subscriber->subscrp_list);
>> 304 sub->subscriber = subscriber;
>> 305 tipc_nametbl_subscribe(sub);
>> 306 tipc_subscrb_get(subscriber);
>> 307 spin_unlock_bh(&subscriber->lock);
>> 308
>> 309 setup_timer(&sub->timer, tipc_subscrp_timeout, (unsigned long)sub);
>> 310 timeout = htohl(sub->evt.s.timeout, swap);
>> 311
171 if (timeout != TIPC_WAIT_FOREVER) 312 if (timeout != TIPC_WAIT_FOREVER)
172 mod_timer(&sub->timer, jiffies 313 mod_timer(&sub->timer, jiffies + msecs_to_jiffies(timeout));
173 return sub; <<
174 } 314 }
175 315
176 void tipc_sub_unsubscribe(struct tipc_subscrip !! 316 /* Handle one termination request for the subscriber */
>> 317 static void tipc_subscrb_release_cb(int conid, void *usr_data)
177 { 318 {
178 tipc_nametbl_unsubscribe(sub); !! 319 tipc_subscrb_delete((struct tipc_subscriber *)usr_data);
179 if (sub->evt.s.timeout != TIPC_WAIT_FO !! 320 }
180 del_timer_sync(&sub->timer); !! 321
181 list_del(&sub->sub_list); !! 322 /* Handle one request to create a new subscription for the subscriber */
182 tipc_sub_put(sub); !! 323 static void tipc_subscrb_rcv_cb(struct net *net, int conid,
>> 324 struct sockaddr_tipc *addr, void *usr_data,
>> 325 void *buf, size_t len)
>> 326 {
>> 327 struct tipc_subscriber *subscriber = usr_data;
>> 328 struct tipc_subscr *s = (struct tipc_subscr *)buf;
>> 329 int swap;
>> 330
>> 331 /* Determine subscriber's endianness */
>> 332 swap = !(s->filter & (TIPC_SUB_PORTS | TIPC_SUB_SERVICE |
>> 333 TIPC_SUB_CANCEL));
>> 334
>> 335 /* Detect & process a subscription cancellation request */
>> 336 if (s->filter & htohl(TIPC_SUB_CANCEL, swap)) {
>> 337 s->filter &= ~htohl(TIPC_SUB_CANCEL, swap);
>> 338 return tipc_subscrp_cancel(s, subscriber);
>> 339 }
>> 340
>> 341 tipc_subscrp_subscribe(net, s, subscriber, swap);
>> 342 }
>> 343
>> 344 /* Handle one request to establish a new subscriber */
>> 345 static void *tipc_subscrb_connect_cb(int conid)
>> 346 {
>> 347 return (void *)tipc_subscrb_create(conid);
>> 348 }
>> 349
>> 350 int tipc_topsrv_start(struct net *net)
>> 351 {
>> 352 struct tipc_net *tn = net_generic(net, tipc_net_id);
>> 353 const char name[] = "topology_server";
>> 354 struct tipc_server *topsrv;
>> 355 struct sockaddr_tipc *saddr;
>> 356
>> 357 saddr = kzalloc(sizeof(*saddr), GFP_ATOMIC);
>> 358 if (!saddr)
>> 359 return -ENOMEM;
>> 360 saddr->family = AF_TIPC;
>> 361 saddr->addrtype = TIPC_ADDR_NAMESEQ;
>> 362 saddr->addr.nameseq.type = TIPC_TOP_SRV;
>> 363 saddr->addr.nameseq.lower = TIPC_TOP_SRV;
>> 364 saddr->addr.nameseq.upper = TIPC_TOP_SRV;
>> 365 saddr->scope = TIPC_NODE_SCOPE;
>> 366
>> 367 topsrv = kzalloc(sizeof(*topsrv), GFP_ATOMIC);
>> 368 if (!topsrv) {
>> 369 kfree(saddr);
>> 370 return -ENOMEM;
>> 371 }
>> 372 topsrv->net = net;
>> 373 topsrv->saddr = saddr;
>> 374 topsrv->imp = TIPC_CRITICAL_IMPORTANCE;
>> 375 topsrv->type = SOCK_SEQPACKET;
>> 376 topsrv->max_rcvbuf_size = sizeof(struct tipc_subscr);
>> 377 topsrv->tipc_conn_recvmsg = tipc_subscrb_rcv_cb;
>> 378 topsrv->tipc_conn_new = tipc_subscrb_connect_cb;
>> 379 topsrv->tipc_conn_release = tipc_subscrb_release_cb;
>> 380
>> 381 strncpy(topsrv->name, name, strlen(name) + 1);
>> 382 tn->topsrv = topsrv;
>> 383 atomic_set(&tn->subscription_count, 0);
>> 384
>> 385 return tipc_server_start(topsrv);
>> 386 }
>> 387
>> 388 void tipc_topsrv_stop(struct net *net)
>> 389 {
>> 390 struct tipc_net *tn = net_generic(net, tipc_net_id);
>> 391 struct tipc_server *topsrv = tn->topsrv;
>> 392
>> 393 tipc_server_stop(topsrv);
>> 394 kfree(topsrv->saddr);
>> 395 kfree(topsrv);
183 } 396 }
184 397
Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.