gmi.c 104 KB

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