messaging.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465
  1. /**
  2. * eCryptfs: Linux filesystem encryption layer
  3. *
  4. * Copyright (C) 2004-2008 International Business Machines Corp.
  5. * Author(s): Michael A. Halcrow <mhalcrow@us.ibm.com>
  6. * Tyler Hicks <tyhicks@ou.edu>
  7. *
  8. * This program is free software; you can redistribute it and/or
  9. * modify it under the terms of the GNU General Public License version
  10. * 2 as published by the Free Software Foundation.
  11. *
  12. * This program is distributed in the hope that it will be useful, but
  13. * WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  15. * General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License
  18. * along with this program; if not, write to the Free Software
  19. * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
  20. * 02111-1307, USA.
  21. */
  22. #include <linux/sched.h>
  23. #include <linux/slab.h>
  24. #include <linux/user_namespace.h>
  25. #include <linux/nsproxy.h>
  26. #include "ecryptfs_kernel.h"
  27. static LIST_HEAD(ecryptfs_msg_ctx_free_list);
  28. static LIST_HEAD(ecryptfs_msg_ctx_alloc_list);
  29. static struct mutex ecryptfs_msg_ctx_lists_mux;
  30. static struct hlist_head *ecryptfs_daemon_hash;
  31. struct mutex ecryptfs_daemon_hash_mux;
  32. static int ecryptfs_hash_bits;
  33. #define ecryptfs_current_euid_hash(uid) \
  34. hash_long((unsigned long)from_kuid(&init_user_ns, current_euid()), ecryptfs_hash_bits)
  35. static u32 ecryptfs_msg_counter;
  36. static struct ecryptfs_msg_ctx *ecryptfs_msg_ctx_arr;
  37. /**
  38. * ecryptfs_acquire_free_msg_ctx
  39. * @msg_ctx: The context that was acquired from the free list
  40. *
  41. * Acquires a context element from the free list and locks the mutex
  42. * on the context. Sets the msg_ctx task to current. Returns zero on
  43. * success; non-zero on error or upon failure to acquire a free
  44. * context element. Must be called with ecryptfs_msg_ctx_lists_mux
  45. * held.
  46. */
  47. static int ecryptfs_acquire_free_msg_ctx(struct ecryptfs_msg_ctx **msg_ctx)
  48. {
  49. struct list_head *p;
  50. int rc;
  51. if (list_empty(&ecryptfs_msg_ctx_free_list)) {
  52. printk(KERN_WARNING "%s: The eCryptfs free "
  53. "context list is empty. It may be helpful to "
  54. "specify the ecryptfs_message_buf_len "
  55. "parameter to be greater than the current "
  56. "value of [%d]\n", __func__, ecryptfs_message_buf_len);
  57. rc = -ENOMEM;
  58. goto out;
  59. }
  60. list_for_each(p, &ecryptfs_msg_ctx_free_list) {
  61. *msg_ctx = list_entry(p, struct ecryptfs_msg_ctx, node);
  62. if (mutex_trylock(&(*msg_ctx)->mux)) {
  63. (*msg_ctx)->task = current;
  64. rc = 0;
  65. goto out;
  66. }
  67. }
  68. rc = -ENOMEM;
  69. out:
  70. return rc;
  71. }
  72. /**
  73. * ecryptfs_msg_ctx_free_to_alloc
  74. * @msg_ctx: The context to move from the free list to the alloc list
  75. *
  76. * Must be called with ecryptfs_msg_ctx_lists_mux held.
  77. */
  78. static void ecryptfs_msg_ctx_free_to_alloc(struct ecryptfs_msg_ctx *msg_ctx)
  79. {
  80. list_move(&msg_ctx->node, &ecryptfs_msg_ctx_alloc_list);
  81. msg_ctx->state = ECRYPTFS_MSG_CTX_STATE_PENDING;
  82. msg_ctx->counter = ++ecryptfs_msg_counter;
  83. }
  84. /**
  85. * ecryptfs_msg_ctx_alloc_to_free
  86. * @msg_ctx: The context to move from the alloc list to the free list
  87. *
  88. * Must be called with ecryptfs_msg_ctx_lists_mux held.
  89. */
  90. void ecryptfs_msg_ctx_alloc_to_free(struct ecryptfs_msg_ctx *msg_ctx)
  91. {
  92. list_move(&(msg_ctx->node), &ecryptfs_msg_ctx_free_list);
  93. kfree(msg_ctx->msg);
  94. msg_ctx->msg = NULL;
  95. msg_ctx->state = ECRYPTFS_MSG_CTX_STATE_FREE;
  96. }
  97. /**
  98. * ecryptfs_find_daemon_by_euid
  99. * @daemon: If return value is zero, points to the desired daemon pointer
  100. *
  101. * Must be called with ecryptfs_daemon_hash_mux held.
  102. *
  103. * Search the hash list for the current effective user id.
  104. *
  105. * Returns zero if the user id exists in the list; non-zero otherwise.
  106. */
  107. int ecryptfs_find_daemon_by_euid(struct ecryptfs_daemon **daemon)
  108. {
  109. int rc;
  110. hlist_for_each_entry(*daemon,
  111. &ecryptfs_daemon_hash[ecryptfs_current_euid_hash()],
  112. euid_chain) {
  113. if (uid_eq((*daemon)->file->f_cred->euid, current_euid())) {
  114. rc = 0;
  115. goto out;
  116. }
  117. }
  118. rc = -EINVAL;
  119. out:
  120. return rc;
  121. }
  122. /**
  123. * ecryptfs_spawn_daemon - Create and initialize a new daemon struct
  124. * @daemon: Pointer to set to newly allocated daemon struct
  125. * @file: File used when opening /dev/ecryptfs
  126. *
  127. * Must be called ceremoniously while in possession of
  128. * ecryptfs_sacred_daemon_hash_mux
  129. *
  130. * Returns zero on success; non-zero otherwise
  131. */
  132. int
  133. ecryptfs_spawn_daemon(struct ecryptfs_daemon **daemon, struct file *file)
  134. {
  135. int rc = 0;
  136. (*daemon) = kzalloc(sizeof(**daemon), GFP_KERNEL);
  137. if (!(*daemon)) {
  138. rc = -ENOMEM;
  139. goto out;
  140. }
  141. (*daemon)->file = file;
  142. mutex_init(&(*daemon)->mux);
  143. INIT_LIST_HEAD(&(*daemon)->msg_ctx_out_queue);
  144. init_waitqueue_head(&(*daemon)->wait);
  145. (*daemon)->num_queued_msg_ctx = 0;
  146. hlist_add_head(&(*daemon)->euid_chain,
  147. &ecryptfs_daemon_hash[ecryptfs_current_euid_hash()]);
  148. out:
  149. return rc;
  150. }
  151. /**
  152. * ecryptfs_exorcise_daemon - Destroy the daemon struct
  153. *
  154. * Must be called ceremoniously while in possession of
  155. * ecryptfs_daemon_hash_mux and the daemon's own mux.
  156. */
  157. int ecryptfs_exorcise_daemon(struct ecryptfs_daemon *daemon)
  158. {
  159. struct ecryptfs_msg_ctx *msg_ctx, *msg_ctx_tmp;
  160. int rc = 0;
  161. mutex_lock(&daemon->mux);
  162. if ((daemon->flags & ECRYPTFS_DAEMON_IN_READ)
  163. || (daemon->flags & ECRYPTFS_DAEMON_IN_POLL)) {
  164. rc = -EBUSY;
  165. mutex_unlock(&daemon->mux);
  166. goto out;
  167. }
  168. list_for_each_entry_safe(msg_ctx, msg_ctx_tmp,
  169. &daemon->msg_ctx_out_queue, daemon_out_list) {
  170. list_del(&msg_ctx->daemon_out_list);
  171. daemon->num_queued_msg_ctx--;
  172. printk(KERN_WARNING "%s: Warning: dropping message that is in "
  173. "the out queue of a dying daemon\n", __func__);
  174. ecryptfs_msg_ctx_alloc_to_free(msg_ctx);
  175. }
  176. hlist_del(&daemon->euid_chain);
  177. mutex_unlock(&daemon->mux);
  178. kzfree(daemon);
  179. out:
  180. return rc;
  181. }
  182. /**
  183. * ecryptfs_process_reponse
  184. * @msg: The ecryptfs message received; the caller should sanity check
  185. * msg->data_len and free the memory
  186. * @seq: The sequence number of the message; must match the sequence
  187. * number for the existing message context waiting for this
  188. * response
  189. *
  190. * Processes a response message after sending an operation request to
  191. * userspace. Some other process is awaiting this response. Before
  192. * sending out its first communications, the other process allocated a
  193. * msg_ctx from the ecryptfs_msg_ctx_arr at a particular index. The
  194. * response message contains this index so that we can copy over the
  195. * response message into the msg_ctx that the process holds a
  196. * reference to. The other process is going to wake up, check to see
  197. * that msg_ctx->state == ECRYPTFS_MSG_CTX_STATE_DONE, and then
  198. * proceed to read off and process the response message. Returns zero
  199. * upon delivery to desired context element; non-zero upon delivery
  200. * failure or error.
  201. *
  202. * Returns zero on success; non-zero otherwise
  203. */
  204. int ecryptfs_process_response(struct ecryptfs_daemon *daemon,
  205. struct ecryptfs_message *msg, u32 seq)
  206. {
  207. struct ecryptfs_msg_ctx *msg_ctx;
  208. size_t msg_size;
  209. int rc;
  210. if (msg->index >= ecryptfs_message_buf_len) {
  211. rc = -EINVAL;
  212. printk(KERN_ERR "%s: Attempt to reference "
  213. "context buffer at index [%d]; maximum "
  214. "allowable is [%d]\n", __func__, msg->index,
  215. (ecryptfs_message_buf_len - 1));
  216. goto out;
  217. }
  218. msg_ctx = &ecryptfs_msg_ctx_arr[msg->index];
  219. mutex_lock(&msg_ctx->mux);
  220. if (msg_ctx->state != ECRYPTFS_MSG_CTX_STATE_PENDING) {
  221. rc = -EINVAL;
  222. printk(KERN_WARNING "%s: Desired context element is not "
  223. "pending a response\n", __func__);
  224. goto unlock;
  225. } else if (msg_ctx->counter != seq) {
  226. rc = -EINVAL;
  227. printk(KERN_WARNING "%s: Invalid message sequence; "
  228. "expected [%d]; received [%d]\n", __func__,
  229. msg_ctx->counter, seq);
  230. goto unlock;
  231. }
  232. msg_size = (sizeof(*msg) + msg->data_len);
  233. msg_ctx->msg = kmemdup(msg, msg_size, GFP_KERNEL);
  234. if (!msg_ctx->msg) {
  235. rc = -ENOMEM;
  236. goto unlock;
  237. }
  238. msg_ctx->state = ECRYPTFS_MSG_CTX_STATE_DONE;
  239. wake_up_process(msg_ctx->task);
  240. rc = 0;
  241. unlock:
  242. mutex_unlock(&msg_ctx->mux);
  243. out:
  244. return rc;
  245. }
  246. /**
  247. * ecryptfs_send_message_locked
  248. * @data: The data to send
  249. * @data_len: The length of data
  250. * @msg_ctx: The message context allocated for the send
  251. *
  252. * Must be called with ecryptfs_daemon_hash_mux held.
  253. *
  254. * Returns zero on success; non-zero otherwise
  255. */
  256. static int
  257. ecryptfs_send_message_locked(char *data, int data_len, u8 msg_type,
  258. struct ecryptfs_msg_ctx **msg_ctx)
  259. {
  260. struct ecryptfs_daemon *daemon;
  261. int rc;
  262. rc = ecryptfs_find_daemon_by_euid(&daemon);
  263. if (rc) {
  264. rc = -ENOTCONN;
  265. goto out;
  266. }
  267. mutex_lock(&ecryptfs_msg_ctx_lists_mux);
  268. rc = ecryptfs_acquire_free_msg_ctx(msg_ctx);
  269. if (rc) {
  270. mutex_unlock(&ecryptfs_msg_ctx_lists_mux);
  271. printk(KERN_WARNING "%s: Could not claim a free "
  272. "context element\n", __func__);
  273. goto out;
  274. }
  275. ecryptfs_msg_ctx_free_to_alloc(*msg_ctx);
  276. mutex_unlock(&(*msg_ctx)->mux);
  277. mutex_unlock(&ecryptfs_msg_ctx_lists_mux);
  278. rc = ecryptfs_send_miscdev(data, data_len, *msg_ctx, msg_type, 0,
  279. daemon);
  280. if (rc)
  281. printk(KERN_ERR "%s: Error attempting to send message to "
  282. "userspace daemon; rc = [%d]\n", __func__, rc);
  283. out:
  284. return rc;
  285. }
  286. /**
  287. * ecryptfs_send_message
  288. * @data: The data to send
  289. * @data_len: The length of data
  290. * @msg_ctx: The message context allocated for the send
  291. *
  292. * Grabs ecryptfs_daemon_hash_mux.
  293. *
  294. * Returns zero on success; non-zero otherwise
  295. */
  296. int ecryptfs_send_message(char *data, int data_len,
  297. struct ecryptfs_msg_ctx **msg_ctx)
  298. {
  299. int rc;
  300. mutex_lock(&ecryptfs_daemon_hash_mux);
  301. rc = ecryptfs_send_message_locked(data, data_len, ECRYPTFS_MSG_REQUEST,
  302. msg_ctx);
  303. mutex_unlock(&ecryptfs_daemon_hash_mux);
  304. return rc;
  305. }
  306. /**
  307. * ecryptfs_wait_for_response
  308. * @msg_ctx: The context that was assigned when sending a message
  309. * @msg: The incoming message from userspace; not set if rc != 0
  310. *
  311. * Sleeps until awaken by ecryptfs_receive_message or until the amount
  312. * of time exceeds ecryptfs_message_wait_timeout. If zero is
  313. * returned, msg will point to a valid message from userspace; a
  314. * non-zero value is returned upon failure to receive a message or an
  315. * error occurs. Callee must free @msg on success.
  316. */
  317. int ecryptfs_wait_for_response(struct ecryptfs_msg_ctx *msg_ctx,
  318. struct ecryptfs_message **msg)
  319. {
  320. signed long timeout = ecryptfs_message_wait_timeout * HZ;
  321. int rc = 0;
  322. sleep:
  323. timeout = schedule_timeout_interruptible(timeout);
  324. mutex_lock(&ecryptfs_msg_ctx_lists_mux);
  325. mutex_lock(&msg_ctx->mux);
  326. if (msg_ctx->state != ECRYPTFS_MSG_CTX_STATE_DONE) {
  327. if (timeout) {
  328. mutex_unlock(&msg_ctx->mux);
  329. mutex_unlock(&ecryptfs_msg_ctx_lists_mux);
  330. goto sleep;
  331. }
  332. rc = -ENOMSG;
  333. } else {
  334. *msg = msg_ctx->msg;
  335. msg_ctx->msg = NULL;
  336. }
  337. ecryptfs_msg_ctx_alloc_to_free(msg_ctx);
  338. mutex_unlock(&msg_ctx->mux);
  339. mutex_unlock(&ecryptfs_msg_ctx_lists_mux);
  340. return rc;
  341. }
  342. int __init ecryptfs_init_messaging(void)
  343. {
  344. int i;
  345. int rc = 0;
  346. if (ecryptfs_number_of_users > ECRYPTFS_MAX_NUM_USERS) {
  347. ecryptfs_number_of_users = ECRYPTFS_MAX_NUM_USERS;
  348. printk(KERN_WARNING "%s: Specified number of users is "
  349. "too large, defaulting to [%d] users\n", __func__,
  350. ecryptfs_number_of_users);
  351. }
  352. mutex_init(&ecryptfs_daemon_hash_mux);
  353. mutex_lock(&ecryptfs_daemon_hash_mux);
  354. ecryptfs_hash_bits = 1;
  355. while (ecryptfs_number_of_users >> ecryptfs_hash_bits)
  356. ecryptfs_hash_bits++;
  357. ecryptfs_daemon_hash = kmalloc((sizeof(struct hlist_head)
  358. * (1 << ecryptfs_hash_bits)),
  359. GFP_KERNEL);
  360. if (!ecryptfs_daemon_hash) {
  361. rc = -ENOMEM;
  362. mutex_unlock(&ecryptfs_daemon_hash_mux);
  363. goto out;
  364. }
  365. for (i = 0; i < (1 << ecryptfs_hash_bits); i++)
  366. INIT_HLIST_HEAD(&ecryptfs_daemon_hash[i]);
  367. mutex_unlock(&ecryptfs_daemon_hash_mux);
  368. ecryptfs_msg_ctx_arr = kmalloc((sizeof(struct ecryptfs_msg_ctx)
  369. * ecryptfs_message_buf_len),
  370. GFP_KERNEL);
  371. if (!ecryptfs_msg_ctx_arr) {
  372. kfree(ecryptfs_daemon_hash);
  373. rc = -ENOMEM;
  374. goto out;
  375. }
  376. mutex_init(&ecryptfs_msg_ctx_lists_mux);
  377. mutex_lock(&ecryptfs_msg_ctx_lists_mux);
  378. ecryptfs_msg_counter = 0;
  379. for (i = 0; i < ecryptfs_message_buf_len; i++) {
  380. INIT_LIST_HEAD(&ecryptfs_msg_ctx_arr[i].node);
  381. INIT_LIST_HEAD(&ecryptfs_msg_ctx_arr[i].daemon_out_list);
  382. mutex_init(&ecryptfs_msg_ctx_arr[i].mux);
  383. mutex_lock(&ecryptfs_msg_ctx_arr[i].mux);
  384. ecryptfs_msg_ctx_arr[i].index = i;
  385. ecryptfs_msg_ctx_arr[i].state = ECRYPTFS_MSG_CTX_STATE_FREE;
  386. ecryptfs_msg_ctx_arr[i].counter = 0;
  387. ecryptfs_msg_ctx_arr[i].task = NULL;
  388. ecryptfs_msg_ctx_arr[i].msg = NULL;
  389. list_add_tail(&ecryptfs_msg_ctx_arr[i].node,
  390. &ecryptfs_msg_ctx_free_list);
  391. mutex_unlock(&ecryptfs_msg_ctx_arr[i].mux);
  392. }
  393. mutex_unlock(&ecryptfs_msg_ctx_lists_mux);
  394. rc = ecryptfs_init_ecryptfs_miscdev();
  395. if (rc)
  396. ecryptfs_release_messaging();
  397. out:
  398. return rc;
  399. }
  400. void ecryptfs_release_messaging(void)
  401. {
  402. if (ecryptfs_msg_ctx_arr) {
  403. int i;
  404. mutex_lock(&ecryptfs_msg_ctx_lists_mux);
  405. for (i = 0; i < ecryptfs_message_buf_len; i++) {
  406. mutex_lock(&ecryptfs_msg_ctx_arr[i].mux);
  407. kfree(ecryptfs_msg_ctx_arr[i].msg);
  408. mutex_unlock(&ecryptfs_msg_ctx_arr[i].mux);
  409. }
  410. kfree(ecryptfs_msg_ctx_arr);
  411. mutex_unlock(&ecryptfs_msg_ctx_lists_mux);
  412. }
  413. if (ecryptfs_daemon_hash) {
  414. struct ecryptfs_daemon *daemon;
  415. struct hlist_node *n;
  416. int i;
  417. mutex_lock(&ecryptfs_daemon_hash_mux);
  418. for (i = 0; i < (1 << ecryptfs_hash_bits); i++) {
  419. int rc;
  420. hlist_for_each_entry_safe(daemon, n,
  421. &ecryptfs_daemon_hash[i],
  422. euid_chain) {
  423. rc = ecryptfs_exorcise_daemon(daemon);
  424. if (rc)
  425. printk(KERN_ERR "%s: Error whilst "
  426. "attempting to destroy daemon; "
  427. "rc = [%d]. Dazed and confused, "
  428. "but trying to continue.\n",
  429. __func__, rc);
  430. }
  431. }
  432. kfree(ecryptfs_daemon_hash);
  433. mutex_unlock(&ecryptfs_daemon_hash_mux);
  434. }
  435. ecryptfs_destroy_ecryptfs_miscdev();
  436. return;
  437. }