iobuf.c 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235
  1. #include "all.h"
  2. #define DEBUG 0
  3. long niob;
  4. long nhiob;
  5. Hiob *hiob;
  6. Iobuf*
  7. getbuf(Device dev, long addr, int flag)
  8. {
  9. Iobuf *p, *s;
  10. Hiob *hp;
  11. long h;
  12. if(DEBUG)
  13. print("getbuf %D(%ld) f=%x\n", dev, addr, flag);
  14. h = addr +
  15. dev.type*1009L +
  16. dev.ctrl*10007L +
  17. dev.unit*100003L +
  18. dev.part*1000003L;
  19. if(h < 0)
  20. h = ~h;
  21. h %= nhiob;
  22. hp = &hiob[h];
  23. loop:
  24. lock(hp);
  25. /*
  26. * look for it in the active list
  27. */
  28. s = hp->link;
  29. for(p=s;;) {
  30. if(p->addr == addr && !devcmp(p->dev, dev)) {
  31. if(p != s) {
  32. p->back->fore = p->fore;
  33. p->fore->back = p->back;
  34. p->fore = s;
  35. p->back = s->back;
  36. s->back = p;
  37. p->back->fore = p;
  38. hp->link = p;
  39. }
  40. unlock(hp);
  41. qlock(p);
  42. if(p->addr != addr || devcmp(p->dev, dev)) {
  43. qunlock(p);
  44. goto loop;
  45. }
  46. p->flags |= flag;
  47. cons.bhit.count++;
  48. p->iobuf = p->xiobuf;
  49. return p;
  50. }
  51. p = p->fore;
  52. if(p == s)
  53. break;
  54. }
  55. if(flag & Bprobe) {
  56. unlock(hp);
  57. return 0;
  58. }
  59. /*
  60. * not found
  61. * take oldest unlocked entry in this queue
  62. */
  63. xloop:
  64. p = s->back;
  65. if(!canqlock(p)) {
  66. if(p == hp->link) {
  67. unlock(hp);
  68. print("iobuf all locked\n");
  69. goto loop;
  70. }
  71. s = p;
  72. goto xloop;
  73. }
  74. /*
  75. * its dangerous to flush the pseudo
  76. * devices since they recursively call
  77. * getbuf/putbuf. deadlock!
  78. */
  79. if(p->flags & Bres) {
  80. qunlock(p);
  81. if(p == hp->link) {
  82. unlock(hp);
  83. print("iobuf all resed\n");
  84. goto loop;
  85. }
  86. s = p;
  87. goto xloop;
  88. }
  89. if(p->flags & Bmod) {
  90. unlock(hp);
  91. if(!devwrite(p->dev, p->addr, p->xiobuf))
  92. p->flags &= ~(Bimm|Bmod);
  93. qunlock(p);
  94. goto loop;
  95. }
  96. hp->link = p;
  97. p->addr = addr;
  98. p->dev = dev;
  99. p->flags = flag;
  100. unlock(hp);
  101. p->iobuf = p->xiobuf;
  102. if(flag & Bread) {
  103. if(devread(p->dev, p->addr, p->iobuf)) {
  104. p->flags = 0;
  105. p->dev = devnone;
  106. p->addr = -1;
  107. p->iobuf = (char*)-1;
  108. qunlock(p);
  109. return 0;
  110. }
  111. cons.bread.count++;
  112. return p;
  113. }
  114. cons.binit.count++;
  115. return p;
  116. }
  117. /*
  118. * syncblock tries to put out a block per hashline
  119. * returns 0 all done,
  120. * returns 1 if it missed something
  121. */
  122. int
  123. syncblock(void)
  124. {
  125. Iobuf *p, *s, *q;
  126. Hiob *hp;
  127. long h;
  128. int flag;
  129. flag = 0;
  130. for(h=0; h<nhiob; h++) {
  131. q = 0;
  132. hp = &hiob[h];
  133. lock(hp);
  134. s = hp->link;
  135. for(p=s;;) {
  136. if(p->flags & Bmod) {
  137. if(q)
  138. flag = 1; /* more than 1 mod/line */
  139. q = p;
  140. }
  141. p = p->fore;
  142. if(p == s)
  143. break;
  144. }
  145. unlock(hp);
  146. if(q) {
  147. if(!canqlock(q)) {
  148. flag = 1; /* missed -- was locked */
  149. continue;
  150. }
  151. if(!(q->flags & Bmod)) {
  152. qunlock(q);
  153. continue;
  154. }
  155. if(!devwrite(q->dev, q->addr, q->xiobuf))
  156. q->flags &= ~(Bmod|Bimm);
  157. qunlock(q);
  158. }
  159. }
  160. return flag;
  161. }
  162. void
  163. sync(char *reason)
  164. {
  165. long i;
  166. print("sync: %s\n", reason);
  167. for(i=10*nhiob; i>0; i--)
  168. if(!syncblock())
  169. return;
  170. print("sync shorted\n");
  171. }
  172. void
  173. putbuf(Iobuf *p)
  174. {
  175. if(canqlock(p))
  176. print("buffer not locked %D(%ld)\n", p->dev, p->addr);
  177. if(p->flags & Bimm) {
  178. if(!(p->flags & Bmod))
  179. print("imm and no mod %D(%ld)\n", p->dev, p->addr);
  180. if(!devwrite(p->dev, p->addr, p->iobuf))
  181. p->flags &= ~(Bmod|Bimm);
  182. }
  183. p->iobuf = (char*)-1;
  184. qunlock(p);
  185. }
  186. int
  187. checktag(Iobuf *p, int tag, long qpath)
  188. {
  189. Tag *t;
  190. t = (Tag*)(p->iobuf+BUFSIZE);
  191. if(t->tag != tag) {
  192. if(1 || CHAT(0))
  193. print(" tag = %G; expected %G; addr = %lud\n",
  194. t->tag, tag, p->addr);
  195. return 2;
  196. }
  197. if(qpath != QPNONE) {
  198. qpath &= ~QPDIR;
  199. if(qpath != t->path) {
  200. if(qpath == (t->path&~QPDIR)) /* old bug */
  201. return 0;
  202. if(1 || CHAT(0))
  203. print(" tag/path = %lux; expected %G/%lux\n",
  204. t->path, tag, qpath);
  205. return 1;
  206. }
  207. }
  208. return 0;
  209. }
  210. void
  211. settag(Iobuf *p, int tag, long qpath)
  212. {
  213. Tag *t;
  214. t = (Tag*)(p->iobuf+BUFSIZE);
  215. t->tag = tag;
  216. if(qpath != QPNONE)
  217. t->path = qpath & ~QPDIR;
  218. p->flags |= Bmod;
  219. }