gmi.c 79 KB

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