gmi.c 83 KB

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