totempg.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612
  1. /*
  2. * Copyright (c) 2003-2005 MontaVista Software, Inc.
  3. * Copyright (c) 2005 OSDL.
  4. *
  5. * All rights reserved.
  6. *
  7. * Author: Steven Dake (sdake@mvista.com)
  8. * Mark Haverkamp (markh@osdl.org)
  9. *
  10. * This software licensed under BSD license, the text of which follows:
  11. *
  12. * Redistribution and use in source and binary forms, with or without
  13. * modification, are permitted provided that the following conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above copyright notice,
  16. * this list of conditions and the following disclaimer.
  17. * - Redistributions in binary form must reproduce the above copyright notice,
  18. * this list of conditions and the following disclaimer in the documentation
  19. * and/or other materials provided with the distribution.
  20. * - Neither the name of the MontaVista Software, Inc. nor the names of its
  21. * contributors may be used to endorse or promote products derived from this
  22. * software without specific prior written permission.
  23. *
  24. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  25. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  26. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  27. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  28. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  29. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  30. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  31. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  32. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  33. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  34. * THE POSSIBILITY OF SUCH DAMAGE.
  35. */
  36. /*
  37. * FRAGMENTATION AND PACKING ALGORITHM:
  38. *
  39. * Assemble the entire message into one buffer
  40. * if full fragment
  41. * store fragment into lengths list
  42. * for each full fragment
  43. * multicast fragment
  44. * set length and fragment fields of pg mesage
  45. * store remaining multicast into head of fragmentation data and set lens field
  46. *
  47. * If a message exceeds the maximum packet size allowed by the totem
  48. * single ring protocol, the protocol could loose forward progress.
  49. * Statically calculating the allowed data amount doesn't work because
  50. * the amount of data allowed depends on the number of fragments in
  51. * each message. In this implementation, the maximum fragment size
  52. * is dynamically calculated for each fragment added to the message.
  53. * It is possible for a message to be two bytes short of the maximum
  54. * packet size. This occurs when a message or collection of
  55. * messages + the mcast header + the lens are two bytes short of the
  56. * end of the packet. Since another len field consumes two bytes, the
  57. * len field would consume the rest of the packet without room for data.
  58. *
  59. * One optimization would be to forgo the final len field and determine
  60. * it from the size of the udp datagram. Then this condition would no
  61. * longer occur.
  62. */
  63. /*
  64. * ASSEMBLY AND UNPACKING ALGORITHM:
  65. *
  66. * copy incoming packet into assembly data buffer indexed by current
  67. * location of end of fragment
  68. *
  69. * if not fragmented
  70. * deliver all messages in assembly data buffer
  71. * else
  72. * if msg_count > 1 and fragmented
  73. * deliver all messages except last message in assembly data buffer
  74. * copy last fragmented section to start of assembly data buffer
  75. * else
  76. * if msg_count = 1 and fragmented
  77. * do nothing
  78. *
  79. */
  80. #include "totempg.h"
  81. #include "totemsrp.h"
  82. #include <sys/uio.h>
  83. #include <stdio.h>
  84. #include <stdlib.h>
  85. #include <string.h>
  86. #include <assert.h>
  87. #include <netinet/in.h>
  88. #include "swab.h"
  89. #define min(a,b) ((a) < (b)) ? a : b
  90. struct totempg_mcast_header {
  91. short version;
  92. short type;
  93. };
  94. /*
  95. * totempg_mcast structure
  96. *
  97. * header: Identify the mcast.
  98. * fragmented: Set if this message continues into next message
  99. * continuation: Set if this message is a continuation from last message
  100. * msg_count Indicates how many packed messages are contained
  101. * in the mcast.
  102. * Also, the size of each packed message and the messages themselves are
  103. * appended to the end of this structure when sent.
  104. */
  105. struct totempg_mcast {
  106. struct totempg_mcast_header header;
  107. unsigned char fragmented;
  108. unsigned char continuation;
  109. short msg_count;
  110. /*
  111. * short msg_len[msg_count];
  112. */
  113. /*
  114. * data for messages
  115. */
  116. };
  117. /*
  118. * Maximum packet size for totem pg messages
  119. */
  120. #define TOTEMPG_PACKET_SIZE (TOTEMSRP_PACKET_SIZE_MAX - \
  121. sizeof (struct totempg_mcast))
  122. /*
  123. * Local variables used for packing small messages
  124. */
  125. static unsigned short mcast_packed_msg_lens[TOTEMSRP_PACKET_SIZE_MAX];
  126. static int mcast_packed_msg_count = 0;
  127. static void (*app_deliver_fn) (
  128. struct in_addr source_addr,
  129. struct iovec *iovec,
  130. int iov_len,
  131. int endian_conversion_required) = 0;
  132. static void (*app_confchg_fn) (
  133. enum totempg_configuration_type configuration_type,
  134. struct in_addr *member_list, void *member_list_private,
  135. int member_list_entries,
  136. struct in_addr *left_list, void *left_list_private,
  137. int left_list_entries,
  138. struct in_addr *joined_list, void *joined_list_private,
  139. int joined_list_entries) = 0;
  140. struct assembly {
  141. struct in_addr addr;
  142. unsigned char data[MESSAGE_SIZE_MAX];
  143. int index;
  144. };
  145. struct assembly *assembly_list[16]; // MAX PROCESSORS TODO
  146. int assembly_list_entries = 0;
  147. /*
  148. * Staging buffer for packed messages. Messages are staged in this buffer
  149. * before sending. Multiple messages may fit which cuts down on the
  150. * number of mcasts sent. If a message doesn't completely fit, then
  151. * the mcast header has a fragment bit set that says that there are more
  152. * data to follow. fragment_size is an index into the buffer. It indicates
  153. * the size of message data and where to place new message data.
  154. * fragment_contuation indicates whether the first packed message in
  155. * the buffer is a continuation of a previously packed fragment.
  156. */
  157. static unsigned char fragmentation_data[TOTEMPG_PACKET_SIZE];
  158. int fragment_size = 0;
  159. int fragment_continuation = 0;
  160. static struct iovec iov_delv;
  161. static struct assembly *find_assembly (struct in_addr addr)
  162. {
  163. int i;
  164. for (i = 0; i < assembly_list_entries; i++) {
  165. if (addr.s_addr == assembly_list[i]->addr.s_addr) {
  166. return (assembly_list[i]);
  167. }
  168. }
  169. return (0);
  170. }
  171. static void totempg_confchg_fn (
  172. enum totempg_configuration_type configuration_type,
  173. struct in_addr *member_list, void *member_list_private,
  174. int member_list_entries,
  175. struct in_addr *left_list, void *left_list_private,
  176. int left_list_entries,
  177. struct in_addr *joined_list, void *joined_list_private,
  178. int joined_list_entries)
  179. {
  180. int i;
  181. int j;
  182. int found;
  183. /*
  184. * Clean out the assembly area for nodes that have left the
  185. * membership. If they return, we don't want any stale message
  186. * data that may be there.
  187. */
  188. for (i = 0; i < left_list_entries; i++) {
  189. for (j = 0; j < assembly_list_entries; j++) {
  190. if (left_list[i].s_addr == assembly_list[j]->addr.s_addr) {
  191. assembly_list[j]->index = 0;
  192. }
  193. }
  194. }
  195. /*
  196. * Create a message assembly area for any new members.
  197. */
  198. for (i = 0; i < member_list_entries; i++) {
  199. found = 0;
  200. for (j = 0; j < assembly_list_entries; j++) {
  201. if (member_list[i].s_addr == assembly_list[j]->addr.s_addr) {
  202. found = 1;
  203. break;
  204. }
  205. }
  206. if (found == 0) {
  207. assembly_list[assembly_list_entries] =
  208. malloc (sizeof (struct assembly));
  209. assert (assembly_list[assembly_list_entries]); // TODO
  210. assembly_list[assembly_list_entries]->addr.s_addr =
  211. member_list[i].s_addr;
  212. assembly_list[assembly_list_entries]->index = 0;
  213. assembly_list_entries += 1;
  214. }
  215. }
  216. app_confchg_fn (configuration_type,
  217. member_list, member_list_private, member_list_entries,
  218. left_list, left_list_private, left_list_entries,
  219. joined_list, joined_list_private, joined_list_entries);
  220. }
  221. static void totempg_deliver_fn (
  222. struct in_addr source_addr,
  223. struct iovec *iovec,
  224. int iov_len,
  225. int endian_conversion_required)
  226. {
  227. struct totempg_mcast *mcast;
  228. unsigned short *msg_lens;
  229. int i;
  230. struct assembly *assembly;
  231. char header[1500];
  232. int h_index;
  233. int a_i = 0;
  234. int msg_count;
  235. int continuation;
  236. assembly = find_assembly (source_addr);
  237. assert (assembly);
  238. /*
  239. * Assemble the header into one block of data and
  240. * assemble the packet contents into one block of data to simplify delivery
  241. */
  242. if (iov_len == 1) {
  243. /*
  244. * This message originated from external processor
  245. * because there is only one iovec for the full msg.
  246. */
  247. char *data;
  248. int datasize;
  249. mcast = (struct totempg_mcast *)iovec[0].iov_base;
  250. msg_count = mcast->msg_count;
  251. if (endian_conversion_required) {
  252. msg_count = swab16 (mcast->msg_count);
  253. }
  254. datasize = sizeof (struct totempg_mcast) +
  255. msg_count * sizeof (unsigned short);
  256. memcpy (header, iovec[0].iov_base, datasize);
  257. data = iovec[0].iov_base;
  258. msg_lens = (unsigned short *) (header + sizeof (struct totempg_mcast));
  259. memcpy (&assembly->data[assembly->index], &data[datasize],
  260. iovec[0].iov_len - datasize);
  261. } else {
  262. /*
  263. * The message originated from local processor
  264. * becasue there is greater than one iovec for then full msg.
  265. */
  266. h_index = 0;
  267. for (i = 0; i < 2; i++) {
  268. memcpy (&header[h_index], iovec[i].iov_base, iovec[i].iov_len);
  269. h_index += iovec[i].iov_len;
  270. }
  271. mcast = (struct totempg_mcast *)header;
  272. // TODO make sure we are using a copy of mcast not the actual data itself
  273. msg_lens = (unsigned short *) (header + sizeof (struct totempg_mcast));
  274. for (i = 2; i < iov_len; i++) {
  275. a_i = assembly->index;
  276. memcpy (&assembly->data[a_i], iovec[i].iov_base, iovec[i].iov_len);
  277. a_i += msg_lens[i - 2];
  278. }
  279. iov_len -= 2;
  280. }
  281. if (endian_conversion_required) {
  282. mcast->msg_count = swab16 (mcast->msg_count);
  283. for (i = 0; i < mcast->msg_count; i++) {
  284. msg_lens[i] = swab16 (msg_lens[i]);
  285. }
  286. }
  287. /*
  288. printf ("Message fragmented %d count %d\n", mcast->fragmented, mcast->msg_count);
  289. for (i = 0; i < mcast->msg_count; i++) {
  290. printf ("len[%d] = %d\n", i, msg_lens[i]);
  291. }
  292. */
  293. /*
  294. * If the last message in the buffer is a fragment, then we
  295. * can't deliver it. We'll first deliver the full messages
  296. * then adjust the assembly buffer so we can add the rest of the
  297. * fragment when it arrives.
  298. */
  299. msg_count = mcast->fragmented ? mcast->msg_count - 1 : mcast->msg_count;
  300. continuation = mcast->continuation;
  301. iov_delv.iov_base = &assembly->data[0];
  302. iov_delv.iov_len = assembly->index + msg_lens[0];
  303. for (i = 0; i < msg_count; i++) {
  304. /*
  305. * If the first packed message is a continuation
  306. * of a previous message, but the assembly buffer
  307. * is empty, then we need to discard it since we can't
  308. * assemble a complete message.
  309. */
  310. if (continuation && (assembly->index == 0)) {
  311. continuation = 0;
  312. } else {
  313. app_deliver_fn(source_addr, &iov_delv, 1,
  314. endian_conversion_required);
  315. }
  316. assembly->index += msg_lens[i];
  317. iov_delv.iov_base = &assembly->data[assembly->index];
  318. if (i < (msg_count - 1)) {
  319. iov_delv.iov_len = msg_lens[i + 1];
  320. }
  321. }
  322. if (mcast->fragmented) {
  323. if (mcast->msg_count > 1) {
  324. memmove (&assembly->data[0],
  325. &assembly->data[assembly->index],
  326. msg_lens[msg_count]);
  327. assembly->index = 0;
  328. }
  329. assembly->index += msg_lens[msg_count];
  330. } else {
  331. assembly->index = 0;
  332. }
  333. }
  334. /*
  335. * Totem Process Group Abstraction
  336. * depends on poll abstraction, POSIX, IPV4
  337. */
  338. /*
  339. * Initialize the logger
  340. */
  341. void totempg_log_printf_init (
  342. void (*log_printf) (int , char *, ...),
  343. int log_level_security,
  344. int log_level_error,
  345. int log_level_warning,
  346. int log_level_notice,
  347. int log_level_debug)
  348. {
  349. totemsrp_log_printf_init (
  350. log_printf,
  351. log_level_security,
  352. log_level_error,
  353. log_level_warning,
  354. log_level_notice,
  355. log_level_debug);
  356. }
  357. void *callback_token_received_handle;
  358. int callback_token_received_fn (enum totemsrp_callback_token_type type,
  359. void *data)
  360. {
  361. struct totempg_mcast mcast;
  362. struct iovec iovecs[3];
  363. int res;
  364. if (mcast_packed_msg_count == 0) {
  365. return (0);
  366. }
  367. mcast.fragmented = 0;
  368. /*
  369. * Was the first message in this buffer a continuation of a
  370. * fragmented message?
  371. */
  372. mcast.continuation = fragment_continuation;
  373. fragment_continuation = 0;
  374. mcast.msg_count = mcast_packed_msg_count;
  375. iovecs[0].iov_base = &mcast;
  376. iovecs[0].iov_len = sizeof (struct totempg_mcast);
  377. iovecs[1].iov_base = mcast_packed_msg_lens;
  378. iovecs[1].iov_len = mcast_packed_msg_count * sizeof (unsigned short);
  379. iovecs[2].iov_base = &fragmentation_data[0];
  380. iovecs[2].iov_len = fragment_size;
  381. res = totemsrp_mcast (iovecs, 3, 0);
  382. mcast_packed_msg_count = 0;
  383. fragment_size = 0;
  384. return (0);
  385. }
  386. /*
  387. * Initialize the totem process group abstraction
  388. */
  389. int totempg_initialize (
  390. struct sockaddr_in *sockaddr_mcast,
  391. struct totempg_interface *interfaces,
  392. int interface_count,
  393. poll_handle *poll_handle,
  394. unsigned char *private_key,
  395. int private_key_len,
  396. void *member_private,
  397. int member_private_len,
  398. void (*deliver_fn) (
  399. struct in_addr source_addr,
  400. struct iovec *iovec,
  401. int iov_len,
  402. int endian_conversion_required),
  403. void (*confchg_fn) (
  404. enum totempg_configuration_type configuration_type,
  405. struct in_addr *member_list, void *member_list_private,
  406. int member_list_entries,
  407. struct in_addr *left_list, void *left_list_private,
  408. int left_list_entries,
  409. struct in_addr *joined_list, void *joined_list_private,
  410. int joined_list_entries))
  411. {
  412. int res;
  413. app_deliver_fn = deliver_fn;
  414. app_confchg_fn = confchg_fn;
  415. res = totemsrp_initialize (sockaddr_mcast, (struct totemsrp_interface *)interfaces,
  416. interface_count,
  417. poll_handle,
  418. private_key, private_key_len,
  419. member_private, member_private_len,
  420. totempg_deliver_fn, totempg_confchg_fn);
  421. totemsrp_callback_token_create (&callback_token_received_handle,
  422. TOTEMSRP_CALLBACK_TOKEN_RECEIVED,
  423. 0,
  424. callback_token_received_fn,
  425. 0);
  426. return (res);
  427. }
  428. /*
  429. * Multicast a message
  430. */
  431. int totempg_mcast (
  432. struct iovec *iovec,
  433. int iov_len,
  434. int guarantee)
  435. {
  436. int res = 0;
  437. struct totempg_mcast mcast;
  438. struct iovec iovecs[3];
  439. int i;
  440. int max_packet_size = 0;
  441. int copy_len = 0;
  442. int copy_base = 0;
  443. max_packet_size = TOTEMPG_PACKET_SIZE -
  444. (sizeof (unsigned short) * (mcast_packed_msg_count + 1));
  445. mcast_packed_msg_lens[mcast_packed_msg_count] = 0;
  446. for (i = 0; i < iov_len; ) {
  447. mcast.fragmented = 0;
  448. mcast.continuation = fragment_continuation;
  449. copy_len = iovec[i].iov_len - copy_base;
  450. /*
  451. * If it all fits with room left over, copy it in.
  452. * We need to leave at least sizeof(short) + 1 bytes in the
  453. * fragment_buffer on exit so that max_packet_size + fragment_size
  454. * doesn't exceed the size of the fragment_buffer on the next call.
  455. */
  456. if ((copy_len + fragment_size) <
  457. (max_packet_size - sizeof (unsigned short))) {
  458. memcpy (&fragmentation_data[fragment_size],
  459. iovec[i].iov_base + copy_base, copy_len);
  460. fragment_size += copy_len;
  461. mcast_packed_msg_lens[mcast_packed_msg_count] += copy_len;
  462. copy_len = 0;
  463. copy_base = 0;
  464. i++;
  465. continue;
  466. /*
  467. * If it just fits or is too big, then send out what fits.
  468. */
  469. } else {
  470. copy_len = min(copy_len, max_packet_size - fragment_size);
  471. memcpy (&fragmentation_data[fragment_size],
  472. iovec[i].iov_base + copy_base, copy_len);
  473. mcast_packed_msg_lens[mcast_packed_msg_count] += copy_len;
  474. /*
  475. * if we're not on the last iovec or the iovec is too large to
  476. * fit, then indicate a fragment. This also means that the next
  477. * message will have the continuation of this one.
  478. */
  479. if ((i < (iov_len - 1)) ||
  480. ((copy_base + copy_len) < iovec[i].iov_len)) {
  481. mcast.fragmented = 1;
  482. fragment_continuation = 1;
  483. } else {
  484. fragment_continuation = 0;
  485. }
  486. /*
  487. * assemble the message and send it
  488. */
  489. mcast.msg_count = ++mcast_packed_msg_count;
  490. iovecs[0].iov_base = &mcast;
  491. iovecs[0].iov_len = sizeof(struct totempg_mcast);
  492. iovecs[1].iov_base = mcast_packed_msg_lens;
  493. iovecs[1].iov_len = mcast_packed_msg_count *
  494. sizeof(unsigned short);
  495. iovecs[2].iov_base = fragmentation_data;
  496. iovecs[2].iov_len = max_packet_size;
  497. res = totemsrp_mcast (iovecs, 3, guarantee);
  498. /*
  499. * Recalculate counts and indexes for the next.
  500. */
  501. mcast_packed_msg_lens[0] = 0;
  502. mcast_packed_msg_count = 0;
  503. fragment_size = 0;
  504. max_packet_size = TOTEMPG_PACKET_SIZE - (sizeof(unsigned short));
  505. /*
  506. * If the iovec all fit, go to the next iovec
  507. */
  508. if ((copy_base + copy_len) == iovec[i].iov_len) {
  509. copy_len = 0;
  510. copy_base = 0;
  511. i++;
  512. /*
  513. * Continue with the rest of the current iovec.
  514. */
  515. } else {
  516. copy_base += copy_len;
  517. }
  518. }
  519. }
  520. /*
  521. * Bump only if we added message data. This may be zero if
  522. * the last buffer just fit into the fragmentation_data buffer
  523. * and we were at the last iovec.
  524. */
  525. if (mcast_packed_msg_lens[mcast_packed_msg_count]) {
  526. mcast_packed_msg_count++;
  527. }
  528. return (res);
  529. }
  530. /*
  531. * Determine if a message of msg_size could be queued
  532. */
  533. int totempg_send_ok (
  534. int msg_size)
  535. {
  536. int avail = 0;
  537. avail = totemsrp_avail ();
  538. return (avail > 200);
  539. }
  540. /*
  541. * vi: set autoindent tabstop=4 shiftwidth=4 :
  542. */