totempg.c 40 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588
  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 "util.h"
  105. #include "totemsrp.h"
  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+KNET_MAX_PACKET_SIZE];
  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. size_t expected_msg_len;
  522. assembly = assembly_ref (nodeid);
  523. assert (assembly);
  524. if (msg_len < sizeof(struct totempg_mcast)) {
  525. log_printf(LOG_WARNING,
  526. "Message (totempg_mcast) received from node " CS_PRI_NODE_ID " is too short... Ignoring.", nodeid);
  527. assert(0);
  528. return ;
  529. }
  530. /*
  531. * Assemble the header into one block of data and
  532. * assemble the packet contents into one block of data to simplify delivery
  533. */
  534. mcast = (struct totempg_mcast *)msg;
  535. if (endian_conversion_required) {
  536. mcast->msg_count = swab16 (mcast->msg_count);
  537. }
  538. msg_count = mcast->msg_count;
  539. datasize = sizeof (struct totempg_mcast) +
  540. msg_count * sizeof (unsigned short);
  541. if (msg_len < datasize) {
  542. log_printf(LOG_WARNING,
  543. "Message (totempg_mcast datasize) received from node " CS_PRI_NODE_ID
  544. " is too short... Ignoring.", nodeid);
  545. assert(0);
  546. return ;
  547. }
  548. memcpy (header, msg, datasize);
  549. data = msg;
  550. msg_lens = (unsigned short *) (header + sizeof (struct totempg_mcast));
  551. expected_msg_len = datasize;
  552. for (i = 0; i < mcast->msg_count; i++) {
  553. if (endian_conversion_required) {
  554. msg_lens[i] = swab16 (msg_lens[i]);
  555. }
  556. expected_msg_len += msg_lens[i];
  557. }
  558. if (msg_len != expected_msg_len) {
  559. log_printf(LOG_WARNING,
  560. "Message (totempg_mcast) received from node " CS_PRI_NODE_ID
  561. " doesn't have expected length of %zu (has %u) bytes... Ignoring.",
  562. nodeid, expected_msg_len, msg_len);
  563. assert(0);
  564. return ;
  565. }
  566. assert((assembly->index+msg_len) < sizeof(assembly->data));
  567. memcpy (&assembly->data[assembly->index], &data[datasize],
  568. msg_len - datasize);
  569. /*
  570. * If the last message in the buffer is a fragment, then we
  571. * can't deliver it. We'll first deliver the full messages
  572. * then adjust the assembly buffer so we can add the rest of the
  573. * fragment when it arrives.
  574. */
  575. msg_count = mcast->fragmented ? mcast->msg_count - 1 : mcast->msg_count;
  576. continuation = mcast->continuation;
  577. iov_delv.iov_base = (void *)&assembly->data[0];
  578. iov_delv.iov_len = assembly->index + msg_lens[0];
  579. /*
  580. * Make sure that if this message is a continuation, that it
  581. * matches the sequence number of the previous fragment.
  582. * Also, if the first packed message is a continuation
  583. * of a previous message, but the assembly buffer
  584. * is empty, then we need to discard it since we can't
  585. * assemble a complete message. Likewise, if this message isn't a
  586. * continuation and the assembly buffer is empty, we have to discard
  587. * the continued message.
  588. */
  589. start = 0;
  590. if (assembly->throw_away_mode == THROW_AWAY_ACTIVE) {
  591. /* Throw away the first msg block */
  592. if (mcast->fragmented == 0 || mcast->fragmented == 1) {
  593. assembly->throw_away_mode = THROW_AWAY_INACTIVE;
  594. assembly->index += msg_lens[0];
  595. iov_delv.iov_base = (void *)&assembly->data[assembly->index];
  596. iov_delv.iov_len = msg_lens[1];
  597. start = 1;
  598. }
  599. } else
  600. if (assembly->throw_away_mode == THROW_AWAY_INACTIVE) {
  601. if (continuation == assembly->last_frag_num) {
  602. assembly->last_frag_num = mcast->fragmented;
  603. for (i = start; i < msg_count; i++) {
  604. app_deliver_fn(nodeid, iov_delv.iov_base, iov_delv.iov_len,
  605. endian_conversion_required);
  606. assembly->index += msg_lens[i];
  607. iov_delv.iov_base = (void *)&assembly->data[assembly->index];
  608. if (i < (msg_count - 1)) {
  609. iov_delv.iov_len = msg_lens[i + 1];
  610. }
  611. }
  612. } else {
  613. log_printf (LOG_DEBUG, "fragmented continuation %u is not equal to assembly last_frag_num %u",
  614. continuation, assembly->last_frag_num);
  615. assembly->throw_away_mode = THROW_AWAY_ACTIVE;
  616. }
  617. }
  618. if (mcast->fragmented == 0) {
  619. /*
  620. * End of messages, dereference assembly struct
  621. */
  622. assembly->last_frag_num = 0;
  623. assembly->index = 0;
  624. assembly_deref (assembly);
  625. } else {
  626. /*
  627. * Message is fragmented, keep around assembly list
  628. */
  629. if (mcast->msg_count > 1) {
  630. memmove (&assembly->data[0],
  631. &assembly->data[assembly->index],
  632. msg_lens[msg_count]);
  633. assembly->index = 0;
  634. }
  635. assembly->index += msg_lens[msg_count];
  636. }
  637. }
  638. /*
  639. * Totem Process Group Abstraction
  640. * depends on poll abstraction, POSIX, IPV4
  641. */
  642. void *callback_token_received_handle;
  643. int callback_token_received_fn (enum totem_callback_token_type type,
  644. const void *data)
  645. {
  646. struct totempg_mcast mcast;
  647. struct iovec iovecs[3];
  648. if (totempg_threaded_mode == 1) {
  649. pthread_mutex_lock (&mcast_msg_mutex);
  650. }
  651. if (mcast_packed_msg_count == 0) {
  652. if (totempg_threaded_mode == 1) {
  653. pthread_mutex_unlock (&mcast_msg_mutex);
  654. }
  655. return (0);
  656. }
  657. if (totemsrp_avail(totemsrp_context) == 0) {
  658. if (totempg_threaded_mode == 1) {
  659. pthread_mutex_unlock (&mcast_msg_mutex);
  660. }
  661. return (0);
  662. }
  663. mcast.header.version = 0;
  664. mcast.header.type = 0;
  665. mcast.fragmented = 0;
  666. /*
  667. * Was the first message in this buffer a continuation of a
  668. * fragmented message?
  669. */
  670. mcast.continuation = fragment_continuation;
  671. fragment_continuation = 0;
  672. mcast.msg_count = mcast_packed_msg_count;
  673. iovecs[0].iov_base = (void *)&mcast;
  674. iovecs[0].iov_len = sizeof (struct totempg_mcast);
  675. iovecs[1].iov_base = (void *)mcast_packed_msg_lens;
  676. iovecs[1].iov_len = mcast_packed_msg_count * sizeof (unsigned short);
  677. iovecs[2].iov_base = (void *)&fragmentation_data[0];
  678. iovecs[2].iov_len = fragment_size;
  679. (void)totemsrp_mcast (totemsrp_context, iovecs, 3, 0);
  680. mcast_packed_msg_count = 0;
  681. fragment_size = 0;
  682. if (totempg_threaded_mode == 1) {
  683. pthread_mutex_unlock (&mcast_msg_mutex);
  684. }
  685. return (0);
  686. }
  687. /*
  688. * Initialize the totem process group abstraction
  689. */
  690. int totempg_initialize (
  691. qb_loop_t *poll_handle,
  692. struct totem_config *totem_config)
  693. {
  694. int res;
  695. totempg_totem_config = totem_config;
  696. totempg_log_level_security = totem_config->totem_logging_configuration.log_level_security;
  697. totempg_log_level_error = totem_config->totem_logging_configuration.log_level_error;
  698. totempg_log_level_warning = totem_config->totem_logging_configuration.log_level_warning;
  699. totempg_log_level_notice = totem_config->totem_logging_configuration.log_level_notice;
  700. totempg_log_level_debug = totem_config->totem_logging_configuration.log_level_debug;
  701. totempg_log_printf = totem_config->totem_logging_configuration.log_printf;
  702. totempg_subsys_id = totem_config->totem_logging_configuration.log_subsys_id;
  703. fragmentation_data = malloc (TOTEMPG_PACKET_SIZE);
  704. if (fragmentation_data == 0) {
  705. return (-1);
  706. }
  707. totemsrp_net_mtu_adjust (totem_config);
  708. res = totemsrp_initialize (
  709. poll_handle,
  710. &totemsrp_context,
  711. totem_config,
  712. &totempg_stats,
  713. totempg_deliver_fn,
  714. totempg_confchg_fn,
  715. totempg_waiting_trans_ack_cb);
  716. if (res == -1) {
  717. goto error_exit;
  718. }
  719. totemsrp_callback_token_create (
  720. totemsrp_context,
  721. &callback_token_received_handle,
  722. TOTEM_CALLBACK_TOKEN_RECEIVED,
  723. 0,
  724. callback_token_received_fn,
  725. 0);
  726. totempg_size_limit = (totemsrp_avail(totemsrp_context) - 1) *
  727. (totempg_totem_config->net_mtu -
  728. sizeof (struct totempg_mcast) - 16);
  729. qb_list_init (&totempg_groups_list);
  730. error_exit:
  731. return (res);
  732. }
  733. void totempg_finalize (void)
  734. {
  735. if (totempg_threaded_mode == 1) {
  736. pthread_mutex_lock (&totempg_mutex);
  737. }
  738. totemsrp_finalize (totemsrp_context);
  739. if (totempg_threaded_mode == 1) {
  740. pthread_mutex_unlock (&totempg_mutex);
  741. }
  742. }
  743. /*
  744. * Multicast a message
  745. */
  746. static int mcast_msg (
  747. struct iovec *iovec_in,
  748. unsigned int iov_len,
  749. int guarantee)
  750. {
  751. int res = 0;
  752. struct totempg_mcast mcast;
  753. struct iovec iovecs[3];
  754. struct iovec iovec[64];
  755. int i;
  756. int dest, src;
  757. int max_packet_size = 0;
  758. int copy_len = 0;
  759. int copy_base = 0;
  760. int total_size = 0;
  761. if (totempg_threaded_mode == 1) {
  762. pthread_mutex_lock (&mcast_msg_mutex);
  763. }
  764. totemsrp_event_signal (totemsrp_context, TOTEM_EVENT_NEW_MSG, 1);
  765. /*
  766. * Remove zero length iovectors from the list
  767. */
  768. assert (iov_len < 64);
  769. for (dest = 0, src = 0; src < iov_len; src++) {
  770. if (iovec_in[src].iov_len) {
  771. memcpy (&iovec[dest++], &iovec_in[src],
  772. sizeof (struct iovec));
  773. }
  774. }
  775. iov_len = dest;
  776. max_packet_size = TOTEMPG_PACKET_SIZE -
  777. (sizeof (unsigned short) * (mcast_packed_msg_count + 1));
  778. mcast_packed_msg_lens[mcast_packed_msg_count] = 0;
  779. /*
  780. * Check if we would overwrite new message queue
  781. */
  782. for (i = 0; i < iov_len; i++) {
  783. total_size += iovec[i].iov_len;
  784. }
  785. if (byte_count_send_ok (total_size + sizeof(unsigned short) *
  786. (mcast_packed_msg_count)) == 0) {
  787. if (totempg_threaded_mode == 1) {
  788. pthread_mutex_unlock (&mcast_msg_mutex);
  789. }
  790. return(-1);
  791. }
  792. mcast.header.version = 0;
  793. for (i = 0; i < iov_len; ) {
  794. mcast.fragmented = 0;
  795. mcast.continuation = fragment_continuation;
  796. copy_len = iovec[i].iov_len - copy_base;
  797. /*
  798. * If it all fits with room left over, copy it in.
  799. * We need to leave at least sizeof(short) + 1 bytes in the
  800. * fragment_buffer on exit so that max_packet_size + fragment_size
  801. * doesn't exceed the size of the fragment_buffer on the next call.
  802. */
  803. if ((iovec[i].iov_len + fragment_size) <
  804. (max_packet_size - sizeof (unsigned short))) {
  805. memcpy (&fragmentation_data[fragment_size],
  806. (char *)iovec[i].iov_base + copy_base, copy_len);
  807. fragment_size += copy_len;
  808. mcast_packed_msg_lens[mcast_packed_msg_count] += copy_len;
  809. next_fragment = 1;
  810. copy_len = 0;
  811. copy_base = 0;
  812. i++;
  813. continue;
  814. /*
  815. * If it just fits or is too big, then send out what fits.
  816. */
  817. } else {
  818. unsigned char *data_ptr;
  819. copy_len = min(copy_len, max_packet_size - fragment_size);
  820. if( copy_len == max_packet_size )
  821. data_ptr = (unsigned char *)iovec[i].iov_base + copy_base;
  822. else {
  823. data_ptr = fragmentation_data;
  824. }
  825. memcpy (&fragmentation_data[fragment_size],
  826. (unsigned char *)iovec[i].iov_base + copy_base, copy_len);
  827. mcast_packed_msg_lens[mcast_packed_msg_count] += copy_len;
  828. /*
  829. * if we're not on the last iovec or the iovec is too large to
  830. * fit, then indicate a fragment. This also means that the next
  831. * message will have the continuation of this one.
  832. */
  833. if ((i < (iov_len - 1)) ||
  834. ((copy_base + copy_len) < iovec[i].iov_len)) {
  835. if (!next_fragment) {
  836. next_fragment++;
  837. }
  838. fragment_continuation = next_fragment;
  839. mcast.fragmented = next_fragment++;
  840. assert(fragment_continuation != 0);
  841. assert(mcast.fragmented != 0);
  842. } else {
  843. fragment_continuation = 0;
  844. }
  845. /*
  846. * assemble the message and send it
  847. */
  848. mcast.msg_count = ++mcast_packed_msg_count;
  849. iovecs[0].iov_base = (void *)&mcast;
  850. iovecs[0].iov_len = sizeof(struct totempg_mcast);
  851. iovecs[1].iov_base = (void *)mcast_packed_msg_lens;
  852. iovecs[1].iov_len = mcast_packed_msg_count *
  853. sizeof(unsigned short);
  854. iovecs[2].iov_base = (void *)data_ptr;
  855. iovecs[2].iov_len = fragment_size + copy_len;
  856. assert (totemsrp_avail(totemsrp_context) > 0);
  857. res = totemsrp_mcast (totemsrp_context, iovecs, 3, guarantee);
  858. if (res == -1) {
  859. goto error_exit;
  860. }
  861. /*
  862. * Recalculate counts and indexes for the next.
  863. */
  864. mcast_packed_msg_lens[0] = 0;
  865. mcast_packed_msg_count = 0;
  866. fragment_size = 0;
  867. max_packet_size = TOTEMPG_PACKET_SIZE - (sizeof(unsigned short));
  868. /*
  869. * If the iovec all fit, go to the next iovec
  870. */
  871. if ((copy_base + copy_len) == iovec[i].iov_len) {
  872. copy_len = 0;
  873. copy_base = 0;
  874. i++;
  875. /*
  876. * Continue with the rest of the current iovec.
  877. */
  878. } else {
  879. copy_base += copy_len;
  880. }
  881. }
  882. }
  883. /*
  884. * Bump only if we added message data. This may be zero if
  885. * the last buffer just fit into the fragmentation_data buffer
  886. * and we were at the last iovec.
  887. */
  888. if (mcast_packed_msg_lens[mcast_packed_msg_count]) {
  889. mcast_packed_msg_count++;
  890. }
  891. error_exit:
  892. if (totempg_threaded_mode == 1) {
  893. pthread_mutex_unlock (&mcast_msg_mutex);
  894. }
  895. return (res);
  896. }
  897. /*
  898. * Determine if a message of msg_size could be queued
  899. */
  900. static int msg_count_send_ok (
  901. int msg_count)
  902. {
  903. int avail = 0;
  904. avail = totemsrp_avail (totemsrp_context);
  905. totempg_stats.msg_queue_avail = avail;
  906. return ((avail - totempg_reserved) > msg_count);
  907. }
  908. static int byte_count_send_ok (
  909. int byte_count)
  910. {
  911. unsigned int msg_count = 0;
  912. int avail = 0;
  913. avail = totemsrp_avail (totemsrp_context);
  914. msg_count = (byte_count / (totempg_totem_config->net_mtu - sizeof (struct totempg_mcast) - 16)) + 1;
  915. return (avail >= msg_count);
  916. }
  917. static int send_reserve (
  918. int msg_size)
  919. {
  920. unsigned int msg_count = 0;
  921. msg_count = (msg_size / (totempg_totem_config->net_mtu - sizeof (struct totempg_mcast) - 16)) + 1;
  922. totempg_reserved += msg_count;
  923. totempg_stats.msg_reserved = totempg_reserved;
  924. return (msg_count);
  925. }
  926. static void send_release (
  927. int msg_count)
  928. {
  929. totempg_reserved -= msg_count;
  930. totempg_stats.msg_reserved = totempg_reserved;
  931. }
  932. #ifndef HAVE_SMALL_MEMORY_FOOTPRINT
  933. #undef MESSAGE_QUEUE_MAX
  934. #define MESSAGE_QUEUE_MAX ((4 * MESSAGE_SIZE_MAX) / totempg_totem_config->net_mtu)
  935. #endif /* HAVE_SMALL_MEMORY_FOOTPRINT */
  936. static uint32_t q_level_precent_used(void)
  937. {
  938. return (100 - (((totemsrp_avail(totemsrp_context) - totempg_reserved) * 100) / MESSAGE_QUEUE_MAX));
  939. }
  940. int totempg_callback_token_create (
  941. void **handle_out,
  942. enum totem_callback_token_type type,
  943. int delete,
  944. int (*callback_fn) (enum totem_callback_token_type type, const void *),
  945. const void *data)
  946. {
  947. unsigned int res;
  948. if (totempg_threaded_mode == 1) {
  949. pthread_mutex_lock (&callback_token_mutex);
  950. }
  951. res = totemsrp_callback_token_create (totemsrp_context, handle_out, type, delete,
  952. callback_fn, data);
  953. if (totempg_threaded_mode == 1) {
  954. pthread_mutex_unlock (&callback_token_mutex);
  955. }
  956. return (res);
  957. }
  958. void totempg_callback_token_destroy (
  959. void *handle_out)
  960. {
  961. if (totempg_threaded_mode == 1) {
  962. pthread_mutex_lock (&callback_token_mutex);
  963. }
  964. totemsrp_callback_token_destroy (totemsrp_context, handle_out);
  965. if (totempg_threaded_mode == 1) {
  966. pthread_mutex_unlock (&callback_token_mutex);
  967. }
  968. }
  969. /*
  970. * vi: set autoindent tabstop=4 shiftwidth=4 :
  971. */
  972. int totempg_groups_initialize (
  973. void **totempg_groups_instance,
  974. void (*deliver_fn) (
  975. unsigned int nodeid,
  976. const void *msg,
  977. unsigned int msg_len,
  978. int endian_conversion_required),
  979. void (*confchg_fn) (
  980. enum totem_configuration_type configuration_type,
  981. const unsigned int *member_list, size_t member_list_entries,
  982. const unsigned int *left_list, size_t left_list_entries,
  983. const unsigned int *joined_list, size_t joined_list_entries,
  984. const struct memb_ring_id *ring_id))
  985. {
  986. struct totempg_group_instance *instance;
  987. if (totempg_threaded_mode == 1) {
  988. pthread_mutex_lock (&totempg_mutex);
  989. }
  990. instance = malloc (sizeof (struct totempg_group_instance));
  991. if (instance == NULL) {
  992. goto error_exit;
  993. }
  994. instance->deliver_fn = deliver_fn;
  995. instance->confchg_fn = confchg_fn;
  996. instance->groups = 0;
  997. instance->groups_cnt = 0;
  998. instance->q_level = QB_LOOP_MED;
  999. qb_list_init (&instance->list);
  1000. qb_list_add (&instance->list, &totempg_groups_list);
  1001. if (totempg_threaded_mode == 1) {
  1002. pthread_mutex_unlock (&totempg_mutex);
  1003. }
  1004. *totempg_groups_instance = instance;
  1005. return (0);
  1006. error_exit:
  1007. if (totempg_threaded_mode == 1) {
  1008. pthread_mutex_unlock (&totempg_mutex);
  1009. }
  1010. return (-1);
  1011. }
  1012. int totempg_groups_join (
  1013. void *totempg_groups_instance,
  1014. const struct totempg_group *groups,
  1015. size_t group_cnt)
  1016. {
  1017. struct totempg_group_instance *instance = (struct totempg_group_instance *)totempg_groups_instance;
  1018. struct totempg_group *new_groups;
  1019. int res = 0;
  1020. if (totempg_threaded_mode == 1) {
  1021. pthread_mutex_lock (&totempg_mutex);
  1022. }
  1023. new_groups = realloc (instance->groups,
  1024. sizeof (struct totempg_group) *
  1025. (instance->groups_cnt + group_cnt));
  1026. if (new_groups == 0) {
  1027. res = -1;
  1028. goto error_exit;
  1029. }
  1030. memcpy (&new_groups[instance->groups_cnt],
  1031. groups, group_cnt * sizeof (struct totempg_group));
  1032. instance->groups = new_groups;
  1033. instance->groups_cnt += group_cnt;
  1034. error_exit:
  1035. if (totempg_threaded_mode == 1) {
  1036. pthread_mutex_unlock (&totempg_mutex);
  1037. }
  1038. return (res);
  1039. }
  1040. int totempg_groups_leave (
  1041. void *totempg_groups_instance,
  1042. const struct totempg_group *groups,
  1043. size_t group_cnt)
  1044. {
  1045. if (totempg_threaded_mode == 1) {
  1046. pthread_mutex_lock (&totempg_mutex);
  1047. }
  1048. if (totempg_threaded_mode == 1) {
  1049. pthread_mutex_unlock (&totempg_mutex);
  1050. }
  1051. return (0);
  1052. }
  1053. #define MAX_IOVECS_FROM_APP 32
  1054. #define MAX_GROUPS_PER_MSG 32
  1055. int totempg_groups_mcast_joined (
  1056. void *totempg_groups_instance,
  1057. const struct iovec *iovec,
  1058. unsigned int iov_len,
  1059. int guarantee)
  1060. {
  1061. struct totempg_group_instance *instance = (struct totempg_group_instance *)totempg_groups_instance;
  1062. unsigned short group_len[MAX_GROUPS_PER_MSG + 1];
  1063. struct iovec iovec_mcast[MAX_GROUPS_PER_MSG + 1 + MAX_IOVECS_FROM_APP];
  1064. int i;
  1065. unsigned int res;
  1066. if (totempg_threaded_mode == 1) {
  1067. pthread_mutex_lock (&totempg_mutex);
  1068. }
  1069. /*
  1070. * Build group_len structure and the iovec_mcast structure
  1071. */
  1072. group_len[0] = instance->groups_cnt;
  1073. for (i = 0; i < instance->groups_cnt; i++) {
  1074. group_len[i + 1] = instance->groups[i].group_len;
  1075. iovec_mcast[i + 1].iov_len = instance->groups[i].group_len;
  1076. iovec_mcast[i + 1].iov_base = (void *) instance->groups[i].group;
  1077. }
  1078. iovec_mcast[0].iov_len = (instance->groups_cnt + 1) * sizeof (unsigned short);
  1079. iovec_mcast[0].iov_base = group_len;
  1080. for (i = 0; i < iov_len; i++) {
  1081. iovec_mcast[i + instance->groups_cnt + 1].iov_len = iovec[i].iov_len;
  1082. iovec_mcast[i + instance->groups_cnt + 1].iov_base = iovec[i].iov_base;
  1083. }
  1084. res = mcast_msg (iovec_mcast, iov_len + instance->groups_cnt + 1, guarantee);
  1085. if (totempg_threaded_mode == 1) {
  1086. pthread_mutex_unlock (&totempg_mutex);
  1087. }
  1088. return (res);
  1089. }
  1090. static void check_q_level(
  1091. void *totempg_groups_instance)
  1092. {
  1093. struct totempg_group_instance *instance = (struct totempg_group_instance *)totempg_groups_instance;
  1094. int32_t old_level = instance->q_level;
  1095. int32_t percent_used = q_level_precent_used();
  1096. if (percent_used >= 75 && instance->q_level != TOTEM_Q_LEVEL_CRITICAL) {
  1097. instance->q_level = TOTEM_Q_LEVEL_CRITICAL;
  1098. } else if (percent_used < 30 && instance->q_level != TOTEM_Q_LEVEL_LOW) {
  1099. instance->q_level = TOTEM_Q_LEVEL_LOW;
  1100. } else if (percent_used > 40 && percent_used < 50 && instance->q_level != TOTEM_Q_LEVEL_GOOD) {
  1101. instance->q_level = TOTEM_Q_LEVEL_GOOD;
  1102. } else if (percent_used > 60 && percent_used < 70 && instance->q_level != TOTEM_Q_LEVEL_HIGH) {
  1103. instance->q_level = TOTEM_Q_LEVEL_HIGH;
  1104. }
  1105. if (totem_queue_level_changed && old_level != instance->q_level) {
  1106. totem_queue_level_changed(instance->q_level);
  1107. }
  1108. }
  1109. void totempg_check_q_level(
  1110. void *totempg_groups_instance)
  1111. {
  1112. struct totempg_group_instance *instance = (struct totempg_group_instance *)totempg_groups_instance;
  1113. check_q_level(instance);
  1114. }
  1115. int totempg_groups_joined_reserve (
  1116. void *totempg_groups_instance,
  1117. const struct iovec *iovec,
  1118. unsigned int iov_len)
  1119. {
  1120. struct totempg_group_instance *instance = (struct totempg_group_instance *)totempg_groups_instance;
  1121. unsigned int size = 0;
  1122. unsigned int i;
  1123. unsigned int reserved = 0;
  1124. if (totempg_threaded_mode == 1) {
  1125. pthread_mutex_lock (&totempg_mutex);
  1126. pthread_mutex_lock (&mcast_msg_mutex);
  1127. }
  1128. for (i = 0; i < instance->groups_cnt; i++) {
  1129. size += instance->groups[i].group_len;
  1130. }
  1131. for (i = 0; i < iov_len; i++) {
  1132. size += iovec[i].iov_len;
  1133. }
  1134. if (size >= totempg_size_limit) {
  1135. reserved = -1;
  1136. goto error_exit;
  1137. }
  1138. if (byte_count_send_ok (size)) {
  1139. reserved = send_reserve (size);
  1140. } else {
  1141. reserved = 0;
  1142. }
  1143. error_exit:
  1144. check_q_level(instance);
  1145. if (totempg_threaded_mode == 1) {
  1146. pthread_mutex_unlock (&mcast_msg_mutex);
  1147. pthread_mutex_unlock (&totempg_mutex);
  1148. }
  1149. return (reserved);
  1150. }
  1151. int totempg_groups_joined_release (int msg_count)
  1152. {
  1153. if (totempg_threaded_mode == 1) {
  1154. pthread_mutex_lock (&totempg_mutex);
  1155. pthread_mutex_lock (&mcast_msg_mutex);
  1156. }
  1157. send_release (msg_count);
  1158. if (totempg_threaded_mode == 1) {
  1159. pthread_mutex_unlock (&mcast_msg_mutex);
  1160. pthread_mutex_unlock (&totempg_mutex);
  1161. }
  1162. return 0;
  1163. }
  1164. int totempg_groups_mcast_groups (
  1165. void *totempg_groups_instance,
  1166. int guarantee,
  1167. const struct totempg_group *groups,
  1168. size_t groups_cnt,
  1169. const struct iovec *iovec,
  1170. unsigned int iov_len)
  1171. {
  1172. unsigned short group_len[MAX_GROUPS_PER_MSG + 1];
  1173. struct iovec iovec_mcast[MAX_GROUPS_PER_MSG + 1 + MAX_IOVECS_FROM_APP];
  1174. int i;
  1175. unsigned int res;
  1176. if (totempg_threaded_mode == 1) {
  1177. pthread_mutex_lock (&totempg_mutex);
  1178. }
  1179. /*
  1180. * Build group_len structure and the iovec_mcast structure
  1181. */
  1182. group_len[0] = groups_cnt;
  1183. for (i = 0; i < groups_cnt; i++) {
  1184. group_len[i + 1] = groups[i].group_len;
  1185. iovec_mcast[i + 1].iov_len = groups[i].group_len;
  1186. iovec_mcast[i + 1].iov_base = (void *) groups[i].group;
  1187. }
  1188. iovec_mcast[0].iov_len = (groups_cnt + 1) * sizeof (unsigned short);
  1189. iovec_mcast[0].iov_base = group_len;
  1190. for (i = 0; i < iov_len; i++) {
  1191. iovec_mcast[i + groups_cnt + 1].iov_len = iovec[i].iov_len;
  1192. iovec_mcast[i + groups_cnt + 1].iov_base = iovec[i].iov_base;
  1193. }
  1194. res = mcast_msg (iovec_mcast, iov_len + groups_cnt + 1, guarantee);
  1195. if (totempg_threaded_mode == 1) {
  1196. pthread_mutex_unlock (&totempg_mutex);
  1197. }
  1198. return (res);
  1199. }
  1200. /*
  1201. * Returns -1 if error, 0 if can't send, 1 if can send the message
  1202. */
  1203. int totempg_groups_send_ok_groups (
  1204. void *totempg_groups_instance,
  1205. const struct totempg_group *groups,
  1206. size_t groups_cnt,
  1207. const struct iovec *iovec,
  1208. unsigned int iov_len)
  1209. {
  1210. unsigned int size = 0;
  1211. unsigned int i;
  1212. unsigned int res;
  1213. if (totempg_threaded_mode == 1) {
  1214. pthread_mutex_lock (&totempg_mutex);
  1215. }
  1216. for (i = 0; i < groups_cnt; i++) {
  1217. size += groups[i].group_len;
  1218. }
  1219. for (i = 0; i < iov_len; i++) {
  1220. size += iovec[i].iov_len;
  1221. }
  1222. res = msg_count_send_ok (size);
  1223. if (totempg_threaded_mode == 1) {
  1224. pthread_mutex_unlock (&totempg_mutex);
  1225. }
  1226. return (res);
  1227. }
  1228. int totempg_iface_set (
  1229. struct totem_ip_address *interface_addr,
  1230. unsigned short ip_port,
  1231. unsigned int iface_no)
  1232. {
  1233. int res;
  1234. res = totemsrp_iface_set (
  1235. totemsrp_context,
  1236. interface_addr,
  1237. ip_port,
  1238. iface_no);
  1239. return (res);
  1240. }
  1241. int totempg_ifaces_get (
  1242. unsigned int nodeid,
  1243. unsigned int *interface_id,
  1244. struct totem_ip_address *interfaces,
  1245. unsigned int interfaces_size,
  1246. char ***status,
  1247. unsigned int *iface_count)
  1248. {
  1249. int res;
  1250. res = totemsrp_ifaces_get (
  1251. totemsrp_context,
  1252. nodeid,
  1253. interface_id,
  1254. interfaces,
  1255. interfaces_size,
  1256. status,
  1257. iface_count);
  1258. return (res);
  1259. }
  1260. void totempg_event_signal (enum totem_event_type type, int value)
  1261. {
  1262. totemsrp_event_signal (totemsrp_context, type, value);
  1263. }
  1264. void* totempg_get_stats (void)
  1265. {
  1266. return &totempg_stats;
  1267. }
  1268. int totempg_crypto_set (
  1269. const char *cipher_type,
  1270. const char *hash_type)
  1271. {
  1272. int res;
  1273. res = totemsrp_crypto_set (totemsrp_context, cipher_type, hash_type);
  1274. return (res);
  1275. }
  1276. #define ONE_IFACE_LEN 63
  1277. const char *totempg_ifaces_print (unsigned int nodeid)
  1278. {
  1279. static char iface_string[256 * INTERFACE_MAX];
  1280. char one_iface[ONE_IFACE_LEN+1];
  1281. struct totem_ip_address interfaces[INTERFACE_MAX];
  1282. unsigned int iface_count;
  1283. unsigned int iface_ids[INTERFACE_MAX];
  1284. unsigned int i;
  1285. int res;
  1286. iface_string[0] = '\0';
  1287. res = totempg_ifaces_get (nodeid, iface_ids, interfaces, INTERFACE_MAX, NULL, &iface_count);
  1288. if (res == -1) {
  1289. return ("no interface found for nodeid");
  1290. }
  1291. res = totempg_ifaces_get (nodeid, iface_ids, interfaces, INTERFACE_MAX, NULL, &iface_count);
  1292. for (i = 0; i < iface_count; i++) {
  1293. if (!interfaces[i].family) {
  1294. continue;
  1295. }
  1296. snprintf (one_iface, ONE_IFACE_LEN,
  1297. "r(%d) ip(%s) ",
  1298. i, totemip_print (&interfaces[i]));
  1299. strcat (iface_string, one_iface);
  1300. }
  1301. return (iface_string);
  1302. }
  1303. unsigned int totempg_my_nodeid_get (void)
  1304. {
  1305. return (totemsrp_my_nodeid_get(totemsrp_context));
  1306. }
  1307. int totempg_my_family_get (void)
  1308. {
  1309. return (totemsrp_my_family_get(totemsrp_context));
  1310. }
  1311. extern void totempg_service_ready_register (
  1312. void (*totem_service_ready) (void))
  1313. {
  1314. totemsrp_service_ready_register (totemsrp_context, totem_service_ready);
  1315. }
  1316. void totempg_queue_level_register_callback (totem_queue_level_changed_fn fn)
  1317. {
  1318. totem_queue_level_changed = fn;
  1319. }
  1320. extern int totempg_member_add (
  1321. const struct totem_ip_address *member,
  1322. int ring_no)
  1323. {
  1324. return totemsrp_member_add (totemsrp_context, member, ring_no);
  1325. }
  1326. extern int totempg_member_remove (
  1327. const struct totem_ip_address *member,
  1328. int ring_no)
  1329. {
  1330. return totemsrp_member_remove (totemsrp_context, member, ring_no);
  1331. }
  1332. extern int totempg_reconfigure (void)
  1333. {
  1334. return totemsrp_reconfigure (totemsrp_context, totempg_totem_config);
  1335. }
  1336. extern void totempg_stats_clear (int flags)
  1337. {
  1338. if (flags & TOTEMPG_STATS_CLEAR_TOTEM) {
  1339. totempg_stats.msg_reserved = 0;
  1340. totempg_stats.msg_queue_avail = 0;
  1341. }
  1342. return totemsrp_stats_clear (totemsrp_context, flags);
  1343. }
  1344. void totempg_threaded_mode_enable (void)
  1345. {
  1346. totempg_threaded_mode = 1;
  1347. totemsrp_threaded_mode_enable (totemsrp_context);
  1348. }
  1349. void totempg_trans_ack (void)
  1350. {
  1351. totemsrp_trans_ack (totemsrp_context);
  1352. }
  1353. void totempg_force_gather (void)
  1354. {
  1355. totemsrp_force_gather(totemsrp_context);
  1356. }