1 /* -----------------------------------------------------------------------------
2 * $Id: PrimOps.hc,v 1.74 2001/03/22 03:51:10 hwloidl Exp $
4 * (c) The GHC Team, 1998-2000
6 * Primitive functions / data
8 * ---------------------------------------------------------------------------*/
13 #include "StgStartup.h"
18 #include "BlockAlloc.h" /* tmp */
19 #include "StablePriv.h"
20 #include "HeapStackCheck.h"
27 classes CCallable and CReturnable don't really exist, but the
28 compiler insists on generating dictionaries containing references
29 to GHC_ZcCCallable_static_info etc., so we provide dummy symbols
30 for these. Some C compilers can't cope with zero-length static arrays,
31 so we have to make these one element long.
34 StgWord GHC_ZCCCallable_static_info[1];
35 StgWord GHC_ZCCReturnable_static_info[1];
37 /* -----------------------------------------------------------------------------
38 Macros for Hand-written primitives.
39 -------------------------------------------------------------------------- */
42 * Horrible macros for returning unboxed tuples.
44 * How an unboxed tuple is returned depends on two factors:
45 * - the number of real registers we have available
46 * - the boxedness of the returned fields.
48 * To return an unboxed tuple from a primitive operation, we have macros
49 * RET_<layout> where <layout> describes the boxedness of each field of the
50 * unboxed tuple: N indicates a non-pointer field, and P indicates a pointer.
52 * We only define the cases actually used, to avoid having too much
53 * garbage in this section. Warning: any bugs in here will be hard to
57 /*------ All Regs available */
59 # define RET_P(a) R1.w = (W_)(a); JMP_(ENTRY_CODE(Sp[0]));
60 # define RET_N(a) RET_P(a)
62 # define RET_PP(a,b) R1.w = (W_)(a); R2.w = (W_)(b); JMP_(ENTRY_CODE(Sp[0]));
63 # define RET_NN(a,b) RET_PP(a,b)
64 # define RET_NP(a,b) RET_PP(a,b)
66 # define RET_PPP(a,b,c) \
67 R1.w = (W_)(a); R2.w = (W_)(b); R3.w = (W_)(c); JMP_(ENTRY_CODE(Sp[0]));
68 # define RET_NNP(a,b,c) RET_PPP(a,b,c)
70 # define RET_NNNP(a,b,c,d) \
71 R1.w = (W_)(a); R2.w = (W_)(b); R3.w = (W_)(c); R4.w = (W_)d; \
72 JMP_(ENTRY_CODE(Sp[0]));
74 # define RET_NPNP(a,b,c,d) \
75 R1.w = (W_)(a); R2.w = (W_)(b); R3.w = (W_)(c); R4.w = (W_)(d); \
76 JMP_(ENTRY_CODE(Sp[0]));
78 # define RET_NNPNNP(a,b,c,d,e,f) \
79 R1.w = (W_)(a); R2.w = (W_)(b); R3.w = (W_)(c); \
80 R4.w = (W_)(d); R5.w = (W_)(e); R6.w = (W_)(f); \
81 JMP_(ENTRY_CODE(Sp[0]));
83 #elif defined(REG_R7) || defined(REG_R6) || defined(REG_R5) || \
84 defined(REG_R4) || defined(REG_R3)
85 # error RET_n macros not defined for this setup.
87 /*------ 2 Registers available */
90 # define RET_P(a) R1.w = (W_)(a); JMP_(ENTRY_CODE(Sp[0]));
91 # define RET_N(a) RET_P(a)
93 # define RET_PP(a,b) R1.w = (W_)(a); R2.w = (W_)(b); \
94 JMP_(ENTRY_CODE(Sp[0]));
95 # define RET_NN(a,b) RET_PP(a,b)
96 # define RET_NP(a,b) RET_PP(a,b)
98 # define RET_PPP(a,b,c) \
99 R1.w = (W_)(a); R2.w = (W_)(b); Sp[-1] = (W_)(c); Sp -= 1; \
100 JMP_(ENTRY_CODE(Sp[1]));
101 # define RET_NNP(a,b,c) \
102 R1.w = (W_)(a); R2.w = (W_)(b); Sp[-1] = (W_)(c); Sp -= 1; \
103 JMP_(ENTRY_CODE(Sp[1]));
105 # define RET_NNNP(a,b,c,d) \
108 /* Sp[-3] = ARGTAG(1); */ \
112 JMP_(ENTRY_CODE(Sp[3]));
114 # define RET_NPNP(a,b,c,d) \
117 /* Sp[-3] = ARGTAG(1); */ \
121 JMP_(ENTRY_CODE(Sp[3]));
123 # define RET_NNPNNP(a,b,c,d,e,f) \
127 /* Sp[-5] = ARGTAG(1); */ \
129 /* Sp[-3] = ARGTAG(1); */ \
133 JMP_(ENTRY_CODE(Sp[6]));
135 /*------ 1 Register available */
136 #elif defined(REG_R1)
137 # define RET_P(a) R1.w = (W_)(a); JMP_(ENTRY_CODE(Sp[0]));
138 # define RET_N(a) RET_P(a)
140 # define RET_PP(a,b) R1.w = (W_)(a); Sp[-1] = (W_)(b); Sp -= 1; \
141 JMP_(ENTRY_CODE(Sp[1]));
142 # define RET_NN(a,b) R1.w = (W_)(a); Sp[-1] = (W_)(b); Sp -= 2; \
143 JMP_(ENTRY_CODE(Sp[2]));
144 # define RET_NP(a,b) RET_PP(a,b)
146 # define RET_PPP(a,b,c) \
147 R1.w = (W_)(a); Sp[-2] = (W_)(b); Sp[-1] = (W_)(c); Sp -= 2; \
148 JMP_(ENTRY_CODE(Sp[2]));
149 # define RET_NNP(a,b,c) \
150 R1.w = (W_)(a); Sp[-2] = (W_)(b); Sp[-1] = (W_)(c); Sp -= 3; \
151 JMP_(ENTRY_CODE(Sp[3]));
153 # define RET_NNNP(a,b,c,d) \
155 /* Sp[-5] = ARGTAG(1); */ \
157 /* Sp[-3] = ARGTAG(1); */ \
161 JMP_(ENTRY_CODE(Sp[5]));
163 # define RET_NPNP(a,b,c,d) \
166 /* Sp[-3] = ARGTAG(1); */ \
170 JMP_(ENTRY_CODE(Sp[4]));
172 # define RET_NNPNNP(a,b,c,d,e,f) \
176 /* Sp[-3] = ARGTAG(1); */ \
178 /* Sp[-5] = ARGTAG(1); */ \
181 /* Sp[-8] = ARGTAG(1); */ \
183 JMP_(ENTRY_CODE(Sp[8]));
185 #else /* 0 Regs available */
187 #define PUSH_P(o,x) Sp[-o] = (W_)(x)
190 #define PUSH_N(o,x) Sp[1-o] = (W_)(x); Sp[-o] = ARG_TAG(1);
192 #define PUSH_N(o,x) Sp[1-o] = (W_)(x);
195 #define PUSHED(m) Sp -= (m); JMP_(ENTRY_CODE(Sp[m]));
197 /* Here's how to construct these macros:
199 * N = number of N's in the name;
200 * P = number of P's in the name;
202 * while (nonNull(name)) {
203 * if (nextChar == 'P') {
214 # define RET_P(a) PUSH_P(1,a); PUSHED(1)
215 # define RET_N(a) PUSH_N(2,a); PUSHED(2)
217 # define RET_PP(a,b) PUSH_P(2,a); PUSH_P(1,b); PUSHED(2)
218 # define RET_NN(a,b) PUSH_N(4,a); PUSH_N(2,b); PUSHED(4)
219 # define RET_NP(a,b) PUSH_N(3,a); PUSH_P(1,b); PUSHED(3)
221 # define RET_PPP(a,b,c) PUSH_P(3,a); PUSH_P(2,b); PUSH_P(1,c); PUSHED(3)
222 # define RET_NNP(a,b,c) PUSH_N(5,a); PUSH_N(3,b); PUSH_P(1,c); PUSHED(5)
224 # define RET_NNNP(a,b,c,d) PUSH_N(7,a); PUSH_N(5,b); PUSH_N(3,c); PUSH_P(1,d); PUSHED(7)
225 # define RET_NPNP(a,b,c,d) PUSH_N(6,a); PUSH_P(4,b); PUSH_N(3,c); PUSH_P(1,d); PUSHED(6)
226 # define RET_NNPNNP(a,b,c,d,e,f) PUSH_N(10,a); PUSH_N(8,b); PUSH_P(6,c); PUSH_N(5,d); PUSH_N(3,e); PUSH_P(1,f); PUSHED(10)
230 /*-----------------------------------------------------------------------------
233 Basically just new*Array - the others are all inline macros.
235 The size arg is always passed in R1, and the result returned in R1.
237 The slow entry point is for returning from a heap check, the saved
238 size argument must be re-loaded from the stack.
239 -------------------------------------------------------------------------- */
241 /* for objects that are *less* than the size of a word, make sure we
242 * round up to the nearest word for the size of the array.
245 #define BYTES_TO_STGWORDS(n) ((n) + sizeof(W_) - 1)/sizeof(W_)
247 FN_(newByteArrayzh_fast) \
249 W_ size, stuff_size, n; \
252 MAYBE_GC(NO_PTRS,newByteArrayzh_fast); \
254 stuff_size = BYTES_TO_STGWORDS(n); \
255 size = sizeofW(StgArrWords)+ stuff_size; \
256 p = (StgArrWords *)RET_STGCALL1(P_,allocate,size); \
257 TICK_ALLOC_PRIM(sizeofW(StgArrWords),stuff_size,0); \
258 SET_HDR(p, &stg_ARR_WORDS_info, CCCS); \
259 p->words = stuff_size; \
260 TICK_RET_UNBOXED_TUP(1) \
273 MAYBE_GC(R2_PTR,newArrayzh_fast);
275 size = sizeofW(StgMutArrPtrs) + n;
276 arr = (StgMutArrPtrs *)RET_STGCALL1(P_, allocate, size);
277 TICK_ALLOC_PRIM(sizeofW(StgMutArrPtrs), n, 0);
279 SET_HDR(arr,&stg_MUT_ARR_PTRS_info,CCCS);
283 for (p = (P_)arr + sizeofW(StgMutArrPtrs);
284 p < (P_)arr + size; p++) {
288 TICK_RET_UNBOXED_TUP(1);
293 FN_(newMutVarzh_fast)
296 /* Args: R1.p = initialisation value */
299 HP_CHK_GEN_TICKY(sizeofW(StgMutVar), R1_PTR, newMutVarzh_fast,);
300 TICK_ALLOC_PRIM(sizeofW(StgHeader)+1,1, 0); /* hack, dependent on rep. */
301 CCS_ALLOC(CCCS,sizeofW(StgMutVar));
303 mv = (StgMutVar *)(Hp-sizeofW(StgMutVar)+1);
304 SET_HDR(mv,&stg_MUT_VAR_info,CCCS);
307 TICK_RET_UNBOXED_TUP(1);
312 /* -----------------------------------------------------------------------------
313 Foreign Object Primitives
315 -------------------------------------------------------------------------- */
317 FN_(mkForeignObjzh_fast)
319 /* R1.p = ptr to foreign object,
321 StgForeignObj *result;
324 HP_CHK_GEN_TICKY(sizeofW(StgForeignObj), NO_PTRS, mkForeignObjzh_fast,);
325 TICK_ALLOC_PRIM(sizeofW(StgHeader),
326 sizeofW(StgForeignObj)-sizeofW(StgHeader), 0);
327 CCS_ALLOC(CCCS,sizeofW(StgForeignObj)); /* ccs prof */
329 result = (StgForeignObj *) (Hp + 1 - sizeofW(StgForeignObj));
330 SET_HDR(result,&stg_FOREIGN_info,CCCS);
333 /* returns (# s#, ForeignObj# #) */
334 TICK_RET_UNBOXED_TUP(1);
339 /* These two are out-of-line for the benefit of the NCG */
340 FN_(unsafeThawArrayzh_fast)
343 SET_INFO((StgClosure *)R1.cl,&stg_MUT_ARR_PTRS_info);
344 recordMutable((StgMutClosure*)R1.cl);
346 TICK_RET_UNBOXED_TUP(1);
351 /* -----------------------------------------------------------------------------
352 Weak Pointer Primitives
353 -------------------------------------------------------------------------- */
359 R3.p = finalizer (or NULL)
365 R3.cl = &stg_NO_FINALIZER_closure;
368 HP_CHK_GEN_TICKY(sizeofW(StgWeak),R1_PTR|R2_PTR|R3_PTR, mkWeakzh_fast,);
369 TICK_ALLOC_PRIM(sizeofW(StgHeader)+1, // +1 is for the link field
370 sizeofW(StgWeak)-sizeofW(StgHeader)-1, 0);
371 CCS_ALLOC(CCCS,sizeofW(StgWeak)); /* ccs prof */
373 w = (StgWeak *) (Hp + 1 - sizeofW(StgWeak));
374 SET_HDR(w, &stg_WEAK_info, CCCS);
378 w->finalizer = R3.cl;
380 w->link = weak_ptr_list;
382 IF_DEBUG(weak, fprintf(stderr,"New weak pointer at %p\n",w));
384 TICK_RET_UNBOXED_TUP(1);
389 FN_(finalizzeWeakzh_fast)
396 TICK_RET_UNBOXED_TUP(0);
397 w = (StgDeadWeak *)R1.p;
400 if (w->header.info == &stg_DEAD_WEAK_info) {
401 RET_NP(0,&stg_NO_FINALIZER_closure);
405 w->header.info = &stg_DEAD_WEAK_info;
406 f = ((StgWeak *)w)->finalizer;
407 w->link = ((StgWeak *)w)->link;
409 /* return the finalizer */
410 if (f == &stg_NO_FINALIZER_closure) {
411 RET_NP(0,&stg_NO_FINALIZER_closure);
418 /* -----------------------------------------------------------------------------
419 Arbitrary-precision Integer operations.
420 -------------------------------------------------------------------------- */
422 FN_(int2Integerzh_fast)
424 /* arguments: R1 = Int# */
426 I_ val, s; /* to avoid aliasing */
427 StgArrWords* p; /* address of array result */
431 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, int2Integerzh_fast,);
432 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
433 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
435 p = (StgArrWords *)Hp - 1;
436 SET_ARR_HDR(p, &stg_ARR_WORDS_info, CCCS, 1);
438 /* mpz_set_si is inlined here, makes things simpler */
442 } else if (val > 0) {
449 /* returns (# size :: Int#,
453 TICK_RET_UNBOXED_TUP(2);
458 FN_(word2Integerzh_fast)
460 /* arguments: R1 = Word# */
462 W_ val; /* to avoid aliasing */
464 StgArrWords* p; /* address of array result */
468 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, word2Integerzh_fast,)
469 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
470 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
472 p = (StgArrWords *)Hp - 1;
473 SET_ARR_HDR(p, &stg_ARR_WORDS_info, CCCS, 1);
482 /* returns (# size :: Int#,
486 TICK_RET_UNBOXED_TUP(2);
493 * 'long long' primops for converting to/from Integers.
496 #ifdef SUPPORT_LONG_LONGS
498 FN_(int64ToIntegerzh_fast)
500 /* arguments: L1 = Int64# */
502 StgInt64 val; /* to avoid aliasing */
504 I_ s, neg, words_needed;
505 StgArrWords* p; /* address of array result */
511 if ( val >= 0x100000000LL || val <= -0x100000000LL ) {
514 /* minimum is one word */
517 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+words_needed, NO_PTRS, int64ToIntegerzh_fast,)
518 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
519 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
521 p = (StgArrWords *)(Hp-words_needed+1) - 1;
522 SET_ARR_HDR(p, &stg_ARR_WORDS_info, CCCS, words_needed);
529 hi = (W_)((LW_)val / 0x100000000ULL);
531 if ( words_needed == 2 ) {
535 } else if ( val != 0 ) {
538 } else /* val==0 */ {
541 s = ( neg ? -s : s );
543 /* returns (# size :: Int#,
547 TICK_RET_UNBOXED_TUP(2);
552 FN_(word64ToIntegerzh_fast)
554 /* arguments: L1 = Word64# */
556 StgWord64 val; /* to avoid aliasing */
559 StgArrWords* p; /* address of array result */
563 if ( val >= 0x100000000ULL ) {
568 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+words_needed, NO_PTRS, word64ToIntegerzh_fast,)
569 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
570 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
572 p = (StgArrWords *)(Hp-words_needed+1) - 1;
573 SET_ARR_HDR(p, &stg_ARR_WORDS_info, CCCS, words_needed);
575 hi = (W_)((LW_)val / 0x100000000ULL);
576 if ( val >= 0x100000000ULL ) {
580 } else if ( val != 0 ) {
583 } else /* val==0 */ {
587 /* returns (# size :: Int#,
591 TICK_RET_UNBOXED_TUP(2);
597 #endif /* HAVE_LONG_LONG */
599 /* ToDo: this is shockingly inefficient */
601 #define GMP_TAKE2_RET1(name,mp_fun) \
604 MP_INT arg1, arg2, result; \
610 /* call doYouWantToGC() */ \
611 MAYBE_GC(R2_PTR | R4_PTR, name); \
613 d1 = (StgArrWords *)R2.p; \
615 d2 = (StgArrWords *)R4.p; \
618 arg1._mp_alloc = d1->words; \
619 arg1._mp_size = (s1); \
620 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
621 arg2._mp_alloc = d2->words; \
622 arg2._mp_size = (s2); \
623 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
625 STGCALL1(mpz_init,&result); \
627 /* Perform the operation */ \
628 STGCALL3(mp_fun,&result,&arg1,&arg2); \
630 TICK_RET_UNBOXED_TUP(2); \
631 RET_NP(result._mp_size, \
632 result._mp_d-sizeofW(StgArrWords)); \
636 #define GMP_TAKE1_RET1(name,mp_fun) \
639 MP_INT arg1, result; \
644 /* call doYouWantToGC() */ \
645 MAYBE_GC(R2_PTR, name); \
647 d1 = (StgArrWords *)R2.p; \
650 arg1._mp_alloc = d1->words; \
651 arg1._mp_size = (s1); \
652 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
654 STGCALL1(mpz_init,&result); \
656 /* Perform the operation */ \
657 STGCALL2(mp_fun,&result,&arg1); \
659 TICK_RET_UNBOXED_TUP(2); \
660 RET_NP(result._mp_size, \
661 result._mp_d-sizeofW(StgArrWords)); \
665 #define GMP_TAKE2_RET2(name,mp_fun) \
668 MP_INT arg1, arg2, result1, result2; \
674 /* call doYouWantToGC() */ \
675 MAYBE_GC(R2_PTR | R4_PTR, name); \
677 d1 = (StgArrWords *)R2.p; \
679 d2 = (StgArrWords *)R4.p; \
682 arg1._mp_alloc = d1->words; \
683 arg1._mp_size = (s1); \
684 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
685 arg2._mp_alloc = d2->words; \
686 arg2._mp_size = (s2); \
687 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
689 STGCALL1(mpz_init,&result1); \
690 STGCALL1(mpz_init,&result2); \
692 /* Perform the operation */ \
693 STGCALL4(mp_fun,&result1,&result2,&arg1,&arg2); \
695 TICK_RET_UNBOXED_TUP(4); \
696 RET_NPNP(result1._mp_size, \
697 result1._mp_d-sizeofW(StgArrWords), \
699 result2._mp_d-sizeofW(StgArrWords)); \
703 GMP_TAKE2_RET1(plusIntegerzh_fast, mpz_add);
704 GMP_TAKE2_RET1(minusIntegerzh_fast, mpz_sub);
705 GMP_TAKE2_RET1(timesIntegerzh_fast, mpz_mul);
706 GMP_TAKE2_RET1(gcdIntegerzh_fast, mpz_gcd);
707 GMP_TAKE2_RET1(quotIntegerzh_fast, mpz_tdiv_q);
708 GMP_TAKE2_RET1(remIntegerzh_fast, mpz_tdiv_r);
709 GMP_TAKE2_RET1(divExactIntegerzh_fast, mpz_divexact);
710 GMP_TAKE2_RET1(andIntegerzh_fast, mpz_and);
711 GMP_TAKE2_RET1(orIntegerzh_fast, mpz_ior);
712 GMP_TAKE2_RET1(xorIntegerzh_fast, mpz_xor);
713 GMP_TAKE1_RET1(complementIntegerzh_fast, mpz_com);
715 GMP_TAKE2_RET2(quotRemIntegerzh_fast, mpz_tdiv_qr);
716 GMP_TAKE2_RET2(divModIntegerzh_fast, mpz_fdiv_qr);
718 FN_(decodeFloatzh_fast)
726 /* arguments: F1 = Float# */
729 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, decodeFloatzh_fast,);
730 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
731 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
733 /* Be prepared to tell Lennart-coded __decodeFloat */
734 /* where mantissa._mp_d can be put (it does not care about the rest) */
735 p = (StgArrWords *)Hp - 1;
736 SET_ARR_HDR(p,&stg_ARR_WORDS_info,CCCS,1)
737 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
739 /* Perform the operation */
740 STGCALL3(__decodeFloat,&mantissa,&exponent,arg);
742 /* returns: (Int# (expn), Int#, ByteArray#) */
743 TICK_RET_UNBOXED_TUP(3);
744 RET_NNP(exponent,mantissa._mp_size,p);
748 #define DOUBLE_MANTISSA_SIZE (sizeofW(StgDouble))
749 #define ARR_SIZE (sizeofW(StgArrWords) + DOUBLE_MANTISSA_SIZE)
751 FN_(decodeDoublezh_fast)
758 /* arguments: D1 = Double# */
761 HP_CHK_GEN_TICKY(ARR_SIZE, NO_PTRS, decodeDoublezh_fast,);
762 TICK_ALLOC_PRIM(sizeofW(StgArrWords),DOUBLE_MANTISSA_SIZE,0);
763 CCS_ALLOC(CCCS,ARR_SIZE); /* ccs prof */
765 /* Be prepared to tell Lennart-coded __decodeDouble */
766 /* where mantissa.d can be put (it does not care about the rest) */
767 p = (StgArrWords *)(Hp-ARR_SIZE+1);
768 SET_ARR_HDR(p, &stg_ARR_WORDS_info, CCCS, DOUBLE_MANTISSA_SIZE);
769 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
771 /* Perform the operation */
772 STGCALL3(__decodeDouble,&mantissa,&exponent,arg);
774 /* returns: (Int# (expn), Int#, ByteArray#) */
775 TICK_RET_UNBOXED_TUP(3);
776 RET_NNP(exponent,mantissa._mp_size,p);
780 /* -----------------------------------------------------------------------------
781 * Concurrency primitives
782 * -------------------------------------------------------------------------- */
787 /* args: R1 = closure to spark */
789 MAYBE_GC(R1_PTR, forkzh_fast);
791 /* create it right now, return ThreadID in R1 */
792 R1.t = RET_STGCALL2(StgTSO *, createIOThread,
793 RtsFlags.GcFlags.initialStkSize, R1.cl);
794 STGCALL1(scheduleThread, R1.t);
796 /* switch at the earliest opportunity */
799 JMP_(ENTRY_CODE(Sp[0]));
806 JMP_(stg_yield_noregs);
817 HP_CHK_GEN_TICKY(sizeofW(StgMVar), NO_PTRS, newMVarzh_fast,);
818 TICK_ALLOC_PRIM(sizeofW(StgMutVar)-1, // consider head,tail,link as admin wds
820 CCS_ALLOC(CCCS,sizeofW(StgMVar)); /* ccs prof */
822 mvar = (StgMVar *) (Hp - sizeofW(StgMVar) + 1);
823 SET_HDR(mvar,&stg_EMPTY_MVAR_info,CCCS);
824 mvar->head = mvar->tail = (StgTSO *)&stg_END_TSO_QUEUE_closure;
825 mvar->value = (StgClosure *)&stg_END_TSO_QUEUE_closure;
827 TICK_RET_UNBOXED_TUP(1);
836 const StgInfoTable *info;
839 /* args: R1 = MVar closure */
841 mvar = (StgMVar *)R1.p;
844 info = LOCK_CLOSURE(mvar);
846 info = GET_INFO(mvar);
849 /* If the MVar is empty, put ourselves on its blocking queue,
850 * and wait until we're woken up.
852 if (info == &stg_EMPTY_MVAR_info) {
853 if (mvar->head == (StgTSO *)&stg_END_TSO_QUEUE_closure) {
854 mvar->head = CurrentTSO;
856 mvar->tail->link = CurrentTSO;
858 CurrentTSO->link = (StgTSO *)&stg_END_TSO_QUEUE_closure;
859 CurrentTSO->why_blocked = BlockedOnMVar;
860 CurrentTSO->block_info.closure = (StgClosure *)mvar;
861 mvar->tail = CurrentTSO;
864 /* unlock the MVar */
865 mvar->header.info = &stg_EMPTY_MVAR_info;
867 BLOCK(R1_PTR, takeMVarzh_fast);
871 mvar->value = (StgClosure *)&stg_END_TSO_QUEUE_closure;
873 /* wake up the first thread on the queue
875 if (mvar->head != (StgTSO *)&stg_END_TSO_QUEUE_closure) {
876 ASSERT(mvar->head->why_blocked == BlockedOnMVar);
877 #if defined(GRAN) || defined(PAR)
878 /* ToDo: check 2nd arg (mvar) is right */
879 mvar->head = RET_STGCALL2(StgTSO *,unblockOne,mvar->head,mvar);
881 mvar->head = RET_STGCALL1(StgTSO *,unblockOne,mvar->head);
883 if (mvar->head == (StgTSO *)&stg_END_TSO_QUEUE_closure) {
884 mvar->tail = (StgTSO *)&stg_END_TSO_QUEUE_closure;
888 /* do this last... we might have locked the MVar in the SMP case,
889 * and writing the info pointer will unlock it.
891 SET_INFO(mvar,&stg_EMPTY_MVAR_info);
893 TICK_RET_UNBOXED_TUP(1);
898 FN_(tryTakeMVarzh_fast)
902 const StgInfoTable *info;
905 /* args: R1 = MVar closure */
907 mvar = (StgMVar *)R1.p;
910 info = LOCK_CLOSURE(mvar);
912 info = GET_INFO(mvar);
915 if (info == &stg_EMPTY_MVAR_info) {
918 /* unlock the MVar */
919 mvar->header.info = &stg_EMPTY_MVAR_info;
922 /* HACK: we need a pointer to pass back, so we abuse NO_FINALIZER_closure */
923 RET_NP(0, &stg_NO_FINALIZER_closure);
927 mvar->value = (StgClosure *)&stg_END_TSO_QUEUE_closure;
929 /* wake up the first thread on the queue
931 if (mvar->head != (StgTSO *)&stg_END_TSO_QUEUE_closure) {
932 ASSERT(mvar->head->why_blocked == BlockedOnMVar);
933 #if defined(GRAN) || defined(PAR)
934 /* ToDo: check 2nd arg (mvar) is right */
935 mvar->head = RET_STGCALL2(StgTSO *,unblockOne,mvar->head,mvar);
937 mvar->head = RET_STGCALL1(StgTSO *,unblockOne,mvar->head);
939 if (mvar->head == (StgTSO *)&stg_END_TSO_QUEUE_closure) {
940 mvar->tail = (StgTSO *)&stg_END_TSO_QUEUE_closure;
944 /* do this last... we might have locked the MVar in the SMP case,
945 * and writing the info pointer will unlock it.
947 SET_INFO(mvar,&stg_EMPTY_MVAR_info);
949 TICK_RET_UNBOXED_TUP(1);
957 const StgInfoTable *info;
960 /* args: R1 = MVar, R2 = value */
962 mvar = (StgMVar *)R1.p;
965 info = LOCK_CLOSURE(mvar);
967 info = GET_INFO(mvar);
970 if (info == &stg_FULL_MVAR_info) {
971 if (mvar->head == (StgTSO *)&stg_END_TSO_QUEUE_closure) {
972 mvar->head = CurrentTSO;
974 mvar->tail->link = CurrentTSO;
976 CurrentTSO->link = (StgTSO *)&stg_END_TSO_QUEUE_closure;
977 CurrentTSO->why_blocked = BlockedOnMVar;
978 CurrentTSO->block_info.closure = (StgClosure *)mvar;
979 mvar->tail = CurrentTSO;
982 /* unlock the MVar */
983 mvar->header.info = &stg_FULL_MVAR_info;
985 BLOCK( R1_PTR | R2_PTR, putMVarzh_fast );
990 /* wake up the first thread on the queue, it will continue with the
991 * takeMVar operation and mark the MVar empty again.
993 if (mvar->head != (StgTSO *)&stg_END_TSO_QUEUE_closure) {
994 ASSERT(mvar->head->why_blocked == BlockedOnMVar);
995 #if defined(GRAN) || defined(PAR)
996 /* ToDo: check 2nd arg (mvar) is right */
997 mvar->head = RET_STGCALL2(StgTSO *,unblockOne,mvar->head,mvar);
999 mvar->head = RET_STGCALL1(StgTSO *,unblockOne,mvar->head);
1001 if (mvar->head == (StgTSO *)&stg_END_TSO_QUEUE_closure) {
1002 mvar->tail = (StgTSO *)&stg_END_TSO_QUEUE_closure;
1006 /* unlocks the MVar in the SMP case */
1007 SET_INFO(mvar,&stg_FULL_MVAR_info);
1009 /* ToDo: yield here for better communication performance? */
1010 JMP_(ENTRY_CODE(Sp[0]));
1014 FN_(tryPutMVarzh_fast)
1017 const StgInfoTable *info;
1020 /* args: R1 = MVar, R2 = value */
1022 mvar = (StgMVar *)R1.p;
1025 info = LOCK_CLOSURE(mvar);
1027 info = GET_INFO(mvar);
1030 if (info == &stg_FULL_MVAR_info) {
1033 /* unlock the MVar */
1034 mvar->header.info = &stg_FULL_MVAR_info;
1037 /* HACK: we need a pointer to pass back, so we abuse NO_FINALIZER_closure */
1041 mvar->value = R2.cl;
1043 /* wake up the first thread on the queue, it will continue with the
1044 * takeMVar operation and mark the MVar empty again.
1046 if (mvar->head != (StgTSO *)&stg_END_TSO_QUEUE_closure) {
1047 ASSERT(mvar->head->why_blocked == BlockedOnMVar);
1048 #if defined(GRAN) || defined(PAR)
1049 /* ToDo: check 2nd arg (mvar) is right */
1050 mvar->head = RET_STGCALL2(StgTSO *,unblockOne,mvar->head,mvar);
1052 mvar->head = RET_STGCALL1(StgTSO *,unblockOne,mvar->head);
1054 if (mvar->head == (StgTSO *)&stg_END_TSO_QUEUE_closure) {
1055 mvar->tail = (StgTSO *)&stg_END_TSO_QUEUE_closure;
1059 /* unlocks the MVar in the SMP case */
1060 SET_INFO(mvar,&stg_FULL_MVAR_info);
1062 /* ToDo: yield here for better communication performance? */
1067 /* -----------------------------------------------------------------------------
1068 Stable pointer primitives
1069 ------------------------------------------------------------------------- */
1071 FN_(makeStableNamezh_fast)
1074 StgStableName *sn_obj;
1077 HP_CHK_GEN_TICKY(sizeofW(StgStableName), R1_PTR, makeStableNamezh_fast,);
1078 TICK_ALLOC_PRIM(sizeofW(StgHeader),
1079 sizeofW(StgStableName)-sizeofW(StgHeader), 0);
1080 CCS_ALLOC(CCCS,sizeofW(StgStableName)); /* ccs prof */
1082 index = RET_STGCALL1(StgWord,lookupStableName,R1.p);
1084 /* Is there already a StableName for this heap object? */
1085 if (stable_ptr_table[index].sn_obj == NULL) {
1086 sn_obj = (StgStableName *) (Hp - sizeofW(StgStableName) + 1);
1087 sn_obj->header.info = &stg_STABLE_NAME_info;
1089 stable_ptr_table[index].sn_obj = (StgClosure *)sn_obj;
1091 (StgClosure *)sn_obj = stable_ptr_table[index].sn_obj;
1094 TICK_RET_UNBOXED_TUP(1);
1098 /* -----------------------------------------------------------------------------
1099 Bytecode object primitives
1100 ------------------------------------------------------------------------- */
1112 HP_CHK_GEN_TICKY(sizeofW(StgBCO),R1_PTR|R2_PTR|R3_PTR|R4_PTR, newBCOzh_fast,);
1113 TICK_ALLOC_PRIM(sizeofW(StgHeader), sizeofW(StgBCO)-sizeofW(StgHeader), 0);
1114 CCS_ALLOC(CCCS,sizeofW(StgBCO)); /* ccs prof */
1115 bco = (StgBCO *) (Hp + 1 - sizeofW(StgBCO));
1116 SET_HDR(bco, &stg_BCO_info, CCCS);
1118 bco->instrs = (StgArrWords*)R1.cl;
1119 bco->literals = (StgArrWords*)R2.cl;
1120 bco->ptrs = (StgMutArrPtrs*)R3.cl;
1121 bco->itbls = (StgArrWords*)R4.cl;
1123 TICK_RET_UNBOXED_TUP(1);
1128 FN_(mkApUpd0zh_fast)
1130 /* R1.p = the fn for the AP_UPD
1134 HP_CHK_GEN_TICKY(AP_sizeW(0), R1_PTR, mkApUpd0zh_fast,);
1135 TICK_ALLOC_PRIM(sizeofW(StgHeader), AP_sizeW(0)-sizeofW(StgHeader), 0);
1136 CCS_ALLOC(CCCS,AP_sizeW(0)); /* ccs prof */
1137 ap = (StgAP_UPD *) (Hp + 1 - AP_sizeW(0));
1138 SET_HDR(ap, &stg_AP_UPD_info, CCCS);
1143 TICK_RET_UNBOXED_TUP(1);
1148 /* -----------------------------------------------------------------------------
1149 Thread I/O blocking primitives
1150 -------------------------------------------------------------------------- */
1152 FN_(waitReadzh_fast)
1156 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1157 CurrentTSO->why_blocked = BlockedOnRead;
1158 CurrentTSO->block_info.fd = R1.i;
1159 ACQUIRE_LOCK(&sched_mutex);
1160 APPEND_TO_BLOCKED_QUEUE(CurrentTSO);
1161 RELEASE_LOCK(&sched_mutex);
1162 JMP_(stg_block_noregs);
1166 FN_(waitWritezh_fast)
1170 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1171 CurrentTSO->why_blocked = BlockedOnWrite;
1172 CurrentTSO->block_info.fd = R1.i;
1173 ACQUIRE_LOCK(&sched_mutex);
1174 APPEND_TO_BLOCKED_QUEUE(CurrentTSO);
1175 RELEASE_LOCK(&sched_mutex);
1176 JMP_(stg_block_noregs);
1186 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1187 CurrentTSO->why_blocked = BlockedOnDelay;
1189 ACQUIRE_LOCK(&sched_mutex);
1191 target = (R1.i / (TICK_MILLISECS*1000)) + getourtimeofday();
1192 CurrentTSO->block_info.target = target;
1194 /* Insert the new thread in the sleeping queue. */
1197 while (t != END_TSO_QUEUE && t->block_info.target < target) {
1202 CurrentTSO->link = t;
1204 sleeping_queue = CurrentTSO;
1206 prev->link = CurrentTSO;
1209 RELEASE_LOCK(&sched_mutex);
1210 JMP_(stg_block_noregs);