gmi.c 83 KB

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