4
0

totempg.c 39 KB

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