3 * Copyright (C) 1999, 2004 Manfred Spraul
5 * This file is released under GNU General Public Licence version 2 or
6 * (at your option) any later version.
8 * See the file COPYING for more details.
11 #include <linux/spinlock.h>
12 #include <linux/init.h>
13 #include <linux/security.h>
14 #include <linux/slab.h>
15 #include <linux/ipc.h>
16 #include <linux/ipc_namespace.h>
17 #include <asm/uaccess.h>
21 DEFINE_SPINLOCK(mq_lock
);
24 * The next 2 defines are here bc this is the only file
25 * compiled when either CONFIG_SYSVIPC and CONFIG_POSIX_MQUEUE
26 * and not CONFIG_IPC_NS.
28 struct ipc_namespace init_ipc_ns
= {
29 .count
= ATOMIC_INIT(1),
30 #ifdef CONFIG_POSIX_MQUEUE
31 .mq_queues_max
= DFLT_QUEUESMAX
,
32 .mq_msg_max
= DFLT_MSGMAX
,
33 .mq_msgsize_max
= DFLT_MSGSIZEMAX
,
37 atomic_t nr_ipc_ns
= ATOMIC_INIT(1);
40 struct msg_msgseg
* next
;
41 /* the next part of the message follows immediately */
44 #define DATALEN_MSG (PAGE_SIZE-sizeof(struct msg_msg))
45 #define DATALEN_SEG (PAGE_SIZE-sizeof(struct msg_msgseg))
47 struct msg_msg
*load_msg(const void __user
*src
, int len
)
50 struct msg_msgseg
**pseg
;
55 if (alen
> DATALEN_MSG
)
58 msg
= kmalloc(sizeof(*msg
) + alen
, GFP_KERNEL
);
60 return ERR_PTR(-ENOMEM
);
65 if (copy_from_user(msg
+ 1, src
, alen
)) {
71 src
= ((char __user
*)src
) + alen
;
74 struct msg_msgseg
*seg
;
76 if (alen
> DATALEN_SEG
)
78 seg
= kmalloc(sizeof(*seg
) + alen
,
86 if (copy_from_user(seg
+ 1, src
, alen
)) {
92 src
= ((char __user
*)src
) + alen
;
95 err
= security_msg_msg_alloc(msg
);
106 int store_msg(void __user
*dest
, struct msg_msg
*msg
, int len
)
109 struct msg_msgseg
*seg
;
112 if (alen
> DATALEN_MSG
)
114 if (copy_to_user(dest
, msg
+ 1, alen
))
118 dest
= ((char __user
*)dest
) + alen
;
122 if (alen
> DATALEN_SEG
)
124 if (copy_to_user(dest
, seg
+ 1, alen
))
127 dest
= ((char __user
*)dest
) + alen
;
133 void free_msg(struct msg_msg
*msg
)
135 struct msg_msgseg
*seg
;
137 security_msg_msg_free(msg
);
141 while (seg
!= NULL
) {
142 struct msg_msgseg
*tmp
= seg
->next
;