convM2S.c 5.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382
  1. #include <plan9.h>
  2. #include <fcall.h>
  3. static
  4. uchar*
  5. gstring(uchar *p, uchar *ep, char **s)
  6. {
  7. uint n;
  8. if(p+BIT16SZ > ep)
  9. return nil;
  10. n = GBIT16(p);
  11. p += BIT16SZ - 1;
  12. if(p+n+1 > ep)
  13. return nil;
  14. /* move it down, on top of count, to make room for '\0' */
  15. memmove(p, p + 1, n);
  16. p[n] = '\0';
  17. *s = (char*)p;
  18. p += n+1;
  19. return p;
  20. }
  21. static
  22. uchar*
  23. gqid(uchar *p, uchar *ep, Qid *q)
  24. {
  25. if(p+QIDSZ > ep)
  26. return nil;
  27. q->type = GBIT8(p);
  28. p += BIT8SZ;
  29. q->vers = GBIT32(p);
  30. p += BIT32SZ;
  31. q->path = GBIT64(p);
  32. p += BIT64SZ;
  33. return p;
  34. }
  35. /*
  36. * no syntactic checks.
  37. * three causes for error:
  38. * 1. message size field is incorrect
  39. * 2. input buffer too short for its own data (counts too long, etc.)
  40. * 3. too many names or qids
  41. * gqid() and gstring() return nil if they would reach beyond buffer.
  42. * main switch statement checks range and also can fall through
  43. * to test at end of routine.
  44. */
  45. uint
  46. convM2S(uchar *ap, uint nap, Fcall *f)
  47. {
  48. uchar *p, *ep;
  49. uint i, size;
  50. p = ap;
  51. ep = p + nap;
  52. if(p+BIT32SZ+BIT8SZ+BIT16SZ > ep)
  53. return 0;
  54. size = GBIT32(p);
  55. p += BIT32SZ;
  56. if(size > nap)
  57. return 0;
  58. if(size < BIT32SZ+BIT8SZ+BIT16SZ)
  59. return 0;
  60. f->type = GBIT8(p);
  61. p += BIT8SZ;
  62. f->tag = GBIT16(p);
  63. p += BIT16SZ;
  64. switch(f->type)
  65. {
  66. default:
  67. return 0;
  68. case Tversion:
  69. if(p+BIT32SZ > ep)
  70. return 0;
  71. f->msize = GBIT32(p);
  72. p += BIT32SZ;
  73. p = gstring(p, ep, &f->version);
  74. break;
  75. /*
  76. case Tsession:
  77. if(p+BIT16SZ > ep)
  78. return 0;
  79. f->nchal = GBIT16(p);
  80. p += BIT16SZ;
  81. if(p+f->nchal > ep)
  82. return 0;
  83. f->chal = p;
  84. p += f->nchal;
  85. break;
  86. */
  87. case Tflush:
  88. if(p+BIT16SZ > ep)
  89. return 0;
  90. f->oldtag = GBIT16(p);
  91. p += BIT16SZ;
  92. break;
  93. case Tauth:
  94. if(p+BIT32SZ > ep)
  95. return 0;
  96. f->afid = GBIT32(p);
  97. p += BIT32SZ;
  98. p = gstring(p, ep, &f->uname);
  99. if(p == nil)
  100. break;
  101. p = gstring(p, ep, &f->aname);
  102. if(p == nil)
  103. break;
  104. break;
  105. /*
  106. b
  107. case Tattach:
  108. if(p+BIT32SZ > ep)
  109. return 0;
  110. f->fid = GBIT32(p);
  111. p += BIT32SZ;
  112. p = gstring(p, ep, &f->uname);
  113. if(p == nil)
  114. break;
  115. p = gstring(p, ep, &f->aname);
  116. if(p == nil)
  117. break;
  118. if(p+BIT16SZ > ep)
  119. return 0;
  120. f->nauth = GBIT16(p);
  121. p += BIT16SZ;
  122. if(p+f->nauth > ep)
  123. return 0;
  124. f->auth = p;
  125. p += f->nauth;
  126. break;
  127. */
  128. case Tattach:
  129. if(p+BIT32SZ > ep)
  130. return 0;
  131. f->fid = GBIT32(p);
  132. p += BIT32SZ;
  133. if(p+BIT32SZ > ep)
  134. return 0;
  135. f->afid = GBIT32(p);
  136. p += BIT32SZ;
  137. p = gstring(p, ep, &f->uname);
  138. if(p == nil)
  139. break;
  140. p = gstring(p, ep, &f->aname);
  141. if(p == nil)
  142. break;
  143. break;
  144. case Twalk:
  145. if(p+BIT32SZ+BIT32SZ+BIT16SZ > ep)
  146. return 0;
  147. f->fid = GBIT32(p);
  148. p += BIT32SZ;
  149. f->newfid = GBIT32(p);
  150. p += BIT32SZ;
  151. f->nwname = GBIT16(p);
  152. p += BIT16SZ;
  153. if(f->nwname > MAXWELEM)
  154. return 0;
  155. for(i=0; i<f->nwname; i++){
  156. p = gstring(p, ep, &f->wname[i]);
  157. if(p == nil)
  158. break;
  159. }
  160. break;
  161. case Topen:
  162. if(p+BIT32SZ+BIT8SZ > ep)
  163. return 0;
  164. f->fid = GBIT32(p);
  165. p += BIT32SZ;
  166. f->mode = GBIT8(p);
  167. p += BIT8SZ;
  168. break;
  169. case Tcreate:
  170. if(p+BIT32SZ > ep)
  171. return 0;
  172. f->fid = GBIT32(p);
  173. p += BIT32SZ;
  174. p = gstring(p, ep, &f->name);
  175. if(p == nil)
  176. break;
  177. if(p+BIT32SZ+BIT8SZ > ep)
  178. return 0;
  179. f->perm = GBIT32(p);
  180. p += BIT32SZ;
  181. f->mode = GBIT8(p);
  182. p += BIT8SZ;
  183. break;
  184. case Tread:
  185. if(p+BIT32SZ+BIT64SZ+BIT32SZ > ep)
  186. return 0;
  187. f->fid = GBIT32(p);
  188. p += BIT32SZ;
  189. f->offset = GBIT64(p);
  190. p += BIT64SZ;
  191. f->count = GBIT32(p);
  192. p += BIT32SZ;
  193. break;
  194. case Twrite:
  195. if(p+BIT32SZ+BIT64SZ+BIT32SZ > ep)
  196. return 0;
  197. f->fid = GBIT32(p);
  198. p += BIT32SZ;
  199. f->offset = GBIT64(p);
  200. p += BIT64SZ;
  201. f->count = GBIT32(p);
  202. p += BIT32SZ;
  203. if(p+f->count > ep)
  204. return 0;
  205. f->data = (char*)p;
  206. p += f->count;
  207. break;
  208. case Tclunk:
  209. case Tremove:
  210. if(p+BIT32SZ > ep)
  211. return 0;
  212. f->fid = GBIT32(p);
  213. p += BIT32SZ;
  214. break;
  215. case Tstat:
  216. if(p+BIT32SZ > ep)
  217. return 0;
  218. f->fid = GBIT32(p);
  219. p += BIT32SZ;
  220. break;
  221. case Twstat:
  222. if(p+BIT32SZ+BIT16SZ > ep)
  223. return 0;
  224. f->fid = GBIT32(p);
  225. p += BIT32SZ;
  226. f->nstat = GBIT16(p);
  227. p += BIT16SZ;
  228. if(p+f->nstat > ep)
  229. return 0;
  230. f->stat = p;
  231. p += f->nstat;
  232. break;
  233. /*
  234. */
  235. case Rversion:
  236. if(p+BIT32SZ > ep)
  237. return 0;
  238. f->msize = GBIT32(p);
  239. p += BIT32SZ;
  240. p = gstring(p, ep, &f->version);
  241. break;
  242. /*
  243. case Rsession:
  244. if(p+BIT16SZ > ep)
  245. return 0;
  246. f->nchal = GBIT16(p);
  247. p += BIT16SZ;
  248. if(p+f->nchal > ep)
  249. return 0;
  250. f->chal = p;
  251. p += f->nchal;
  252. p = gstring(p, ep, &f->authid);
  253. if(p == nil)
  254. break;
  255. p = gstring(p, ep, &f->authdom);
  256. break;
  257. */
  258. case Rerror:
  259. p = gstring(p, ep, &f->ename);
  260. break;
  261. case Rflush:
  262. break;
  263. /*
  264. case Rattach:
  265. p = gqid(p, ep, &f->qid);
  266. if(p == nil)
  267. break;
  268. if(p+BIT16SZ > ep)
  269. return 0;
  270. f->nrauth = GBIT16(p);
  271. p += BIT16SZ;
  272. if(p+f->nrauth > ep)
  273. return 0;
  274. f->rauth = p;
  275. p += f->nrauth;
  276. break;
  277. */
  278. case Rattach:
  279. p = gqid(p, ep, &f->qid);
  280. if(p == nil)
  281. break;
  282. break;
  283. case Rwalk:
  284. if(p+BIT16SZ > ep)
  285. return 0;
  286. f->nwqid = GBIT16(p);
  287. p += BIT16SZ;
  288. if(f->nwqid > MAXWELEM)
  289. return 0;
  290. for(i=0; i<f->nwqid; i++){
  291. p = gqid(p, ep, &f->wqid[i]);
  292. if(p == nil)
  293. break;
  294. }
  295. break;
  296. case Ropen:
  297. case Rcreate:
  298. p = gqid(p, ep, &f->qid);
  299. if(p == nil)
  300. break;
  301. if(p+BIT32SZ > ep)
  302. return 0;
  303. f->iounit = GBIT32(p);
  304. p += BIT32SZ;
  305. break;
  306. case Rread:
  307. if(p+BIT32SZ > ep)
  308. return 0;
  309. f->count = GBIT32(p);
  310. p += BIT32SZ;
  311. if(p+f->count > ep)
  312. return 0;
  313. f->data = (char*)p;
  314. p += f->count;
  315. break;
  316. case Rwrite:
  317. if(p+BIT32SZ > ep)
  318. return 0;
  319. f->count = GBIT32(p);
  320. p += BIT32SZ;
  321. break;
  322. case Rclunk:
  323. case Rremove:
  324. break;
  325. case Rstat:
  326. if(p+BIT16SZ > ep)
  327. return 0;
  328. f->nstat = GBIT16(p);
  329. p += BIT16SZ;
  330. if(p+f->nstat > ep)
  331. return 0;
  332. f->stat = p;
  333. p += f->nstat;
  334. break;
  335. case Rwstat:
  336. break;
  337. }
  338. if(p==nil || p>ep)
  339. return 0;
  340. if(ap+size == p)
  341. return size;
  342. return 0;
  343. }