page.c 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516
  1. #include "u.h"
  2. #include "../port/lib.h"
  3. #include "mem.h"
  4. #include "dat.h"
  5. #include "fns.h"
  6. #include "../port/error.h"
  7. #define pghash(daddr) palloc.hash[(daddr>>PGSHIFT)&(PGHSIZE-1)]
  8. struct Palloc palloc;
  9. void
  10. pageinit(void)
  11. {
  12. int color;
  13. Page *p;
  14. ulong np, vm, pm;
  15. np = palloc.np0+palloc.np1;
  16. palloc.head = xalloc(np*sizeof(Page));
  17. if(palloc.head == 0)
  18. panic("pageinit");
  19. color = 0;
  20. p = palloc.head;
  21. while(palloc.np0 > 0) {
  22. p->prev = p-1;
  23. p->next = p+1;
  24. p->pa = palloc.p0;
  25. p->color = color;
  26. palloc.freecount++;
  27. color = (color+1)%NCOLOR;
  28. palloc.p0 += BY2PG;
  29. palloc.np0--;
  30. p++;
  31. }
  32. while(palloc.np1 > 0) {
  33. p->prev = p-1;
  34. p->next = p+1;
  35. p->pa = palloc.p1;
  36. p->color = color;
  37. palloc.freecount++;
  38. color = (color+1)%NCOLOR;
  39. palloc.p1 += BY2PG;
  40. palloc.np1--;
  41. p++;
  42. }
  43. palloc.tail = p - 1;
  44. palloc.head->prev = 0;
  45. palloc.tail->next = 0;
  46. palloc.user = p - palloc.head;
  47. pm = palloc.user*BY2PG/1024;
  48. vm = pm + (conf.nswap*BY2PG)/1024;
  49. /* Pageing numbers */
  50. swapalloc.highwater = (palloc.user*5)/100;
  51. swapalloc.headroom = swapalloc.highwater + (swapalloc.highwater/4);
  52. print("%lud free pages, ", palloc.user);
  53. print("%ludK bytes, ", pm);
  54. print("%ludK swap\n", vm);
  55. }
  56. static void
  57. pageunchain(Page *p)
  58. {
  59. if(canlock(&palloc))
  60. panic("pageunchain");
  61. if(p->prev)
  62. p->prev->next = p->next;
  63. else
  64. palloc.head = p->next;
  65. if(p->next)
  66. p->next->prev = p->prev;
  67. else
  68. palloc.tail = p->prev;
  69. p->prev = p->next = nil;
  70. palloc.freecount--;
  71. }
  72. void
  73. pagechaintail(Page *p)
  74. {
  75. if(canlock(&palloc))
  76. panic("pagechaintail");
  77. if(palloc.tail) {
  78. p->prev = palloc.tail;
  79. palloc.tail->next = p;
  80. }
  81. else {
  82. palloc.head = p;
  83. p->prev = 0;
  84. }
  85. palloc.tail = p;
  86. p->next = 0;
  87. palloc.freecount++;
  88. }
  89. void
  90. pagechainhead(Page *p)
  91. {
  92. if(canlock(&palloc))
  93. panic("pagechainhead");
  94. if(palloc.head) {
  95. p->next = palloc.head;
  96. palloc.head->prev = p;
  97. }
  98. else {
  99. palloc.tail = p;
  100. p->next = 0;
  101. }
  102. palloc.head = p;
  103. p->prev = 0;
  104. palloc.freecount++;
  105. }
  106. Page*
  107. newpage(int clear, Segment **s, ulong va)
  108. {
  109. Page *p;
  110. KMap *k;
  111. uchar ct;
  112. int i, hw, dontalloc, color;
  113. lock(&palloc);
  114. color = getpgcolor(va);
  115. hw = swapalloc.highwater;
  116. for(;;) {
  117. if(palloc.freecount > hw)
  118. break;
  119. if(up->kp && palloc.freecount > 0)
  120. break;
  121. unlock(&palloc);
  122. dontalloc = 0;
  123. if(s && *s) {
  124. qunlock(&((*s)->lk));
  125. *s = 0;
  126. dontalloc = 1;
  127. }
  128. qlock(&palloc.pwait); /* Hold memory requesters here */
  129. while(waserror()) /* Ignore interrupts */
  130. ;
  131. kickpager();
  132. tsleep(&palloc.r, ispages, 0, 1000);
  133. poperror();
  134. qunlock(&palloc.pwait);
  135. /*
  136. * If called from fault and we lost the segment from
  137. * underneath don't waste time allocating and freeing
  138. * a page. Fault will call newpage again when it has
  139. * reacquired the segment locks
  140. */
  141. if(dontalloc)
  142. return 0;
  143. lock(&palloc);
  144. }
  145. /* First try for our colour */
  146. for(p = palloc.head; p; p = p->next)
  147. if(p->color == color)
  148. break;
  149. ct = PG_NOFLUSH;
  150. if(p == 0) {
  151. p = palloc.head;
  152. p->color = color;
  153. ct = PG_NEWCOL;
  154. }
  155. pageunchain(p);
  156. lock(p);
  157. if(p->ref != 0)
  158. panic("newpage");
  159. uncachepage(p);
  160. p->ref++;
  161. p->va = va;
  162. p->modref = 0;
  163. for(i = 0; i < MAXMACH; i++)
  164. p->cachectl[i] = ct;
  165. unlock(p);
  166. unlock(&palloc);
  167. if(clear) {
  168. k = kmap(p);
  169. memset((void*)VA(k), 0, BY2PG);
  170. kunmap(k);
  171. }
  172. return p;
  173. }
  174. int
  175. ispages(void*)
  176. {
  177. return palloc.freecount >= swapalloc.highwater;
  178. }
  179. void
  180. putpage(Page *p)
  181. {
  182. if(onswap(p)) {
  183. putswap(p);
  184. return;
  185. }
  186. lock(&palloc);
  187. lock(p);
  188. if(p->ref == 0)
  189. panic("putpage");
  190. if(--p->ref > 0) {
  191. unlock(p);
  192. unlock(&palloc);
  193. return;
  194. }
  195. if(p->image && p->image != &swapimage)
  196. pagechaintail(p);
  197. else
  198. pagechainhead(p);
  199. if(palloc.r.p != 0)
  200. wakeup(&palloc.r);
  201. unlock(p);
  202. unlock(&palloc);
  203. }
  204. Page*
  205. auxpage()
  206. {
  207. Page *p;
  208. lock(&palloc);
  209. p = palloc.head;
  210. if(palloc.freecount < swapalloc.highwater) {
  211. unlock(&palloc);
  212. return 0;
  213. }
  214. pageunchain(p);
  215. lock(p);
  216. if(p->ref != 0)
  217. panic("auxpage");
  218. p->ref++;
  219. uncachepage(p);
  220. unlock(p);
  221. unlock(&palloc);
  222. return p;
  223. }
  224. void
  225. duppage(Page *p) /* Always call with p locked */
  226. {
  227. Page *np;
  228. int color;
  229. int retries;
  230. retries = 0;
  231. retry:
  232. if(retries++ > 10000)
  233. panic("duppage %d", retries);
  234. /* don't dup pages with no image */
  235. if(p->ref == 0 || p->image == nil || p->image->notext)
  236. return;
  237. /*
  238. * normal lock ordering is to call
  239. * lock(&palloc) before lock(p).
  240. * To avoid deadlock, we have to drop
  241. * our locks and try again.
  242. */
  243. if(!canlock(&palloc)){
  244. unlock(p);
  245. if(up)
  246. sched();
  247. lock(p);
  248. goto retry;
  249. }
  250. /* No freelist cache when memory is very low */
  251. if(palloc.freecount < swapalloc.highwater) {
  252. unlock(&palloc);
  253. uncachepage(p);
  254. return;
  255. }
  256. color = getpgcolor(p->va);
  257. for(np = palloc.head; np; np = np->next)
  258. if(np->color == color)
  259. break;
  260. /* No page of the correct color */
  261. if(np == 0) {
  262. unlock(&palloc);
  263. uncachepage(p);
  264. return;
  265. }
  266. pageunchain(np);
  267. pagechaintail(np);
  268. lock(np);
  269. unlock(&palloc);
  270. /* Cache the new version */
  271. uncachepage(np);
  272. np->va = p->va;
  273. np->daddr = p->daddr;
  274. copypage(p, np);
  275. cachepage(np, p->image);
  276. unlock(np);
  277. uncachepage(p);
  278. }
  279. void
  280. copypage(Page *f, Page *t)
  281. {
  282. KMap *ks, *kd;
  283. ks = kmap(f);
  284. kd = kmap(t);
  285. memmove((void*)VA(kd), (void*)VA(ks), BY2PG);
  286. kunmap(ks);
  287. kunmap(kd);
  288. }
  289. void
  290. uncachepage(Page *p) /* Always called with a locked page */
  291. {
  292. Page **l, *f;
  293. if(p->image == 0)
  294. return;
  295. lock(&palloc.hashlock);
  296. l = &pghash(p->daddr);
  297. for(f = *l; f; f = f->hash) {
  298. if(f == p) {
  299. *l = p->hash;
  300. break;
  301. }
  302. l = &f->hash;
  303. }
  304. unlock(&palloc.hashlock);
  305. putimage(p->image);
  306. p->image = 0;
  307. p->daddr = 0;
  308. }
  309. void
  310. cachepage(Page *p, Image *i)
  311. {
  312. Page **l;
  313. /* If this ever happens it should be fixed by calling
  314. * uncachepage instead of panic. I think there is a race
  315. * with pio in which this can happen. Calling uncachepage is
  316. * correct - I just wanted to see if we got here.
  317. */
  318. if(p->image)
  319. panic("cachepage");
  320. incref(i);
  321. lock(&palloc.hashlock);
  322. p->image = i;
  323. l = &pghash(p->daddr);
  324. p->hash = *l;
  325. *l = p;
  326. unlock(&palloc.hashlock);
  327. }
  328. void
  329. cachedel(Image *i, ulong daddr)
  330. {
  331. Page *f, **l;
  332. lock(&palloc.hashlock);
  333. l = &pghash(daddr);
  334. for(f = *l; f; f = f->hash) {
  335. if(f->image == i && f->daddr == daddr) {
  336. lock(f);
  337. if(f->image == i && f->daddr == daddr){
  338. *l = f->hash;
  339. putimage(f->image);
  340. f->image = 0;
  341. f->daddr = 0;
  342. }
  343. unlock(f);
  344. break;
  345. }
  346. l = &f->hash;
  347. }
  348. unlock(&palloc.hashlock);
  349. }
  350. Page *
  351. lookpage(Image *i, ulong daddr)
  352. {
  353. Page *f;
  354. lock(&palloc.hashlock);
  355. for(f = pghash(daddr); f; f = f->hash) {
  356. if(f->image == i && f->daddr == daddr) {
  357. unlock(&palloc.hashlock);
  358. lock(&palloc);
  359. lock(f);
  360. if(f->image != i || f->daddr != daddr) {
  361. unlock(f);
  362. unlock(&palloc);
  363. return 0;
  364. }
  365. if(++f->ref == 1)
  366. pageunchain(f);
  367. unlock(&palloc);
  368. unlock(f);
  369. return f;
  370. }
  371. }
  372. unlock(&palloc.hashlock);
  373. return 0;
  374. }
  375. Pte*
  376. ptecpy(Pte *old)
  377. {
  378. Pte *new;
  379. Page **src, **dst;
  380. new = ptealloc();
  381. dst = &new->pages[old->first-old->pages];
  382. new->first = dst;
  383. for(src = old->first; src <= old->last; src++, dst++)
  384. if(*src) {
  385. if(onswap(*src))
  386. dupswap(*src);
  387. else {
  388. lock(*src);
  389. (*src)->ref++;
  390. unlock(*src);
  391. }
  392. new->last = dst;
  393. *dst = *src;
  394. }
  395. return new;
  396. }
  397. Pte*
  398. ptealloc(void)
  399. {
  400. Pte *new;
  401. new = smalloc(sizeof(Pte));
  402. new->first = &new->pages[PTEPERTAB];
  403. new->last = new->pages;
  404. return new;
  405. }
  406. void
  407. freepte(Segment *s, Pte *p)
  408. {
  409. int ref;
  410. void (*fn)(Page*);
  411. Page *pt, **pg, **ptop;
  412. switch(s->type&SG_TYPE) {
  413. case SG_PHYSICAL:
  414. fn = s->pseg->pgfree;
  415. ptop = &p->pages[PTEPERTAB];
  416. if(fn) {
  417. for(pg = p->pages; pg < ptop; pg++) {
  418. if(*pg == 0)
  419. continue;
  420. (*fn)(*pg);
  421. *pg = 0;
  422. }
  423. break;
  424. }
  425. for(pg = p->pages; pg < ptop; pg++) {
  426. pt = *pg;
  427. if(pt == 0)
  428. continue;
  429. lock(pt);
  430. ref = --pt->ref;
  431. unlock(pt);
  432. if(ref == 0)
  433. free(pt);
  434. }
  435. break;
  436. default:
  437. for(pg = p->first; pg <= p->last; pg++)
  438. if(*pg) {
  439. putpage(*pg);
  440. *pg = 0;
  441. }
  442. }
  443. free(p);
  444. }