gmi.c 91 KB

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