coroipc.c 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869
  1. /*
  2. * vi: set autoindent tabstop=4 shiftwidth=4 :
  3. *
  4. * Copyright (c) 2002-2006 MontaVista Software, Inc.
  5. * Copyright (c) 2006-2009 Red Hat, Inc.
  6. *
  7. * All rights reserved.
  8. *
  9. * Author: Steven Dake (sdake@redhat.com)
  10. *
  11. * This software licensed under BSD license, the text of which follows:
  12. *
  13. * Redistribution and use in source and binary forms, with or without
  14. * modification, are permitted provided that the following conditions are met:
  15. *
  16. * - Redistributions of source code must retain the above copyright notice,
  17. * this list of conditions and the following disclaimer.
  18. * - Redistributions in binary form must reproduce the above copyright notice,
  19. * this list of conditions and the following disclaimer in the documentation
  20. * and/or other materials provided with the distribution.
  21. * - Neither the name of the MontaVista Software, Inc. nor the names of its
  22. * contributors may be used to endorse or promote products derived from this
  23. * software without specific prior written permission.
  24. *
  25. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  26. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  27. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  28. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  29. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  30. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  31. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  32. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  33. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  34. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  35. * THE POSSIBILITY OF SUCH DAMAGE.
  36. */
  37. #include <stdlib.h>
  38. #include <stdio.h>
  39. #include <unistd.h>
  40. #include <errno.h>
  41. #include <string.h>
  42. #include <fcntl.h>
  43. #include <sys/ioctl.h>
  44. #include <sys/types.h>
  45. #include <sys/uio.h>
  46. #include <sys/socket.h>
  47. #include <sys/select.h>
  48. #include <sys/time.h>
  49. #include <sys/un.h>
  50. #include <net/if.h>
  51. #include <arpa/inet.h>
  52. #include <netinet/in.h>
  53. #include <assert.h>
  54. #include <sys/shm.h>
  55. #include <sys/sem.h>
  56. #include <corosync/corotypes.h>
  57. #include <corosync/ipc_gen.h>
  58. #include <corosync/coroipc.h>
  59. #include "config.h"
  60. enum SA_HANDLE_STATE {
  61. SA_HANDLE_STATE_EMPTY,
  62. SA_HANDLE_STATE_PENDINGREMOVAL,
  63. SA_HANDLE_STATE_ACTIVE
  64. };
  65. struct saHandle {
  66. int state;
  67. void *instance;
  68. int refCount;
  69. uint32_t check;
  70. };
  71. struct ipc_segment {
  72. int fd;
  73. int shmid;
  74. int semid;
  75. int flow_control_state;
  76. struct shared_memory *shared_memory;
  77. uid_t euid;
  78. };
  79. #if defined(COROSYNC_LINUX)
  80. /* SUN_LEN is broken for abstract namespace
  81. */
  82. #define AIS_SUN_LEN(a) sizeof(*(a))
  83. static const char *socketname = "libais.socket";
  84. #else
  85. #define AIS_SUN_LEN(a) SUN_LEN(a)
  86. static const char *socketname = SOCKETDIR "/libais.socket";
  87. #endif
  88. #ifdef SO_NOSIGPIPE
  89. void socket_nosigpipe(int s)
  90. {
  91. int on = 1;
  92. setsockopt(s, SOL_SOCKET, SO_NOSIGPIPE, (void *)&on, sizeof(on));
  93. }
  94. #endif
  95. static int
  96. cslib_send (
  97. int s,
  98. void *msg,
  99. size_t len)
  100. {
  101. int result;
  102. struct msghdr msg_send;
  103. struct iovec iov_send;
  104. char *rbuf = (char *)msg;
  105. int processed = 0;
  106. msg_send.msg_iov = &iov_send;
  107. msg_send.msg_iovlen = 1;
  108. msg_send.msg_name = 0;
  109. msg_send.msg_namelen = 0;
  110. msg_send.msg_control = 0;
  111. msg_send.msg_controllen = 0;
  112. msg_send.msg_flags = 0;
  113. retry_send:
  114. iov_send.iov_base = &rbuf[processed];
  115. iov_send.iov_len = len - processed;
  116. result = sendmsg (s, &msg_send, MSG_NOSIGNAL);
  117. /*
  118. * return immediately on any kind of syscall error that maps to
  119. * CS_ERR if no part of message has been sent
  120. */
  121. if (result == -1 && processed == 0) {
  122. if (errno == EINTR) {
  123. goto error_exit;
  124. }
  125. if (errno == EAGAIN) {
  126. goto error_exit;
  127. }
  128. if (errno == EFAULT) {
  129. goto error_exit;
  130. }
  131. }
  132. /*
  133. * retry read operations that are already started except
  134. * for fault in that case, return ERR_LIBRARY
  135. */
  136. if (result == -1 && processed > 0) {
  137. if (errno == EINTR) {
  138. goto retry_send;
  139. }
  140. if (errno == EAGAIN) {
  141. goto retry_send;
  142. }
  143. if (errno == EFAULT) {
  144. goto error_exit;
  145. }
  146. }
  147. /*
  148. * return ERR_LIBRARY on any other syscall error
  149. */
  150. if (result == -1) {
  151. goto error_exit;
  152. }
  153. processed += result;
  154. if (processed != len) {
  155. goto retry_send;
  156. }
  157. return (0);
  158. error_exit:
  159. return (-1);
  160. }
  161. static int
  162. cslib_recv (
  163. int s,
  164. void *msg,
  165. size_t len)
  166. {
  167. int error = 0;
  168. int result;
  169. struct msghdr msg_recv;
  170. struct iovec iov_recv;
  171. char *rbuf = (char *)msg;
  172. int processed = 0;
  173. msg_recv.msg_iov = &iov_recv;
  174. msg_recv.msg_iovlen = 1;
  175. msg_recv.msg_name = 0;
  176. msg_recv.msg_namelen = 0;
  177. msg_recv.msg_control = 0;
  178. msg_recv.msg_controllen = 0;
  179. msg_recv.msg_flags = 0;
  180. retry_recv:
  181. iov_recv.iov_base = (void *)&rbuf[processed];
  182. iov_recv.iov_len = len - processed;
  183. result = recvmsg (s, &msg_recv, MSG_NOSIGNAL|MSG_WAITALL);
  184. if (result == -1 && errno == EINTR) {
  185. goto retry_recv;
  186. }
  187. if (result == -1 && errno == EAGAIN) {
  188. goto retry_recv;
  189. }
  190. #if defined(OPENAIS_SOLARIS) || defined(OPENAIS_BSD) || defined(OPENAIS_DARWIN)
  191. /* On many OS poll never return POLLHUP or POLLERR.
  192. * EOF is detected when recvmsg return 0.
  193. */
  194. if (result == 0) {
  195. error = -1;
  196. goto error_exit;
  197. }
  198. #endif
  199. if (result == -1 || result == 0) {
  200. error = -1;
  201. goto error_exit;
  202. }
  203. processed += result;
  204. if (processed != len) {
  205. goto retry_recv;
  206. }
  207. assert (processed == len);
  208. error_exit:
  209. return (0);
  210. }
  211. static int
  212. priv_change_send (struct ipc_segment *ipc_segment)
  213. {
  214. char buf_req;
  215. mar_req_priv_change req_priv_change;
  216. unsigned int res;
  217. req_priv_change.euid = geteuid();
  218. /*
  219. * Don't resend request unless euid has changed
  220. */
  221. if (ipc_segment->euid == req_priv_change.euid) {
  222. return (0);
  223. }
  224. req_priv_change.egid = getegid();
  225. buf_req = MESSAGE_REQ_CHANGE_EUID;
  226. res = cslib_send (ipc_segment->fd, &buf_req, 1);
  227. if (res == -1) {
  228. return (-1);
  229. }
  230. res = cslib_send (ipc_segment->fd, &req_priv_change,
  231. sizeof (req_priv_change));
  232. if (res == -1) {
  233. return (-1);
  234. }
  235. ipc_segment->euid = req_priv_change.euid;
  236. return (0);
  237. }
  238. cs_error_t
  239. cslib_service_connect (
  240. enum service_types service,
  241. void **shmseg)
  242. {
  243. int request_fd;
  244. struct sockaddr_un address;
  245. cs_error_t error;
  246. struct ipc_segment *ipc_segment;
  247. key_t shmkey = 0;
  248. key_t semkey = 0;
  249. int res;
  250. mar_req_setup_t req_setup;
  251. mar_res_setup_t res_setup;
  252. res_setup.error = CS_ERR_LIBRARY;
  253. request_fd = socket (PF_UNIX, SOCK_STREAM, 0);
  254. if (request_fd == -1) {
  255. return (-1);
  256. }
  257. memset (&address, 0, sizeof (struct sockaddr_un));
  258. #if defined(OPENAIS_BSD) || defined(OPENAIS_DARWIN)
  259. address.sun_len = sizeof(struct sockaddr_un);
  260. #endif
  261. address.sun_family = PF_UNIX;
  262. #if defined(COROSYNC_LINUX)
  263. strcpy (address.sun_path + 1, socketname);
  264. #else
  265. strcpy (address.sun_path, socketname);
  266. #endif
  267. res = connect (request_fd, (struct sockaddr *)&address,
  268. AIS_SUN_LEN(&address));
  269. if (res == -1) {
  270. close (request_fd);
  271. return (CS_ERR_TRY_AGAIN);
  272. }
  273. ipc_segment = malloc (sizeof (struct ipc_segment));
  274. if (ipc_segment == NULL) {
  275. close (request_fd);
  276. return (-1);
  277. }
  278. bzero (ipc_segment, sizeof (struct ipc_segment));
  279. /*
  280. * Allocate a shared memory segment
  281. */
  282. do {
  283. shmkey = random();
  284. ipc_segment->shmid = shmget (shmkey, sizeof (struct shared_memory),
  285. IPC_CREAT|IPC_EXCL|0600);
  286. } while (ipc_segment->shmid == -1);
  287. /*
  288. * Allocate a semaphore segment
  289. */
  290. do {
  291. semkey = random();
  292. ipc_segment->semid = semget (semkey, 3, IPC_CREAT|IPC_EXCL|0600);
  293. ipc_segment->euid = geteuid ();
  294. } while (ipc_segment->semid == -1);
  295. /*
  296. * Attach to shared memory segment
  297. */
  298. ipc_segment->shared_memory = shmat (ipc_segment->shmid, NULL, 0);
  299. if (ipc_segment->shared_memory == (void *)-1) {
  300. goto error_exit;
  301. }
  302. res = semctl (ipc_segment->semid, 0, SETVAL, 0);
  303. if (res != 0) {
  304. goto error_exit;
  305. }
  306. res = semctl (ipc_segment->semid, 1, SETVAL, 0);
  307. if (res != 0) {
  308. goto error_exit;
  309. }
  310. req_setup.shmkey = shmkey;
  311. req_setup.semkey = semkey;
  312. req_setup.service = service;
  313. error = cslib_send (request_fd, &req_setup, sizeof (mar_req_setup_t));
  314. if (error != 0) {
  315. goto error_exit;
  316. }
  317. error = cslib_recv (request_fd, &res_setup, sizeof (mar_res_setup_t));
  318. if (error != 0) {
  319. goto error_exit;
  320. }
  321. ipc_segment->fd = request_fd;
  322. ipc_segment->flow_control_state = 0;
  323. *shmseg = ipc_segment;
  324. /*
  325. * Something go wrong with server
  326. * Cleanup all
  327. */
  328. if (res_setup.error == CS_ERR_TRY_AGAIN) {
  329. goto error_exit;
  330. }
  331. return (res_setup.error);
  332. error_exit:
  333. close (request_fd);
  334. if (ipc_segment->shmid > 0)
  335. shmctl (ipc_segment->shmid, IPC_RMID, NULL);
  336. if (ipc_segment->semid > 0)
  337. semctl (ipc_segment->semid, 0, IPC_RMID);
  338. return (res_setup.error);
  339. }
  340. cs_error_t
  341. cslib_service_disconnect (
  342. void *ipc_context)
  343. {
  344. struct ipc_segment *ipc_segment = (struct ipc_segment *)ipc_context;
  345. shutdown (ipc_segment->fd, SHUT_RDWR);
  346. close (ipc_segment->fd);
  347. shmdt (ipc_segment->shared_memory);
  348. free (ipc_segment);
  349. return (CS_OK);
  350. }
  351. int
  352. cslib_dispatch_flow_control_get (
  353. void *ipc_context)
  354. {
  355. struct ipc_segment *ipc_segment = (struct ipc_segment *)ipc_context;
  356. return (ipc_segment->flow_control_state);
  357. }
  358. int
  359. cslib_fd_get (void *ipc_ctx)
  360. {
  361. struct ipc_segment *ipc_segment = (struct ipc_segment *)ipc_ctx;
  362. return (ipc_segment->fd);
  363. }
  364. static void memcpy_swrap (
  365. void *dest, void *src, int len, unsigned int *read)
  366. {
  367. char *dest_chr = (char *)dest;
  368. char *src_chr = (char *)src;
  369. unsigned int first_read;
  370. unsigned int second_read;
  371. first_read = len;
  372. second_read = 0;
  373. if (len + *read >= DISPATCH_SIZE) {
  374. first_read = DISPATCH_SIZE - *read;
  375. second_read = (len + *read) % DISPATCH_SIZE;
  376. }
  377. memcpy (dest_chr, &src_chr[*read], first_read);
  378. if (second_read) {
  379. memcpy (&dest_chr[first_read], src_chr,
  380. second_read);
  381. }
  382. *read = (*read + len) % (DISPATCH_SIZE);
  383. }
  384. int original_flow = -1;
  385. int
  386. cslib_dispatch_recv (void *ipc_ctx, void *data, int timeout)
  387. {
  388. struct pollfd ufds;
  389. struct sembuf sop;
  390. int poll_events;
  391. mar_res_header_t *header;
  392. char buf;
  393. struct ipc_segment *ipc_segment = (struct ipc_segment *)ipc_ctx;
  394. int res;
  395. unsigned int my_read;
  396. char buf_two = 1;
  397. ufds.fd = ipc_segment->fd;
  398. ufds.events = POLLIN;
  399. ufds.revents = 0;
  400. retry_poll:
  401. poll_events = poll (&ufds, 1, timeout);
  402. if (poll_events == -1 && errno == EINTR) {
  403. goto retry_poll;
  404. } else
  405. if (poll_events == -1) {
  406. return (-1);
  407. } else
  408. if (poll_events == 0) {
  409. return (0);
  410. }
  411. if (poll_events == 1 && (ufds.revents & (POLLERR|POLLHUP))) {
  412. return (-1);
  413. }
  414. retry_recv:
  415. res = recv (ipc_segment->fd, &buf, 1, 0);
  416. if (res == -1 && errno == EINTR) {
  417. goto retry_recv;
  418. } else
  419. if (res == -1) {
  420. return (-1);
  421. }
  422. if (res == 0) {
  423. return (-1);
  424. }
  425. ipc_segment->flow_control_state = 0;
  426. if (buf == 1 || buf == 2) {
  427. ipc_segment->flow_control_state = 1;
  428. }
  429. /*
  430. * Notify executive to flush any pending dispatch messages
  431. */
  432. if (ipc_segment->flow_control_state) {
  433. buf_two = MESSAGE_REQ_OUTQ_FLUSH;
  434. res = cslib_send (ipc_segment->fd, &buf_two, 1);
  435. assert (res == 0); //TODO
  436. }
  437. /*
  438. * This is just a notification of flow control starting at the addition
  439. * of a new pending message, not a message to dispatch
  440. */
  441. if (buf == 2) {
  442. return (0);
  443. }
  444. if (buf == 3) {
  445. return (0);
  446. }
  447. sop.sem_num = 2;
  448. sop.sem_op = -1;
  449. sop.sem_flg = 0;
  450. retry_semop:
  451. res = semop (ipc_segment->semid, &sop, 1);
  452. if (res == -1 && errno == EINTR) {
  453. goto retry_semop;
  454. } else
  455. if (res == -1 && errno == EACCES) {
  456. priv_change_send (ipc_segment);
  457. goto retry_semop;
  458. } else
  459. if (res == -1) {
  460. return (-1);
  461. }
  462. if (ipc_segment->shared_memory->read + sizeof (mar_res_header_t) >= DISPATCH_SIZE) {
  463. my_read = ipc_segment->shared_memory->read;
  464. memcpy_swrap (data,
  465. ipc_segment->shared_memory->dispatch_buffer,
  466. sizeof (mar_res_header_t),
  467. &ipc_segment->shared_memory->read);
  468. header = (mar_res_header_t *)data;
  469. memcpy_swrap (
  470. (void *)((char *)data + sizeof (mar_res_header_t)),
  471. ipc_segment->shared_memory->dispatch_buffer,
  472. header->size - sizeof (mar_res_header_t),
  473. &ipc_segment->shared_memory->read);
  474. } else {
  475. header = (mar_res_header_t *)&ipc_segment->shared_memory->dispatch_buffer[ipc_segment->shared_memory->read];
  476. memcpy_swrap (
  477. data,
  478. ipc_segment->shared_memory->dispatch_buffer,
  479. header->size,
  480. &ipc_segment->shared_memory->read);
  481. }
  482. return (1);
  483. }
  484. static cs_error_t
  485. cslib_msg_send (
  486. void *ipc_context,
  487. struct iovec *iov,
  488. int iov_len)
  489. {
  490. struct ipc_segment *ipc_segment = (struct ipc_segment *)ipc_context;
  491. struct sembuf sop;
  492. int i;
  493. int res;
  494. int req_buffer_idx = 0;
  495. for (i = 0; i < iov_len; i++) {
  496. memcpy (&ipc_segment->shared_memory->req_buffer[req_buffer_idx],
  497. iov[i].iov_base,
  498. iov[i].iov_len);
  499. req_buffer_idx += iov[i].iov_len;
  500. }
  501. /*
  502. * Signal semaphore #0 indicting a new message from client
  503. * to server request queue
  504. */
  505. sop.sem_num = 0;
  506. sop.sem_op = 1;
  507. sop.sem_flg = 0;
  508. retry_semop:
  509. res = semop (ipc_segment->semid, &sop, 1);
  510. if (res == -1 && errno == EINTR) {
  511. goto retry_semop;
  512. } else
  513. if (res == -1 && errno == EACCES) {
  514. priv_change_send (ipc_segment);
  515. goto retry_semop;
  516. } else
  517. if (res == -1) {
  518. return (CS_ERR_LIBRARY);
  519. }
  520. return (CS_OK);
  521. }
  522. static cs_error_t
  523. cslib_reply_receive (
  524. void *ipc_context,
  525. void *res_msg, int res_len)
  526. {
  527. struct sembuf sop;
  528. struct ipc_segment *ipc_segment = (struct ipc_segment *)ipc_context;
  529. int res;
  530. /*
  531. * Wait for semaphore #1 indicating a new message from server
  532. * to client in the response queue
  533. */
  534. sop.sem_num = 1;
  535. sop.sem_op = -1;
  536. sop.sem_flg = 0;
  537. retry_semop:
  538. res = semop (ipc_segment->semid, &sop, 1);
  539. if (res == -1 && errno == EINTR) {
  540. goto retry_semop;
  541. } else
  542. if (res == -1 && errno == EACCES) {
  543. priv_change_send (ipc_segment);
  544. goto retry_semop;
  545. } else
  546. if (res == -1) {
  547. return (CS_ERR_LIBRARY);
  548. }
  549. memcpy (res_msg, ipc_segment->shared_memory->res_buffer, res_len);
  550. return (CS_OK);
  551. }
  552. static cs_error_t
  553. cslib_reply_receive_in_buf (
  554. void *ipc_context,
  555. void **res_msg)
  556. {
  557. struct sembuf sop;
  558. struct ipc_segment *ipc_segment = (struct ipc_segment *)ipc_context;
  559. int res;
  560. /*
  561. * Wait for semaphore #1 indicating a new message from server
  562. * to client in the response queue
  563. */
  564. sop.sem_num = 1;
  565. sop.sem_op = -1;
  566. sop.sem_flg = 0;
  567. retry_semop:
  568. res = semop (ipc_segment->semid, &sop, 1);
  569. if (res == -1 && errno == EINTR) {
  570. goto retry_semop;
  571. } else
  572. if (res == -1 && errno == EACCES) {
  573. priv_change_send (ipc_segment);
  574. goto retry_semop;
  575. } else
  576. if (res == -1) {
  577. return (CS_ERR_LIBRARY);
  578. }
  579. *res_msg = (char *)ipc_segment->shared_memory->res_buffer;
  580. return (CS_OK);
  581. }
  582. cs_error_t
  583. cslib_msg_send_reply_receive (
  584. void *ipc_context,
  585. struct iovec *iov,
  586. int iov_len,
  587. void *res_msg,
  588. int res_len)
  589. {
  590. cs_error_t res;
  591. res = cslib_msg_send (ipc_context, iov, iov_len);
  592. if (res != CS_OK) {
  593. return (res);
  594. }
  595. res = cslib_reply_receive (ipc_context, res_msg, res_len);
  596. if (res != CS_OK) {
  597. return (res);
  598. }
  599. return (CS_OK);
  600. }
  601. cs_error_t
  602. cslib_msg_send_reply_receive_in_buf (
  603. void *ipc_context,
  604. struct iovec *iov,
  605. int iov_len,
  606. void **res_msg)
  607. {
  608. unsigned int res;
  609. res = cslib_msg_send (ipc_context, iov, iov_len);
  610. if (res != CS_OK) {
  611. return (res);
  612. }
  613. res = cslib_reply_receive_in_buf (ipc_context, res_msg);
  614. if (res != CS_OK) {
  615. return (res);
  616. }
  617. return (CS_OK);
  618. }
  619. cs_error_t
  620. saHandleCreate (
  621. struct saHandleDatabase *handleDatabase,
  622. int instanceSize,
  623. uint64_t *handleOut)
  624. {
  625. uint32_t handle;
  626. uint32_t check;
  627. void *newHandles = NULL;
  628. int found = 0;
  629. void *instance;
  630. int i;
  631. pthread_mutex_lock (&handleDatabase->mutex);
  632. for (handle = 0; handle < handleDatabase->handleCount; handle++) {
  633. if (handleDatabase->handles[handle].state == SA_HANDLE_STATE_EMPTY) {
  634. found = 1;
  635. break;
  636. }
  637. }
  638. if (found == 0) {
  639. handleDatabase->handleCount += 1;
  640. newHandles = (struct saHandle *)realloc (handleDatabase->handles,
  641. sizeof (struct saHandle) * handleDatabase->handleCount);
  642. if (newHandles == NULL) {
  643. pthread_mutex_unlock (&handleDatabase->mutex);
  644. return (CS_ERR_NO_MEMORY);
  645. }
  646. handleDatabase->handles = newHandles;
  647. }
  648. instance = malloc (instanceSize);
  649. if (instance == 0) {
  650. free (newHandles);
  651. pthread_mutex_unlock (&handleDatabase->mutex);
  652. return (CS_ERR_NO_MEMORY);
  653. }
  654. /*
  655. * This code makes sure the random number isn't zero
  656. * We use 0 to specify an invalid handle out of the 1^64 address space
  657. * If we get 0 200 times in a row, the RNG may be broken
  658. */
  659. for (i = 0; i < 200; i++) {
  660. check = random();
  661. if (check != 0) {
  662. break;
  663. }
  664. }
  665. memset (instance, 0, instanceSize);
  666. handleDatabase->handles[handle].state = SA_HANDLE_STATE_ACTIVE;
  667. handleDatabase->handles[handle].instance = instance;
  668. handleDatabase->handles[handle].refCount = 1;
  669. handleDatabase->handles[handle].check = check;
  670. *handleOut = (uint64_t)((uint64_t)check << 32 | handle);
  671. pthread_mutex_unlock (&handleDatabase->mutex);
  672. return (CS_OK);
  673. }
  674. cs_error_t
  675. saHandleDestroy (
  676. struct saHandleDatabase *handleDatabase,
  677. uint64_t inHandle)
  678. {
  679. cs_error_t error = CS_OK;
  680. uint32_t check = inHandle >> 32;
  681. uint32_t handle = inHandle & 0xffffffff;
  682. pthread_mutex_lock (&handleDatabase->mutex);
  683. if (check != handleDatabase->handles[handle].check) {
  684. pthread_mutex_unlock (&handleDatabase->mutex);
  685. error = CS_ERR_BAD_HANDLE;
  686. return (error);
  687. }
  688. handleDatabase->handles[handle].state = SA_HANDLE_STATE_PENDINGREMOVAL;
  689. pthread_mutex_unlock (&handleDatabase->mutex);
  690. saHandleInstancePut (handleDatabase, inHandle);
  691. return (error);
  692. }
  693. cs_error_t
  694. saHandleInstanceGet (
  695. struct saHandleDatabase *handleDatabase,
  696. uint64_t inHandle,
  697. void **instance)
  698. {
  699. uint32_t check = inHandle >> 32;
  700. uint32_t handle = inHandle & 0xffffffff;
  701. cs_error_t error = CS_OK;
  702. pthread_mutex_lock (&handleDatabase->mutex);
  703. if (handle >= (uint64_t)handleDatabase->handleCount) {
  704. error = CS_ERR_BAD_HANDLE;
  705. goto error_exit;
  706. }
  707. if (handleDatabase->handles[handle].state != SA_HANDLE_STATE_ACTIVE) {
  708. error = CS_ERR_BAD_HANDLE;
  709. goto error_exit;
  710. }
  711. if (check != handleDatabase->handles[handle].check) {
  712. error = CS_ERR_BAD_HANDLE;
  713. goto error_exit;
  714. }
  715. *instance = handleDatabase->handles[handle].instance;
  716. handleDatabase->handles[handle].refCount += 1;
  717. error_exit:
  718. pthread_mutex_unlock (&handleDatabase->mutex);
  719. return (error);
  720. }
  721. cs_error_t
  722. saHandleInstancePut (
  723. struct saHandleDatabase *handleDatabase,
  724. uint64_t inHandle)
  725. {
  726. void *instance;
  727. cs_error_t error = CS_OK;
  728. uint32_t check = inHandle >> 32;
  729. uint32_t handle = inHandle & 0xffffffff;
  730. pthread_mutex_lock (&handleDatabase->mutex);
  731. if (check != handleDatabase->handles[handle].check) {
  732. error = CS_ERR_BAD_HANDLE;
  733. goto error_exit;
  734. }
  735. handleDatabase->handles[handle].refCount -= 1;
  736. assert (handleDatabase->handles[handle].refCount >= 0);
  737. if (handleDatabase->handles[handle].refCount == 0) {
  738. instance = (handleDatabase->handles[handle].instance);
  739. handleDatabase->handleInstanceDestructor (instance);
  740. free (instance);
  741. memset (&handleDatabase->handles[handle], 0, sizeof (struct saHandle));
  742. }
  743. error_exit:
  744. pthread_mutex_unlock (&handleDatabase->mutex);
  745. return (error);
  746. }