mirrors/quickjs
1
0
Fork 0
mirror of https://github.com/bellard/quickjs.git synced 2025-05-15 10:45:02 +08:00
Code Issues Packages Projects Releases Wiki Activity

fixed JS_DumpValue() for BigInt

Browse Source
This commit is contained in:
Fabrice Bellard 2025-03-19 11:59:47 +01:00
parent 6de88859e7
commit 5a16c0c1eb
1 changed files with 22 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
quickjs.c
View File

@ -12870,19 +12870,32 @@ static __maybe_unused void JS_DumpValueShort(JSRuntime *rt,
case JS_TAG_FLOAT64: case JS_TAG_FLOAT64:
printf("%.14g", JS_VALUE_GET_FLOAT64(val)); printf("%.14g", JS_VALUE_GET_FLOAT64(val));
break; break;
#if 0 case JS_TAG_SHORT_BIG_INT:
/* XXX: TODO */ printf("%" PRId64 "n", (int64_t)JS_VALUE_GET_SHORT_BIG_INT(val));
break;
case JS_TAG_BIG_INT: case JS_TAG_BIG_INT:
{ {
JSBigFloat *p = JS_VALUE_GET_PTR(val); JSBigInt *p = JS_VALUE_GET_PTR(val);
char *str; int sgn, i;
str = bf_ftoa(NULL, &p->num, 10, 0, /* In order to avoid allocations we just dump the limbs */
BF_RNDZ | BF_FTOA_FORMAT_FRAC); sgn = js_bigint_sign(p);
printf("%sn", str); if (sgn)
bf_realloc(&rt->bf_ctx, str, 0); printf("BigInt.asIntN(%d,", p->len * JS_LIMB_BITS);
printf("0x");
for(i = p->len - 1; i >= 0; i--) {
if (i != p->len - 1)
printf("_");
#if JS_LIMB_BITS == 32
printf("%08x", p->tab[i]);
#else
printf("%016" PRIx64, p->tab[i]);
#endif
}
printf("n");
if (sgn)
printf(")");
} }
break; break;
#endif
case JS_TAG_STRING: case JS_TAG_STRING:
{ {
JSString *p; JSString *p;