gmi.c 80 KB

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