plan9.c 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610
  1. #include <u.h>
  2. #include <libc.h>
  3. #include <venti.h>
  4. enum
  5. {
  6. QueuingW, /* queuing for write lock */
  7. QueuingR, /* queuing for read lock */
  8. };
  9. typedef struct Thread Thread;
  10. struct Thread {
  11. int pid;
  12. int ref;
  13. char *error;
  14. int state;
  15. Thread *next;
  16. };
  17. struct VtLock {
  18. Lock lk;
  19. Thread *writer; /* thread writering write lock */
  20. int readers; /* number writering read lock */
  21. Thread *qfirst;
  22. Thread *qlast;
  23. };
  24. struct VtRendez {
  25. VtLock *lk;
  26. Thread *wfirst;
  27. Thread *wlast;
  28. };
  29. enum {
  30. ERROR = 0,
  31. };
  32. enum {
  33. IdealAlignment = 32,
  34. ChunkSize = 128*1024,
  35. };
  36. static Thread **vtRock;
  37. static void vtThreadInit(void);
  38. static void threadSleep(Thread*);
  39. static void threadWakeup(Thread*);
  40. int
  41. vtThread(void (*f)(void*), void *rock)
  42. {
  43. int tid;
  44. tid = rfork(RFNOWAIT|RFMEM|RFPROC);
  45. switch(tid){
  46. case -1:
  47. vtOSError();
  48. return -1;
  49. case 0:
  50. break;
  51. default:
  52. return tid;
  53. }
  54. vtAttach();
  55. (*f)(rock);
  56. vtDetach();
  57. _exits(0);
  58. return 0;
  59. }
  60. static Thread *
  61. threadLookup(void)
  62. {
  63. return *vtRock;
  64. }
  65. void
  66. vtAttach(void)
  67. {
  68. int pid;
  69. Thread *p;
  70. static int init;
  71. static Lock lk;
  72. lock(&lk);
  73. if(!init) {
  74. rfork(RFREND);
  75. vtThreadInit();
  76. init = 1;
  77. }
  78. unlock(&lk);
  79. pid = getpid();
  80. p = *vtRock;
  81. if(p != nil && p->pid == pid) {
  82. p->ref++;
  83. return;
  84. }
  85. p = vtMemAllocZ(sizeof(Thread));
  86. p->ref = 1;
  87. p->pid = pid;
  88. *vtRock = p;
  89. }
  90. void
  91. vtDetach(void)
  92. {
  93. Thread *p;
  94. p = *vtRock;
  95. assert(p != nil);
  96. p->ref--;
  97. if(p->ref == 0) {
  98. vtMemFree(p->error);
  99. vtMemFree(p);
  100. *vtRock = nil;
  101. }
  102. }
  103. char *
  104. vtGetError(void)
  105. {
  106. char *s;
  107. if(ERROR)
  108. fprint(2, "vtGetError: %s\n", threadLookup()->error);
  109. s = threadLookup()->error;
  110. if(s == nil)
  111. return "unknown error";
  112. return s;
  113. }
  114. char*
  115. vtSetError(char* fmt, ...)
  116. {
  117. Thread *p;
  118. char *s;
  119. va_list args;
  120. p = threadLookup();
  121. va_start(args, fmt);
  122. s = vsmprint(fmt, args);
  123. vtMemFree(p->error);
  124. p->error = s;
  125. va_end(args);
  126. if(ERROR)
  127. fprint(2, "vtSetError: %s\n", p->error);
  128. werrstr("%s", p->error);
  129. return p->error;
  130. }
  131. char *
  132. vtOSError(void)
  133. {
  134. Thread *p = threadLookup();
  135. char s[100];
  136. rerrstr(s, sizeof(s));
  137. vtMemFree(p->error);
  138. p->error = vtStrDup(s);
  139. if(ERROR)
  140. fprint(2, "vtOSError: %s\n", s);
  141. return p->error;
  142. }
  143. int
  144. vtFdRead(int fd, uchar *buf, int n)
  145. {
  146. n = read(fd, buf, n);
  147. if(n < 0) {
  148. vtOSError();
  149. return -1;
  150. }
  151. if(n == 0) {
  152. vtSetError("unexpected EOF");
  153. return 0;
  154. }
  155. return n;
  156. }
  157. int
  158. vtFdWrite(int fd, uchar *buf, int n)
  159. {
  160. int nn;
  161. nn = write(fd, buf, n);
  162. if(nn < 0) {
  163. vtOSError();
  164. return 0;
  165. }
  166. if(n != nn) {
  167. vtSetError("truncated write");
  168. return 0;
  169. }
  170. return 1;
  171. }
  172. void
  173. vtFdClose(int fd)
  174. {
  175. close(fd);
  176. }
  177. static void
  178. vtThreadInit(void)
  179. {
  180. static Lock lk;
  181. lock(&lk);
  182. if(vtRock != nil) {
  183. unlock(&lk);
  184. return;
  185. }
  186. vtRock = privalloc();
  187. if(vtRock == nil)
  188. vtFatal("can't allocate thread-private storage");
  189. unlock(&lk);
  190. }
  191. VtLock*
  192. vtLockAlloc(void)
  193. {
  194. return vtMemAllocZ(sizeof(VtLock));
  195. }
  196. void
  197. vtLockInit(VtLock **p)
  198. {
  199. static Lock lk;
  200. lock(&lk);
  201. if(*p != nil)
  202. *p = vtLockAlloc();
  203. unlock(&lk);
  204. }
  205. void
  206. vtLockFree(VtLock *p)
  207. {
  208. if(p == nil)
  209. return;
  210. assert(p->writer == nil);
  211. assert(p->readers == 0);
  212. assert(p->qfirst == nil);
  213. vtMemFree(p);
  214. }
  215. VtRendez*
  216. vtRendezAlloc(VtLock *p)
  217. {
  218. VtRendez *q;
  219. q = vtMemAllocZ(sizeof(VtRendez));
  220. q->lk = p;
  221. return q;
  222. }
  223. void
  224. vtRendezFree(VtRendez *q)
  225. {
  226. if(q == nil)
  227. return;
  228. assert(q->wfirst == nil);
  229. vtMemFree(q);
  230. }
  231. int
  232. vtCanLock(VtLock *p)
  233. {
  234. Thread *t;
  235. lock(&p->lk);
  236. t = *vtRock;
  237. if(p->writer == nil && p->readers == 0) {
  238. p->writer = t;
  239. unlock(&p->lk);
  240. return 1;
  241. }
  242. unlock(&p->lk);
  243. return 0;
  244. }
  245. void
  246. vtLock(VtLock *p)
  247. {
  248. Thread *t;
  249. lock(&p->lk);
  250. t = *vtRock;
  251. if(p->writer == nil && p->readers == 0) {
  252. p->writer = t;
  253. unlock(&p->lk);
  254. return;
  255. }
  256. /*
  257. * venti currently contains code that assume locks can be passed between threads :-(
  258. * assert(p->writer != t);
  259. */
  260. if(p->qfirst == nil)
  261. p->qfirst = t;
  262. else
  263. p->qlast->next = t;
  264. p->qlast = t;
  265. t->next = nil;
  266. t->state = QueuingW;
  267. unlock(&p->lk);
  268. threadSleep(t);
  269. assert(p->writer == t && p->readers == 0);
  270. }
  271. int
  272. vtCanRLock(VtLock *p)
  273. {
  274. lock(&p->lk);
  275. if(p->writer == nil && p->qfirst == nil) {
  276. p->readers++;
  277. unlock(&p->lk);
  278. return 1;
  279. }
  280. unlock(&p->lk);
  281. return 0;
  282. }
  283. void
  284. vtRLock(VtLock *p)
  285. {
  286. Thread *t;
  287. lock(&p->lk);
  288. t = *vtRock;
  289. if(p->writer == nil && p->qfirst == nil) {
  290. p->readers++;
  291. unlock(&p->lk);
  292. return;
  293. }
  294. /*
  295. * venti currently contains code that assumes locks can be passed between threads
  296. * assert(p->writer != t);
  297. */
  298. if(p->qfirst == nil)
  299. p->qfirst = t;
  300. else
  301. p->qlast->next = t;
  302. p->qlast = t;
  303. t->next = nil;
  304. t->state = QueuingR;
  305. unlock(&p->lk);
  306. threadSleep(t);
  307. assert(p->writer == nil && p->readers > 0);
  308. }
  309. void
  310. vtUnlock(VtLock *p)
  311. {
  312. Thread *t, *tt;
  313. lock(&p->lk);
  314. /*
  315. * venti currently has code that assumes lock can be passed between threads :-)
  316. * assert(p->writer == *vtRock);
  317. */
  318. assert(p->writer != nil);
  319. assert(p->readers == 0);
  320. t = p->qfirst;
  321. if(t == nil) {
  322. p->writer = nil;
  323. unlock(&p->lk);
  324. return;
  325. }
  326. if(t->state == QueuingW) {
  327. p->qfirst = t->next;
  328. p->writer = t;
  329. unlock(&p->lk);
  330. threadWakeup(t);
  331. return;
  332. }
  333. p->writer = nil;
  334. while(t != nil && t->state == QueuingR) {
  335. tt = t;
  336. t = t->next;
  337. p->readers++;
  338. threadWakeup(tt);
  339. }
  340. p->qfirst = t;
  341. unlock(&p->lk);
  342. }
  343. void
  344. vtRUnlock(VtLock *p)
  345. {
  346. Thread *t;
  347. lock(&p->lk);
  348. assert(p->writer == nil && p->readers > 0);
  349. p->readers--;
  350. t = p->qfirst;
  351. if(p->readers > 0 || t == nil) {
  352. unlock(&p->lk);
  353. return;
  354. }
  355. assert(t->state == QueuingW);
  356. p->qfirst = t->next;
  357. p->writer = t;
  358. unlock(&p->lk);
  359. threadWakeup(t);
  360. }
  361. int
  362. vtSleep(VtRendez *q)
  363. {
  364. Thread *s, *t, *tt;
  365. VtLock *p;
  366. p = q->lk;
  367. lock(&p->lk);
  368. s = *vtRock;
  369. /*
  370. * venti currently contains code that assume locks can be passed between threads :-(
  371. * assert(p->writer != s);
  372. */
  373. assert(p->writer != nil);
  374. assert(p->readers == 0);
  375. t = p->qfirst;
  376. if(t == nil) {
  377. p->writer = nil;
  378. } else if(t->state == QueuingW) {
  379. p->qfirst = t->next;
  380. p->writer = t;
  381. threadWakeup(t);
  382. } else {
  383. p->writer = nil;
  384. while(t != nil && t->state == QueuingR) {
  385. tt = t;
  386. t = t->next;
  387. p->readers++;
  388. threadWakeup(tt);
  389. }
  390. }
  391. if(q->wfirst == nil)
  392. q->wfirst = s;
  393. else
  394. q->wlast->next = s;
  395. q->wlast = s;
  396. s->next = nil;
  397. unlock(&p->lk);
  398. threadSleep(s);
  399. assert(p->writer == s);
  400. return 1;
  401. }
  402. int
  403. vtWakeup(VtRendez *q)
  404. {
  405. Thread *t;
  406. VtLock *p;
  407. /*
  408. * take off wait and put on front of queue
  409. * put on front so guys that have been waiting will not get starved
  410. */
  411. p = q->lk;
  412. lock(&p->lk);
  413. /*
  414. * venti currently has code that assumes lock can be passed between threads :-)
  415. * assert(p->writer == *vtRock);
  416. */
  417. assert(p->writer != nil);
  418. t = q->wfirst;
  419. if(t == nil) {
  420. unlock(&p->lk);
  421. return 0;
  422. }
  423. q->wfirst = t->next;
  424. if(p->qfirst == nil)
  425. p->qlast = t;
  426. t->next = p->qfirst;
  427. p->qfirst = t;
  428. t->state = QueuingW;
  429. unlock(&p->lk);
  430. return 1;
  431. }
  432. int
  433. vtWakeupAll(VtRendez *q)
  434. {
  435. int i;
  436. for(i=0; vtWakeup(q); i++)
  437. ;
  438. return i;
  439. }
  440. static void
  441. threadSleep(Thread *t)
  442. {
  443. if(rendezvous((ulong)t, 0x22bbdfd6) != 0x44391f14)
  444. sysfatal("threadSleep: rendezvous failed: %r");
  445. }
  446. static void
  447. threadWakeup(Thread *t)
  448. {
  449. if(rendezvous((ulong)t, 0x44391f14) != 0x22bbdfd6)
  450. sysfatal("threadWakeup: rendezvous failed: %r");
  451. }
  452. void
  453. vtMemFree(void *p)
  454. {
  455. if(p == 0)
  456. return;
  457. free(p);
  458. }
  459. void *
  460. vtMemAlloc(int size)
  461. {
  462. void *p;
  463. p = malloc(size);
  464. if(p == 0)
  465. vtFatal("vtMemAlloc: out of memory");
  466. return p;
  467. }
  468. void *
  469. vtMemAllocZ(int size)
  470. {
  471. void *p = vtMemAlloc(size);
  472. memset(p, 0, size);
  473. return p;
  474. }
  475. void *
  476. vtMemRealloc(void *p, int size)
  477. {
  478. if(p == nil)
  479. return vtMemAlloc(size);
  480. p = realloc(p, size);
  481. if(p == 0)
  482. vtFatal("vtRealloc: out of memory");
  483. return p;
  484. }
  485. void *
  486. vtMemBrk(int n)
  487. {
  488. static Lock lk;
  489. static uchar *buf;
  490. static int nbuf;
  491. static int nchunk;
  492. int align, pad;
  493. void *p;
  494. if(n >= IdealAlignment)
  495. align = IdealAlignment;
  496. else if(n > 8)
  497. align = 8;
  498. else
  499. align = 4;
  500. lock(&lk);
  501. pad = (align - (ulong)buf) & (align-1);
  502. if(n + pad > nbuf) {
  503. buf = vtMemAllocZ(ChunkSize);
  504. nbuf = ChunkSize;
  505. pad = (align - (ulong)buf) & (align-1);
  506. nchunk++;
  507. }
  508. assert(n + pad <= nbuf);
  509. p = buf + pad;
  510. buf += pad + n;
  511. nbuf -= pad + n;
  512. unlock(&lk);
  513. return p;
  514. }
  515. void
  516. vtThreadSetName(char *name)
  517. {
  518. int fd;
  519. char buf[32];
  520. sprint(buf, "/proc/%d/args", getpid());
  521. if((fd = open(buf, OWRITE)) >= 0){
  522. write(fd, name, strlen(name));
  523. close(fd);
  524. }
  525. }