gmi.c 78 KB

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