gmi.c 90 KB

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