shim_ipc_nsimpl.h 50 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231123212331234123512361237123812391240124112421243124412451246124712481249125012511252125312541255125612571258125912601261126212631264126512661267126812691270127112721273127412751276127712781279128012811282128312841285128612871288128912901291129212931294129512961297129812991300130113021303130413051306130713081309131013111312131313141315131613171318131913201321132213231324132513261327132813291330133113321333133413351336133713381339134013411342134313441345134613471348134913501351135213531354135513561357135813591360136113621363136413651366136713681369137013711372137313741375137613771378137913801381138213831384138513861387138813891390139113921393139413951396139713981399140014011402140314041405140614071408140914101411141214131414141514161417141814191420142114221423142414251426142714281429143014311432143314341435143614371438143914401441144214431444144514461447144814491450145114521453145414551456145714581459146014611462146314641465146614671468146914701471147214731474147514761477147814791480148114821483148414851486148714881489149014911492149314941495149614971498149915001501150215031504150515061507150815091510151115121513151415151516151715181519152015211522152315241525152615271528152915301531153215331534153515361537153815391540154115421543154415451546154715481549155015511552155315541555155615571558155915601561156215631564156515661567156815691570157115721573157415751576157715781579158015811582158315841585158615871588158915901591159215931594159515961597159815991600160116021603160416051606160716081609161016111612161316141615161616171618161916201621162216231624162516261627162816291630163116321633163416351636163716381639164016411642164316441645164616471648164916501651165216531654165516561657165816591660166116621663166416651666166716681669167016711672167316741675167616771678167916801681168216831684168516861687168816891690169116921693169416951696169716981699170017011702170317041705170617071708170917101711171217131714171517161717171817191720172117221723172417251726172717281729173017311732173317341735173617371738173917401741174217431744174517461747174817491750175117521753175417551756175717581759176017611762176317641765176617671768176917701771177217731774177517761777177817791780178117821783178417851786178717881789179017911792179317941795179617971798179918001801180218031804180518061807180818091810181118121813181418151816181718181819182018211822182318241825182618271828182918301831183218331834183518361837183818391840184118421843184418451846184718481849185018511852185318541855185618571858185918601861186218631864186518661867186818691870187118721873187418751876187718781879188018811882188318841885188618871888188918901891189218931894189518961897189818991900190119021903190419051906190719081909191019111912191319141915191619171918191919201921192219231924
  1. /* -*- mode:c; c-file-style:"k&r"; c-basic-offset: 4; tab-width:4; indent-tabs-mode:nil; mode:auto-fill; fill-column:78; -*- */
  2. /* vim: set ts=4 sw=4 et tw=78 fo=cqt wm=0: */
  3. /* Copyright (C) 2014 Stony Brook University
  4. This file is part of Graphene Library OS.
  5. Graphene Library OS is free software: you can redistribute it and/or
  6. modify it under the terms of the GNU Lesser General Public License
  7. as published by the Free Software Foundation, either version 3 of the
  8. License, or (at your option) any later version.
  9. Graphene Library OS is distributed in the hope that it will be useful,
  10. but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. GNU Lesser General Public License for more details.
  13. You should have received a copy of the GNU Lesser General Public License
  14. along with this program. If not, see <http://www.gnu.org/licenses/>. */
  15. /*
  16. * shim_ipc_nsimpl.h
  17. *
  18. * This file contains a template for generic functions and callbacks to
  19. * implement a namespace.
  20. */
  21. #include <shim_internal.h>
  22. #include <shim_ipc.h>
  23. #include <shim_utils.h>
  24. #include <shim_profile.h>
  25. #include <errno.h>
  26. #ifndef INCLUDE_IPC_NSIMPL
  27. # warning "Be sure before including \"shim_ipc_nsimpl.h\"."
  28. #endif
  29. #ifdef __SHIM_IPC_NSIMPL__
  30. # error "Include \"shim_ipc_nsimpl.h\" only once."
  31. #endif
  32. #define __SHIM_IPC_NSIMPL__
  33. #if !defined(NS) || !defined(NS_CAP)
  34. # error "NS or NS_CAP is not defined"
  35. #endif
  36. #define NS_STR XSTRINGIFY(NS)
  37. #define NS_CAP_STR XSTRINGIFY(NS_CAP)
  38. #define RANGE_SIZE CONCAT2(NS_CAP, RANGE_SIZE)
  39. #define BITS (sizeof(unsigned char) * 8)
  40. struct idx_bitmap {
  41. unsigned char map[RANGE_SIZE / BITS];
  42. };
  43. struct subrange {
  44. struct shim_ipc_info * owner;
  45. LEASETYPE lease;
  46. };
  47. struct sub_map {
  48. struct subrange * map[RANGE_SIZE];
  49. };
  50. DEFINE_LIST(range);
  51. struct range {
  52. LIST_TYPE(range) hlist;
  53. LIST_TYPE(range) list;
  54. int offset;
  55. struct shim_ipc_info * owner;
  56. LEASETYPE lease;
  57. struct idx_bitmap * used;
  58. struct sub_map * subranges;
  59. };
  60. struct range_bitmap {
  61. int map_size;
  62. unsigned char map[];
  63. };
  64. static struct range_bitmap * range_map;
  65. static LOCKTYPE range_map_lock;
  66. #define RANGE_HASH_LEN 6
  67. #define RANGE_HASH_NUM (1 << RANGE_HASH_LEN)
  68. #define RANGE_HASH_MASK (RANGE_HASH_NUM - 1)
  69. #define RANGE_HASH(off) (((off - 1) / RANGE_SIZE) & RANGE_HASH_MASK)
  70. /* This hash table organizes range structs by hlist */
  71. DEFINE_LISTP(range);
  72. static LISTP_TYPE(range) range_table [RANGE_HASH_NUM];
  73. /* These lists organizes range structs by list
  74. */
  75. static LISTP_TYPE(range) owned_ranges;
  76. static LISTP_TYPE(range) offered_ranges;
  77. static int nowned = 0;
  78. static int noffered = 0;
  79. static int nsubed = 0;
  80. DEFINE_LIST(ns_query);
  81. struct ns_query {
  82. IDTYPE dest;
  83. unsigned long seq;
  84. struct shim_ipc_port * port;
  85. LIST_TYPE(ns_query) list;
  86. };
  87. DEFINE_LISTP(ns_query);
  88. static LISTP_TYPE(ns_query) ns_queries;
  89. static inline LEASETYPE get_lease (void)
  90. {
  91. return DkSystemTimeQuery() + CONCAT2(NS_CAP, LEASE_TIME);
  92. }
  93. void CONCAT3(debug_print, NS, ranges) (void)
  94. {
  95. lock(range_map_lock);
  96. sys_printf(NS_STR " ranges in process %010u:\n", cur_process.vmid);
  97. if (!range_map) {
  98. unlock(range_map_lock);
  99. return;
  100. }
  101. for (int i = 0 ; i < range_map->map_size ; i++) {
  102. unsigned char map = range_map->map[i];
  103. if (!map)
  104. continue;
  105. for (int j = 0 ; j < BITS ; map >>= 1, j++) {
  106. if (!(map & 1))
  107. continue;
  108. int off = i * BITS + j;
  109. LISTP_TYPE(range) * head = range_table + RANGE_HASH(off);
  110. struct range * tmp, * r = NULL;
  111. listp_for_each_entry(tmp, head, hlist)
  112. if (tmp->offset == off) {
  113. r = tmp;
  114. break;
  115. }
  116. assert(r);
  117. IDTYPE base = RANGE_SIZE * off + 1;
  118. struct shim_ipc_info * p = r->owner;
  119. sys_printf("%04u - %04u: owner %010u, port \"%s\" lease %u\n",
  120. base, base + RANGE_SIZE - 1,
  121. p->vmid, qstrgetstr(&p->uri), r->lease);
  122. if (!r->subranges)
  123. continue;
  124. for (int k = 0 ; k < RANGE_SIZE ; k++) {
  125. struct subrange * s = r->subranges->map[j];
  126. if (!s)
  127. continue;
  128. p = s->owner;
  129. sys_printf(" %04u: owner %010u, port \"%s\" lease %u\n",
  130. base + k, p->vmid,
  131. qstrgetstr(&p->uri), s->lease);
  132. }
  133. }
  134. }
  135. unlock(range_map_lock);
  136. }
  137. #define INIT_RANGE_MAP_SIZE 32
  138. static int __extend_range_bitmap (int expected)
  139. {
  140. int size = INIT_RANGE_MAP_SIZE;
  141. if (range_map)
  142. size = range_map->map_size;
  143. while (size <= expected)
  144. size *= 2;
  145. struct range_bitmap * new_map = malloc(sizeof(struct range_bitmap) +
  146. size / BITS);
  147. if (!new_map)
  148. return -ENOMEM;
  149. if (range_map) {
  150. memcpy(new_map->map, range_map->map, range_map->map_size / BITS);
  151. memset(new_map->map + range_map->map_size / BITS, 0,
  152. (size - range_map->map_size) / BITS);
  153. free(range_map);
  154. } else {
  155. memset(new_map->map, 0, size / BITS);
  156. }
  157. new_map->map_size = size;
  158. range_map = new_map;
  159. return 0;
  160. }
  161. static int __set_range_bitmap (int off, bool unset)
  162. {
  163. int i = off / BITS;
  164. int j = off - i * BITS;
  165. unsigned char * m = range_map->map + i;
  166. unsigned char f = 1U << j;
  167. if (unset) {
  168. if (!((*m) & f))
  169. return -ENOENT;
  170. (*m) &= ~f;
  171. } else {
  172. if ((*m) & f)
  173. return -EEXIST;
  174. (*m) |= f;
  175. }
  176. return 0;
  177. }
  178. static bool __check_range_bitmap (int off)
  179. {
  180. int i = off / BITS;
  181. int j = off - i * BITS;
  182. unsigned char * m = range_map->map + i;
  183. unsigned char f = 1U << j;
  184. return (*m) && ((*m) & f);
  185. }
  186. static struct range * __get_range (int off)
  187. {
  188. LISTP_TYPE(range) * head = range_table + RANGE_HASH(off);
  189. if (!range_map || off >= range_map->map_size)
  190. return NULL;
  191. if (!__check_range_bitmap(off))
  192. return NULL;
  193. struct range * r;
  194. listp_for_each_entry(r, head, hlist)
  195. if (r->offset == off)
  196. return r;
  197. return NULL;
  198. }
  199. static int __add_range (struct range * r, int off, IDTYPE owner,
  200. const char * uri, LEASETYPE lease)
  201. {
  202. LISTP_TYPE(range) * head = range_table + RANGE_HASH(off);
  203. int ret = 0;
  204. if (!range_map || range_map->map_size <= off) {
  205. ret = __extend_range_bitmap(off);
  206. if (ret < 0)
  207. return ret;
  208. }
  209. r->owner = NULL;
  210. r->offset = off;
  211. r->lease = lease;
  212. r->used = NULL;
  213. r->subranges = NULL;
  214. if (owner) {
  215. r->owner = lookup_and_alloc_client(owner, uri);
  216. if (!r->owner)
  217. return -ENOMEM;
  218. }
  219. ret = __set_range_bitmap(off, false);
  220. if (ret == -EEXIST) {
  221. struct range * tmp;
  222. listp_for_each_entry(tmp, head, hlist)
  223. if (tmp->offset == off) {
  224. listp_del(tmp, head, hlist);
  225. /* Chia-Che Tsai 10/17/17: only when tmp->owner is non-NULL,
  226. * and tmp->owner->vmid == cur_process.vmid, tmp is on the
  227. * owned list, otherwise it is an offered. */
  228. if (tmp->owner && tmp->owner->vmid == cur_process.vmid)
  229. listp_del(tmp, &owned_ranges, list);
  230. else
  231. listp_del(tmp, &offered_ranges, list);
  232. if (tmp->owner)
  233. put_client(tmp->owner);
  234. r->used = tmp->used;
  235. r->subranges = tmp->subranges;
  236. free(tmp);
  237. break;
  238. }
  239. }
  240. INIT_LIST_HEAD(r, hlist);
  241. listp_add(r, head, hlist);
  242. INIT_LIST_HEAD(r, list);
  243. LISTP_TYPE(range)* list = (owner == cur_process.vmid) ? &owned_ranges
  244. : &offered_ranges;
  245. struct range * prev = listp_first_entry(list, range, list);
  246. struct range * tmp;
  247. listp_for_each_entry(tmp, list, list) {
  248. if (tmp->offset >= off)
  249. break;
  250. prev = tmp;
  251. }
  252. listp_add_after(r, prev, list, list);
  253. if (owner == cur_process.vmid)
  254. nowned++;
  255. else
  256. noffered++;
  257. return 0;
  258. }
  259. int CONCAT3(add, NS, range) (IDTYPE base, IDTYPE owner,
  260. const char * uri, LEASETYPE lease)
  261. {
  262. int off = (base - 1) / RANGE_SIZE;
  263. int ret;
  264. struct range * r = malloc(sizeof(struct range));
  265. if (!r)
  266. return -ENOMEM;
  267. lock(range_map_lock);
  268. r->owner = NULL;
  269. ret = __add_range(r, off, owner, uri, lease);
  270. if (ret < 0)
  271. free(r);
  272. unlock(range_map_lock);
  273. return ret;
  274. }
  275. static void CONCAT3(__del, NS, subrange) (struct subrange ** ptr)
  276. {
  277. struct subrange * s = *ptr;
  278. *ptr = NULL;
  279. put_ipc_info(s->owner);
  280. free(s);
  281. nsubed--;
  282. }
  283. int CONCAT3(add, NS, subrange) (IDTYPE idx, IDTYPE owner,
  284. const char * uri, LEASETYPE * lease)
  285. {
  286. int off = (idx - 1) / RANGE_SIZE, err = 0;
  287. IDTYPE base = off * RANGE_SIZE + 1;
  288. struct subrange * s = malloc(sizeof(struct subrange));
  289. if (!s)
  290. return -ENOMEM;
  291. assert(owner);
  292. lock(range_map_lock);
  293. s->owner = lookup_and_alloc_client(owner, uri);
  294. if (!s->owner) {
  295. err = -ENOMEM;
  296. goto failed;
  297. }
  298. s->lease = (lease && (*lease)) ? (*lease) : get_lease();
  299. struct range * r = __get_range(off);
  300. if (!r) {
  301. r = malloc(sizeof(struct range));
  302. if (!r) {
  303. err = -ENOMEM;
  304. goto failed;
  305. }
  306. if ((err = __add_range(r, off, 0, NULL, 0)) < 0) {
  307. free(r);
  308. goto failed;
  309. }
  310. }
  311. if (!r->subranges) {
  312. r->subranges = calloc(1, sizeof(struct sub_map));
  313. if (!r->subranges) {
  314. err = -ENOMEM;
  315. goto failed;
  316. }
  317. }
  318. struct subrange ** m = &r->subranges->map[idx - base];
  319. if (*m)
  320. CONCAT3(__del, NS, subrange)(m);
  321. (*m) = s;
  322. nsubed++;
  323. if (lease)
  324. *lease = s->lease;
  325. unlock(range_map_lock);
  326. return 0;
  327. failed:
  328. if (s->owner)
  329. put_ipc_info(s->owner);
  330. unlock(range_map_lock);
  331. free(s);
  332. return err;
  333. }
  334. int CONCAT3(alloc, NS, range) (IDTYPE owner, const char * uri,
  335. IDTYPE * base, LEASETYPE * lease)
  336. {
  337. struct range * r = malloc(sizeof(struct range));
  338. if (!r)
  339. return -ENOMEM;
  340. int ret = 0;
  341. lock(range_map_lock);
  342. r->owner = NULL;
  343. int i = 0, j = 0;
  344. if (range_map)
  345. for (i = 0 ; i < range_map->map_size ; i++) {
  346. unsigned char map = range_map->map[i];
  347. if (map < 255U) {
  348. for (j = 0 ; j < BITS ; map >>= 1, j++)
  349. if (!(map & 1U))
  350. break;
  351. assert(j < BITS);
  352. break;
  353. }
  354. }
  355. LEASETYPE l = get_lease();
  356. ret = __add_range(r, i * BITS + j, owner, uri, l);
  357. if (ret < 0) {
  358. if (r->owner)
  359. put_ipc_info(r->owner);
  360. free(r);
  361. goto out;
  362. }
  363. if (base)
  364. *base = (i * BITS + j) * RANGE_SIZE + 1;
  365. if (lease)
  366. *lease = l;
  367. out:
  368. unlock(range_map_lock);
  369. return ret;
  370. }
  371. int CONCAT3(get, NS, range) (IDTYPE idx,
  372. struct CONCAT2(NS, range) * range,
  373. struct shim_ipc_info ** info)
  374. {
  375. int off = (idx - 1) / RANGE_SIZE;
  376. lock(range_map_lock);
  377. struct range * r = __get_range(off);
  378. if (!r) {
  379. unlock(range_map_lock);
  380. return -ESRCH;
  381. }
  382. IDTYPE base = r->offset * RANGE_SIZE + 1;
  383. IDTYPE sz = RANGE_SIZE;
  384. LEASETYPE l = r->lease;
  385. struct shim_ipc_info * p = r->owner;
  386. if (r->subranges && r->subranges->map[idx - base]) {
  387. struct subrange * s = r->subranges->map[idx - base];
  388. base = idx;
  389. sz = 1;
  390. l = s->lease;
  391. p = s->owner;
  392. }
  393. if (!p) {
  394. unlock(range_map_lock);
  395. return -ESRCH;
  396. }
  397. if (p->port)
  398. get_ipc_port(p->port);
  399. range->base = base;
  400. range->size = sz;
  401. range->lease = l;
  402. range->owner = p->vmid;
  403. qstrcopy(&range->uri, &p->uri);
  404. range->port = p->port;
  405. if (info) {
  406. get_ipc_info(p);
  407. *info = p;
  408. }
  409. unlock(range_map_lock);
  410. return 0;
  411. }
  412. int CONCAT3(del, NS, range) (IDTYPE idx)
  413. {
  414. int off = (idx - 1) / RANGE_SIZE;
  415. int ret = -ESRCH;
  416. lock(range_map_lock);
  417. struct range * r = __get_range(off);
  418. if (!r)
  419. goto failed;
  420. ret = __set_range_bitmap(off, true);
  421. if (ret < 0)
  422. goto failed;
  423. if (r->subranges) {
  424. for (int i = 0 ; i < RANGE_SIZE ; i++)
  425. if (r->subranges->map[i]) {
  426. ret = -EBUSY;
  427. goto failed;
  428. }
  429. free(r->subranges);
  430. }
  431. if (r->owner->vmid == cur_process.vmid)
  432. nowned--;
  433. else
  434. noffered--;
  435. if (r->used)
  436. free(r->used);
  437. // Re-acquire the head; kind of ugly
  438. LISTP_TYPE(range) * head = range_table + RANGE_HASH(off);
  439. listp_del(r, head, hlist);
  440. /* Chia-Che Tsai 10/17/17: only when r->owner is non-NULL,
  441. * and r->owner->vmid == cur_process.vmid, r is on the
  442. * owned list, otherwise it is an offered. */
  443. if (r->owner && r->owner->vmid == cur_process.vmid)
  444. listp_del(r, &owned_ranges, list);
  445. else
  446. listp_del(r, &offered_ranges, list);
  447. put_ipc_info(r->owner);
  448. free(r);
  449. ret = 0;
  450. failed:
  451. unlock(range_map_lock);
  452. return ret;
  453. }
  454. int CONCAT3(del, NS, subrange) (IDTYPE idx)
  455. {
  456. int off = (idx - 1) / RANGE_SIZE;
  457. IDTYPE base = off * RANGE_SIZE + 1;
  458. int ret = -ESRCH;
  459. lock(range_map_lock);
  460. struct range * r = __get_range(off);
  461. if (!r)
  462. goto failed;
  463. if (!r->subranges || !r->subranges->map[idx - base])
  464. goto failed;
  465. CONCAT3(__del, NS, subrange) (&r->subranges->map[idx - base]);
  466. ret = 0;
  467. failed:
  468. unlock(range_map_lock);
  469. return ret;
  470. }
  471. int CONCAT3(renew, NS, range) (IDTYPE idx, LEASETYPE * lease)
  472. {
  473. int off = (idx - 1) / RANGE_SIZE;
  474. lock(range_map_lock);
  475. struct range * r = __get_range(off);
  476. if (!r) {
  477. unlock(range_map_lock);
  478. return -ESRCH;
  479. }
  480. r->lease = get_lease();
  481. if (lease)
  482. *lease = r->lease;
  483. unlock(range_map_lock);
  484. return 0;
  485. }
  486. int CONCAT3(renew, NS, subrange) (IDTYPE idx, LEASETYPE * lease)
  487. {
  488. int off = (idx - 1) / RANGE_SIZE;
  489. IDTYPE base = off * RANGE_SIZE + 1;
  490. lock(range_map_lock);
  491. struct range * r = __get_range(off);
  492. if (!r) {
  493. unlock(range_map_lock);
  494. return -ESRCH;
  495. }
  496. if (!r->subranges || !r->subranges->map[idx - base]) {
  497. unlock(range_map_lock);
  498. return -ESRCH;
  499. }
  500. struct subrange * s = r->subranges->map[idx - base];
  501. s->lease = get_lease();
  502. if (lease)
  503. *lease = s->lease;
  504. unlock(range_map_lock);
  505. return 0;
  506. }
  507. IDTYPE CONCAT2(allocate, NS) (IDTYPE min, IDTYPE max)
  508. {
  509. IDTYPE idx = min;
  510. struct range * r;
  511. lock(range_map_lock);
  512. listp_for_each_entry (r, &owned_ranges, list) {
  513. if (max && idx >= max)
  514. break;
  515. IDTYPE base = r->offset * RANGE_SIZE + 1;
  516. if (idx >= base + RANGE_SIZE)
  517. continue;
  518. if (idx < base)
  519. idx = base;
  520. if (!r->used) {
  521. r->used = calloc(1, sizeof(struct idx_bitmap));
  522. if (!r->used)
  523. continue;
  524. }
  525. int i = (idx - base) / BITS;
  526. int j = (idx - base) - i * BITS;
  527. unsigned char * m = r->used->map + i;
  528. unsigned char f = 1U << j;
  529. for ( ; i < RANGE_SIZE / BITS ; i++, j = 0, f = 1U, m++) {
  530. unsigned char map = (*m) ^ (f - 1);
  531. if (map < 255U) {
  532. for ( ; j < BITS ; f <<= 1, j++)
  533. if (!(map & f)) {
  534. (*m) |= f;
  535. idx = base + i * BITS + j;
  536. debug("allocated " NS_STR ": %u\n", idx);
  537. goto out;
  538. }
  539. }
  540. }
  541. }
  542. idx = 0;
  543. out:
  544. unlock(range_map_lock);
  545. return idx;
  546. }
  547. void CONCAT2(release, NS) (IDTYPE idx)
  548. {
  549. int off = (idx - 1) / RANGE_SIZE;
  550. IDTYPE base = off * RANGE_SIZE + 1;
  551. lock(range_map_lock);
  552. struct range * r = __get_range(off);
  553. if (!r)
  554. goto out;
  555. if (r->subranges && r->subranges->map[idx - base])
  556. CONCAT3(__del, NS, subrange) (&r->subranges->map[idx - base]);
  557. if (!r->used)
  558. goto out;
  559. if (idx < base || idx >= base + RANGE_SIZE)
  560. goto out;
  561. int i = (idx - base) / BITS;
  562. int j = (idx - base) - i * BITS;
  563. unsigned char * m = r->used->map + i;
  564. unsigned char f = 1U << j;
  565. if ((*m) & f) {
  566. debug("released " NS_STR ": %u\n", idx);
  567. (*m) &= ~f;
  568. }
  569. out:
  570. unlock(range_map_lock);
  571. }
  572. static inline void init_namespace (void)
  573. {
  574. create_lock(range_map_lock);
  575. }
  576. #define _NS_ID(ns) __NS_ID(ns)
  577. #define __NS_ID(ns) ns##_NS
  578. #define NS_ID _NS_ID(NS_CAP)
  579. #define NS_LEADER cur_process.ns[NS_ID]
  580. #define NS_SEND(t) CONCAT3(ipc, NS, t##_send)
  581. #define NS_CALLBACK(t) CONCAT3(ipc, NS, t##_callback)
  582. #define NS_CODE(t) CONCAT3(IPC, NS_CAP, t)
  583. #define NS_CODE_STR(t) "IPC_" NS_CAP_STR "_" #t
  584. #define NS_MSG_TYPE(t) struct CONCAT3(shim_ipc, NS, t)
  585. #define PORT(ns, t) __PORT(ns, t)
  586. #define __PORT(ns, t) IPC_PORT_##ns##t
  587. #define IPC_PORT_CLT PORT(NS_CAP, CLT)
  588. #define IPC_PORT_LDR PORT(NS_CAP, LDR)
  589. #define IPC_PORT_CON PORT(NS_CAP, CON)
  590. #define IPC_PORT_OWN PORT(NS_CAP, OWN)
  591. static void ipc_leader_exit (struct shim_ipc_port * port, IDTYPE vmid,
  592. unsigned int exitcode)
  593. {
  594. lock(cur_process.lock);
  595. if (!NS_LEADER || NS_LEADER->port != port) {
  596. unlock(cur_process.lock);
  597. return;
  598. }
  599. struct shim_ipc_info * info = NS_LEADER;
  600. NS_LEADER = NULL;
  601. unlock(cur_process.lock);
  602. debug("ipc port %p of process %u closed suggests " NS_STR " leader exits\n",
  603. port, vmid);
  604. put_ipc_info(info);
  605. }
  606. /*
  607. * __discover_ns(): Discover the leader of this namespace.
  608. * @block: Whether to block for discovery.
  609. * @need_locate: Need the location information of the leader.
  610. */
  611. static void __discover_ns (bool block, bool need_locate)
  612. {
  613. bool ipc_pending = false;
  614. lock(cur_process.lock);
  615. if (NS_LEADER) {
  616. if (NS_LEADER->vmid == cur_process.vmid) {
  617. if (need_locate && qstrempty(&NS_LEADER->uri)) {
  618. struct shim_ipc_info * info = create_ipc_port(cur_process.vmid,
  619. true);
  620. if (info) {
  621. put_ipc_info(NS_LEADER);
  622. NS_LEADER = info;
  623. add_ipc_port(info->port, 0, IPC_PORT_CLT,
  624. &ipc_leader_exit);
  625. }
  626. }
  627. goto out;
  628. }
  629. if (!qstrempty(&NS_LEADER->uri))
  630. goto out;
  631. }
  632. /*
  633. * Now we need to discover the leader through IPC. Because IPC calls can be blocking,
  634. * we need to temporarily release cur_process.lock to prevent deadlocks. If the discovery
  635. * succeeds, NS_LEADER will contain the IPC information of the namespace leader.
  636. */
  637. unlock(cur_process.lock);
  638. // Send out an IPC message to find out the namespace information.
  639. // If the call is non-blocking, can't expect the answer when the function finishes.
  640. if (!NS_SEND(findns)(block)) {
  641. ipc_pending = !block; // There is still some unfinished business with IPC
  642. lock(cur_process.lock);
  643. assert(NS_LEADER);
  644. goto out;
  645. }
  646. lock(cur_process.lock);
  647. if (NS_LEADER && (!need_locate || !qstrempty(&NS_LEADER->uri)))
  648. goto out;
  649. // If all other ways failed, the current process becomes the leader
  650. if (!need_locate) {
  651. NS_LEADER = get_new_ipc_info(cur_process.vmid, NULL, 0);
  652. goto out;
  653. }
  654. if (NS_LEADER)
  655. put_ipc_info(NS_LEADER);
  656. if (!(NS_LEADER = create_ipc_port(cur_process.vmid, true)))
  657. goto out;
  658. // Finally, set the IPC port as a leadership port
  659. add_ipc_port(NS_LEADER->port, 0, IPC_PORT_CLT, &ipc_leader_exit);
  660. out:
  661. if (NS_LEADER && !ipc_pending) {
  662. // Assertions for checking the correctness of __discover_ns()
  663. assert(NS_LEADER->vmid == cur_process.vmid // The current process is the leader;
  664. || NS_LEADER->port // Or there is a connected port
  665. || !qstrempty(&NS_LEADER->uri)); // Or there is a known URI
  666. if (need_locate)
  667. assert(!qstrempty(&NS_LEADER->uri)); // A known URI is needed
  668. }
  669. unlock(cur_process.lock);
  670. }
  671. static int connect_ns (IDTYPE * vmid, struct shim_ipc_port ** portptr)
  672. {
  673. __discover_ns(true, false); // This function cannot be called with cur_process.lock held
  674. lock(cur_process.lock);
  675. if (!NS_LEADER) {
  676. unlock(cur_process.lock);
  677. return -ESRCH;
  678. }
  679. if (NS_LEADER->vmid == cur_process.vmid) {
  680. if (vmid)
  681. *vmid = NS_LEADER->vmid;
  682. unlock(cur_process.lock);
  683. return 0;
  684. }
  685. if (!NS_LEADER->port) {
  686. if (qstrempty(&NS_LEADER->uri)) {
  687. unlock(cur_process.lock);
  688. return -ESRCH;
  689. }
  690. PAL_HANDLE pal_handle = DkStreamOpen(qstrgetstr(&NS_LEADER->uri),
  691. 0, 0, 0, 0);
  692. if (!pal_handle) {
  693. unlock(cur_process.lock);
  694. return -PAL_ERRNO;
  695. }
  696. add_ipc_port_by_id(NS_LEADER->vmid, pal_handle,
  697. IPC_PORT_LDR|IPC_PORT_LISTEN, &ipc_leader_exit,
  698. &NS_LEADER->port);
  699. }
  700. if (vmid)
  701. *vmid = NS_LEADER->vmid;
  702. if (portptr) {
  703. if (NS_LEADER->port)
  704. get_ipc_port(NS_LEADER->port);
  705. *portptr = NS_LEADER->port;
  706. }
  707. unlock(cur_process.lock);
  708. return 0;
  709. }
  710. // Turn off this function as it is not used
  711. // Keep the code for future use
  712. #if 0
  713. static int disconnect_ns(struct shim_ipc_port * port)
  714. {
  715. lock(cur_process.lock);
  716. if (NS_LEADER && NS_LEADER->port == port) {
  717. NS_LEADER->port = NULL;
  718. put_ipc_port(port);
  719. }
  720. unlock(cur_process.lock);
  721. del_ipc_port(port, IPC_PORT_LDR);
  722. return 0;
  723. }
  724. #endif
  725. int CONCAT3(prepare, NS, leader) (void)
  726. {
  727. lock(cur_process.lock);
  728. bool need_discover = (!NS_LEADER || qstrempty(&NS_LEADER->uri));
  729. unlock(cur_process.lock);
  730. if (need_discover)
  731. __discover_ns(true, true); // This function cannot be called with cur_process.lock held
  732. return 0;
  733. }
  734. static int connect_owner (IDTYPE idx, struct shim_ipc_port ** portptr,
  735. IDTYPE * owner)
  736. {
  737. struct shim_ipc_info * info = NULL;
  738. struct CONCAT2(NS, range) range;
  739. memset(&range, 0, sizeof(struct CONCAT2(NS, range)));
  740. int ret = CONCAT3(get, NS, range) (idx, &range, &info);
  741. if (ret == -ESRCH) {
  742. if ((ret = NS_SEND(query)(idx)) < 0)
  743. return -ESRCH;
  744. ret = CONCAT3(get, NS, range) (idx, &range, &info);
  745. }
  746. if (ret < 0)
  747. goto out;
  748. if (range.owner == cur_process.vmid) {
  749. ret = -ESRCH;
  750. assert(!range.port);
  751. goto out;
  752. }
  753. if (range.port)
  754. goto success;
  755. int type = IPC_PORT_OWN|IPC_PORT_LISTEN;
  756. if (!range.port) {
  757. PAL_HANDLE pal_handle = DkStreamOpen(qstrgetstr(&range.uri),
  758. 0, 0, 0, 0);
  759. if (!pal_handle) {
  760. ret = -PAL_ERRNO ? : -EACCES;
  761. goto out;
  762. }
  763. add_ipc_port_by_id(range.owner, pal_handle, type, NULL, &range.port);
  764. assert(range.port);
  765. }
  766. lock(range_map_lock);
  767. if (info->port)
  768. put_ipc_port(info->port);
  769. get_ipc_port(range.port);
  770. info->port = range.port;
  771. unlock(range_map_lock);
  772. success:
  773. if (portptr)
  774. *portptr = range.port;
  775. else
  776. put_ipc_port(range.port);
  777. if (owner)
  778. *owner = range.owner;
  779. out:
  780. if (info)
  781. put_ipc_info(info);
  782. assert(ret || range.port);
  783. return ret;
  784. }
  785. DEFINE_PROFILE_INTERVAL(NS_SEND(findns), ipc);
  786. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(findns), ipc);
  787. int NS_SEND(findns) (bool block)
  788. {
  789. BEGIN_PROFILE_INTERVAL();
  790. int ret = -ESRCH;
  791. lock(cur_process.lock);
  792. if (!cur_process.parent || !cur_process.parent->port) {
  793. unlock(cur_process.lock);
  794. goto out;
  795. }
  796. IDTYPE dest = cur_process.parent->vmid;
  797. struct shim_ipc_port * port = cur_process.parent->port;
  798. get_ipc_port(port);
  799. unlock(cur_process.lock);
  800. if (block) {
  801. struct shim_ipc_msg_obj * msg =
  802. create_ipc_msg_duplex_on_stack(NS_CODE(FINDNS), 0, dest);
  803. debug("ipc send to %u: " NS_CODE_STR(FINDNS) "\n", dest);
  804. ret = do_ipc_duplex(msg, port, NULL, NULL);
  805. goto out_port;
  806. }
  807. struct shim_ipc_msg * msg =
  808. create_ipc_msg_on_stack(NS_CODE(FINDNS), 0, dest);
  809. debug("ipc send to %u: " NS_CODE_STR(FINDNS) "\n", dest);
  810. ret = send_ipc_message(msg, port);
  811. out_port:
  812. put_ipc_port(port);
  813. out:
  814. SAVE_PROFILE_INTERVAL(NS_SEND(findns));
  815. return ret;
  816. }
  817. int NS_CALLBACK(findns) (IPC_CALLBACK_ARGS)
  818. {
  819. BEGIN_PROFILE_INTERVAL();
  820. debug("ipc callback from %u: " NS_CODE_STR(FINDNS) "\n",
  821. msg->src);
  822. int ret = 0;
  823. __discover_ns(false, true); // This function cannot be called with cur_process.lock held
  824. lock(cur_process.lock);
  825. if (NS_LEADER && !qstrempty(&NS_LEADER->uri)) {
  826. // Got the answer! Send back the discovery now.
  827. ret = NS_SEND(tellns)(port, msg->src, NS_LEADER, msg->seq);
  828. } else {
  829. // Don't know the answer yet, set up a callback for sending the discovery later.
  830. struct ns_query * query = malloc(sizeof(struct ns_query));
  831. if (query) {
  832. query->dest = msg->src;
  833. query->seq = msg->seq;
  834. get_ipc_port(port);
  835. query->port = port;
  836. INIT_LIST_HEAD(query, list);
  837. listp_add_tail(query, &ns_queries, list);
  838. } else {
  839. ret = -ENOMEM;
  840. }
  841. }
  842. unlock(cur_process.lock);
  843. SAVE_PROFILE_INTERVAL(NS_CALLBACK(findns));
  844. return ret;
  845. }
  846. DEFINE_PROFILE_INTERVAL(NS_SEND(tellns), ipc);
  847. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(tellns), ipc);
  848. int NS_SEND(tellns) (struct shim_ipc_port * port, IDTYPE dest,
  849. struct shim_ipc_info * leader, unsigned long seq)
  850. {
  851. BEGIN_PROFILE_INTERVAL();
  852. struct shim_ipc_msg * msg =
  853. create_ipc_msg_on_stack(NS_CODE(TELLNS),
  854. leader->uri.len + sizeof(NS_MSG_TYPE(tellns)),
  855. dest);
  856. NS_MSG_TYPE(tellns) * msgin = (void *) &msg->msg;
  857. msgin->vmid = leader->vmid;
  858. memcpy(msgin->uri, qstrgetstr(&leader->uri), leader->uri.len + 1);
  859. msg->seq = seq;
  860. debug("ipc send to %u: " NS_CODE_STR(TELLNS) "(%u, %s)\n", dest,
  861. leader->vmid, msgin->uri);
  862. int ret = send_ipc_message(msg, port);
  863. SAVE_PROFILE_INTERVAL(NS_SEND(tellns));
  864. return ret;
  865. }
  866. int NS_CALLBACK(tellns) (IPC_CALLBACK_ARGS)
  867. {
  868. BEGIN_PROFILE_INTERVAL();
  869. NS_MSG_TYPE(tellns) * msgin = (void *) &msg->msg;
  870. int ret = 0;
  871. debug("ipc callback from %u: " NS_CODE_STR(TELLNS) "(%u, %s)\n",
  872. msg->src, msgin->vmid, msgin->uri);
  873. lock(cur_process.lock);
  874. if (NS_LEADER) {
  875. NS_LEADER->vmid = msgin->vmid;
  876. qstrsetstr(&NS_LEADER->uri, msgin->uri, strlen(msgin->uri));
  877. } else {
  878. NS_LEADER = get_new_ipc_info(msgin->vmid, msgin->uri,
  879. strlen(msgin->uri));
  880. if (!NS_LEADER) {
  881. ret = -ENOMEM;
  882. goto out;
  883. }
  884. }
  885. assert(NS_LEADER->vmid != 0);
  886. assert(!qstrempty(&NS_LEADER->uri));
  887. struct ns_query * query, * pos;
  888. listp_for_each_entry_safe(query, pos, &ns_queries, list) {
  889. listp_del(query, &ns_queries, list);
  890. NS_SEND(tellns)(query->port, query->dest, NS_LEADER, query->seq);
  891. put_ipc_port(query->port);
  892. free(query);
  893. }
  894. struct shim_ipc_msg_obj * obj = find_ipc_msg_duplex(port, msg->seq);
  895. if (obj && obj->thread)
  896. thread_wakeup(obj->thread);
  897. out:
  898. unlock(cur_process.lock);
  899. SAVE_PROFILE_INTERVAL(NS_CALLBACK(tellns));
  900. return ret;
  901. }
  902. DEFINE_PROFILE_INTERVAL(NS_SEND(lease), ipc);
  903. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(lease), ipc);
  904. int NS_SEND(lease) (LEASETYPE * lease)
  905. {
  906. BEGIN_PROFILE_INTERVAL();
  907. IDTYPE leader;
  908. struct shim_ipc_port * port = NULL;
  909. struct shim_ipc_info * self = NULL;
  910. int ret = 0;
  911. if ((ret = connect_ns(&leader, &port)) < 0)
  912. goto out;
  913. if ((ret = create_ipc_location(&self)) < 0)
  914. goto out;
  915. if (leader == cur_process.vmid) {
  916. ret = CONCAT3(alloc, NS, range)(cur_process.vmid,
  917. qstrgetstr(&self->uri),
  918. NULL, NULL);
  919. put_ipc_info(self);
  920. goto out;
  921. }
  922. int len = self->uri.len;
  923. struct shim_ipc_msg_obj * msg = create_ipc_msg_duplex_on_stack(
  924. NS_CODE(LEASE),
  925. len + sizeof(NS_MSG_TYPE(lease)),
  926. leader);
  927. NS_MSG_TYPE(lease) * msgin = (void *) &msg->msg.msg;
  928. assert(!qstrempty(&self->uri));
  929. memcpy(msgin->uri, qstrgetstr(&self->uri), len + 1);
  930. put_ipc_info(self);
  931. debug("ipc send to %u: " NS_CODE_STR(LEASE) "(%s)\n", leader,
  932. msgin->uri);
  933. ret = do_ipc_duplex(msg, port, NULL, lease);
  934. out:
  935. if (port)
  936. put_ipc_port(port);
  937. SAVE_PROFILE_INTERVAL(NS_SEND(lease));
  938. return ret;
  939. }
  940. int NS_CALLBACK(lease) (IPC_CALLBACK_ARGS)
  941. {
  942. BEGIN_PROFILE_INTERVAL();
  943. NS_MSG_TYPE(lease) * msgin = (void *) &msg->msg;
  944. debug("ipc callback from %u: " NS_CODE_STR(LEASE) "(%s)\n",
  945. msg->src, msgin->uri);
  946. IDTYPE base = 0;
  947. LEASETYPE lease = 0;
  948. int ret = CONCAT3(alloc, NS, range)(msg->src, msgin->uri, &base, &lease);
  949. if (ret < 0)
  950. goto out;
  951. ret = NS_SEND(offer)(port, msg->src, base, RANGE_SIZE, lease, msg->seq);
  952. out:
  953. SAVE_PROFILE_INTERVAL(NS_CALLBACK(lease));
  954. return ret;
  955. }
  956. DEFINE_PROFILE_INTERVAL(NS_SEND(offer), ipc);
  957. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(offer), ipc);
  958. int NS_SEND(offer) (struct shim_ipc_port * port, IDTYPE dest, IDTYPE base,
  959. IDTYPE size, LEASETYPE lease, unsigned long seq)
  960. {
  961. BEGIN_PROFILE_INTERVAL();
  962. int ret = 0;
  963. struct shim_ipc_msg * msg = create_ipc_msg_on_stack(NS_CODE(OFFER),
  964. sizeof(NS_MSG_TYPE(offer)), dest);
  965. NS_MSG_TYPE(offer) * msgin = (void *) &msg->msg;
  966. msgin->base = base;
  967. msgin->size = size;
  968. msgin->lease = lease;
  969. msg->seq = seq;
  970. debug("ipc send to %u: " NS_CODE_STR(OFFER) "(%u, %u, %lu)\n",
  971. port->info.vmid, base, size, lease);
  972. ret = send_ipc_message(msg, port);
  973. SAVE_PROFILE_INTERVAL(NS_SEND(offer));
  974. return ret;
  975. }
  976. int NS_CALLBACK(offer) (IPC_CALLBACK_ARGS)
  977. {
  978. BEGIN_PROFILE_INTERVAL();
  979. NS_MSG_TYPE(offer) * msgin = (void *) &msg->msg;
  980. debug("ipc callback from %u: " NS_CODE_STR(OFFER) "(%u, %u, %lu)\n",
  981. msg->src, msgin->base, msgin->size, msgin->lease);
  982. struct shim_ipc_msg_obj * obj = find_ipc_msg_duplex(port, msg->seq);
  983. switch (msgin->size) {
  984. case RANGE_SIZE:
  985. CONCAT3(add, NS, range)(msgin->base, cur_process.vmid,
  986. qstrgetstr(&cur_process.self->uri),
  987. msgin->lease);
  988. LEASETYPE * priv = obj ? obj->private : NULL;
  989. if (priv)
  990. *priv = msgin->lease;
  991. break;
  992. case 1:
  993. if (obj) {
  994. NS_MSG_TYPE(sublease) * s = (void *) &obj->msg.msg;
  995. CONCAT3(add, NS, subrange)(s->idx, s->tenant, s->uri,
  996. &msgin->lease);
  997. LEASETYPE * priv = obj->private;
  998. if (priv)
  999. *priv = msgin->lease;
  1000. }
  1001. break;
  1002. default:
  1003. goto out;
  1004. }
  1005. if (obj && obj->thread)
  1006. thread_wakeup(obj->thread);
  1007. out:
  1008. SAVE_PROFILE_INTERVAL(NS_CALLBACK(offer));
  1009. return 0;
  1010. }
  1011. DEFINE_PROFILE_INTERVAL(NS_SEND(renew), ipc);
  1012. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(renew), ipc);
  1013. int NS_SEND(renew) (IDTYPE base, IDTYPE size)
  1014. {
  1015. BEGIN_PROFILE_INTERVAL();
  1016. IDTYPE leader;
  1017. struct shim_ipc_port * port = NULL;
  1018. int ret = 0;
  1019. if ((ret = connect_ns(&leader, &port)) < 0)
  1020. goto out;
  1021. struct shim_ipc_msg * msg =
  1022. create_ipc_msg_on_stack(NS_CODE(RENEW),
  1023. sizeof(NS_MSG_TYPE(renew)), leader);
  1024. NS_MSG_TYPE(renew) * msgin = (void *) &msg->msg;
  1025. msgin->base = base;
  1026. msgin->size = size;
  1027. debug("ipc send to %u: " NS_CODE_STR(RENEW) "(%u, %u)\n", base, size);
  1028. ret = send_ipc_message(msg, port);
  1029. put_ipc_port(port);
  1030. out:
  1031. SAVE_PROFILE_INTERVAL(NS_SEND(renew));
  1032. return ret;
  1033. }
  1034. int NS_CALLBACK(renew) (IPC_CALLBACK_ARGS)
  1035. {
  1036. BEGIN_PROFILE_INTERVAL();
  1037. NS_MSG_TYPE(renew) * msgin = (void *) &msg->msg;
  1038. int ret = 0;
  1039. debug("ipc callback from %u: " NS_CODE_STR(RENEW) "(%u, %u)\n",
  1040. msg->src, msgin->base, msgin->size);
  1041. if (msgin->size != 1 && msgin->size != RANGE_SIZE) {
  1042. ret = -EINVAL;
  1043. goto out;
  1044. }
  1045. LEASETYPE lease = 0;
  1046. switch (msgin->size) {
  1047. case RANGE_SIZE:
  1048. ret = CONCAT3(renew, NS, range) (msgin->base, &lease);
  1049. break;
  1050. case 1:
  1051. ret = CONCAT3(renew, NS, subrange) (msgin->size, &lease);
  1052. break;
  1053. default:
  1054. ret = -EINVAL;
  1055. break;
  1056. }
  1057. if (ret < 0)
  1058. goto out;
  1059. ret = NS_SEND(offer)(port, msg->src, msgin->base, msgin->size, lease,
  1060. msg->seq);
  1061. out:
  1062. SAVE_PROFILE_INTERVAL(NS_CALLBACK(renew));
  1063. return ret;
  1064. }
  1065. DEFINE_PROFILE_INTERVAL(NS_SEND(revoke), ipc);
  1066. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(revoke), ipc);
  1067. int NS_SEND(revoke) (IDTYPE base, IDTYPE size)
  1068. {
  1069. BEGIN_PROFILE_INTERVAL();
  1070. IDTYPE leader;
  1071. struct shim_ipc_port * port = NULL;
  1072. int ret = 0;
  1073. if ((ret = connect_ns(&leader, &port)) < 0)
  1074. goto out;
  1075. struct shim_ipc_msg * msg =
  1076. create_ipc_msg_on_stack(NS_CODE(REVOKE),
  1077. sizeof(NS_MSG_TYPE(revoke)), leader);
  1078. NS_MSG_TYPE(revoke) * msgin = (void *) &msg->msg;
  1079. msgin->base = base;
  1080. msgin->size = size;
  1081. debug("ipc send to %u: " NS_CODE_STR(REVOKE) "(%u, %u)\n",
  1082. leader, base, size);
  1083. ret = send_ipc_message(msg, port);
  1084. put_ipc_port(port);
  1085. out:
  1086. SAVE_PROFILE_INTERVAL(NS_SEND(revoke));
  1087. return ret;
  1088. }
  1089. int NS_CALLBACK(revoke) (IPC_CALLBACK_ARGS)
  1090. {
  1091. BEGIN_PROFILE_INTERVAL();
  1092. NS_MSG_TYPE(revoke) * msgin = (void *) &msg->msg;
  1093. int ret = 0;
  1094. debug("ipc callback from %u: " NS_CODE_STR(REVOKE) "(%u, %u)\n",
  1095. msg->src, msgin->base, msgin->size);
  1096. switch (msgin->size) {
  1097. case RANGE_SIZE:
  1098. ret = CONCAT3(del, NS, range)(msgin->base);
  1099. break;
  1100. case 1:
  1101. ret = CONCAT3(del, NS, subrange)(msgin->size);
  1102. break;
  1103. default:
  1104. ret = -EINVAL;
  1105. break;
  1106. }
  1107. SAVE_PROFILE_INTERVAL(NS_CALLBACK(revoke));
  1108. return ret;
  1109. }
  1110. DEFINE_PROFILE_INTERVAL(NS_SEND(sublease), ipc);
  1111. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(sublease), ipc);
  1112. int NS_SEND(sublease) (IDTYPE tenant, IDTYPE idx, const char * uri,
  1113. LEASETYPE * lease)
  1114. {
  1115. BEGIN_PROFILE_INTERVAL();
  1116. IDTYPE leader;
  1117. struct shim_ipc_port * port = NULL;
  1118. int ret = 0;
  1119. if ((ret = connect_ns(&leader, &port)) < 0)
  1120. goto out;
  1121. if (leader == cur_process.vmid) {
  1122. ret = CONCAT3(add, NS, subrange)(idx, tenant, uri, NULL);
  1123. goto out;
  1124. }
  1125. int len = strlen(uri);
  1126. struct shim_ipc_msg_obj * msg = create_ipc_msg_duplex_on_stack(
  1127. NS_CODE(SUBLEASE),
  1128. len + sizeof(NS_MSG_TYPE(sublease)),
  1129. leader);
  1130. NS_MSG_TYPE(sublease) * msgin = (void *) &msg->msg.msg;
  1131. msgin->tenant = tenant;
  1132. msgin->idx = idx;
  1133. memcpy(msgin->uri, uri, len + 1);
  1134. debug("ipc send to %u: " NS_CODE_STR(SUBLEASE) "(%u, %u, %s)\n",
  1135. leader, tenant, idx, msgin->uri);
  1136. ret = do_ipc_duplex(msg, port, NULL, lease);
  1137. out:
  1138. if (port)
  1139. put_ipc_port(port);
  1140. SAVE_PROFILE_INTERVAL(NS_SEND(sublease));
  1141. return ret;
  1142. }
  1143. int NS_CALLBACK(sublease) (IPC_CALLBACK_ARGS)
  1144. {
  1145. BEGIN_PROFILE_INTERVAL();
  1146. NS_MSG_TYPE(sublease) * msgin = (void *) &msg->msg;
  1147. debug("ipc callback from %u: " NS_CODE_STR(SUBLEASE) "(%u, %u, %s)\n",
  1148. msg->src, msgin->idx, msgin->tenant, msgin->uri);
  1149. LEASETYPE lease = 0;
  1150. int ret = CONCAT3(add, NS, subrange)(msgin->idx, msgin->tenant, msgin->uri,
  1151. &lease);
  1152. ret = NS_SEND(offer)(port, msg->src, msgin->idx, 1, lease, msg->seq);
  1153. SAVE_PROFILE_INTERVAL(NS_CALLBACK(sublease));
  1154. return ret;
  1155. }
  1156. DEFINE_PROFILE_INTERVAL(NS_SEND(query), ipc);
  1157. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(query), ipc);
  1158. int NS_SEND(query) (IDTYPE idx)
  1159. {
  1160. BEGIN_PROFILE_INTERVAL();
  1161. struct CONCAT2(NS, range) range;
  1162. IDTYPE leader;
  1163. struct shim_ipc_port * port = NULL;
  1164. int ret = 0;
  1165. memset(&range, 0, sizeof(struct CONCAT2(NS, range)));
  1166. if (!CONCAT3(get, NS, range)(idx, &range, NULL))
  1167. goto out;
  1168. if ((ret = connect_ns(&leader, &port)) < 0)
  1169. goto out;
  1170. if (cur_process.vmid == leader) {
  1171. ret = -ESRCH;
  1172. goto out;
  1173. }
  1174. struct shim_ipc_msg_obj * msg = create_ipc_msg_duplex_on_stack(
  1175. NS_CODE(QUERY),
  1176. sizeof(NS_MSG_TYPE(query)),
  1177. leader);
  1178. NS_MSG_TYPE(query) * msgin = (void *) &msg->msg.msg;
  1179. msgin->idx = idx;
  1180. debug("ipc send to %u: " NS_CODE_STR(QUERY) "(%u)\n", leader, idx);
  1181. ret = do_ipc_duplex(msg, port, NULL, NULL);
  1182. out:
  1183. if (port)
  1184. put_ipc_port(port);
  1185. SAVE_PROFILE_INTERVAL(NS_SEND(query));
  1186. return ret;
  1187. }
  1188. int NS_CALLBACK(query) (IPC_CALLBACK_ARGS)
  1189. {
  1190. BEGIN_PROFILE_INTERVAL();
  1191. NS_MSG_TYPE(query) * msgin = (void *) &msg->msg;
  1192. debug("ipc callback from %u: " NS_CODE_STR(QUERY) "(%u)\n",
  1193. msg->src, msgin->idx);
  1194. struct CONCAT2(NS, range) range;
  1195. int ret = 0;
  1196. memset(&range, 0, sizeof(struct CONCAT2(NS, range)));
  1197. ret = CONCAT3(get, NS, range)(msgin->idx, &range, NULL);
  1198. if (ret < 0)
  1199. goto out;
  1200. assert(msgin->idx >= range.base && msgin->idx < range.base + range.size);
  1201. assert(range.owner);
  1202. assert(!qstrempty(&range.uri));
  1203. struct ipc_ns_offered ans;
  1204. ans.base = range.base;
  1205. ans.size = range.size;
  1206. ans.lease = range.lease;
  1207. ans.owner_offset = 0;
  1208. int ownerdatasz = sizeof(struct ipc_ns_client) + range.uri.len;
  1209. struct ipc_ns_client * owner = __alloca(ownerdatasz);
  1210. owner->vmid = range.owner;
  1211. assert(!qstrempty(&range.uri));
  1212. memcpy(owner->uri, qstrgetstr(&range.uri), range.uri.len + 1);
  1213. ret = NS_SEND(answer)(port, msg->src, 1, &ans, 1, &owner, &ownerdatasz,
  1214. msg->seq);
  1215. out:
  1216. SAVE_PROFILE_INTERVAL(NS_CALLBACK(query));
  1217. return ret;
  1218. }
  1219. DEFINE_PROFILE_INTERVAL(NS_SEND(queryall), ipc);
  1220. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(queryall), ipc);
  1221. int NS_SEND(queryall) (void)
  1222. {
  1223. BEGIN_PROFILE_INTERVAL();
  1224. IDTYPE leader;
  1225. struct shim_ipc_port * port = NULL;
  1226. int ret = 0;
  1227. if ((ret = connect_ns(&leader, &port)) < 0)
  1228. goto out;
  1229. if (cur_process.vmid == leader)
  1230. goto out;
  1231. struct shim_ipc_msg_obj * msg = create_ipc_msg_duplex_on_stack(
  1232. NS_CODE(QUERYALL), 0, leader);
  1233. debug("ipc send to %u: " NS_CODE_STR(QUERYALL) "\n", leader);
  1234. ret = do_ipc_duplex(msg, port, NULL, NULL);
  1235. put_ipc_port(port);
  1236. out:
  1237. SAVE_PROFILE_INTERVAL(NS_SEND(queryall));
  1238. return ret;
  1239. }
  1240. int NS_CALLBACK(queryall) (IPC_CALLBACK_ARGS)
  1241. {
  1242. BEGIN_PROFILE_INTERVAL();
  1243. debug("ipc callback from %u: " NS_CODE_STR(QUERYALL) "\n", msg->src);
  1244. LISTP_TYPE(range) * list = &offered_ranges;
  1245. struct range * r;
  1246. int ret;
  1247. lock(range_map_lock);
  1248. int maxanswers = nowned + noffered + nsubed;
  1249. int nanswers = 0, nowners = 0, i;
  1250. struct ipc_ns_offered * answers =
  1251. __alloca(sizeof(struct ipc_ns_offered) * maxanswers);
  1252. struct ipc_ns_client ** ownerdata =
  1253. __alloca(sizeof(struct ipc_ns_client *) * maxanswers);
  1254. int * ownerdatasz = __alloca(sizeof(int) * maxanswers);
  1255. int owner_offset = 0;
  1256. retry:
  1257. listp_for_each_entry (r, list, list) {
  1258. struct shim_ipc_info * p = r->owner;
  1259. int datasz = sizeof(struct ipc_ns_client) + p->uri.len;
  1260. struct ipc_ns_client * owner = __alloca(datasz);
  1261. assert(!qstrempty(&p->uri));
  1262. owner->vmid = p->vmid;
  1263. memcpy(owner->uri, qstrgetstr(&p->uri), p->uri.len + 1);
  1264. IDTYPE base = r->offset * RANGE_SIZE + 1;
  1265. answers[nanswers].base = base;
  1266. answers[nanswers].size = RANGE_SIZE;
  1267. answers[nanswers].lease = r->lease;
  1268. answers[nanswers].owner_offset = owner_offset;
  1269. nanswers++;
  1270. ownerdata[nowners] = owner;
  1271. ownerdatasz[nowners] = datasz;
  1272. nowners++;
  1273. owner_offset += datasz;
  1274. if (!r->subranges)
  1275. continue;
  1276. for (i = 0 ; i < RANGE_SIZE ; i++) {
  1277. if (!r->subranges->map[i])
  1278. continue;
  1279. struct subrange * s = r->subranges->map[i];
  1280. p = s->owner;
  1281. datasz = sizeof(struct ipc_ns_client) + p->uri.len;
  1282. owner = __alloca(datasz);
  1283. assert(!qstrempty(&p->uri));
  1284. owner->vmid = p->vmid;
  1285. memcpy(owner->uri, qstrgetstr(&p->uri), p->uri.len + 1);
  1286. answers[nanswers].base = base + i;
  1287. answers[nanswers].size = 1;
  1288. answers[nanswers].lease = s->lease;
  1289. answers[nanswers].owner_offset = owner_offset;
  1290. nanswers++;
  1291. ownerdata[nowners] = owner;
  1292. ownerdatasz[nowners] = datasz;
  1293. nowners++;
  1294. owner_offset += datasz;
  1295. }
  1296. }
  1297. if (list == &offered_ranges) {
  1298. list = &owned_ranges;
  1299. goto retry;
  1300. }
  1301. unlock(range_map_lock);
  1302. ret = NS_SEND(answer)(port, msg->src, nanswers, answers, nowners,
  1303. ownerdata, ownerdatasz, msg->seq);
  1304. SAVE_PROFILE_INTERVAL(NS_CALLBACK(queryall));
  1305. return ret;
  1306. }
  1307. DEFINE_PROFILE_INTERVAL(NS_SEND(answer), ipc);
  1308. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(answer), ipc);
  1309. int NS_SEND(answer) (struct shim_ipc_port * port, IDTYPE dest,
  1310. int nanswers, struct ipc_ns_offered * answers,
  1311. int nowners, struct ipc_ns_client ** ownerdata,
  1312. int * ownerdatasz, unsigned long seq)
  1313. {
  1314. BEGIN_PROFILE_INTERVAL();
  1315. int owner_offset = sizeof(NS_MSG_TYPE(answer)) +
  1316. sizeof(struct ipc_ns_offered) * nanswers;
  1317. int total_ownerdatasz = 0;
  1318. for (int i = 0 ; i < nowners ; i++)
  1319. total_ownerdatasz += ownerdatasz[i];
  1320. struct shim_ipc_msg * msg =
  1321. create_ipc_msg_on_stack(NS_CODE(ANSWER),
  1322. owner_offset + total_ownerdatasz, dest);
  1323. NS_MSG_TYPE(answer) * msgin = (void *) &msg->msg;
  1324. msgin->nanswers = nanswers;
  1325. for (int i = 0 ; i < nanswers ; i++) {
  1326. msgin->answers[i] = answers[i];
  1327. msgin->answers[i].owner_offset += owner_offset;
  1328. }
  1329. for (int i = 0 ; i < nowners ; i++) {
  1330. memcpy((void *) msgin + owner_offset, ownerdata[i], ownerdatasz[i]);
  1331. owner_offset += ownerdatasz[i];
  1332. }
  1333. msg->seq = seq;
  1334. if (nanswers == 1)
  1335. debug("ipc send to %u: " NS_CODE_STR(ANSWER) "([%u, %u])\n", dest,
  1336. answers[0].base, answers[0].size);
  1337. else if (nanswers)
  1338. debug("ipc send to %u: " NS_CODE_STR(ANSWER) "([%u, %u], ...)\n", dest,
  1339. answers[0].base, answers[0].size);
  1340. int ret = send_ipc_message(msg, port);
  1341. SAVE_PROFILE_INTERVAL(NS_SEND(answer));
  1342. return ret;
  1343. }
  1344. int NS_CALLBACK(answer) (IPC_CALLBACK_ARGS)
  1345. {
  1346. BEGIN_PROFILE_INTERVAL();
  1347. NS_MSG_TYPE(answer) * msgin = (void *) &msg->msg;
  1348. if (msgin->nanswers == 1)
  1349. debug("ipc callback from %u: " NS_CODE_STR(ANSWER) "([%u, %u])\n",
  1350. msg->src, msgin->answers[0].base, msgin->answers[0].size);
  1351. else if (msgin->nanswers)
  1352. debug("ipc callback from %u: " NS_CODE_STR(ANSWER) "([%u, %u], ...)\n",
  1353. msg->src, msgin->answers[0].base, msgin->answers[0].size);
  1354. for (int i = 0 ; i < msgin->nanswers ; i++) {
  1355. struct ipc_ns_offered * ans = &msgin->answers[i];
  1356. struct ipc_ns_client * owner = (void *) msgin + ans->owner_offset;
  1357. switch (ans->size) {
  1358. case RANGE_SIZE:
  1359. CONCAT3(add, NS, range)(ans->base, owner->vmid, owner->uri,
  1360. ans->lease);
  1361. break;
  1362. case 1:
  1363. CONCAT3(add, NS, subrange)(ans->base, owner->vmid, owner->uri,
  1364. &ans->lease);
  1365. break;
  1366. default:
  1367. break;
  1368. }
  1369. }
  1370. struct shim_ipc_msg_obj * obj = find_ipc_msg_duplex(port, msg->seq);
  1371. if (obj && obj->thread)
  1372. thread_wakeup(obj->thread);
  1373. SAVE_PROFILE_INTERVAL(NS_CALLBACK(answer));
  1374. return 0;
  1375. }
  1376. #ifdef NS_KEY
  1377. #define KEY_HASH_LEN 8
  1378. #define KEY_HASH_NUM (1 << KEY_HASH_LEN)
  1379. #define KEY_HASH_MASK (KEY_HASH_NUM - 1)
  1380. DEFINE_LIST(key);
  1381. struct key {
  1382. NS_KEY key;
  1383. IDTYPE id;
  1384. LIST_TYPE(key) hlist;
  1385. };
  1386. DEFINE_LISTP(key);
  1387. static LISTP_TYPE(key) key_map [KEY_HASH_NUM];
  1388. int CONCAT2(NS, add_key) (NS_KEY * key, IDTYPE id)
  1389. {
  1390. LISTP_TYPE(key) * head = &key_map[KEY_HASH(key) & KEY_HASH_MASK];
  1391. struct key * k;
  1392. int ret = -EEXIST;
  1393. lock(range_map_lock);
  1394. listp_for_each_entry(k, head, hlist)
  1395. if (!KEY_COMP(&k->key, key))
  1396. goto out;
  1397. k = malloc(sizeof(struct key));
  1398. if (!k) {
  1399. ret = -ENOMEM;
  1400. goto out;
  1401. }
  1402. KEY_COPY(&k->key, key);
  1403. k->id = id;
  1404. INIT_LIST_HEAD(k, hlist);
  1405. listp_add(k, head, hlist);
  1406. debug("add key/id pair (%u, %u) to hash list: %p\n",
  1407. KEY_HASH(key), id, head);
  1408. ret = 0;
  1409. out:
  1410. unlock(range_map_lock);
  1411. return ret;
  1412. }
  1413. int CONCAT2(NS, get_key) (NS_KEY * key, bool delete)
  1414. {
  1415. LISTP_TYPE(key) * head = &key_map[KEY_HASH(key) & KEY_HASH_MASK];
  1416. struct key * k;
  1417. int id = -ENOENT;
  1418. lock(range_map_lock);
  1419. listp_for_each_entry(k, head, hlist)
  1420. if (!KEY_COMP(&k->key, key)) {
  1421. id = k->id;
  1422. if (delete) {
  1423. listp_del(k, head, hlist);
  1424. free(k);
  1425. }
  1426. break;
  1427. }
  1428. unlock(range_map_lock);
  1429. return id;
  1430. }
  1431. DEFINE_PROFILE_INTERVAL(NS_SEND(findkey), ipc);
  1432. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(findkey), ipc);
  1433. int NS_SEND(findkey) (NS_KEY * key)
  1434. {
  1435. BEGIN_PROFILE_INTERVAL();
  1436. int ret = 0;
  1437. ret = CONCAT2(NS, get_key) (key, false);
  1438. if (!ret)
  1439. goto out;
  1440. IDTYPE dest;
  1441. struct shim_ipc_port * port = NULL;
  1442. if ((ret = connect_ns(&dest, &port)) < 0)
  1443. goto out;
  1444. if (dest == cur_process.vmid) {
  1445. ret = -ENOENT;
  1446. goto out;
  1447. }
  1448. struct shim_ipc_msg_obj * msg = create_ipc_msg_duplex_on_stack(
  1449. NS_CODE(FINDKEY),
  1450. sizeof(NS_MSG_TYPE(findkey)),
  1451. dest);
  1452. NS_MSG_TYPE(findkey) * msgin = (void *) &msg->msg.msg;
  1453. KEY_COPY(&msgin->key, key);
  1454. debug("ipc send to %u: " NS_CODE_STR(FINDKEY) "(%u)\n",
  1455. dest, KEY_HASH(key));
  1456. ret = do_ipc_duplex(msg, port, NULL, NULL);
  1457. put_ipc_port(port);
  1458. if (!ret)
  1459. ret = CONCAT2(NS, get_key) (key, false);
  1460. out:
  1461. SAVE_PROFILE_INTERVAL(NS_SEND(findkey));
  1462. return ret;
  1463. }
  1464. int NS_CALLBACK(findkey) (IPC_CALLBACK_ARGS)
  1465. {
  1466. BEGIN_PROFILE_INTERVAL();
  1467. int ret = 0;
  1468. NS_MSG_TYPE(findkey) * msgin = (void *) &msg->msg;
  1469. debug("ipc callback from %u: " NS_CODE_STR(FINDKEY) "(%u)\n",
  1470. msg->src, KEY_HASH(&msgin->key));
  1471. ret = CONCAT2(NS, get_key)(&msgin->key, false);
  1472. if (ret < 0)
  1473. goto out;
  1474. ret = NS_SEND(tellkey)(port, msg->src, &msgin->key, ret, msg->seq);
  1475. out:
  1476. SAVE_PROFILE_INTERVAL(NS_CALLBACK(findkey));
  1477. return ret;
  1478. }
  1479. DEFINE_PROFILE_INTERVAL(NS_SEND(tellkey), ipc);
  1480. DEFINE_PROFILE_INTERVAL(NS_CALLBACK(tellkey), ipc);
  1481. int NS_SEND(tellkey) (struct shim_ipc_port * port, IDTYPE dest, NS_KEY * key,
  1482. IDTYPE id, unsigned long seq)
  1483. {
  1484. BEGIN_PROFILE_INTERVAL();
  1485. bool owned = true;
  1486. int ret = 0;
  1487. if (!dest) {
  1488. if ((ret = CONCAT2(NS, add_key)(key, id)) < 0)
  1489. goto out;
  1490. if ((ret = connect_ns(&dest, &port)) < 0)
  1491. goto out;
  1492. if (dest == cur_process.vmid)
  1493. goto out;
  1494. owned = false;
  1495. }
  1496. if (owned) {
  1497. struct shim_ipc_msg * msg = create_ipc_msg_on_stack(
  1498. NS_CODE(TELLKEY),
  1499. sizeof(NS_MSG_TYPE(tellkey)),
  1500. dest);
  1501. NS_MSG_TYPE(tellkey) * msgin = (void *) &msg->msg;
  1502. KEY_COPY(&msgin->key, key);
  1503. msgin->id = id;
  1504. msg->seq = seq;
  1505. debug("ipc send to %u: IPC_SYSV_TELLKEY(%u, %u)\n", dest,
  1506. KEY_HASH(key), id);
  1507. ret = send_ipc_message(msg, port);
  1508. goto out;
  1509. }
  1510. struct shim_ipc_msg_obj * msg = create_ipc_msg_duplex_on_stack(
  1511. NS_CODE(TELLKEY),
  1512. sizeof(NS_MSG_TYPE(tellkey)),
  1513. dest);
  1514. NS_MSG_TYPE(tellkey) * msgin = (void *) &msg->msg.msg;
  1515. KEY_COPY(&msgin->key, key);
  1516. msgin->id = id;
  1517. debug("ipc send to %u: IPC_SYSV_TELLKEY(%u, %u)\n", dest,
  1518. KEY_HASH(key), id);
  1519. ret = do_ipc_duplex(msg, port, NULL, NULL);
  1520. put_ipc_port(port);
  1521. out:
  1522. SAVE_PROFILE_INTERVAL(NS_SEND(tellkey));
  1523. return ret;
  1524. }
  1525. int NS_CALLBACK(tellkey) (IPC_CALLBACK_ARGS)
  1526. {
  1527. BEGIN_PROFILE_INTERVAL();
  1528. int ret = 0;
  1529. NS_MSG_TYPE(tellkey) * msgin = (void *) &msg->msg;
  1530. debug("ipc callback from %u: " NS_CODE_STR(TELLKEY) "(%u, %u)\n",
  1531. msg->src, KEY_HASH(&msgin->key), msgin->id);
  1532. ret = CONCAT2(NS, add_key)(&msgin->key, msgin->id);
  1533. struct shim_ipc_msg_obj * obj = find_ipc_msg_duplex(port, msg->seq);
  1534. if (!obj) {
  1535. ret = RESPONSE_CALLBACK;
  1536. goto out;
  1537. }
  1538. if (obj->thread)
  1539. thread_wakeup(obj->thread);
  1540. out:
  1541. SAVE_PROFILE_INTERVAL(ipc_sysv_tellkey_callback);
  1542. return ret;
  1543. }
  1544. #endif /* NS_KEY */