gmi.c 104 KB

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