totempg.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571
  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. struct totempg_mcast {
  95. struct totempg_mcast_header header;
  96. short fragmented; /* This message continues into next message */
  97. short msg_count;
  98. /*
  99. * short msg_len[msg_count];
  100. */
  101. /*
  102. * data for messages
  103. */
  104. };
  105. /*
  106. * Maximum packet size for totem pg messages
  107. */
  108. #define TOTEMPG_PACKET_SIZE (TOTEMSRP_PACKET_SIZE_MAX - sizeof (struct totempg_mcast))
  109. /*
  110. * Local variables used for packing small messages
  111. */
  112. static unsigned short mcast_packed_msg_lens[TOTEMSRP_PACKET_SIZE_MAX];
  113. static int mcast_packed_msg_count = 0;
  114. static void (*app_deliver_fn) (
  115. struct in_addr source_addr,
  116. struct iovec *iovec,
  117. int iov_len,
  118. int endian_conversion_required) = 0;
  119. static void (*app_confchg_fn) (
  120. enum totempg_configuration_type configuration_type,
  121. struct in_addr *member_list, void *member_list_private,
  122. int member_list_entries,
  123. struct in_addr *left_list, void *left_list_private,
  124. int left_list_entries,
  125. struct in_addr *joined_list, void *joined_list_private,
  126. int joined_list_entries) = 0;
  127. struct assembly {
  128. struct in_addr addr;
  129. unsigned char data[MESSAGE_SIZE_MAX];
  130. int index;
  131. };
  132. struct assembly *assembly_list[16]; // MAX PROCESSORS TODO
  133. int assembly_list_entries = 0;
  134. static unsigned char fragmentation_data[TOTEMPG_PACKET_SIZE];
  135. int fragment_size = 0;
  136. static struct iovec iov_delv;
  137. static struct assembly *find_assembly (struct in_addr addr)
  138. {
  139. int i;
  140. for (i = 0; i < assembly_list_entries; i++) {
  141. if (addr.s_addr == assembly_list[i]->addr.s_addr) {
  142. return (assembly_list[i]);
  143. }
  144. }
  145. return (0);
  146. }
  147. static void totempg_confchg_fn (
  148. enum totempg_configuration_type configuration_type,
  149. struct in_addr *member_list, void *member_list_private,
  150. int member_list_entries,
  151. struct in_addr *left_list, void *left_list_private,
  152. int left_list_entries,
  153. struct in_addr *joined_list, void *joined_list_private,
  154. int joined_list_entries)
  155. {
  156. int i;
  157. int j;
  158. int found;
  159. /*
  160. * Clean out the assembly area for nodes that have left the
  161. * membership. If they return, we don't want any stale message
  162. * data that may be there.
  163. */
  164. for (i = 0; i < left_list_entries; i++) {
  165. for (j = 0; j < assembly_list_entries; j++) {
  166. if (left_list[i].s_addr == assembly_list[j]->addr.s_addr) {
  167. assembly_list[j]->index = 0;
  168. }
  169. }
  170. }
  171. /*
  172. * Create a message assembly area for any new members.
  173. */
  174. for (i = 0; i < member_list_entries; i++) {
  175. found = 0;
  176. for (j = 0; j < assembly_list_entries; j++) {
  177. if (member_list[i].s_addr == assembly_list[j]->addr.s_addr) {
  178. found = 1;
  179. break;
  180. }
  181. }
  182. if (found == 0) {
  183. assembly_list[assembly_list_entries] =
  184. malloc (sizeof (struct assembly));
  185. assert (assembly_list[assembly_list_entries]); // TODO
  186. assembly_list[assembly_list_entries]->addr.s_addr =
  187. member_list[i].s_addr;
  188. assembly_list[assembly_list_entries]->index = 0;
  189. assembly_list_entries += 1;
  190. }
  191. }
  192. app_confchg_fn (configuration_type,
  193. member_list, member_list_private, member_list_entries,
  194. left_list, left_list_private, left_list_entries,
  195. joined_list, joined_list_private, joined_list_entries);
  196. }
  197. static void totempg_deliver_fn (
  198. struct in_addr source_addr,
  199. struct iovec *iovec,
  200. int iov_len,
  201. int endian_conversion_required)
  202. {
  203. struct totempg_mcast *mcast;
  204. unsigned short *msg_lens;
  205. int i;
  206. struct assembly *assembly;
  207. char header[1500];
  208. int h_index;
  209. int a_i = 0;
  210. int msg_count;
  211. assembly = find_assembly (source_addr);
  212. assert (assembly);
  213. /*
  214. * Assemble the header into one block of data
  215. * Assemble the packet contents into one block of data to simplify delivery
  216. */
  217. if (iov_len == 1) {
  218. /* message originated from external processor - 1 iovec for full msg */
  219. char *data;
  220. int datasize;
  221. mcast = (struct totempg_mcast *)iovec[0].iov_base;
  222. msg_count = mcast->msg_count;
  223. if (endian_conversion_required) {
  224. msg_count = swab16 (mcast->msg_count);
  225. }
  226. datasize = sizeof (struct totempg_mcast) +
  227. msg_count * sizeof (unsigned short);
  228. memcpy (header, iovec[0].iov_base, datasize);
  229. data = iovec[0].iov_base;
  230. msg_lens = (unsigned short *) (header + sizeof (struct totempg_mcast));
  231. memcpy (&assembly->data[assembly->index], &data[datasize],
  232. iovec[0].iov_len - datasize);
  233. } else {
  234. /* message originated from local processor - <1 iovec for full msg */
  235. h_index = 0;
  236. for (i = 0; i < 2; i++) {
  237. memcpy (&header[h_index], iovec[i].iov_base, iovec[i].iov_len);
  238. h_index += iovec[i].iov_len;
  239. }
  240. mcast = (struct totempg_mcast *)header;
  241. // TODO make sure we are using a copy of mcast not the actual data itself
  242. msg_lens = (unsigned short *) (header + sizeof (struct totempg_mcast));
  243. for (i = 2; i < iov_len; i++) {
  244. a_i = assembly->index;
  245. memcpy (&assembly->data[a_i], iovec[i].iov_base, iovec[i].iov_len);
  246. a_i += msg_lens[i - 2];
  247. }
  248. iov_len -= 2;
  249. }
  250. if (endian_conversion_required) {
  251. mcast->fragmented = swab16 (mcast->fragmented);
  252. mcast->msg_count = swab16 (mcast->msg_count);
  253. for (i = 0; i < mcast->msg_count; i++) {
  254. msg_lens[i] = swab16 (msg_lens[i]);
  255. }
  256. }
  257. /*
  258. printf ("Message fragmented %d count %d\n", mcast->fragmented, mcast->msg_count);
  259. for (i = 0; i < mcast->msg_count; i++) {
  260. printf ("len[%d] = %d\n", i, msg_lens[i]);
  261. }
  262. */
  263. /*
  264. * Deliver all full messages in packed message
  265. */
  266. /*
  267. * this message's last packed message is not a fragment
  268. */
  269. if (mcast->fragmented == 0) {
  270. iov_delv.iov_base = &assembly->data[0];
  271. iov_delv.iov_len = assembly->index + msg_lens[0];
  272. for (i = 0; i < mcast->msg_count; i++) {
  273. assembly->index += msg_lens[i];
  274. //printf ("app deliver\n");
  275. app_deliver_fn (source_addr, &iov_delv, 1,
  276. endian_conversion_required);
  277. iov_delv.iov_base = &assembly->data[assembly->index];
  278. iov_delv.iov_len = msg_lens[i + 1];
  279. }
  280. assembly->index = 0;
  281. } else
  282. /*
  283. * This message's last packed message is a fragment
  284. */
  285. if (mcast->fragmented == 1) {
  286. iov_delv.iov_base = &assembly->data[0];
  287. iov_delv.iov_len = assembly->index + msg_lens[0];
  288. for (i = 0; i < mcast->msg_count - 1; i++) {
  289. assembly->index += msg_lens[i];
  290. //printf ("app deliver\n");
  291. app_deliver_fn (source_addr, &iov_delv, 1,
  292. endian_conversion_required);
  293. iov_delv.iov_base = &assembly->data[assembly->index];
  294. iov_delv.iov_len = msg_lens[i + 1];
  295. }
  296. if (mcast->msg_count > 1) {
  297. memmove (&assembly->data[0],
  298. &assembly->data[assembly->index],
  299. msg_lens[mcast->msg_count - 1]);
  300. assembly->index = 0;
  301. }
  302. assembly->index += msg_lens[mcast->msg_count - 1];
  303. }
  304. }
  305. /*
  306. * Totem Process Group Abstraction
  307. * depends on poll abstraction, POSIX, IPV4
  308. */
  309. /*
  310. * Initialize the logger
  311. */
  312. void totempg_log_printf_init (
  313. void (*log_printf) (int , char *, ...),
  314. int log_level_security,
  315. int log_level_error,
  316. int log_level_warning,
  317. int log_level_notice,
  318. int log_level_debug)
  319. {
  320. totemsrp_log_printf_init (
  321. log_printf,
  322. log_level_security,
  323. log_level_error,
  324. log_level_warning,
  325. log_level_notice,
  326. log_level_debug);
  327. }
  328. void *callback_token_received_handle;
  329. int callback_token_received_fn (enum totemsrp_callback_token_type type,
  330. void *data)
  331. {
  332. struct totempg_mcast mcast;
  333. struct iovec iovecs[3];
  334. int res;
  335. if (mcast_packed_msg_count == 0) {
  336. return (0);
  337. }
  338. mcast.fragmented = 0;
  339. mcast.msg_count = mcast_packed_msg_count;
  340. iovecs[0].iov_base = &mcast;
  341. iovecs[0].iov_len = sizeof (struct totempg_mcast);
  342. iovecs[1].iov_base = mcast_packed_msg_lens;
  343. iovecs[1].iov_len = mcast_packed_msg_count * sizeof (unsigned short);
  344. iovecs[2].iov_base = &fragmentation_data[0];
  345. iovecs[2].iov_len = fragment_size;
  346. res = totemsrp_mcast (iovecs, 3, 0);
  347. mcast_packed_msg_count = 0;
  348. fragment_size = 0;
  349. return (0);
  350. }
  351. /*
  352. * Initialize the totem process group abstraction
  353. */
  354. int totempg_initialize (
  355. struct sockaddr_in *sockaddr_mcast,
  356. struct totempg_interface *interfaces,
  357. int interface_count,
  358. poll_handle *poll_handle,
  359. unsigned char *private_key,
  360. int private_key_len,
  361. void *member_private,
  362. int member_private_len,
  363. void (*deliver_fn) (
  364. struct in_addr source_addr,
  365. struct iovec *iovec,
  366. int iov_len,
  367. int endian_conversion_required),
  368. void (*confchg_fn) (
  369. enum totempg_configuration_type configuration_type,
  370. struct in_addr *member_list, void *member_list_private,
  371. int member_list_entries,
  372. struct in_addr *left_list, void *left_list_private,
  373. int left_list_entries,
  374. struct in_addr *joined_list, void *joined_list_private,
  375. int joined_list_entries))
  376. {
  377. int res;
  378. app_deliver_fn = deliver_fn;
  379. app_confchg_fn = confchg_fn;
  380. res = totemsrp_initialize (sockaddr_mcast, (struct totemsrp_interface *)interfaces,
  381. interface_count,
  382. poll_handle,
  383. private_key, private_key_len,
  384. member_private, member_private_len,
  385. totempg_deliver_fn, totempg_confchg_fn);
  386. totemsrp_callback_token_create (&callback_token_received_handle,
  387. TOTEMSRP_CALLBACK_TOKEN_RECEIVED,
  388. 0,
  389. callback_token_received_fn,
  390. 0);
  391. return (res);
  392. }
  393. /*
  394. * Multicast a message
  395. */
  396. int totempg_mcast (
  397. struct iovec *iovec,
  398. int iov_len,
  399. int guarantee)
  400. {
  401. int res = 0;
  402. struct totempg_mcast mcast;
  403. struct iovec iovecs[3];
  404. int i;
  405. int max_packet_size = 0;
  406. int copy_len = 0;
  407. int copy_base = 0;
  408. max_packet_size = TOTEMPG_PACKET_SIZE -
  409. (sizeof (unsigned short) * (mcast_packed_msg_count + 1));
  410. mcast_packed_msg_lens[mcast_packed_msg_count] = 0;
  411. for (i = 0; i < iov_len; ) {
  412. mcast.fragmented = 0;
  413. copy_len = iovec[i].iov_len - copy_base;
  414. /*
  415. * If it all fits with room left over, copy it in.
  416. * We need to leave at least sizeof(short) + 1 bytes in the
  417. * fragment_buffer on exit so that max_packet_size + fragment_size
  418. * doesn't exceed the size of the fragment_buffer on the next call.
  419. */
  420. if ((copy_len + fragment_size) <
  421. (max_packet_size - sizeof (unsigned short))) {
  422. memcpy (&fragmentation_data[fragment_size],
  423. iovec[i].iov_base + copy_base, copy_len);
  424. fragment_size += copy_len;
  425. mcast_packed_msg_lens[mcast_packed_msg_count] += copy_len;
  426. copy_len = 0;
  427. copy_base = 0;
  428. i++;
  429. continue;
  430. /*
  431. * If it just fits or is too big, then send out what fits.
  432. */
  433. } else {
  434. copy_len = min(copy_len, max_packet_size - fragment_size);
  435. memcpy (&fragmentation_data[fragment_size],
  436. iovec[i].iov_base + copy_base, copy_len);
  437. mcast_packed_msg_lens[mcast_packed_msg_count] += copy_len;
  438. /*
  439. * if we're not on the last iovec or the iovec is too large to
  440. * fit, then indicate a fragment.
  441. */
  442. if ((i < (iov_len - 1)) ||
  443. ((copy_base + copy_len) < iovec[i].iov_len)) {
  444. mcast.fragmented = 1;
  445. }
  446. /*
  447. * assemble the message and send it
  448. */
  449. mcast.msg_count = ++mcast_packed_msg_count;
  450. iovecs[0].iov_base = &mcast;
  451. iovecs[0].iov_len = sizeof(struct totempg_mcast);
  452. iovecs[1].iov_base = mcast_packed_msg_lens;
  453. iovecs[1].iov_len = mcast_packed_msg_count *
  454. sizeof(unsigned short);
  455. iovecs[2].iov_base = fragmentation_data;
  456. iovecs[2].iov_len = max_packet_size;
  457. res = totemsrp_mcast (iovecs, 3, guarantee);
  458. /*
  459. * Recalculate counts and indexes for the next.
  460. */
  461. mcast_packed_msg_lens[0] = 0;
  462. mcast_packed_msg_count = 0;
  463. fragment_size = 0;
  464. max_packet_size = TOTEMPG_PACKET_SIZE - (sizeof(unsigned short));
  465. /*
  466. * If the iovec all fit, go to the next iovec
  467. */
  468. if ((copy_base + copy_len) == iovec[i].iov_len) {
  469. copy_len = 0;
  470. copy_base = 0;
  471. i++;
  472. /*
  473. * Continue with the rest of the current iovec.
  474. */
  475. } else {
  476. copy_base += copy_len;
  477. }
  478. }
  479. }
  480. /*
  481. * Bump only if we added message data. This may be zero if
  482. * the last buffer just fit into the fragmentation_data buffer
  483. * and we were at the last iovec.
  484. */
  485. if (mcast_packed_msg_lens[mcast_packed_msg_count]) {
  486. mcast_packed_msg_count++;
  487. }
  488. return (res);
  489. }
  490. /*
  491. * Determine if a message of msg_size could be queued
  492. */
  493. int totempg_send_ok (
  494. int msg_size)
  495. {
  496. int avail = 0;
  497. avail = totemsrp_avail ();
  498. return (avail > 200);
  499. }
  500. /*
  501. * vi: set autoindent tabstop=4 shiftwidth=4 :
  502. */