gmi.c 104 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534253525362537253825392540254125422543254425452546254725482549255025512552255325542555255625572558255925602561256225632564256525662567256825692570257125722573257425752576257725782579258025812582258325842585258625872588258925902591259225932594259525962597259825992600260126022603260426052606260726082609261026112612261326142615261626172618261926202621262226232624262526262627262826292630263126322633263426352636263726382639264026412642264326442645264626472648264926502651265226532654265526562657265826592660266126622663266426652666266726682669267026712672267326742675267626772678267926802681268226832684268526862687268826892690269126922693269426952696269726982699270027012702270327042705270627072708270927102711271227132714271527162717271827192720272127222723272427252726272727282729273027312732273327342735273627372738273927402741274227432744274527462747274827492750275127522753275427552756275727582759276027612762276327642765276627672768276927702771277227732774277527762777277827792780278127822783278427852786278727882789279027912792279327942795279627972798279928002801280228032804280528062807280828092810281128122813281428152816281728182819282028212822282328242825282628272828282928302831283228332834283528362837283828392840284128422843284428452846284728482849285028512852285328542855285628572858285928602861286228632864286528662867286828692870287128722873287428752876287728782879288028812882288328842885288628872888288928902891289228932894289528962897289828992900290129022903290429052906290729082909291029112912291329142915291629172918291929202921292229232924292529262927292829292930293129322933293429352936293729382939294029412942294329442945294629472948294929502951295229532954295529562957295829592960296129622963296429652966296729682969297029712972297329742975297629772978297929802981298229832984298529862987298829892990299129922993299429952996299729982999300030013002300330043005300630073008300930103011301230133014301530163017301830193020302130223023302430253026302730283029303030313032303330343035303630373038303930403041304230433044304530463047304830493050305130523053305430553056305730583059306030613062306330643065306630673068306930703071307230733074307530763077307830793080308130823083308430853086308730883089309030913092309330943095309630973098309931003101310231033104310531063107310831093110311131123113311431153116311731183119312031213122312331243125312631273128312931303131313231333134313531363137313831393140314131423143314431453146314731483149315031513152315331543155315631573158315931603161316231633164316531663167316831693170317131723173317431753176317731783179318031813182318331843185318631873188318931903191319231933194319531963197319831993200320132023203320432053206320732083209321032113212321332143215321632173218321932203221322232233224322532263227322832293230323132323233323432353236323732383239324032413242324332443245324632473248324932503251325232533254325532563257325832593260326132623263326432653266326732683269327032713272327332743275327632773278327932803281328232833284328532863287328832893290329132923293329432953296329732983299330033013302330333043305330633073308330933103311331233133314331533163317331833193320332133223323332433253326332733283329333033313332333333343335333633373338333933403341334233433344334533463347334833493350335133523353335433553356335733583359336033613362336333643365336633673368336933703371337233733374337533763377337833793380338133823383338433853386338733883389339033913392339333943395339633973398339934003401340234033404340534063407340834093410341134123413341434153416341734183419342034213422342334243425342634273428342934303431343234333434343534363437343834393440344134423443344434453446344734483449345034513452345334543455345634573458345934603461346234633464346534663467346834693470347134723473347434753476347734783479348034813482348334843485348634873488348934903491349234933494349534963497349834993500350135023503350435053506350735083509351035113512351335143515351635173518351935203521352235233524352535263527352835293530353135323533353435353536353735383539354035413542354335443545354635473548354935503551355235533554355535563557355835593560356135623563356435653566356735683569357035713572357335743575357635773578357935803581358235833584358535863587358835893590359135923593359435953596359735983599360036013602360336043605360636073608360936103611361236133614361536163617361836193620362136223623362436253626362736283629363036313632363336343635363636373638363936403641364236433644364536463647364836493650365136523653365436553656365736583659366036613662366336643665366636673668366936703671367236733674367536763677367836793680368136823683368436853686368736883689369036913692369336943695369636973698369937003701370237033704370537063707370837093710371137123713371437153716371737183719372037213722372337243725372637273728372937303731373237333734373537363737373837393740374137423743374437453746374737483749375037513752375337543755375637573758375937603761376237633764376537663767376837693770377137723773377437753776377737783779378037813782378337843785378637873788378937903791379237933794379537963797379837993800380138023803380438053806380738083809381038113812381338143815381638173818381938203821382238233824382538263827382838293830383138323833383438353836383738383839384038413842384338443845384638473848384938503851385238533854385538563857385838593860386138623863386438653866386738683869387038713872387338743875387638773878387938803881388238833884388538863887388838893890389138923893389438953896389738983899390039013902390339043905390639073908390939103911391239133914391539163917391839193920392139223923392439253926392739283929393039313932393339343935393639373938393939403941394239433944394539463947394839493950395139523953395439553956395739583959396039613962396339643965396639673968396939703971397239733974397539763977
  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. iov_encrypted.iov_len = 0;
  631. char keys[48];
  632. struct security_header *header = iov_encrypted.iov_base;
  633. prng_state keygen_prng_state;
  634. prng_state stream_prng_state;
  635. char *hmac_key = &keys[32];
  636. char *cipher_key = &keys[16];
  637. char *initial_vector = &keys[0];
  638. unsigned long len;
  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. iov_encrypted.iov_len = 0;
  705. char keys[48];
  706. struct security_header *header = iov[0].iov_base;
  707. prng_state keygen_prng_state;
  708. prng_state stream_prng_state;
  709. char *hmac_key = &keys[32];
  710. char *cipher_key = &keys[16];
  711. char *initial_vector = &keys[0];
  712. char digest_comparison[HMAC_HASH_SIZE];
  713. unsigned long len;
  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. printf ("res is %d\n", res);
  1040. return (res);
  1041. }
  1042. static int gmi_build_sockets (struct sockaddr_in *sockaddr_mcast,
  1043. struct sockaddr_in *sockaddr_bindnet,
  1044. struct gmi_socket *sockets,
  1045. struct sockaddr_in *bound_to)
  1046. {
  1047. struct ip_mreq mreq;
  1048. struct sockaddr_in sockaddr_in;
  1049. char flag;
  1050. int res;
  1051. memset (&mreq, 0, sizeof (struct ip_mreq));
  1052. /*
  1053. * Determine the ip address bound to and the interface name
  1054. */
  1055. res = netif_determine (sockaddr_bindnet,
  1056. bound_to);
  1057. if (res == -1) {
  1058. return (-1);
  1059. }
  1060. /* TODO this should be somewhere else */
  1061. memb_local_sockaddr_in.sin_addr.s_addr = bound_to->sin_addr.s_addr;
  1062. memb_local_sockaddr_in.sin_family = AF_INET;
  1063. memb_local_sockaddr_in.sin_port = sockaddr_mcast->sin_port;
  1064. /*
  1065. * Create multicast socket
  1066. */
  1067. sockets->mcast = socket (AF_INET, SOCK_DGRAM, 0);
  1068. if (sockets->mcast == -1) {
  1069. perror ("socket");
  1070. return (-1);
  1071. }
  1072. if (setsockopt (sockets->mcast, SOL_IP, IP_MULTICAST_IF,
  1073. &bound_to->sin_addr, sizeof (struct in_addr)) < 0) {
  1074. gmi_log_printf (gmi_log_level_warning, "Could not bind to device for multicast, group messaging may not work properly. (%s)\n", strerror (errno));
  1075. }
  1076. /*
  1077. * Bind to multicast socket used for multicast send/receives
  1078. */
  1079. sockaddr_in.sin_family = AF_INET;
  1080. sockaddr_in.sin_addr.s_addr = sockaddr_mcast->sin_addr.s_addr;
  1081. sockaddr_in.sin_port = sockaddr_mcast->sin_port;
  1082. res = bind (sockets->mcast, (struct sockaddr *)&sockaddr_in,
  1083. sizeof (struct sockaddr_in));
  1084. if (res == -1) {
  1085. perror ("bind failed");
  1086. return (-1);
  1087. }
  1088. /*
  1089. * Setup unicast socket
  1090. */
  1091. sockets->token = socket (AF_INET, SOCK_DGRAM, 0);
  1092. if (sockets->token == -1) {
  1093. perror ("socket2");
  1094. return (-1);
  1095. }
  1096. /*
  1097. * Bind to unicast socket used for token send/receives
  1098. * This has the side effect of binding to the correct interface
  1099. */
  1100. sockaddr_in.sin_addr.s_addr = bound_to->sin_addr.s_addr;
  1101. res = bind (sockets->token, (struct sockaddr *)&sockaddr_in,
  1102. sizeof (struct sockaddr_in));
  1103. if (res == -1) {
  1104. perror ("bind2 failed");
  1105. return (-1);
  1106. }
  1107. #ifdef CONFIG_USE_BROADCAST
  1108. /* This config option doesn't work */
  1109. {
  1110. int on = 1;
  1111. setsockopt (sockets->mcast, SOL_SOCKET, SO_BROADCAST, (char *)&on, sizeof (on));
  1112. }
  1113. #else
  1114. /*
  1115. * Join group membership on socket
  1116. */
  1117. mreq.imr_multiaddr.s_addr = sockaddr_mcast->sin_addr.s_addr;
  1118. mreq.imr_interface.s_addr = bound_to->sin_addr.s_addr;
  1119. res = setsockopt (sockets->mcast, IPPROTO_IP, IP_ADD_MEMBERSHIP,
  1120. &mreq, sizeof (mreq));
  1121. if (res == -1) {
  1122. perror ("join multicast group failed");
  1123. return (-1);
  1124. }
  1125. #endif
  1126. /*
  1127. * Turn off multicast loopback since we know what messages we have sent
  1128. */
  1129. flag = 0;
  1130. res = setsockopt (sockets->mcast, IPPROTO_IP, IP_MULTICAST_LOOP,
  1131. &flag, sizeof (flag));
  1132. if (res == -1) {
  1133. perror ("turn off loopback");
  1134. return (-1);
  1135. }
  1136. return (0);
  1137. }
  1138. /*
  1139. * Misc Management
  1140. */
  1141. int in_addr_compare (const void *a, const void *b) {
  1142. struct in_addr *in_addr_a = (struct in_addr *)a;
  1143. struct in_addr *in_addr_b = (struct in_addr *)b;
  1144. return (in_addr_a->s_addr > in_addr_b->s_addr);
  1145. }
  1146. /*
  1147. * ORF Token Management
  1148. */
  1149. /*
  1150. * Recast message to mcast group if it is available
  1151. */
  1152. int orf_token_remcast (int seqid) {
  1153. struct msghdr msg_mcast;
  1154. struct gmi_rtr_item *gmi_rtr_item;
  1155. int res;
  1156. struct mcast *mcast;
  1157. void *ptr;
  1158. #ifdef DEBUG
  1159. printf ("remulticasting %d\n", seqid);
  1160. #endif
  1161. /*
  1162. * Get RTR item at seqid, if not available, return
  1163. */
  1164. res = sq_item_get (&queue_rtr_items, seqid, &ptr);
  1165. if (res != 0) {
  1166. return -1;
  1167. }
  1168. gmi_rtr_item = ptr;
  1169. mcast = (struct mcast *)gmi_rtr_item->iovec[0].iov_base;
  1170. encrypt_and_sign (gmi_rtr_item->iovec, gmi_rtr_item->iov_len);
  1171. /*
  1172. * Build multicast message
  1173. */
  1174. msg_mcast.msg_name = (caddr_t)&sockaddr_in_mcast;
  1175. msg_mcast.msg_namelen = sizeof (struct sockaddr_in);
  1176. msg_mcast.msg_iov = &iov_encrypted;
  1177. msg_mcast.msg_iovlen = 1;
  1178. msg_mcast.msg_control = 0;
  1179. msg_mcast.msg_controllen = 0;
  1180. msg_mcast.msg_flags = 0;
  1181. /*
  1182. * Multicast message
  1183. */
  1184. res = sendmsg (gmi_sockets[0].mcast, &msg_mcast, MSG_NOSIGNAL | MSG_DONTWAIT);
  1185. if (res == -1) {
  1186. printf ("error during remulticast %d %d %d\n", seqid, errno, gmi_rtr_item->iov_len);
  1187. return (-1);
  1188. }
  1189. stats_sent += res;
  1190. return (0);
  1191. }
  1192. int last_group_arut = 0;
  1193. int last_released = 0;
  1194. int set_arut = -1;
  1195. /*
  1196. * Brake output multicasts if the missing window is too large
  1197. */
  1198. int gmi_brake;
  1199. static int messages_free (int group_arut)
  1200. {
  1201. struct gmi_rtr_item *gmi_rtr_item_p;
  1202. int i;
  1203. int res;
  1204. int lesser;
  1205. int log_release = 0;
  1206. // 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);
  1207. /*
  1208. * Determine braking value (when messages + MISSING_MCAST_WINDOW, stop sending messages)
  1209. */
  1210. gmi_brake = group_arut;
  1211. if (gmi_brake > last_group_arut) {
  1212. gmi_brake = last_group_arut;
  1213. }
  1214. lesser = gmi_brake;
  1215. //printf ("Freeing lesser %d %d %d\n", lesser, group_arut, last_group_arut);
  1216. //printf ("lesser %d gropu arut %d last group arut %d\n", lesser, group_arut, last_group_arut);
  1217. /*
  1218. * return early if no messages can be freed
  1219. */
  1220. /*
  1221. if (last_released + 1 == lesser) {
  1222. return (0);
  1223. }
  1224. */
  1225. /*
  1226. * Release retransmit list items if group arut indicates they are transmitted
  1227. */
  1228. for (i = last_released; i <= lesser; i++) {
  1229. void *ptr;
  1230. res = sq_item_get (&queue_rtr_items, i, &ptr);
  1231. if (res == 0) {
  1232. gmi_rtr_item_p = ptr;
  1233. release_reftwo_iovec (gmi_rtr_item_p->reftwo,
  1234. gmi_rtr_item_p->iovec,
  1235. gmi_rtr_item_p->iov_len);
  1236. }
  1237. sq_items_release (&queue_rtr_items, i);
  1238. last_released = i + 1;
  1239. log_release = 1;
  1240. }
  1241. if (log_release) {
  1242. gmi_log_printf (gmi_log_level_debug,
  1243. "releasing messages up to and including %d\n", lesser);
  1244. }
  1245. return (0);
  1246. }
  1247. /*
  1248. * Multicasts pending messages onto the ring (requires orf_token possession)
  1249. */
  1250. static int orf_token_mcast (
  1251. struct orf_token *orf_token,
  1252. int fcc_mcasts_allowed,
  1253. struct sockaddr_in *system_from)
  1254. {
  1255. struct msghdr msg_mcast;
  1256. struct gmi_rtr_item gmi_rtr_item;
  1257. struct gmi_pend_trans_item *gmi_pend_trans_item = 0;
  1258. int res = 0;
  1259. int orf_token_seqid;
  1260. struct mcast *mcast;
  1261. int last_packet = 1;
  1262. struct queue *queue_pend_trans;
  1263. /*
  1264. * Disallow multicasts unless state is operational
  1265. */
  1266. if (memb_state != MEMB_STATE_OPERATIONAL) {
  1267. return (0);
  1268. }
  1269. /*
  1270. * If received a token with a higher sequence number,
  1271. * set highest seq so retransmits can happen at end of
  1272. * message stream
  1273. */
  1274. if (orf_token->header.seqid > gmi_highest_seq) {
  1275. gmi_highest_seq = orf_token->header.seqid;
  1276. }
  1277. orf_token_seqid = orf_token->header.seqid;
  1278. queue_pend_trans = &queues_pend_trans[gmi_pend_queue_priority];
  1279. for (fcc_mcast_current = 0; fcc_mcast_current < fcc_mcasts_allowed; fcc_mcast_current++) {
  1280. /*
  1281. * determine which pending queue to take message
  1282. * from if this is not a message fragment
  1283. */
  1284. if (gmi_fragment == 0) {
  1285. gmi_pend_queue_priority = GMI_PRIO_RECOVERY;
  1286. do {
  1287. queue_pend_trans = &queues_pend_trans[gmi_pend_queue_priority];
  1288. if (queue_is_empty (queue_pend_trans)) {
  1289. gmi_pend_queue_priority++;
  1290. } else {
  1291. break; /* from do - found first queue with data */
  1292. }
  1293. } while (gmi_pend_queue_priority < PRIORITY_MAX);
  1294. }
  1295. if (gmi_pend_queue_priority == PRIORITY_MAX) {
  1296. break; /* all queues are empty, break from for */
  1297. }
  1298. if (plug_state != GMI_PLUG_GROUP_UNPLUGGED &&
  1299. gmi_pend_queue_priority != GMI_PRIO_RECOVERY) {
  1300. break; /* group isn't unplugged and this isn't a recovery message */
  1301. }
  1302. // printf ("selecting pending queue %d\n", gmi_pend_queue_priority);
  1303. gmi_pend_trans_item = (struct gmi_pend_trans_item *)queue_item_get (queue_pend_trans);
  1304. /* preincrement required by algo */
  1305. gmi_pend_trans_item->mcast->header.seqid = ++orf_token->header.seqid;
  1306. // UNDO printf ("multicasting seqid %d\n", gmi_pend_trans_item->mcast->header.seqid);
  1307. last_packet = (gmi_pend_trans_item->mcast->packet_number ==
  1308. gmi_pend_trans_item->mcast->packet_count);
  1309. //printf ("last packet is %d current mcast %d\n", last_packet, fcc_mcast_current);
  1310. /*
  1311. * Build IO vector
  1312. */
  1313. memset (&gmi_rtr_item, 0, sizeof (struct gmi_rtr_item));
  1314. gmi_rtr_item.reftwo = gmi_pend_trans_item->reftwo;
  1315. gmi_rtr_item.iovec[0].iov_base = gmi_pend_trans_item->mcast;
  1316. gmi_rtr_item.iovec[0].iov_len = sizeof (struct mcast);
  1317. mcast = gmi_rtr_item.iovec[0].iov_base;
  1318. /*
  1319. * Is this a fragment of a message
  1320. */
  1321. if (mcast->packet_number == mcast->packet_count) {
  1322. gmi_fragment = 0;
  1323. } else {
  1324. gmi_fragment = 1;
  1325. }
  1326. memcpy (&mcast->memb_conf_id, &memb_form_token_conf_id,
  1327. sizeof (struct memb_conf_id));
  1328. memcpy (&gmi_rtr_item.iovec[1], gmi_pend_trans_item->iovec,
  1329. gmi_pend_trans_item->iov_len * sizeof (struct iovec));
  1330. gmi_rtr_item.iov_len = gmi_pend_trans_item->iov_len + 1;
  1331. assert (gmi_rtr_item.iov_len < 16);
  1332. /*
  1333. * Add message to retransmit queue
  1334. */
  1335. sq_item_add (&queue_rtr_items,
  1336. &gmi_rtr_item, gmi_pend_trans_item->mcast->header.seqid);
  1337. /*
  1338. * Delete item from pending queue
  1339. */
  1340. queue_item_remove (queue_pend_trans);
  1341. /*
  1342. * Encrypt and digest the message
  1343. */
  1344. encrypt_and_sign (gmi_rtr_item.iovec, gmi_rtr_item.iov_len);
  1345. /*
  1346. * Build multicast message
  1347. */
  1348. msg_mcast.msg_name = &sockaddr_in_mcast;
  1349. msg_mcast.msg_namelen = sizeof (struct sockaddr_in);
  1350. msg_mcast.msg_iov = &iov_encrypted;
  1351. msg_mcast.msg_iovlen = 1;
  1352. msg_mcast.msg_control = 0;
  1353. msg_mcast.msg_controllen = 0;
  1354. msg_mcast.msg_flags = 0;
  1355. /*
  1356. * Multicast message
  1357. */
  1358. res = sendmsg (gmi_sockets[0].mcast, &msg_mcast, MSG_NOSIGNAL | MSG_DONTWAIT);
  1359. iov_encrypted.iov_len = PACKET_SIZE_MAX;
  1360. /*
  1361. * An error here is recovered by the multicast algorithm
  1362. */
  1363. // TODO stats_sent isn't right below
  1364. stats_sent += res;
  1365. }
  1366. assert (fcc_mcast_current < 100);
  1367. #ifdef OUTA
  1368. if (fcc_mcast_current > fcc_mcasts_allowed) {
  1369. fcc_mcast_current = fcc_mcasts_allowed;
  1370. }
  1371. #endif
  1372. /*
  1373. * If messages mcasted, deliver any new messages to pending queues
  1374. */
  1375. if (fcc_mcast_current) {
  1376. if (gmi_pend_trans_item->mcast->header.seqid > gmi_highest_seq) {
  1377. gmi_highest_seq = gmi_pend_trans_item->mcast->header.seqid;
  1378. }
  1379. pending_queues_deliver ();
  1380. //printf ("orf Token seqid is %d group %d\n", orf_token_seqid, orf_token->group_arut);
  1381. #ifdef COMPILE_OUT
  1382. if (orf_token_seqid == orf_token->group_arut) {
  1383. //printf ("previous group arut #1 %d\n", orf_token->group_arut);
  1384. orf_token->group_arut = orf_token_seqid + fcc_mcast_current;
  1385. orf_token->addr_arut.s_addr = 0;
  1386. }
  1387. //printf ("reasing group arut to %d\n", orf_token->group_arut);
  1388. #endif
  1389. }
  1390. /*
  1391. * Return 1 if more messages are available for single node clusters
  1392. */
  1393. return (fcc_mcast_current == fcc_mcasts_allowed);
  1394. }
  1395. /*
  1396. * Remulticasts messages in orf_token's retransmit list (requires orf_token)
  1397. * Modify's orf_token's rtr to include retransmits required by this process
  1398. */
  1399. static void orf_token_rtr (
  1400. struct orf_token *orf_token,
  1401. struct rtr_item *rtr_list_new,
  1402. int *fcc_allowed)
  1403. {
  1404. int res;
  1405. int i, j;
  1406. int found;
  1407. int index_old = 0;
  1408. int index_new = 0;
  1409. struct rtr_item *rtr_list_old;
  1410. int total_entries;
  1411. rtr_list_old = (struct rtr_item *)(((char *)orf_token) + sizeof (struct orf_token));
  1412. /*
  1413. if (orf_token->rtr_list_entries) {
  1414. printf ("Retransmit List %d\n", orf_token->rtr_list_entries);
  1415. for (i = 0; i < orf_token->rtr_list_entries; i++) {
  1416. printf ("%d ", rtr_list_old[i].seqid);
  1417. }
  1418. printf ("\n");
  1419. }
  1420. */
  1421. total_entries = orf_token->rtr_list_entries;
  1422. /*
  1423. * Retransmit messages on orf_token's RTR list from RTR queue
  1424. */
  1425. for (fcc_remcast_current = 0, index_old = 0;
  1426. fcc_remcast_current <= *fcc_allowed &&
  1427. index_old < total_entries;) {
  1428. assert (index_new < RETRANSMIT_ENTRIES_MAX);
  1429. #ifdef COMPILE_OUT
  1430. printf ("%d.%d.%d vs %d.%d.%d\n",
  1431. rtr_list_old[index_old].conf_id.rep.s_addr,
  1432. rtr_list_old[index_old].conf_id.tv.tv_sec,
  1433. rtr_list_old[index_old].conf_id.tv.tv_usec,
  1434. memb_form_token_conf_id.rep.s_addr,
  1435. memb_form_token_conf_id.tv.tv_sec,
  1436. memb_form_token_conf_id.tv.tv_usec);
  1437. #endif
  1438. /*
  1439. * If this retransmit request isn't from this configuration,
  1440. * try next rtr entry
  1441. */
  1442. if (memcmp (&rtr_list_old[index_old].conf_id, &memb_form_token_conf_id,
  1443. sizeof (struct memb_conf_id)) != 0) {
  1444. /*
  1445. * Copy retransmit request to new retransmit list because its a
  1446. * retransmit request for another configuration
  1447. */
  1448. memcpy (&rtr_list_new[index_new],
  1449. &rtr_list_old[index_old],
  1450. sizeof (struct rtr_item));
  1451. index_old += 1;
  1452. index_new += 1;
  1453. continue;
  1454. }
  1455. assert (rtr_list_old[index_old].seqid > 0);
  1456. res = orf_token_remcast (rtr_list_old[index_old].seqid);
  1457. if (res == 0) {
  1458. /*
  1459. * Multicasted message, so no need to copy to new retransmit list
  1460. */
  1461. orf_token->rtr_list_entries -= 1;
  1462. assert (orf_token->rtr_list_entries >= 0);
  1463. index_old += 1;
  1464. fcc_remcast_current++;
  1465. stats_remcasts++;
  1466. } else {
  1467. /*
  1468. * Couldn't remulticast, so copy request to new retransmit list
  1469. */
  1470. memcpy (&rtr_list_new[index_new],
  1471. &rtr_list_old[index_old],
  1472. sizeof (struct rtr_item));
  1473. index_old += 1;
  1474. index_new += 1;
  1475. }
  1476. }
  1477. *fcc_allowed = *fcc_allowed - fcc_remcast_current - 1;
  1478. /*
  1479. * Copy unsent requests because flow control limit was reached
  1480. */
  1481. if (orf_token->rtr_list_entries - index_new) {
  1482. memcpy (&rtr_list_new[index_new],
  1483. &rtr_list_old[index_old],
  1484. sizeof (struct rtr_item) * (orf_token->rtr_list_entries - index_new));
  1485. index_new += orf_token->rtr_list_entries - index_new;
  1486. }
  1487. #ifdef COMPILE_OUT
  1488. for (i = 0; i < orf_token->rtr_list_entries; i++) {
  1489. assert (rtr_list_old[index_old].seqid != -1);
  1490. }
  1491. #endif
  1492. /*
  1493. * Add messages to retransmit to RTR list
  1494. * but only retry if there is room in the retransmit list
  1495. */
  1496. for (i = gmi_arut + 1;
  1497. orf_token->rtr_list_entries < RETRANSMIT_ENTRIES_MAX &&
  1498. i <= gmi_highest_seq;
  1499. i++) {
  1500. /*
  1501. * Find if a message is missing from this processor
  1502. */
  1503. res = sq_item_inuse (&queue_rtr_items, i);
  1504. if (res == 0) {
  1505. /*
  1506. * Determine if missing message is already in retransmit list
  1507. */
  1508. found = 0;
  1509. for (j = 0; j < orf_token->rtr_list_entries; j++) {
  1510. if (i == rtr_list_new[j].seqid) {
  1511. found = 1;
  1512. }
  1513. }
  1514. if (found == 0) {
  1515. /*
  1516. * Missing message not found in current retransmit list so add it
  1517. */
  1518. memcpy (&rtr_list_new[orf_token->rtr_list_entries].conf_id,
  1519. &memb_form_token_conf_id, sizeof (struct memb_conf_id));
  1520. rtr_list_new[orf_token->rtr_list_entries].seqid = i;
  1521. orf_token->rtr_list_entries++;
  1522. }
  1523. }
  1524. }
  1525. }
  1526. static void orf_token_plug_calculate (
  1527. struct orf_token *orf_token,
  1528. unsigned char *plug_bitmap_new)
  1529. {
  1530. unsigned char *plug_bitmap_old;
  1531. int bitmap_reps;
  1532. int i;
  1533. int set_unplugged = 1;
  1534. /*
  1535. * If the group is already unplugged, do nothing
  1536. */
  1537. if (plug_state == GMI_PLUG_GROUP_UNPLUGGED) {
  1538. return;
  1539. }
  1540. plug_bitmap_old = (((char *)orf_token) +
  1541. sizeof (struct orf_token) +
  1542. (sizeof (struct rtr_item) * orf_token->rtr_list_entries));
  1543. memcpy (plug_bitmap_new, plug_bitmap_old, orf_token->bitmap_bytes);
  1544. /*
  1545. * Unplug this processor if an unplug request is pending and
  1546. * no further messages are pending in the pending queue
  1547. */
  1548. if (queue_is_empty (&queues_pend_trans[GMI_PRIO_RECOVERY]) &&
  1549. plug_state == GMI_PLUG_PROCESSOR_REQUEST_UNPLUG) {
  1550. plug_state = GMI_PLUG_PROCESSOR_UNPLUGGED;
  1551. for (i = 0; i < memb_list_entries; i++) {
  1552. if (memb_list[i].sin_addr.s_addr == memb_local_sockaddr_in.sin_addr.s_addr) {
  1553. plug_bitmap_new[i / 8] |= 1 << (i % 8);
  1554. break;
  1555. }
  1556. }
  1557. }
  1558. /*
  1559. * Determine if group is unplugged
  1560. */
  1561. if (plug_state == GMI_PLUG_PROCESSOR_UNPLUGGED) {
  1562. bitmap_reps = (1 << (memb_list_entries % 8)) - 1;
  1563. if ((bitmap_reps & plug_bitmap_new[memb_list_entries / 8]) == bitmap_reps) {
  1564. /*
  1565. * If bits 0..(1<<memb_list_entries/8) not set, don't unplug
  1566. */
  1567. for (i = 0; i < (memb_list_entries / 8); i++) {
  1568. if (plug_bitmap_new[i] != 0xff) {
  1569. set_unplugged = 0;
  1570. break;
  1571. }
  1572. }
  1573. if (set_unplugged) {
  1574. plug_state = GMI_PLUG_GROUP_UNPLUGGED;
  1575. gmi_log_printf (gmi_log_level_notice, "All processors unplugged, allowing messages to be transmitted.\n");
  1576. }
  1577. }
  1578. }
  1579. }
  1580. /*
  1581. * Calculate flow control count
  1582. */
  1583. static void orf_token_fcc (
  1584. struct orf_token *orf_token)
  1585. {
  1586. orf_token->fcc = orf_token->fcc - fcc_mcast_last - fcc_remcast_last
  1587. + fcc_mcast_current + fcc_remcast_current;
  1588. //printf ("orf token fcc is %d %d %d %d %d\n", orf_token->fcc, fcc_mcast_last,
  1589. // fcc_remcast_last, fcc_mcast_current, fcc_remcast_current);
  1590. fcc_mcast_last = fcc_mcast_current;
  1591. fcc_remcast_last = fcc_remcast_current;
  1592. fcc_mcast_current = 0;
  1593. fcc_remcast_current = 0;
  1594. }
  1595. static void queues_queue_frag_memb_new (void)
  1596. {
  1597. struct queue_frag queues_frag_new[MAX_MEMBERS];
  1598. int item_index = 0;
  1599. int i, j;
  1600. int found;
  1601. memset (queues_frag_new, 0, sizeof (struct queue_frag) * MAX_MEMBERS);
  1602. /*
  1603. * Free queues that are no longer part of the configuration
  1604. */
  1605. for (i = 0; i < MAX_MEMBERS; i++) {
  1606. found = 0;
  1607. for (j = 0; j < memb_list_entries_confchg; j++) {
  1608. if (memb_list[j].sin_addr.s_addr == queues_frag[i].source_addr.s_addr) {
  1609. found = 1;
  1610. break;
  1611. }
  1612. }
  1613. if (found == 0) {
  1614. queue_free (&queues_frag[i].assembly.queue);
  1615. queue_free (&queues_frag[i].pend_queue);
  1616. }
  1617. }
  1618. /*
  1619. * Build new pending list
  1620. */
  1621. for (i = 0; i < memb_list_entries_confchg; i++) {
  1622. found = 0;
  1623. for (j = 0; j < MAX_MEMBERS; j++) {
  1624. /*
  1625. * If membership item in queues pending delivery list, copy it
  1626. */
  1627. if (memb_list[i].sin_addr.s_addr == queues_frag[j].source_addr.s_addr) {
  1628. memcpy (&queues_frag_new[item_index], &queues_frag[j],
  1629. sizeof (struct queue_frag));
  1630. item_index += 1;
  1631. found = 1;
  1632. break; /* for j = */
  1633. }
  1634. }
  1635. /*
  1636. * If membership item not found in pending delivery list, make new entry
  1637. */
  1638. if (found == 0) {
  1639. queue_init (&queues_frag_new[item_index].assembly.queue,
  1640. QUEUE_ASSEMBLY_SIZE_MAX,
  1641. sizeof (struct assembly_queue_item));
  1642. queue_init (&queues_frag_new[item_index].pend_queue,
  1643. QUEUE_PEND_SIZE_MAX, sizeof (struct pend_queue_item));
  1644. queues_frag_new[item_index].assembly.seqid = 0;
  1645. queues_frag_new[item_index].source_addr.s_addr =
  1646. memb_list[i].sin_addr.s_addr;
  1647. printf ("New queue for ip %s\n", inet_ntoa (queues_frag_new[item_index].source_addr));
  1648. item_index += 1;
  1649. }
  1650. }
  1651. /*
  1652. * Copy new list into system list
  1653. */
  1654. memcpy (queues_frag, queues_frag_new,
  1655. sizeof (struct queue_frag) * MAX_MEMBERS);
  1656. for (i = 0; i < memb_list_entries_confchg; i++) {
  1657. queues_frag[i].seqid = 0;
  1658. queues_frag[i].assembly.seqid = 0;
  1659. }
  1660. #ifdef TODO
  1661. for (i = 0; i < memb_list_entries_confchg; i++) {
  1662. /*
  1663. * If queue not empty, mark it for first delivery
  1664. * otherwise reset seqno
  1665. */
  1666. if (queue_is_empty (&queues_pend_delv[i].queue) == 0) {
  1667. queues_pend_delv[i].first_delivery = 1;
  1668. } else {
  1669. queues_pend_delv[i].seqid = 0;
  1670. }
  1671. }
  1672. #endif
  1673. }
  1674. static int orf_token_evs (
  1675. struct orf_token *orf_token,
  1676. int starting_group_arut)
  1677. {
  1678. int i, j;
  1679. struct sockaddr_in trans_memb_list[MAX_MEMBERS];
  1680. struct sockaddr_in left_list[MAX_MEMBERS];
  1681. struct sockaddr_in joined_list[MAX_MEMBERS];
  1682. int trans_memb_list_entries = 0;
  1683. int left_list_entries = 0;
  1684. int joined_list_entries = 0;
  1685. int found;
  1686. //printf ("group arut is %d %d %d %d\n", orf_token->header.seqid, orf_token->group_arut, gmi_arut, gmi_highest_seq);
  1687. /*
  1688. * We should only execute this function if we are in EVS membership state
  1689. */
  1690. if (memb_state != MEMB_STATE_EVS) {
  1691. return (0);
  1692. }
  1693. memset (trans_memb_list, 0, sizeof (struct sockaddr_in) * MAX_MEMBERS);
  1694. /*
  1695. * Delete form token timer since the token has been swallowed
  1696. */
  1697. poll_timer_delete (*gmi_poll_handle, timer_form_token_timeout);
  1698. timer_form_token_timeout = 0;
  1699. 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);
  1700. /*
  1701. * This node has reached highest seq, set local arut to barrier
  1702. */
  1703. if (gmi_arut == gmi_highest_seq) {
  1704. //printf ("setting arut to barrier %d\n", gmi_barrier_seq);
  1705. gmi_arut = gmi_barrier_seq;
  1706. }
  1707. /*
  1708. * Determine when EVS recovery has completed
  1709. */
  1710. //printf ("group arut is %d %d %d\n", orf_token->group_arut, gmi_arut, gmi_highest_seq);
  1711. // TODO
  1712. if (memb_state == MEMB_STATE_EVS && gmi_arut == gmi_barrier_seq && orf_token->group_arut == gmi_barrier_seq) {
  1713. gmi_log_printf (gmi_log_level_notice, "EVS recovery of messages complete, transitioning to operational.\n");
  1714. messages_free (gmi_barrier_seq - 1);
  1715. /*
  1716. * EVS recovery complete, reset local variables
  1717. */
  1718. gmi_arut = 0;
  1719. // gmi_token_seqid = 0;
  1720. gmi_highest_seq_old = gmi_highest_seq;
  1721. gmi_highest_seq = 0;
  1722. last_group_arut = 0;
  1723. last_released = 0;
  1724. sq_reinit (&queue_rtr_items, 0);
  1725. memb_failed_list_entries = 0;
  1726. memb_state = MEMB_STATE_OPERATIONAL;
  1727. qsort (memb_form_token.member_list, memb_form_token.member_list_entries,
  1728. sizeof (struct in_addr), in_addr_compare);
  1729. printf ("CONFCHG ENTRIES %d\n", memb_list_entries_confchg);
  1730. /*
  1731. * Determine transitional configuration
  1732. */
  1733. for (i = 0; i < memb_list_entries_confchg; i++) {
  1734. for (found = 0, j = 0; j < memb_form_token.member_list_entries; j++) {
  1735. if (memb_list[i].sin_addr.s_addr == memb_form_token.member_list[j].s_addr) {
  1736. found = 1;
  1737. break;
  1738. }
  1739. }
  1740. if (found == 1) {
  1741. trans_memb_list[trans_memb_list_entries].sin_addr.s_addr = memb_list[i].sin_addr.s_addr;
  1742. trans_memb_list[trans_memb_list_entries].sin_family = AF_INET;
  1743. trans_memb_list[trans_memb_list_entries].sin_port = sockaddr_in_mcast.sin_port;
  1744. trans_memb_list_entries += 1;
  1745. }
  1746. }
  1747. /*
  1748. * Determine nodes that left the configuration
  1749. */
  1750. for (i = 0; i < memb_list_entries_confchg; i++) {
  1751. for (found = 0, j = 0; j < memb_form_token.member_list_entries; j++) {
  1752. if (memb_list[i].sin_addr.s_addr == memb_form_token.member_list[j].s_addr) {
  1753. found = 1;
  1754. break; /* for j = 0 */
  1755. }
  1756. }
  1757. /*
  1758. * Node left membership, add it to list
  1759. */
  1760. if (found == 0) {
  1761. left_list[left_list_entries].sin_addr.s_addr = memb_list[i].sin_addr.s_addr;
  1762. left_list[left_list_entries].sin_family = AF_INET;
  1763. left_list[left_list_entries].sin_port = sockaddr_in_mcast.sin_port;
  1764. left_list_entries += 1;
  1765. }
  1766. }
  1767. /*
  1768. * Disallow all but RECOVERY priority messages
  1769. */
  1770. printf ("calling recovery\n");
  1771. recovery_plug_set ();
  1772. /*
  1773. * MAIN STEP:
  1774. * Deliver transitional configuration
  1775. */
  1776. if (gmi_confchg_fn &&
  1777. (trans_memb_list_entries != memb_list_entries ||
  1778. (memcmp (trans_memb_list, memb_list, sizeof (struct sockaddr_in) * memb_list_entries) != 0))) {
  1779. gmi_confchg_fn (GMI_CONFIGURATION_TRANSITIONAL, trans_memb_list, trans_memb_list_entries,
  1780. left_list, left_list_entries,
  1781. 0, 0);
  1782. }
  1783. /*
  1784. * Determine nodes that joined the configuration
  1785. */
  1786. for (i = 0; i < memb_form_token.member_list_entries; i++) {
  1787. for (found = 0, j = 0; j < memb_list_entries_confchg; j++) {
  1788. if (memb_form_token.member_list[i].s_addr == memb_list[j].sin_addr.s_addr) {
  1789. found = 1;
  1790. break; /* for j = 0 */
  1791. }
  1792. }
  1793. /*
  1794. * Node joined membership, add it to list
  1795. */
  1796. if (found == 0) {
  1797. joined_list[joined_list_entries].sin_addr.s_addr = memb_form_token.member_list[i].s_addr;
  1798. joined_list[joined_list_entries].sin_family = AF_INET;
  1799. joined_list[joined_list_entries].sin_port = sockaddr_in_mcast.sin_port;
  1800. joined_list_entries += 1;
  1801. }
  1802. }
  1803. /*
  1804. * Install the form token's configuration into the local membership
  1805. */
  1806. for (i = 0; i < memb_form_token.member_list_entries; i++) {
  1807. memb_list[i].sin_addr.s_addr = memb_form_token.member_list[i].s_addr;
  1808. memb_list[i].sin_family = AF_INET;
  1809. memb_list[i].sin_port = sockaddr_in_mcast.sin_port;
  1810. }
  1811. /*
  1812. * Install pending delivery queues
  1813. */
  1814. memb_list_entries = memb_form_token.member_list_entries;
  1815. memb_list_entries_confchg = memb_list_entries;
  1816. queues_queue_frag_memb_new ();
  1817. /*
  1818. * Install new conf id
  1819. */
  1820. memcpy (&memb_conf_id, &memb_form_token.conf_id,
  1821. sizeof (struct memb_conf_id));
  1822. memcpy (&memb_form_token_conf_id, &memb_form_token.conf_id,
  1823. sizeof (struct memb_conf_id));
  1824. /*
  1825. * Deliver regular configuration
  1826. */
  1827. if (gmi_confchg_fn) {
  1828. gmi_confchg_fn (GMI_CONFIGURATION_REGULAR, memb_list, memb_list_entries,
  1829. left_list, 0,
  1830. joined_list, joined_list_entries);
  1831. }
  1832. }
  1833. return (0);
  1834. }
  1835. int gwin = 80;
  1836. int pwin = 20;
  1837. static int orf_fcc_allowed (struct orf_token *token)
  1838. {
  1839. int allowed;
  1840. if (memb_state != MEMB_STATE_OPERATIONAL) {
  1841. return (0);
  1842. }
  1843. allowed = gwin + pwin - token->fcc;
  1844. if (allowed < 0) {
  1845. allowed = 0;
  1846. }
  1847. if (allowed > gwin) {
  1848. allowed = gwin;
  1849. }
  1850. if (allowed > pwin) {
  1851. allowed = pwin;
  1852. }
  1853. return (allowed);
  1854. }
  1855. /*
  1856. * Retransmit the regular token if no mcast or token has
  1857. * been received in retransmit token period retransmit
  1858. * the token to the next processor
  1859. */
  1860. void timer_function_token_retransmit_timeout (void *data)
  1861. {
  1862. struct iovec iovec;
  1863. struct msghdr msg_orf_token;
  1864. int res;
  1865. gmi_log_printf (gmi_log_level_warning, "Token being retransmitted.\n");
  1866. iovec.iov_base = orf_token_retransmit;
  1867. iovec.iov_len = orf_token_retransmit_size;
  1868. msg_orf_token.msg_name = (caddr_t)&memb_next;
  1869. msg_orf_token.msg_namelen = sizeof (struct sockaddr_in);
  1870. msg_orf_token.msg_iov = &iovec;
  1871. msg_orf_token.msg_iovlen = 1;
  1872. msg_orf_token.msg_control = 0;
  1873. msg_orf_token.msg_controllen = 0;
  1874. msg_orf_token.msg_flags = 0;
  1875. res = sendmsg (gmi_sockets[0].token, &msg_orf_token, MSG_NOSIGNAL);
  1876. assert (res != -1);
  1877. }
  1878. void timer_function_form_token_timeout (void *data)
  1879. {
  1880. gmi_log_printf (gmi_log_level_warning, "Token loss in FORM state\n");
  1881. memb_list_entries = 1;
  1882. /*
  1883. * Add highest rep to failed list to ensure termination
  1884. */
  1885. memb_failed_list[memb_failed_list_entries++].s_addr =
  1886. memb_form_token.rep_list[memb_form_token.rep_list_entries].s_addr;
  1887. memb_state_gather_enter ();
  1888. }
  1889. void orf_timer_function_token_timeout (void *data)
  1890. {
  1891. switch (memb_state) {
  1892. case MEMB_STATE_OPERATIONAL:
  1893. gmi_log_printf (gmi_log_level_warning, "Token loss in OPERATIONAL.\n");
  1894. memb_conf_id.rep.s_addr = memb_local_sockaddr_in.sin_addr.s_addr;
  1895. memb_list_entries = 1;
  1896. memb_state_gather_enter ();
  1897. break;
  1898. case MEMB_STATE_GATHER:
  1899. case MEMB_STATE_COMMIT:
  1900. gmi_log_printf (gmi_log_level_warning, "Token loss in GATHER or COMMIT.\n");
  1901. memb_conf_id.rep.s_addr = memb_local_sockaddr_in.sin_addr.s_addr;
  1902. memb_list_entries = 1;
  1903. break;
  1904. case MEMB_STATE_EVS:
  1905. gmi_log_printf (gmi_log_level_warning, "Token loss in EVS state\n");
  1906. memb_list_entries = 1;
  1907. memb_state_gather_enter ();
  1908. break;
  1909. default:
  1910. printf ("token loss in form state doesn't make sense here\n");
  1911. break;
  1912. }
  1913. }
  1914. /*
  1915. * Send orf_token to next member (requires orf_token)
  1916. */
  1917. static int orf_token_send (
  1918. struct orf_token *orf_token,
  1919. struct rtr_item *rtr_list,
  1920. unsigned char *plug_bitmap,
  1921. int reset_timer)
  1922. {
  1923. struct msghdr msg_orf_token;
  1924. struct iovec iovec_orf_token[3];
  1925. int iov_len;
  1926. int res;
  1927. if (reset_timer) {
  1928. poll_timer_delete (*gmi_poll_handle, timer_orf_token_timeout);
  1929. poll_timer_add (*gmi_poll_handle, TIMEOUT_TOKEN, 0,
  1930. orf_timer_function_token_timeout, &timer_orf_token_timeout);
  1931. }
  1932. iovec_orf_token[0].iov_base = (char *)orf_token;
  1933. iovec_orf_token[0].iov_len = sizeof (struct orf_token);
  1934. iovec_orf_token[1].iov_base = (char *)rtr_list;
  1935. iovec_orf_token[1].iov_len = sizeof (struct rtr_item) * orf_token->rtr_list_entries;
  1936. iov_len = 2;
  1937. if (plug_bitmap) {
  1938. iovec_orf_token[2].iov_base = (char *)plug_bitmap;
  1939. iovec_orf_token[2].iov_len = sizeof (unsigned char) * (MAX_MEMBERS / 8);
  1940. iov_len = 3;
  1941. }
  1942. encrypt_and_sign (iovec_orf_token, iov_len);
  1943. /*
  1944. * Keep an encrypted copy in case the token retransmit timer expires
  1945. */
  1946. memcpy (orf_token_retransmit, iov_encrypted.iov_base, iov_encrypted.iov_len);
  1947. orf_token_retransmit_size = iov_encrypted.iov_len;
  1948. /*
  1949. * Send the message
  1950. */
  1951. msg_orf_token.msg_name = (caddr_t)&memb_next;
  1952. msg_orf_token.msg_namelen = sizeof (struct sockaddr_in);
  1953. msg_orf_token.msg_iov = &iov_encrypted;
  1954. msg_orf_token.msg_iovlen = 1;
  1955. msg_orf_token.msg_control = 0;
  1956. msg_orf_token.msg_controllen = 0;
  1957. msg_orf_token.msg_flags = 0;
  1958. // THIS IS FOR TESTING ERRORS IN THE EVS STATE
  1959. //if ((memb_state == MEMB_STATE_EVS) && ((random () % 3) == 0)) {
  1960. //gmi_log_printf (gmi_log_level_debug, "CAUSING TOKEN LOSS AT EVS STATE\n");
  1961. // return (1);
  1962. //}
  1963. res = sendmsg (gmi_sockets[0].token, &msg_orf_token, MSG_NOSIGNAL);
  1964. assert (res != -1);
  1965. /*
  1966. * res not used here errors are handled by algorithm
  1967. */
  1968. // TODO do we need a test here of some sort
  1969. gmi_last_seqid = orf_token->header.seqid;
  1970. stats_sent += res;
  1971. return (res);
  1972. }
  1973. int orf_token_send_initial (void)
  1974. {
  1975. struct orf_token orf_token;
  1976. int res;
  1977. unsigned char bitmap[MAX_MEMBERS / 8];
  1978. orf_token.header.seqid = 0;
  1979. orf_token.header.type = MESSAGE_TYPE_ORF_TOKEN;
  1980. orf_token.token_seqid = 0;
  1981. orf_token.group_arut = gmi_highest_seq;
  1982. orf_token.addr_arut.s_addr = gmi_bound_to.sin_addr.s_addr;
  1983. orf_token.bitmap_bytes = MAX_MEMBERS / 8;
  1984. orf_token.fcc = 0;
  1985. memset (bitmap, 0, sizeof (bitmap));
  1986. orf_token.rtr_list_entries = 0;
  1987. res = orf_token_send (&orf_token, 0, bitmap, 1);
  1988. return (res);
  1989. }
  1990. /*
  1991. * Membership Management
  1992. */
  1993. static int memb_join_send (void)
  1994. {
  1995. struct msghdr msghdr_join;
  1996. struct iovec iovec_join;
  1997. int res;
  1998. memb_join.header.seqid = 0;
  1999. memb_join.header.type = MESSAGE_TYPE_MEMB_JOIN;
  2000. /*
  2001. * copy current gather list to representatives list
  2002. */
  2003. if ((memb_gather_set_entries == memb_join.active_rep_list_entries) &&
  2004. (memcmp (memb_join.active_rep_list, memb_gather_set,
  2005. sizeof (struct in_addr) * memb_gather_set_entries) == 0) &&
  2006. (memb_failed_list_entries == memb_join.failed_rep_list_entries) &&
  2007. (memcmp (memb_join.failed_rep_list, memb_failed_list,
  2008. sizeof (struct in_addr) * memb_failed_list_entries) == 0)) {
  2009. return (0);
  2010. }
  2011. /*
  2012. * Copy active reps
  2013. */
  2014. memcpy (memb_join.active_rep_list, memb_gather_set,
  2015. sizeof (struct in_addr) * memb_gather_set_entries);
  2016. memb_join.active_rep_list_entries = memb_gather_set_entries;
  2017. /*
  2018. * Copy failed reps
  2019. */
  2020. memcpy (memb_join.failed_rep_list, memb_failed_list,
  2021. sizeof (struct in_addr) * memb_failed_list_entries);
  2022. memb_join.failed_rep_list_entries = memb_failed_list_entries;
  2023. iovec_join.iov_base = (char *)&memb_join;
  2024. iovec_join.iov_len = sizeof (struct memb_join);
  2025. encrypt_and_sign (&iovec_join, 1);
  2026. msghdr_join.msg_name = (caddr_t)&sockaddr_in_mcast;
  2027. msghdr_join.msg_namelen = sizeof (struct sockaddr_in);
  2028. msghdr_join.msg_iov = &iov_encrypted;
  2029. msghdr_join.msg_iovlen = 1;
  2030. msghdr_join.msg_control = 0;
  2031. msghdr_join.msg_controllen = 0;
  2032. msghdr_join.msg_flags = 0;
  2033. res = sendmsg (gmi_sockets[0].mcast, &msghdr_join, MSG_NOSIGNAL | MSG_DONTWAIT);
  2034. return (res);
  2035. }
  2036. static int memb_state_commit_enter (void);
  2037. /*
  2038. * Update gather_set[0].join_reps with list of failed members
  2039. */
  2040. void memb_gather_set_update_failed (struct in_addr *list, int list_entries)
  2041. {
  2042. int i;
  2043. int j;
  2044. /*
  2045. * Remove failed members from gather set
  2046. */
  2047. for (i = 0; i < list_entries; i++) {
  2048. for (j = 0; j < memb_gather_set_entries; j++) {
  2049. if (list[i].s_addr == memb_gather_set[j].s_addr) {
  2050. memb_gather_set_entries -= 1;
  2051. memcpy (&memb_gather_set[j],
  2052. &memb_gather_set[j + 1],
  2053. memb_gather_set_entries * sizeof (struct in_addr));
  2054. break; /* for j = 0 */
  2055. }
  2056. }
  2057. }
  2058. }
  2059. static void memb_timer_function_state_commit_timeout (void *data)
  2060. {
  2061. int i;
  2062. int j;
  2063. int k;
  2064. int found;
  2065. int add_to_failed = 1;
  2066. struct sockaddr_in left_list[MAX_MEMBERS];
  2067. int left_list_entries = 0;
  2068. memb_failed_list_entries = 0;
  2069. /*
  2070. * No entries responded in commit timeout period
  2071. */
  2072. if (memb_commit_set_entries == 0) {
  2073. /*
  2074. * memb_list_entries only set to 0 when token times out, in which case
  2075. * send a configuration change because no messages can be recovered in EVS
  2076. */
  2077. if (memb_list_entries == 1) {
  2078. gmi_log_printf (gmi_log_level_notice, "I am the only member.\n");
  2079. /*
  2080. * Disallow all but RECOVERY priority messages
  2081. */
  2082. recovery_plug_set ();
  2083. if (gmi_confchg_fn) {
  2084. /*
  2085. * Determine nodes that left the configuration
  2086. */
  2087. for (i = 0; i < memb_list_entries_confchg; i++) {
  2088. if (memb_local_sockaddr_in.sin_addr.s_addr != memb_list[i].sin_addr.s_addr) {
  2089. left_list[left_list_entries].sin_addr.s_addr = memb_list[i].sin_addr.s_addr;
  2090. left_list[left_list_entries].sin_family = AF_INET;
  2091. left_list[left_list_entries].sin_port = sockaddr_in_mcast.sin_port;
  2092. left_list_entries += 1;
  2093. }
  2094. }
  2095. gmi_confchg_fn (GMI_CONFIGURATION_TRANSITIONAL,
  2096. &memb_local_sockaddr_in, 1,
  2097. left_list, left_list_entries,
  2098. 0, 0);
  2099. gmi_confchg_fn (GMI_CONFIGURATION_REGULAR,
  2100. &memb_local_sockaddr_in, 1,
  2101. 0, 0,
  2102. 0, 0);
  2103. memb_list_entries_confchg = 1;
  2104. memb_list[0].sin_addr.s_addr = memb_local_sockaddr_in.sin_addr.s_addr;
  2105. }
  2106. queues_queue_frag_memb_new ();
  2107. poll_timer_delete (*gmi_poll_handle, timer_single_member);
  2108. timer_single_member = 0;
  2109. poll_timer_add (*gmi_poll_handle, 0, 0,
  2110. timer_function_single_member, &timer_single_member);
  2111. } else {
  2112. gmi_log_printf (gmi_log_level_notice, "No members sent join, keeping old ring and transitioning to operational.\n");
  2113. }
  2114. memb_state = MEMB_STATE_OPERATIONAL;
  2115. return;
  2116. }
  2117. /*
  2118. * Find all failed members
  2119. */
  2120. for (i = 0; i < memb_gather_set_entries; i++) {
  2121. add_to_failed = 1;
  2122. for (j = 0; j < memb_commit_set_entries; j++) {
  2123. /*
  2124. * If gather entry not in commit rep list, add to failed
  2125. */
  2126. if (memb_gather_set[i].s_addr == memb_commit_set[j].rep.sin_addr.s_addr) {
  2127. add_to_failed = 0;
  2128. break; /* for found = 0 */
  2129. }
  2130. }
  2131. /*
  2132. * If gather entry not in commit set, add to failed set
  2133. */
  2134. for (found = 0, j = 0; j < memb_commit_set_entries; j++) {
  2135. for (k = 0; k < memb_commit_set[j].join_rep_list_entries; k++) {
  2136. if (memb_gather_set[i].s_addr == memb_commit_set[j].join_rep_list[k].s_addr) {
  2137. found = 1;
  2138. break;
  2139. }
  2140. }
  2141. if (found == 0) {
  2142. add_to_failed = 1;
  2143. break;
  2144. }
  2145. }
  2146. /*
  2147. * If local address, item found
  2148. */
  2149. if (memb_gather_set[i].s_addr == memb_local_sockaddr_in.sin_addr.s_addr) {
  2150. add_to_failed = 0;
  2151. }
  2152. if (add_to_failed == 1) {
  2153. memb_failed_list[memb_failed_list_entries++].s_addr =
  2154. memb_gather_set[i].s_addr;
  2155. }
  2156. }
  2157. memb_gather_set_update_failed (memb_failed_list, memb_failed_list_entries);
  2158. memb_state_commit_enter ();
  2159. }
  2160. static int memb_state_commit_enter (void)
  2161. {
  2162. int res;
  2163. memb_state = MEMB_STATE_COMMIT;
  2164. memb_commit_set_entries = 0;
  2165. res = memb_join_send();
  2166. poll_timer_delete (*gmi_poll_handle, timer_memb_state_gather_timeout);
  2167. timer_memb_state_gather_timeout = 0;
  2168. poll_timer_add (*gmi_poll_handle, TIMEOUT_STATE_COMMIT, 0,
  2169. memb_timer_function_state_commit_timeout, &timer_memb_state_commit_timeout);
  2170. return (res);
  2171. }
  2172. static void memb_timer_function_state_gather (void *data)
  2173. {
  2174. int i;
  2175. /*
  2176. * GATHER period expired, sort gather sets and send JOIN
  2177. */
  2178. memb_state_commit_enter ();
  2179. gmi_log_printf (gmi_log_level_debug, "GATHER timeout:\n");
  2180. for (i = 0; i < memb_gather_set_entries; i++) {
  2181. gmi_log_printf (gmi_log_level_debug, "host %d attempted to join %s\n", i, inet_ntoa (memb_gather_set[i]));
  2182. }
  2183. }
  2184. static void memb_print_commit_set (void)
  2185. {
  2186. int i, j;
  2187. gmi_log_printf (gmi_log_level_debug, "Gather list\n");
  2188. for (i = 0; i < memb_gather_set_entries; i++) {
  2189. gmi_log_printf (gmi_log_level_debug, "\tmember %d %s\n", i, inet_ntoa (memb_gather_set[i]));
  2190. }
  2191. for (i = 0; i < memb_commit_set_entries; i++) {
  2192. gmi_log_printf (gmi_log_level_debug, "Join from rep %d %s\n", i, inet_ntoa (memb_commit_set[i].rep.sin_addr));
  2193. for (j = 0; j < memb_commit_set[i].join_rep_list_entries; j++) {
  2194. gmi_log_printf (gmi_log_level_debug, "\tmember %d %s\n", j, inet_ntoa (memb_commit_set[i].join_rep_list[j]));
  2195. }
  2196. }
  2197. }
  2198. /*
  2199. * Determine if the commit phase has reached consensus
  2200. */
  2201. static int memb_state_consensus_commit (void)
  2202. {
  2203. int found;
  2204. int res;
  2205. int i, j;
  2206. /*
  2207. * Determine consensus
  2208. */
  2209. /*
  2210. * If all commit sets don't match gather set, no consensus
  2211. */
  2212. for (i = 0; i < memb_commit_set_entries; i++) {
  2213. /*
  2214. * If not same number of entries, no consensus
  2215. */
  2216. res = memb_gather_set_entries - memb_commit_set[i].join_rep_list_entries;
  2217. if (res != 0) {
  2218. return (0); /* no consensus */
  2219. }
  2220. /*
  2221. * If entries dont match, no consensus
  2222. */
  2223. res = memcmp (memb_gather_set, memb_commit_set[i].join_rep_list,
  2224. memb_gather_set_entries * sizeof (struct in_addr));
  2225. if (res != 0) {
  2226. return (0); /* no consensus */
  2227. }
  2228. }
  2229. /*
  2230. * If all reps from gather set represented in commit set, consensus
  2231. */
  2232. for (i = 0; i < memb_gather_set_entries; i++) {
  2233. found = 0;
  2234. for (j = 0; j < memb_commit_set_entries; j++) {
  2235. if (memb_gather_set[i].s_addr == memb_local_sockaddr_in.sin_addr.s_addr) {
  2236. found = 1;
  2237. break;
  2238. }
  2239. if (memb_gather_set[i].s_addr == memb_commit_set[j].rep.sin_addr.s_addr) {
  2240. found = 1;
  2241. break;
  2242. }
  2243. }
  2244. if (found == 0) {
  2245. return (0); /* no consensus, rep not found from gather set */
  2246. }
  2247. }
  2248. return (1); /* got consensus! */
  2249. }
  2250. /*
  2251. * Union commit_set_entry into gather set
  2252. */
  2253. static void memb_state_commit_union (int commit_set_entry)
  2254. {
  2255. int found;
  2256. int i, j;
  2257. for (i = 0; i < memb_commit_set[commit_set_entry].join_rep_list_entries; i++) {
  2258. for (found = 0, j = 0; j < memb_gather_set_entries; j++) {
  2259. if (memb_commit_set[commit_set_entry].join_rep_list[i].s_addr ==
  2260. memb_gather_set[j].s_addr) {
  2261. found = 1;
  2262. break;
  2263. }
  2264. }
  2265. if (found == 0) {
  2266. memb_gather_set[memb_gather_set_entries++].s_addr =
  2267. memb_commit_set[commit_set_entry].join_rep_list[i].s_addr;
  2268. /*
  2269. * Sort gather set
  2270. */
  2271. qsort (memb_gather_set, memb_gather_set_entries,
  2272. sizeof (struct in_addr), in_addr_compare);
  2273. }
  2274. }
  2275. }
  2276. static void memb_conf_id_build (
  2277. struct memb_conf_id *memb_conf_id,
  2278. struct in_addr memb_local_rep)
  2279. {
  2280. gettimeofday (&memb_conf_id->tv, NULL);
  2281. memb_conf_id->rep.s_addr = memb_local_rep.s_addr;
  2282. }
  2283. static void memb_form_token_update_highest_seq (
  2284. struct memb_form_token *form_token)
  2285. {
  2286. struct conf_desc *conf_desc;
  2287. int entry;
  2288. int found = 0;
  2289. for (entry = 0; entry < form_token->conf_desc_list_entries; entry++) {
  2290. if (memcmp (&form_token->conf_desc_list[entry].conf_id,
  2291. &memb_form_token_conf_id, sizeof (struct memb_conf_id)) == 0) {
  2292. found = 1;
  2293. break;
  2294. }
  2295. }
  2296. conf_desc = &form_token->conf_desc_list[entry];
  2297. if (found && gmi_highest_seq < conf_desc->highest_seq) {
  2298. gmi_highest_seq = conf_desc->highest_seq;
  2299. }
  2300. }
  2301. static void memb_form_token_conf_desc_build (
  2302. struct memb_form_token *form_token)
  2303. {
  2304. struct conf_desc *conf_desc;
  2305. int found = 0;
  2306. int entry = 0;
  2307. /*
  2308. * Determine if local configuration id is already present in form token
  2309. */
  2310. for (entry = 0; entry < form_token->conf_desc_list_entries; entry++) {
  2311. if (memcmp (&form_token->conf_desc_list[entry].conf_id,
  2312. &memb_form_token_conf_id, sizeof (struct memb_conf_id)) == 0) {
  2313. found = 1;
  2314. break;
  2315. }
  2316. }
  2317. conf_desc = &form_token->conf_desc_list[entry];
  2318. if (found == 0) {
  2319. /*
  2320. * Item not present, add item
  2321. */
  2322. conf_desc->highest_seq = gmi_highest_seq;
  2323. conf_desc->arut = gmi_arut;
  2324. // TODO holes not currently implemented conf_desc->hole_list_entries = 0;
  2325. memcpy (&conf_desc->conf_id,
  2326. &memb_form_token_conf_id, sizeof (struct memb_conf_id));
  2327. form_token->conf_desc_list_entries += 1;
  2328. } else {
  2329. /*
  2330. * Item already present, update arut, highest seq
  2331. */
  2332. if (conf_desc->arut > gmi_arut) {
  2333. conf_desc->arut = gmi_arut;
  2334. }
  2335. if (gmi_highest_seq > conf_desc->highest_seq) {
  2336. conf_desc->highest_seq = gmi_highest_seq;
  2337. }
  2338. }
  2339. #ifdef COMPILE_OUT
  2340. /*
  2341. * Build conf_desc->hole_list
  2342. */
  2343. printf ("conf desc build %d %d\n", gmi_arut, gmi_highest_seq);
  2344. conf_desc->hole_list_entries = 0;
  2345. for (i = gmi_arut; i < gmi_highest_seq; i++) {
  2346. assert (conf_desc->hole_list_entries < HOLE_LIST_MAX);
  2347. res = sq_item_get (&queue_rtr_items, i, (void **)&gmi_rtr_item_p);
  2348. if (res == 0) {
  2349. /*
  2350. * If item present, delete from hole list if it exists
  2351. */
  2352. for (j = 0; j < conf_desc->hole_list_entries; j++) {
  2353. if (conf_desc->hole_list[j] == i) {
  2354. memmove (&conf_desc->hole_list[j], &conf_desc->hole_list[j + 1],
  2355. sizeof (int) * (conf_desc->hole_list_entries - j - 1));
  2356. conf_desc->hole_list_entries -= 1;
  2357. printf ("reducing setting desc entries to %d\n", conf_desc->hole_list_entries);
  2358. break; /* from for (j = ... ) */
  2359. }
  2360. }
  2361. } else {
  2362. /*
  2363. * If item not present, add to hole list
  2364. */
  2365. conf_desc->hole_list[conf_desc->hole_list_entries] = i;
  2366. conf_desc->hole_list_entries += 1;
  2367. printf ("increasing setting desc entries to %d %d\n", conf_desc->hole_list_entries, i);
  2368. }
  2369. }
  2370. printf ("Conf desc build done\n");
  2371. #endif
  2372. }
  2373. static int memb_form_token_send (
  2374. struct memb_form_token *form_token)
  2375. {
  2376. struct msghdr msg_form_token;
  2377. struct iovec iovec_form_token;
  2378. int res;
  2379. /*
  2380. * Build message for sendmsg
  2381. */
  2382. iovec_form_token.iov_base = (char *)form_token;
  2383. iovec_form_token.iov_len = sizeof (struct memb_form_token);
  2384. encrypt_and_sign (&iovec_form_token, 1);
  2385. msg_form_token.msg_name = (caddr_t)&memb_next;
  2386. msg_form_token.msg_namelen = sizeof (struct sockaddr_in);
  2387. msg_form_token.msg_iov = &iov_encrypted;
  2388. msg_form_token.msg_iovlen = 1;
  2389. msg_form_token.msg_control = 0;
  2390. msg_form_token.msg_controllen = 0;
  2391. msg_form_token.msg_flags = 0;
  2392. res = sendmsg (gmi_sockets[0].token, &msg_form_token, MSG_NOSIGNAL | MSG_DONTWAIT);
  2393. /*
  2394. * res not used here, because orf token errors are handled by algorithm
  2395. */
  2396. stats_sent += res;
  2397. poll_timer_delete (*gmi_poll_handle, timer_orf_token_timeout);
  2398. timer_orf_token_timeout = 0;
  2399. /*
  2400. * Delete retransmit timer since a new
  2401. * membership is in progress
  2402. */
  2403. poll_timer_delete (*gmi_poll_handle, timer_orf_token_retransmit_timeout);
  2404. timer_orf_token_retransmit_timeout = 0;
  2405. poll_timer_delete (*gmi_poll_handle, timer_form_token_timeout);
  2406. poll_timer_add (*gmi_poll_handle, TIMEOUT_TOKEN, 0,
  2407. timer_function_form_token_timeout, &timer_form_token_timeout);
  2408. return (res);
  2409. }
  2410. int memb_form_token_send_initial (void)
  2411. {
  2412. struct memb_form_token form_token;
  2413. int res;
  2414. int i;
  2415. memset (&form_token, 0x00, sizeof (struct memb_form_token));
  2416. memb_state = MEMB_STATE_FORM;
  2417. /*
  2418. * Build form token
  2419. */
  2420. form_token.header.type = MESSAGE_TYPE_MEMB_FORM_TOKEN;
  2421. memcpy (form_token.rep_list,
  2422. memb_gather_set,
  2423. memb_gather_set_entries * sizeof (struct in_addr));
  2424. form_token.rep_list_entries = memb_gather_set_entries;
  2425. /*
  2426. * Add local member to entry
  2427. */
  2428. form_token.member_list[0].s_addr =
  2429. memb_local_sockaddr_in.sin_addr.s_addr;
  2430. form_token.member_list_entries = 1;
  2431. memb_conf_id_build (&form_token.conf_id, memb_local_sockaddr_in.sin_addr);
  2432. form_token.conf_desc_list_entries = 0;
  2433. memb_form_token_conf_desc_build (&form_token);
  2434. /*
  2435. * Send FORM to next member, or if no members in this configuration
  2436. * to next representative
  2437. */
  2438. if (memb_list_entries <= 1) {
  2439. memb_next.sin_addr.s_addr = memb_gather_set[1].s_addr;
  2440. } else {
  2441. for (i = 0; i < memb_list_entries; i++) {
  2442. if (memb_list[i].sin_addr.s_addr == memb_local_sockaddr_in.sin_addr.s_addr) {
  2443. memb_next.sin_addr.s_addr =
  2444. memb_list[i + 1].sin_addr.s_addr;
  2445. break;
  2446. }
  2447. }
  2448. }
  2449. // TODO assertion here about the 1 value
  2450. memb_next.sin_family = AF_INET;
  2451. memb_next.sin_port = sockaddr_in_mcast.sin_port;
  2452. res = memb_form_token_send (&form_token);
  2453. return (res);
  2454. }
  2455. void print_stats (void)
  2456. {
  2457. struct timeval tv_end;
  2458. gettimeofday (&tv_end, NULL);
  2459. gmi_log_printf (gmi_log_level_notice, "Bytes recv %d\n", stats_recv);
  2460. gmi_log_printf (gmi_log_level_notice, "Bytes sent %d\n", stats_sent);
  2461. gmi_log_printf (gmi_log_level_notice, "Messages delivered %d\n", stats_delv);
  2462. gmi_log_printf (gmi_log_level_notice, "Re-Mcasts %d\n", stats_remcasts);
  2463. gmi_log_printf (gmi_log_level_notice, "Tokens process %d\n", stats_orf_token);
  2464. }
  2465. int last_lowered = 1;
  2466. static void calculate_group_arut (struct orf_token *orf_token)
  2467. {
  2468. //printf ("group arut %d local arut %d gmi_gmi_highest seq %d\n", orf_token->group_arut, gmi_arut, gmi_highest_seq);
  2469. //printf ("last %d group arut %d last arut %d arut %d\n", last_lowered, orf_token->group_arut, last_group_arut, gmi_arut);
  2470. /*
  2471. * increase the group arut if we got back the same group
  2472. * because everyone has these messages
  2473. */
  2474. messages_free (orf_token->group_arut);
  2475. if (orf_token->addr_arut.s_addr == gmi_bound_to.sin_addr.s_addr) {
  2476. orf_token->group_arut = gmi_arut;
  2477. }
  2478. if (gmi_arut < orf_token->group_arut) {
  2479. orf_token->group_arut = gmi_arut;
  2480. orf_token->addr_arut.s_addr = gmi_bound_to.sin_addr.s_addr;
  2481. }
  2482. last_group_arut = orf_token->group_arut;
  2483. }
  2484. int gmi_token_callback_create (void **handle_out, int (*callback_fn) (void *), void *data)
  2485. {
  2486. struct token_callback_instance *handle;
  2487. handle = (struct token_callback_instance *)malloc (sizeof (struct token_callback_instance));
  2488. if (handle == 0) {
  2489. return (-1);
  2490. }
  2491. *handle_out = (void *)handle;
  2492. list_init (&handle->list);
  2493. handle->callback_fn = callback_fn;
  2494. handle->data = data;
  2495. list_add (&handle->list, &token_callback_listhead);
  2496. return (0);
  2497. }
  2498. void gmi_token_callback_destroy (void *handle)
  2499. {
  2500. struct token_callback_instance *token_callback_instance = (struct token_callback_instance *)handle;
  2501. list_del (&token_callback_instance->list);
  2502. free (token_callback_instance);
  2503. }
  2504. void token_callbacks_execute (void)
  2505. {
  2506. struct list_head *list;
  2507. struct list_head *list_next;
  2508. struct token_callback_instance *token_callback_instance;
  2509. int res;
  2510. for (list = token_callback_listhead.next; list != &token_callback_listhead;
  2511. list = list_next) {
  2512. token_callback_instance = list_entry (list, struct token_callback_instance, list);
  2513. list_next = list->next;
  2514. list_del (list);
  2515. res = token_callback_instance->callback_fn (token_callback_instance->data);
  2516. /*
  2517. * This callback failed to execute, try it again on the next token
  2518. */
  2519. if (res == -1) {
  2520. list_add (list, &token_callback_listhead);
  2521. break;
  2522. }
  2523. free (token_callback_instance);
  2524. }
  2525. }
  2526. /*
  2527. * Message Handlers
  2528. */
  2529. /*
  2530. * message handler called when TOKEN message type received
  2531. */
  2532. static int message_handler_orf_token (
  2533. struct sockaddr_in *system_from,
  2534. struct iovec *iovec,
  2535. int iov_len,
  2536. int bytes_received)
  2537. {
  2538. struct orf_token *orf_token = (struct orf_token *)orf_token_retransmit;
  2539. int transmits_allowed;
  2540. int starting_group_arut;
  2541. int prio = UINT_MAX;
  2542. struct pollfd ufd;
  2543. int nfds;
  2544. struct rtr_item rtr_list[RETRANSMIT_ENTRIES_MAX];
  2545. struct orf_token *orf_token_ref = (struct orf_token *)iovec->iov_base;
  2546. unsigned char plug_bitmap[MAX_MEMBERS / 8];
  2547. #ifdef RANDOMDROP
  2548. if (random () % 100 < 20) {
  2549. return (0);
  2550. }
  2551. #endif
  2552. assert (bytes_received >= sizeof (struct orf_token));
  2553. assert (bytes_received == sizeof (struct orf_token) +
  2554. (sizeof (struct rtr_item) * orf_token_ref->rtr_list_entries) +
  2555. (sizeof (unsigned char) * orf_token_ref->bitmap_bytes));
  2556. memcpy (orf_token, iovec->iov_base,
  2557. sizeof (struct orf_token) +
  2558. (sizeof (struct rtr_item) * orf_token_ref->rtr_list_entries) +
  2559. (sizeof (unsigned char) * orf_token_ref->bitmap_bytes));
  2560. /*
  2561. * flush multicast messages
  2562. */
  2563. do {
  2564. ufd.fd = gmi_sockets[0].mcast;
  2565. ufd.events = POLLIN;
  2566. nfds = poll (&ufd, 1, 0);
  2567. if (nfds == 1 && ufd.revents & POLLIN) {
  2568. gmi_iov_recv.iov_len = PACKET_SIZE_MAX;
  2569. recv_handler (0, gmi_sockets[0].mcast, ufd.revents, 0,
  2570. &prio);
  2571. }
  2572. } while (nfds == 1);
  2573. #ifdef TESTTOKENRETRANSMIT
  2574. if ((random() % 500) == 0) {
  2575. printf ("randomly dropping token to test token retransmit.\n");
  2576. return (0);
  2577. }
  2578. #endif
  2579. /*
  2580. * Already received this token, but it was retransmitted
  2581. * to this processor because the retransmit timer on a previous
  2582. * processor timed out, so ignore the token
  2583. */
  2584. if (orf_token->token_seqid > 0 && gmi_token_seqid >= orf_token->token_seqid) {
  2585. printf ("already received token %d %d\n", orf_token->token_seqid, gmi_token_seqid);
  2586. //exit(1);
  2587. return (0);
  2588. }
  2589. gmi_token_seqid = orf_token->token_seqid;
  2590. poll_timer_delete (*gmi_poll_handle, timer_orf_token_retransmit_timeout);
  2591. timer_orf_token_retransmit_timeout = 0;
  2592. #ifdef PRINT_STATS
  2593. if (orf_token->header.seqid > 10000) {
  2594. print_stats ();
  2595. }
  2596. #endif
  2597. if (memb_state == MEMB_STATE_FORM) {
  2598. gmi_log_printf (gmi_log_level_notice, "swallowing ORF token %d.\n", stats_orf_token);
  2599. poll_timer_delete (*gmi_poll_handle, timer_orf_token_timeout);
  2600. timer_orf_token_timeout = 0;
  2601. /*
  2602. * Delete retransmit timer since a new
  2603. * membership is in progress
  2604. */
  2605. poll_timer_delete (*gmi_poll_handle, timer_orf_token_retransmit_timeout);
  2606. timer_orf_token_retransmit_timeout = 0;
  2607. return (0);
  2608. }
  2609. /*
  2610. * Determine if the processor should be unplugged,
  2611. * and if the entire group has been unplugged
  2612. */
  2613. orf_token_plug_calculate (orf_token, plug_bitmap);
  2614. //printf ("Got orf token from %s\n", inet_ntoa (system_from->sin_addr));
  2615. starting_group_arut = orf_token->group_arut;
  2616. stats_orf_token++;
  2617. transmits_allowed = orf_fcc_allowed (orf_token);
  2618. //printf ("retransmit allowed %d\n", transmits_allowed);
  2619. /*
  2620. * Retransmit failed messages and request retransmissions
  2621. */
  2622. orf_token_rtr (orf_token, rtr_list, &transmits_allowed);
  2623. /*
  2624. * TODO Ok this is ugly and I dont like it.
  2625. *
  2626. * Flow control to limit number of missing multicast messages
  2627. * on lossy switches, this could cause a large window between
  2628. * what is delivered locally and what is delivered remotely.
  2629. * This window could cause the hole list of the form token to
  2630. * be overrun or cause the form token to be large.
  2631. */
  2632. if ((gmi_brake + MISSING_MCAST_WINDOW) < orf_token->header.seqid) {
  2633. transmits_allowed = 0;
  2634. }
  2635. /*
  2636. * Set the group arut and free any messages that can be freed
  2637. */
  2638. if (memb_state != MEMB_STATE_EVS) {
  2639. calculate_group_arut (orf_token);
  2640. }
  2641. /*
  2642. * Multicast queued messages
  2643. */
  2644. orf_token_mcast (orf_token, transmits_allowed, system_from);
  2645. /*
  2646. * Calculate flow control count
  2647. */
  2648. orf_token_fcc (orf_token);
  2649. /*
  2650. * Deliver membership and messages required by EVS
  2651. */
  2652. orf_token_evs (orf_token, starting_group_arut);
  2653. if (memb_state == MEMB_STATE_EVS) {
  2654. calculate_group_arut (orf_token);
  2655. }
  2656. /*
  2657. * Increment the token seqid and store for later retransmit
  2658. */
  2659. orf_token->token_seqid += 1;
  2660. poll_timer_delete (*gmi_poll_handle, timer_orf_token_retransmit_timeout);
  2661. poll_timer_add (*gmi_poll_handle, TIMEOUT_TOKEN_RETRANSMIT, 0,
  2662. timer_function_token_retransmit_timeout,
  2663. &timer_orf_token_retransmit_timeout);
  2664. /*
  2665. * Transmit orf_token to next member
  2666. */
  2667. orf_token_send (orf_token, rtr_list, plug_bitmap, 1);
  2668. token_callbacks_execute ();
  2669. return (0);
  2670. }
  2671. static int memb_state_gather_enter (void) {
  2672. struct msghdr msghdr_attempt_join;
  2673. struct iovec iovec_attempt_join;
  2674. struct memb_attempt_join memb_attempt_join;
  2675. int res = 0;
  2676. gmi_log_printf (gmi_log_level_notice, "entering GATHER state.\n");
  2677. memb_state = MEMB_STATE_GATHER;
  2678. /*
  2679. * Join message starts with no entries
  2680. */
  2681. memb_join.active_rep_list_entries = 0;
  2682. memb_join.failed_rep_list_entries = 0;
  2683. /*
  2684. * Copy local host info
  2685. */
  2686. memb_gather_set[0].s_addr = memb_local_sockaddr_in.sin_addr.s_addr;
  2687. memb_gather_set_entries = 1;
  2688. /*
  2689. * If this node is the representative, send attempt join
  2690. */
  2691. if (memb_local_sockaddr_in.sin_addr.s_addr == memb_conf_id.rep.s_addr) {
  2692. gmi_log_printf (gmi_log_level_notice, "SENDING attempt join because this node is ring rep.\n");
  2693. memb_attempt_join.header.seqid = 0;
  2694. memb_attempt_join.header.type = MESSAGE_TYPE_MEMB_ATTEMPT_JOIN;
  2695. iovec_attempt_join.iov_base = &memb_attempt_join;
  2696. iovec_attempt_join.iov_len = sizeof (struct memb_attempt_join);
  2697. encrypt_and_sign (&iovec_attempt_join, 1);
  2698. msghdr_attempt_join.msg_name = &sockaddr_in_mcast;
  2699. msghdr_attempt_join.msg_namelen = sizeof (struct sockaddr_in);
  2700. msghdr_attempt_join.msg_iov = &iov_encrypted;
  2701. msghdr_attempt_join.msg_iovlen = 1;
  2702. msghdr_attempt_join.msg_control = 0;
  2703. msghdr_attempt_join.msg_controllen = 0;
  2704. msghdr_attempt_join.msg_flags = 0;
  2705. res = sendmsg (gmi_sockets[0].mcast, &msghdr_attempt_join, MSG_NOSIGNAL | MSG_DONTWAIT);
  2706. /*
  2707. * res not checked here, there is nothing that can be done
  2708. * instead rely on the algorithm to recover from faults
  2709. */
  2710. }
  2711. /*
  2712. * Restart the gather timeout
  2713. ` */
  2714. poll_timer_delete (*gmi_poll_handle, timer_memb_state_gather_timeout);
  2715. poll_timer_add (*gmi_poll_handle, TIMEOUT_STATE_GATHER, 0,
  2716. memb_timer_function_state_gather, &timer_memb_state_gather_timeout);
  2717. /*
  2718. * If we already started a commit, stop it since we are
  2719. * going back into the gather state
  2720. */
  2721. poll_timer_delete (*gmi_poll_handle, timer_memb_state_commit_timeout);
  2722. timer_memb_state_commit_timeout = 0;
  2723. return (res);
  2724. }
  2725. struct queue_frag *queue_frag_delivery_find (void)
  2726. {
  2727. struct queue_frag *queue_frag = 0;
  2728. int i;
  2729. #ifdef ABBA
  2730. /*
  2731. * Find first_delivery queue that is not empty
  2732. * this sets the first pend_delv
  2733. */
  2734. for (i = 0; i < memb_list_entries_confchg; i++) {
  2735. if (queues_frag[i].first_delivery &&
  2736. queue_is_empty (&queues_pend_delv[i].queue) == 0) {
  2737. pend_delv = &queues_pend_delv[i];
  2738. // printf ("Selecting first queue %s\n", inet_ntoa (pend_delv->ip));
  2739. break;
  2740. }
  2741. }
  2742. /*
  2743. * Search remaining pend_delv for first deliveries with
  2744. * smaller sequence numbers
  2745. */
  2746. for (++i; i < memb_list_entries_confchg; i++) {
  2747. assert (pend_delv);
  2748. if (queues_frag[i].first_delivery &&
  2749. (queue_is_empty (&queues_frag[i].queue) == 0) &&
  2750. (queues_pend_delv[i].seqid < pend_delv->seqid)) {
  2751. pend_delv = &queues_pend_delv[i];
  2752. // printf ("Selecting first from %d in second phase %s\n", i, inet_ntoa (pend_delv->ip));
  2753. }
  2754. }
  2755. /*
  2756. * Found first_delivery queue that wasn't empty, return it
  2757. */
  2758. if (pend_delv) {
  2759. return (pend_delv);
  2760. }
  2761. #endif
  2762. /*
  2763. * No first delivery queues, repeat same
  2764. * process looking for any queue
  2765. */
  2766. for (i = 0; i < memb_list_entries_confchg; i++) {
  2767. #ifdef DEBUG
  2768. printf ("Queue empty[%d] %d queues seqid %d\n", i,
  2769. queue_is_empty (&queues_frag[i].pend_queue),
  2770. queues_frag[i].seqid);
  2771. #endif
  2772. if (queue_is_empty (&queues_frag[i].pend_queue) == 0 ||
  2773. queue_is_empty (&queues_frag[i].assembly.queue) == 0) {
  2774. queue_frag = &queues_frag[i];
  2775. break;
  2776. }
  2777. }
  2778. /*
  2779. * Find lowest sequence number queue
  2780. */
  2781. for (++i; i < memb_list_entries_confchg; i++) {
  2782. assert (queue_frag);
  2783. #ifdef DEBUG
  2784. printf ("Queue empty[%d] %d queues seqid %d lowest so far %d\n", i,
  2785. queue_is_empty (&queues_frag[i].pend_queue),
  2786. queues_frag[i].seqid, queues_frag->seqid);
  2787. #endif
  2788. if (queue_is_empty (&queues_frag[i].pend_queue) == 0 &&
  2789. (queues_frag[i].seqid < queue_frag->seqid)) {
  2790. queue_frag = &queues_frag[i];
  2791. }
  2792. if (queue_is_empty (&queues_frag[i].assembly.queue) == 0 &&
  2793. (queues_frag[i].assembly.seqid < queue_frag->seqid)) {
  2794. //printf ("assembly seqid is %d\n",
  2795. // queues_frag[i].assembly.seqid);
  2796. queue_frag = &queues_frag[i];
  2797. }
  2798. }
  2799. return (queue_frag);
  2800. }
  2801. /*
  2802. * This delivers all available messages that can be delivered in VS semantics
  2803. * from the fragmentation pend queue to the registered deliver function
  2804. */
  2805. static void app_deliver (void) {
  2806. struct queue_frag *queue_frag;
  2807. struct pend_queue_item *pend_queue_item;
  2808. int i;
  2809. do {
  2810. queue_frag = queue_frag_delivery_find ();
  2811. if (queue_frag == 0) {
  2812. break;
  2813. }
  2814. assert (queue_frag);
  2815. /*
  2816. * There is an assembly taking place that was selected but its not completed
  2817. */
  2818. if (queue_is_empty (&queue_frag->pend_queue) == 1) {
  2819. break;
  2820. }
  2821. //printf ("Delivering from pending queue %s seq id %d\n", inet_ntoa (queue_frag->source_addr), queue_frag->seqid);
  2822. pend_queue_item = queue_item_get (&queue_frag->pend_queue);
  2823. assert (pend_queue_item);
  2824. queue_item_remove (&queue_frag->pend_queue);
  2825. //&mcast->groupname, /* TODO figure out how to pass this from the frag queue */
  2826. gmi_deliver_fn (
  2827. 0,
  2828. queue_frag->source_addr,
  2829. pend_queue_item->iovec,
  2830. pend_queue_item->iov_len);
  2831. /*
  2832. * Reduce ref count on these delivered messages and free them if their
  2833. * reference count is zero
  2834. */
  2835. for (i = 0; i < pend_queue_item->pend_queue_msg_item_count; i++) {
  2836. release_reftwo_char (pend_queue_item->pend_queue_msg_items[i].reftwo,
  2837. pend_queue_item->pend_queue_msg_items[i].iov_base,
  2838. pend_queue_item->pend_queue_msg_items[i].iovec_entries);
  2839. }
  2840. /*
  2841. * Reset lowest seqid for this pending queue from next assembled message
  2842. */
  2843. if (queue_is_empty (&queue_frag->pend_queue) == 0) {
  2844. pend_queue_item = queue_item_get (&queue_frag->pend_queue);
  2845. queue_frag->seqid = pend_queue_item->seqid;
  2846. }
  2847. } while (queue_frag);
  2848. }
  2849. /*
  2850. * This delivers an assembled message into the fragmentation pend queue
  2851. * This must only be called once the full message has been assembled
  2852. */
  2853. static void assembly_deliver (struct queue_frag *queue_frag)
  2854. {
  2855. struct assembly_queue_item *assembly_queue_item;
  2856. struct pend_queue_item pend_queue_item;
  2857. int res = 0;
  2858. struct iovec iovec_delv[QUEUE_PEND_SIZE_MAX * MAXIOVS];
  2859. int iov_len_delv = 0;
  2860. struct mcast *mcast = 0;
  2861. int pend_queue_msg_item_count;
  2862. int i;
  2863. memset (iovec_delv, 0, sizeof (iovec_delv));
  2864. queue_item_iterator_init (&queue_frag->assembly.queue);
  2865. assert (queue_is_empty (&queue_frag->assembly.queue) == 0);
  2866. assembly_queue_item = queue_item_iterator_get (&queue_frag->assembly.queue);
  2867. /*
  2868. * Assemble all of the message iovectors into one iovector for delivery
  2869. */
  2870. pend_queue_msg_item_count = 0;
  2871. do {
  2872. assembly_queue_item = queue_item_iterator_get (&queue_frag->assembly.queue);
  2873. /*
  2874. * Assemble the refcounting structure to free the messages if appropriate
  2875. */
  2876. for (i = 0; i < assembly_queue_item->iov_len; i++) {
  2877. pend_queue_item.pend_queue_msg_items[pend_queue_msg_item_count].iov_base[i] =
  2878. assembly_queue_item->iovec[i].iov_base;
  2879. }
  2880. pend_queue_item.pend_queue_msg_items[pend_queue_msg_item_count].iovec_entries = i;
  2881. pend_queue_item.pend_queue_msg_items[pend_queue_msg_item_count].reftwo = assembly_queue_item->reftwo;
  2882. pend_queue_msg_item_count++;
  2883. assert (pend_queue_msg_item_count < QUEUE_PEND_SIZE_MAX);
  2884. /*
  2885. * Assemble io vector
  2886. */
  2887. if (assembly_queue_item->iov_len != 1 &&
  2888. assembly_queue_item->iovec[0].iov_len == sizeof (struct mcast)) {
  2889. /*
  2890. * Copy iovec from second iovec if this is self-delivered
  2891. */
  2892. memcpy (&iovec_delv[iov_len_delv],
  2893. &assembly_queue_item->iovec[1],
  2894. sizeof (struct iovec) * assembly_queue_item->iov_len - 1);
  2895. iov_len_delv += assembly_queue_item->iov_len - 1;
  2896. } else {
  2897. /*
  2898. * Copy iovec from first iovec if this is an external message
  2899. */
  2900. iovec_delv[iov_len_delv].iov_base =
  2901. assembly_queue_item->iovec[0].iov_base + sizeof (struct mcast);
  2902. iovec_delv[iov_len_delv].iov_len =
  2903. assembly_queue_item->iovec[0].iov_len - sizeof (struct mcast);
  2904. assert (iovec_delv[iov_len_delv].iov_len < MESSAGE_SIZE_MAX);
  2905. iov_len_delv += 1;
  2906. if (assembly_queue_item->iov_len > 1) {
  2907. memcpy (&iovec_delv[iov_len_delv],
  2908. &assembly_queue_item->iovec[1],
  2909. sizeof (struct iovec) * assembly_queue_item->iov_len - 1);
  2910. iov_len_delv += assembly_queue_item->iov_len - 1;
  2911. }
  2912. }
  2913. assert (iov_len_delv < 256);
  2914. assert (iov_len_delv > 0);
  2915. res = queue_item_iterator_next (&queue_frag->assembly.queue);
  2916. } while (res == 0);
  2917. pend_queue_item.pend_queue_msg_item_count = pend_queue_msg_item_count;
  2918. /*
  2919. * assert that this really is the end of the packet
  2920. */
  2921. mcast = assembly_queue_item->iovec[0].iov_base;
  2922. assert (mcast->packet_number == mcast->packet_count);
  2923. memcpy (pend_queue_item.iovec, iovec_delv,
  2924. sizeof (pend_queue_item.iovec));
  2925. pend_queue_item.iov_len = iov_len_delv;
  2926. pend_queue_item.seqid = queue_frag->assembly.seqid;
  2927. /*
  2928. * Add IO vector to pend queue
  2929. */
  2930. //printf ("assembling message for %s\n", inet_ntoa (queue_frag->source_addr));
  2931. queue_item_add (&queue_frag->pend_queue, &pend_queue_item);
  2932. queue_reinit (&queue_frag->assembly.queue);
  2933. app_deliver ();
  2934. }
  2935. struct queue_frag *pend_delv_find (struct in_addr source)
  2936. {
  2937. struct queue_frag *queue_frag = 0;
  2938. int i;
  2939. for (i = 0; i < memb_list_entries_confchg; i++) {
  2940. if (source.s_addr == queues_frag[i].source_addr.s_addr) {
  2941. queue_frag = &queues_frag[i];
  2942. break;
  2943. }
  2944. }
  2945. return (queue_frag);
  2946. }
  2947. static void pending_queues_deliver (void)
  2948. {
  2949. struct gmi_rtr_item *gmi_rtr_item_p;
  2950. int i;
  2951. int res;
  2952. struct mcast *mcast;
  2953. struct assembly_queue_item assembly_queue_item;
  2954. struct queue_frag *queue_frag;
  2955. //printf ("Delivering messages to pending queues\n");
  2956. /*
  2957. * Deliver messages in order from rtr queue to pending delivery queue
  2958. */
  2959. for (i = gmi_arut + 1; i <= gmi_highest_seq; i++) {
  2960. void *ptr;
  2961. res = sq_item_get (&queue_rtr_items, i, &ptr);
  2962. /*
  2963. * If hole, stop assembly
  2964. */
  2965. if (res != 0) {
  2966. break;
  2967. }
  2968. gmi_rtr_item_p = ptr;
  2969. assert (gmi_rtr_item_p->iovec[0].iov_len < MESSAGE_SIZE_MAX);
  2970. mcast = gmi_rtr_item_p->iovec[0].iov_base;
  2971. if (mcast == (struct mcast *)0xdeadbeef) {
  2972. printf ("seqid %d\n", gmi_rtr_item_p->iovec[0].iov_len);
  2973. }
  2974. assert (mcast != (struct mcast *)0xdeadbeef);
  2975. /*
  2976. * Message found
  2977. */
  2978. gmi_log_printf (gmi_log_level_debug,
  2979. "Delivering MCAST message with seqid %d to pending delivery queue\n",
  2980. mcast->header.seqid);
  2981. gmi_arut = i;
  2982. /*
  2983. * Create pending delivery item
  2984. */
  2985. assembly_queue_item.reftwo = gmi_rtr_item_p->reftwo;
  2986. assembly_queue_item.iov_len = gmi_rtr_item_p->iov_len;
  2987. memcpy (&assembly_queue_item.iovec, gmi_rtr_item_p->iovec,
  2988. sizeof (struct iovec) * gmi_rtr_item_p->iov_len);
  2989. assert (gmi_rtr_item_p->iov_len <= MAXIOVS);
  2990. assert (mcast->source.s_addr != 0);
  2991. queue_frag = pend_delv_find (mcast->source);
  2992. /*
  2993. * Setup sequence id numbers for use in assembly and delivery
  2994. */
  2995. if (mcast->packet_number == 0) {
  2996. queue_frag->assembly.seqid = mcast->header.seqid;
  2997. // printf ("Setting %s assembly seqid to %d\n",
  2998. // inet_ntoa (queue_frag->source_addr), queue_frag->assembly.seqid);
  2999. if (queue_is_empty (&queue_frag->pend_queue) == 1) {
  3000. queue_frag->seqid = mcast->header.seqid;
  3001. }
  3002. }
  3003. /*
  3004. * Add pending delivery item to assembly queue
  3005. */
  3006. queue_item_add (&queue_frag->assembly.queue, &assembly_queue_item);
  3007. /*
  3008. * If message is complete, deliver to user the pending delivery message
  3009. */
  3010. if (mcast->packet_number == mcast->packet_count) {
  3011. assembly_deliver (queue_frag);
  3012. }
  3013. }
  3014. //printf ("Done delivering messages to pending queues\n");
  3015. }
  3016. /*
  3017. * recv message handler called when MCAST message type received
  3018. */
  3019. static int message_handler_mcast (
  3020. struct sockaddr_in *system_from,
  3021. struct iovec *iovec,
  3022. int iov_len,
  3023. int bytes_received)
  3024. {
  3025. struct gmi_rtr_item gmi_rtr_item;
  3026. struct mcast *mcast;
  3027. mcast = iovec[0].iov_base;
  3028. #ifdef RANDOMDROP
  3029. if (random()%100 < 70) {
  3030. return (0);
  3031. }
  3032. #endif
  3033. /*
  3034. * Ignore multicasts for other configurations
  3035. * TODO shouldn't we enter gather here?
  3036. */
  3037. if (memcmp (&mcast->memb_conf_id,
  3038. &memb_form_token_conf_id, sizeof (struct memb_conf_id)) != 0) {
  3039. return (0);
  3040. }
  3041. poll_timer_delete (*gmi_poll_handle, timer_orf_token_retransmit_timeout);
  3042. timer_orf_token_retransmit_timeout = 0;
  3043. /*
  3044. * Add mcast message to rtr queue if not already in rtr queue
  3045. * otherwise free io vectors
  3046. */
  3047. if (bytes_received > 0 && bytes_received < MESSAGE_SIZE_MAX &&
  3048. sq_item_inuse (&queue_rtr_items, mcast->header.seqid) == 0) {
  3049. /*
  3050. * Allocate new multicast memory block
  3051. * TODO we need to free this somewhere
  3052. */
  3053. gmi_rtr_item.iovec[0].iov_base = malloc (bytes_received);
  3054. if (gmi_rtr_item.iovec[0].iov_base == 0) {
  3055. return (-1); /* error here is corrected by the algorithm */
  3056. }
  3057. gmi_rtr_item.reftwo = malloc (sizeof (struct reftwo));
  3058. if (gmi_rtr_item.reftwo == 0) {
  3059. free (gmi_rtr_item.iovec[0].iov_base);
  3060. return (-1);
  3061. }
  3062. gmi_rtr_item.reftwo->refcount = 2;
  3063. memcpy (gmi_rtr_item.iovec[0].iov_base, mcast, bytes_received);
  3064. gmi_rtr_item.iovec[0].iov_len = bytes_received;
  3065. assert (gmi_rtr_item.iovec[0].iov_len > 0);
  3066. assert (gmi_rtr_item.iovec[0].iov_len < MESSAGE_SIZE_MAX);
  3067. gmi_rtr_item.iov_len = 1;
  3068. if (mcast->header.seqid > gmi_highest_seq) {
  3069. gmi_highest_seq = mcast->header.seqid;
  3070. }
  3071. sq_item_add (&queue_rtr_items, &gmi_rtr_item, mcast->header.seqid);
  3072. }
  3073. pending_queues_deliver ();
  3074. return (0);
  3075. }
  3076. static int message_handler_memb_attempt_join (
  3077. struct sockaddr_in *system_from,
  3078. struct iovec *iov,
  3079. int iov_len,
  3080. int bytes_received)
  3081. {
  3082. int found;
  3083. int i;
  3084. gmi_log_printf (gmi_log_level_notice, "Got attempt join from %s\n", inet_ntoa (system_from->sin_addr));
  3085. /*
  3086. * Not representative
  3087. */
  3088. if (memb_conf_id.rep.s_addr != memb_local_sockaddr_in.sin_addr.s_addr) {
  3089. gmi_log_printf (gmi_log_level_notice, "rep is %s, not handling attempt join.\n",
  3090. inet_ntoa (memb_conf_id.rep));
  3091. return (0);
  3092. }
  3093. switch (memb_state) {
  3094. case MEMB_STATE_OPERATIONAL:
  3095. case MEMB_STATE_COMMIT:
  3096. memb_state_gather_enter ();
  3097. /*
  3098. * Do NOT place break here, immediately execute gather attempt join
  3099. */
  3100. case MEMB_STATE_GATHER:
  3101. gmi_log_printf (gmi_log_level_debug, "ATTEMPT JOIN: state gather\n");
  3102. for (found = 0, i = 0; i < memb_gather_set_entries; i++) {
  3103. if (memb_gather_set[i].s_addr == system_from->sin_addr.s_addr) {
  3104. found = 1;
  3105. }
  3106. }
  3107. if (found == 0) {
  3108. memb_gather_set[memb_gather_set_entries++].s_addr = system_from->sin_addr.s_addr;
  3109. /*
  3110. * Sort gather set
  3111. */
  3112. qsort (memb_gather_set, memb_gather_set_entries,
  3113. sizeof (struct in_addr), in_addr_compare);
  3114. }
  3115. break;
  3116. case MEMB_STATE_FORM:
  3117. case MEMB_STATE_EVS:
  3118. gmi_log_printf (gmi_log_level_error,
  3119. "memb_attempt_join: FORM, EVS %d\n", memb_state);
  3120. break;
  3121. }
  3122. return (0);
  3123. }
  3124. static int message_handler_memb_join (
  3125. struct sockaddr_in *system_from,
  3126. struct iovec *iovec,
  3127. int iov_len,
  3128. int bytes_received)
  3129. {
  3130. struct memb_join *memb_join;
  3131. int commit_entry;
  3132. int found;
  3133. int consensus;
  3134. /*
  3135. * Not representative
  3136. */
  3137. if (memb_conf_id.rep.s_addr != memb_local_sockaddr_in.sin_addr.s_addr) {
  3138. gmi_log_printf (gmi_log_level_debug, "not the rep for this ring, not handling join.\n");
  3139. return (0);
  3140. }
  3141. switch (memb_state) {
  3142. case MEMB_STATE_OPERATIONAL:
  3143. case MEMB_STATE_GATHER:
  3144. memb_state_commit_enter ();
  3145. /*
  3146. * do not place break in this case, immediately enter COMMIT state
  3147. */
  3148. case MEMB_STATE_COMMIT:
  3149. gmi_log_printf (gmi_log_level_debug, "JOIN in commit\n");
  3150. memb_join = (struct memb_join *)iovec[0].iov_base;
  3151. /*
  3152. * Find gather set that matches the system message was from
  3153. */
  3154. for (found = 0, commit_entry = 0; commit_entry < memb_commit_set_entries; commit_entry++) {
  3155. if (system_from->sin_addr.s_addr == memb_commit_set[commit_entry].rep.sin_addr.s_addr) {
  3156. found = 1;
  3157. break;
  3158. }
  3159. }
  3160. /*
  3161. * Add system from to commit sets if not currently in commit set
  3162. */
  3163. if (found == 0) {
  3164. memcpy (&memb_commit_set[commit_entry].rep, system_from, sizeof (struct sockaddr_in));
  3165. memb_commit_set_entries++;
  3166. }
  3167. /*
  3168. * Set gather join data
  3169. */
  3170. memcpy (memb_commit_set[commit_entry].join_rep_list, memb_join->active_rep_list,
  3171. sizeof (struct in_addr) * memb_join->active_rep_list_entries);
  3172. memb_commit_set[commit_entry].join_rep_list_entries = memb_join->active_rep_list_entries;
  3173. /*
  3174. * Union all entries into the gather set (join_rep_list[0])
  3175. */
  3176. memb_state_commit_union (commit_entry);
  3177. /*
  3178. * Send JOIN message, but only if gather set has changed
  3179. */
  3180. memb_join_send ();
  3181. /*
  3182. * If consensus, transition to FORM
  3183. */
  3184. memb_print_commit_set ();
  3185. consensus = memb_state_consensus_commit ();
  3186. if (consensus) {
  3187. gmi_log_printf (gmi_log_level_notice, "CONSENSUS reached!\n");
  3188. if (memb_local_sockaddr_in.sin_addr.s_addr == memb_gather_set[0].s_addr) {
  3189. gmi_log_printf (gmi_log_level_debug, "This node responsible for sending the FORM token.\n");
  3190. poll_timer_delete (*gmi_poll_handle, timer_memb_state_commit_timeout);
  3191. timer_memb_state_commit_timeout = 0;
  3192. memb_form_token_send_initial ();
  3193. }
  3194. }
  3195. break;
  3196. /*
  3197. * All other cases are ignored on JOINs
  3198. */
  3199. case MEMB_STATE_FORM:
  3200. gmi_log_printf (gmi_log_level_warning, "JOIN in form, ignoring since consensus reached in state machine.\n");
  3201. break;
  3202. default:
  3203. // TODO HANDLE THIS CASE
  3204. gmi_log_printf (gmi_log_level_debug, "memb_join: DEFAULT case %d, shouldn't happen!!\n", memb_state);
  3205. break;
  3206. }
  3207. return (0);
  3208. }
  3209. static int message_handler_memb_form_token (
  3210. struct sockaddr_in *system_from,
  3211. struct iovec *iovec,
  3212. int iov_len,
  3213. int bytes_received)
  3214. {
  3215. int i;
  3216. int local = 0;
  3217. int res = 0;
  3218. printf ("Got membership form token\n");
  3219. memcpy (&memb_form_token, iovec->iov_base, sizeof (struct memb_form_token));
  3220. poll_timer_delete (*gmi_poll_handle, timer_form_token_timeout);
  3221. timer_form_token_timeout = 0;
  3222. switch (memb_state) {
  3223. case MEMB_STATE_OPERATIONAL:
  3224. case MEMB_STATE_COMMIT:
  3225. memb_state = MEMB_STATE_FORM;
  3226. poll_timer_delete (*gmi_poll_handle, timer_memb_state_commit_timeout);
  3227. timer_memb_state_commit_timeout = 0;
  3228. /*
  3229. * Add member to entry
  3230. */
  3231. memb_form_token.member_list[memb_form_token.member_list_entries].s_addr =
  3232. memb_local_sockaddr_in.sin_addr.s_addr;
  3233. memb_form_token.member_list_entries++;
  3234. /*
  3235. * Modify the conf_id as necessary
  3236. */
  3237. memb_form_token_conf_desc_build (&memb_form_token);
  3238. /*
  3239. * Stop token timeout timer from firing
  3240. * If we are in FORM state, a previous FORM state member
  3241. * may have captured the ORF token and swallowed it
  3242. */
  3243. poll_timer_delete (*gmi_poll_handle, timer_orf_token_timeout);
  3244. timer_orf_token_timeout = 0;
  3245. /*
  3246. * Delete retransmit timer since a new
  3247. * membership is in progress
  3248. */
  3249. poll_timer_delete (*gmi_poll_handle, timer_orf_token_retransmit_timeout);
  3250. timer_orf_token_retransmit_timeout = 0;
  3251. /*
  3252. * Find next member
  3253. */
  3254. for (i = 0; i < memb_list_entries; i++) {
  3255. if (memb_list[i].sin_addr.s_addr == memb_local_sockaddr_in.sin_addr.s_addr) {
  3256. local = 1;
  3257. break;
  3258. }
  3259. }
  3260. if (memb_list_entries == 0) { /* 0 or 1 members and we are local */
  3261. local = 1;
  3262. }
  3263. if (local && (i + 1 < memb_list_entries)) {
  3264. memb_next.sin_addr.s_addr = memb_list[i + 1].sin_addr.s_addr;
  3265. } else {
  3266. /*
  3267. * Find next representative
  3268. */
  3269. for (i = 0; i < memb_form_token.rep_list_entries; i++) {
  3270. if (memb_conf_id.rep.s_addr ==
  3271. memb_form_token.rep_list[i].s_addr) {
  3272. break;
  3273. }
  3274. }
  3275. memb_next.sin_addr.s_addr =
  3276. memb_form_token.rep_list[(i + 1) % memb_form_token.rep_list_entries].s_addr;
  3277. }
  3278. memb_next.sin_family = AF_INET;
  3279. memb_next.sin_port = sockaddr_in_mcast.sin_port;
  3280. break;
  3281. case MEMB_STATE_FORM:
  3282. gmi_token_seqid = 0;
  3283. memb_state = MEMB_STATE_EVS;
  3284. memb_form_token_update_highest_seq (&memb_form_token);
  3285. /*
  3286. * Reset flow control local variables since we are starting a new token
  3287. */
  3288. fcc_mcast_current = 0;
  3289. fcc_remcast_current = 0;
  3290. fcc_mcast_last = 0;
  3291. fcc_remcast_last = 0;
  3292. /*
  3293. * FORM token has rotated once, now install local variables
  3294. *
  3295. * Set barrier sequence number
  3296. * Set original arut
  3297. */
  3298. gmi_barrier_seq = 0;
  3299. printf ("conf_desc_list %d\n", memb_form_token.conf_desc_list_entries);
  3300. for (i = 0; i < memb_form_token.conf_desc_list_entries; i++) {
  3301. printf ("highest seq %d %d\n", i, memb_form_token.conf_desc_list[i].highest_seq);
  3302. if (gmi_barrier_seq < memb_form_token.conf_desc_list[i].highest_seq) {
  3303. gmi_barrier_seq = memb_form_token.conf_desc_list[i].highest_seq;
  3304. printf ("setting barrier seq to %d\n", gmi_barrier_seq);
  3305. }
  3306. }
  3307. gmi_barrier_seq += 1;
  3308. printf ("setting barrier seq to %d\n", gmi_barrier_seq);
  3309. gmi_original_arut = gmi_arut;
  3310. break;
  3311. case MEMB_STATE_EVS:
  3312. gmi_log_printf (gmi_log_level_debug, "Swallowing FORM token in EVS state.\n");
  3313. printf ("FORM CONF ENTRIES %d\n", memb_form_token.conf_desc_list_entries);
  3314. orf_token_send_initial();
  3315. return (0);
  3316. default:
  3317. // TODO
  3318. gmi_log_printf (gmi_log_level_error, "memb_form_token: default case, shouldn't happen.\n");
  3319. return (0);
  3320. }
  3321. res = memb_form_token_send (&memb_form_token);
  3322. return (res);
  3323. }
  3324. static int recv_handler (poll_handle handle, int fd, int revents, void *data, unsigned int *prio)
  3325. {
  3326. struct msghdr msg_recv;
  3327. struct message_header *message_header;
  3328. struct sockaddr_in system_from;
  3329. int res = 0;
  3330. int bytes_received;
  3331. *prio = UINT_MAX;
  3332. /*
  3333. * Receive datagram
  3334. */
  3335. msg_recv.msg_name = &system_from;
  3336. msg_recv.msg_namelen = sizeof (struct sockaddr_in);
  3337. msg_recv.msg_iov = &gmi_iov_recv;
  3338. msg_recv.msg_iovlen = 1;
  3339. msg_recv.msg_control = 0;
  3340. msg_recv.msg_controllen = 0;
  3341. msg_recv.msg_flags = 0;
  3342. bytes_received = recvmsg (fd, &msg_recv, MSG_NOSIGNAL | MSG_DONTWAIT);
  3343. if (bytes_received == -1) {
  3344. return (0);
  3345. } else {
  3346. stats_recv += bytes_received;
  3347. }
  3348. if (bytes_received < sizeof (struct message_header)) {
  3349. gmi_log_printf (gmi_log_level_security, "Received message is too short... ignoring.\n");
  3350. return (0);
  3351. }
  3352. message_header = (struct message_header *)msg_recv.msg_iov[0].iov_base;
  3353. /*
  3354. * Authenticate and if authenticated, decrypt datagram
  3355. */
  3356. gmi_iov_recv.iov_len = bytes_received;
  3357. res = authenticate_and_decrypt (&gmi_iov_recv);
  3358. if (res == -1) {
  3359. gmi_iov_recv.iov_len = PACKET_SIZE_MAX;
  3360. return 0;
  3361. }
  3362. if (stats_tv_start.tv_usec == 0) {
  3363. gettimeofday (&stats_tv_start, NULL);
  3364. }
  3365. /*
  3366. * Handle incoming message
  3367. */
  3368. message_header = (struct message_header *)msg_recv.msg_iov[0].iov_base;
  3369. gmi_message_handlers.handler_functions[message_header->type] (
  3370. &system_from,
  3371. msg_recv.msg_iov,
  3372. msg_recv.msg_iovlen,
  3373. bytes_received);
  3374. gmi_iov_recv.iov_len = PACKET_SIZE_MAX;
  3375. return (0);
  3376. }