2 * Copyright 2008 Jacek Caban for CodeWeavers
4 * This library is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU Lesser General Public
6 * License as published by the Free Software Foundation; either
7 * version 2.1 of the License, or (at your option) any later version.
9 * This library is distributed in the hope that it will be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * Lesser General Public License for more details.
14 * You should have received a copy of the GNU Lesser General Public
15 * License along with this library; if not, write to the Free Software
16 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
26 #include "wine/debug.h"
28 WINE_DEFAULT_DEBUG_CHANNEL(jscript
);
29 WINE_DECLARE_DEBUG_CHANNEL(heap
);
31 const char *debugstr_jsval(const jsval_t v
)
33 switch(jsval_type(v
)) {
39 return wine_dbg_sprintf("obj(%p)", get_object(v
));
41 return wine_dbg_sprintf("str(%s)", debugstr_jsstr(get_string(v
)));
43 return wine_dbg_sprintf("%lf", get_number(v
));
45 return get_bool(v
) ? "true" : "false";
47 return debugstr_variant(get_variant(v
));
54 BOOL
is_finite(double n
)
56 return !isnan(n
) && !isinf(n
);
59 #define MIN_BLOCK_SIZE 128
60 #define ARENA_FREE_FILLER 0xaa
62 static inline DWORD
block_size(DWORD block
)
64 return MIN_BLOCK_SIZE
<< block
;
67 void heap_pool_init(heap_pool_t
*heap
)
69 memset(heap
, 0, sizeof(*heap
));
70 list_init(&heap
->custom_blocks
);
73 void *heap_pool_alloc(heap_pool_t
*heap
, DWORD size
)
78 if(!heap
->block_cnt
) {
80 heap
->blocks
= heap_alloc(sizeof(void*));
85 tmp
= heap_alloc(block_size(0));
89 heap
->blocks
[0] = tmp
;
93 if(heap
->offset
+ size
<= block_size(heap
->last_block
)) {
94 tmp
= ((BYTE
*)heap
->blocks
[heap
->last_block
])+heap
->offset
;
99 if(size
<= block_size(heap
->last_block
+1)) {
100 if(heap
->last_block
+1 == heap
->block_cnt
) {
101 tmp
= heap_realloc(heap
->blocks
, (heap
->block_cnt
+1)*sizeof(void*));
106 heap
->blocks
[heap
->block_cnt
] = heap_alloc(block_size(heap
->block_cnt
));
107 if(!heap
->blocks
[heap
->block_cnt
])
115 return heap
->blocks
[heap
->last_block
];
118 list
= heap_alloc(size
+ sizeof(struct list
));
122 list_add_head(&heap
->custom_blocks
, list
);
126 void *heap_pool_grow(heap_pool_t
*heap
, void *mem
, DWORD size
, DWORD inc
)
130 if(mem
== (BYTE
*)heap
->blocks
[heap
->last_block
] + heap
->offset
-size
131 && heap
->offset
+inc
< block_size(heap
->last_block
)) {
136 ret
= heap_pool_alloc(heap
, size
+inc
);
137 if(ret
) /* FIXME: avoid copying for custom blocks */
138 memcpy(ret
, mem
, size
);
142 void heap_pool_clear(heap_pool_t
*heap
)
149 while((tmp
= list_head(&heap
->custom_blocks
))) {
157 for(i
=0; i
< heap
->block_cnt
; i
++)
158 memset(heap
->blocks
[i
], ARENA_FREE_FILLER
, block_size(i
));
161 heap
->last_block
= heap
->offset
= 0;
165 void heap_pool_free(heap_pool_t
*heap
)
169 heap_pool_clear(heap
);
171 for(i
=0; i
< heap
->block_cnt
; i
++)
172 heap_free(heap
->blocks
[i
]);
173 heap_free(heap
->blocks
);
175 heap_pool_init(heap
);
178 heap_pool_t
*heap_pool_mark(heap_pool_t
*heap
)
187 void jsval_release(jsval_t val
)
189 switch(jsval_type(val
)) {
192 IDispatch_Release(get_object(val
));
195 jsstr_release(get_string(val
));
198 VariantClear(get_variant(val
));
199 heap_free(get_variant(val
));
206 static HRESULT
jsval_variant(jsval_t
*val
, VARIANT
*var
)
211 __JSVAL_TYPE(*val
) = JSV_VARIANT
;
212 __JSVAL_VAR(*val
) = v
= heap_alloc(sizeof(VARIANT
));
214 *val
= jsval_undefined();
215 return E_OUTOFMEMORY
;
219 hres
= VariantCopy(v
, var
);
221 *val
= jsval_undefined();
227 HRESULT
jsval_copy(jsval_t v
, jsval_t
*r
)
229 switch(jsval_type(v
)) {
238 IDispatch_AddRef(get_object(v
));
242 jsstr_addref(get_string(v
));
247 return jsval_variant(r
, get_variant(v
));
254 HRESULT
variant_to_jsval(VARIANT
*var
, jsval_t
*r
)
256 if(V_VT(var
) == (VT_VARIANT
|VT_BYREF
))
257 var
= V_VARIANTREF(var
);
261 *r
= jsval_undefined();
267 *r
= jsval_bool(V_BOOL(var
));
270 *r
= jsval_number(V_I4(var
));
273 *r
= jsval_number(V_R8(var
));
279 str
= jsstr_alloc_len(V_BSTR(var
), SysStringLen(V_BSTR(var
)));
281 return E_OUTOFMEMORY
;
283 str
= jsstr_null_bstr();
286 *r
= jsval_string(str
);
291 IDispatch_AddRef(V_DISPATCH(var
));
292 *r
= jsval_disp(V_DISPATCH(var
));
296 *r
= jsval_number(V_I1(var
));
299 *r
= jsval_number(V_UI1(var
));
302 *r
= jsval_number(V_I2(var
));
305 *r
= jsval_number(V_UI2(var
));
308 *r
= jsval_number(V_INT(var
));
311 *r
= jsval_number(V_UI4(var
));
315 * Native doesn't support VT_UI8 here, but it's needed for IE9+ APIs
316 * (native IE9 doesn't use jscript.dll for JavaScript).
318 *r
= jsval_number(V_UI8(var
));
321 *r
= jsval_number(V_R4(var
));
328 hres
= IUnknown_QueryInterface(V_UNKNOWN(var
), &IID_IDispatch
, (void**)&disp
);
329 if(SUCCEEDED(hres
)) {
330 *r
= jsval_disp(disp
);
334 *r
= jsval_disp(NULL
);
339 return jsval_variant(r
, var
);
343 HRESULT
jsval_to_variant(jsval_t val
, VARIANT
*retv
)
345 switch(jsval_type(val
)) {
347 V_VT(retv
) = VT_EMPTY
;
350 V_VT(retv
) = VT_NULL
;
353 V_VT(retv
) = VT_DISPATCH
;
355 IDispatch_AddRef(get_object(val
));
356 V_DISPATCH(retv
) = get_object(val
);
359 V_VT(retv
) = VT_BSTR
;
360 return jsstr_to_bstr(get_string(val
), &V_BSTR(retv
));
362 double n
= get_number(val
);
375 V_VT(retv
) = VT_BOOL
;
376 V_BOOL(retv
) = get_bool(val
) ? VARIANT_TRUE
: VARIANT_FALSE
;
379 V_VT(retv
) = VT_EMPTY
;
380 return VariantCopy(retv
, get_variant(val
));
387 /* ECMA-262 3rd Edition 9.1 */
388 HRESULT
to_primitive(script_ctx_t
*ctx
, jsval_t val
, jsval_t
*ret
, hint_t hint
)
390 if(is_object_instance(val
)) {
396 static const WCHAR toStringW
[] = {'t','o','S','t','r','i','n','g',0};
397 static const WCHAR valueOfW
[] = {'v','a','l','u','e','O','f',0};
399 if(!get_object(val
)) {
404 jsdisp
= iface_to_jsdisp(get_object(val
));
406 return disp_propget(ctx
, get_object(val
), DISPID_VALUE
, ret
);
409 hint
= is_class(jsdisp
, JSCLASS_DATE
) ? HINT_STRING
: HINT_NUMBER
;
411 /* Native implementation doesn't throw TypeErrors, returns strange values */
413 hres
= jsdisp_get_id(jsdisp
, hint
== HINT_STRING
? toStringW
: valueOfW
, 0, &id
);
414 if(SUCCEEDED(hres
)) {
415 hres
= jsdisp_call(jsdisp
, id
, DISPATCH_METHOD
, 0, NULL
, &prim
);
417 WARN("call error - forwarding exception\n");
418 jsdisp_release(jsdisp
);
420 }else if(!is_object_instance(prim
)) {
421 jsdisp_release(jsdisp
);
425 IDispatch_Release(get_object(prim
));
429 hres
= jsdisp_get_id(jsdisp
, hint
== HINT_STRING
? valueOfW
: toStringW
, 0, &id
);
430 if(SUCCEEDED(hres
)) {
431 hres
= jsdisp_call(jsdisp
, id
, DISPATCH_METHOD
, 0, NULL
, &prim
);
433 WARN("call error - forwarding exception\n");
434 jsdisp_release(jsdisp
);
436 }else if(!is_object_instance(prim
)) {
437 jsdisp_release(jsdisp
);
441 IDispatch_Release(get_object(prim
));
445 jsdisp_release(jsdisp
);
448 return JS_E_TO_PRIMITIVE
;
451 return jsval_copy(val
, ret
);
455 /* ECMA-262 3rd Edition 9.2 */
456 HRESULT
to_boolean(jsval_t val
, BOOL
*ret
)
458 switch(jsval_type(val
)) {
464 *ret
= get_object(val
) != NULL
;
467 *ret
= jsstr_length(get_string(val
)) != 0;
470 *ret
= !isnan(get_number(val
)) && get_number(val
);
473 *ret
= get_bool(val
);
476 FIXME("unimplemented for variant %s\n", debugstr_variant(get_variant(val
)));
484 static int hex_to_int(WCHAR c
)
486 if('0' <= c
&& c
<= '9')
489 if('a' <= c
&& c
<= 'f')
492 if('A' <= c
&& c
<= 'F')
498 /* ECMA-262 3rd Edition 9.3.1 */
499 static HRESULT
str_to_number(jsstr_t
*str
, double *ret
)
505 static const WCHAR infinityW
[] = {'I','n','f','i','n','i','t','y'};
507 ptr
= jsstr_flatten(str
);
509 return E_OUTOFMEMORY
;
511 while(iswspace(*ptr
))
517 }else if(*ptr
== '+') {
521 if(!wcsncmp(ptr
, infinityW
, ARRAY_SIZE(infinityW
))) {
522 ptr
+= ARRAY_SIZE(infinityW
);
523 while(*ptr
&& iswspace(*ptr
))
529 *ret
= neg
? -INFINITY
: INFINITY
;
533 if(*ptr
== '0' && ptr
[1] == 'x') {
537 while((l
= hex_to_int(*ptr
)) != -1) {
546 while(is_digit(*ptr
))
547 d
= d
*10 + (*ptr
++ - '0');
549 if(*ptr
== 'e' || *ptr
== 'E') {
557 }else if(*ptr
== '+') {
561 while(is_digit(*ptr
))
562 l
= l
*10 + (*ptr
++ - '0');
567 }else if(*ptr
== '.') {
571 while(is_digit(*ptr
)) {
572 d
+= dec
* (*ptr
++ - '0');
577 while(iswspace(*ptr
))
592 /* ECMA-262 3rd Edition 9.3 */
593 HRESULT
to_number(script_ctx_t
*ctx
, jsval_t val
, double *ret
)
595 switch(jsval_type(val
)) {
603 *ret
= get_number(val
);
606 return str_to_number(get_string(val
), ret
);
611 hres
= to_primitive(ctx
, val
, &prim
, HINT_NUMBER
);
615 hres
= to_number(ctx
, prim
, ret
);
620 *ret
= get_bool(val
) ? 1 : 0;
623 FIXME("unimplemented for variant %s\n", debugstr_variant(get_variant(val
)));
631 /* ECMA-262 3rd Edition 9.4 */
632 HRESULT
to_integer(script_ctx_t
*ctx
, jsval_t v
, double *ret
)
637 hres
= to_number(ctx
, v
, &n
);
644 *ret
= n
>= 0.0 ? floor(n
) : -floor(-n
);
648 static INT32
double_to_int32(double number
)
657 exp
= ((INT32
)(bits
.n
>> 52) & 0x7ff) - 0x3ff;
659 /* If exponent < 0 there will be no bits to the left of the decimal point
660 * after rounding; if the exponent is > 83 then no bits of precision can be
661 * left in the low 32-bit range of the result (IEEE-754 doubles have 52 bits
662 * of fractional precision).
663 * Note this case handles 0, -0, and all infinite, NaN & denormal values. */
664 if(exp
< 0 || exp
> 83)
667 /* Select the appropriate 32-bits from the floating point mantissa. If the
668 * exponent is 52 then the bits we need to select are already aligned to the
669 * lowest bits of the 64-bit integer representation of the number, no need
670 * to shift. If the exponent is greater than 52 we need to shift the value
671 * left by (exp - 52), if the value is less than 52 we need to shift right
673 result
= (exp
> 52) ? bits
.n
<< (exp
- 52) : bits
.n
>> (52 - exp
);
675 /* IEEE-754 double precision values are stored omitting an implicit 1 before
676 * the decimal point; we need to reinsert this now. We may also the shifted
677 * invalid bits into the result that are not a part of the mantissa (the sign
678 * and exponent bits from the floatingpoint representation); mask these out. */
680 INT32 missing_one
= 1 << exp
;
681 result
&= missing_one
- 1;
682 result
+= missing_one
;
685 /* If the input value was negative (we could test either 'number' or 'bits',
686 * but testing 'bits' is likely faster) invert the result appropriately. */
687 return bits
.n
< 0 ? -result
: result
;
690 /* ECMA-262 3rd Edition 9.5 */
691 HRESULT
to_int32(script_ctx_t
*ctx
, jsval_t v
, INT
*ret
)
696 hres
= to_number(ctx
, v
, &n
);
700 *ret
= double_to_int32(n
);
704 /* ECMA-262 3rd Edition 9.6 */
705 HRESULT
to_uint32(script_ctx_t
*ctx
, jsval_t val
, UINT32
*ret
)
710 hres
= to_number(ctx
, val
, &n
);
714 *ret
= double_to_int32(n
);
718 HRESULT
double_to_string(double n
, jsstr_t
**str
)
720 static const WCHAR InfinityW
[] = {'-','I','n','f','i','n','i','t','y',0};
725 *str
= jsstr_alloc(n
<0 ? InfinityW
: InfinityW
+1);
726 }else if(is_int32(n
)) {
728 _ltow_s(n
, buf
, ARRAY_SIZE(buf
), 10);
729 *str
= jsstr_alloc(buf
);
734 /* FIXME: Don't use VariantChangeTypeEx */
737 V_VT(&strv
) = VT_EMPTY
;
738 hres
= VariantChangeTypeEx(&strv
, &v
, MAKELCID(MAKELANGID(LANG_ENGLISH
,SUBLANG_ENGLISH_US
),SORT_DEFAULT
), 0, VT_BSTR
);
742 *str
= jsstr_alloc(V_BSTR(&strv
));
743 SysFreeString(V_BSTR(&strv
));
746 return *str
? S_OK
: E_OUTOFMEMORY
;
749 /* ECMA-262 3rd Edition 9.8 */
750 HRESULT
to_string(script_ctx_t
*ctx
, jsval_t val
, jsstr_t
**str
)
752 static const WCHAR nullW
[] = {'n','u','l','l',0};
753 static const WCHAR trueW
[] = {'t','r','u','e',0};
754 static const WCHAR falseW
[] = {'f','a','l','s','e',0};
756 switch(jsval_type(val
)) {
758 *str
= jsstr_undefined();
761 *str
= jsstr_alloc(nullW
);
764 return double_to_string(get_number(val
), str
);
766 *str
= jsstr_addref(get_string(val
));
772 hres
= to_primitive(ctx
, val
, &prim
, HINT_STRING
);
776 hres
= to_string(ctx
, prim
, str
);
781 *str
= jsstr_alloc(get_bool(val
) ? trueW
: falseW
);
784 FIXME("unsupported %s\n", debugstr_jsval(val
));
788 return *str
? S_OK
: E_OUTOFMEMORY
;
791 HRESULT
to_flat_string(script_ctx_t
*ctx
, jsval_t val
, jsstr_t
**str
, const WCHAR
**ret_str
)
795 hres
= to_string(ctx
, val
, str
);
799 *ret_str
= jsstr_flatten(*str
);
802 return E_OUTOFMEMORY
;
808 /* ECMA-262 3rd Edition 9.9 */
809 HRESULT
to_object(script_ctx_t
*ctx
, jsval_t val
, IDispatch
**disp
)
814 switch(jsval_type(val
)) {
816 hres
= create_string(ctx
, get_string(val
), &dispex
);
820 *disp
= to_disp(dispex
);
823 hres
= create_number(ctx
, get_number(val
), &dispex
);
827 *disp
= to_disp(dispex
);
830 if(get_object(val
)) {
831 *disp
= get_object(val
);
832 IDispatch_AddRef(*disp
);
836 hres
= create_object(ctx
, NULL
, &obj
);
840 *disp
= to_disp(obj
);
844 hres
= create_bool(ctx
, get_bool(val
), &dispex
);
848 *disp
= to_disp(dispex
);
852 WARN("object expected\n");
853 return JS_E_OBJECT_EXPECTED
;
855 switch(V_VT(get_variant(val
))) {
856 case VT_ARRAY
|VT_VARIANT
:
857 hres
= create_vbarray(ctx
, V_ARRAY(get_variant(val
)), &dispex
);
861 *disp
= to_disp(dispex
);
865 FIXME("Unsupported %s\n", debugstr_variant(get_variant(val
)));
874 HRESULT
variant_change_type(script_ctx_t
*ctx
, VARIANT
*dst
, VARIANT
*src
, VARTYPE vt
)
880 hres
= variant_to_jsval(src
, &val
);
884 enter_script(ctx
, &ei
);
891 hres
= to_int32(ctx
, val
, &i
);
892 if(SUCCEEDED(hres
)) {
903 hres
= to_uint32(ctx
, val
, &i
);
910 hres
= to_number(ctx
, val
, &n
);
918 hres
= to_number(ctx
, val
, &n
);
926 hres
= to_boolean(val
, &b
);
928 V_BOOL(dst
) = b
? VARIANT_TRUE
: VARIANT_FALSE
;
934 hres
= to_string(ctx
, val
, &str
);
938 hres
= jsstr_to_bstr(str
, &V_BSTR(dst
));
942 hres
= V_VT(src
) == VT_EMPTY
? S_OK
: E_NOTIMPL
;
945 hres
= V_VT(src
) == VT_NULL
? S_OK
: E_NOTIMPL
;
948 FIXME("vt %d not implemented\n", vt
);
953 leave_script(ctx
, hres
);
961 static inline JSCaller
*impl_from_IServiceProvider(IServiceProvider
*iface
)
963 return CONTAINING_RECORD(iface
, JSCaller
, IServiceProvider_iface
);
966 static HRESULT WINAPI
JSCaller_QueryInterface(IServiceProvider
*iface
, REFIID riid
, void **ppv
)
968 JSCaller
*This
= impl_from_IServiceProvider(iface
);
970 if(IsEqualGUID(&IID_IUnknown
, riid
)) {
971 TRACE("(%p)->(IID_IUnknown %p)\n", This
, ppv
);
972 *ppv
= &This
->IServiceProvider_iface
;
973 }else if(IsEqualGUID(&IID_IServiceProvider
, riid
)) {
974 TRACE("(%p)->(IID_IServiceProvider %p)\n", This
, ppv
);
975 *ppv
= &This
->IServiceProvider_iface
;
977 WARN("(%p)->(%s %p)\n", This
, debugstr_guid(riid
), ppv
);
979 return E_NOINTERFACE
;
982 IUnknown_AddRef((IUnknown
*)*ppv
);
986 static ULONG WINAPI
JSCaller_AddRef(IServiceProvider
*iface
)
988 JSCaller
*This
= impl_from_IServiceProvider(iface
);
989 LONG ref
= InterlockedIncrement(&This
->ref
);
991 TRACE("(%p) ref=%d\n", This
, ref
);
996 static ULONG WINAPI
JSCaller_Release(IServiceProvider
*iface
)
998 JSCaller
*This
= impl_from_IServiceProvider(iface
);
999 LONG ref
= InterlockedIncrement(&This
->ref
);
1001 TRACE("(%p) ref=%d\n", This
, ref
);
1011 static HRESULT WINAPI
JSCaller_QueryService(IServiceProvider
*iface
, REFGUID guidService
,
1012 REFIID riid
, void **ppv
)
1014 JSCaller
*This
= impl_from_IServiceProvider(iface
);
1016 if(IsEqualGUID(guidService
, &SID_VariantConversion
) && This
->ctx
&& This
->ctx
->active_script
) {
1017 TRACE("(%p)->(SID_VariantConversion)\n", This
);
1018 return IActiveScript_QueryInterface(This
->ctx
->active_script
, riid
, ppv
);
1021 FIXME("(%p)->(%s %s %p)\n", This
, debugstr_guid(guidService
), debugstr_guid(riid
), ppv
);
1024 return E_NOINTERFACE
;
1027 static const IServiceProviderVtbl ServiceProviderVtbl
= {
1028 JSCaller_QueryInterface
,
1031 JSCaller_QueryService
1034 HRESULT
create_jscaller(script_ctx_t
*ctx
)
1038 ret
= heap_alloc(sizeof(*ret
));
1040 return E_OUTOFMEMORY
;
1042 ret
->IServiceProvider_iface
.lpVtbl
= &ServiceProviderVtbl
;
1046 ctx
->jscaller
= ret
;