lj_ccall.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900
  1. /*
  2. ** FFI C call handling.
  3. ** Copyright (C) 2005-2014 Mike Pall. See Copyright Notice in luajit.h
  4. */
  5. #include "lj_obj.h"
  6. #if LJ_HASFFI
  7. #include "lj_gc.h"
  8. #include "lj_err.h"
  9. #include "lj_str.h"
  10. #include "lj_tab.h"
  11. #include "lj_ctype.h"
  12. #include "lj_cconv.h"
  13. #include "lj_cdata.h"
  14. #include "lj_ccall.h"
  15. #include "lj_trace.h"
  16. /* Target-specific handling of register arguments. */
  17. #if LJ_TARGET_X86
  18. /* -- x86 calling conventions --------------------------------------------- */
  19. #if LJ_ABI_WIN
  20. #define CCALL_HANDLE_STRUCTRET \
  21. /* Return structs bigger than 8 by reference (on stack only). */ \
  22. cc->retref = (sz > 8); \
  23. if (cc->retref) cc->stack[nsp++] = (GPRArg)dp;
  24. #define CCALL_HANDLE_COMPLEXRET CCALL_HANDLE_STRUCTRET
  25. #else
  26. #if LJ_TARGET_OSX
  27. #define CCALL_HANDLE_STRUCTRET \
  28. /* Return structs of size 1, 2, 4 or 8 in registers. */ \
  29. cc->retref = !(sz == 1 || sz == 2 || sz == 4 || sz == 8); \
  30. if (cc->retref) { \
  31. if (ngpr < maxgpr) \
  32. cc->gpr[ngpr++] = (GPRArg)dp; \
  33. else \
  34. cc->stack[nsp++] = (GPRArg)dp; \
  35. } else { /* Struct with single FP field ends up in FPR. */ \
  36. cc->resx87 = ccall_classify_struct(cts, ctr); \
  37. }
  38. #define CCALL_HANDLE_STRUCTRET2 \
  39. if (cc->resx87) sp = (uint8_t *)&cc->fpr[0]; \
  40. memcpy(dp, sp, ctr->size);
  41. #else
  42. #define CCALL_HANDLE_STRUCTRET \
  43. cc->retref = 1; /* Return all structs by reference (in reg or on stack). */ \
  44. if (ngpr < maxgpr) \
  45. cc->gpr[ngpr++] = (GPRArg)dp; \
  46. else \
  47. cc->stack[nsp++] = (GPRArg)dp;
  48. #endif
  49. #define CCALL_HANDLE_COMPLEXRET \
  50. /* Return complex float in GPRs and complex double by reference. */ \
  51. cc->retref = (sz > 8); \
  52. if (cc->retref) { \
  53. if (ngpr < maxgpr) \
  54. cc->gpr[ngpr++] = (GPRArg)dp; \
  55. else \
  56. cc->stack[nsp++] = (GPRArg)dp; \
  57. }
  58. #endif
  59. #define CCALL_HANDLE_COMPLEXRET2 \
  60. if (!cc->retref) \
  61. *(int64_t *)dp = *(int64_t *)sp; /* Copy complex float from GPRs. */
  62. #define CCALL_HANDLE_STRUCTARG \
  63. ngpr = maxgpr; /* Pass all structs by value on the stack. */
  64. #define CCALL_HANDLE_COMPLEXARG \
  65. isfp = 1; /* Pass complex by value on stack. */
  66. #define CCALL_HANDLE_REGARG \
  67. if (!isfp) { /* Only non-FP values may be passed in registers. */ \
  68. if (n > 1) { /* Anything > 32 bit is passed on the stack. */ \
  69. if (!LJ_ABI_WIN) ngpr = maxgpr; /* Prevent reordering. */ \
  70. } else if (ngpr + 1 <= maxgpr) { \
  71. dp = &cc->gpr[ngpr]; \
  72. ngpr += n; \
  73. goto done; \
  74. } \
  75. }
  76. #elif LJ_TARGET_X64 && LJ_ABI_WIN
  77. /* -- Windows/x64 calling conventions ------------------------------------- */
  78. #define CCALL_HANDLE_STRUCTRET \
  79. /* Return structs of size 1, 2, 4 or 8 in a GPR. */ \
  80. cc->retref = !(sz == 1 || sz == 2 || sz == 4 || sz == 8); \
  81. if (cc->retref) cc->gpr[ngpr++] = (GPRArg)dp;
  82. #define CCALL_HANDLE_COMPLEXRET CCALL_HANDLE_STRUCTRET
  83. #define CCALL_HANDLE_COMPLEXRET2 \
  84. if (!cc->retref) \
  85. *(int64_t *)dp = *(int64_t *)sp; /* Copy complex float from GPRs. */
  86. #define CCALL_HANDLE_STRUCTARG \
  87. /* Pass structs of size 1, 2, 4 or 8 in a GPR by value. */ \
  88. if (!(sz == 1 || sz == 2 || sz == 4 || sz == 8)) { \
  89. rp = cdataptr(lj_cdata_new(cts, did, sz)); \
  90. sz = CTSIZE_PTR; /* Pass all other structs by reference. */ \
  91. }
  92. #define CCALL_HANDLE_COMPLEXARG \
  93. /* Pass complex float in a GPR and complex double by reference. */ \
  94. if (sz != 2*sizeof(float)) { \
  95. rp = cdataptr(lj_cdata_new(cts, did, sz)); \
  96. sz = CTSIZE_PTR; \
  97. }
  98. /* Windows/x64 argument registers are strictly positional (use ngpr). */
  99. #define CCALL_HANDLE_REGARG \
  100. if (isfp) { \
  101. if (ngpr < maxgpr) { dp = &cc->fpr[ngpr++]; nfpr = ngpr; goto done; } \
  102. } else { \
  103. if (ngpr < maxgpr) { dp = &cc->gpr[ngpr++]; goto done; } \
  104. }
  105. #elif LJ_TARGET_X64
  106. /* -- POSIX/x64 calling conventions --------------------------------------- */
  107. #define CCALL_HANDLE_STRUCTRET \
  108. int rcl[2]; rcl[0] = rcl[1] = 0; \
  109. if (ccall_classify_struct(cts, ctr, rcl, 0)) { \
  110. cc->retref = 1; /* Return struct by reference. */ \
  111. cc->gpr[ngpr++] = (GPRArg)dp; \
  112. } else { \
  113. cc->retref = 0; /* Return small structs in registers. */ \
  114. }
  115. #define CCALL_HANDLE_STRUCTRET2 \
  116. int rcl[2]; rcl[0] = rcl[1] = 0; \
  117. ccall_classify_struct(cts, ctr, rcl, 0); \
  118. ccall_struct_ret(cc, rcl, dp, ctr->size);
  119. #define CCALL_HANDLE_COMPLEXRET \
  120. /* Complex values are returned in one or two FPRs. */ \
  121. cc->retref = 0;
  122. #define CCALL_HANDLE_COMPLEXRET2 \
  123. if (ctr->size == 2*sizeof(float)) { /* Copy complex float from FPR. */ \
  124. *(int64_t *)dp = cc->fpr[0].l[0]; \
  125. } else { /* Copy non-contiguous complex double from FPRs. */ \
  126. ((int64_t *)dp)[0] = cc->fpr[0].l[0]; \
  127. ((int64_t *)dp)[1] = cc->fpr[1].l[0]; \
  128. }
  129. #define CCALL_HANDLE_STRUCTARG \
  130. int rcl[2]; rcl[0] = rcl[1] = 0; \
  131. if (!ccall_classify_struct(cts, d, rcl, 0)) { \
  132. cc->nsp = nsp; cc->ngpr = ngpr; cc->nfpr = nfpr; \
  133. if (ccall_struct_arg(cc, cts, d, rcl, o, narg)) goto err_nyi; \
  134. nsp = cc->nsp; ngpr = cc->ngpr; nfpr = cc->nfpr; \
  135. continue; \
  136. } /* Pass all other structs by value on stack. */
  137. #define CCALL_HANDLE_COMPLEXARG \
  138. isfp = 2; /* Pass complex in FPRs or on stack. Needs postprocessing. */
  139. #define CCALL_HANDLE_REGARG \
  140. if (isfp) { /* Try to pass argument in FPRs. */ \
  141. int n2 = ctype_isvector(d->info) ? 1 : n; \
  142. if (nfpr + n2 <= CCALL_NARG_FPR) { \
  143. dp = &cc->fpr[nfpr]; \
  144. nfpr += n2; \
  145. goto done; \
  146. } \
  147. } else { /* Try to pass argument in GPRs. */ \
  148. /* Note that reordering is explicitly allowed in the x64 ABI. */ \
  149. if (n <= 2 && ngpr + n <= maxgpr) { \
  150. dp = &cc->gpr[ngpr]; \
  151. ngpr += n; \
  152. goto done; \
  153. } \
  154. }
  155. #elif LJ_TARGET_ARM
  156. /* -- ARM calling conventions --------------------------------------------- */
  157. #if LJ_ABI_SOFTFP
  158. #define CCALL_HANDLE_STRUCTRET \
  159. /* Return structs of size <= 4 in a GPR. */ \
  160. cc->retref = !(sz <= 4); \
  161. if (cc->retref) cc->gpr[ngpr++] = (GPRArg)dp;
  162. #define CCALL_HANDLE_COMPLEXRET \
  163. cc->retref = 1; /* Return all complex values by reference. */ \
  164. cc->gpr[ngpr++] = (GPRArg)dp;
  165. #define CCALL_HANDLE_COMPLEXRET2 \
  166. UNUSED(dp); /* Nothing to do. */
  167. #define CCALL_HANDLE_STRUCTARG \
  168. /* Pass all structs by value in registers and/or on the stack. */
  169. #define CCALL_HANDLE_COMPLEXARG \
  170. /* Pass complex by value in 2 or 4 GPRs. */
  171. #define CCALL_HANDLE_REGARG_FP1
  172. #define CCALL_HANDLE_REGARG_FP2
  173. #else
  174. #define CCALL_HANDLE_STRUCTRET \
  175. cc->retref = !ccall_classify_struct(cts, ctr, ct); \
  176. if (cc->retref) cc->gpr[ngpr++] = (GPRArg)dp;
  177. #define CCALL_HANDLE_STRUCTRET2 \
  178. if (ccall_classify_struct(cts, ctr, ct) > 1) sp = (uint8_t *)&cc->fpr[0]; \
  179. memcpy(dp, sp, ctr->size);
  180. #define CCALL_HANDLE_COMPLEXRET \
  181. if (!(ct->info & CTF_VARARG)) cc->retref = 0; /* Return complex in FPRs. */
  182. #define CCALL_HANDLE_COMPLEXRET2 \
  183. if (!(ct->info & CTF_VARARG)) memcpy(dp, &cc->fpr[0], ctr->size);
  184. #define CCALL_HANDLE_STRUCTARG \
  185. isfp = (ccall_classify_struct(cts, d, ct) > 1);
  186. /* Pass all structs by value in registers and/or on the stack. */
  187. #define CCALL_HANDLE_COMPLEXARG \
  188. isfp = 1; /* Pass complex by value in FPRs or on stack. */
  189. #define CCALL_HANDLE_REGARG_FP1 \
  190. if (isfp && !(ct->info & CTF_VARARG)) { \
  191. if ((d->info & CTF_ALIGN) > CTALIGN_PTR) { \
  192. if (nfpr + (n >> 1) <= CCALL_NARG_FPR) { \
  193. dp = &cc->fpr[nfpr]; \
  194. nfpr += (n >> 1); \
  195. goto done; \
  196. } \
  197. } else { \
  198. if (sz > 1 && fprodd != nfpr) fprodd = 0; \
  199. if (fprodd) { \
  200. if (2*nfpr+n <= 2*CCALL_NARG_FPR+1) { \
  201. dp = (void *)&cc->fpr[fprodd-1].f[1]; \
  202. nfpr += (n >> 1); \
  203. if ((n & 1)) fprodd = 0; else fprodd = nfpr-1; \
  204. goto done; \
  205. } \
  206. } else { \
  207. if (2*nfpr+n <= 2*CCALL_NARG_FPR) { \
  208. dp = (void *)&cc->fpr[nfpr]; \
  209. nfpr += (n >> 1); \
  210. if ((n & 1)) fprodd = ++nfpr; else fprodd = 0; \
  211. goto done; \
  212. } \
  213. } \
  214. } \
  215. fprodd = 0; /* No reordering after the first FP value is on stack. */ \
  216. } else {
  217. #define CCALL_HANDLE_REGARG_FP2 }
  218. #endif
  219. #define CCALL_HANDLE_REGARG \
  220. CCALL_HANDLE_REGARG_FP1 \
  221. if ((d->info & CTF_ALIGN) > CTALIGN_PTR) { \
  222. if (ngpr < maxgpr) \
  223. ngpr = (ngpr + 1u) & ~1u; /* Align to regpair. */ \
  224. } \
  225. if (ngpr < maxgpr) { \
  226. dp = &cc->gpr[ngpr]; \
  227. if (ngpr + n > maxgpr) { \
  228. nsp += ngpr + n - maxgpr; /* Assumes contiguous gpr/stack fields. */ \
  229. if (nsp > CCALL_MAXSTACK) goto err_nyi; /* Too many arguments. */ \
  230. ngpr = maxgpr; \
  231. } else { \
  232. ngpr += n; \
  233. } \
  234. goto done; \
  235. } CCALL_HANDLE_REGARG_FP2
  236. #define CCALL_HANDLE_RET \
  237. if ((ct->info & CTF_VARARG)) sp = (uint8_t *)&cc->gpr[0];
  238. #elif LJ_TARGET_PPC
  239. /* -- PPC calling conventions --------------------------------------------- */
  240. #define CCALL_HANDLE_STRUCTRET \
  241. cc->retref = 1; /* Return all structs by reference. */ \
  242. cc->gpr[ngpr++] = (GPRArg)dp;
  243. #define CCALL_HANDLE_COMPLEXRET \
  244. /* Complex values are returned in 2 or 4 GPRs. */ \
  245. cc->retref = 0;
  246. #define CCALL_HANDLE_COMPLEXRET2 \
  247. memcpy(dp, sp, ctr->size); /* Copy complex from GPRs. */
  248. #define CCALL_HANDLE_STRUCTARG \
  249. rp = cdataptr(lj_cdata_new(cts, did, sz)); \
  250. sz = CTSIZE_PTR; /* Pass all structs by reference. */
  251. #define CCALL_HANDLE_COMPLEXARG \
  252. /* Pass complex by value in 2 or 4 GPRs. */
  253. #define CCALL_HANDLE_REGARG \
  254. if (isfp) { /* Try to pass argument in FPRs. */ \
  255. if (nfpr + 1 <= CCALL_NARG_FPR) { \
  256. dp = &cc->fpr[nfpr]; \
  257. nfpr += 1; \
  258. d = ctype_get(cts, CTID_DOUBLE); /* FPRs always hold doubles. */ \
  259. goto done; \
  260. } \
  261. } else { /* Try to pass argument in GPRs. */ \
  262. if (n > 1) { \
  263. lua_assert(n == 2 || n == 4); /* int64_t or complex (float). */ \
  264. if (ctype_isinteger(d->info)) \
  265. ngpr = (ngpr + 1u) & ~1u; /* Align int64_t to regpair. */ \
  266. else if (ngpr + n > maxgpr) \
  267. ngpr = maxgpr; /* Prevent reordering. */ \
  268. } \
  269. if (ngpr + n <= maxgpr) { \
  270. dp = &cc->gpr[ngpr]; \
  271. ngpr += n; \
  272. goto done; \
  273. } \
  274. }
  275. #define CCALL_HANDLE_RET \
  276. if (ctype_isfp(ctr->info) && ctr->size == sizeof(float)) \
  277. ctr = ctype_get(cts, CTID_DOUBLE); /* FPRs always hold doubles. */
  278. #elif LJ_TARGET_PPCSPE
  279. /* -- PPC/SPE calling conventions ----------------------------------------- */
  280. #define CCALL_HANDLE_STRUCTRET \
  281. cc->retref = 1; /* Return all structs by reference. */ \
  282. cc->gpr[ngpr++] = (GPRArg)dp;
  283. #define CCALL_HANDLE_COMPLEXRET \
  284. /* Complex values are returned in 2 or 4 GPRs. */ \
  285. cc->retref = 0;
  286. #define CCALL_HANDLE_COMPLEXRET2 \
  287. memcpy(dp, sp, ctr->size); /* Copy complex from GPRs. */
  288. #define CCALL_HANDLE_STRUCTARG \
  289. rp = cdataptr(lj_cdata_new(cts, did, sz)); \
  290. sz = CTSIZE_PTR; /* Pass all structs by reference. */
  291. #define CCALL_HANDLE_COMPLEXARG \
  292. /* Pass complex by value in 2 or 4 GPRs. */
  293. /* PPC/SPE has a softfp ABI. */
  294. #define CCALL_HANDLE_REGARG \
  295. if (n > 1) { /* Doesn't fit in a single GPR? */ \
  296. lua_assert(n == 2 || n == 4); /* int64_t, double or complex (float). */ \
  297. if (n == 2) \
  298. ngpr = (ngpr + 1u) & ~1u; /* Only align 64 bit value to regpair. */ \
  299. else if (ngpr + n > maxgpr) \
  300. ngpr = maxgpr; /* Prevent reordering. */ \
  301. } \
  302. if (ngpr + n <= maxgpr) { \
  303. dp = &cc->gpr[ngpr]; \
  304. ngpr += n; \
  305. goto done; \
  306. }
  307. #elif LJ_TARGET_MIPS
  308. /* -- MIPS calling conventions -------------------------------------------- */
  309. #define CCALL_HANDLE_STRUCTRET \
  310. cc->retref = 1; /* Return all structs by reference. */ \
  311. cc->gpr[ngpr++] = (GPRArg)dp;
  312. #define CCALL_HANDLE_COMPLEXRET \
  313. /* Complex values are returned in 1 or 2 FPRs. */ \
  314. cc->retref = 0;
  315. #define CCALL_HANDLE_COMPLEXRET2 \
  316. if (ctr->size == 2*sizeof(float)) { /* Copy complex float from FPRs. */ \
  317. ((float *)dp)[0] = cc->fpr[0].f; \
  318. ((float *)dp)[1] = cc->fpr[1].f; \
  319. } else { /* Copy complex double from FPRs. */ \
  320. ((double *)dp)[0] = cc->fpr[0].d; \
  321. ((double *)dp)[1] = cc->fpr[1].d; \
  322. }
  323. #define CCALL_HANDLE_STRUCTARG \
  324. /* Pass all structs by value in registers and/or on the stack. */
  325. #define CCALL_HANDLE_COMPLEXARG \
  326. /* Pass complex by value in 2 or 4 GPRs. */
  327. #define CCALL_HANDLE_REGARG \
  328. if (isfp && nfpr < CCALL_NARG_FPR && !(ct->info & CTF_VARARG)) { \
  329. /* Try to pass argument in FPRs. */ \
  330. dp = n == 1 ? (void *)&cc->fpr[nfpr].f : (void *)&cc->fpr[nfpr].d; \
  331. nfpr++; ngpr += n; \
  332. goto done; \
  333. } else { /* Try to pass argument in GPRs. */ \
  334. nfpr = CCALL_NARG_FPR; \
  335. if ((d->info & CTF_ALIGN) > CTALIGN_PTR) \
  336. ngpr = (ngpr + 1u) & ~1u; /* Align to regpair. */ \
  337. if (ngpr < maxgpr) { \
  338. dp = &cc->gpr[ngpr]; \
  339. if (ngpr + n > maxgpr) { \
  340. nsp += ngpr + n - maxgpr; /* Assumes contiguous gpr/stack fields. */ \
  341. if (nsp > CCALL_MAXSTACK) goto err_nyi; /* Too many arguments. */ \
  342. ngpr = maxgpr; \
  343. } else { \
  344. ngpr += n; \
  345. } \
  346. goto done; \
  347. } \
  348. }
  349. #define CCALL_HANDLE_RET \
  350. if (ctype_isfp(ctr->info) && ctr->size == sizeof(float)) \
  351. sp = (uint8_t *)&cc->fpr[0].f;
  352. #else
  353. #error "Missing calling convention definitions for this architecture"
  354. #endif
  355. #ifndef CCALL_HANDLE_STRUCTRET2
  356. #define CCALL_HANDLE_STRUCTRET2 \
  357. memcpy(dp, sp, ctr->size); /* Copy struct return value from GPRs. */
  358. #endif
  359. /* -- x86 OSX ABI struct classification ----------------------------------- */
  360. #if LJ_TARGET_X86 && LJ_TARGET_OSX
  361. /* Check for struct with single FP field. */
  362. static int ccall_classify_struct(CTState *cts, CType *ct)
  363. {
  364. CTSize sz = ct->size;
  365. if (!(sz == sizeof(float) || sz == sizeof(double))) return 0;
  366. if ((ct->info & CTF_UNION)) return 0;
  367. while (ct->sib) {
  368. ct = ctype_get(cts, ct->sib);
  369. if (ctype_isfield(ct->info)) {
  370. CType *sct = ctype_rawchild(cts, ct);
  371. if (ctype_isfp(sct->info)) {
  372. if (sct->size == sz)
  373. return (sz >> 2); /* Return 1 for float or 2 for double. */
  374. } else if (ctype_isstruct(sct->info)) {
  375. if (sct->size)
  376. return ccall_classify_struct(cts, sct);
  377. } else {
  378. break;
  379. }
  380. } else if (ctype_isbitfield(ct->info)) {
  381. break;
  382. } else if (ctype_isxattrib(ct->info, CTA_SUBTYPE)) {
  383. CType *sct = ctype_rawchild(cts, ct);
  384. if (sct->size)
  385. return ccall_classify_struct(cts, sct);
  386. }
  387. }
  388. return 0;
  389. }
  390. #endif
  391. /* -- x64 struct classification ------------------------------------------- */
  392. #if LJ_TARGET_X64 && !LJ_ABI_WIN
  393. /* Register classes for x64 struct classification. */
  394. #define CCALL_RCL_INT 1
  395. #define CCALL_RCL_SSE 2
  396. #define CCALL_RCL_MEM 4
  397. /* NYI: classify vectors. */
  398. static int ccall_classify_struct(CTState *cts, CType *ct, int *rcl, CTSize ofs);
  399. /* Classify a C type. */
  400. static void ccall_classify_ct(CTState *cts, CType *ct, int *rcl, CTSize ofs)
  401. {
  402. if (ctype_isarray(ct->info)) {
  403. CType *cct = ctype_rawchild(cts, ct);
  404. CTSize eofs, esz = cct->size, asz = ct->size;
  405. for (eofs = 0; eofs < asz; eofs += esz)
  406. ccall_classify_ct(cts, cct, rcl, ofs+eofs);
  407. } else if (ctype_isstruct(ct->info)) {
  408. ccall_classify_struct(cts, ct, rcl, ofs);
  409. } else {
  410. int cl = ctype_isfp(ct->info) ? CCALL_RCL_SSE : CCALL_RCL_INT;
  411. lua_assert(ctype_hassize(ct->info));
  412. if ((ofs & (ct->size-1))) cl = CCALL_RCL_MEM; /* Unaligned. */
  413. rcl[(ofs >= 8)] |= cl;
  414. }
  415. }
  416. /* Recursively classify a struct based on its fields. */
  417. static int ccall_classify_struct(CTState *cts, CType *ct, int *rcl, CTSize ofs)
  418. {
  419. if (ct->size > 16) return CCALL_RCL_MEM; /* Too big, gets memory class. */
  420. while (ct->sib) {
  421. CTSize fofs;
  422. ct = ctype_get(cts, ct->sib);
  423. fofs = ofs+ct->size;
  424. if (ctype_isfield(ct->info))
  425. ccall_classify_ct(cts, ctype_rawchild(cts, ct), rcl, fofs);
  426. else if (ctype_isbitfield(ct->info))
  427. rcl[(fofs >= 8)] |= CCALL_RCL_INT; /* NYI: unaligned bitfields? */
  428. else if (ctype_isxattrib(ct->info, CTA_SUBTYPE))
  429. ccall_classify_struct(cts, ctype_rawchild(cts, ct), rcl, fofs);
  430. }
  431. return ((rcl[0]|rcl[1]) & CCALL_RCL_MEM); /* Memory class? */
  432. }
  433. /* Try to split up a small struct into registers. */
  434. static int ccall_struct_reg(CCallState *cc, GPRArg *dp, int *rcl)
  435. {
  436. MSize ngpr = cc->ngpr, nfpr = cc->nfpr;
  437. uint32_t i;
  438. for (i = 0; i < 2; i++) {
  439. lua_assert(!(rcl[i] & CCALL_RCL_MEM));
  440. if ((rcl[i] & CCALL_RCL_INT)) { /* Integer class takes precedence. */
  441. if (ngpr >= CCALL_NARG_GPR) return 1; /* Register overflow. */
  442. cc->gpr[ngpr++] = dp[i];
  443. } else if ((rcl[i] & CCALL_RCL_SSE)) {
  444. if (nfpr >= CCALL_NARG_FPR) return 1; /* Register overflow. */
  445. cc->fpr[nfpr++].l[0] = dp[i];
  446. }
  447. }
  448. cc->ngpr = ngpr; cc->nfpr = nfpr;
  449. return 0; /* Ok. */
  450. }
  451. /* Pass a small struct argument. */
  452. static int ccall_struct_arg(CCallState *cc, CTState *cts, CType *d, int *rcl,
  453. TValue *o, int narg)
  454. {
  455. GPRArg dp[2];
  456. dp[0] = dp[1] = 0;
  457. /* Convert to temp. struct. */
  458. lj_cconv_ct_tv(cts, d, (uint8_t *)dp, o, CCF_ARG(narg));
  459. if (ccall_struct_reg(cc, dp, rcl)) { /* Register overflow? Pass on stack. */
  460. MSize nsp = cc->nsp, n = rcl[1] ? 2 : 1;
  461. if (nsp + n > CCALL_MAXSTACK) return 1; /* Too many arguments. */
  462. cc->nsp = nsp + n;
  463. memcpy(&cc->stack[nsp], dp, n*CTSIZE_PTR);
  464. }
  465. return 0; /* Ok. */
  466. }
  467. /* Combine returned small struct. */
  468. static void ccall_struct_ret(CCallState *cc, int *rcl, uint8_t *dp, CTSize sz)
  469. {
  470. GPRArg sp[2];
  471. MSize ngpr = 0, nfpr = 0;
  472. uint32_t i;
  473. for (i = 0; i < 2; i++) {
  474. if ((rcl[i] & CCALL_RCL_INT)) { /* Integer class takes precedence. */
  475. sp[i] = cc->gpr[ngpr++];
  476. } else if ((rcl[i] & CCALL_RCL_SSE)) {
  477. sp[i] = cc->fpr[nfpr++].l[0];
  478. }
  479. }
  480. memcpy(dp, sp, sz);
  481. }
  482. #endif
  483. /* -- ARM hard-float ABI struct classification ---------------------------- */
  484. #if LJ_TARGET_ARM && !LJ_ABI_SOFTFP
  485. /* Classify a struct based on its fields. */
  486. static unsigned int ccall_classify_struct(CTState *cts, CType *ct, CType *ctf)
  487. {
  488. CTSize sz = ct->size;
  489. unsigned int r = 0, n = 0, isu = (ct->info & CTF_UNION);
  490. if ((ctf->info & CTF_VARARG)) goto noth;
  491. while (ct->sib) {
  492. CType *sct;
  493. ct = ctype_get(cts, ct->sib);
  494. if (ctype_isfield(ct->info)) {
  495. sct = ctype_rawchild(cts, ct);
  496. if (ctype_isfp(sct->info)) {
  497. r |= sct->size;
  498. if (!isu) n++; else if (n == 0) n = 1;
  499. } else if (ctype_iscomplex(sct->info)) {
  500. r |= (sct->size >> 1);
  501. if (!isu) n += 2; else if (n < 2) n = 2;
  502. } else if (ctype_isstruct(sct->info)) {
  503. goto substruct;
  504. } else {
  505. goto noth;
  506. }
  507. } else if (ctype_isbitfield(ct->info)) {
  508. goto noth;
  509. } else if (ctype_isxattrib(ct->info, CTA_SUBTYPE)) {
  510. sct = ctype_rawchild(cts, ct);
  511. substruct:
  512. if (sct->size > 0) {
  513. unsigned int s = ccall_classify_struct(cts, sct, ctf);
  514. if (s <= 1) goto noth;
  515. r |= (s & 255);
  516. if (!isu) n += (s >> 8); else if (n < (s >>8)) n = (s >> 8);
  517. }
  518. }
  519. }
  520. if ((r == 4 || r == 8) && n <= 4)
  521. return r + (n << 8);
  522. noth: /* Not a homogeneous float/double aggregate. */
  523. return (sz <= 4); /* Return structs of size <= 4 in a GPR. */
  524. }
  525. #endif
  526. /* -- Common C call handling ---------------------------------------------- */
  527. /* Infer the destination CTypeID for a vararg argument. */
  528. CTypeID lj_ccall_ctid_vararg(CTState *cts, cTValue *o)
  529. {
  530. if (tvisnumber(o)) {
  531. return CTID_DOUBLE;
  532. } else if (tviscdata(o)) {
  533. CTypeID id = cdataV(o)->ctypeid;
  534. CType *s = ctype_get(cts, id);
  535. if (ctype_isrefarray(s->info)) {
  536. return lj_ctype_intern(cts,
  537. CTINFO(CT_PTR, CTALIGN_PTR|ctype_cid(s->info)), CTSIZE_PTR);
  538. } else if (ctype_isstruct(s->info) || ctype_isfunc(s->info)) {
  539. /* NYI: how to pass a struct by value in a vararg argument? */
  540. return lj_ctype_intern(cts, CTINFO(CT_PTR, CTALIGN_PTR|id), CTSIZE_PTR);
  541. } else if (ctype_isfp(s->info) && s->size == sizeof(float)) {
  542. return CTID_DOUBLE;
  543. } else {
  544. return id;
  545. }
  546. } else if (tvisstr(o)) {
  547. return CTID_P_CCHAR;
  548. } else if (tvisbool(o)) {
  549. return CTID_BOOL;
  550. } else {
  551. return CTID_P_VOID;
  552. }
  553. }
  554. /* Setup arguments for C call. */
  555. static int ccall_set_args(lua_State *L, CTState *cts, CType *ct,
  556. CCallState *cc)
  557. {
  558. int gcsteps = 0;
  559. TValue *o, *top = L->top;
  560. CTypeID fid;
  561. CType *ctr;
  562. MSize maxgpr, ngpr = 0, nsp = 0, narg;
  563. #if CCALL_NARG_FPR
  564. MSize nfpr = 0;
  565. #if LJ_TARGET_ARM
  566. MSize fprodd = 0;
  567. #endif
  568. #endif
  569. /* Clear unused regs to get some determinism in case of misdeclaration. */
  570. memset(cc->gpr, 0, sizeof(cc->gpr));
  571. #if CCALL_NUM_FPR
  572. memset(cc->fpr, 0, sizeof(cc->fpr));
  573. #endif
  574. #if LJ_TARGET_X86
  575. /* x86 has several different calling conventions. */
  576. cc->resx87 = 0;
  577. switch (ctype_cconv(ct->info)) {
  578. case CTCC_FASTCALL: maxgpr = 2; break;
  579. case CTCC_THISCALL: maxgpr = 1; break;
  580. default: maxgpr = 0; break;
  581. }
  582. #else
  583. maxgpr = CCALL_NARG_GPR;
  584. #endif
  585. /* Perform required setup for some result types. */
  586. ctr = ctype_rawchild(cts, ct);
  587. if (ctype_isvector(ctr->info)) {
  588. if (!(CCALL_VECTOR_REG && (ctr->size == 8 || ctr->size == 16)))
  589. goto err_nyi;
  590. } else if (ctype_iscomplex(ctr->info) || ctype_isstruct(ctr->info)) {
  591. /* Preallocate cdata object and anchor it after arguments. */
  592. CTSize sz = ctr->size;
  593. GCcdata *cd = lj_cdata_new(cts, ctype_cid(ct->info), sz);
  594. void *dp = cdataptr(cd);
  595. setcdataV(L, L->top++, cd);
  596. if (ctype_isstruct(ctr->info)) {
  597. CCALL_HANDLE_STRUCTRET
  598. } else {
  599. CCALL_HANDLE_COMPLEXRET
  600. }
  601. #if LJ_TARGET_X86
  602. } else if (ctype_isfp(ctr->info)) {
  603. cc->resx87 = ctr->size == sizeof(float) ? 1 : 2;
  604. #endif
  605. }
  606. /* Skip initial attributes. */
  607. fid = ct->sib;
  608. while (fid) {
  609. CType *ctf = ctype_get(cts, fid);
  610. if (!ctype_isattrib(ctf->info)) break;
  611. fid = ctf->sib;
  612. }
  613. /* Walk through all passed arguments. */
  614. for (o = L->base+1, narg = 1; o < top; o++, narg++) {
  615. CTypeID did;
  616. CType *d;
  617. CTSize sz;
  618. MSize n, isfp = 0, isva = 0;
  619. void *dp, *rp = NULL;
  620. if (fid) { /* Get argument type from field. */
  621. CType *ctf = ctype_get(cts, fid);
  622. fid = ctf->sib;
  623. lua_assert(ctype_isfield(ctf->info));
  624. did = ctype_cid(ctf->info);
  625. } else {
  626. if (!(ct->info & CTF_VARARG))
  627. lj_err_caller(L, LJ_ERR_FFI_NUMARG); /* Too many arguments. */
  628. did = lj_ccall_ctid_vararg(cts, o); /* Infer vararg type. */
  629. isva = 1;
  630. }
  631. d = ctype_raw(cts, did);
  632. sz = d->size;
  633. /* Find out how (by value/ref) and where (GPR/FPR) to pass an argument. */
  634. if (ctype_isnum(d->info)) {
  635. if (sz > 8) goto err_nyi;
  636. if ((d->info & CTF_FP))
  637. isfp = 1;
  638. } else if (ctype_isvector(d->info)) {
  639. if (CCALL_VECTOR_REG && (sz == 8 || sz == 16))
  640. isfp = 1;
  641. else
  642. goto err_nyi;
  643. } else if (ctype_isstruct(d->info)) {
  644. CCALL_HANDLE_STRUCTARG
  645. } else if (ctype_iscomplex(d->info)) {
  646. CCALL_HANDLE_COMPLEXARG
  647. } else {
  648. sz = CTSIZE_PTR;
  649. }
  650. sz = (sz + CTSIZE_PTR-1) & ~(CTSIZE_PTR-1);
  651. n = sz / CTSIZE_PTR; /* Number of GPRs or stack slots needed. */
  652. CCALL_HANDLE_REGARG /* Handle register arguments. */
  653. /* Otherwise pass argument on stack. */
  654. if (CCALL_ALIGN_STACKARG && !rp && (d->info & CTF_ALIGN) > CTALIGN_PTR) {
  655. MSize align = (1u << ctype_align(d->info-CTALIGN_PTR)) -1;
  656. nsp = (nsp + align) & ~align; /* Align argument on stack. */
  657. }
  658. if (nsp + n > CCALL_MAXSTACK) { /* Too many arguments. */
  659. err_nyi:
  660. lj_err_caller(L, LJ_ERR_FFI_NYICALL);
  661. }
  662. dp = &cc->stack[nsp];
  663. nsp += n;
  664. isva = 0;
  665. done:
  666. if (rp) { /* Pass by reference. */
  667. gcsteps++;
  668. *(void **)dp = rp;
  669. dp = rp;
  670. }
  671. lj_cconv_ct_tv(cts, d, (uint8_t *)dp, o, CCF_ARG(narg));
  672. /* Extend passed integers to 32 bits at least. */
  673. if (ctype_isinteger_or_bool(d->info) && d->size < 4) {
  674. if (d->info & CTF_UNSIGNED)
  675. *(uint32_t *)dp = d->size == 1 ? (uint32_t)*(uint8_t *)dp :
  676. (uint32_t)*(uint16_t *)dp;
  677. else
  678. *(int32_t *)dp = d->size == 1 ? (int32_t)*(int8_t *)dp :
  679. (int32_t)*(int16_t *)dp;
  680. }
  681. #if LJ_TARGET_X64 && LJ_ABI_WIN
  682. if (isva) { /* Windows/x64 mirrors varargs in both register sets. */
  683. if (nfpr == ngpr)
  684. cc->gpr[ngpr-1] = cc->fpr[ngpr-1].l[0];
  685. else
  686. cc->fpr[ngpr-1].l[0] = cc->gpr[ngpr-1];
  687. }
  688. #else
  689. UNUSED(isva);
  690. #endif
  691. #if LJ_TARGET_X64 && !LJ_ABI_WIN
  692. if (isfp == 2 && n == 2 && (uint8_t *)dp == (uint8_t *)&cc->fpr[nfpr-2]) {
  693. cc->fpr[nfpr-1].d[0] = cc->fpr[nfpr-2].d[1]; /* Split complex double. */
  694. cc->fpr[nfpr-2].d[1] = 0;
  695. }
  696. #else
  697. UNUSED(isfp);
  698. #endif
  699. }
  700. if (fid) lj_err_caller(L, LJ_ERR_FFI_NUMARG); /* Too few arguments. */
  701. #if LJ_TARGET_X64 || LJ_TARGET_PPC
  702. cc->nfpr = nfpr; /* Required for vararg functions. */
  703. #endif
  704. cc->nsp = nsp;
  705. cc->spadj = (CCALL_SPS_FREE + CCALL_SPS_EXTRA)*CTSIZE_PTR;
  706. if (nsp > CCALL_SPS_FREE)
  707. cc->spadj += (((nsp-CCALL_SPS_FREE)*CTSIZE_PTR + 15u) & ~15u);
  708. return gcsteps;
  709. }
  710. /* Get results from C call. */
  711. static int ccall_get_results(lua_State *L, CTState *cts, CType *ct,
  712. CCallState *cc, int *ret)
  713. {
  714. CType *ctr = ctype_rawchild(cts, ct);
  715. uint8_t *sp = (uint8_t *)&cc->gpr[0];
  716. if (ctype_isvoid(ctr->info)) {
  717. *ret = 0; /* Zero results. */
  718. return 0; /* No additional GC step. */
  719. }
  720. *ret = 1; /* One result. */
  721. if (ctype_isstruct(ctr->info)) {
  722. /* Return cdata object which is already on top of stack. */
  723. if (!cc->retref) {
  724. void *dp = cdataptr(cdataV(L->top-1)); /* Use preallocated object. */
  725. CCALL_HANDLE_STRUCTRET2
  726. }
  727. return 1; /* One GC step. */
  728. }
  729. if (ctype_iscomplex(ctr->info)) {
  730. /* Return cdata object which is already on top of stack. */
  731. void *dp = cdataptr(cdataV(L->top-1)); /* Use preallocated object. */
  732. CCALL_HANDLE_COMPLEXRET2
  733. return 1; /* One GC step. */
  734. }
  735. if (LJ_BE && ctype_isinteger_or_bool(ctr->info) && ctr->size < CTSIZE_PTR)
  736. sp += (CTSIZE_PTR - ctr->size);
  737. #if CCALL_NUM_FPR
  738. if (ctype_isfp(ctr->info) || ctype_isvector(ctr->info))
  739. sp = (uint8_t *)&cc->fpr[0];
  740. #endif
  741. #ifdef CCALL_HANDLE_RET
  742. CCALL_HANDLE_RET
  743. #endif
  744. /* No reference types end up here, so there's no need for the CTypeID. */
  745. lua_assert(!(ctype_isrefarray(ctr->info) || ctype_isstruct(ctr->info)));
  746. return lj_cconv_tv_ct(cts, ctr, 0, L->top-1, sp);
  747. }
  748. /* Call C function. */
  749. int lj_ccall_func(lua_State *L, GCcdata *cd)
  750. {
  751. CTState *cts = ctype_cts(L);
  752. CType *ct = ctype_raw(cts, cd->ctypeid);
  753. CTSize sz = CTSIZE_PTR;
  754. if (ctype_isptr(ct->info)) {
  755. sz = ct->size;
  756. ct = ctype_rawchild(cts, ct);
  757. }
  758. if (ctype_isfunc(ct->info)) {
  759. CCallState cc;
  760. int gcsteps, ret;
  761. cc.func = (void (*)(void))cdata_getptr(cdataptr(cd), sz);
  762. gcsteps = ccall_set_args(L, cts, ct, &cc);
  763. ct = (CType *)((intptr_t)ct-(intptr_t)cts->tab);
  764. cts->cb.slot = ~0u;
  765. lj_vm_ffi_call(&cc);
  766. if (cts->cb.slot != ~0u) { /* Blacklist function that called a callback. */
  767. TValue tv;
  768. setlightudV(&tv, (void *)cc.func);
  769. setboolV(lj_tab_set(L, cts->miscmap, &tv), 1);
  770. }
  771. ct = (CType *)((intptr_t)ct+(intptr_t)cts->tab); /* May be reallocated. */
  772. gcsteps += ccall_get_results(L, cts, ct, &cc, &ret);
  773. #if LJ_TARGET_X86 && LJ_ABI_WIN
  774. /* Automatically detect __stdcall and fix up C function declaration. */
  775. if (cc.spadj && ctype_cconv(ct->info) == CTCC_CDECL) {
  776. CTF_INSERT(ct->info, CCONV, CTCC_STDCALL);
  777. lj_trace_abort(G(L));
  778. }
  779. #endif
  780. while (gcsteps-- > 0)
  781. lj_gc_check(L);
  782. return ret;
  783. }
  784. return -1; /* Not a function. */
  785. }
  786. #endif