1 /* -----------------------------------------------------------------------------
2 * $Id: PrimOps.hc,v 1.55 2000/09/26 16:45:35 simonpj 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, 1)
267 /* Char arrays really contain only 8-bit bytes for compatibility. */
268 newByteArray(Int, sizeof(I_))
269 newByteArray(Word, sizeof(W_))
270 newByteArray(Addr, sizeof(P_))
271 newByteArray(Float, sizeof(StgFloat))
272 newByteArray(Double, sizeof(StgDouble))
273 newByteArray(StablePtr, sizeof(StgStablePtr))
283 MAYBE_GC(R2_PTR,newArrayzh_fast);
285 size = sizeofW(StgMutArrPtrs) + n;
286 arr = (StgMutArrPtrs *)RET_STGCALL1(P_, allocate, size);
287 TICK_ALLOC_PRIM(sizeofW(StgMutArrPtrs), n, 0);
289 SET_HDR(arr,&MUT_ARR_PTRS_info,CCCS);
293 for (p = (P_)arr + sizeofW(StgMutArrPtrs);
294 p < (P_)arr + size; p++) {
298 TICK_RET_UNBOXED_TUP(1);
303 FN_(newMutVarzh_fast)
306 /* Args: R1.p = initialisation value */
309 HP_CHK_GEN_TICKY(sizeofW(StgMutVar), R1_PTR, newMutVarzh_fast,);
310 TICK_ALLOC_PRIM(sizeofW(StgHeader)+1,1, 0); /* hack, dependent on rep. */
311 CCS_ALLOC(CCCS,sizeofW(StgMutVar));
313 mv = (StgMutVar *)(Hp-sizeofW(StgMutVar)+1);
314 SET_HDR(mv,&MUT_VAR_info,CCCS);
317 TICK_RET_UNBOXED_TUP(1);
322 /* -----------------------------------------------------------------------------
323 Foreign Object Primitives
325 -------------------------------------------------------------------------- */
328 FN_(mkForeignObjzh_fast)
330 /* R1.p = ptr to foreign object,
332 StgForeignObj *result;
335 HP_CHK_GEN_TICKY(sizeofW(StgForeignObj), NO_PTRS, mkForeignObjzh_fast,);
336 TICK_ALLOC_PRIM(sizeofW(StgHeader),
337 sizeofW(StgForeignObj)-sizeofW(StgHeader), 0);
338 CCS_ALLOC(CCCS,sizeofW(StgForeignObj)); /* ccs prof */
340 result = (StgForeignObj *) (Hp + 1 - sizeofW(StgForeignObj));
341 SET_HDR(result,&FOREIGN_info,CCCS);
344 /* returns (# s#, ForeignObj# #) */
345 TICK_RET_UNBOXED_TUP(1);
351 /* These two are out-of-line for the benefit of the NCG */
352 FN_(unsafeThawArrayzh_fast)
355 SET_INFO((StgClosure *)R1.cl,&MUT_ARR_PTRS_info);
356 recordMutable((StgMutClosure*)R1.cl);
358 TICK_RET_UNBOXED_TUP(1);
363 /* -----------------------------------------------------------------------------
364 Weak Pointer Primitives
365 -------------------------------------------------------------------------- */
373 R3.p = finalizer (or NULL)
379 R3.cl = &NO_FINALIZER_closure;
382 HP_CHK_GEN_TICKY(sizeofW(StgWeak),R1_PTR|R2_PTR|R3_PTR, mkWeakzh_fast,);
383 TICK_ALLOC_PRIM(sizeofW(StgHeader)+1, // +1 is for the link field
384 sizeofW(StgWeak)-sizeofW(StgHeader)-1, 0);
385 CCS_ALLOC(CCCS,sizeofW(StgWeak)); /* ccs prof */
387 w = (StgWeak *) (Hp + 1 - sizeofW(StgWeak));
388 SET_HDR(w, &WEAK_info, CCCS);
392 w->finalizer = R3.cl;
394 w->link = weak_ptr_list;
396 IF_DEBUG(weak, fprintf(stderr,"New weak pointer at %p\n",w));
398 TICK_RET_UNBOXED_TUP(1);
403 FN_(finalizzeWeakzh_fast)
410 TICK_RET_UNBOXED_TUP(0);
411 w = (StgDeadWeak *)R1.p;
414 if (w->header.info == &DEAD_WEAK_info) {
415 RET_NP(0,&NO_FINALIZER_closure);
419 w->header.info = &DEAD_WEAK_info;
420 f = ((StgWeak *)w)->finalizer;
421 w->link = ((StgWeak *)w)->link;
423 /* return the finalizer */
424 if (f == &NO_FINALIZER_closure) {
425 RET_NP(0,&NO_FINALIZER_closure);
434 /* -----------------------------------------------------------------------------
435 Arbitrary-precision Integer operations.
436 -------------------------------------------------------------------------- */
438 FN_(int2Integerzh_fast)
440 /* arguments: R1 = Int# */
442 I_ val, s; /* to avoid aliasing */
443 StgArrWords* p; /* address of array result */
447 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, int2Integerzh_fast,);
448 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
449 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
451 p = (StgArrWords *)Hp - 1;
452 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, 1);
454 /* mpz_set_si is inlined here, makes things simpler */
458 } else if (val > 0) {
465 /* returns (# size :: Int#,
469 TICK_RET_UNBOXED_TUP(2);
474 FN_(word2Integerzh_fast)
476 /* arguments: R1 = Word# */
478 W_ val; /* to avoid aliasing */
480 StgArrWords* p; /* address of array result */
484 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, word2Integerzh_fast,)
485 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
486 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
488 p = (StgArrWords *)Hp - 1;
489 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, 1);
498 /* returns (# size :: Int#,
502 TICK_RET_UNBOXED_TUP(2);
509 * 'long long' primops for converting to/from Integers.
512 #ifdef SUPPORT_LONG_LONGS
514 FN_(int64ToIntegerzh_fast)
516 /* arguments: L1 = Int64# */
518 StgInt64 val; /* to avoid aliasing */
520 I_ s, neg, words_needed;
521 StgArrWords* p; /* address of array result */
527 if ( val >= 0x100000000LL || val <= -0x100000000LL ) {
530 /* minimum is one word */
533 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+words_needed, NO_PTRS, int64ToIntegerzh_fast,)
534 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
535 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
537 p = (StgArrWords *)(Hp-words_needed+1) - 1;
538 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, words_needed);
545 hi = (W_)((LW_)val / 0x100000000ULL);
547 if ( words_needed == 2 ) {
551 } else if ( val != 0 ) {
554 } else /* val==0 */ {
557 s = ( neg ? -s : s );
559 /* returns (# size :: Int#,
563 TICK_RET_UNBOXED_TUP(2);
568 FN_(word64ToIntegerzh_fast)
570 /* arguments: L1 = Word64# */
572 StgWord64 val; /* to avoid aliasing */
575 StgArrWords* p; /* address of array result */
579 if ( val >= 0x100000000ULL ) {
584 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+words_needed, NO_PTRS, word64ToIntegerzh_fast,)
585 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
586 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
588 p = (StgArrWords *)(Hp-words_needed+1) - 1;
589 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, words_needed);
591 hi = (W_)((LW_)val / 0x100000000ULL);
592 if ( val >= 0x100000000ULL ) {
596 } else if ( val != 0 ) {
599 } else /* val==0 */ {
603 /* returns (# size :: Int#,
607 TICK_RET_UNBOXED_TUP(2);
613 #endif /* HAVE_LONG_LONG */
615 /* ToDo: this is shockingly inefficient */
617 #define GMP_TAKE2_RET1(name,mp_fun) \
620 MP_INT arg1, arg2, result; \
626 /* call doYouWantToGC() */ \
627 MAYBE_GC(R2_PTR | R4_PTR, name); \
629 d1 = (StgArrWords *)R2.p; \
631 d2 = (StgArrWords *)R4.p; \
634 arg1._mp_alloc = d1->words; \
635 arg1._mp_size = (s1); \
636 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
637 arg2._mp_alloc = d2->words; \
638 arg2._mp_size = (s2); \
639 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
641 STGCALL1(mpz_init,&result); \
643 /* Perform the operation */ \
644 STGCALL3(mp_fun,&result,&arg1,&arg2); \
646 TICK_RET_UNBOXED_TUP(2); \
647 RET_NP(result._mp_size, \
648 result._mp_d-sizeofW(StgArrWords)); \
652 #define GMP_TAKE2_RET2(name,mp_fun) \
655 MP_INT arg1, arg2, result1, result2; \
661 /* call doYouWantToGC() */ \
662 MAYBE_GC(R2_PTR | R4_PTR, name); \
664 d1 = (StgArrWords *)R2.p; \
666 d2 = (StgArrWords *)R4.p; \
669 arg1._mp_alloc = d1->words; \
670 arg1._mp_size = (s1); \
671 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
672 arg2._mp_alloc = d2->words; \
673 arg2._mp_size = (s2); \
674 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
676 STGCALL1(mpz_init,&result1); \
677 STGCALL1(mpz_init,&result2); \
679 /* Perform the operation */ \
680 STGCALL4(mp_fun,&result1,&result2,&arg1,&arg2); \
682 TICK_RET_UNBOXED_TUP(4); \
683 RET_NPNP(result1._mp_size, \
684 result1._mp_d-sizeofW(StgArrWords), \
686 result2._mp_d-sizeofW(StgArrWords)); \
690 GMP_TAKE2_RET1(plusIntegerzh_fast, mpz_add);
691 GMP_TAKE2_RET1(minusIntegerzh_fast, mpz_sub);
692 GMP_TAKE2_RET1(timesIntegerzh_fast, mpz_mul);
693 GMP_TAKE2_RET1(gcdIntegerzh_fast, mpz_gcd);
694 GMP_TAKE2_RET1(quotIntegerzh_fast, mpz_tdiv_q);
695 GMP_TAKE2_RET1(remIntegerzh_fast, mpz_tdiv_r);
696 GMP_TAKE2_RET1(divExactIntegerzh_fast, mpz_divexact);
698 GMP_TAKE2_RET2(quotRemIntegerzh_fast, mpz_tdiv_qr);
699 GMP_TAKE2_RET2(divModIntegerzh_fast, mpz_fdiv_qr);
701 #ifndef FLOATS_AS_DOUBLES
702 FN_(decodeFloatzh_fast)
710 /* arguments: F1 = Float# */
713 HP_CHK_GEN_TICKY(sizeofW(StgArrWords)+1, NO_PTRS, decodeFloatzh_fast,);
714 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
715 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
717 /* Be prepared to tell Lennart-coded __decodeFloat */
718 /* where mantissa._mp_d can be put (it does not care about the rest) */
719 p = (StgArrWords *)Hp - 1;
720 SET_ARR_HDR(p,&ARR_WORDS_info,CCCS,1)
721 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
723 /* Perform the operation */
724 STGCALL3(__decodeFloat,&mantissa,&exponent,arg);
726 /* returns: (Int# (expn), Int#, ByteArray#) */
727 TICK_RET_UNBOXED_TUP(3);
728 RET_NNP(exponent,mantissa._mp_size,p);
731 #endif /* !FLOATS_AS_DOUBLES */
733 #define DOUBLE_MANTISSA_SIZE (sizeofW(StgDouble))
734 #define ARR_SIZE (sizeofW(StgArrWords) + DOUBLE_MANTISSA_SIZE)
736 FN_(decodeDoublezh_fast)
743 /* arguments: D1 = Double# */
746 HP_CHK_GEN_TICKY(ARR_SIZE, NO_PTRS, decodeDoublezh_fast,);
747 TICK_ALLOC_PRIM(sizeofW(StgArrWords),DOUBLE_MANTISSA_SIZE,0);
748 CCS_ALLOC(CCCS,ARR_SIZE); /* ccs prof */
750 /* Be prepared to tell Lennart-coded __decodeDouble */
751 /* where mantissa.d can be put (it does not care about the rest) */
752 p = (StgArrWords *)(Hp-ARR_SIZE+1);
753 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, DOUBLE_MANTISSA_SIZE);
754 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
756 /* Perform the operation */
757 STGCALL3(__decodeDouble,&mantissa,&exponent,arg);
759 /* returns: (Int# (expn), Int#, ByteArray#) */
760 TICK_RET_UNBOXED_TUP(3);
761 RET_NNP(exponent,mantissa._mp_size,p);
765 /* -----------------------------------------------------------------------------
766 * Concurrency primitives
767 * -------------------------------------------------------------------------- */
772 /* args: R1 = closure to spark */
774 MAYBE_GC(R1_PTR, forkzh_fast);
776 /* create it right now, return ThreadID in R1 */
777 R1.t = RET_STGCALL2(StgTSO *, createIOThread,
778 RtsFlags.GcFlags.initialStkSize, R1.cl);
779 STGCALL1(scheduleThread, R1.t);
781 /* switch at the earliest opportunity */
784 JMP_(ENTRY_CODE(Sp[0]));
791 JMP_(stg_yield_noregs);
802 HP_CHK_GEN_TICKY(sizeofW(StgMVar), NO_PTRS, newMVarzh_fast,);
803 TICK_ALLOC_PRIM(sizeofW(StgMutVar)-1, // consider head,tail,link as admin wds
805 CCS_ALLOC(CCCS,sizeofW(StgMVar)); /* ccs prof */
807 mvar = (StgMVar *) (Hp - sizeofW(StgMVar) + 1);
808 SET_HDR(mvar,&EMPTY_MVAR_info,CCCS);
809 mvar->head = mvar->tail = (StgTSO *)&END_TSO_QUEUE_closure;
810 mvar->value = (StgClosure *)&END_TSO_QUEUE_closure;
812 TICK_RET_UNBOXED_TUP(1);
821 const StgInfoTable *info;
824 /* args: R1 = MVar closure */
826 mvar = (StgMVar *)R1.p;
829 info = LOCK_CLOSURE(mvar);
831 info = GET_INFO(mvar);
834 /* If the MVar is empty, put ourselves on its blocking queue,
835 * and wait until we're woken up.
837 if (info == &EMPTY_MVAR_info) {
838 if (mvar->head == (StgTSO *)&END_TSO_QUEUE_closure) {
839 mvar->head = CurrentTSO;
841 mvar->tail->link = CurrentTSO;
843 CurrentTSO->link = (StgTSO *)&END_TSO_QUEUE_closure;
844 CurrentTSO->why_blocked = BlockedOnMVar;
845 CurrentTSO->block_info.closure = (StgClosure *)mvar;
846 mvar->tail = CurrentTSO;
849 /* unlock the MVar */
850 mvar->header.info = &EMPTY_MVAR_info;
852 BLOCK(R1_PTR, takeMVarzh_fast);
856 mvar->value = (StgClosure *)&END_TSO_QUEUE_closure;
858 /* do this last... we might have locked the MVar in the SMP case,
859 * and writing the info pointer will unlock it.
861 SET_INFO(mvar,&EMPTY_MVAR_info);
863 TICK_RET_UNBOXED_TUP(1);
868 FN_(tryTakeMVarzh_fast)
872 const StgInfoTable *info;
875 /* args: R1 = MVar closure */
877 mvar = (StgMVar *)R1.p;
880 info = LOCK_CLOSURE(mvar);
882 info = GET_INFO(mvar);
885 if (info == &EMPTY_MVAR_info) {
888 /* unlock the MVar */
889 mvar->header.info = &EMPTY_MVAR_info;
892 /* HACK: we need a pointer to pass back, so we abuse NO_FINALIZER_closure */
893 RET_NP(0, &NO_FINALIZER_closure);
897 mvar->value = (StgClosure *)&END_TSO_QUEUE_closure;
899 /* do this last... we might have locked the MVar in the SMP case,
900 * and writing the info pointer will unlock it.
902 SET_INFO(mvar,&EMPTY_MVAR_info);
904 TICK_RET_UNBOXED_TUP(1);
912 const StgInfoTable *info;
915 /* args: R1 = MVar, R2 = value */
917 mvar = (StgMVar *)R1.p;
920 info = LOCK_CLOSURE(mvar);
922 info = GET_INFO(mvar);
925 if (info == &FULL_MVAR_info) {
927 fprintf(stderr, "fatal: put on a full MVar in Hugs; aborting\n" );
930 R1.cl = (StgClosure *)PutFullMVar_closure;
937 /* wake up the first thread on the queue, it will continue with the
938 * takeMVar operation and mark the MVar empty again.
940 if (mvar->head != (StgTSO *)&END_TSO_QUEUE_closure) {
941 ASSERT(mvar->head->why_blocked == BlockedOnMVar);
943 mvar->head = RET_STGCALL2(StgTSO *,unblockOne,mvar->head,mvar);
945 // ToDo: check 2nd arg (mvar) is right
946 mvar->head = RET_STGCALL2(StgTSO *,unblockOne,mvar->head,mvar);
948 mvar->head = RET_STGCALL1(StgTSO *,unblockOne,mvar->head);
950 if (mvar->head == (StgTSO *)&END_TSO_QUEUE_closure) {
951 mvar->tail = (StgTSO *)&END_TSO_QUEUE_closure;
955 /* unlocks the MVar in the SMP case */
956 SET_INFO(mvar,&FULL_MVAR_info);
958 /* ToDo: yield here for better communication performance? */
959 JMP_(ENTRY_CODE(Sp[0]));
963 /* -----------------------------------------------------------------------------
964 Stable pointer primitives
965 ------------------------------------------------------------------------- */
967 FN_(makeStableNamezh_fast)
970 StgStableName *sn_obj;
973 HP_CHK_GEN_TICKY(sizeofW(StgStableName), R1_PTR, makeStableNamezh_fast,);
974 TICK_ALLOC_PRIM(sizeofW(StgHeader),
975 sizeofW(StgStableName)-sizeofW(StgHeader), 0);
976 CCS_ALLOC(CCCS,sizeofW(StgStableName)); /* ccs prof */
978 index = RET_STGCALL1(StgWord,lookupStableName,R1.p);
980 /* Is there already a StableName for this heap object? */
981 if (stable_ptr_table[index].sn_obj == NULL) {
982 sn_obj = (StgStableName *) (Hp - sizeofW(StgStableName) + 1);
983 sn_obj->header.info = &STABLE_NAME_info;
985 stable_ptr_table[index].sn_obj = (StgClosure *)sn_obj;
987 (StgClosure *)sn_obj = stable_ptr_table[index].sn_obj;
990 TICK_RET_UNBOXED_TUP(1);
994 /* -----------------------------------------------------------------------------
995 Thread I/O blocking primitives
996 -------------------------------------------------------------------------- */
1002 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1003 CurrentTSO->why_blocked = BlockedOnRead;
1004 CurrentTSO->block_info.fd = R1.i;
1005 ACQUIRE_LOCK(&sched_mutex);
1006 APPEND_TO_BLOCKED_QUEUE(CurrentTSO);
1007 RELEASE_LOCK(&sched_mutex);
1008 JMP_(stg_block_noregs);
1012 FN_(waitWritezh_fast)
1016 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1017 CurrentTSO->why_blocked = BlockedOnWrite;
1018 CurrentTSO->block_info.fd = R1.i;
1019 ACQUIRE_LOCK(&sched_mutex);
1020 APPEND_TO_BLOCKED_QUEUE(CurrentTSO);
1021 RELEASE_LOCK(&sched_mutex);
1022 JMP_(stg_block_noregs);
1032 ASSERT(CurrentTSO->why_blocked == NotBlocked);
1033 CurrentTSO->why_blocked = BlockedOnDelay;
1035 ACQUIRE_LOCK(&sched_mutex);
1037 target = (R1.i / (TICK_MILLISECS*1000)) + timestamp + ticks_since_timestamp;
1038 CurrentTSO->block_info.target = target;
1040 /* Insert the new thread in the sleeping queue. */
1043 while (t != END_TSO_QUEUE && t->block_info.target < target) {
1048 CurrentTSO->link = t;
1050 sleeping_queue = CurrentTSO;
1052 prev->link = CurrentTSO;
1055 RELEASE_LOCK(&sched_mutex);
1056 JMP_(stg_block_noregs);