convS2M.c 5.3 KB

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