1 /* -----------------------------------------------------------------------------
2 * $Id: PrimOps.hc,v 1.66 2000/12/20 15:17:55 rrt 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
33 W_ GHC_ZCCCallable_static_info[0];
34 W_ GHC_ZCCReturnable_static_info[0];
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 -------------------------------------------------------------------------- */
318 FN_(mkForeignObjzh_fast)
320 /* R1.p = ptr to foreign object,
322 StgForeignObj *result;
325 HP_CHK_GEN_TICKY(sizeofW(StgForeignObj), NO_PTRS, mkForeignObjzh_fast,);
326 TICK_ALLOC_PRIM(sizeofW(StgHeader),
327 sizeofW(StgForeignObj)-sizeofW(StgHeader), 0);
328 CCS_ALLOC(CCCS,sizeofW(StgForeignObj)); /* ccs prof */
330 result = (StgForeignObj *) (Hp + 1 - sizeofW(StgForeignObj));
331 SET_HDR(result,&stg_FOREIGN_info,CCCS);
334 /* returns (# s#, ForeignObj# #) */
335 TICK_RET_UNBOXED_TUP(1);
341 /* These two are out-of-line for the benefit of the NCG */
342 FN_(unsafeThawArrayzh_fast)
345 SET_INFO((StgClosure *)R1.cl,&stg_MUT_ARR_PTRS_info);
346 recordMutable((StgMutClosure*)R1.cl);
348 TICK_RET_UNBOXED_TUP(1);
353 /* -----------------------------------------------------------------------------
354 Weak Pointer Primitives
355 -------------------------------------------------------------------------- */
363 R3.p = finalizer (or NULL)
369 R3.cl = &stg_NO_FINALIZER_closure;
372 HP_CHK_GEN_TICKY(sizeofW(StgWeak),R1_PTR|R2_PTR|R3_PTR, mkWeakzh_fast,);
373 TICK_ALLOC_PRIM(sizeofW(StgHeader)+1, // +1 is for the link field
374 sizeofW(StgWeak)-sizeofW(StgHeader)-1, 0);
375 CCS_ALLOC(CCCS,sizeofW(StgWeak)); /* ccs prof */
377 w = (StgWeak *) (Hp + 1 - sizeofW(StgWeak));
378 SET_HDR(w, &stg_WEAK_info, CCCS);
382 w->finalizer = R3.cl;
384 w->link = weak_ptr_list;
386 IF_DEBUG(weak, fprintf(stderr,"New weak pointer at %p\n",w));
388 TICK_RET_UNBOXED_TUP(1);
393 FN_(finalizzeWeakzh_fast)
400 TICK_RET_UNBOXED_TUP(0);
401 w = (StgDeadWeak *)R1.p;
404 if (w->header.info == &stg_DEAD_WEAK_info) {
405 RET_NP(0,&stg_NO_FINALIZER_closure);
409 w->header.info = &stg_DEAD_WEAK_info;
410 f = ((StgWeak *)w)->finalizer;
411 w->link = ((StgWeak *)w)->link;
413 /* return the finalizer */
414 if (f == &stg_NO_FINALIZER_closure) {
415 RET_NP(0,&stg_NO_FINALIZER_closure);
424 /* -----------------------------------------------------------------------------
425 Arbitrary-precision Integer operations.
426 -------------------------------------------------------------------------- */
428 FN_(int2Integerzh_fast)
430 /* arguments: R1 = Int# */
432 I_ val, s; /* to avoid aliasing */
433 StgArrWords* p; /* address of array result */
437 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, int2Integerzh_fast,);
438 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
439 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
441 p = (StgArrWords *)Hp - 1;
442 SET_ARR_HDR(p, &stg_ARR_WORDS_info, CCCS, 1);
444 /* mpz_set_si is inlined here, makes things simpler */
448 } else if (val > 0) {
455 /* returns (# size :: Int#,
459 TICK_RET_UNBOXED_TUP(2);
464 FN_(word2Integerzh_fast)
466 /* arguments: R1 = Word# */
468 W_ val; /* to avoid aliasing */
470 StgArrWords* p; /* address of array result */
474 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, word2Integerzh_fast,)
475 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
476 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
478 p = (StgArrWords *)Hp - 1;
479 SET_ARR_HDR(p, &stg_ARR_WORDS_info, CCCS, 1);
488 /* returns (# size :: Int#,
492 TICK_RET_UNBOXED_TUP(2);
499 * 'long long' primops for converting to/from Integers.
502 #ifdef SUPPORT_LONG_LONGS
504 FN_(int64ToIntegerzh_fast)
506 /* arguments: L1 = Int64# */
508 StgInt64 val; /* to avoid aliasing */
510 I_ s, neg, words_needed;
511 StgArrWords* p; /* address of array result */
517 if ( val >= 0x100000000LL || val <= -0x100000000LL ) {
520 /* minimum is one word */
523 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+words_needed, NO_PTRS, int64ToIntegerzh_fast,)
524 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
525 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
527 p = (StgArrWords *)(Hp-words_needed+1) - 1;
528 SET_ARR_HDR(p, &stg_ARR_WORDS_info, CCCS, words_needed);
535 hi = (W_)((LW_)val / 0x100000000ULL);
537 if ( words_needed == 2 ) {
541 } else if ( val != 0 ) {
544 } else /* val==0 */ {
547 s = ( neg ? -s : s );
549 /* returns (# size :: Int#,
553 TICK_RET_UNBOXED_TUP(2);
558 FN_(word64ToIntegerzh_fast)
560 /* arguments: L1 = Word64# */
562 StgWord64 val; /* to avoid aliasing */
565 StgArrWords* p; /* address of array result */
569 if ( val >= 0x100000000ULL ) {
574 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+words_needed, NO_PTRS, word64ToIntegerzh_fast,)
575 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
576 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
578 p = (StgArrWords *)(Hp-words_needed+1) - 1;
579 SET_ARR_HDR(p, &stg_ARR_WORDS_info, CCCS, words_needed);
581 hi = (W_)((LW_)val / 0x100000000ULL);
582 if ( val >= 0x100000000ULL ) {
586 } else if ( val != 0 ) {
589 } else /* val==0 */ {
593 /* returns (# size :: Int#,
597 TICK_RET_UNBOXED_TUP(2);
603 #endif /* HAVE_LONG_LONG */
605 /* ToDo: this is shockingly inefficient */
607 #define GMP_TAKE2_RET1(name,mp_fun) \
610 MP_INT arg1, arg2, result; \
616 /* call doYouWantToGC() */ \
617 MAYBE_GC(R2_PTR | R4_PTR, name); \
619 d1 = (StgArrWords *)R2.p; \
621 d2 = (StgArrWords *)R4.p; \
624 arg1._mp_alloc = d1->words; \
625 arg1._mp_size = (s1); \
626 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
627 arg2._mp_alloc = d2->words; \
628 arg2._mp_size = (s2); \
629 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
631 STGCALL1(mpz_init,&result); \
633 /* Perform the operation */ \
634 STGCALL3(mp_fun,&result,&arg1,&arg2); \
636 TICK_RET_UNBOXED_TUP(2); \
637 RET_NP(result._mp_size, \
638 result._mp_d-sizeofW(StgArrWords)); \
642 #define GMP_TAKE1_RET1(name,mp_fun) \
645 MP_INT arg1, result; \
650 /* call doYouWantToGC() */ \
651 MAYBE_GC(R2_PTR, name); \
653 d1 = (StgArrWords *)R2.p; \
656 arg1._mp_alloc = d1->words; \
657 arg1._mp_size = (s1); \
658 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
660 STGCALL1(mpz_init,&result); \
662 /* Perform the operation */ \
663 STGCALL2(mp_fun,&result,&arg1); \
665 TICK_RET_UNBOXED_TUP(2); \
666 RET_NP(result._mp_size, \
667 result._mp_d-sizeofW(StgArrWords)); \
671 #define GMP_TAKE2_RET2(name,mp_fun) \
674 MP_INT arg1, arg2, result1, result2; \
680 /* call doYouWantToGC() */ \
681 MAYBE_GC(R2_PTR | R4_PTR, name); \
683 d1 = (StgArrWords *)R2.p; \
685 d2 = (StgArrWords *)R4.p; \
688 arg1._mp_alloc = d1->words; \
689 arg1._mp_size = (s1); \
690 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
691 arg2._mp_alloc = d2->words; \
692 arg2._mp_size = (s2); \
693 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
695 STGCALL1(mpz_init,&result1); \
696 STGCALL1(mpz_init,&result2); \
698 /* Perform the operation */ \
699 STGCALL4(mp_fun,&result1,&result2,&arg1,&arg2); \
701 TICK_RET_UNBOXED_TUP(4); \
702 RET_NPNP(result1._mp_size, \
703 result1._mp_d-sizeofW(StgArrWords), \
705 result2._mp_d-sizeofW(StgArrWords)); \
709 GMP_TAKE2_RET1(plusIntegerzh_fast, mpz_add);
710 GMP_TAKE2_RET1(minusIntegerzh_fast, mpz_sub);
711 GMP_TAKE2_RET1(timesIntegerzh_fast, mpz_mul);
712 GMP_TAKE2_RET1(gcdIntegerzh_fast, mpz_gcd);
713 GMP_TAKE2_RET1(quotIntegerzh_fast, mpz_tdiv_q);
714 GMP_TAKE2_RET1(remIntegerzh_fast, mpz_tdiv_r);
715 GMP_TAKE2_RET1(divExactIntegerzh_fast, mpz_divexact);
716 GMP_TAKE2_RET1(andIntegerzh_fast, mpz_and);
717 GMP_TAKE2_RET1(orIntegerzh_fast, mpz_ior);
718 GMP_TAKE2_RET1(xorIntegerzh_fast, mpz_xor);
719 GMP_TAKE1_RET1(complementIntegerzh_fast, mpz_com);
721 GMP_TAKE2_RET2(quotRemIntegerzh_fast, mpz_tdiv_qr);
722 GMP_TAKE2_RET2(divModIntegerzh_fast, mpz_fdiv_qr);
724 FN_(decodeFloatzh_fast)
732 /* arguments: F1 = Float# */
735 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, decodeFloatzh_fast,);
736 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
737 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
739 /* Be prepared to tell Lennart-coded __decodeFloat */
740 /* where mantissa._mp_d can be put (it does not care about the rest) */
741 p = (StgArrWords *)Hp - 1;
742 SET_ARR_HDR(p,&stg_ARR_WORDS_info,CCCS,1)
743 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
745 /* Perform the operation */
746 STGCALL3(__decodeFloat,&mantissa,&exponent,arg);
748 /* returns: (Int# (expn), Int#, ByteArray#) */
749 TICK_RET_UNBOXED_TUP(3);
750 RET_NNP(exponent,mantissa._mp_size,p);
754 #define DOUBLE_MANTISSA_SIZE (sizeofW(StgDouble))
755 #define ARR_SIZE (sizeofW(StgArrWords) + DOUBLE_MANTISSA_SIZE)
757 FN_(decodeDoublezh_fast)
764 /* arguments: D1 = Double# */
767 HP_CHK_GEN_TICKY(ARR_SIZE, NO_PTRS, decodeDoublezh_fast,);
768 TICK_ALLOC_PRIM(sizeofW(StgArrWords),DOUBLE_MANTISSA_SIZE,0);
769 CCS_ALLOC(CCCS,ARR_SIZE); /* ccs prof */
771 /* Be prepared to tell Lennart-coded __decodeDouble */
772 /* where mantissa.d can be put (it does not care about the rest) */
773 p = (StgArrWords *)(Hp-ARR_SIZE+1);
774 SET_ARR_HDR(p, &stg_ARR_WORDS_info, CCCS, DOUBLE_MANTISSA_SIZE);
775 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
777 /* Perform the operation */
778 STGCALL3(__decodeDouble,&mantissa,&exponent,arg);
780 /* returns: (Int# (expn), Int#, ByteArray#) */
781 TICK_RET_UNBOXED_TUP(3);
782 RET_NNP(exponent,mantissa._mp_size,p);
786 /* -----------------------------------------------------------------------------
787 * Concurrency primitives
788 * -------------------------------------------------------------------------- */
793 /* args: R1 = closure to spark */
795 MAYBE_GC(R1_PTR, forkzh_fast);
797 /* create it right now, return ThreadID in R1 */
798 R1.t = RET_STGCALL2(StgTSO *, createIOThread,
799 RtsFlags.GcFlags.initialStkSize, R1.cl);
800 STGCALL1(scheduleThread, R1.t);
802 /* switch at the earliest opportunity */
805 JMP_(ENTRY_CODE(Sp[0]));
812 JMP_(stg_yield_noregs);
823 HP_CHK_GEN_TICKY(sizeofW(StgMVar), NO_PTRS, newMVarzh_fast,);
824 TICK_ALLOC_PRIM(sizeofW(StgMutVar)-1, // consider head,tail,link as admin wds
826 CCS_ALLOC(CCCS,sizeofW(StgMVar)); /* ccs prof */
828 mvar = (StgMVar *) (Hp - sizeofW(StgMVar) + 1);
829 SET_HDR(mvar,&stg_EMPTY_MVAR_info,CCCS);
830 mvar->head = mvar->tail = (StgTSO *)&stg_END_TSO_QUEUE_closure;
831 mvar->value = (StgClosure *)&stg_END_TSO_QUEUE_closure;
833 TICK_RET_UNBOXED_TUP(1);
842 const StgInfoTable *info;
845 /* args: R1 = MVar closure */
847 mvar = (StgMVar *)R1.p;
850 info = LOCK_CLOSURE(mvar);
852 info = GET_INFO(mvar);
855 /* If the MVar is empty, put ourselves on its blocking queue,
856 * and wait until we're woken up.
858 if (info == &stg_EMPTY_MVAR_info) {
859 if (mvar->head == (StgTSO *)&stg_END_TSO_QUEUE_closure) {
860 mvar->head = CurrentTSO;
862 mvar->tail->link = CurrentTSO;
864 CurrentTSO->link = (StgTSO *)&stg_END_TSO_QUEUE_closure;
865 CurrentTSO->why_blocked = BlockedOnMVar;
866 CurrentTSO->block_info.closure = (StgClosure *)mvar;
867 mvar->tail = CurrentTSO;
870 /* unlock the MVar */
871 mvar->header.info = &stg_EMPTY_MVAR_info;
873 BLOCK(R1_PTR, takeMVarzh_fast);
877 mvar->value = (StgClosure *)&stg_END_TSO_QUEUE_closure;
879 /* do this last... we might have locked the MVar in the SMP case,
880 * and writing the info pointer will unlock it.
882 SET_INFO(mvar,&stg_EMPTY_MVAR_info);
884 TICK_RET_UNBOXED_TUP(1);
889 FN_(tryTakeMVarzh_fast)
893 const StgInfoTable *info;
896 /* args: R1 = MVar closure */
898 mvar = (StgMVar *)R1.p;
901 info = LOCK_CLOSURE(mvar);
903 info = GET_INFO(mvar);
906 if (info == &stg_EMPTY_MVAR_info) {
909 /* unlock the MVar */
910 mvar->header.info = &stg_EMPTY_MVAR_info;
913 /* HACK: we need a pointer to pass back, so we abuse NO_FINALIZER_closure */
914 RET_NP(0, &stg_NO_FINALIZER_closure);
918 mvar->value = (StgClosure *)&stg_END_TSO_QUEUE_closure;
920 /* do this last... we might have locked the MVar in the SMP case,
921 * and writing the info pointer will unlock it.
923 SET_INFO(mvar,&stg_EMPTY_MVAR_info);
925 TICK_RET_UNBOXED_TUP(1);
933 const StgInfoTable *info;
936 /* args: R1 = MVar, R2 = value */
938 mvar = (StgMVar *)R1.p;
941 info = LOCK_CLOSURE(mvar);
943 info = GET_INFO(mvar);
946 if (info == &stg_FULL_MVAR_info) {
948 fprintf(stderr, "fatal: put on a full MVar in Hugs; aborting\n" );
951 R1.cl = (StgClosure *)PutFullMVar_closure;
958 /* wake up the first thread on the queue, it will continue with the
959 * takeMVar operation and mark the MVar empty again.
961 if (mvar->head != (StgTSO *)&stg_END_TSO_QUEUE_closure) {
962 ASSERT(mvar->head->why_blocked == BlockedOnMVar);
964 mvar->head = RET_STGCALL2(StgTSO *,unblockOne,mvar->head,mvar);
966 // ToDo: check 2nd arg (mvar) is right
967 mvar->head = RET_STGCALL2(StgTSO *,unblockOne,mvar->head,mvar);
969 mvar->head = RET_STGCALL1(StgTSO *,unblockOne,mvar->head);
971 if (mvar->head == (StgTSO *)&stg_END_TSO_QUEUE_closure) {
972 mvar->tail = (StgTSO *)&stg_END_TSO_QUEUE_closure;
976 /* unlocks the MVar in the SMP case */
977 SET_INFO(mvar,&stg_FULL_MVAR_info);
979 /* ToDo: yield here for better communication performance? */
980 JMP_(ENTRY_CODE(Sp[0]));
984 /* -----------------------------------------------------------------------------
985 Stable pointer primitives
986 ------------------------------------------------------------------------- */
988 FN_(makeStableNamezh_fast)
991 StgStableName *sn_obj;
994 HP_CHK_GEN_TICKY(sizeofW(StgStableName), R1_PTR, makeStableNamezh_fast,);
995 TICK_ALLOC_PRIM(sizeofW(StgHeader),
996 sizeofW(StgStableName)-sizeofW(StgHeader), 0);
997 CCS_ALLOC(CCCS,sizeofW(StgStableName)); /* ccs prof */
999 index = RET_STGCALL1(StgWord,lookupStableName,R1.p);
1001 /* Is there already a StableName for this heap object? */
1002 if (stable_ptr_table[index].sn_obj == NULL) {
1003 sn_obj = (StgStableName *) (Hp - sizeofW(StgStableName) + 1);
1004 sn_obj->header.info = &stg_STABLE_NAME_info;
1006 stable_ptr_table[index].sn_obj = (StgClosure *)sn_obj;
1008 (StgClosure *)sn_obj = stable_ptr_table[index].sn_obj;
1011 TICK_RET_UNBOXED_TUP(1);
1015 /* -----------------------------------------------------------------------------
1016 Bytecode object primitives
1017 ------------------------------------------------------------------------- */
1030 HP_CHK_GEN_TICKY(sizeofW(StgBCO),R1_PTR|R2_PTR|R3_PTR|R4_PTR, newBCOzh_fast,);
1031 TICK_ALLOC_PRIM(sizeofW(StgHeader), sizeofW(StgBCO)-sizeofW(StgHeader), 0);
1032 CCS_ALLOC(CCCS,sizeofW(StgBCO)); /* ccs prof */
1033 bco = (StgBCO *) (Hp + 1 - sizeofW(StgBCO));
1034 SET_HDR(bco, &stg_BCO_info, CCCS);
1036 bco->instrs = (StgArrWords*)R1.cl;
1037 bco->literals = (StgArrWords*)R2.cl;
1038 bco->ptrs = (StgMutArrPtrs*)R3.cl;
1039 bco->itbls = (StgArrWords*)R4.cl;
1041 TICK_RET_UNBOXED_TUP(1);
1047 /* -----------------------------------------------------------------------------
1048 Thread I/O blocking primitives
1049 -------------------------------------------------------------------------- */
1051 FN_(waitReadzh_fast)
1055 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1056 CurrentTSO->why_blocked = BlockedOnRead;
1057 CurrentTSO->block_info.fd = R1.i;
1058 ACQUIRE_LOCK(&sched_mutex);
1059 APPEND_TO_BLOCKED_QUEUE(CurrentTSO);
1060 RELEASE_LOCK(&sched_mutex);
1061 JMP_(stg_block_noregs);
1065 FN_(waitWritezh_fast)
1069 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1070 CurrentTSO->why_blocked = BlockedOnWrite;
1071 CurrentTSO->block_info.fd = R1.i;
1072 ACQUIRE_LOCK(&sched_mutex);
1073 APPEND_TO_BLOCKED_QUEUE(CurrentTSO);
1074 RELEASE_LOCK(&sched_mutex);
1075 JMP_(stg_block_noregs);
1085 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1086 CurrentTSO->why_blocked = BlockedOnDelay;
1088 ACQUIRE_LOCK(&sched_mutex);
1090 target = (R1.i / (TICK_MILLISECS*1000)) + timestamp + ticks_since_timestamp;
1091 CurrentTSO->block_info.target = target;
1093 /* Insert the new thread in the sleeping queue. */
1096 while (t != END_TSO_QUEUE && t->block_info.target < target) {
1101 CurrentTSO->link = t;
1103 sleeping_queue = CurrentTSO;
1105 prev->link = CurrentTSO;
1108 RELEASE_LOCK(&sched_mutex);
1109 JMP_(stg_block_noregs);