gmi.c 102 KB

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