gmi.c 91 KB

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