1 /* -----------------------------------------------------------------------------
2 * $Id: PrimOps.hc,v 1.52 2000/05/10 11:02:00 simonmar 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 #define newByteArray(ty,scale) \
248 FN_(new##ty##Arrayzh_fast) \
250 W_ stuff_size, size, n; \
253 MAYBE_GC(NO_PTRS,new##ty##Arrayzh_fast); \
255 stuff_size = BYTES_TO_STGWORDS(n*scale); \
256 size = sizeofW(StgArrWords)+ stuff_size; \
257 p = (StgArrWords *)RET_STGCALL1(P_,allocate,size); \
258 TICK_ALLOC_PRIM(sizeofW(StgArrWords),stuff_size,0); \
259 SET_HDR(p, &ARR_WORDS_info, CCCS); \
260 p->words = stuff_size; \
261 TICK_RET_UNBOXED_TUP(1) \
266 newByteArray(Char, sizeof(C_))
267 newByteArray(Int, sizeof(I_));
268 newByteArray(Word, sizeof(W_));
269 newByteArray(Addr, sizeof(P_));
270 newByteArray(Float, sizeof(StgFloat));
271 newByteArray(Double, sizeof(StgDouble));
272 newByteArray(StablePtr, sizeof(StgStablePtr));
282 MAYBE_GC(R2_PTR,newArrayzh_fast);
284 size = sizeofW(StgMutArrPtrs) + n;
285 arr = (StgMutArrPtrs *)RET_STGCALL1(P_, allocate, size);
286 TICK_ALLOC_PRIM(sizeofW(StgMutArrPtrs), n, 0);
288 SET_HDR(arr,&MUT_ARR_PTRS_info,CCCS);
292 for (p = (P_)arr + sizeofW(StgMutArrPtrs);
293 p < (P_)arr + size; p++) {
297 TICK_RET_UNBOXED_TUP(1);
302 FN_(newMutVarzh_fast)
305 /* Args: R1.p = initialisation value */
308 HP_CHK_GEN_TICKY(sizeofW(StgMutVar), R1_PTR, newMutVarzh_fast,);
309 TICK_ALLOC_PRIM(sizeofW(StgHeader)+1,1, 0); /* hack, dependent on rep. */
310 CCS_ALLOC(CCCS,sizeofW(StgMutVar));
312 mv = (StgMutVar *)(Hp-sizeofW(StgMutVar)+1);
313 SET_HDR(mv,&MUT_VAR_info,CCCS);
316 TICK_RET_UNBOXED_TUP(1);
321 /* -----------------------------------------------------------------------------
322 Foreign Object Primitives
324 -------------------------------------------------------------------------- */
327 FN_(mkForeignObjzh_fast)
329 /* R1.p = ptr to foreign object,
331 StgForeignObj *result;
334 HP_CHK_GEN_TICKY(sizeofW(StgForeignObj), NO_PTRS, mkForeignObjzh_fast,);
335 TICK_ALLOC_PRIM(sizeofW(StgHeader),
336 sizeofW(StgForeignObj)-sizeofW(StgHeader), 0);
337 CCS_ALLOC(CCCS,sizeofW(StgForeignObj)); /* ccs prof */
339 result = (StgForeignObj *) (Hp + 1 - sizeofW(StgForeignObj));
340 SET_HDR(result,&FOREIGN_info,CCCS);
343 /* returns (# s#, ForeignObj# #) */
344 TICK_RET_UNBOXED_TUP(1);
350 /* These two are out-of-line for the benefit of the NCG */
351 FN_(unsafeThawArrayzh_fast)
354 SET_INFO((StgClosure *)R1.cl,&MUT_ARR_PTRS_info);
355 recordMutable((StgMutClosure*)R1.cl);
357 TICK_RET_UNBOXED_TUP(1);
362 /* -----------------------------------------------------------------------------
363 Weak Pointer Primitives
364 -------------------------------------------------------------------------- */
372 R3.p = finalizer (or NULL)
378 R3.cl = &NO_FINALIZER_closure;
381 HP_CHK_GEN_TICKY(sizeofW(StgWeak),R1_PTR|R2_PTR|R3_PTR, mkWeakzh_fast,);
382 TICK_ALLOC_PRIM(sizeofW(StgHeader)+1, // +1 is for the link field
383 sizeofW(StgWeak)-sizeofW(StgHeader)-1, 0);
384 CCS_ALLOC(CCCS,sizeofW(StgWeak)); /* ccs prof */
386 w = (StgWeak *) (Hp + 1 - sizeofW(StgWeak));
387 SET_HDR(w, &WEAK_info, CCCS);
391 w->finalizer = R3.cl;
393 w->link = weak_ptr_list;
395 IF_DEBUG(weak, fprintf(stderr,"New weak pointer at %p\n",w));
397 TICK_RET_UNBOXED_TUP(1);
402 FN_(finalizzeWeakzh_fast)
409 TICK_RET_UNBOXED_TUP(0);
410 w = (StgDeadWeak *)R1.p;
413 if (w->header.info == &DEAD_WEAK_info) {
414 RET_NP(0,&NO_FINALIZER_closure);
418 w->header.info = &DEAD_WEAK_info;
419 f = ((StgWeak *)w)->finalizer;
420 w->link = ((StgWeak *)w)->link;
422 /* return the finalizer */
423 if (f == &NO_FINALIZER_closure) {
424 RET_NP(0,&NO_FINALIZER_closure);
433 /* -----------------------------------------------------------------------------
434 Arbitrary-precision Integer operations.
435 -------------------------------------------------------------------------- */
437 FN_(int2Integerzh_fast)
439 /* arguments: R1 = Int# */
441 I_ val, s; /* to avoid aliasing */
442 StgArrWords* p; /* address of array result */
446 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, int2Integerzh_fast,);
447 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
448 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
450 p = (StgArrWords *)Hp - 1;
451 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, 1);
453 /* mpz_set_si is inlined here, makes things simpler */
457 } else if (val > 0) {
464 /* returns (# size :: Int#,
468 TICK_RET_UNBOXED_TUP(2);
473 FN_(word2Integerzh_fast)
475 /* arguments: R1 = Word# */
477 W_ val; /* to avoid aliasing */
479 StgArrWords* p; /* address of array result */
483 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, word2Integerzh_fast,)
484 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
485 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
487 p = (StgArrWords *)Hp - 1;
488 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, 1);
497 /* returns (# size :: Int#,
501 TICK_RET_UNBOXED_TUP(2);
506 FN_(addr2Integerzh_fast)
512 MAYBE_GC(NO_PTRS,addr2Integerzh_fast);
514 /* args: R1 :: Addr# */
517 /* Perform the operation */
518 if (RET_STGCALL3(int, mpz_init_set_str,&result,(str),/*base*/10))
521 /* returns (# size :: Int#,
525 TICK_RET_UNBOXED_TUP(2);
526 RET_NP(result._mp_size,
527 result._mp_d - sizeofW(StgArrWords));
532 * 'long long' primops for converting to/from Integers.
535 #ifdef SUPPORT_LONG_LONGS
537 FN_(int64ToIntegerzh_fast)
539 /* arguments: L1 = Int64# */
541 StgInt64 val; /* to avoid aliasing */
543 I_ s, neg, words_needed;
544 StgArrWords* p; /* address of array result */
550 if ( val >= 0x100000000LL || val <= -0x100000000LL ) {
553 /* minimum is one word */
556 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+words_needed, NO_PTRS, int64ToIntegerzh_fast,)
557 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
558 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
560 p = (StgArrWords *)(Hp-words_needed+1) - 1;
561 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, words_needed);
568 hi = (W_)((LW_)val / 0x100000000ULL);
570 if ( words_needed == 2 ) {
574 } else if ( val != 0 ) {
577 } else /* val==0 */ {
580 s = ( neg ? -s : s );
582 /* returns (# size :: Int#,
586 TICK_RET_UNBOXED_TUP(2);
591 FN_(word64ToIntegerzh_fast)
593 /* arguments: L1 = Word64# */
595 StgWord64 val; /* to avoid aliasing */
598 StgArrWords* p; /* address of array result */
602 if ( val >= 0x100000000ULL ) {
607 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+words_needed, NO_PTRS, word64ToIntegerzh_fast,)
608 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
609 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
611 p = (StgArrWords *)(Hp-words_needed+1) - 1;
612 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, words_needed);
614 hi = (W_)((LW_)val / 0x100000000ULL);
615 if ( val >= 0x100000000ULL ) {
619 } else if ( val != 0 ) {
622 } else /* val==0 */ {
626 /* returns (# size :: Int#,
630 TICK_RET_UNBOXED_TUP(2);
636 #endif /* HAVE_LONG_LONG */
638 /* ToDo: this is shockingly inefficient */
640 #define GMP_TAKE2_RET1(name,mp_fun) \
643 MP_INT arg1, arg2, result; \
649 /* call doYouWantToGC() */ \
650 MAYBE_GC(R2_PTR | R4_PTR, name); \
652 d1 = (StgArrWords *)R2.p; \
654 d2 = (StgArrWords *)R4.p; \
657 arg1._mp_alloc = d1->words; \
658 arg1._mp_size = (s1); \
659 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
660 arg2._mp_alloc = d2->words; \
661 arg2._mp_size = (s2); \
662 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
664 STGCALL1(mpz_init,&result); \
666 /* Perform the operation */ \
667 STGCALL3(mp_fun,&result,&arg1,&arg2); \
669 TICK_RET_UNBOXED_TUP(2); \
670 RET_NP(result._mp_size, \
671 result._mp_d-sizeofW(StgArrWords)); \
675 #define GMP_TAKE2_RET2(name,mp_fun) \
678 MP_INT arg1, arg2, result1, result2; \
684 /* call doYouWantToGC() */ \
685 MAYBE_GC(R2_PTR | R4_PTR, name); \
687 d1 = (StgArrWords *)R2.p; \
689 d2 = (StgArrWords *)R4.p; \
692 arg1._mp_alloc = d1->words; \
693 arg1._mp_size = (s1); \
694 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
695 arg2._mp_alloc = d2->words; \
696 arg2._mp_size = (s2); \
697 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
699 STGCALL1(mpz_init,&result1); \
700 STGCALL1(mpz_init,&result2); \
702 /* Perform the operation */ \
703 STGCALL4(mp_fun,&result1,&result2,&arg1,&arg2); \
705 TICK_RET_UNBOXED_TUP(4); \
706 RET_NPNP(result1._mp_size, \
707 result1._mp_d-sizeofW(StgArrWords), \
709 result2._mp_d-sizeofW(StgArrWords)); \
713 GMP_TAKE2_RET1(plusIntegerzh_fast, mpz_add);
714 GMP_TAKE2_RET1(minusIntegerzh_fast, mpz_sub);
715 GMP_TAKE2_RET1(timesIntegerzh_fast, mpz_mul);
716 GMP_TAKE2_RET1(gcdIntegerzh_fast, mpz_gcd);
717 GMP_TAKE2_RET1(quotIntegerzh_fast, mpz_tdiv_q);
718 GMP_TAKE2_RET1(remIntegerzh_fast, mpz_tdiv_r);
719 GMP_TAKE2_RET1(divExactIntegerzh_fast, mpz_divexact);
721 GMP_TAKE2_RET2(quotRemIntegerzh_fast, mpz_tdiv_qr);
722 GMP_TAKE2_RET2(divModIntegerzh_fast, mpz_fdiv_qr);
724 #ifndef FLOATS_AS_DOUBLES
725 FN_(decodeFloatzh_fast)
733 /* arguments: F1 = Float# */
736 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, decodeFloatzh_fast,);
737 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
738 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
740 /* Be prepared to tell Lennart-coded __decodeFloat */
741 /* where mantissa._mp_d can be put (it does not care about the rest) */
742 p = (StgArrWords *)Hp - 1;
743 SET_ARR_HDR(p,&ARR_WORDS_info,CCCS,1)
744 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
746 /* Perform the operation */
747 STGCALL3(__decodeFloat,&mantissa,&exponent,arg);
749 /* returns: (Int# (expn), Int#, ByteArray#) */
750 TICK_RET_UNBOXED_TUP(3);
751 RET_NNP(exponent,mantissa._mp_size,p);
754 #endif /* !FLOATS_AS_DOUBLES */
756 #define DOUBLE_MANTISSA_SIZE (sizeofW(StgDouble))
757 #define ARR_SIZE (sizeofW(StgArrWords) + DOUBLE_MANTISSA_SIZE)
759 FN_(decodeDoublezh_fast)
766 /* arguments: D1 = Double# */
769 HP_CHK_GEN_TICKY(ARR_SIZE, NO_PTRS, decodeDoublezh_fast,);
770 TICK_ALLOC_PRIM(sizeofW(StgArrWords),DOUBLE_MANTISSA_SIZE,0);
771 CCS_ALLOC(CCCS,ARR_SIZE); /* ccs prof */
773 /* Be prepared to tell Lennart-coded __decodeDouble */
774 /* where mantissa.d can be put (it does not care about the rest) */
775 p = (StgArrWords *)(Hp-ARR_SIZE+1);
776 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, DOUBLE_MANTISSA_SIZE);
777 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
779 /* Perform the operation */
780 STGCALL3(__decodeDouble,&mantissa,&exponent,arg);
782 /* returns: (Int# (expn), Int#, ByteArray#) */
783 TICK_RET_UNBOXED_TUP(3);
784 RET_NNP(exponent,mantissa._mp_size,p);
788 /* -----------------------------------------------------------------------------
789 * Concurrency primitives
790 * -------------------------------------------------------------------------- */
795 /* args: R1 = closure to spark */
797 MAYBE_GC(R1_PTR, forkzh_fast);
799 /* create it right now, return ThreadID in R1 */
800 R1.t = RET_STGCALL2(StgTSO *, createIOThread,
801 RtsFlags.GcFlags.initialStkSize, R1.cl);
802 STGCALL1(scheduleThread, R1.t);
804 /* switch at the earliest opportunity */
807 JMP_(ENTRY_CODE(Sp[0]));
814 JMP_(stg_yield_noregs);
825 HP_CHK_GEN_TICKY(sizeofW(StgMVar), NO_PTRS, newMVarzh_fast,);
826 TICK_ALLOC_PRIM(sizeofW(StgMutVar)-1, // consider head,tail,link as admin wds
828 CCS_ALLOC(CCCS,sizeofW(StgMVar)); /* ccs prof */
830 mvar = (StgMVar *) (Hp - sizeofW(StgMVar) + 1);
831 SET_HDR(mvar,&EMPTY_MVAR_info,CCCS);
832 mvar->head = mvar->tail = (StgTSO *)&END_TSO_QUEUE_closure;
833 mvar->value = (StgClosure *)&END_TSO_QUEUE_closure;
835 TICK_RET_UNBOXED_TUP(1);
844 const StgInfoTable *info;
847 /* args: R1 = MVar closure */
849 mvar = (StgMVar *)R1.p;
852 info = LOCK_CLOSURE(mvar);
854 info = GET_INFO(mvar);
857 /* If the MVar is empty, put ourselves on its blocking queue,
858 * and wait until we're woken up.
860 if (info == &EMPTY_MVAR_info) {
861 if (mvar->head == (StgTSO *)&END_TSO_QUEUE_closure) {
862 mvar->head = CurrentTSO;
864 mvar->tail->link = CurrentTSO;
866 CurrentTSO->link = (StgTSO *)&END_TSO_QUEUE_closure;
867 CurrentTSO->why_blocked = BlockedOnMVar;
868 CurrentTSO->block_info.closure = (StgClosure *)mvar;
869 mvar->tail = CurrentTSO;
872 /* unlock the MVar */
873 mvar->header.info = &EMPTY_MVAR_info;
875 BLOCK(R1_PTR, takeMVarzh_fast);
879 mvar->value = (StgClosure *)&END_TSO_QUEUE_closure;
881 /* do this last... we might have locked the MVar in the SMP case,
882 * and writing the info pointer will unlock it.
884 SET_INFO(mvar,&EMPTY_MVAR_info);
886 TICK_RET_UNBOXED_TUP(1);
891 FN_(tryTakeMVarzh_fast)
895 const StgInfoTable *info;
898 /* args: R1 = MVar closure */
900 mvar = (StgMVar *)R1.p;
903 info = LOCK_CLOSURE(mvar);
905 info = GET_INFO(mvar);
908 if (info == &EMPTY_MVAR_info) {
911 /* unlock the MVar */
912 mvar->header.info = &EMPTY_MVAR_info;
915 /* HACK: we need a pointer to pass back, so we abuse NO_FINALIZER_closure */
916 RET_NP(0, &NO_FINALIZER_closure);
920 mvar->value = (StgClosure *)&END_TSO_QUEUE_closure;
922 /* do this last... we might have locked the MVar in the SMP case,
923 * and writing the info pointer will unlock it.
925 SET_INFO(mvar,&EMPTY_MVAR_info);
927 TICK_RET_UNBOXED_TUP(1);
935 const StgInfoTable *info;
938 /* args: R1 = MVar, R2 = value */
940 mvar = (StgMVar *)R1.p;
943 info = LOCK_CLOSURE(mvar);
945 info = GET_INFO(mvar);
948 if (info == &FULL_MVAR_info) {
950 fprintf(stderr, "fatal: put on a full MVar in Hugs; aborting\n" );
953 R1.cl = (StgClosure *)PutFullMVar_closure;
960 /* wake up the first thread on the queue, it will continue with the
961 * takeMVar operation and mark the MVar empty again.
963 if (mvar->head != (StgTSO *)&END_TSO_QUEUE_closure) {
964 ASSERT(mvar->head->why_blocked == BlockedOnMVar);
966 mvar->head = RET_STGCALL2(StgTSO *,unblockOne,mvar->head,mvar);
968 // ToDo: check 2nd arg (mvar) is right
969 mvar->head = RET_STGCALL2(StgTSO *,unblockOne,mvar->head,mvar);
971 mvar->head = RET_STGCALL1(StgTSO *,unblockOne,mvar->head);
973 if (mvar->head == (StgTSO *)&END_TSO_QUEUE_closure) {
974 mvar->tail = (StgTSO *)&END_TSO_QUEUE_closure;
978 /* unlocks the MVar in the SMP case */
979 SET_INFO(mvar,&FULL_MVAR_info);
981 /* ToDo: yield here for better communication performance? */
982 JMP_(ENTRY_CODE(Sp[0]));
986 /* -----------------------------------------------------------------------------
987 Stable pointer primitives
988 ------------------------------------------------------------------------- */
990 FN_(makeStableNamezh_fast)
993 StgStableName *sn_obj;
996 HP_CHK_GEN_TICKY(sizeofW(StgStableName), R1_PTR, makeStableNamezh_fast,);
997 TICK_ALLOC_PRIM(sizeofW(StgHeader),
998 sizeofW(StgStableName)-sizeofW(StgHeader), 0);
999 CCS_ALLOC(CCCS,sizeofW(StgStableName)); /* ccs prof */
1001 index = RET_STGCALL1(StgWord,lookupStableName,R1.p);
1003 /* Is there already a StableName for this heap object? */
1004 if (stable_ptr_table[index].sn_obj == NULL) {
1005 sn_obj = (StgStableName *) (Hp - sizeofW(StgStableName) + 1);
1006 sn_obj->header.info = &STABLE_NAME_info;
1008 stable_ptr_table[index].sn_obj = (StgClosure *)sn_obj;
1010 (StgClosure *)sn_obj = stable_ptr_table[index].sn_obj;
1013 TICK_RET_UNBOXED_TUP(1);
1017 /* -----------------------------------------------------------------------------
1018 Thread I/O blocking primitives
1019 -------------------------------------------------------------------------- */
1021 FN_(waitReadzh_fast)
1025 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1026 CurrentTSO->why_blocked = BlockedOnRead;
1027 CurrentTSO->block_info.fd = R1.i;
1028 ACQUIRE_LOCK(&sched_mutex);
1029 APPEND_TO_BLOCKED_QUEUE(CurrentTSO);
1030 RELEASE_LOCK(&sched_mutex);
1031 JMP_(stg_block_noregs);
1035 FN_(waitWritezh_fast)
1039 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1040 CurrentTSO->why_blocked = BlockedOnWrite;
1041 CurrentTSO->block_info.fd = R1.i;
1042 ACQUIRE_LOCK(&sched_mutex);
1043 APPEND_TO_BLOCKED_QUEUE(CurrentTSO);
1044 RELEASE_LOCK(&sched_mutex);
1045 JMP_(stg_block_noregs);
1053 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1054 CurrentTSO->why_blocked = BlockedOnDelay;
1056 ACQUIRE_LOCK(&sched_mutex);
1058 /* Add on ticks_since_select, since these will be subtracted at
1059 * the next awaitEvent call.
1061 #if defined(HAVE_SETITIMER) || defined(mingw32_TARGET_OS)
1062 CurrentTSO->block_info.delay = R1.i + ticks_since_select;
1064 CurrentTSO->block_info.target = R1.i + getourtimeofday();
1067 APPEND_TO_BLOCKED_QUEUE(CurrentTSO);
1069 RELEASE_LOCK(&sched_mutex);
1070 JMP_(stg_block_noregs);