totempg.c 39 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526
  1. /*
  2. * Copyright (c) 2003-2005 MontaVista Software, Inc.
  3. * Copyright (c) 2005 OSDL.
  4. * Copyright (c) 2006-2012 Red Hat, Inc.
  5. *
  6. * All rights reserved.
  7. *
  8. * Author: Steven Dake (sdake@redhat.com)
  9. * Author: Mark Haverkamp (markh@osdl.org)
  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. /*
  38. * FRAGMENTATION AND PACKING ALGORITHM:
  39. *
  40. * Assemble the entire message into one buffer
  41. * if full fragment
  42. * store fragment into lengths list
  43. * for each full fragment
  44. * multicast fragment
  45. * set length and fragment fields of pg mesage
  46. * store remaining multicast into head of fragmentation data and set lens field
  47. *
  48. * If a message exceeds the maximum packet size allowed by the totem
  49. * single ring protocol, the protocol could lose forward progress.
  50. * Statically calculating the allowed data amount doesn't work because
  51. * the amount of data allowed depends on the number of fragments in
  52. * each message. In this implementation, the maximum fragment size
  53. * is dynamically calculated for each fragment added to the message.
  54. * It is possible for a message to be two bytes short of the maximum
  55. * packet size. This occurs when a message or collection of
  56. * messages + the mcast header + the lens are two bytes short of the
  57. * end of the packet. Since another len field consumes two bytes, the
  58. * len field would consume the rest of the packet without room for data.
  59. *
  60. * One optimization would be to forgo the final len field and determine
  61. * it from the size of the udp datagram. Then this condition would no
  62. * longer occur.
  63. */
  64. /*
  65. * ASSEMBLY AND UNPACKING ALGORITHM:
  66. *
  67. * copy incoming packet into assembly data buffer indexed by current
  68. * location of end of fragment
  69. *
  70. * if not fragmented
  71. * deliver all messages in assembly data buffer
  72. * else
  73. * if msg_count > 1 and fragmented
  74. * deliver all messages except last message in assembly data buffer
  75. * copy last fragmented section to start of assembly data buffer
  76. * else
  77. * if msg_count = 1 and fragmented
  78. * do nothing
  79. *
  80. */
  81. #include <config.h>
  82. #ifdef HAVE_ALLOCA_H
  83. #include <alloca.h>
  84. #endif
  85. #include <sys/types.h>
  86. #include <sys/socket.h>
  87. #include <netinet/in.h>
  88. #include <arpa/inet.h>
  89. #include <sys/uio.h>
  90. #include <stdio.h>
  91. #include <stdlib.h>
  92. #include <string.h>
  93. #include <assert.h>
  94. #include <pthread.h>
  95. #include <errno.h>
  96. #include <limits.h>
  97. #include <corosync/swab.h>
  98. #include <qb/qblist.h>
  99. #include <qb/qbloop.h>
  100. #include <qb/qbipcs.h>
  101. #include <corosync/totem/totempg.h>
  102. #define LOGSYS_UTILS_ONLY 1
  103. #include <corosync/logsys.h>
  104. #include "totemsrp.h"
  105. #define min(a,b) ((a) < (b)) ? a : b
  106. struct totempg_mcast_header {
  107. short version;
  108. short type;
  109. };
  110. #if !(defined(__i386__) || defined(__x86_64__))
  111. /*
  112. * Need align on architectures different then i386 or x86_64
  113. */
  114. #define TOTEMPG_NEED_ALIGN 1
  115. #endif
  116. /*
  117. * totempg_mcast structure
  118. *
  119. * header: Identify the mcast.
  120. * fragmented: Set if this message continues into next message
  121. * continuation: Set if this message is a continuation from last message
  122. * msg_count Indicates how many packed messages are contained
  123. * in the mcast.
  124. * Also, the size of each packed message and the messages themselves are
  125. * appended to the end of this structure when sent.
  126. */
  127. struct totempg_mcast {
  128. struct totempg_mcast_header header;
  129. unsigned char fragmented;
  130. unsigned char continuation;
  131. unsigned short msg_count;
  132. /*
  133. * short msg_len[msg_count];
  134. */
  135. /*
  136. * data for messages
  137. */
  138. };
  139. /*
  140. * Maximum packet size for totem pg messages
  141. */
  142. #define TOTEMPG_PACKET_SIZE (totempg_totem_config->net_mtu - \
  143. sizeof (struct totempg_mcast))
  144. /*
  145. * Local variables used for packing small messages
  146. */
  147. static unsigned short mcast_packed_msg_lens[FRAME_SIZE_MAX];
  148. static int mcast_packed_msg_count = 0;
  149. static int totempg_reserved = 1;
  150. static unsigned int totempg_size_limit;
  151. static totem_queue_level_changed_fn totem_queue_level_changed = NULL;
  152. static uint32_t totempg_threaded_mode = 0;
  153. static void *totemsrp_context;
  154. /*
  155. * Function and data used to log messages
  156. */
  157. static int totempg_log_level_security;
  158. static int totempg_log_level_error;
  159. static int totempg_log_level_warning;
  160. static int totempg_log_level_notice;
  161. static int totempg_log_level_debug;
  162. static int totempg_subsys_id;
  163. static void (*totempg_log_printf) (
  164. int level,
  165. int subsys,
  166. const char *function,
  167. const char *file,
  168. int line,
  169. const char *format, ...) __attribute__((format(printf, 6, 7)));
  170. struct totem_config *totempg_totem_config;
  171. static totempg_stats_t totempg_stats;
  172. enum throw_away_mode {
  173. THROW_AWAY_INACTIVE,
  174. THROW_AWAY_ACTIVE
  175. };
  176. struct assembly {
  177. unsigned int nodeid;
  178. unsigned char data[MESSAGE_SIZE_MAX];
  179. int index;
  180. unsigned char last_frag_num;
  181. enum throw_away_mode throw_away_mode;
  182. struct qb_list_head list;
  183. };
  184. static void assembly_deref (struct assembly *assembly);
  185. static int callback_token_received_fn (enum totem_callback_token_type type,
  186. const void *data);
  187. QB_LIST_DECLARE(assembly_list_inuse);
  188. /*
  189. * Free list is used both for transitional and operational assemblies
  190. */
  191. QB_LIST_DECLARE(assembly_list_free);
  192. QB_LIST_DECLARE(assembly_list_inuse_trans);
  193. QB_LIST_DECLARE(totempg_groups_list);
  194. /*
  195. * Staging buffer for packed messages. Messages are staged in this buffer
  196. * before sending. Multiple messages may fit which cuts down on the
  197. * number of mcasts sent. If a message doesn't completely fit, then
  198. * the mcast header has a fragment bit set that says that there are more
  199. * data to follow. fragment_size is an index into the buffer. It indicates
  200. * the size of message data and where to place new message data.
  201. * fragment_contuation indicates whether the first packed message in
  202. * the buffer is a continuation of a previously packed fragment.
  203. */
  204. static unsigned char *fragmentation_data;
  205. static int fragment_size = 0;
  206. static int fragment_continuation = 0;
  207. static int totempg_waiting_transack = 0;
  208. struct totempg_group_instance {
  209. void (*deliver_fn) (
  210. unsigned int nodeid,
  211. const void *msg,
  212. unsigned int msg_len,
  213. int endian_conversion_required);
  214. void (*confchg_fn) (
  215. enum totem_configuration_type configuration_type,
  216. const unsigned int *member_list, size_t member_list_entries,
  217. const unsigned int *left_list, size_t left_list_entries,
  218. const unsigned int *joined_list, size_t joined_list_entries,
  219. const struct memb_ring_id *ring_id);
  220. struct totempg_group *groups;
  221. int groups_cnt;
  222. int32_t q_level;
  223. struct qb_list_head list;
  224. };
  225. static unsigned char next_fragment = 1;
  226. static pthread_mutex_t totempg_mutex = PTHREAD_MUTEX_INITIALIZER;
  227. static pthread_mutex_t callback_token_mutex = PTHREAD_MUTEX_INITIALIZER;
  228. static pthread_mutex_t mcast_msg_mutex = PTHREAD_MUTEX_INITIALIZER;
  229. #define log_printf(level, format, args...) \
  230. do { \
  231. totempg_log_printf(level, \
  232. totempg_subsys_id, \
  233. __FUNCTION__, __FILE__, __LINE__, \
  234. format, ##args); \
  235. } while (0);
  236. static int msg_count_send_ok (int msg_count);
  237. static int byte_count_send_ok (int byte_count);
  238. static void totempg_waiting_trans_ack_cb (int waiting_trans_ack)
  239. {
  240. log_printf(LOG_DEBUG, "waiting_trans_ack changed to %u", waiting_trans_ack);
  241. totempg_waiting_transack = waiting_trans_ack;
  242. }
  243. static struct assembly *assembly_ref (unsigned int nodeid)
  244. {
  245. struct assembly *assembly;
  246. struct qb_list_head *list;
  247. struct qb_list_head *active_assembly_list_inuse;
  248. if (totempg_waiting_transack) {
  249. active_assembly_list_inuse = &assembly_list_inuse_trans;
  250. } else {
  251. active_assembly_list_inuse = &assembly_list_inuse;
  252. }
  253. /*
  254. * Search inuse list for node id and return assembly buffer if found
  255. */
  256. qb_list_for_each(list, active_assembly_list_inuse) {
  257. assembly = qb_list_entry (list, struct assembly, list);
  258. if (nodeid == assembly->nodeid) {
  259. return (assembly);
  260. }
  261. }
  262. /*
  263. * Nothing found in inuse list get one from free list if available
  264. */
  265. if (qb_list_empty (&assembly_list_free) == 0) {
  266. assembly = qb_list_first_entry (&assembly_list_free, struct assembly, list);
  267. qb_list_del (&assembly->list);
  268. qb_list_add (&assembly->list, active_assembly_list_inuse);
  269. assembly->nodeid = nodeid;
  270. assembly->index = 0;
  271. assembly->last_frag_num = 0;
  272. assembly->throw_away_mode = THROW_AWAY_INACTIVE;
  273. return (assembly);
  274. }
  275. /*
  276. * Nothing available in inuse or free list, so allocate a new one
  277. */
  278. assembly = malloc (sizeof (struct assembly));
  279. /*
  280. * TODO handle memory allocation failure here
  281. */
  282. assert (assembly);
  283. assembly->nodeid = nodeid;
  284. assembly->data[0] = 0;
  285. assembly->index = 0;
  286. assembly->last_frag_num = 0;
  287. assembly->throw_away_mode = THROW_AWAY_INACTIVE;
  288. qb_list_init (&assembly->list);
  289. qb_list_add (&assembly->list, active_assembly_list_inuse);
  290. return (assembly);
  291. }
  292. static void assembly_deref (struct assembly *assembly)
  293. {
  294. qb_list_del (&assembly->list);
  295. qb_list_add (&assembly->list, &assembly_list_free);
  296. }
  297. static void assembly_deref_from_normal_and_trans (int nodeid)
  298. {
  299. int j;
  300. struct qb_list_head *list, *tmp_iter;
  301. struct qb_list_head *active_assembly_list_inuse;
  302. struct assembly *assembly;
  303. for (j = 0; j < 2; j++) {
  304. if (j == 0) {
  305. active_assembly_list_inuse = &assembly_list_inuse;
  306. } else {
  307. active_assembly_list_inuse = &assembly_list_inuse_trans;
  308. }
  309. qb_list_for_each_safe(list, tmp_iter, active_assembly_list_inuse) {
  310. assembly = qb_list_entry (list, struct assembly, list);
  311. if (nodeid == assembly->nodeid) {
  312. qb_list_del (&assembly->list);
  313. qb_list_add (&assembly->list, &assembly_list_free);
  314. }
  315. }
  316. }
  317. }
  318. static inline void app_confchg_fn (
  319. enum totem_configuration_type configuration_type,
  320. const unsigned int *member_list, size_t member_list_entries,
  321. const unsigned int *left_list, size_t left_list_entries,
  322. const unsigned int *joined_list, size_t joined_list_entries,
  323. const struct memb_ring_id *ring_id)
  324. {
  325. int i;
  326. struct totempg_group_instance *instance;
  327. struct qb_list_head *list;
  328. /*
  329. * For every leaving processor, add to free list
  330. * This also has the side effect of clearing out the dataset
  331. * In the leaving processor's assembly buffer.
  332. */
  333. for (i = 0; i < left_list_entries; i++) {
  334. assembly_deref_from_normal_and_trans (left_list[i]);
  335. }
  336. qb_list_for_each(list, &totempg_groups_list) {
  337. instance = qb_list_entry (list, struct totempg_group_instance, list);
  338. if (instance->confchg_fn) {
  339. instance->confchg_fn (
  340. configuration_type,
  341. member_list,
  342. member_list_entries,
  343. left_list,
  344. left_list_entries,
  345. joined_list,
  346. joined_list_entries,
  347. ring_id);
  348. }
  349. }
  350. }
  351. static inline void group_endian_convert (
  352. void *msg,
  353. int msg_len)
  354. {
  355. unsigned short *group_len;
  356. int i;
  357. char *aligned_msg;
  358. #ifdef TOTEMPG_NEED_ALIGN
  359. /*
  360. * Align data structure for not i386 or x86_64
  361. */
  362. if ((size_t)msg % 4 != 0) {
  363. aligned_msg = alloca(msg_len);
  364. memcpy(aligned_msg, msg, msg_len);
  365. } else {
  366. aligned_msg = msg;
  367. }
  368. #else
  369. aligned_msg = msg;
  370. #endif
  371. group_len = (unsigned short *)aligned_msg;
  372. group_len[0] = swab16(group_len[0]);
  373. for (i = 1; i < group_len[0] + 1; i++) {
  374. group_len[i] = swab16(group_len[i]);
  375. }
  376. if (aligned_msg != msg) {
  377. memcpy(msg, aligned_msg, msg_len);
  378. }
  379. }
  380. static inline int group_matches (
  381. struct iovec *iovec,
  382. unsigned int iov_len,
  383. struct totempg_group *groups_b,
  384. unsigned int group_b_cnt,
  385. unsigned int *adjust_iovec)
  386. {
  387. unsigned short *group_len;
  388. char *group_name;
  389. int i;
  390. int j;
  391. #ifdef TOTEMPG_NEED_ALIGN
  392. struct iovec iovec_aligned = { NULL, 0 };
  393. #endif
  394. assert (iov_len == 1);
  395. #ifdef TOTEMPG_NEED_ALIGN
  396. /*
  397. * Align data structure for not i386 or x86_64
  398. */
  399. if ((size_t)iovec->iov_base % 4 != 0) {
  400. iovec_aligned.iov_base = alloca(iovec->iov_len);
  401. memcpy(iovec_aligned.iov_base, iovec->iov_base, iovec->iov_len);
  402. iovec_aligned.iov_len = iovec->iov_len;
  403. iovec = &iovec_aligned;
  404. }
  405. #endif
  406. group_len = (unsigned short *)iovec->iov_base;
  407. group_name = ((char *)iovec->iov_base) +
  408. sizeof (unsigned short) * (group_len[0] + 1);
  409. /*
  410. * Calculate amount to adjust the iovec by before delivering to app
  411. */
  412. *adjust_iovec = sizeof (unsigned short) * (group_len[0] + 1);
  413. for (i = 1; i < group_len[0] + 1; i++) {
  414. *adjust_iovec += group_len[i];
  415. }
  416. /*
  417. * Determine if this message should be delivered to this instance
  418. */
  419. for (i = 1; i < group_len[0] + 1; i++) {
  420. for (j = 0; j < group_b_cnt; j++) {
  421. if ((group_len[i] == groups_b[j].group_len) &&
  422. (memcmp (groups_b[j].group, group_name, group_len[i]) == 0)) {
  423. return (1);
  424. }
  425. }
  426. group_name += group_len[i];
  427. }
  428. return (0);
  429. }
  430. static inline void app_deliver_fn (
  431. unsigned int nodeid,
  432. void *msg,
  433. unsigned int msg_len,
  434. int endian_conversion_required)
  435. {
  436. struct totempg_group_instance *instance;
  437. struct iovec stripped_iovec;
  438. unsigned int adjust_iovec;
  439. struct iovec *iovec;
  440. struct qb_list_head *list;
  441. struct iovec aligned_iovec = { NULL, 0 };
  442. if (endian_conversion_required) {
  443. group_endian_convert (msg, msg_len);
  444. }
  445. /*
  446. * TODO: segmentation/assembly need to be redesigned to provide aligned access
  447. * in all cases to avoid memory copies on non386 archs. Probably broke backwars
  448. * compatibility
  449. */
  450. #ifdef TOTEMPG_NEED_ALIGN
  451. /*
  452. * Align data structure for not i386 or x86_64
  453. */
  454. aligned_iovec.iov_base = alloca(msg_len);
  455. aligned_iovec.iov_len = msg_len;
  456. memcpy(aligned_iovec.iov_base, msg, msg_len);
  457. #else
  458. aligned_iovec.iov_base = msg;
  459. aligned_iovec.iov_len = msg_len;
  460. #endif
  461. iovec = &aligned_iovec;
  462. qb_list_for_each(list, &totempg_groups_list) {
  463. instance = qb_list_entry (list, struct totempg_group_instance, list);
  464. if (group_matches (iovec, 1, instance->groups, instance->groups_cnt, &adjust_iovec)) {
  465. stripped_iovec.iov_len = iovec->iov_len - adjust_iovec;
  466. stripped_iovec.iov_base = (char *)iovec->iov_base + adjust_iovec;
  467. #ifdef TOTEMPG_NEED_ALIGN
  468. /*
  469. * Align data structure for not i386 or x86_64
  470. */
  471. if ((char *)iovec->iov_base + adjust_iovec % 4 != 0) {
  472. /*
  473. * Deal with misalignment
  474. */
  475. stripped_iovec.iov_base =
  476. alloca (stripped_iovec.iov_len);
  477. memcpy (stripped_iovec.iov_base,
  478. (char *)iovec->iov_base + adjust_iovec,
  479. stripped_iovec.iov_len);
  480. }
  481. #endif
  482. instance->deliver_fn (
  483. nodeid,
  484. stripped_iovec.iov_base,
  485. stripped_iovec.iov_len,
  486. endian_conversion_required);
  487. }
  488. }
  489. }
  490. static void totempg_confchg_fn (
  491. enum totem_configuration_type configuration_type,
  492. const unsigned int *member_list, size_t member_list_entries,
  493. const unsigned int *left_list, size_t left_list_entries,
  494. const unsigned int *joined_list, size_t joined_list_entries,
  495. const struct memb_ring_id *ring_id)
  496. {
  497. // TODO optimize this
  498. app_confchg_fn (configuration_type,
  499. member_list, member_list_entries,
  500. left_list, left_list_entries,
  501. joined_list, joined_list_entries,
  502. ring_id);
  503. }
  504. static void totempg_deliver_fn (
  505. unsigned int nodeid,
  506. const void *msg,
  507. unsigned int msg_len,
  508. int endian_conversion_required)
  509. {
  510. struct totempg_mcast *mcast;
  511. unsigned short *msg_lens;
  512. int i;
  513. struct assembly *assembly;
  514. char header[FRAME_SIZE_MAX];
  515. int msg_count;
  516. int continuation;
  517. int start;
  518. const char *data;
  519. int datasize;
  520. struct iovec iov_delv;
  521. assembly = assembly_ref (nodeid);
  522. assert (assembly);
  523. /*
  524. * Assemble the header into one block of data and
  525. * assemble the packet contents into one block of data to simplify delivery
  526. */
  527. mcast = (struct totempg_mcast *)msg;
  528. if (endian_conversion_required) {
  529. mcast->msg_count = swab16 (mcast->msg_count);
  530. }
  531. msg_count = mcast->msg_count;
  532. datasize = sizeof (struct totempg_mcast) +
  533. msg_count * sizeof (unsigned short);
  534. memcpy (header, msg, datasize);
  535. data = msg;
  536. msg_lens = (unsigned short *) (header + sizeof (struct totempg_mcast));
  537. if (endian_conversion_required) {
  538. for (i = 0; i < mcast->msg_count; i++) {
  539. msg_lens[i] = swab16 (msg_lens[i]);
  540. }
  541. }
  542. memcpy (&assembly->data[assembly->index], &data[datasize],
  543. msg_len - datasize);
  544. /*
  545. * If the last message in the buffer is a fragment, then we
  546. * can't deliver it. We'll first deliver the full messages
  547. * then adjust the assembly buffer so we can add the rest of the
  548. * fragment when it arrives.
  549. */
  550. msg_count = mcast->fragmented ? mcast->msg_count - 1 : mcast->msg_count;
  551. continuation = mcast->continuation;
  552. iov_delv.iov_base = (void *)&assembly->data[0];
  553. iov_delv.iov_len = assembly->index + msg_lens[0];
  554. /*
  555. * Make sure that if this message is a continuation, that it
  556. * matches the sequence number of the previous fragment.
  557. * Also, if the first packed message is a continuation
  558. * of a previous message, but the assembly buffer
  559. * is empty, then we need to discard it since we can't
  560. * assemble a complete message. Likewise, if this message isn't a
  561. * continuation and the assembly buffer is empty, we have to discard
  562. * the continued message.
  563. */
  564. start = 0;
  565. if (assembly->throw_away_mode == THROW_AWAY_ACTIVE) {
  566. /* Throw away the first msg block */
  567. if (mcast->fragmented == 0 || mcast->fragmented == 1) {
  568. assembly->throw_away_mode = THROW_AWAY_INACTIVE;
  569. assembly->index += msg_lens[0];
  570. iov_delv.iov_base = (void *)&assembly->data[assembly->index];
  571. iov_delv.iov_len = msg_lens[1];
  572. start = 1;
  573. }
  574. } else
  575. if (assembly->throw_away_mode == THROW_AWAY_INACTIVE) {
  576. if (continuation == assembly->last_frag_num) {
  577. assembly->last_frag_num = mcast->fragmented;
  578. for (i = start; i < msg_count; i++) {
  579. app_deliver_fn(nodeid, iov_delv.iov_base, iov_delv.iov_len,
  580. endian_conversion_required);
  581. assembly->index += msg_lens[i];
  582. iov_delv.iov_base = (void *)&assembly->data[assembly->index];
  583. if (i < (msg_count - 1)) {
  584. iov_delv.iov_len = msg_lens[i + 1];
  585. }
  586. }
  587. } else {
  588. log_printf (LOG_DEBUG, "fragmented continuation %u is not equal to assembly last_frag_num %u",
  589. continuation, assembly->last_frag_num);
  590. assembly->throw_away_mode = THROW_AWAY_ACTIVE;
  591. }
  592. }
  593. if (mcast->fragmented == 0) {
  594. /*
  595. * End of messages, dereference assembly struct
  596. */
  597. assembly->last_frag_num = 0;
  598. assembly->index = 0;
  599. assembly_deref (assembly);
  600. } else {
  601. /*
  602. * Message is fragmented, keep around assembly list
  603. */
  604. if (mcast->msg_count > 1) {
  605. memmove (&assembly->data[0],
  606. &assembly->data[assembly->index],
  607. msg_lens[msg_count]);
  608. assembly->index = 0;
  609. }
  610. assembly->index += msg_lens[msg_count];
  611. }
  612. }
  613. /*
  614. * Totem Process Group Abstraction
  615. * depends on poll abstraction, POSIX, IPV4
  616. */
  617. void *callback_token_received_handle;
  618. int callback_token_received_fn (enum totem_callback_token_type type,
  619. const void *data)
  620. {
  621. struct totempg_mcast mcast;
  622. struct iovec iovecs[3];
  623. if (totempg_threaded_mode == 1) {
  624. pthread_mutex_lock (&mcast_msg_mutex);
  625. }
  626. if (mcast_packed_msg_count == 0) {
  627. if (totempg_threaded_mode == 1) {
  628. pthread_mutex_unlock (&mcast_msg_mutex);
  629. }
  630. return (0);
  631. }
  632. if (totemsrp_avail(totemsrp_context) == 0) {
  633. if (totempg_threaded_mode == 1) {
  634. pthread_mutex_unlock (&mcast_msg_mutex);
  635. }
  636. return (0);
  637. }
  638. mcast.header.version = 0;
  639. mcast.header.type = 0;
  640. mcast.fragmented = 0;
  641. /*
  642. * Was the first message in this buffer a continuation of a
  643. * fragmented message?
  644. */
  645. mcast.continuation = fragment_continuation;
  646. fragment_continuation = 0;
  647. mcast.msg_count = mcast_packed_msg_count;
  648. iovecs[0].iov_base = (void *)&mcast;
  649. iovecs[0].iov_len = sizeof (struct totempg_mcast);
  650. iovecs[1].iov_base = (void *)mcast_packed_msg_lens;
  651. iovecs[1].iov_len = mcast_packed_msg_count * sizeof (unsigned short);
  652. iovecs[2].iov_base = (void *)&fragmentation_data[0];
  653. iovecs[2].iov_len = fragment_size;
  654. (void)totemsrp_mcast (totemsrp_context, iovecs, 3, 0);
  655. mcast_packed_msg_count = 0;
  656. fragment_size = 0;
  657. if (totempg_threaded_mode == 1) {
  658. pthread_mutex_unlock (&mcast_msg_mutex);
  659. }
  660. return (0);
  661. }
  662. /*
  663. * Initialize the totem process group abstraction
  664. */
  665. int totempg_initialize (
  666. qb_loop_t *poll_handle,
  667. struct totem_config *totem_config)
  668. {
  669. int res;
  670. totempg_totem_config = totem_config;
  671. totempg_log_level_security = totem_config->totem_logging_configuration.log_level_security;
  672. totempg_log_level_error = totem_config->totem_logging_configuration.log_level_error;
  673. totempg_log_level_warning = totem_config->totem_logging_configuration.log_level_warning;
  674. totempg_log_level_notice = totem_config->totem_logging_configuration.log_level_notice;
  675. totempg_log_level_debug = totem_config->totem_logging_configuration.log_level_debug;
  676. totempg_log_printf = totem_config->totem_logging_configuration.log_printf;
  677. totempg_subsys_id = totem_config->totem_logging_configuration.log_subsys_id;
  678. fragmentation_data = malloc (TOTEMPG_PACKET_SIZE);
  679. if (fragmentation_data == 0) {
  680. return (-1);
  681. }
  682. totemsrp_net_mtu_adjust (totem_config);
  683. res = totemsrp_initialize (
  684. poll_handle,
  685. &totemsrp_context,
  686. totem_config,
  687. &totempg_stats,
  688. totempg_deliver_fn,
  689. totempg_confchg_fn,
  690. totempg_waiting_trans_ack_cb);
  691. if (res == -1) {
  692. goto error_exit;
  693. }
  694. totemsrp_callback_token_create (
  695. totemsrp_context,
  696. &callback_token_received_handle,
  697. TOTEM_CALLBACK_TOKEN_RECEIVED,
  698. 0,
  699. callback_token_received_fn,
  700. 0);
  701. totempg_size_limit = (totemsrp_avail(totemsrp_context) - 1) *
  702. (totempg_totem_config->net_mtu -
  703. sizeof (struct totempg_mcast) - 16);
  704. qb_list_init (&totempg_groups_list);
  705. error_exit:
  706. return (res);
  707. }
  708. void totempg_finalize (void)
  709. {
  710. if (totempg_threaded_mode == 1) {
  711. pthread_mutex_lock (&totempg_mutex);
  712. }
  713. totemsrp_finalize (totemsrp_context);
  714. if (totempg_threaded_mode == 1) {
  715. pthread_mutex_unlock (&totempg_mutex);
  716. }
  717. }
  718. /*
  719. * Multicast a message
  720. */
  721. static int mcast_msg (
  722. struct iovec *iovec_in,
  723. unsigned int iov_len,
  724. int guarantee)
  725. {
  726. int res = 0;
  727. struct totempg_mcast mcast;
  728. struct iovec iovecs[3];
  729. struct iovec iovec[64];
  730. int i;
  731. int dest, src;
  732. int max_packet_size = 0;
  733. int copy_len = 0;
  734. int copy_base = 0;
  735. int total_size = 0;
  736. if (totempg_threaded_mode == 1) {
  737. pthread_mutex_lock (&mcast_msg_mutex);
  738. }
  739. totemsrp_event_signal (totemsrp_context, TOTEM_EVENT_NEW_MSG, 1);
  740. /*
  741. * Remove zero length iovectors from the list
  742. */
  743. assert (iov_len < 64);
  744. for (dest = 0, src = 0; src < iov_len; src++) {
  745. if (iovec_in[src].iov_len) {
  746. memcpy (&iovec[dest++], &iovec_in[src],
  747. sizeof (struct iovec));
  748. }
  749. }
  750. iov_len = dest;
  751. max_packet_size = TOTEMPG_PACKET_SIZE -
  752. (sizeof (unsigned short) * (mcast_packed_msg_count + 1));
  753. mcast_packed_msg_lens[mcast_packed_msg_count] = 0;
  754. /*
  755. * Check if we would overwrite new message queue
  756. */
  757. for (i = 0; i < iov_len; i++) {
  758. total_size += iovec[i].iov_len;
  759. }
  760. if (byte_count_send_ok (total_size + sizeof(unsigned short) *
  761. (mcast_packed_msg_count)) == 0) {
  762. if (totempg_threaded_mode == 1) {
  763. pthread_mutex_unlock (&mcast_msg_mutex);
  764. }
  765. return(-1);
  766. }
  767. mcast.header.version = 0;
  768. for (i = 0; i < iov_len; ) {
  769. mcast.fragmented = 0;
  770. mcast.continuation = fragment_continuation;
  771. copy_len = iovec[i].iov_len - copy_base;
  772. /*
  773. * If it all fits with room left over, copy it in.
  774. * We need to leave at least sizeof(short) + 1 bytes in the
  775. * fragment_buffer on exit so that max_packet_size + fragment_size
  776. * doesn't exceed the size of the fragment_buffer on the next call.
  777. */
  778. if ((copy_len + fragment_size) <
  779. (max_packet_size - sizeof (unsigned short))) {
  780. memcpy (&fragmentation_data[fragment_size],
  781. (char *)iovec[i].iov_base + copy_base, copy_len);
  782. fragment_size += copy_len;
  783. mcast_packed_msg_lens[mcast_packed_msg_count] += copy_len;
  784. next_fragment = 1;
  785. copy_len = 0;
  786. copy_base = 0;
  787. i++;
  788. continue;
  789. /*
  790. * If it just fits or is too big, then send out what fits.
  791. */
  792. } else {
  793. unsigned char *data_ptr;
  794. copy_len = min(copy_len, max_packet_size - fragment_size);
  795. if( copy_len == max_packet_size )
  796. data_ptr = (unsigned char *)iovec[i].iov_base + copy_base;
  797. else {
  798. data_ptr = fragmentation_data;
  799. }
  800. memcpy (&fragmentation_data[fragment_size],
  801. (unsigned char *)iovec[i].iov_base + copy_base, copy_len);
  802. mcast_packed_msg_lens[mcast_packed_msg_count] += copy_len;
  803. /*
  804. * if we're not on the last iovec or the iovec is too large to
  805. * fit, then indicate a fragment. This also means that the next
  806. * message will have the continuation of this one.
  807. */
  808. if ((i < (iov_len - 1)) ||
  809. ((copy_base + copy_len) < iovec[i].iov_len)) {
  810. if (!next_fragment) {
  811. next_fragment++;
  812. }
  813. fragment_continuation = next_fragment;
  814. mcast.fragmented = next_fragment++;
  815. assert(fragment_continuation != 0);
  816. assert(mcast.fragmented != 0);
  817. } else {
  818. fragment_continuation = 0;
  819. }
  820. /*
  821. * assemble the message and send it
  822. */
  823. mcast.msg_count = ++mcast_packed_msg_count;
  824. iovecs[0].iov_base = (void *)&mcast;
  825. iovecs[0].iov_len = sizeof(struct totempg_mcast);
  826. iovecs[1].iov_base = (void *)mcast_packed_msg_lens;
  827. iovecs[1].iov_len = mcast_packed_msg_count *
  828. sizeof(unsigned short);
  829. iovecs[2].iov_base = (void *)data_ptr;
  830. iovecs[2].iov_len = max_packet_size;
  831. assert (totemsrp_avail(totemsrp_context) > 0);
  832. res = totemsrp_mcast (totemsrp_context, iovecs, 3, guarantee);
  833. if (res == -1) {
  834. goto error_exit;
  835. }
  836. /*
  837. * Recalculate counts and indexes for the next.
  838. */
  839. mcast_packed_msg_lens[0] = 0;
  840. mcast_packed_msg_count = 0;
  841. fragment_size = 0;
  842. max_packet_size = TOTEMPG_PACKET_SIZE - (sizeof(unsigned short));
  843. /*
  844. * If the iovec all fit, go to the next iovec
  845. */
  846. if ((copy_base + copy_len) == iovec[i].iov_len) {
  847. copy_len = 0;
  848. copy_base = 0;
  849. i++;
  850. /*
  851. * Continue with the rest of the current iovec.
  852. */
  853. } else {
  854. copy_base += copy_len;
  855. }
  856. }
  857. }
  858. /*
  859. * Bump only if we added message data. This may be zero if
  860. * the last buffer just fit into the fragmentation_data buffer
  861. * and we were at the last iovec.
  862. */
  863. if (mcast_packed_msg_lens[mcast_packed_msg_count]) {
  864. mcast_packed_msg_count++;
  865. }
  866. error_exit:
  867. if (totempg_threaded_mode == 1) {
  868. pthread_mutex_unlock (&mcast_msg_mutex);
  869. }
  870. return (res);
  871. }
  872. /*
  873. * Determine if a message of msg_size could be queued
  874. */
  875. static int msg_count_send_ok (
  876. int msg_count)
  877. {
  878. int avail = 0;
  879. avail = totemsrp_avail (totemsrp_context);
  880. totempg_stats.msg_queue_avail = avail;
  881. return ((avail - totempg_reserved) > msg_count);
  882. }
  883. static int byte_count_send_ok (
  884. int byte_count)
  885. {
  886. unsigned int msg_count = 0;
  887. int avail = 0;
  888. avail = totemsrp_avail (totemsrp_context);
  889. msg_count = (byte_count / (totempg_totem_config->net_mtu - sizeof (struct totempg_mcast) - 16)) + 1;
  890. return (avail >= msg_count);
  891. }
  892. static int send_reserve (
  893. int msg_size)
  894. {
  895. unsigned int msg_count = 0;
  896. msg_count = (msg_size / (totempg_totem_config->net_mtu - sizeof (struct totempg_mcast) - 16)) + 1;
  897. totempg_reserved += msg_count;
  898. totempg_stats.msg_reserved = totempg_reserved;
  899. return (msg_count);
  900. }
  901. static void send_release (
  902. int msg_count)
  903. {
  904. totempg_reserved -= msg_count;
  905. totempg_stats.msg_reserved = totempg_reserved;
  906. }
  907. #ifndef HAVE_SMALL_MEMORY_FOOTPRINT
  908. #undef MESSAGE_QUEUE_MAX
  909. #define MESSAGE_QUEUE_MAX ((4 * MESSAGE_SIZE_MAX) / totempg_totem_config->net_mtu)
  910. #endif /* HAVE_SMALL_MEMORY_FOOTPRINT */
  911. static uint32_t q_level_precent_used(void)
  912. {
  913. return (100 - (((totemsrp_avail(totemsrp_context) - totempg_reserved) * 100) / MESSAGE_QUEUE_MAX));
  914. }
  915. int totempg_callback_token_create (
  916. void **handle_out,
  917. enum totem_callback_token_type type,
  918. int delete,
  919. int (*callback_fn) (enum totem_callback_token_type type, const void *),
  920. const void *data)
  921. {
  922. unsigned int res;
  923. if (totempg_threaded_mode == 1) {
  924. pthread_mutex_lock (&callback_token_mutex);
  925. }
  926. res = totemsrp_callback_token_create (totemsrp_context, handle_out, type, delete,
  927. callback_fn, data);
  928. if (totempg_threaded_mode == 1) {
  929. pthread_mutex_unlock (&callback_token_mutex);
  930. }
  931. return (res);
  932. }
  933. void totempg_callback_token_destroy (
  934. void *handle_out)
  935. {
  936. if (totempg_threaded_mode == 1) {
  937. pthread_mutex_lock (&callback_token_mutex);
  938. }
  939. totemsrp_callback_token_destroy (totemsrp_context, handle_out);
  940. if (totempg_threaded_mode == 1) {
  941. pthread_mutex_unlock (&callback_token_mutex);
  942. }
  943. }
  944. /*
  945. * vi: set autoindent tabstop=4 shiftwidth=4 :
  946. */
  947. int totempg_groups_initialize (
  948. void **totempg_groups_instance,
  949. void (*deliver_fn) (
  950. unsigned int nodeid,
  951. const void *msg,
  952. unsigned int msg_len,
  953. int endian_conversion_required),
  954. void (*confchg_fn) (
  955. enum totem_configuration_type configuration_type,
  956. const unsigned int *member_list, size_t member_list_entries,
  957. const unsigned int *left_list, size_t left_list_entries,
  958. const unsigned int *joined_list, size_t joined_list_entries,
  959. const struct memb_ring_id *ring_id))
  960. {
  961. struct totempg_group_instance *instance;
  962. if (totempg_threaded_mode == 1) {
  963. pthread_mutex_lock (&totempg_mutex);
  964. }
  965. instance = malloc (sizeof (struct totempg_group_instance));
  966. if (instance == NULL) {
  967. goto error_exit;
  968. }
  969. instance->deliver_fn = deliver_fn;
  970. instance->confchg_fn = confchg_fn;
  971. instance->groups = 0;
  972. instance->groups_cnt = 0;
  973. instance->q_level = QB_LOOP_MED;
  974. qb_list_init (&instance->list);
  975. qb_list_add (&instance->list, &totempg_groups_list);
  976. if (totempg_threaded_mode == 1) {
  977. pthread_mutex_unlock (&totempg_mutex);
  978. }
  979. *totempg_groups_instance = instance;
  980. return (0);
  981. error_exit:
  982. if (totempg_threaded_mode == 1) {
  983. pthread_mutex_unlock (&totempg_mutex);
  984. }
  985. return (-1);
  986. }
  987. int totempg_groups_join (
  988. void *totempg_groups_instance,
  989. const struct totempg_group *groups,
  990. size_t group_cnt)
  991. {
  992. struct totempg_group_instance *instance = (struct totempg_group_instance *)totempg_groups_instance;
  993. struct totempg_group *new_groups;
  994. int res = 0;
  995. if (totempg_threaded_mode == 1) {
  996. pthread_mutex_lock (&totempg_mutex);
  997. }
  998. new_groups = realloc (instance->groups,
  999. sizeof (struct totempg_group) *
  1000. (instance->groups_cnt + group_cnt));
  1001. if (new_groups == 0) {
  1002. res = -1;
  1003. goto error_exit;
  1004. }
  1005. memcpy (&new_groups[instance->groups_cnt],
  1006. groups, group_cnt * sizeof (struct totempg_group));
  1007. instance->groups = new_groups;
  1008. instance->groups_cnt += group_cnt;
  1009. error_exit:
  1010. if (totempg_threaded_mode == 1) {
  1011. pthread_mutex_unlock (&totempg_mutex);
  1012. }
  1013. return (res);
  1014. }
  1015. int totempg_groups_leave (
  1016. void *totempg_groups_instance,
  1017. const struct totempg_group *groups,
  1018. size_t group_cnt)
  1019. {
  1020. if (totempg_threaded_mode == 1) {
  1021. pthread_mutex_lock (&totempg_mutex);
  1022. }
  1023. if (totempg_threaded_mode == 1) {
  1024. pthread_mutex_unlock (&totempg_mutex);
  1025. }
  1026. return (0);
  1027. }
  1028. #define MAX_IOVECS_FROM_APP 32
  1029. #define MAX_GROUPS_PER_MSG 32
  1030. int totempg_groups_mcast_joined (
  1031. void *totempg_groups_instance,
  1032. const struct iovec *iovec,
  1033. unsigned int iov_len,
  1034. int guarantee)
  1035. {
  1036. struct totempg_group_instance *instance = (struct totempg_group_instance *)totempg_groups_instance;
  1037. unsigned short group_len[MAX_GROUPS_PER_MSG + 1];
  1038. struct iovec iovec_mcast[MAX_GROUPS_PER_MSG + 1 + MAX_IOVECS_FROM_APP];
  1039. int i;
  1040. unsigned int res;
  1041. if (totempg_threaded_mode == 1) {
  1042. pthread_mutex_lock (&totempg_mutex);
  1043. }
  1044. /*
  1045. * Build group_len structure and the iovec_mcast structure
  1046. */
  1047. group_len[0] = instance->groups_cnt;
  1048. for (i = 0; i < instance->groups_cnt; i++) {
  1049. group_len[i + 1] = instance->groups[i].group_len;
  1050. iovec_mcast[i + 1].iov_len = instance->groups[i].group_len;
  1051. iovec_mcast[i + 1].iov_base = (void *) instance->groups[i].group;
  1052. }
  1053. iovec_mcast[0].iov_len = (instance->groups_cnt + 1) * sizeof (unsigned short);
  1054. iovec_mcast[0].iov_base = group_len;
  1055. for (i = 0; i < iov_len; i++) {
  1056. iovec_mcast[i + instance->groups_cnt + 1].iov_len = iovec[i].iov_len;
  1057. iovec_mcast[i + instance->groups_cnt + 1].iov_base = iovec[i].iov_base;
  1058. }
  1059. res = mcast_msg (iovec_mcast, iov_len + instance->groups_cnt + 1, guarantee);
  1060. if (totempg_threaded_mode == 1) {
  1061. pthread_mutex_unlock (&totempg_mutex);
  1062. }
  1063. return (res);
  1064. }
  1065. static void check_q_level(
  1066. void *totempg_groups_instance)
  1067. {
  1068. struct totempg_group_instance *instance = (struct totempg_group_instance *)totempg_groups_instance;
  1069. int32_t old_level = instance->q_level;
  1070. int32_t percent_used = q_level_precent_used();
  1071. if (percent_used >= 75 && instance->q_level != TOTEM_Q_LEVEL_CRITICAL) {
  1072. instance->q_level = TOTEM_Q_LEVEL_CRITICAL;
  1073. } else if (percent_used < 30 && instance->q_level != TOTEM_Q_LEVEL_LOW) {
  1074. instance->q_level = TOTEM_Q_LEVEL_LOW;
  1075. } else if (percent_used > 40 && percent_used < 50 && instance->q_level != TOTEM_Q_LEVEL_GOOD) {
  1076. instance->q_level = TOTEM_Q_LEVEL_GOOD;
  1077. } else if (percent_used > 60 && percent_used < 70 && instance->q_level != TOTEM_Q_LEVEL_HIGH) {
  1078. instance->q_level = TOTEM_Q_LEVEL_HIGH;
  1079. }
  1080. if (totem_queue_level_changed && old_level != instance->q_level) {
  1081. totem_queue_level_changed(instance->q_level);
  1082. }
  1083. }
  1084. void totempg_check_q_level(
  1085. void *totempg_groups_instance)
  1086. {
  1087. struct totempg_group_instance *instance = (struct totempg_group_instance *)totempg_groups_instance;
  1088. check_q_level(instance);
  1089. }
  1090. int totempg_groups_joined_reserve (
  1091. void *totempg_groups_instance,
  1092. const struct iovec *iovec,
  1093. unsigned int iov_len)
  1094. {
  1095. struct totempg_group_instance *instance = (struct totempg_group_instance *)totempg_groups_instance;
  1096. unsigned int size = 0;
  1097. unsigned int i;
  1098. unsigned int reserved = 0;
  1099. if (totempg_threaded_mode == 1) {
  1100. pthread_mutex_lock (&totempg_mutex);
  1101. pthread_mutex_lock (&mcast_msg_mutex);
  1102. }
  1103. for (i = 0; i < instance->groups_cnt; i++) {
  1104. size += instance->groups[i].group_len;
  1105. }
  1106. for (i = 0; i < iov_len; i++) {
  1107. size += iovec[i].iov_len;
  1108. }
  1109. if (size >= totempg_size_limit) {
  1110. reserved = -1;
  1111. goto error_exit;
  1112. }
  1113. if (byte_count_send_ok (size)) {
  1114. reserved = send_reserve (size);
  1115. } else {
  1116. reserved = 0;
  1117. }
  1118. error_exit:
  1119. check_q_level(instance);
  1120. if (totempg_threaded_mode == 1) {
  1121. pthread_mutex_unlock (&mcast_msg_mutex);
  1122. pthread_mutex_unlock (&totempg_mutex);
  1123. }
  1124. return (reserved);
  1125. }
  1126. int totempg_groups_joined_release (int msg_count)
  1127. {
  1128. if (totempg_threaded_mode == 1) {
  1129. pthread_mutex_lock (&totempg_mutex);
  1130. pthread_mutex_lock (&mcast_msg_mutex);
  1131. }
  1132. send_release (msg_count);
  1133. if (totempg_threaded_mode == 1) {
  1134. pthread_mutex_unlock (&mcast_msg_mutex);
  1135. pthread_mutex_unlock (&totempg_mutex);
  1136. }
  1137. return 0;
  1138. }
  1139. int totempg_groups_mcast_groups (
  1140. void *totempg_groups_instance,
  1141. int guarantee,
  1142. const struct totempg_group *groups,
  1143. size_t groups_cnt,
  1144. const struct iovec *iovec,
  1145. unsigned int iov_len)
  1146. {
  1147. unsigned short group_len[MAX_GROUPS_PER_MSG + 1];
  1148. struct iovec iovec_mcast[MAX_GROUPS_PER_MSG + 1 + MAX_IOVECS_FROM_APP];
  1149. int i;
  1150. unsigned int res;
  1151. if (totempg_threaded_mode == 1) {
  1152. pthread_mutex_lock (&totempg_mutex);
  1153. }
  1154. /*
  1155. * Build group_len structure and the iovec_mcast structure
  1156. */
  1157. group_len[0] = groups_cnt;
  1158. for (i = 0; i < groups_cnt; i++) {
  1159. group_len[i + 1] = groups[i].group_len;
  1160. iovec_mcast[i + 1].iov_len = groups[i].group_len;
  1161. iovec_mcast[i + 1].iov_base = (void *) groups[i].group;
  1162. }
  1163. iovec_mcast[0].iov_len = (groups_cnt + 1) * sizeof (unsigned short);
  1164. iovec_mcast[0].iov_base = group_len;
  1165. for (i = 0; i < iov_len; i++) {
  1166. iovec_mcast[i + groups_cnt + 1].iov_len = iovec[i].iov_len;
  1167. iovec_mcast[i + groups_cnt + 1].iov_base = iovec[i].iov_base;
  1168. }
  1169. res = mcast_msg (iovec_mcast, iov_len + groups_cnt + 1, guarantee);
  1170. if (totempg_threaded_mode == 1) {
  1171. pthread_mutex_unlock (&totempg_mutex);
  1172. }
  1173. return (res);
  1174. }
  1175. /*
  1176. * Returns -1 if error, 0 if can't send, 1 if can send the message
  1177. */
  1178. int totempg_groups_send_ok_groups (
  1179. void *totempg_groups_instance,
  1180. const struct totempg_group *groups,
  1181. size_t groups_cnt,
  1182. const struct iovec *iovec,
  1183. unsigned int iov_len)
  1184. {
  1185. unsigned int size = 0;
  1186. unsigned int i;
  1187. unsigned int res;
  1188. if (totempg_threaded_mode == 1) {
  1189. pthread_mutex_lock (&totempg_mutex);
  1190. }
  1191. for (i = 0; i < groups_cnt; i++) {
  1192. size += groups[i].group_len;
  1193. }
  1194. for (i = 0; i < iov_len; i++) {
  1195. size += iovec[i].iov_len;
  1196. }
  1197. res = msg_count_send_ok (size);
  1198. if (totempg_threaded_mode == 1) {
  1199. pthread_mutex_unlock (&totempg_mutex);
  1200. }
  1201. return (res);
  1202. }
  1203. int totempg_ifaces_get (
  1204. unsigned int nodeid,
  1205. struct totem_ip_address *interfaces,
  1206. unsigned int interfaces_size,
  1207. char ***status,
  1208. unsigned int *iface_count)
  1209. {
  1210. int res;
  1211. res = totemsrp_ifaces_get (
  1212. totemsrp_context,
  1213. nodeid,
  1214. interfaces,
  1215. interfaces_size,
  1216. status,
  1217. iface_count);
  1218. return (res);
  1219. }
  1220. void totempg_event_signal (enum totem_event_type type, int value)
  1221. {
  1222. totemsrp_event_signal (totemsrp_context, type, value);
  1223. }
  1224. void* totempg_get_stats (void)
  1225. {
  1226. return &totempg_stats;
  1227. }
  1228. int totempg_crypto_set (
  1229. const char *cipher_type,
  1230. const char *hash_type)
  1231. {
  1232. int res;
  1233. res = totemsrp_crypto_set (totemsrp_context, cipher_type, hash_type);
  1234. return (res);
  1235. }
  1236. int totempg_ring_reenable (void)
  1237. {
  1238. int res;
  1239. res = totemsrp_ring_reenable (totemsrp_context);
  1240. return (res);
  1241. }
  1242. #define ONE_IFACE_LEN 63
  1243. const char *totempg_ifaces_print (unsigned int nodeid)
  1244. {
  1245. static char iface_string[256 * INTERFACE_MAX];
  1246. char one_iface[ONE_IFACE_LEN+1];
  1247. struct totem_ip_address interfaces[INTERFACE_MAX];
  1248. unsigned int iface_count;
  1249. unsigned int i;
  1250. int res;
  1251. iface_string[0] = '\0';
  1252. res = totempg_ifaces_get (nodeid, interfaces, INTERFACE_MAX, NULL, &iface_count);
  1253. if (res == -1) {
  1254. return ("no interface found for nodeid");
  1255. }
  1256. res = totempg_ifaces_get (nodeid, interfaces, INTERFACE_MAX, NULL, &iface_count);
  1257. for (i = 0; i < iface_count; i++) {
  1258. snprintf (one_iface, ONE_IFACE_LEN,
  1259. "r(%d) ip(%s) ",
  1260. i, totemip_print (&interfaces[i]));
  1261. strcat (iface_string, one_iface);
  1262. }
  1263. return (iface_string);
  1264. }
  1265. unsigned int totempg_my_nodeid_get (void)
  1266. {
  1267. return (totemsrp_my_nodeid_get(totemsrp_context));
  1268. }
  1269. int totempg_my_family_get (void)
  1270. {
  1271. return (totemsrp_my_family_get(totemsrp_context));
  1272. }
  1273. extern void totempg_service_ready_register (
  1274. void (*totem_service_ready) (void))
  1275. {
  1276. totemsrp_service_ready_register (totemsrp_context, totem_service_ready);
  1277. }
  1278. void totempg_queue_level_register_callback (totem_queue_level_changed_fn fn)
  1279. {
  1280. totem_queue_level_changed = fn;
  1281. }
  1282. extern int totempg_member_add (
  1283. const struct totem_ip_address *member,
  1284. int ring_no)
  1285. {
  1286. return totemsrp_member_add (totemsrp_context, member, ring_no);
  1287. }
  1288. extern int totempg_member_remove (
  1289. const struct totem_ip_address *member,
  1290. int ring_no)
  1291. {
  1292. return totemsrp_member_remove (totemsrp_context, member, ring_no);
  1293. }
  1294. void totempg_threaded_mode_enable (void)
  1295. {
  1296. totempg_threaded_mode = 1;
  1297. totemsrp_threaded_mode_enable (totemsrp_context);
  1298. }
  1299. void totempg_trans_ack (void)
  1300. {
  1301. totemsrp_trans_ack (totemsrp_context);
  1302. }