forked from gregkh/kdbus
-
Notifications
You must be signed in to change notification settings - Fork 0
/
connection.c
1548 lines (1303 loc) · 37.8 KB
/
connection.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* Copyright (C) 2013-2014 Kay Sievers
* Copyright (C) 2013-2014 Greg Kroah-Hartman <gregkh@linuxfoundation.org>
* Copyright (C) 2013-2014 Daniel Mack <daniel@zonque.org>
* Copyright (C) 2013-2014 Linux Foundation
*
* kdbus is free software; you can redistribute it and/or modify it under
* the terms of the GNU Lesser General Public License as published by the
* Free Software Foundation; either version 2.1 of the License, or (at
* your option) any later version.
*/
#include <linux/audit.h>
#include <linux/device.h>
#include <linux/file.h>
#include <linux/fs.h>
#include <linux/hashtable.h>
#include <linux/idr.h>
#include <linux/init.h>
#include <linux/math64.h>
#include <linux/mm.h>
#include <linux/module.h>
#include <linux/mutex.h>
#include <linux/poll.h>
#include <linux/sched.h>
#include <linux/shmem_fs.h>
#include <linux/sizes.h>
#include <linux/slab.h>
#include <linux/syscalls.h>
#include "bus.h"
#include "connection.h"
#include "endpoint.h"
#include "match.h"
#include "message.h"
#include "metadata.h"
#include "names.h"
#include "domain.h"
#include "notify.h"
#include "policy.h"
#include "util.h"
#include "queue.h"
struct kdbus_conn_reply;
/**
* struct kdbus_conn_reply - an entry of kdbus_conn's list of replies
* @entry: The entry of the connection's reply_list
* @conn: The counterpart connection that is expected to answer
* @queue_entry: The queue enty item that is prepared by the replying
* connection
* @deadline_ns: The deadline of the reply, in nanoseconds
* @cookie: The cookie of the requesting message
* @wait: The waitqueue for synchronous I/O
* @sync: The reply block is waiting for synchronous I/O
* @waiting: The condition to synchronously wait for
* @err: The error code for the synchronous reply
*/
struct kdbus_conn_reply {
struct list_head entry;
struct kdbus_conn *conn;
struct kdbus_queue_entry *queue_entry;
u64 deadline_ns;
u64 cookie;
wait_queue_head_t wait;
bool sync:1;
bool waiting:1;
int err;
};
static void kdbus_conn_reply_free(struct kdbus_conn_reply *reply)
{
atomic_dec(&reply->conn->reply_count);
kdbus_conn_unref(reply->conn);
kfree(reply);
}
static void kdbus_conn_reply_sync(struct kdbus_conn_reply *reply, int err)
{
BUG_ON(!reply->sync);
list_del(&reply->entry);
reply->waiting = false;
reply->err = err;
wake_up_interruptible(&reply->wait);
}
/*
* Check for maximum number of messages per individual user. This
* should prevent a single user from being able to fill the receiver's
* queue.
*/
static int kdbus_conn_queue_user_quota(struct kdbus_conn *conn,
const struct kdbus_conn *conn_src,
struct kdbus_queue_entry *entry)
{
unsigned int user;
if (!conn_src)
return 0;
if (kdbus_bus_uid_is_privileged(conn->bus))
return 0;
/*
* Only after the queue grows above the maximum number of messages
* per individual user, we start to count all further messages
* from the sending users.
*/
if (conn->queue.msg_count < KDBUS_CONN_MAX_MSGS_PER_USER)
return 0;
user = conn_src->user->idr;
/* extend array to store the user message counters */
if (user >= conn->msg_users_max) {
unsigned int *users;
unsigned int i;
i = 8 + KDBUS_ALIGN8(user);
users = kcalloc(i, sizeof(unsigned int), GFP_KERNEL);
if (!users)
return -ENOMEM;
memcpy(users, conn->msg_users,
sizeof(unsigned int) * conn->msg_users_max);
kfree(conn->msg_users);
conn->msg_users = users;
conn->msg_users_max = i;
}
if (conn->msg_users[user] > KDBUS_CONN_MAX_MSGS_PER_USER)
return -ENOBUFS;
conn->msg_users[user]++;
entry->user = user;
return 0;
}
static void kdbus_conn_work(struct work_struct *work)
{
struct kdbus_conn *conn;
struct kdbus_conn_reply *reply, *reply_tmp;
LIST_HEAD(reply_list);
u64 deadline = ~0ULL;
struct timespec ts;
u64 now;
conn = container_of(work, struct kdbus_conn, work.work);
ktime_get_ts(&ts);
now = timespec_to_ns(&ts);
mutex_lock(&conn->lock);
if (!kdbus_conn_active(conn)) {
mutex_unlock(&conn->lock);
return;
}
list_for_each_entry_safe(reply, reply_tmp, &conn->reply_list, entry) {
/*
* If the reply block is waiting for synchronous I/O,
* the timeout is handled by wait_event_*_timeout(),
* so we don't have to care for it here.
*/
if (reply->sync)
continue;
if (reply->deadline_ns > now) {
/* remember next timeout */
if (deadline > reply->deadline_ns)
deadline = reply->deadline_ns;
continue;
}
/*
* Move to temporary cleanup list; we cannot unref and
* possibly cleanup a connection that is holding a ref
* back to us, while we are locking ourselves.
*/
list_move_tail(&reply->entry, &reply_list);
/*
* A zero deadline means the connection died, was
* cleaned up already and the notify sent.
*/
if (reply->deadline_ns == 0)
continue;
kdbus_notify_reply_timeout(conn->bus, reply->conn->id,
reply->cookie);
}
/* rearm delayed work with next timeout */
if (deadline != ~0ULL) {
u64 usecs = div_u64(deadline - now, 1000ULL);
schedule_delayed_work(&conn->work, usecs_to_jiffies(usecs));
}
mutex_unlock(&conn->lock);
kdbus_notify_flush(conn->bus);
list_for_each_entry_safe(reply, reply_tmp, &reply_list, entry)
kdbus_conn_reply_free(reply);
}
/**
* kdbus_cmd_msg_recv() - receive a message from the queue
* @conn: Connection to work on
* @recv: The command as passed in by the ioctl
*
* Return: 0 on success, negative errno on failure
*/
int kdbus_cmd_msg_recv(struct kdbus_conn *conn,
struct kdbus_cmd_recv *recv)
{
struct kdbus_queue_entry *entry = NULL;
int ret;
if (recv->offset > 0)
return -EINVAL;
mutex_lock(&conn->lock);
ret = kdbus_queue_entry_peek(&conn->queue,
recv->priority,
recv->flags & KDBUS_RECV_USE_PRIORITY,
&entry);
if (ret < 0)
goto exit_unlock;
BUG_ON(!entry);
/* just drop the message */
if (recv->flags & KDBUS_RECV_DROP) {
struct kdbus_conn_reply *reply = NULL;
bool reply_found = false;
if (entry->reply) {
struct kdbus_conn_reply *r;
/*
* Walk the list of pending replies and see if the
* one attached to this entry item is stil there.
* It might have been removed by an incoming reply,
* and we currently don't track reply entries in that
* direction in order to prevent potentially dangling
* pointers.
*/
list_for_each_entry(r, &conn->reply_list, entry) {
if (r == entry->reply) {
reply_found = true;
break;
}
}
}
if (reply_found) {
if (entry->reply->sync) {
kdbus_conn_reply_sync(entry->reply, -EPIPE);
} else {
list_del(&entry->reply->entry);
reply = entry->reply;
}
kdbus_notify_reply_dead(conn->bus,
entry->src_id,
entry->cookie);
}
kdbus_queue_entry_remove(conn, entry);
kdbus_pool_slice_free(entry->slice);
mutex_unlock(&conn->lock);
if (reply)
kdbus_conn_reply_free(reply);
kdbus_queue_entry_free(entry);
goto exit;
}
/* Give the offset back to the caller. */
recv->offset = kdbus_pool_slice_offset(entry->slice);
/*
* Just return the location of the next message. Do not install
* file descriptors or anything else. This is usually used to
* determine the sender of the next queued message.
*
* File descriptor numbers referenced in the message items
* are undefined, they are only valid with the full receive
* not with peek.
*/
if (recv->flags & KDBUS_RECV_PEEK) {
kdbus_pool_slice_flush(entry->slice);
goto exit_unlock;
}
ret = kdbus_queue_entry_install(entry);
kdbus_queue_entry_remove(conn, entry);
kdbus_queue_entry_free(entry);
exit_unlock:
mutex_unlock(&conn->lock);
exit:
kdbus_notify_flush(conn->bus);
return ret;
}
/**
* kdbus_cmd_msg_cancel() - cancel all pending sync requests
* with the given cookie
* @conn: The connection
* @cookie: The cookie
*
* Return: 0 on success, or -ENOENT if no pending request with that
* cookie was found.
*/
int kdbus_cmd_msg_cancel(struct kdbus_conn *conn,
u64 cookie)
{
struct kdbus_conn_reply *reply, *reply_tmp;
struct kdbus_conn *c;
bool found = false;
int i;
if (atomic_read(&conn->reply_count) == 0)
return -ENOENT;
/* lock order: domain -> bus -> ep -> names -> conn */
mutex_lock(&conn->bus->lock);
hash_for_each(conn->bus->conn_hash, i, c, hentry) {
if (c == conn)
continue;
mutex_lock(&c->lock);
list_for_each_entry_safe(reply, reply_tmp,
&c->reply_list, entry) {
if (reply->sync &&
reply->conn == conn &&
reply->cookie == cookie) {
kdbus_conn_reply_sync(reply, -ECANCELED);
found = true;
}
}
mutex_unlock(&c->lock);
}
mutex_unlock(&conn->bus->lock);
return found ? 0 : -ENOENT;
}
static int kdbus_conn_check_access(struct kdbus_ep *ep,
const struct kdbus_msg *msg,
struct kdbus_conn *conn_src,
struct kdbus_conn *conn_dst,
struct kdbus_conn_reply **reply_wake)
{
bool allowed = false;
int ret;
/*
* Walk the conn_src's list of expected replies.
* If there's any matching entry, allow the message to
* be sent, and remove the entry.
*/
if (reply_wake && msg->cookie_reply > 0) {
struct kdbus_conn_reply *r, *r_tmp;
LIST_HEAD(reply_list);
mutex_lock(&conn_src->lock);
list_for_each_entry_safe(r, r_tmp,
&conn_src->reply_list,
entry) {
if (r->conn == conn_dst &&
r->cookie == msg->cookie_reply) {
if (r->sync)
*reply_wake = r;
else
list_move_tail(&r->entry, &reply_list);
allowed = true;
break;
}
}
mutex_unlock(&conn_src->lock);
list_for_each_entry_safe(r, r_tmp, &reply_list, entry)
kdbus_conn_reply_free(r);
}
if (allowed)
return 0;
/* ... otherwise, ask the policy DBs for permission */
if (ep->policy_db) {
ret = kdbus_policy_check_talk_access(ep->policy_db,
conn_src, conn_dst);
if (ret < 0)
return ret;
}
if (ep->bus->policy_db) {
ret = kdbus_policy_check_talk_access(ep->bus->policy_db,
conn_src, conn_dst);
if (ret < 0)
return ret;
}
return 0;
}
static int kdbus_conn_add_expected_reply(struct kdbus_conn *conn_src,
struct kdbus_conn *conn_dst,
const struct kdbus_msg *msg,
struct kdbus_conn_reply **reply_wait)
{
bool sync = msg->flags & KDBUS_MSG_FLAGS_SYNC_REPLY;
struct kdbus_conn_reply *r;
struct timespec ts;
int ret = 0;
if (atomic_read(&conn_src->reply_count) >
KDBUS_CONN_MAX_REQUESTS_PENDING)
return -EMLINK;
mutex_lock(&conn_dst->lock);
if (!kdbus_conn_active(conn_dst)) {
ret = -ECONNRESET;
goto exit_unlock;
}
/*
* This message expects a reply, so let's interpret
* msg->timeout_ns and add a kdbus_conn_reply object.
* Add it to the list of expected replies on the
* destination connection.
* When a reply is received later on, this entry will
* be used to allow the reply to pass, circumventing the
* policy.
*/
r = kzalloc(sizeof(*r), GFP_KERNEL);
if (!r) {
ret = -ENOMEM;
goto exit_unlock;
}
r->conn = kdbus_conn_ref(conn_src);
r->cookie = msg->cookie;
if (sync) {
init_waitqueue_head(&r->wait);
r->sync = true;
r->waiting = true;
} else {
/* calculate the deadline based on the current time */
ktime_get_ts(&ts);
r->deadline_ns = timespec_to_ns(&ts) + msg->timeout_ns;
}
list_add(&r->entry, &conn_dst->reply_list);
atomic_inc(&conn_src->reply_count);
*reply_wait = r;
/*
* For async operation, schedule the scan now. It won't do
* any real work at this point, but walk the list of all
* pending replies and rearm the connection's delayed work
* to the closest entry.
* For synchronous operation, the timeout will be handled
* by wait_event_interruptible_timeout().
*/
if (!sync)
schedule_delayed_work(&conn_dst->work, 0);
exit_unlock:
mutex_unlock(&conn_dst->lock);
return ret;
}
/* enqueue a message into the receiver's pool */
static int kdbus_conn_entry_insert(struct kdbus_conn *conn,
struct kdbus_conn *conn_src,
const struct kdbus_kmsg *kmsg,
struct kdbus_conn_reply *reply)
{
struct kdbus_queue_entry *entry;
int ret;
/* limit the maximum number of queued messages */
if (!kdbus_bus_uid_is_privileged(conn->bus) &&
conn->queue.msg_count > KDBUS_CONN_MAX_MSGS)
return -ENOBUFS;
mutex_lock(&conn->lock);
if (!kdbus_conn_active(conn)) {
ret = -ECONNRESET;
goto exit_unlock;
}
if (kmsg->fds && !(conn->flags & KDBUS_HELLO_ACCEPT_FD)) {
ret = -ECOMM;
goto exit_unlock;
}
ret = kdbus_queue_entry_alloc(conn, kmsg, &entry);
if (ret < 0)
goto exit_unlock;
/* limit the number of queued messages from the same individual user */
ret = kdbus_conn_queue_user_quota(conn, conn_src, entry);
if (ret < 0)
goto exit_queue_free;
/*
* Remember the the reply associated with this queue entry, so we can
* move the reply entry's connection when a connection moves from an
* activator to an implementor.
*/
entry->reply = reply;
/* link the message into the receiver's entry */
kdbus_queue_entry_add(&conn->queue, entry);
mutex_unlock(&conn->lock);
/* wake up poll() */
wake_up_interruptible(&conn->wait);
return 0;
exit_queue_free:
kdbus_queue_entry_free(entry);
exit_unlock:
mutex_unlock(&conn->lock);
return ret;
}
/**
* kdbus_conn_kmsg_send() - send a message
* @ep: Endpoint to send from
* @conn_src: Connection, kernel-generated messages do not have one
* @kmsg: Message to send
*
* Return: 0 on success, negative errno on failure
*/
int kdbus_conn_kmsg_send(struct kdbus_ep *ep,
struct kdbus_conn *conn_src,
struct kdbus_kmsg *kmsg)
{
struct kdbus_conn_reply *reply_wait = NULL;
struct kdbus_conn_reply *reply_wake = NULL;
struct kdbus_name_entry *name_entry = NULL;
const struct kdbus_msg *msg = &kmsg->msg;
struct kdbus_conn *c, *conn_dst = NULL;
struct kdbus_bus *bus = ep->bus;
bool sync = msg->flags & KDBUS_MSG_FLAGS_SYNC_REPLY;
int ret = 0;
/* assign domain-global message sequence number */
BUG_ON(kmsg->seq > 0);
kmsg->seq = atomic64_inc_return(&bus->domain->msg_seq_last);
/* non-kernel senders append credentials/metadata */
if (conn_src) {
ret = kdbus_meta_new(&kmsg->meta);
if (ret < 0)
return ret;
}
if (msg->dst_id == KDBUS_DST_ID_BROADCAST) {
/* broadcast message */
unsigned int i;
mutex_lock(&bus->lock);
hash_for_each(bus->conn_hash, i, conn_dst, hentry) {
if (conn_dst->id == msg->src_id)
continue;
/*
* Activator connections will not receive any
* broadcast messages.
*/
if (conn_dst->type != KDBUS_CONN_CONNECTED &&
conn_dst->type != KDBUS_CONN_MONITOR)
continue;
if (!kdbus_match_db_match_kmsg(conn_dst->match_db,
conn_src, kmsg))
continue;
/*
* The first receiver which requests additional
* metadata causes the message to carry it; all
* receivers after that will see all of the added
* data, even when they did not ask for it.
*/
if (conn_src) {
ret = kdbus_meta_append(kmsg->meta,
conn_src, kmsg->seq,
conn_dst->attach_flags);
if (ret < 0) {
mutex_unlock(&bus->lock);
return ret;
}
}
kdbus_conn_entry_insert(conn_dst, conn_src, kmsg, NULL);
}
mutex_unlock(&bus->lock);
return 0;
}
if (msg->dst_id == KDBUS_DST_ID_NAME) {
/* unicast message to well-known name */
BUG_ON(!kmsg->dst_name);
name_entry = kdbus_name_lock(bus->name_registry,
kmsg->dst_name);
if (!name_entry)
return -ESRCH;
if (!name_entry->conn && name_entry->activator)
conn_dst = kdbus_conn_ref(name_entry->activator);
else
conn_dst = kdbus_conn_ref(name_entry->conn);
if ((msg->flags & KDBUS_MSG_FLAGS_NO_AUTO_START) &&
(conn_dst->type == KDBUS_CONN_ACTIVATOR)) {
ret = -EADDRNOTAVAIL;
goto exit_unref;
}
} else {
/* unicast message to unique name */
mutex_lock(&bus->lock);
conn_dst = kdbus_bus_find_conn_by_id(bus, msg->dst_id);
mutex_unlock(&bus->lock);
if (!conn_dst)
return -ENXIO;
/*
* Special-purpose connections are not allowed to be addressed
* via their unique IDs.
*/
if (conn_dst->type != KDBUS_CONN_CONNECTED) {
ret = -ENXIO;
goto exit_unref;
}
}
/*
* Record the sequence number of the registered name;
* it will be passed on to the queue, in case messages
* addressed to a name need to be moved from or to
* activator connections of the same name.
*/
if (name_entry)
kmsg->dst_name_id = name_entry->name_id;
if (conn_src) {
if (msg->flags & KDBUS_MSG_FLAGS_EXPECT_REPLY) {
ret = kdbus_conn_check_access(ep, msg, conn_src,
conn_dst, NULL);
if (ret < 0)
goto exit_unref;
ret = kdbus_conn_add_expected_reply(conn_src, conn_dst,
msg, &reply_wait);
if (ret < 0)
goto exit_unref;
} else {
ret = kdbus_conn_check_access(ep, msg, conn_src,
conn_dst, &reply_wake);
if (ret < 0)
goto exit_unref;
}
ret = kdbus_meta_append(kmsg->meta, conn_src, kmsg->seq,
conn_dst->attach_flags);
if (ret < 0)
goto exit_unref;
}
if (reply_wake) {
/*
* If we're synchronously responding to a message, allocate a
* queue item and attach it to the reply tracking object.
* The connection's queue will never get to see it.
*/
mutex_lock(&conn_dst->lock);
if (kdbus_conn_active(conn_dst))
ret = kdbus_queue_entry_alloc(conn_dst, kmsg,
&reply_wake->queue_entry);
else
ret = -ECONNRESET;
kdbus_conn_reply_sync(reply_wake, ret);
mutex_unlock(&conn_dst->lock);
} else {
/*
* Otherwise, put it in the queue and wait for the connection
* to dequeue and receive the message.
*/
ret = kdbus_conn_entry_insert(conn_dst, conn_src,
kmsg, reply_wait);
}
if (ret < 0)
goto exit_unref;
/* unlock name before sending monitors, bus-locking would deadlock */
name_entry = kdbus_name_unlock(bus->name_registry, name_entry);
/*
* Monitor connections get all messages; ignore possible errors
* when sending messages to monitor connections.
*/
mutex_lock(&bus->lock);
list_for_each_entry(c, &bus->monitors_list, monitor_entry) {
if (conn_src)
kdbus_meta_append(kmsg->meta, conn_src, kmsg->seq,
c->attach_flags);
kdbus_conn_entry_insert(c, NULL, kmsg, NULL);
}
mutex_unlock(&bus->lock);
if (sync) {
int r;
struct kdbus_queue_entry *entry;
u64 usecs = div_u64(msg->timeout_ns, 1000ULL);
BUG_ON(!reply_wait);
/*
* Block until the reply arrives. reply_wait is left untouched
* by the timeout scans that might be conducted for other,
* asynchronous replies of conn_src.
*/
r = wait_event_interruptible_timeout(reply_wait->wait,
!reply_wait->waiting,
usecs_to_jiffies(usecs));
if (r == 0)
ret = -ETIMEDOUT;
else if (r < 0)
ret = -EINTR;
else
ret = reply_wait->err;
/*
* If we weren't woken up sanely via kdbus_conn_reply_sync(),
* reply_wait->entry is dangling in the connection's
* reply_list and needs to be killed manually.
*/
if (r <= 0) {
mutex_lock(&conn_dst->lock);
list_del(&reply_wait->entry);
mutex_unlock(&conn_dst->lock);
}
mutex_lock(&conn_src->lock);
entry = reply_wait->queue_entry;
if (entry) {
if (ret == 0)
ret = kdbus_queue_entry_install(entry);
kmsg->msg.offset_reply =
kdbus_pool_slice_offset(entry->slice);
kdbus_queue_entry_free(entry);
}
mutex_unlock(&conn_src->lock);
kdbus_conn_reply_free(reply_wait);
}
exit_unref:
kdbus_conn_unref(conn_dst);
kdbus_name_unlock(bus->name_registry, name_entry);
return ret;
}
/**
* kdbus_conn_disconnect() - disconnect a connection
* @conn: The connection to disconnect
* @ensure_queue_empty: Flag to indicate if the call should fail in
* case the connection's message list is not
* empty
*
* If @ensure_msg_list_empty is true, and the connection has pending messages,
* -EBUSY is returned.
*
* Return: 0 on success, negative errno on failure
*/
int kdbus_conn_disconnect(struct kdbus_conn *conn, bool ensure_queue_empty)
{
struct kdbus_conn_reply *reply, *reply_tmp;
struct kdbus_queue_entry *entry, *tmp;
LIST_HEAD(reply_list);
mutex_lock(&conn->lock);
if (!kdbus_conn_active(conn)) {
mutex_unlock(&conn->lock);
return -EOPNOTSUPP;
}
if (ensure_queue_empty && !list_empty(&conn->queue.msg_list)) {
mutex_unlock(&conn->lock);
return -EBUSY;
}
conn->type = KDBUS_CONN_DISCONNECTED;
mutex_unlock(&conn->lock);
cancel_delayed_work_sync(&conn->work);
/* lock order: domain -> bus -> ep -> names -> conn */
mutex_lock(&conn->bus->lock);
mutex_lock(&conn->ep->lock);
/* remove from bus and endpoint */
hash_del(&conn->hentry);
list_del(&conn->monitor_entry);
list_del(&conn->ep_entry);
mutex_unlock(&conn->ep->lock);
mutex_unlock(&conn->bus->lock);
/*
* Remove all names associated with this connection; this possibly
* moves queued messages back to the activator connection.
*/
kdbus_name_remove_by_conn(conn->bus->name_registry, conn);
/* if we die while other connections wait for our reply, notify them */
mutex_lock(&conn->lock);
list_for_each_entry_safe(entry, tmp, &conn->queue.msg_list, entry) {
if (entry->reply)
kdbus_notify_reply_dead(conn->bus, entry->src_id,
entry->cookie);
kdbus_queue_entry_remove(conn, entry);
kdbus_pool_slice_free(entry->slice);
kdbus_queue_entry_free(entry);
}
list_splice_init(&conn->reply_list, &reply_list);
mutex_unlock(&conn->lock);
list_for_each_entry_safe(reply, reply_tmp, &reply_list, entry) {
if (reply->sync) {
kdbus_conn_reply_sync(reply, -EPIPE);
continue;
}
/* send a 'connection dead' notification */
kdbus_notify_reply_dead(conn->bus, reply->conn->id,
reply->cookie);
/* mark entry as handled, and trigger the timeout handler */
mutex_lock(&reply->conn->lock);
if (kdbus_conn_active(conn)) {
reply->deadline_ns = 0;
schedule_delayed_work(&reply->conn->work, 0);
}
mutex_unlock(&reply->conn->lock);
list_del(&reply->entry);
kdbus_conn_reply_free(reply);
}
/* wake up the entry so that users can get a POLLERR */
wake_up_interruptible(&conn->wait);
kdbus_notify_id_change(conn->bus, KDBUS_ITEM_ID_REMOVE, conn->id,
conn->flags);
kdbus_notify_flush(conn->bus);
return 0;
}
/**
* kdbus_conn_active() - connection is not disconnected
* @conn: Connection to check
*
* Return: true if the connection is still active
*/
bool kdbus_conn_active(const struct kdbus_conn *conn)
{
return conn->type != KDBUS_CONN_DISCONNECTED;
}
/**
* kdbus_conn_flush_policy() - flush all cached policy entries that
* refer to a connecion
* @conn: Connection to check
*/
void kdbus_conn_purge_policy_cache(struct kdbus_conn *conn)
{
if (conn->ep->policy_db)
kdbus_policy_purge_cache(conn->ep->policy_db, conn);
if (conn->bus->policy_db)
kdbus_policy_purge_cache(conn->bus->policy_db, conn);
}
static void __kdbus_conn_free(struct kref *kref)
{
struct kdbus_conn *conn = container_of(kref, struct kdbus_conn, kref);
BUG_ON(kdbus_conn_active(conn));
BUG_ON(delayed_work_pending(&conn->work));
BUG_ON(!list_empty(&conn->queue.msg_list));
BUG_ON(!list_empty(&conn->names_list));
BUG_ON(!list_empty(&conn->names_queue_list));
BUG_ON(!list_empty(&conn->reply_list));
atomic_dec(&conn->user->connections);
kdbus_domain_user_unref(conn->user);
kdbus_conn_purge_policy_cache(conn);
if (conn->bus->policy_db)
kdbus_policy_remove_owner(conn->bus->policy_db, conn);
kdbus_meta_free(conn->owner_meta);
kdbus_match_db_free(conn->match_db);
kdbus_pool_free(conn->pool);
kdbus_ep_unref(conn->ep);
kdbus_bus_unref(conn->bus);
put_cred(conn->cred);
kfree(conn->name);
kfree(conn);
}
/**
* kdbus_conn_ref() - take a connection reference
* @conn: Connection
*
* Return: the connection itself
*/
struct kdbus_conn *kdbus_conn_ref(struct kdbus_conn *conn)
{
kref_get(&conn->kref);
return conn;
}
/**
* kdbus_conn_unref() - drop a connection reference
* @conn: Connection (may be NULL)
*
* When the last reference is dropped, the connection's internal structure
* is freed.
*
* Return: NULL
*/
struct kdbus_conn *kdbus_conn_unref(struct kdbus_conn *conn)
{
if (!conn)
return NULL;
kref_put(&conn->kref, __kdbus_conn_free);
return NULL;
}
/**
* kdbus_conn_move_messages() - move messages from one connection to another
* @conn_dst: Connection to copy to
* @conn_src: Connection to copy from
* @name_id: Filter for the sequence number of the registered
* name, 0 means no filtering.
*
* Move all messages from one connection to another. This is used when
* an implementor connection is taking over/giving back a well-known name
* from/to an activator connection.
*
* Return: 0 on success, negative errno on failure.
*/
int kdbus_conn_move_messages(struct kdbus_conn *conn_dst,
struct kdbus_conn *conn_src,
u64 name_id)
{
struct kdbus_queue_entry *q, *q_tmp;
LIST_HEAD(reply_list);
LIST_HEAD(msg_list);
int ret = 0;
BUG_ON(!mutex_is_locked(&conn_dst->bus->lock));
BUG_ON(conn_src == conn_dst);
/* remove all messages from the source */
mutex_lock(&conn_src->lock);
list_splice_init(&conn_src->reply_list, &reply_list);
list_for_each_entry_safe(q, q_tmp, &conn_src->queue.msg_list, entry) {
kdbus_queue_entry_remove(conn_src, q);
list_add_tail(&q->entry, &msg_list);
}
mutex_unlock(&conn_src->lock);