gmi.c 81 KB

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