gmi.c 89 KB

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