gmi.c 102 KB

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