gmi.c 79 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020
  1. /*
  2. * Copyright (c) 2003-2004 MontaVista Software, Inc.
  3. *
  4. * All rights reserved.
  5. *
  6. * Author: Steven Dake (sdake@mvista.com)
  7. *
  8. * This software licensed under BSD license, the text of which follows:
  9. *
  10. * Redistribution and use in source and binary forms, with or without
  11. * modification, are permitted provided that the following conditions are met:
  12. *
  13. * - Redistributions of source code must retain the above copyright notice,
  14. * this list of conditions and the following disclaimer.
  15. * - Redistributions in binary form must reproduce the above copyright notice,
  16. * this list of conditions and the following disclaimer in the documentation
  17. * and/or other materials provided with the distribution.
  18. * - Neither the name of the MontaVista Software, Inc. nor the names of its
  19. * contributors may be used to endorse or promote products derived from this
  20. * software without specific prior written permission.
  21. *
  22. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  23. * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  24. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  25. * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
  26. * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
  27. * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
  28. * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
  29. * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
  30. * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
  31. * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
  32. * THE POSSIBILITY OF SUCH DAMAGE.
  33. */
  34. /*
  35. * This code implements the ring protocol specified in Yair Amir's PhD thesis:
  36. * http://www.cs.jhu.edu/~yairamir/phd.ps) (ch4,5).
  37. *
  38. * Some changes have been made to the design to support things like fragmentation,
  39. * multiple I/O queues, and other things.
  40. */
  41. #include <assert.h>
  42. #include <sys/mman.h>
  43. #include <sys/types.h>
  44. #include <sys/socket.h>
  45. #include <netdb.h>
  46. #include <sys/un.h>
  47. #include <sys/sysinfo.h>
  48. #include <sys/ioctl.h>
  49. #include <netinet/in.h>
  50. #include <arpa/inet.h>
  51. #include <linux/if.h>
  52. #include <linux/sockios.h>
  53. #include <unistd.h>
  54. #include <fcntl.h>
  55. #include <stdlib.h>
  56. #include <stdio.h>
  57. #include <errno.h>
  58. #include <signal.h>
  59. #include <sched.h>
  60. #include <time.h>
  61. #include <sys/time.h>
  62. #include <sys/poll.h>
  63. #include "aispoll.h"
  64. #include "gmi.h"
  65. #include "../include/queue.h"
  66. #include "../include/sq.h"
  67. #define LOCALHOST_IP inet_addr("127.0.0.1")
  68. #define QUEUE_PEND_DELV_SIZE_MAX ((MESSAGE_SIZE_MAX / 1472) + 1) * 2
  69. #define QUEUE_RTR_ITEMS_SIZE_MAX 512
  70. #define QUEUE_PEND_TRANS_SIZE_MAX ((MESSAGE_SIZE_MAX / 1472) + 1) * 500
  71. #define MAXIOVS 8
  72. #define RTR_TOKEN_SIZE_MAX 32
  73. #define MISSING_MCAST_WINDOW 64
  74. #define TIMEOUT_STATE_GATHER 100
  75. #define TIMEOUT_TOKEN 300
  76. #define TIMEOUT_STATE_COMMIT 100
  77. #define MAX_MEMBERS 16
  78. #define HOLE_LIST_MAX MISSING_MCAST_WINDOW
  79. #define PRIORITY_MAX 3
  80. int stats_sent = 0;
  81. int stats_recv = 0;
  82. int stats_delv = 0;
  83. int stats_remcasts = 0;
  84. int stats_orf_token = 0;
  85. int stats_form_token = 0;
  86. struct timeval stats_tv_start = { 0, 0 };
  87. /*
  88. * Flow control mcasts and remcasts on last and current orf_token
  89. */
  90. int fcc_remcast_last = 0;
  91. int fcc_mcast_last = 0;
  92. int fcc_mcast_current = 0;
  93. int fcc_remcast_current = 0;
  94. enum message_type {
  95. MESSAGE_TYPE_ORF_TOKEN = 0, /* Ordering, Reliability, Flow (ORF) control Token */
  96. MESSAGE_TYPE_MCAST = 1, /* ring ordered multicast message */
  97. MESSAGE_TYPE_MEMB_ATTEMPT_JOIN = 2, /* membership join attempt message */
  98. MESSAGE_TYPE_MEMB_JOIN = 3, /* membership join message */
  99. MESSAGE_TYPE_MEMB_FORM_TOKEN = 4 /* membership FORM token */
  100. };
  101. /*
  102. * In-order pending transmit queue
  103. */
  104. struct queue queues_pend_trans[PRIORITY_MAX];
  105. /*
  106. * In-order pending delivery queue
  107. */
  108. struct pend_delv {
  109. struct in_addr ip;
  110. int seqid;
  111. int first_delivery;
  112. struct queue queue;
  113. };
  114. struct pend_delv queues_pend_delv[MAX_MEMBERS];
  115. /*
  116. * Sorted delivery/retransmit queue
  117. */
  118. struct sq queue_rtr_items;
  119. /*
  120. * Multicast address
  121. */
  122. struct sockaddr_in sockaddr_in_mcast;
  123. /*
  124. * File descriptor used when multicasting or receiving multicasts
  125. */
  126. int gmi_fd_mcast;
  127. /*
  128. * File descriptor used when unicasting the token or receiving unicast tokens
  129. */
  130. int gmi_fd_token;
  131. /*
  132. * Received up to and including
  133. */
  134. int gmi_arut = 0;
  135. /*
  136. * Delivered up to and including
  137. */
  138. int gmi_adut = 0;
  139. int gmi_adut_old = 0;
  140. int gmi_original_arut = 0;
  141. int gmi_highest_seq = 0;
  142. int gmi_highest_seq_old = 0;
  143. int gmi_barrier_seq = 0;
  144. int gmi_last_seqid = 0;
  145. int gmi_fragment = 0;
  146. int gmi_pend_queue_priority = 0;
  147. /*
  148. * Timers
  149. */
  150. poll_timer_handle timer_orf_token_timeout = 0;
  151. poll_timer_handle timer_form_token_timeout = 0;
  152. poll_timer_handle timer_memb_state_gather_timeout = 0;
  153. poll_timer_handle timer_memb_state_commit_timeout = 0;
  154. poll_timer_handle timer_single_member = 0;
  155. /*
  156. * Function called when new message received
  157. */
  158. int (*gmi_recv) (char *group, struct iovec *iovec, int iov_len);
  159. /*
  160. * Function and data used to log messages
  161. */
  162. static void (*gmi_log_printf) (int level, char *format, ...);
  163. int gmi_log_level_error;
  164. int gmi_log_level_warning;
  165. int gmi_log_level_notice;
  166. int gmi_log_level_debug;
  167. struct message_header {
  168. int type;
  169. int seqid;
  170. };
  171. struct memb_conf_id {
  172. struct in_addr rep;
  173. struct timeval tv;
  174. };
  175. struct mcast {
  176. struct message_header header;
  177. char priority;
  178. struct memb_conf_id memb_conf_id;
  179. short packet_number;
  180. short packet_count;
  181. int packet_seq;
  182. struct in_addr source;
  183. struct gmi_groupname groupname;
  184. };
  185. struct rtr_item {
  186. struct memb_conf_id conf_id;
  187. int seqid;
  188. };
  189. struct orf_token {
  190. struct message_header header;
  191. int group_arut;
  192. struct in_addr addr_arut;
  193. short int fcc;
  194. short int brake;
  195. struct in_addr brake_addr;
  196. struct rtr_item rtr_list[RTR_TOKEN_SIZE_MAX];
  197. int rtr_list_entries;
  198. };
  199. struct conf_desc {
  200. struct memb_conf_id conf_id;
  201. int highest_seq;
  202. int arut;
  203. #ifdef COMPLIE_OUT
  204. int hole_list[HOLE_LIST_MAX];
  205. int hole_list_entries;
  206. #endif
  207. };
  208. struct memb_form_token {
  209. struct message_header header;
  210. struct memb_conf_id conf_id;
  211. struct conf_desc conf_desc_list[MAX_MEMBERS]; /* SHOULD BE MAX_MEMBERS */
  212. int conf_desc_list_entries;
  213. struct in_addr member_list[MAX_MEMBERS];
  214. int member_list_entries;
  215. struct in_addr rep_list[MAX_MEMBERS];
  216. int rep_list_entries;
  217. };
  218. struct memb_attempt_join {
  219. struct message_header header;
  220. };
  221. struct memb_join {
  222. struct message_header header;
  223. struct in_addr active_rep_list[MAX_MEMBERS];
  224. int active_rep_list_entries;
  225. struct in_addr failed_rep_list[MAX_MEMBERS];
  226. int failed_rep_list_entries;
  227. };
  228. struct gmi_pend_trans_item {
  229. struct mcast *mcast;
  230. struct iovec iovec[MAXIOVS];
  231. int iov_len;
  232. };
  233. struct gmi_pend_delv_item {
  234. struct iovec iovec[MAXIOVS];
  235. int iov_len;
  236. };
  237. struct gmi_rtr_item {
  238. struct iovec iovec[MAXIOVS+2]; /* +2 is for mcast msg + group name TODO is this right */
  239. int iov_len;
  240. };
  241. enum memb_state {
  242. MEMB_STATE_OPERATIONAL,
  243. MEMB_STATE_GATHER,
  244. MEMB_STATE_COMMIT,
  245. MEMB_STATE_FORM,
  246. MEMB_STATE_EVS
  247. };
  248. static enum memb_state memb_state = MEMB_STATE_GATHER;
  249. static struct sockaddr_in gmi_bound_to;
  250. static struct sockaddr_in memb_list[MAX_MEMBERS];
  251. static int memb_list_entries = 1;
  252. static int memb_list_entries_confchg = 1;
  253. struct sockaddr_in memb_next;
  254. struct in_addr memb_gather_set[MAX_MEMBERS];
  255. int memb_gather_set_entries = 0;
  256. struct memb_commit_set {
  257. struct sockaddr_in rep;
  258. struct in_addr join_rep_list[MAX_MEMBERS];
  259. int join_rep_list_entries;
  260. struct in_addr member_list[MAX_MEMBERS];
  261. int member_list_entries;
  262. };
  263. static struct memb_commit_set memb_commit_set[MAX_MEMBERS];
  264. static int memb_commit_set_entries = 0;
  265. static struct in_addr memb_failed_list[MAX_MEMBERS];
  266. static int memb_failed_list_entries = 0;
  267. static struct sockaddr_in memb_local_sockaddr_in;
  268. static struct memb_conf_id memb_conf_id;
  269. static struct memb_conf_id memb_form_token_conf_id;
  270. static struct memb_join memb_join;
  271. static struct memb_form_token memb_form_token;
  272. static char iov_buffer[MESSAGE_SIZE_MAX];
  273. static struct iovec gmi_iov_recv = {
  274. iov_base: iov_buffer,
  275. iov_len: sizeof (iov_buffer)
  276. };
  277. struct message_handlers {
  278. int count;
  279. int (*handler_functions[5]) (struct sockaddr_in *, struct iovec *, int, int);
  280. };
  281. poll_handle *gmi_poll_handle;
  282. void (*gmi_deliver_fn) (
  283. struct gmi_groupname *groupname,
  284. struct iovec *iovec,
  285. int iov_len) = 0;
  286. void (*gmi_confchg_fn) (
  287. struct sockaddr_in *member_list, int member_list_entries,
  288. struct sockaddr_in *left_list, int left_list_entries,
  289. struct sockaddr_in *joined_list, int joined_list_entries) = 0;
  290. /*
  291. * forward decls
  292. */
  293. static int message_handler_orf_token (struct sockaddr_in *, struct iovec *, int, int);
  294. static int message_handler_mcast (struct sockaddr_in *, struct iovec *, int, int);
  295. static int message_handler_memb_attempt_join (struct sockaddr_in *, struct iovec *, int, int);
  296. static int message_handler_memb_join (struct sockaddr_in *, struct iovec *, int, int);
  297. static int message_handler_memb_form_token (struct sockaddr_in *, struct iovec *, int, int);
  298. static void memb_conf_id_build (struct memb_conf_id *, struct in_addr);
  299. static int recv_handler (poll_handle handle, int fd, int revents, void *data);
  300. static int netif_determine (struct sockaddr_in *bindnet, struct sockaddr_in *bound_to, char *name);
  301. static int gmi_build_sockets (struct sockaddr_in *sockaddr_mcast,
  302. struct sockaddr_in *sockaddr_bindnet,
  303. int *fd_mcast,
  304. int *fd_uni,
  305. struct sockaddr_in *bound_to);
  306. static int memb_state_gather_enter (void);
  307. static void pending_queues_deliver (void);
  308. static int orf_token_mcast (struct orf_token *orf_token,
  309. int fcc_mcasts_allowed, struct sockaddr_in *system_from);
  310. static void queues_pend_delv_memb_new (void);
  311. static void calculate_group_arut (struct orf_token *orf_token);
  312. static int messages_free (int group_arut);
  313. struct message_handlers gmi_message_handlers = {
  314. 5,
  315. {
  316. message_handler_orf_token,
  317. message_handler_mcast,
  318. message_handler_memb_attempt_join,
  319. message_handler_memb_join,
  320. message_handler_memb_form_token
  321. }
  322. };
  323. void gmi_log_printf_init (
  324. void (*log_printf) (int , char *, ...),
  325. int log_level_error,
  326. int log_level_warning,
  327. int log_level_notice,
  328. int log_level_debug)
  329. {
  330. gmi_log_level_error = log_level_error;
  331. gmi_log_level_warning = log_level_warning;
  332. gmi_log_level_notice = log_level_notice;
  333. gmi_log_level_debug = log_level_debug;
  334. gmi_log_printf = log_printf;
  335. }
  336. /*
  337. * Exported interfaces
  338. */
  339. int gmi_init (
  340. struct sockaddr_in *sockaddr_mcast,
  341. struct sockaddr_in *sockaddr_bindnet,
  342. poll_handle *poll_handle,
  343. struct sockaddr_in *sockaddr_boundto)
  344. {
  345. int i;
  346. int res;
  347. memcpy (&sockaddr_in_mcast, sockaddr_mcast, sizeof (struct sockaddr_in));
  348. memset (&memb_next, 0, sizeof (struct sockaddr_in));
  349. memset (iov_buffer, 0, MESSAGE_SIZE_MAX);
  350. for (i = 0; i < PRIORITY_MAX; i++) {
  351. queue_init (&queues_pend_trans[i], QUEUE_PEND_TRANS_SIZE_MAX,
  352. sizeof (struct gmi_pend_trans_item));
  353. }
  354. sq_init (&queue_rtr_items, QUEUE_RTR_ITEMS_SIZE_MAX, sizeof (struct gmi_rtr_item), 0);
  355. /*
  356. * Create and bind the multicast and unicast sockets
  357. */
  358. res = gmi_build_sockets (sockaddr_mcast,
  359. sockaddr_bindnet,
  360. &gmi_fd_mcast,
  361. &gmi_fd_token,
  362. sockaddr_boundto);
  363. memcpy (&gmi_bound_to, sockaddr_boundto, sizeof (struct sockaddr_in));
  364. /*
  365. * This stuff depends on gmi_build_sockets
  366. */
  367. memcpy (&memb_list[0], sockaddr_boundto, sizeof (struct sockaddr_in));
  368. memb_conf_id_build (&memb_conf_id, sockaddr_boundto->sin_addr);
  369. memcpy (&memb_form_token_conf_id, &memb_conf_id, sizeof (struct memb_conf_id));
  370. printf ("mcast is %d token is %d\n", gmi_fd_mcast, gmi_fd_token);
  371. gmi_poll_handle = poll_handle;
  372. poll_dispatch_add (*gmi_poll_handle, gmi_fd_mcast, POLLIN, 0, recv_handler);
  373. poll_dispatch_add (*gmi_poll_handle, gmi_fd_token, POLLIN, 0, recv_handler);
  374. memb_state_gather_enter ();
  375. memset (&memb_next, 0, sizeof (struct sockaddr_in));
  376. queues_pend_delv_memb_new ();
  377. return (0);
  378. }
  379. int gmi_join (
  380. struct gmi_groupname *groupname,
  381. void (*deliver_fn) (
  382. struct gmi_groupname *groupname,
  383. struct iovec *iovec,
  384. int iov_len),
  385. void (*confchg_fn) (
  386. struct sockaddr_in *member_list, int member_list_entries,
  387. struct sockaddr_in *left_list, int left_list_entries,
  388. struct sockaddr_in *joined_list, int joined_list_entries),
  389. gmi_join_handle *handle_out) {
  390. gmi_deliver_fn = deliver_fn;
  391. gmi_confchg_fn = confchg_fn;
  392. *handle_out = 0;
  393. return (0);
  394. }
  395. int local_host_seq_count = 0;
  396. int gmi_leave (
  397. gmi_join_handle handle_join);
  398. static int gmi_pend_trans_item_store (
  399. struct gmi_groupname *groupname,
  400. struct iovec *iovec,
  401. int iov_len,
  402. int priority,
  403. short packet_number, short packet_count)
  404. {
  405. int i, j;
  406. struct gmi_pend_trans_item gmi_pend_trans_item;
  407. memset (&gmi_pend_trans_item, 0, sizeof (struct gmi_pend_trans_item));
  408. /*
  409. * Store pending item
  410. */
  411. gmi_pend_trans_item.mcast = malloc (sizeof (struct mcast));
  412. if (gmi_pend_trans_item.mcast == 0) {
  413. goto error_mcast;
  414. }
  415. /*
  416. * Set mcast header
  417. */
  418. gmi_pend_trans_item.mcast->header.type = MESSAGE_TYPE_MCAST;
  419. gmi_pend_trans_item.mcast->priority = priority;
  420. gmi_pend_trans_item.mcast->packet_number = packet_number;
  421. gmi_pend_trans_item.mcast->packet_count = packet_count;
  422. gmi_pend_trans_item.mcast->packet_seq = local_host_seq_count++;
  423. gmi_pend_trans_item.mcast->source.s_addr = gmi_bound_to.sin_addr.s_addr;
  424. memcpy (&gmi_pend_trans_item.mcast->groupname, groupname,
  425. sizeof (struct gmi_groupname));
  426. for (i = 0; i < iov_len; i++) {
  427. gmi_pend_trans_item.iovec[i].iov_base = malloc (iovec[i].iov_len);
  428. if (gmi_pend_trans_item.iovec[i].iov_base == 0) {
  429. goto error_iovec;
  430. }
  431. memset (gmi_pend_trans_item.iovec[i].iov_base, 0, iovec[i].iov_len);
  432. memcpy (gmi_pend_trans_item.iovec[i].iov_base, iovec[i].iov_base,
  433. iovec[i].iov_len);
  434. gmi_pend_trans_item.iovec[i].iov_len = iovec[i].iov_len;
  435. }
  436. gmi_pend_trans_item.iov_len = iov_len;
  437. gmi_log_printf (gmi_log_level_debug, "mcasted message added to pending queue\n");
  438. queue_item_add (&queues_pend_trans[priority], &gmi_pend_trans_item);
  439. return (0);
  440. error_iovec:
  441. for (j = 0; j < i; j++) {
  442. free (gmi_pend_trans_item.iovec[j].iov_base);
  443. }
  444. return (-1);
  445. error_mcast:
  446. return (0);
  447. }
  448. /*
  449. * MTU - multicast message header - IP header - UDP header
  450. *
  451. * On lossy switches, making use of the DF UDP flag can lead to loss of
  452. * forward progress. So the packets must be fragmented by the algorithm
  453. * and reassembled at the receiver.
  454. */
  455. #define FRAGMENT_SIZE (1500 - sizeof (struct mcast) - 20 - 8)
  456. static void timer_function_single_member (void *data);
  457. /*
  458. * With only a single member, multicast messages as if an orf token was
  459. * delivered. This is done as part of the main event loop by specifying
  460. * a timer with an immediate expiration. This is a little suboptimal
  461. * since poll starts afresh. If more messages are waiting to be
  462. * self-delivered, queue the timer function again until there are no
  463. * more waiting messages.
  464. */
  465. static void single_member_deliver (void)
  466. {
  467. poll_timer_delete (*gmi_poll_handle, timer_single_member);
  468. timer_single_member = 0;
  469. poll_timer_add (*gmi_poll_handle, 0, 0,
  470. timer_function_single_member, &timer_single_member);
  471. }
  472. static void timer_function_single_member (void *data)
  473. {
  474. struct orf_token orf_token;
  475. int more_messages;
  476. memset (&orf_token, 0, sizeof (struct orf_token));
  477. orf_token.header.seqid = gmi_arut;
  478. orf_token.header.type = MESSAGE_TYPE_ORF_TOKEN;
  479. orf_token.group_arut = gmi_arut;
  480. orf_token.rtr_list_entries = 0;
  481. more_messages = orf_token_mcast (&orf_token, 99, &memb_local_sockaddr_in);
  482. calculate_group_arut (&orf_token);
  483. messages_free (gmi_arut);
  484. /*
  485. * Queue delivery again if more messages are available
  486. */
  487. if (more_messages) {
  488. single_member_deliver ();
  489. }
  490. }
  491. int gmi_mcast (
  492. struct gmi_groupname *groupname,
  493. struct iovec *iovec,
  494. int iov_len,
  495. int priority)
  496. {
  497. int res;
  498. struct iovec copied_iovec;
  499. struct iovec pending_iovecs[MAXIOVS];
  500. int pending_iovec_entries = 0;
  501. int iovec_entry = 0;
  502. int total_size;
  503. int packet_size;
  504. int i;
  505. int packet_number = 0;
  506. int packet_count = 0;
  507. packet_size = FRAGMENT_SIZE;
  508. gmi_log_printf (gmi_log_level_debug, "MCASTING MESSAGE\n");
  509. memset (pending_iovecs, 0, sizeof (struct iovec) * MAXIOVS);
  510. /*
  511. * Determine size of total message
  512. */
  513. total_size = 0;
  514. for (i = 0; i < iov_len; i++) {
  515. total_size += iovec[i].iov_len;
  516. assert (iovec[i].iov_len < MESSAGE_SIZE_MAX);
  517. }
  518. packet_count = (total_size / packet_size);
  519. gmi_log_printf (gmi_log_level_debug, "Message size is %d\n", total_size);
  520. /*
  521. * Break message up into individual packets and publish them
  522. */
  523. copied_iovec.iov_base = iovec[0].iov_base;
  524. copied_iovec.iov_len = iovec[0].iov_len;
  525. packet_size = 0;
  526. pending_iovec_entries = 0;
  527. iovec_entry = 0;
  528. do {
  529. if (copied_iovec.iov_len + packet_size > FRAGMENT_SIZE) {
  530. pending_iovecs[pending_iovec_entries].iov_base = copied_iovec.iov_base;
  531. pending_iovecs[pending_iovec_entries].iov_len = FRAGMENT_SIZE - packet_size;
  532. copied_iovec.iov_base += FRAGMENT_SIZE - packet_size;
  533. copied_iovec.iov_len -= FRAGMENT_SIZE - packet_size;
  534. packet_size += pending_iovecs[pending_iovec_entries].iov_len;
  535. } else {
  536. pending_iovecs[pending_iovec_entries].iov_base = copied_iovec.iov_base;
  537. pending_iovecs[pending_iovec_entries].iov_len = copied_iovec.iov_len;
  538. packet_size += copied_iovec.iov_len;
  539. iovec_entry += 1; /* this must be before copied_iovec */
  540. copied_iovec.iov_base = iovec[iovec_entry].iov_base;
  541. copied_iovec.iov_len = iovec[iovec_entry].iov_len;
  542. }
  543. pending_iovec_entries += 1;
  544. if (packet_size >= FRAGMENT_SIZE || packet_size == total_size) {
  545. #ifdef DEBUGa
  546. for (i = 0; i < pending_iovec_entries; i++) {
  547. assert (pending_iovecs[i].iov_len < MESSAGE_SIZE_MAX);
  548. assert (pending_iovecs[i].iov_len >= 0);
  549. printf ("iovecs[%d] %x %d\n", i, pending_iovecs[i].iov_base, pending_iovecs[i].iov_len);
  550. calced_total += pending_iovecs[i].iov_len;
  551. }
  552. printf ("CALCULATED TOTAL is %d\n", calced_total);
  553. #endif
  554. total_size -= packet_size;
  555. assert (total_size >= 0);
  556. res = gmi_pend_trans_item_store (groupname, pending_iovecs,
  557. pending_iovec_entries, priority, packet_number, packet_count);
  558. pending_iovec_entries = 0;
  559. iovec_entry = 0;
  560. packet_size = 0;
  561. packet_number += 1;
  562. }
  563. } while (total_size > 0);
  564. /*
  565. * The queued messages are sent in orf_token_mcast, not this function
  566. * But if this processor is the only node, it must deliver the messages
  567. * for self-delivery requirements because orf_token_mcast is only called
  568. * on reception of a token
  569. */
  570. if (memb_list_entries == 1) {
  571. single_member_deliver ();
  572. }
  573. return (0);
  574. }
  575. static int netif_determine (struct sockaddr_in *bindnet,
  576. struct sockaddr_in *bound_to,
  577. char *ifname)
  578. {
  579. struct sockaddr_in *sockaddr_in;
  580. int id_fd;
  581. struct ifconf ifc;
  582. int numreqs = 0;
  583. int res;
  584. int i;
  585. in_addr_t mask_addr;
  586. /*
  587. * Generate list of local interfaces in ifc.ifc_req structure
  588. */
  589. id_fd = socket (AF_INET, SOCK_STREAM, 0);
  590. ifc.ifc_buf = 0;
  591. do {
  592. numreqs += 32;
  593. ifc.ifc_len = sizeof (struct ifreq) * numreqs;
  594. ifc.ifc_buf = (void *)realloc(ifc.ifc_buf, ifc.ifc_len);
  595. res = ioctl (id_fd, SIOCGIFCONF, &ifc);
  596. if (res < 0) {
  597. close (id_fd);
  598. return -1;
  599. }
  600. } while (ifc.ifc_len == sizeof (struct ifreq) * numreqs);
  601. res = -1;
  602. /*
  603. * Find interface address to bind to
  604. */
  605. for (i = 0; i < ifc.ifc_len / sizeof (struct ifreq); i++) {
  606. sockaddr_in = (struct sockaddr_in *)&ifc.ifc_ifcu.ifcu_req[i].ifr_ifru.ifru_addr;
  607. mask_addr = inet_addr ("255.255.255.0");
  608. if ((sockaddr_in->sin_family == AF_INET) &&
  609. (sockaddr_in->sin_addr.s_addr & mask_addr) ==
  610. (bindnet->sin_addr.s_addr & mask_addr)) {
  611. bound_to->sin_addr.s_addr = sockaddr_in->sin_addr.s_addr;
  612. strcpy (ifname, ifc.ifc_ifcu.ifcu_req[i].ifr_ifrn.ifrn_name);
  613. res = i;
  614. break; /* for */
  615. }
  616. }
  617. free (ifc.ifc_buf);
  618. close (id_fd);
  619. return (res);
  620. }
  621. static int gmi_build_sockets (struct sockaddr_in *sockaddr_mcast,
  622. struct sockaddr_in *sockaddr_bindnet,
  623. int *fd_mcast,
  624. int *fd_uni,
  625. struct sockaddr_in *bound_to)
  626. {
  627. struct ip_mreq mreq;
  628. struct sockaddr_in sockaddr_in;
  629. char flag;
  630. struct ifreq interface;
  631. int res;
  632. memset (&mreq, 0, sizeof (struct ip_mreq));
  633. memset (&interface, 0, sizeof (struct ifreq));
  634. /*
  635. * Determine the ip address bound to and the interface name
  636. */
  637. res = netif_determine (sockaddr_bindnet,
  638. bound_to,
  639. interface.ifr_ifrn.ifrn_name);
  640. if (res == -1) {
  641. return (-1);
  642. }
  643. /* TODO this should be somewhere else */
  644. memb_local_sockaddr_in.sin_addr.s_addr = bound_to->sin_addr.s_addr;
  645. memb_local_sockaddr_in.sin_family = AF_INET;
  646. memb_local_sockaddr_in.sin_port = sockaddr_mcast->sin_port;
  647. /*
  648. * Create multicast socket
  649. */
  650. *fd_mcast = socket (AF_INET, SOCK_DGRAM, 0);
  651. if (*fd_mcast == -1) {
  652. perror ("socket");
  653. return (-1);
  654. }
  655. /*
  656. * Bind the multicast socket to the correct device (eth0, eth1)
  657. */
  658. if (setsockopt(*fd_mcast, SOL_SOCKET, SO_BINDTODEVICE,
  659. (char *)&interface, sizeof(interface)) < 0) {
  660. gmi_log_printf (gmi_log_level_warning, "Could not bind to device for multicast, group messaging may not work properly. (%s)\n", strerror (errno));
  661. }
  662. /*
  663. * Bind to multicast socket used for multicast send/receives
  664. */
  665. sockaddr_in.sin_family = AF_INET;
  666. sockaddr_in.sin_addr.s_addr = sockaddr_mcast->sin_addr.s_addr;
  667. sockaddr_in.sin_port = sockaddr_mcast->sin_port;
  668. res = bind (*fd_mcast, (struct sockaddr *)&sockaddr_in,
  669. sizeof (struct sockaddr_in));
  670. if (res == -1) {
  671. perror ("bind failed");
  672. return (-1);
  673. }
  674. /*
  675. * Setup unicast socket
  676. */
  677. *fd_uni = socket (AF_INET, SOCK_DGRAM, 0);
  678. if (*fd_uni == -1) {
  679. perror ("socket2");
  680. return (-1);
  681. }
  682. /*
  683. * Bind to unicast socket used for token send/receives
  684. * This has the side effect of binding to the correct interface
  685. */
  686. sockaddr_in.sin_addr.s_addr = bound_to->sin_addr.s_addr;
  687. res = bind (*fd_uni, (struct sockaddr *)&sockaddr_in,
  688. sizeof (struct sockaddr_in));
  689. if (res == -1) {
  690. perror ("bind2 failed");
  691. return (-1);
  692. }
  693. #ifdef CONFIG_USE_BROADCAST
  694. /* This config option doesn't work */
  695. {
  696. int on = 1;
  697. setsockopt (*fd_mcast, SOL_SOCKET, SO_BROADCAST, (char *)&on, sizeof (on));
  698. }
  699. #else
  700. /*
  701. * Join group membership on socket
  702. */
  703. mreq.imr_multiaddr.s_addr = sockaddr_mcast->sin_addr.s_addr;
  704. mreq.imr_interface.s_addr = bound_to->sin_addr.s_addr;
  705. res = setsockopt (*fd_mcast, IPPROTO_IP, IP_ADD_MEMBERSHIP,
  706. &mreq, sizeof (mreq));
  707. if (res == -1) {
  708. perror ("join multicast group failed");
  709. return (-1);
  710. }
  711. #endif
  712. /*
  713. * Turn off multicast loopback since we know what messages we have sent
  714. */
  715. flag = 0;
  716. res = setsockopt (*fd_mcast, IPPROTO_IP, IP_MULTICAST_LOOP,
  717. &flag, sizeof (flag));
  718. if (res == -1) {
  719. perror ("turn off loopback");
  720. return (-1);
  721. }
  722. return (0);
  723. }
  724. /*
  725. * Misc Management
  726. */
  727. int in_addr_compare (const void *a, const void *b) {
  728. struct in_addr *in_addr_a = (struct in_addr *)a;
  729. struct in_addr *in_addr_b = (struct in_addr *)b;
  730. return (in_addr_a->s_addr > in_addr_b->s_addr);
  731. }
  732. /*
  733. * ORF Token Management
  734. */
  735. /*
  736. * Recast message to mcast group if it is available
  737. */
  738. int orf_token_remcast (int seqid) {
  739. struct msghdr msg_mcast;
  740. struct gmi_rtr_item *gmi_rtr_item;
  741. int res;
  742. struct mcast *mcast;
  743. //printf ("remulticasting %d\n", seqid);
  744. /*
  745. * Get RTR item at seqid, if not available, return
  746. */
  747. res = sq_item_get (&queue_rtr_items, seqid, (void **)&gmi_rtr_item);
  748. if (res != 0) {
  749. return -1;
  750. }
  751. mcast = gmi_rtr_item->iovec[0].iov_base;
  752. /*
  753. * Build multicast message
  754. */
  755. msg_mcast.msg_name = &sockaddr_in_mcast;
  756. msg_mcast.msg_namelen = sizeof (struct sockaddr_in);
  757. msg_mcast.msg_iov = gmi_rtr_item->iovec;
  758. msg_mcast.msg_iovlen = gmi_rtr_item->iov_len;
  759. msg_mcast.msg_control = 0;
  760. msg_mcast.msg_controllen = 0;
  761. msg_mcast.msg_flags = 0;
  762. /*
  763. * Multicast message
  764. */
  765. res = sendmsg (gmi_fd_mcast, &msg_mcast, MSG_NOSIGNAL | MSG_DONTWAIT);
  766. if (res == -1) {
  767. printf ("error during remulticast %d %d %d\n", seqid, errno, gmi_rtr_item->iov_len);
  768. return (-1);
  769. }
  770. stats_sent += res;
  771. return (0);
  772. }
  773. int last_group_arut = 0;
  774. int last_released = 0;
  775. int set_arut = -1;
  776. /*
  777. * Brake output multicasts if the missing window is too large
  778. */
  779. int gmi_brake;
  780. static int messages_free (int group_arut)
  781. {
  782. struct gmi_rtr_item *gmi_rtr_item_p;
  783. int i, j;
  784. int res;
  785. int lesser;
  786. // TODO printf ("group arut %d last_group-arut %d gmi_dut %d barrier %d\n", group_arut, last_group_arut, gmi_dut, gmi_barrier_seq);
  787. /*
  788. * Determine braking value (when messages + MISSING_MCAST_WINDOW, stop sending messages)
  789. */
  790. gmi_brake = group_arut;
  791. if (gmi_brake > last_group_arut) {
  792. gmi_brake = last_group_arut;
  793. }
  794. /*
  795. * Determine low water mark for messages to be freed
  796. */
  797. lesser = gmi_brake;
  798. if (lesser > gmi_adut) {
  799. lesser = gmi_adut;
  800. }
  801. //printf ("Freeing lesser %d %d %d\n", lesser, group_arut, last_group_arut);
  802. //printf ("lesser %d gropu arut %d last group arut %d\n", lesser, group_arut, last_group_arut);
  803. /*
  804. * return early if no messages can be freed
  805. */
  806. /*
  807. if (last_released + 1 == lesser) {
  808. return (0);
  809. }
  810. */
  811. /*
  812. * Release retransmit list items if group arut indicates they are transmitted
  813. */
  814. for (i = last_released; i <= lesser; i++) {
  815. res = sq_item_get (&queue_rtr_items, i, (void **)&gmi_rtr_item_p);
  816. if (res == 0) {
  817. for (j = 0; j < gmi_rtr_item_p->iov_len; j++) {
  818. free (gmi_rtr_item_p->iovec[j].iov_base);
  819. gmi_rtr_item_p->iovec[j].iov_base = (void *)0xdeadbeef;
  820. gmi_rtr_item_p->iovec[j].iov_len = i;
  821. }
  822. }
  823. last_released = i + 1;
  824. }
  825. sq_items_release (&queue_rtr_items, lesser);
  826. gmi_log_printf (gmi_log_level_debug, "releasing messages up to and including %d\n", lesser);
  827. return (0);
  828. }
  829. /*
  830. * Multicasts pending messages onto the ring (requires orf_token possession)
  831. */
  832. static int orf_token_mcast (
  833. struct orf_token *orf_token,
  834. int fcc_mcasts_allowed,
  835. struct sockaddr_in *system_from)
  836. {
  837. struct msghdr msg_mcast;
  838. struct gmi_rtr_item gmi_rtr_item;
  839. struct gmi_pend_trans_item *gmi_pend_trans_item = 0;
  840. int res = 0;
  841. int orf_token_seqid;
  842. struct mcast *mcast;
  843. int last_packet = 1;
  844. struct queue *queue_pend_trans;
  845. /*
  846. * Disallow multicasts unless state is operational
  847. */
  848. if (memb_state != MEMB_STATE_OPERATIONAL) {
  849. return (0);
  850. }
  851. /*
  852. * If received a token with a higher sequence number,
  853. * set highest seq so retransmits can happen at end of
  854. * message stream
  855. */
  856. if (orf_token->header.seqid > gmi_highest_seq) {
  857. gmi_highest_seq = orf_token->header.seqid;
  858. }
  859. orf_token_seqid = orf_token->header.seqid;
  860. queue_pend_trans = &queues_pend_trans[gmi_pend_queue_priority];
  861. for (fcc_mcast_current = 0; fcc_mcast_current < fcc_mcasts_allowed; fcc_mcast_current++) {
  862. /*
  863. * determine which pending queue to take message
  864. * from if this is not a message fragment
  865. */
  866. if (gmi_fragment == 0) {
  867. gmi_pend_queue_priority = 0;
  868. do {
  869. queue_pend_trans = &queues_pend_trans[gmi_pend_queue_priority];
  870. if (queue_is_empty (queue_pend_trans)) {
  871. gmi_pend_queue_priority++;
  872. } else {
  873. break; /* from do - found first queue with data */
  874. }
  875. } while (gmi_pend_queue_priority < PRIORITY_MAX);
  876. }
  877. if (gmi_pend_queue_priority == PRIORITY_MAX) {
  878. break; /* all queues are empty, break from for */
  879. }
  880. // printf ("selecting pending queue %d\n", gmi_pend_queue_priority);
  881. gmi_pend_trans_item = (struct gmi_pend_trans_item *)queue_item_get (queue_pend_trans);
  882. /* preincrement required by algo */
  883. gmi_pend_trans_item->mcast->header.seqid = ++orf_token->header.seqid;
  884. // UNDO printf ("multicasting seqid %d\n", gmi_pend_trans_item->mcast->header.seqid);
  885. last_packet = (gmi_pend_trans_item->mcast->packet_number ==
  886. gmi_pend_trans_item->mcast->packet_count);
  887. //printf ("last packet is %d current mcast %d\n", last_packet, fcc_mcast_current);
  888. /*
  889. * Build IO vector
  890. */
  891. memset (&gmi_rtr_item, 0, sizeof (struct gmi_rtr_item));
  892. gmi_rtr_item.iovec[0].iov_base = gmi_pend_trans_item->mcast;
  893. gmi_rtr_item.iovec[0].iov_len = sizeof (struct mcast);
  894. mcast = gmi_rtr_item.iovec[0].iov_base;
  895. /*
  896. * Is this a fragment of a message
  897. */
  898. if (mcast->packet_number == mcast->packet_count) {
  899. gmi_fragment = 0;
  900. } else {
  901. gmi_fragment = 1;
  902. }
  903. memcpy (&mcast->memb_conf_id, &memb_form_token_conf_id,
  904. sizeof (struct memb_conf_id));
  905. memcpy (&gmi_rtr_item.iovec[1], gmi_pend_trans_item->iovec,
  906. gmi_pend_trans_item->iov_len * sizeof (struct iovec));
  907. gmi_rtr_item.iov_len = gmi_pend_trans_item->iov_len + 1;
  908. assert (gmi_rtr_item.iov_len < 16);
  909. /*
  910. * Add message to retransmit queue
  911. */
  912. sq_item_add (&queue_rtr_items,
  913. &gmi_rtr_item, gmi_pend_trans_item->mcast->header.seqid);
  914. /*
  915. * Delete item from pending queue
  916. */
  917. queue_item_remove (queue_pend_trans);
  918. /*
  919. * Build multicast message
  920. */
  921. msg_mcast.msg_name = &sockaddr_in_mcast;
  922. msg_mcast.msg_namelen = sizeof (struct sockaddr_in);
  923. msg_mcast.msg_iov = gmi_rtr_item.iovec;
  924. msg_mcast.msg_iovlen = gmi_rtr_item.iov_len;
  925. msg_mcast.msg_control = 0;
  926. msg_mcast.msg_controllen = 0;
  927. msg_mcast.msg_flags = 0;
  928. /*
  929. * Multicast message
  930. */
  931. res = sendmsg (gmi_fd_mcast, &msg_mcast, MSG_NOSIGNAL | MSG_DONTWAIT);
  932. /*
  933. * An error here is recovered by the multicast algorithm
  934. */
  935. // TODO stats_sent isn't right below
  936. stats_sent += res;
  937. }
  938. assert (fcc_mcast_current < 100);
  939. #ifdef OUTA
  940. if (fcc_mcast_current > fcc_mcasts_allowed) {
  941. fcc_mcast_current = fcc_mcasts_allowed;
  942. }
  943. #endif
  944. /*
  945. * If messages mcasted, deliver any new messages to pending queues
  946. */
  947. if (fcc_mcast_current) {
  948. if (gmi_pend_trans_item->mcast->header.seqid > gmi_highest_seq) {
  949. gmi_highest_seq = gmi_pend_trans_item->mcast->header.seqid;
  950. }
  951. pending_queues_deliver ();
  952. //printf ("orf Token seqid is %d group %d\n", orf_token_seqid, orf_token->group_arut);
  953. #ifdef COMPILE_OUT
  954. if (orf_token_seqid == orf_token->group_arut) {
  955. //printf ("previous group arut #1 %d\n", orf_token->group_arut);
  956. orf_token->group_arut = orf_token_seqid + fcc_mcast_current;
  957. orf_token->addr_arut.s_addr = 0;
  958. }
  959. //printf ("reasing group arut to %d\n", orf_token->group_arut);
  960. #endif
  961. }
  962. /*
  963. * Return 1 if more messages are available for single node clusters
  964. */
  965. return (fcc_mcast_current == fcc_mcasts_allowed);
  966. }
  967. /*
  968. * Remulticasts messages in orf_token's retransmit list (requires orf_token)
  969. * Modify's orf_token's rtr to include retransmits required by this process
  970. */
  971. static void orf_token_rtr (
  972. struct orf_token *orf_token,
  973. int *fcc_allowed)
  974. {
  975. int res;
  976. int i, j;
  977. int found;
  978. #ifdef COMPLE_OUT
  979. printf ("Retransmit List %d\n", orf_token->rtr_list_entries);
  980. for (i = 0; i < orf_token->rtr_list_entries; i++) {
  981. printf ("%d ", orf_token->rtr_list[i].seqid);
  982. }
  983. printf ("\n");
  984. #endif
  985. /*
  986. * Retransmit messages on orf_token's RTR list from RTR queue
  987. */
  988. for (fcc_remcast_current = 0, i = 0;
  989. fcc_remcast_current <= *fcc_allowed && i < orf_token->rtr_list_entries;) {
  990. #ifdef COMPILE_OUT
  991. printf ("%d.%d.%d vs %d.%d.%d\n",
  992. orf_token->rtr_list[i].conf_id.rep.s_addr,
  993. orf_token->rtr_list[i].conf_id.tv.tv_sec,
  994. orf_token->rtr_list[i].conf_id.tv.tv_usec,
  995. memb_form_token_conf_id.rep.s_addr,
  996. memb_form_token_conf_id.tv.tv_sec,
  997. memb_form_token_conf_id.tv.tv_usec);
  998. #endif
  999. /*
  1000. * If this retransmit request isn't from this configuration,
  1001. * try next rtr entry
  1002. */
  1003. if (memcmp (&orf_token->rtr_list[i].conf_id, &memb_form_token_conf_id,
  1004. sizeof (struct memb_conf_id)) != 0) {
  1005. i++;
  1006. continue;
  1007. }
  1008. assert (orf_token->rtr_list[i].seqid > 0);
  1009. res = orf_token_remcast (orf_token->rtr_list[i].seqid);
  1010. if (res == 0) {
  1011. orf_token->rtr_list_entries -= 1;
  1012. assert (orf_token->rtr_list_entries >= 0);
  1013. memmove (&orf_token->rtr_list[i],
  1014. &orf_token->rtr_list[i + 1],
  1015. sizeof (struct rtr_item) * (orf_token->rtr_list_entries));
  1016. fcc_remcast_current++;
  1017. stats_remcasts++;
  1018. } else {
  1019. i++;
  1020. //printf ("couldn't remcast %d\n", i);
  1021. }
  1022. }
  1023. *fcc_allowed = *fcc_allowed - fcc_remcast_current - 1;
  1024. #ifdef COMPILE_OUT
  1025. for (i = 0; i < orf_token->rtr_list_entries; i++) {
  1026. assert (orf_token->rtr_list[i].seqid != -1);
  1027. }
  1028. #endif
  1029. /*
  1030. * Add messages to retransmit to RTR list
  1031. * but only retry if there is room in the retransmit list
  1032. */
  1033. for (i = gmi_arut + 1;
  1034. orf_token->rtr_list_entries < RTR_TOKEN_SIZE_MAX &&
  1035. // i <= orf_token->header.seqid; /* TODO this worked previously but not correct for EVS */
  1036. i <= gmi_highest_seq;
  1037. i++) {
  1038. res = sq_item_inuse (&queue_rtr_items, i);
  1039. if (res == 0) {
  1040. found = 0;
  1041. for (j = 0; j < orf_token->rtr_list_entries; j++) {
  1042. if (i == orf_token->rtr_list[j].seqid) {
  1043. found = 1;
  1044. }
  1045. }
  1046. if (found == 0) {
  1047. memcpy (&orf_token->rtr_list[orf_token->rtr_list_entries].conf_id,
  1048. &memb_form_token_conf_id, sizeof (struct memb_conf_id));
  1049. orf_token->rtr_list[orf_token->rtr_list_entries].seqid = i;
  1050. orf_token->rtr_list_entries++;
  1051. //printf ("adding to retransmit list %d\n", i);
  1052. }
  1053. }
  1054. }
  1055. }
  1056. /*
  1057. * Calculate flow control count
  1058. */
  1059. static void orf_token_fcc (
  1060. struct orf_token *orf_token)
  1061. {
  1062. orf_token->fcc = orf_token->fcc - fcc_mcast_last - fcc_remcast_last
  1063. + fcc_mcast_current + fcc_remcast_current;
  1064. fcc_mcast_last = fcc_mcast_current;
  1065. fcc_remcast_last = fcc_remcast_current;
  1066. }
  1067. static void queues_pend_delv_memb_new (void)
  1068. {
  1069. struct pend_delv pend_delv_new[MAX_MEMBERS];
  1070. int item_index = 0;
  1071. int i, j;
  1072. int found;
  1073. memset (pend_delv_new, 0, sizeof (struct pend_delv) * MAX_MEMBERS);
  1074. /*
  1075. * Build new pending list
  1076. */
  1077. for (i = 0; i < memb_list_entries_confchg; i++) {
  1078. found = 0;
  1079. for (j = 0; j < MAX_MEMBERS; j++) {
  1080. /*
  1081. * If membership item in queues pending delivery list, copy it
  1082. */
  1083. if (memb_list[i].sin_addr.s_addr == queues_pend_delv[j].ip.s_addr) {
  1084. memcpy (&pend_delv_new[item_index], &queues_pend_delv[j],
  1085. sizeof (struct pend_delv));
  1086. item_index += 1;
  1087. found = 1;
  1088. break; /* for j = */
  1089. }
  1090. }
  1091. /*
  1092. * If membership item not found in pending delivery list, make new entry
  1093. */
  1094. if (found == 0) {
  1095. queue_init (&pend_delv_new[item_index].queue, QUEUE_PEND_DELV_SIZE_MAX,
  1096. sizeof (struct gmi_pend_delv_item));
  1097. pend_delv_new[item_index].seqid = 0;
  1098. pend_delv_new[item_index].ip.s_addr = memb_list[i].sin_addr.s_addr;
  1099. item_index += 1;
  1100. }
  1101. }
  1102. /*
  1103. * Copy new list into system list
  1104. */
  1105. memcpy (queues_pend_delv, pend_delv_new,
  1106. sizeof (struct pend_delv) * MAX_MEMBERS);
  1107. for (i = 0; i < memb_list_entries_confchg; i++) {
  1108. /*
  1109. * If queue not empty, mark it for first delivery
  1110. * otherwise reset seqno
  1111. */
  1112. if (queue_is_empty (&queues_pend_delv[i].queue) == 0) {
  1113. queues_pend_delv[i].first_delivery = 1;
  1114. } else {
  1115. queues_pend_delv[i].seqid = 0;
  1116. }
  1117. }
  1118. }
  1119. static int orf_token_evs (
  1120. struct orf_token *orf_token,
  1121. int starting_group_arut)
  1122. {
  1123. int i, j;
  1124. struct sockaddr_in trans_memb_list[MAX_MEMBERS];
  1125. struct sockaddr_in left_list[MAX_MEMBERS];
  1126. struct sockaddr_in joined_list[MAX_MEMBERS];
  1127. int trans_memb_list_entries = 0;
  1128. int left_list_entries = 0;
  1129. int joined_list_entries = 0;
  1130. int found;
  1131. //printf ("group arut is %d %d %d %d\n", orf_token->header.seqid, orf_token->group_arut, gmi_arut, gmi_highest_seq);
  1132. /*
  1133. * We should only execute this function if we are in EVS membership state
  1134. */
  1135. if (memb_state != MEMB_STATE_EVS) {
  1136. return (0);
  1137. }
  1138. memset (trans_memb_list, 0, sizeof (struct sockaddr_in) * MAX_MEMBERS);
  1139. /*
  1140. * Delete form token timer since the token has been swallowed
  1141. */
  1142. poll_timer_delete (*gmi_poll_handle, timer_form_token_timeout);
  1143. timer_form_token_timeout = 0;
  1144. printf ("EVS STATE group arut %d gmi arut %d highest %d barrier %d starting group arut %d\n", orf_token->group_arut, gmi_arut, gmi_highest_seq, gmi_barrier_seq, starting_group_arut);
  1145. /*
  1146. * This node has reached highest seq, set local arut to barrier
  1147. */
  1148. if (gmi_arut == gmi_highest_seq) {
  1149. //printf ("setting arut to barrier %d\n", gmi_barrier_seq);
  1150. gmi_arut = gmi_barrier_seq;
  1151. }
  1152. /*
  1153. * Determine when EVS recovery has completed
  1154. */
  1155. //printf ("group arut is %d %d %d\n", orf_token->group_arut, gmi_arut, gmi_highest_seq);
  1156. // TODO
  1157. if (memb_state == MEMB_STATE_EVS && gmi_arut == gmi_barrier_seq && orf_token->group_arut == gmi_barrier_seq) {
  1158. gmi_log_printf (gmi_log_level_notice, "EVS recovery of messages complete, transitioning to operational.\n");
  1159. /*
  1160. * EVS recovery complete, reset local variables
  1161. */
  1162. gmi_arut = 0;
  1163. gmi_adut_old = gmi_adut;
  1164. gmi_adut = 0;
  1165. gmi_highest_seq_old = gmi_highest_seq;
  1166. gmi_highest_seq = 0;
  1167. last_group_arut = 0;
  1168. sq_reinit (&queue_rtr_items, 0);
  1169. memb_failed_list_entries = 0;
  1170. memb_state = MEMB_STATE_OPERATIONAL;
  1171. qsort (memb_form_token.member_list, memb_form_token.member_list_entries,
  1172. sizeof (struct in_addr), in_addr_compare);
  1173. /*
  1174. * Determine transitional configuration
  1175. */
  1176. for (i = 0; i < memb_list_entries_confchg; i++) {
  1177. for (found = 0, j = 0; j < memb_form_token.member_list_entries; j++) {
  1178. if (memb_list[i].sin_addr.s_addr == memb_form_token.member_list[j].s_addr) {
  1179. found = 1;
  1180. break;
  1181. }
  1182. }
  1183. if (found == 1) {
  1184. trans_memb_list[trans_memb_list_entries].sin_addr.s_addr = memb_list[i].sin_addr.s_addr;
  1185. trans_memb_list[trans_memb_list_entries].sin_family = AF_INET;
  1186. trans_memb_list[trans_memb_list_entries].sin_port = sockaddr_in_mcast.sin_port;
  1187. trans_memb_list_entries += 1;
  1188. }
  1189. }
  1190. /*
  1191. * Determine nodes that left the configuration
  1192. */
  1193. for (i = 0; i < memb_list_entries_confchg; i++) {
  1194. for (found = 0, j = 0; j < memb_form_token.member_list_entries; j++) {
  1195. if (memb_list[i].sin_addr.s_addr == memb_form_token.member_list[j].s_addr) {
  1196. found = 1;
  1197. break; /* for j = 0 */
  1198. }
  1199. }
  1200. /*
  1201. * Node left membership, add it to list
  1202. */
  1203. if (found == 0) {
  1204. left_list[left_list_entries].sin_addr.s_addr = memb_list[i].sin_addr.s_addr;
  1205. left_list[left_list_entries].sin_family = AF_INET;
  1206. left_list[left_list_entries].sin_port = sockaddr_in_mcast.sin_port;
  1207. left_list_entries += 1;
  1208. }
  1209. }
  1210. /*
  1211. * MAIN STEP:
  1212. * Deliver transitional configuration
  1213. */
  1214. if (gmi_confchg_fn &&
  1215. (trans_memb_list_entries != memb_list_entries ||
  1216. (memcmp (trans_memb_list, memb_list, sizeof (struct sockaddr_in) * memb_list_entries) != 0))) {
  1217. gmi_confchg_fn (trans_memb_list, trans_memb_list_entries,
  1218. left_list, left_list_entries,
  1219. 0, 0);
  1220. }
  1221. /*
  1222. * Determine nodes that joined the configuration
  1223. */
  1224. for (i = 0; i < memb_form_token.member_list_entries; i++) {
  1225. for (found = 0, j = 0; j < memb_list_entries_confchg; j++) {
  1226. if (memb_form_token.member_list[i].s_addr == memb_list[j].sin_addr.s_addr) {
  1227. found = 1;
  1228. break; /* for j = 0 */
  1229. }
  1230. }
  1231. /*
  1232. * Node joined membership, add it to list
  1233. */
  1234. if (found == 0) {
  1235. joined_list[joined_list_entries].sin_addr.s_addr = memb_form_token.member_list[i].s_addr;
  1236. joined_list[joined_list_entries].sin_family = AF_INET;
  1237. joined_list[joined_list_entries].sin_port = sockaddr_in_mcast.sin_port;
  1238. joined_list_entries += 1;
  1239. }
  1240. }
  1241. /*
  1242. * Install the form token's configuration into the local membership
  1243. */
  1244. for (i = 0; i < memb_form_token.member_list_entries; i++) {
  1245. memb_list[i].sin_addr.s_addr = memb_form_token.member_list[i].s_addr;
  1246. memb_list[i].sin_family = AF_INET;
  1247. memb_list[i].sin_port = sockaddr_in_mcast.sin_port;
  1248. }
  1249. /*
  1250. * Install pending delivery queues
  1251. */
  1252. memb_list_entries = memb_form_token.member_list_entries;
  1253. memb_list_entries_confchg = memb_list_entries;
  1254. queues_pend_delv_memb_new ();
  1255. /*
  1256. * Install new conf id
  1257. */
  1258. memcpy (&memb_conf_id, &memb_form_token.conf_id,
  1259. sizeof (struct memb_conf_id));
  1260. memcpy (&memb_form_token_conf_id, &memb_form_token.conf_id,
  1261. sizeof (struct memb_conf_id));
  1262. /*
  1263. * Deliver regular configuration
  1264. */
  1265. if (gmi_confchg_fn) {
  1266. gmi_confchg_fn (memb_list, memb_list_entries,
  1267. left_list, 0,
  1268. joined_list, joined_list_entries);
  1269. }
  1270. }
  1271. return (0);
  1272. }
  1273. int gwin = 90;
  1274. int pwin = 45;
  1275. static int orf_fcc_allowed (struct orf_token *token)
  1276. {
  1277. int allowed;
  1278. if (memb_state != MEMB_STATE_OPERATIONAL) {
  1279. return (0);
  1280. }
  1281. allowed = gwin + pwin - token->fcc;
  1282. if (allowed < 0) {
  1283. allowed = 0;
  1284. }
  1285. if (allowed > gwin) {
  1286. allowed = gwin;
  1287. }
  1288. if (allowed > pwin) {
  1289. allowed = pwin;
  1290. }
  1291. return (allowed);
  1292. }
  1293. void timer_function_form_token_timeout (void *data)
  1294. {
  1295. gmi_log_printf (gmi_log_level_warning, "Token loss in FORM state\n");
  1296. memb_list_entries = 1;
  1297. /*
  1298. * Add highest rep to failed list to ensure termination
  1299. */
  1300. memb_failed_list[memb_failed_list_entries++].s_addr =
  1301. memb_form_token.rep_list[memb_form_token.rep_list_entries].s_addr;
  1302. memb_state_gather_enter ();
  1303. }
  1304. void orf_timer_function_token_timeout (void *data)
  1305. {
  1306. switch (memb_state) {
  1307. case MEMB_STATE_OPERATIONAL:
  1308. gmi_log_printf (gmi_log_level_warning, "Token loss in OPERATIONAL.\n");
  1309. memb_conf_id.rep.s_addr = memb_local_sockaddr_in.sin_addr.s_addr;
  1310. memb_list_entries = 1;
  1311. memb_state_gather_enter ();
  1312. break;
  1313. case MEMB_STATE_GATHER:
  1314. case MEMB_STATE_COMMIT:
  1315. gmi_log_printf (gmi_log_level_warning, "Token loss in GATHER or COMMIT.\n");
  1316. memb_list_entries = 1;
  1317. break;
  1318. case MEMB_STATE_EVS:
  1319. gmi_log_printf (gmi_log_level_warning, "Token loss in EVS state\n");
  1320. memb_list_entries = 1;
  1321. memb_state_gather_enter ();
  1322. break;
  1323. default:
  1324. printf ("token loss in form state doesn't make sense here\n");
  1325. break;
  1326. }
  1327. }
  1328. /*
  1329. * Send orf_token to next member (requires orf_token)
  1330. */
  1331. static int orf_token_send (
  1332. struct orf_token *orf_token)
  1333. {
  1334. struct msghdr msg_orf_token;
  1335. struct iovec iovec_orf_token;
  1336. int res;
  1337. poll_timer_delete (*gmi_poll_handle, timer_orf_token_timeout);
  1338. poll_timer_add (*gmi_poll_handle, TIMEOUT_TOKEN, 0,
  1339. orf_timer_function_token_timeout, &timer_orf_token_timeout);
  1340. iovec_orf_token.iov_base = orf_token;
  1341. iovec_orf_token.iov_len = sizeof (struct orf_token);
  1342. msg_orf_token.msg_name = &memb_next;
  1343. msg_orf_token.msg_namelen = sizeof (struct sockaddr_in);
  1344. msg_orf_token.msg_iov = &iovec_orf_token;
  1345. msg_orf_token.msg_iovlen = 1;
  1346. msg_orf_token.msg_control = 0;
  1347. msg_orf_token.msg_controllen = 0;
  1348. msg_orf_token.msg_flags = 0;
  1349. // THIS IS FOR TESTING ERRORS IN THE EVS STATE
  1350. //if ((memb_state == MEMB_STATE_EVS) && ((random () % 3) == 0)) {
  1351. //gmi_log_printf (gmi_log_level_debug, "CAUSING TOKEN LOSS AT EVS STATE\n");
  1352. // return (1);
  1353. //}
  1354. res = sendmsg (gmi_fd_token, &msg_orf_token, MSG_NOSIGNAL);
  1355. assert (res != -1);
  1356. /*
  1357. * res not used here errors are handled by algorithm
  1358. */
  1359. gmi_last_seqid = orf_token->header.seqid;
  1360. stats_sent += res;
  1361. return (res);
  1362. }
  1363. int orf_token_send_initial (void)
  1364. {
  1365. struct orf_token orf_token;
  1366. int res;
  1367. orf_token.header.seqid = 0;
  1368. orf_token.header.type = MESSAGE_TYPE_ORF_TOKEN;
  1369. orf_token.group_arut = gmi_highest_seq;
  1370. orf_token.addr_arut.s_addr = gmi_bound_to.sin_addr.s_addr;
  1371. orf_token.fcc = 0;
  1372. orf_token.rtr_list_entries = 0;
  1373. memset (orf_token.rtr_list, 0, sizeof (struct rtr_item) * RTR_TOKEN_SIZE_MAX);
  1374. res = orf_token_send (&orf_token);
  1375. return (res);
  1376. }
  1377. /*
  1378. * Membership Management
  1379. */
  1380. static int memb_join_send (void)
  1381. {
  1382. struct msghdr msghdr_join;
  1383. struct iovec iovec_join;
  1384. int res;
  1385. memb_join.header.seqid = 0;
  1386. memb_join.header.type = MESSAGE_TYPE_MEMB_JOIN;
  1387. /*
  1388. * copy current gather list to representatives list
  1389. */
  1390. if ((memb_gather_set_entries == memb_join.active_rep_list_entries) &&
  1391. (memcmp (memb_join.active_rep_list, memb_gather_set,
  1392. sizeof (struct in_addr) * memb_gather_set_entries) == 0) &&
  1393. (memb_failed_list_entries == memb_join.failed_rep_list_entries) &&
  1394. (memcmp (memb_join.failed_rep_list, memb_failed_list,
  1395. sizeof (struct in_addr) * memb_failed_list_entries) == 0)) {
  1396. return (0);
  1397. }
  1398. /*
  1399. * Copy active reps
  1400. */
  1401. memcpy (memb_join.active_rep_list, memb_gather_set,
  1402. sizeof (struct in_addr) * memb_gather_set_entries);
  1403. memb_join.active_rep_list_entries = memb_gather_set_entries;
  1404. /*
  1405. * Copy failed reps
  1406. */
  1407. memcpy (memb_join.failed_rep_list, memb_failed_list,
  1408. sizeof (struct in_addr) * memb_failed_list_entries);
  1409. memb_join.failed_rep_list_entries = memb_failed_list_entries;
  1410. iovec_join.iov_base = &memb_join;
  1411. iovec_join.iov_len = sizeof (struct memb_join);
  1412. msghdr_join.msg_name = &sockaddr_in_mcast;
  1413. msghdr_join.msg_namelen = sizeof (struct sockaddr_in);
  1414. msghdr_join.msg_iov = &iovec_join;
  1415. msghdr_join.msg_iovlen = 1;
  1416. msghdr_join.msg_control = 0;
  1417. msghdr_join.msg_controllen = 0;
  1418. msghdr_join.msg_flags = 0;
  1419. res = sendmsg (gmi_fd_mcast, &msghdr_join, MSG_NOSIGNAL | MSG_DONTWAIT);
  1420. return (res);
  1421. }
  1422. static int memb_state_commit_enter (void);
  1423. /*
  1424. * Update gather_set[0].join_reps with list of failed members
  1425. */
  1426. void memb_gather_set_update_failed (struct in_addr *list, int list_entries)
  1427. {
  1428. int i;
  1429. int j;
  1430. /*
  1431. * Remove failed members from gather set
  1432. */
  1433. for (i = 0; i < list_entries; i++) {
  1434. for (j = 0; j < memb_gather_set_entries; j++) {
  1435. if (list[i].s_addr == memb_gather_set[j].s_addr) {
  1436. memb_gather_set_entries -= 1;
  1437. memcpy (&memb_gather_set[j],
  1438. &memb_gather_set[j + 1],
  1439. memb_gather_set_entries * sizeof (struct in_addr));
  1440. break; /* for j = 0 */
  1441. }
  1442. }
  1443. }
  1444. }
  1445. static void memb_timer_function_state_commit_timeout (void *data)
  1446. {
  1447. int i;
  1448. int j;
  1449. int k;
  1450. int found;
  1451. int add_to_failed = 1;
  1452. struct sockaddr_in left_list[MAX_MEMBERS];
  1453. int left_list_entries = 0;
  1454. memb_failed_list_entries = 0;
  1455. /*
  1456. * No entries responded in commit timeout period
  1457. */
  1458. if (memb_commit_set_entries == 0) {
  1459. /*
  1460. * memb_list_entries only set to 0 when token times out, in which case
  1461. * send a configuration change because no messages can be recovered in EVS
  1462. */
  1463. if (memb_list_entries == 1) {
  1464. gmi_log_printf (gmi_log_level_notice, "I am the only member.\n");
  1465. if (gmi_confchg_fn) {
  1466. /*
  1467. * Determine nodes that left the configuration
  1468. */
  1469. for (i = 0; i < memb_list_entries_confchg; i++) {
  1470. if (memb_local_sockaddr_in.sin_addr.s_addr != memb_list[i].sin_addr.s_addr) {
  1471. left_list[left_list_entries].sin_addr.s_addr = memb_list[i].sin_addr.s_addr;
  1472. left_list[left_list_entries].sin_family = AF_INET;
  1473. left_list[left_list_entries].sin_port = sockaddr_in_mcast.sin_port;
  1474. left_list_entries += 1;
  1475. }
  1476. }
  1477. gmi_confchg_fn (&memb_local_sockaddr_in, 1,
  1478. left_list, left_list_entries,
  1479. 0, 0);
  1480. }
  1481. } else {
  1482. gmi_log_printf (gmi_log_level_notice, "No members sent join, keeping old ring and transitioning to operational.\n");
  1483. }
  1484. memb_state = MEMB_STATE_OPERATIONAL;
  1485. return;
  1486. }
  1487. /*
  1488. * Find all failed members
  1489. */
  1490. for (i = 0; i < memb_gather_set_entries; i++) {
  1491. add_to_failed = 1;
  1492. for (j = 0; j < memb_commit_set_entries; j++) {
  1493. /*
  1494. * If gather entry not in commit rep list, add to failed
  1495. */
  1496. if (memb_gather_set[i].s_addr == memb_commit_set[j].rep.sin_addr.s_addr) {
  1497. add_to_failed = 0;
  1498. break; /* for found = 0 */
  1499. }
  1500. }
  1501. /*
  1502. * If gather entry not in commit set, add to failed set
  1503. */
  1504. for (found = 0, j = 0; j < memb_commit_set_entries; j++) {
  1505. for (k = 0; k < memb_commit_set[j].join_rep_list_entries; k++) {
  1506. if (memb_gather_set[i].s_addr == memb_commit_set[j].join_rep_list[k].s_addr) {
  1507. found = 1;
  1508. break;
  1509. }
  1510. }
  1511. if (found == 0) {
  1512. add_to_failed = 1;
  1513. break;
  1514. }
  1515. }
  1516. /*
  1517. * If local address, item found
  1518. */
  1519. if (memb_gather_set[i].s_addr == memb_local_sockaddr_in.sin_addr.s_addr) {
  1520. add_to_failed = 0;
  1521. }
  1522. if (add_to_failed == 1) {
  1523. memb_failed_list[memb_failed_list_entries++].s_addr =
  1524. memb_gather_set[i].s_addr;
  1525. }
  1526. }
  1527. memb_gather_set_update_failed (memb_failed_list, memb_failed_list_entries);
  1528. memb_state_commit_enter ();
  1529. }
  1530. static int memb_state_commit_enter (void)
  1531. {
  1532. int res;
  1533. memb_state = MEMB_STATE_COMMIT;
  1534. memb_commit_set_entries = 0;
  1535. res = memb_join_send();
  1536. poll_timer_delete (*gmi_poll_handle, timer_memb_state_gather_timeout);
  1537. timer_memb_state_gather_timeout = 0;
  1538. poll_timer_add (*gmi_poll_handle, TIMEOUT_STATE_COMMIT, 0,
  1539. memb_timer_function_state_commit_timeout, &timer_memb_state_commit_timeout);
  1540. return (res);
  1541. }
  1542. static void memb_timer_function_state_gather (void *data)
  1543. {
  1544. int i;
  1545. /*
  1546. * GATHER period expired, sort gather sets and send JOIN
  1547. */
  1548. memb_state_commit_enter ();
  1549. gmi_log_printf (gmi_log_level_debug, "GATHER timeout:\n");
  1550. for (i = 0; i < memb_gather_set_entries; i++) {
  1551. gmi_log_printf (gmi_log_level_debug, "host %d attempted to join %s\n", i, inet_ntoa (memb_gather_set[i]));
  1552. }
  1553. }
  1554. static void memb_print_commit_set (void)
  1555. {
  1556. int i, j;
  1557. gmi_log_printf (gmi_log_level_debug, "Gather list\n");
  1558. for (i = 0; i < memb_gather_set_entries; i++) {
  1559. gmi_log_printf (gmi_log_level_debug, "\tmember %d %s\n", i, inet_ntoa (memb_gather_set[i]));
  1560. }
  1561. for (i = 0; i < memb_commit_set_entries; i++) {
  1562. gmi_log_printf (gmi_log_level_debug, "Join from rep %d %s\n", i, inet_ntoa (memb_commit_set[i].rep.sin_addr));
  1563. for (j = 0; j < memb_commit_set[i].join_rep_list_entries; j++) {
  1564. gmi_log_printf (gmi_log_level_debug, "\tmember %d %s\n", j, inet_ntoa (memb_commit_set[i].join_rep_list[j]));
  1565. }
  1566. }
  1567. }
  1568. /*
  1569. * Determine if the commit phase has reached consensus
  1570. */
  1571. static int memb_state_consensus_commit (void)
  1572. {
  1573. int found;
  1574. int res;
  1575. int i, j;
  1576. /*
  1577. * Determine consensus
  1578. */
  1579. /*
  1580. * If all commit sets don't match gather set, no consensus
  1581. */
  1582. for (i = 0; i < memb_commit_set_entries; i++) {
  1583. /*
  1584. * If not same number of entries, no consensus
  1585. */
  1586. res = memb_gather_set_entries - memb_commit_set[i].join_rep_list_entries;
  1587. if (res != 0) {
  1588. return (0); /* no consensus */
  1589. }
  1590. /*
  1591. * If entries dont match, no consensus
  1592. */
  1593. res = memcmp (memb_gather_set, memb_commit_set[i].join_rep_list,
  1594. memb_gather_set_entries * sizeof (struct in_addr));
  1595. if (res != 0) {
  1596. return (0); /* no consensus */
  1597. }
  1598. }
  1599. /*
  1600. * If all reps from gather set represented in commit set, consensus
  1601. */
  1602. for (i = 0; i < memb_gather_set_entries; i++) {
  1603. found = 0;
  1604. for (j = 0; j < memb_commit_set_entries; j++) {
  1605. if (memb_gather_set[i].s_addr == memb_local_sockaddr_in.sin_addr.s_addr) {
  1606. found = 1;
  1607. break;
  1608. }
  1609. if (memb_gather_set[i].s_addr == memb_commit_set[j].rep.sin_addr.s_addr) {
  1610. found = 1;
  1611. break;
  1612. }
  1613. }
  1614. if (found == 0) {
  1615. return (0); /* no consensus, rep not found from gather set */
  1616. }
  1617. }
  1618. return (1); /* got consensus! */
  1619. }
  1620. /*
  1621. * Union commit_set_entry into gather set
  1622. */
  1623. static void memb_state_commit_union (int commit_set_entry)
  1624. {
  1625. int found;
  1626. int i, j;
  1627. for (i = 0; i < memb_commit_set[commit_set_entry].join_rep_list_entries; i++) {
  1628. for (found = 0, j = 0; j < memb_gather_set_entries; j++) {
  1629. if (memb_commit_set[commit_set_entry].join_rep_list[i].s_addr ==
  1630. memb_gather_set[j].s_addr) {
  1631. found = 1;
  1632. break;
  1633. }
  1634. }
  1635. if (found == 0) {
  1636. memb_gather_set[memb_gather_set_entries++].s_addr =
  1637. memb_commit_set[commit_set_entry].join_rep_list[i].s_addr;
  1638. /*
  1639. * Sort gather set
  1640. */
  1641. qsort (memb_gather_set, memb_gather_set_entries,
  1642. sizeof (struct in_addr), in_addr_compare);
  1643. }
  1644. }
  1645. }
  1646. static void memb_conf_id_build (
  1647. struct memb_conf_id *memb_conf_id,
  1648. struct in_addr memb_local_rep)
  1649. {
  1650. gettimeofday (&memb_conf_id->tv, NULL);
  1651. memb_conf_id->rep.s_addr = memb_local_rep.s_addr;
  1652. }
  1653. static void memb_form_token_update_highest_seq (
  1654. struct memb_form_token *form_token)
  1655. {
  1656. struct conf_desc *conf_desc;
  1657. int entry;
  1658. int found = 0;
  1659. for (entry = 0; entry < form_token->conf_desc_list_entries; entry++) {
  1660. if (memcmp (&form_token->conf_desc_list[entry].conf_id,
  1661. &memb_form_token_conf_id, sizeof (struct memb_conf_id)) == 0) {
  1662. found = 1;
  1663. break;
  1664. }
  1665. }
  1666. conf_desc = &form_token->conf_desc_list[entry];
  1667. if (found && gmi_highest_seq < conf_desc->highest_seq) {
  1668. gmi_highest_seq = conf_desc->highest_seq;
  1669. }
  1670. }
  1671. static void memb_form_token_conf_desc_build (
  1672. struct memb_form_token *form_token)
  1673. {
  1674. struct conf_desc *conf_desc;
  1675. int found = 0;
  1676. int entry = 0;
  1677. /*
  1678. * Determine if local configuration id is already present in form token
  1679. */
  1680. for (entry = 0; entry < form_token->conf_desc_list_entries; entry++) {
  1681. if (memcmp (&form_token->conf_desc_list[entry].conf_id,
  1682. &memb_form_token_conf_id, sizeof (struct memb_conf_id)) == 0) {
  1683. found = 1;
  1684. break;
  1685. }
  1686. }
  1687. conf_desc = &form_token->conf_desc_list[entry];
  1688. if (found == 0) {
  1689. /*
  1690. * Item not present, add item
  1691. */
  1692. conf_desc->highest_seq = gmi_highest_seq;
  1693. conf_desc->arut = gmi_arut;
  1694. // TODO holes not currently implemented conf_desc->hole_list_entries = 0;
  1695. memcpy (&conf_desc->conf_id,
  1696. &memb_form_token_conf_id, sizeof (struct memb_conf_id));
  1697. form_token->conf_desc_list_entries += 1;
  1698. } else {
  1699. /*
  1700. * Item already present, update arut, highest seq
  1701. */
  1702. if (conf_desc->arut > gmi_arut) {
  1703. conf_desc->arut = gmi_arut;
  1704. }
  1705. if (gmi_highest_seq > conf_desc->highest_seq) {
  1706. conf_desc->highest_seq = gmi_highest_seq;
  1707. }
  1708. }
  1709. #ifdef COMPILE_OUT
  1710. /*
  1711. * Build conf_desc->hole_list
  1712. */
  1713. printf ("conf desc build %d %d\n", gmi_arut, gmi_highest_seq);
  1714. conf_desc->hole_list_entries = 0;
  1715. for (i = gmi_arut; i < gmi_highest_seq; i++) {
  1716. assert (conf_desc->hole_list_entries < HOLE_LIST_MAX);
  1717. res = sq_item_get (&queue_rtr_items, i, (void **)&gmi_rtr_item_p);
  1718. if (res == 0) {
  1719. /*
  1720. * If item present, delete from hole list if it exists
  1721. */
  1722. for (j = 0; j < conf_desc->hole_list_entries; j++) {
  1723. if (conf_desc->hole_list[j] == i) {
  1724. memmove (&conf_desc->hole_list[j], &conf_desc->hole_list[j + 1],
  1725. sizeof (int) * (conf_desc->hole_list_entries - j - 1));
  1726. conf_desc->hole_list_entries -= 1;
  1727. printf ("reducing setting desc entries to %d\n", conf_desc->hole_list_entries);
  1728. break; /* from for (j = ... ) */
  1729. }
  1730. }
  1731. } else {
  1732. /*
  1733. * If item not present, add to hole list
  1734. */
  1735. conf_desc->hole_list[conf_desc->hole_list_entries] = i;
  1736. conf_desc->hole_list_entries += 1;
  1737. printf ("increasing setting desc entries to %d %d\n", conf_desc->hole_list_entries, i);
  1738. }
  1739. }
  1740. printf ("Conf desc build done\n");
  1741. #endif
  1742. }
  1743. static int memb_form_token_send (
  1744. struct memb_form_token *form_token)
  1745. {
  1746. struct msghdr msg_form_token;
  1747. struct iovec iovec_form_token;
  1748. int res;
  1749. /*
  1750. * Build message for sendmsg
  1751. */
  1752. iovec_form_token.iov_base = form_token;
  1753. iovec_form_token.iov_len = sizeof (struct memb_form_token);
  1754. msg_form_token.msg_name = &memb_next;
  1755. msg_form_token.msg_namelen = sizeof (struct sockaddr_in);
  1756. msg_form_token.msg_iov = &iovec_form_token;
  1757. msg_form_token.msg_iovlen = 1;
  1758. msg_form_token.msg_control = 0;
  1759. msg_form_token.msg_controllen = 0;
  1760. msg_form_token.msg_flags = 0;
  1761. res = sendmsg (gmi_fd_token, &msg_form_token, MSG_NOSIGNAL | MSG_DONTWAIT);
  1762. /*
  1763. * res not used here, because orf token errors are handled by algorithm
  1764. */
  1765. stats_sent += res;
  1766. poll_timer_delete (*gmi_poll_handle, timer_orf_token_timeout);
  1767. timer_orf_token_timeout = 0;
  1768. poll_timer_delete (*gmi_poll_handle, timer_form_token_timeout);
  1769. poll_timer_add (*gmi_poll_handle, TIMEOUT_TOKEN, 0,
  1770. timer_function_form_token_timeout, &timer_form_token_timeout);
  1771. return (res);
  1772. }
  1773. int memb_form_token_send_initial (void)
  1774. {
  1775. struct memb_form_token form_token;
  1776. int res;
  1777. int i;
  1778. memset (&form_token, 0x00, sizeof (struct memb_form_token));
  1779. memb_state = MEMB_STATE_FORM;
  1780. /*
  1781. * Build form token
  1782. */
  1783. form_token.header.type = MESSAGE_TYPE_MEMB_FORM_TOKEN;
  1784. memcpy (form_token.rep_list,
  1785. memb_gather_set,
  1786. memb_gather_set_entries * sizeof (struct in_addr));
  1787. form_token.rep_list_entries = memb_gather_set_entries;
  1788. /*
  1789. * Add local member to entry
  1790. */
  1791. form_token.member_list[0].s_addr =
  1792. memb_local_sockaddr_in.sin_addr.s_addr;
  1793. form_token.member_list_entries = 1;
  1794. memb_conf_id_build (&form_token.conf_id, memb_local_sockaddr_in.sin_addr);
  1795. form_token.conf_desc_list_entries = 0;
  1796. memb_form_token_conf_desc_build (&form_token);
  1797. /*
  1798. * Send FORM to next member, or if no members in this configuration
  1799. * to next representative
  1800. */
  1801. if (memb_list_entries <= 1) {
  1802. memb_next.sin_addr.s_addr = memb_gather_set[1].s_addr;
  1803. } else {
  1804. for (i = 0; i < memb_list_entries; i++) {
  1805. if (memb_list[i].sin_addr.s_addr == memb_local_sockaddr_in.sin_addr.s_addr) {
  1806. memb_next.sin_addr.s_addr =
  1807. memb_list[i + 1].sin_addr.s_addr;
  1808. break;
  1809. }
  1810. }
  1811. }
  1812. // TODO assertion here about the 1 value
  1813. memb_next.sin_family = AF_INET;
  1814. memb_next.sin_port = sockaddr_in_mcast.sin_port;
  1815. res = memb_form_token_send (&form_token);
  1816. return (res);
  1817. }
  1818. void print_stats (void)
  1819. {
  1820. struct timeval tv_end;
  1821. gettimeofday (&tv_end, NULL);
  1822. gmi_log_printf (gmi_log_level_notice, "Bytes recv %d\n", stats_recv);
  1823. gmi_log_printf (gmi_log_level_notice, "Bytes sent %d\n", stats_sent);
  1824. gmi_log_printf (gmi_log_level_notice, "Messages delivered %d\n", stats_delv);
  1825. gmi_log_printf (gmi_log_level_notice, "Re-Mcasts %d\n", stats_remcasts);
  1826. gmi_log_printf (gmi_log_level_notice, "Tokens process %d\n", stats_orf_token);
  1827. }
  1828. /*
  1829. * Authenticates message using nonce, mac, and message body
  1830. */
  1831. static int gmi_msg_auth (struct iovec *iovec, int iov_len)
  1832. {
  1833. return (0);
  1834. }
  1835. int last_lowered = 1;
  1836. static void calculate_group_arut (struct orf_token *orf_token)
  1837. {
  1838. //printf ("group arut %d local arut %d gmi_gmi_highest seq %d\n", orf_token->group_arut, gmi_arut, gmi_highest_seq);
  1839. //printf ("last %d group arut %d last arut %d arut %d\n", last_lowered, orf_token->group_arut, last_group_arut, gmi_arut);
  1840. /*
  1841. * increase the group arut if we got back the same group
  1842. * because everyone has these messages
  1843. */
  1844. messages_free (orf_token->group_arut);
  1845. if (orf_token->addr_arut.s_addr == gmi_bound_to.sin_addr.s_addr) {
  1846. orf_token->group_arut = gmi_arut;
  1847. }
  1848. if (gmi_arut < orf_token->group_arut) {
  1849. orf_token->group_arut = gmi_arut;
  1850. orf_token->addr_arut.s_addr = gmi_bound_to.sin_addr.s_addr;
  1851. }
  1852. last_group_arut = orf_token->group_arut;
  1853. }
  1854. /*
  1855. * Message Handlers
  1856. */
  1857. /*
  1858. * message handler called when TOKEN message type received
  1859. */
  1860. static int message_handler_orf_token (
  1861. struct sockaddr_in *system_from,
  1862. struct iovec *iovec,
  1863. int iov_len,
  1864. int bytes_received)
  1865. {
  1866. struct orf_token *orf_token;
  1867. int transmits_allowed;
  1868. int starting_group_arut;
  1869. orf_token = iovec[0].iov_base;
  1870. #ifdef PRINT_STATS
  1871. if (orf_token->header.seqid > 10000) {
  1872. print_stats ();
  1873. }
  1874. #endif
  1875. if (memb_state == MEMB_STATE_FORM) {
  1876. gmi_log_printf (gmi_log_level_notice, "swallowing ORF token %d.\n", stats_orf_token);
  1877. poll_timer_delete (*gmi_poll_handle, timer_orf_token_timeout);
  1878. timer_orf_token_timeout = 0;
  1879. return (0);
  1880. }
  1881. //printf ("Got orf token from %s\n", inet_ntoa (system_from->sin_addr));
  1882. starting_group_arut = orf_token->group_arut;
  1883. stats_orf_token++;
  1884. transmits_allowed = orf_fcc_allowed (orf_token);
  1885. //printf ("retransmit allowed %d\n", transmits_allowed);
  1886. /*
  1887. * Retransmit failed messages and request retransmissions
  1888. */
  1889. orf_token_rtr (orf_token, &transmits_allowed);
  1890. //printf ("multicasts allowed %d\n", transmits_allowed);
  1891. /*
  1892. * TODO Ok this is ugly and I dont like it.
  1893. *
  1894. * Flow control to limit number of missing multicast messages
  1895. * on lossy switches, this could cause a large window between
  1896. * what is delivered locally and what is delivered remotely.
  1897. * This window could cause the hole list of the form token to
  1898. * be overrun or cause the form token to be large.
  1899. */
  1900. if ((gmi_brake + MISSING_MCAST_WINDOW) < orf_token->header.seqid) {
  1901. transmits_allowed = 0;
  1902. }
  1903. /*
  1904. * Set the group arut and free any messages that can be freed
  1905. */
  1906. if (memb_state != MEMB_STATE_EVS) {
  1907. calculate_group_arut (orf_token);
  1908. }
  1909. /*
  1910. * Multicast queued messages
  1911. */
  1912. orf_token_mcast (orf_token, transmits_allowed, system_from);
  1913. /*
  1914. * Calculate flow control count
  1915. */
  1916. orf_token_fcc (orf_token);
  1917. /*
  1918. * Deliver membership and messages required by EVS
  1919. */
  1920. orf_token_evs (orf_token, starting_group_arut);
  1921. if (memb_state == MEMB_STATE_EVS) {
  1922. calculate_group_arut (orf_token);
  1923. }
  1924. /*
  1925. * Transmit orf_token to next member
  1926. */
  1927. orf_token_send (orf_token);
  1928. return (0);
  1929. }
  1930. static int memb_state_gather_enter (void) {
  1931. struct msghdr msghdr_attempt_join;
  1932. struct iovec iovec_attempt_join;
  1933. struct memb_attempt_join memb_attempt_join;
  1934. int res = 0;
  1935. gmi_log_printf (gmi_log_level_notice, "entering GATHER state.\n");
  1936. memb_state = MEMB_STATE_GATHER;
  1937. /*
  1938. * Join message starts with no entries
  1939. */
  1940. memb_join.active_rep_list_entries = 0;
  1941. memb_join.failed_rep_list_entries = 0;
  1942. /*
  1943. * Copy local host info
  1944. */
  1945. memb_gather_set[0].s_addr = memb_local_sockaddr_in.sin_addr.s_addr;
  1946. memb_gather_set_entries = 1;
  1947. /*
  1948. * If this node is the representative, send attempt join
  1949. */
  1950. if (memb_local_sockaddr_in.sin_addr.s_addr == memb_conf_id.rep.s_addr) {
  1951. gmi_log_printf (gmi_log_level_notice, "SENDING attempt join because this node is ring rep.\n");
  1952. memb_attempt_join.header.seqid = 0;
  1953. memb_attempt_join.header.type = MESSAGE_TYPE_MEMB_ATTEMPT_JOIN;
  1954. iovec_attempt_join.iov_base = &memb_attempt_join;
  1955. iovec_attempt_join.iov_len = sizeof (struct memb_attempt_join);
  1956. msghdr_attempt_join.msg_name = &sockaddr_in_mcast;
  1957. msghdr_attempt_join.msg_namelen = sizeof (struct sockaddr_in);
  1958. msghdr_attempt_join.msg_iov = &iovec_attempt_join;
  1959. msghdr_attempt_join.msg_iovlen = 1;
  1960. msghdr_attempt_join.msg_control = 0;
  1961. msghdr_attempt_join.msg_controllen = 0;
  1962. msghdr_attempt_join.msg_flags = 0;
  1963. res = sendmsg (gmi_fd_mcast, &msghdr_attempt_join, MSG_NOSIGNAL | MSG_DONTWAIT);
  1964. /*
  1965. * res not checked here, there is nothing that can be done
  1966. * instead rely on the algorithm to recover from faults
  1967. */
  1968. }
  1969. poll_timer_delete (*gmi_poll_handle, timer_memb_state_gather_timeout);
  1970. poll_timer_add (*gmi_poll_handle, TIMEOUT_STATE_GATHER, 0,
  1971. memb_timer_function_state_gather, &timer_memb_state_gather_timeout);
  1972. return (res);
  1973. }
  1974. struct pend_delv *pend_delv_next_delivery_find (void)
  1975. {
  1976. struct pend_delv *pend_delv = 0;
  1977. int i;
  1978. /*
  1979. * Find first_delivery queue that is not mepty
  1980. * this sets the first pend_delv
  1981. */
  1982. for (i = 0; i < memb_list_entries_confchg; i++) {
  1983. if (queues_pend_delv[i].first_delivery &&
  1984. queue_is_empty (&queues_pend_delv[i].queue) == 0) {
  1985. pend_delv = &queues_pend_delv[i];
  1986. // printf ("Selecting first queue %s\n", inet_ntoa (pend_delv->ip));
  1987. break;
  1988. }
  1989. }
  1990. /*
  1991. * Search remaining pend_delv for first deliveries with
  1992. * smaller sequence numbers
  1993. */
  1994. for (++i; i < memb_list_entries_confchg; i++) {
  1995. assert (pend_delv);
  1996. if (queues_pend_delv[i].first_delivery &&
  1997. (queue_is_empty (&queues_pend_delv[i].queue) == 0) &&
  1998. (queues_pend_delv[i].seqid < pend_delv->seqid)) {
  1999. pend_delv = &queues_pend_delv[i];
  2000. // printf ("Selecting first queue %s\n", inet_ntoa (pend_delv->ip));
  2001. }
  2002. }
  2003. /*
  2004. * Found first_delivery queue that wasn't empty, return it
  2005. */
  2006. if (pend_delv) {
  2007. return (pend_delv);
  2008. }
  2009. /*
  2010. * No first delivery queues, repeat same
  2011. * process looking for any queue
  2012. */
  2013. for (i = 0; i < memb_list_entries_confchg; i++) {
  2014. if (queue_is_empty (&queues_pend_delv[i].queue) == 0) {
  2015. pend_delv = &queues_pend_delv[i];
  2016. break;
  2017. }
  2018. }
  2019. /*
  2020. * Find lowest sequence number queue
  2021. */
  2022. for (++i; i < memb_list_entries_confchg; i++) {
  2023. assert (pend_delv);
  2024. if ((queue_is_empty (&queues_pend_delv[i].queue) == 0) &&
  2025. (queues_pend_delv[i].seqid < pend_delv->seqid)) {
  2026. pend_delv = &queues_pend_delv[i];
  2027. }
  2028. }
  2029. return (pend_delv);
  2030. }
  2031. static int user_deliver ()
  2032. {
  2033. struct gmi_pend_delv_item *pend_delv_item;
  2034. int i = 0;
  2035. int res = 0;
  2036. struct iovec iovec_delv[256];
  2037. int iov_len_delv = 0;
  2038. struct mcast *mcast = 0;
  2039. int messages_delivered = 0;
  2040. struct pend_delv *pend_delv;
  2041. int retval = 0;
  2042. /*
  2043. * Find pend_delv with lowest sequence number. This pend_delv is
  2044. * the queue that should be delivered from next
  2045. */
  2046. pend_delv = pend_delv_next_delivery_find ();
  2047. //printf ("Delivering from queue %s\n", inet_ntoa (pend_delv->ip));
  2048. /*
  2049. * If a message was not assembled on the queue with the lowest
  2050. * sequence number, return since there is no reason to attempt assembly.
  2051. */
  2052. memset (iovec_delv, 0, sizeof (iovec_delv));
  2053. queue_item_iterator_init (&pend_delv->queue);
  2054. assert (queue_is_empty (&pend_delv->queue) == 0);
  2055. //printf ("Starting a packet assembly\n");
  2056. do {
  2057. pend_delv_item = queue_item_iterator_get (&pend_delv->queue);
  2058. mcast = pend_delv_item->iovec[0].iov_base;
  2059. assert (pend_delv_item);
  2060. assert (pend_delv_item->iovec[0].iov_len < MESSAGE_SIZE_MAX);
  2061. assert (pend_delv_item->iovec[0].iov_len != 0);
  2062. assert (pend_delv_item->iovec[0].iov_base != 0);
  2063. assert (mcast != (struct mcast *)0xdeadbeef);
  2064. assert (pend_delv->ip.s_addr == mcast->source.s_addr);
  2065. messages_delivered += 1;
  2066. /*
  2067. * Assemble io vector
  2068. */
  2069. if (pend_delv_item->iovec[0].iov_len == sizeof (struct mcast)) {
  2070. /*
  2071. * Copy iovec from second iovec if this is self-delivered
  2072. */
  2073. memcpy (&iovec_delv[iov_len_delv],
  2074. &pend_delv_item->iovec[1],
  2075. sizeof (struct iovec) * pend_delv_item->iov_len - 1);
  2076. iov_len_delv += pend_delv_item->iov_len - 1;
  2077. } else {
  2078. /*
  2079. * Copy iovec from first iovec if this is an external message
  2080. */
  2081. iovec_delv[iov_len_delv].iov_base =
  2082. pend_delv_item->iovec[0].iov_base + sizeof (struct mcast);
  2083. iovec_delv[iov_len_delv].iov_len =
  2084. pend_delv_item->iovec[0].iov_len - sizeof (struct mcast);
  2085. assert (iovec_delv[iov_len_delv].iov_len < MESSAGE_SIZE_MAX);
  2086. iov_len_delv += 1;
  2087. if (pend_delv_item->iov_len > 1) {
  2088. memcpy (&iovec_delv[iov_len_delv],
  2089. &pend_delv_item->iovec[1],
  2090. sizeof (struct iovec) * pend_delv_item->iov_len - 1);
  2091. iov_len_delv += pend_delv_item->iov_len - 1;
  2092. }
  2093. }
  2094. assert (iov_len_delv < 256);
  2095. assert (iov_len_delv > 0);
  2096. //printf ("Assembling from packet %d of %d of total %d\n",
  2097. // mcast->packet_number, mcast->packet_count, mcast->packet_seq);
  2098. /*
  2099. * Deliver message if this is the last packet
  2100. */
  2101. if (mcast->packet_number == mcast->packet_count) {
  2102. gmi_log_printf (gmi_log_level_debug, "Last packet, delivering iovec %d entries seq %d\n",
  2103. iov_len_delv, i);
  2104. gmi_deliver_fn (
  2105. &mcast->groupname,
  2106. iovec_delv,
  2107. iov_len_delv);
  2108. /*
  2109. * On the first message delivery:
  2110. * Free items in the pending queue up to the barrier message
  2111. * set gmi_adut to rut so that message_free may free any messages.
  2112. */
  2113. if (pend_delv->first_delivery) {
  2114. // printf ("releasing all messages up to %d\n", gmi_adut);
  2115. // TODO actually release the messages from the previous configuration
  2116. // TODO without a fix here, those messages are leaked
  2117. }
  2118. /*
  2119. * Because of the ordering guarantees, we are guaranteed that
  2120. * pend_delv->seqid on every invocation of user_deliver shall
  2121. * increase (or reset to zero). This allows us to set the
  2122. * low water mark (gmi_adut) for freeing of messages to atleast
  2123. * the beginning of this message.
  2124. */
  2125. gmi_adut = pend_delv->seqid;
  2126. /*
  2127. * Determine if there are more messages on this queue
  2128. */
  2129. res = queue_item_iterator_next (&pend_delv->queue);
  2130. if (res == 0) {
  2131. /*
  2132. * More items to deliver set queues seqid head so
  2133. * correct pending queue can be selected next time
  2134. */
  2135. pend_delv_item = queue_item_iterator_get (&pend_delv->queue);
  2136. mcast = pend_delv_item->iovec[0].iov_base;
  2137. pend_delv->seqid = mcast->header.seqid;
  2138. for (i = 0; i < messages_delivered; i++) {
  2139. queue_item_remove (&pend_delv->queue);
  2140. }
  2141. } else {
  2142. /*
  2143. * No more items to deliver
  2144. */
  2145. pend_delv->seqid = 0;
  2146. queue_reinit (&pend_delv->queue);
  2147. }
  2148. retval = 1;
  2149. break; /* From do loop */
  2150. }
  2151. res = queue_item_iterator_next (&pend_delv->queue);
  2152. } while (res == 0);
  2153. return (retval);
  2154. }
  2155. struct pend_delv *pend_delv_find (struct in_addr source)
  2156. {
  2157. struct pend_delv *pend_delv = 0;
  2158. int i;
  2159. for (i = 0; i < memb_list_entries_confchg; i++) {
  2160. if (source.s_addr == queues_pend_delv[i].ip.s_addr) {
  2161. pend_delv = &queues_pend_delv[i];
  2162. break;
  2163. }
  2164. }
  2165. return (pend_delv);
  2166. }
  2167. static int delivery_outstanding = 0;
  2168. static void pending_queues_deliver (void)
  2169. {
  2170. struct gmi_rtr_item *gmi_rtr_item_p;
  2171. int i;
  2172. int res;
  2173. struct mcast *mcast;
  2174. struct gmi_pend_delv_item pend_delv_item;
  2175. struct pend_delv *pend_delv;
  2176. int delivered;
  2177. //printf ("Delivering messages to pending queues\n");
  2178. /*
  2179. * Deliver messages in order from rtr queue to pending delivery queue
  2180. */
  2181. for (i = gmi_arut + 1; i <= gmi_highest_seq; i++) {
  2182. res = sq_item_get (&queue_rtr_items, i, (void **)&gmi_rtr_item_p);
  2183. /*
  2184. * If hole, stop assembly
  2185. */
  2186. if (res != 0) {
  2187. break;
  2188. }
  2189. assert (gmi_rtr_item_p->iovec[0].iov_len < MESSAGE_SIZE_MAX);
  2190. mcast = gmi_rtr_item_p->iovec[0].iov_base;
  2191. if (mcast == (struct mcast *)0xdeadbeef) {
  2192. printf ("seqid %d\n", gmi_rtr_item_p->iovec[0].iov_len);
  2193. }
  2194. assert (mcast != (struct mcast *)0xdeadbeef);
  2195. /*
  2196. * Message found
  2197. */
  2198. gmi_log_printf (gmi_log_level_debug,
  2199. "Delivering MCAST message with seqid %d to pending delivery queue\n",
  2200. mcast->header.seqid);
  2201. //printf ("Delivering MCAST from packet %d of %d of total %d seqid %d\n", mcast->packet_number, mcast->packet_count, mcast->packet_seq, mcast->header.seqid);
  2202. gmi_arut = i;
  2203. /*
  2204. * Create pending delivery item
  2205. */
  2206. pend_delv_item.iov_len = gmi_rtr_item_p->iov_len;
  2207. memcpy (&pend_delv_item.iovec, gmi_rtr_item_p->iovec,
  2208. sizeof (struct iovec) * gmi_rtr_item_p->iov_len);
  2209. assert (gmi_rtr_item_p->iov_len < MAXIOVS);
  2210. assert (mcast->source.s_addr != 0);
  2211. pend_delv = pend_delv_find (mcast->source);
  2212. assert (pend_delv != 0);
  2213. assert (pend_delv->ip.s_addr != 0);
  2214. if (mcast->packet_number == 0) {
  2215. pend_delv->seqid = mcast->header.seqid;
  2216. }
  2217. /*
  2218. * Add pending delivery item to pending delivery queue
  2219. */
  2220. queue_item_add (&pend_delv->queue, &pend_delv_item);
  2221. /*
  2222. * If message is complete, attempt delivery of all messages
  2223. * that are currently outstanding
  2224. */
  2225. if (mcast->packet_number == mcast->packet_count) {
  2226. //printf ("Starting delivery\n");
  2227. delivery_outstanding += 1;
  2228. do {
  2229. delivered = user_deliver ();
  2230. if (delivered) {
  2231. delivery_outstanding -= 1;
  2232. }
  2233. } while (delivery_outstanding && delivered);
  2234. }
  2235. }
  2236. //printf ("Done delivering messages to pending queues\n");
  2237. }
  2238. /*
  2239. * recv message handler called when MCAST message type received
  2240. */
  2241. static int message_handler_mcast (
  2242. struct sockaddr_in *system_from,
  2243. struct iovec *iovec,
  2244. int iov_len,
  2245. int bytes_received)
  2246. {
  2247. struct gmi_rtr_item gmi_rtr_item;
  2248. struct mcast *mcast;
  2249. mcast = iovec[0].iov_base;
  2250. /*
  2251. * Ignore multicasts for other configurations
  2252. * TODO shouldn't we enter gather here?
  2253. */
  2254. if (memcmp (&mcast->memb_conf_id,
  2255. &memb_form_token_conf_id, sizeof (struct memb_conf_id)) != 0) {
  2256. return (0);
  2257. }
  2258. /*
  2259. * Add mcast message to rtr queue if not already in rtr queue
  2260. * otherwise free io vectors
  2261. */
  2262. if (bytes_received > 0 && bytes_received < MESSAGE_SIZE_MAX &&
  2263. sq_item_inuse (&queue_rtr_items, mcast->header.seqid) == 0) {
  2264. /*
  2265. * Allocate new multicast memory block
  2266. * TODO we need to free this somewhere
  2267. */
  2268. gmi_rtr_item.iovec[0].iov_base = malloc (bytes_received);
  2269. if (gmi_rtr_item.iovec[0].iov_base == 0) {
  2270. return (-1); /* error here is corrected by the algorithm */
  2271. }
  2272. memcpy (gmi_rtr_item.iovec[0].iov_base, mcast, bytes_received);
  2273. gmi_rtr_item.iovec[0].iov_len = bytes_received;
  2274. assert (gmi_rtr_item.iovec[0].iov_len > 0);
  2275. assert (gmi_rtr_item.iovec[0].iov_len < MESSAGE_SIZE_MAX);
  2276. gmi_rtr_item.iov_len = 1;
  2277. if (mcast->header.seqid > gmi_highest_seq) {
  2278. gmi_highest_seq = mcast->header.seqid;
  2279. }
  2280. sq_item_add (&queue_rtr_items, &gmi_rtr_item, mcast->header.seqid);
  2281. }
  2282. pending_queues_deliver ();
  2283. return (0);
  2284. }
  2285. static int message_handler_memb_attempt_join (
  2286. struct sockaddr_in *system_from,
  2287. struct iovec *iov,
  2288. int iov_len,
  2289. int bytes_received)
  2290. {
  2291. int token_lost;
  2292. int found;
  2293. int i;
  2294. gmi_log_printf (gmi_log_level_notice, "Got attempt join from %s\n", inet_ntoa (system_from->sin_addr));
  2295. for (token_lost = 0, i = 0; i < memb_list_entries; i++) {
  2296. if (memb_list[i].sin_addr.s_addr == system_from->sin_addr.s_addr &&
  2297. memb_conf_id.rep.s_addr != system_from->sin_addr.s_addr) {
  2298. gmi_log_printf (gmi_log_level_debug, "ATTEMPT JOIN, token lost, taking attempt join msg.\n");
  2299. poll_timer_delete (*gmi_poll_handle, timer_orf_token_timeout);
  2300. timer_orf_token_timeout = 0;
  2301. memb_conf_id.rep.s_addr = memb_local_sockaddr_in.sin_addr.s_addr;
  2302. token_lost = 1;
  2303. break;
  2304. }
  2305. }
  2306. /*
  2307. * Not representative
  2308. */
  2309. if (token_lost == 0 &&
  2310. memb_conf_id.rep.s_addr != memb_local_sockaddr_in.sin_addr.s_addr) {
  2311. gmi_log_printf (gmi_log_level_notice, "not the rep for this ring, not handling attempt join.\n");
  2312. return (0);
  2313. }
  2314. switch (memb_state) {
  2315. case MEMB_STATE_OPERATIONAL:
  2316. case MEMB_STATE_COMMIT:
  2317. memb_state_gather_enter ();
  2318. /*
  2319. * Do NOT place break here, immediately execute gather attempt join
  2320. */
  2321. case MEMB_STATE_GATHER:
  2322. gmi_log_printf (gmi_log_level_debug, "ATTEMPT JOIN: state gather\n");
  2323. for (found = 0, i = 0; i < memb_gather_set_entries; i++) {
  2324. if (memb_gather_set[i].s_addr == system_from->sin_addr.s_addr) {
  2325. found = 1;
  2326. }
  2327. }
  2328. if (found == 0) {
  2329. memb_gather_set[memb_gather_set_entries++].s_addr = system_from->sin_addr.s_addr;
  2330. /*
  2331. * Sort gather set
  2332. */
  2333. qsort (memb_gather_set, memb_gather_set_entries,
  2334. sizeof (struct in_addr), in_addr_compare);
  2335. }
  2336. break;
  2337. default:
  2338. // TODO what about other states
  2339. gmi_log_printf (gmi_log_level_error, "memb_attempt_join: EVS or FORM state attempt join occured %d\n", memb_state);
  2340. }
  2341. return (0);
  2342. }
  2343. static int message_handler_memb_join (
  2344. struct sockaddr_in *system_from,
  2345. struct iovec *iovec,
  2346. int iov_len,
  2347. int bytes_received)
  2348. {
  2349. struct memb_join *memb_join;
  2350. int commit_entry;
  2351. int found;
  2352. int consensus;
  2353. /*
  2354. * Not representative
  2355. */
  2356. if (memb_conf_id.rep.s_addr != memb_local_sockaddr_in.sin_addr.s_addr) {
  2357. gmi_log_printf (gmi_log_level_debug, "not the rep for this ring, not handling join.\n");
  2358. return (0);
  2359. }
  2360. switch (memb_state) {
  2361. case MEMB_STATE_OPERATIONAL:
  2362. case MEMB_STATE_GATHER:
  2363. memb_state_commit_enter ();
  2364. /*
  2365. * do not place break in this case, immediately enter COMMIT state
  2366. */
  2367. case MEMB_STATE_COMMIT:
  2368. gmi_log_printf (gmi_log_level_debug, "JOIN in commit\n");
  2369. memb_join = (struct memb_join *)iovec[0].iov_base;
  2370. /*
  2371. * Find gather set that matches the system message was from
  2372. */
  2373. for (found = 0, commit_entry = 0; commit_entry < memb_commit_set_entries; commit_entry++) {
  2374. if (system_from->sin_addr.s_addr == memb_commit_set[commit_entry].rep.sin_addr.s_addr) {
  2375. found = 1;
  2376. break;
  2377. }
  2378. }
  2379. /*
  2380. * Add system from to commit sets if not currently in commit set
  2381. */
  2382. if (found == 0) {
  2383. memcpy (&memb_commit_set[commit_entry].rep, system_from, sizeof (struct sockaddr_in));
  2384. memb_commit_set_entries++;
  2385. }
  2386. /*
  2387. * Set gather join data
  2388. */
  2389. memcpy (memb_commit_set[commit_entry].join_rep_list, memb_join->active_rep_list,
  2390. sizeof (struct in_addr) * memb_join->active_rep_list_entries);
  2391. memb_commit_set[commit_entry].join_rep_list_entries = memb_join->active_rep_list_entries;
  2392. /*
  2393. * Union all entries into the gather set (join_rep_list[0])
  2394. */
  2395. memb_state_commit_union (commit_entry);
  2396. /*
  2397. * Send JOIN message, but only if gather set has changed
  2398. */
  2399. memb_join_send ();
  2400. /*
  2401. * If consensus, transition to FORM
  2402. */
  2403. memb_print_commit_set ();
  2404. consensus = memb_state_consensus_commit ();
  2405. if (consensus) {
  2406. gmi_log_printf (gmi_log_level_notice, "CONSENSUS reached!\n");
  2407. if (memb_local_sockaddr_in.sin_addr.s_addr == memb_gather_set[0].s_addr) {
  2408. gmi_log_printf (gmi_log_level_debug, "This node responsible for sending the FORM token.\n");
  2409. poll_timer_delete (*gmi_poll_handle, timer_memb_state_commit_timeout);
  2410. timer_memb_state_commit_timeout = 0;
  2411. memb_form_token_send_initial ();
  2412. }
  2413. }
  2414. break;
  2415. /*
  2416. * All other cases are ignored on JOINs
  2417. */
  2418. case MEMB_STATE_FORM:
  2419. gmi_log_printf (gmi_log_level_warning, "JOIN in form, ignoring since consensus reached in state machine.\n");
  2420. break;
  2421. default:
  2422. // TODO HANDLE THIS CASE
  2423. gmi_log_printf (gmi_log_level_debug, "memb_join: DEFAULT case %d, shouldn't happen!!\n", memb_state);
  2424. break;
  2425. }
  2426. return (0);
  2427. }
  2428. static int message_handler_memb_form_token (
  2429. struct sockaddr_in *system_from,
  2430. struct iovec *iovec,
  2431. int iov_len,
  2432. int bytes_received)
  2433. {
  2434. int i;
  2435. int local = 0;
  2436. int res = 0;
  2437. printf ("Got membership form token\n");
  2438. memcpy (&memb_form_token, iovec->iov_base, sizeof (struct memb_form_token));
  2439. poll_timer_delete (*gmi_poll_handle, timer_form_token_timeout);
  2440. timer_form_token_timeout = 0;
  2441. switch (memb_state) {
  2442. case MEMB_STATE_OPERATIONAL:
  2443. case MEMB_STATE_COMMIT:
  2444. memb_state = MEMB_STATE_FORM;
  2445. poll_timer_delete (*gmi_poll_handle, timer_memb_state_commit_timeout);
  2446. timer_memb_state_commit_timeout = 0;
  2447. /*
  2448. * Add member to entry
  2449. */
  2450. memb_form_token.member_list[memb_form_token.member_list_entries].s_addr =
  2451. memb_local_sockaddr_in.sin_addr.s_addr;
  2452. memb_form_token.member_list_entries++;
  2453. /*
  2454. * Modify the conf_id as necessary
  2455. */
  2456. memb_form_token_conf_desc_build (&memb_form_token);
  2457. /*
  2458. * Stop token timeout timer from firing
  2459. * If we are in FORM state, a previous FORM state member
  2460. * may have captured the ORF token and swallowed it
  2461. */
  2462. poll_timer_delete (*gmi_poll_handle, timer_orf_token_timeout);
  2463. timer_orf_token_timeout = 0;
  2464. /*
  2465. * Find next member
  2466. */
  2467. for (i = 0; i < memb_list_entries; i++) {
  2468. if (memb_list[i].sin_addr.s_addr == memb_local_sockaddr_in.sin_addr.s_addr) {
  2469. local = 1;
  2470. break;
  2471. }
  2472. }
  2473. if (memb_list_entries == 0) { /* 0 or 1 members and we are local */
  2474. local = 1;
  2475. }
  2476. if (local && (i + 1 < memb_list_entries)) {
  2477. memb_next.sin_addr.s_addr = memb_list[i + 1].sin_addr.s_addr;
  2478. } else {
  2479. /*
  2480. * Find next representative
  2481. */
  2482. for (i = 0; i < memb_form_token.rep_list_entries; i++) {
  2483. if (memb_conf_id.rep.s_addr ==
  2484. memb_form_token.rep_list[i].s_addr) {
  2485. break;
  2486. }
  2487. }
  2488. memb_next.sin_addr.s_addr =
  2489. memb_form_token.rep_list[(i + 1) % memb_form_token.rep_list_entries].s_addr;
  2490. }
  2491. memb_next.sin_family = AF_INET;
  2492. memb_next.sin_port = sockaddr_in_mcast.sin_port;
  2493. break;
  2494. case MEMB_STATE_FORM:
  2495. memb_state = MEMB_STATE_EVS;
  2496. memb_form_token_update_highest_seq (&memb_form_token);
  2497. /*
  2498. * FORM token has rotated once, now install local variables
  2499. *
  2500. * Set barrier sequence number
  2501. * Set original arut
  2502. */
  2503. gmi_barrier_seq = 0;
  2504. printf ("conf_desc_list %d\n", memb_form_token.conf_desc_list_entries);
  2505. for (i = 0; i < memb_form_token.conf_desc_list_entries; i++) {
  2506. printf ("highest seq %d %d\n", i, memb_form_token.conf_desc_list[i].highest_seq);
  2507. if (gmi_barrier_seq < memb_form_token.conf_desc_list[i].highest_seq) {
  2508. gmi_barrier_seq = memb_form_token.conf_desc_list[i].highest_seq;
  2509. printf ("setting barrier seq to %d\n", gmi_barrier_seq);
  2510. }
  2511. }
  2512. gmi_barrier_seq += 1;
  2513. printf ("setting barrier seq to %d\n", gmi_barrier_seq);
  2514. gmi_original_arut = gmi_arut;
  2515. /*
  2516. * Determine next ORF target
  2517. */
  2518. for (i = 0; i < memb_form_token.member_list_entries; i++) {
  2519. if (memb_local_sockaddr_in.sin_addr.s_addr == memb_form_token.member_list[i].s_addr) {
  2520. memb_next.sin_addr.s_addr =
  2521. memb_form_token.member_list[(i + 1) % memb_form_token.member_list_entries].s_addr;
  2522. memb_next.sin_family = AF_INET;
  2523. memb_next.sin_port = sockaddr_in_mcast.sin_port;
  2524. }
  2525. //ABRA
  2526. }
  2527. break;
  2528. case MEMB_STATE_EVS:
  2529. gmi_log_printf (gmi_log_level_debug, "Swallowing FORM token in EVS state.\n");
  2530. printf ("FORM CONF ENTRIES %d\n", memb_form_token.conf_desc_list_entries);
  2531. orf_token_send_initial();
  2532. return (0);
  2533. default:
  2534. // TODO
  2535. gmi_log_printf (gmi_log_level_error, "memb_form_token: default case, shouldn't happen.\n");
  2536. return (0);
  2537. }
  2538. res = memb_form_token_send (&memb_form_token);
  2539. return (res);
  2540. }
  2541. int recv_handler (poll_handle handle, int fd, int revents, void *data)
  2542. {
  2543. struct msghdr msg_recv;
  2544. struct message_header *message_header;
  2545. struct sockaddr_in system_from;
  2546. int res = 0;
  2547. int bytes_received;
  2548. /*
  2549. * Receive datagram
  2550. */
  2551. msg_recv.msg_name = &system_from;
  2552. msg_recv.msg_namelen = sizeof (struct sockaddr_in);
  2553. msg_recv.msg_iov = &gmi_iov_recv;
  2554. msg_recv.msg_iovlen = 1;
  2555. msg_recv.msg_control = 0;
  2556. msg_recv.msg_controllen = 0;
  2557. msg_recv.msg_flags = 0;
  2558. bytes_received = recvmsg (fd, &msg_recv, MSG_NOSIGNAL | MSG_DONTWAIT);
  2559. if (bytes_received == -1) {
  2560. return (0);
  2561. } else {
  2562. stats_recv += bytes_received;
  2563. }
  2564. /*
  2565. * Authenticate datagram
  2566. */
  2567. res = gmi_msg_auth (msg_recv.msg_iov, msg_recv.msg_iovlen);
  2568. if (res == -1) {
  2569. return 0;
  2570. }
  2571. if (stats_tv_start.tv_usec == 0) {
  2572. gettimeofday (&stats_tv_start, NULL);
  2573. }
  2574. /*
  2575. * Handle incoming message
  2576. */
  2577. message_header = (struct message_header *)msg_recv.msg_iov[0].iov_base;
  2578. gmi_message_handlers.handler_functions[message_header->type] (
  2579. &system_from,
  2580. msg_recv.msg_iov,
  2581. msg_recv.msg_iovlen,
  2582. bytes_received);
  2583. return (0);
  2584. }