1 /* -----------------------------------------------------------------------------
2 * $Id: PrimOps.hc,v 1.15 1999/02/11 17:15:22 simonm Exp $
4 * (c) The GHC Team, 1998-1999
6 * Primitive functions / data
8 * ---------------------------------------------------------------------------*/
15 #include "StgStartup.h"
20 #include "BlockAlloc.h" /* tmp */
21 #include "StablePriv.h"
25 classes CCallable and CReturnable don't really exist, but the
26 compiler insists on generating dictionaries containing references
27 to GHC_ZcCCallable_static_info etc., so we provide dummy symbols
31 W_ GHC_ZCCCallable_static_info[0];
32 W_ GHC_ZCCReturnable_static_info[0];
34 #ifndef aix_TARGET_OS /* AIX gives link errors with this as a const (RO assembler section) */
37 StgClosure *PrelBase_Bool_closure_tbl[] = {
42 /* -----------------------------------------------------------------------------
43 Macros for Hand-written primitives.
44 -------------------------------------------------------------------------- */
47 * Horrible macros for returning unboxed tuples.
49 * How an unboxed tuple is returned depends on two factors:
50 * - the number of real registers we have available
51 * - the boxedness of the returned fields.
53 * To return an unboxed tuple from a primitive operation, we have macros
54 * RET_<layout> where <layout> describes the boxedness of each field of the
55 * unboxed tuple: N indicates a non-pointer field, and P indicates a pointer.
57 * We only define the cases actually used, to avoid having too much
58 * garbage in this section. Warning: any bugs in here will be hard to
62 /*------ All Regs available */
64 # define RET_P(a) R1.w = (W_)(a); JMP_(ENTRY_CODE(Sp[0]));
65 # define RET_N(a) RET_P(a)
67 # define RET_PP(a,b) R1.w = (W_)(a); R2.w = (W_)(b); JMP_(ENTRY_CODE(Sp[0]));
68 # define RET_NN(a,b) RET_PP(a,b)
69 # define RET_NP(a,b) RET_PP(a,b)
71 # define RET_PPP(a,b,c) \
72 R1.w = (W_)(a); R2.w = (W_)(b); R3.w = (W_)(c); JMP_(ENTRY_CODE(Sp[0]));
73 # define RET_NNP(a,b,c) RET_PPP(a,b,c)
75 # define RET_NNNP(a,b,c,d) \
76 R1.w = (W_)(a); R2.w = (W_)(b); R3.w = (W_)(c); R4.w = (W_)d; \
77 JMP_(ENTRY_CODE(Sp[0]));
79 # define RET_NNPNNP(a,b,c,d,e,f) \
80 R1.w = (W_)(a); R2.w = (W_)(b); R3.w = (W_)(c); \
81 R4.w = (W_)(d); R5.w = (W_)(e); R6.w = (W_)(f); \
82 JMP_(ENTRY_CODE(Sp[0]));
86 #if defined(REG_R7) || defined(REG_R6) || defined(REG_R5) || \
87 defined(REG_R4) || defined(REG_R3) || defined(REG_R2)
88 # error RET_n macros not defined for this setup.
91 /*------ 1 Register available */
93 # define RET_P(a) R1.w = (W_)(a); JMP_(ENTRY_CODE(Sp[0]));
94 # define RET_N(a) RET_P(a)
96 # define RET_PP(a,b) R1.w = (W_)(a); Sp[-1] = (W_)(b); Sp -= 1; \
97 JMP_(ENTRY_CODE(Sp[1]));
98 # define RET_NN(a,b) R1.w = (W_)(a); Sp[-1] = (W_)(b); Sp -= 2; \
99 JMP_(ENTRY_CODE(Sp[2]));
100 # define RET_NP(a,b) RET_PP(a,b)
102 # define RET_PPP(a,b,c) \
103 R1.w = (W_)(a); Sp[-2] = (W_)(b); Sp[-1] = (W_)(c); Sp -= 2; \
104 JMP_(ENTRY_CODE(Sp[2]));
105 # define RET_NNP(a,b,c) \
106 R1.w = (W_)(a); Sp[-2] = (W_)(b); Sp[-1] = (W_)(c); Sp -= 3; \
107 JMP_(ENTRY_CODE(Sp[3]));
109 # define RET_NNNP(a,b,c,d) \
111 /* Sp[-5] = ARGTAG(1); */ \
113 /* Sp[-3] = ARGTAG(1); */ \
117 JMP_(ENTRY_CODE(Sp[5]));
119 # define RET_NNPNNP(a,b,c,d,e,f) \
123 /* Sp[-3] = ARGTAG(1); */ \
125 /* Sp[-5] = ARGTAG(1); */ \
128 /* Sp[-8] = ARGTAG(1); */ \
130 JMP_(ENTRY_CODE(Sp[8]));
132 #else /* 0 Regs available */
134 #define PUSH_P(o,x) Sp[-o] = (W_)(x)
135 #define PUSH_N(o,x) Sp[1-o] = (W_)(x); /* Sp[-o] = ARGTAG(1) */
136 #define PUSHED(m) Sp -= (m); JMP_(ENTRY_CODE(Sp[m]));
138 /* Here's how to construct these macros:
140 * N = number of N's in the name;
141 * P = number of P's in the name;
143 * while (nonNull(name)) {
144 * if (nextChar == 'P') {
155 # define RET_P(a) PUSH_P(1,a); PUSHED(1)
156 # define RET_N(a) PUSH_N(2,a); PUSHED(2)
158 # define RET_PP(a,b) PUSH_P(2,a); PUSH_P(1,b); PUSHED(2)
159 # define RET_NN(a,b) PUSH_N(4,a); PUSH_N(2,b); PUSHED(4)
160 # define RET_NP(a,b) PUSH_N(3,a); PUSH_P(1,b); PUSHED(3)
162 # define RET_PPP(a,b,c) PUSH_P(3,a); PUSH_P(2,b); PUSH_P(1,c); PUSHED(3)
163 # define RET_NNP(a,b,c) PUSH_N(6,a); PUSH_N(4,b); PUSH_N(2,c); PUSHED(6)
165 # 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)
166 # 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)
173 /*-----------------------------------------------------------------------------
176 Basically just new*Array - the others are all inline macros.
178 The size arg is always passed in R1, and the result returned in R1.
180 The slow entry point is for returning from a heap check, the saved
181 size argument must be re-loaded from the stack.
182 -------------------------------------------------------------------------- */
184 /* for objects that are *less* than the size of a word, make sure we
185 * round up to the nearest word for the size of the array.
188 #define BYTES_TO_STGWORDS(n) ((n) + sizeof(W_) - 1)/sizeof(W_)
190 #define newByteArray(ty,scale) \
191 FN_(new##ty##Arrayzh_fast) \
193 W_ stuff_size, size, n; \
196 MAYBE_GC(NO_PTRS,new##ty##Arrayzh_fast); \
198 stuff_size = BYTES_TO_STGWORDS(n*scale); \
199 size = sizeofW(StgArrWords)+ stuff_size; \
200 p = (StgArrWords *)RET_STGCALL1(P_,allocate,size); \
201 TICK_ALLOC_PRIM(sizeofW(StgArrWords),stuff_size,0); \
202 SET_HDR(p, &ARR_WORDS_info, CCCS); \
203 p->words = stuff_size; \
204 TICK_RET_UNBOXED_TUP(1) \
209 newByteArray(Char, sizeof(C_))
210 newByteArray(Int, sizeof(I_));
211 newByteArray(Word, sizeof(W_));
212 newByteArray(Addr, sizeof(P_));
213 newByteArray(Float, sizeof(StgFloat));
214 newByteArray(Double, sizeof(StgDouble));
215 newByteArray(StablePtr, sizeof(StgStablePtr));
225 MAYBE_GC(R2_PTR,newArrayzh_fast);
227 size = sizeofW(StgMutArrPtrs) + n;
228 arr = (StgMutArrPtrs *)RET_STGCALL1(P_, allocate, size);
229 TICK_ALLOC_PRIM(sizeofW(StgMutArrPtrs), n, 0);
231 SET_HDR(arr,&MUT_ARR_PTRS_info,CCCS);
235 for (p = (P_)arr + sizeofW(StgMutArrPtrs);
236 p < (P_)arr + size; p++) {
240 TICK_RET_UNBOXED_TUP(1);
245 FN_(newMutVarzh_fast)
248 /* Args: R1.p = initialisation value */
251 HP_CHK_GEN(sizeofW(StgMutVar), R1_PTR, newMutVarzh_fast,);
252 TICK_ALLOC_PRIM(sizeofW(StgHeader)+1,1, 0); /* hack, dependent on rep. */
253 CCS_ALLOC(CCCS,sizeofW(StgMutVar));
255 mv = (StgMutVar *)(Hp-sizeofW(StgMutVar)+1);
256 SET_HDR(mv,&MUT_VAR_info,CCCS);
259 TICK_RET_UNBOXED_TUP(1);
264 /* -----------------------------------------------------------------------------
265 Foreign Object Primitives
267 -------------------------------------------------------------------------- */
270 FN_(makeForeignObjzh_fast)
272 /* R1.p = ptr to foreign object,
274 StgForeignObj *result;
277 HP_CHK_GEN(sizeofW(StgForeignObj), NO_PTRS, makeForeignObjzh_fast,);
278 TICK_ALLOC_PRIM(sizeofW(StgHeader),
279 sizeofW(StgForeignObj)-sizeofW(StgHeader), 0);
280 CCS_ALLOC(CCCS,sizeofW(StgForeignObj)); /* ccs prof */
282 result = (StgForeignObj *) (Hp + 1 - sizeofW(StgForeignObj));
283 SET_HDR(result,&FOREIGN_info,CCCS);
286 /* returns (# s#, ForeignObj# #) */
287 TICK_RET_UNBOXED_TUP(1);
293 /* -----------------------------------------------------------------------------
294 Weak Pointer Primitives
295 -------------------------------------------------------------------------- */
308 HP_CHK_GEN(sizeofW(StgWeak), R1_PTR|R2_PTR|R3_PTR, mkWeakzh_fast,);
309 TICK_ALLOC_PRIM(sizeofW(StgHeader)+1, // +1 is for the link field
310 sizeofW(StgWeak)-sizeofW(StgHeader)-1, 0);
311 CCS_ALLOC(CCCS,sizeofW(StgWeak)); /* ccs prof */
313 w = (StgWeak *) (Hp + 1 - sizeofW(StgWeak));
314 SET_HDR(w, &WEAK_info, CCCS);
319 w->finalizer = R3.cl;
321 w->finalizer = &NO_FINALIZER_closure;
324 w->link = weak_ptr_list;
326 IF_DEBUG(weak, fprintf(stderr,"New weak pointer at %p\n",w));
328 TICK_RET_UNBOXED_TUP(1);
333 FN_(finalizzeWeakzh_fast)
339 TICK_RET_UNBOXED_TUP(0);
343 if (w->header.info == &DEAD_WEAK_info) {
344 RET_NP(0,&NO_FINALIZER_closure);
348 w->header.info = &DEAD_WEAK_info;
350 /* return the finalizer */
351 if (w->finalizer == &NO_FINALIZER_closure) {
352 RET_NP(0,&NO_FINALIZER_closure);
354 RET_NP(1,w->finalizer);
361 /* -----------------------------------------------------------------------------
362 Arbitrary-precision Integer operations.
363 -------------------------------------------------------------------------- */
365 FN_(int2Integerzh_fast)
367 /* arguments: R1 = Int# */
369 I_ val, s; /* to avoid aliasing */
370 StgArrWords* p; /* address of array result */
374 HP_CHK_GEN(sizeofW(StgArrWords)+1, NO_PTRS, int2Integerzh_fast,);
375 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
376 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
378 p = stgCast(StgArrWords*,Hp)-1;
379 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, 1);
381 /* mpz_set_si is inlined here, makes things simpler */
385 } else if (val > 0) {
392 /* returns (# alloc :: Int#,
397 TICK_RET_UNBOXED_TUP(3);
402 FN_(word2Integerzh_fast)
404 /* arguments: R1 = Word# */
406 W_ val; /* to avoid aliasing */
408 StgArrWords* p; /* address of array result */
412 HP_CHK_GEN(sizeofW(StgArrWords)+1, NO_PTRS, word2Integerzh_fast,)
413 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
414 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
416 p = stgCast(StgArrWords*,Hp)-1;
417 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, 1);
426 /* returns (# alloc :: Int#,
431 TICK_RET_UNBOXED_TUP(3);
436 FN_(addr2Integerzh_fast)
442 MAYBE_GC(NO_PTRS,addr2Integerzh_fast);
444 /* args: R1 :: Addr# */
447 /* Perform the operation */
448 if (RET_STGCALL3(int, mpz_init_set_str,&result,(str),/*base*/10))
451 TICK_RET_UNBOXED_TUP(3);
452 RET_NNP(result._mp_alloc, result._mp_size,
453 result._mp_d - sizeofW(StgArrWords));
458 * 'long long' primops for converting to/from Integers.
461 #ifdef SUPPORT_LONG_LONGS
463 FN_(int64ToIntegerzh_fast)
465 /* arguments: L1 = Int64# */
467 StgInt64 val; /* to avoid aliasing */
469 I_ s,a, neg, words_needed;
470 StgArrWords* p; /* address of array result */
476 if ( val >= 0x100000000LL || val <= -0x100000000LL ) {
479 /* minimum is one word */
482 HP_CHK_GEN(sizeofW(StgArrWords)+words_needed, NO_PTRS, int64ToIntegerzh_fast,)
483 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
484 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
486 p = stgCast(StgArrWords*,(Hp-words_needed+1))-1;
487 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, words_needed);
496 hi = (W_)((LW_)val / 0x100000000ULL);
502 } else if ( val != 0 ) {
505 } else /* val==0 */ {
508 s = ( neg ? -s : s );
510 /* returns (# alloc :: Int#,
515 TICK_RET_UNBOXED_TUP(3);
520 FN_(word64ToIntegerzh_fast)
522 /* arguments: L1 = Word64# */
524 StgNat64 val; /* to avoid aliasing */
527 StgArrWords* p; /* address of array result */
531 if ( val >= 0x100000000ULL ) {
536 HP_CHK_GEN(sizeofW(StgArrWords)+words_needed, NO_PTRS, word64ToIntegerzh_fast,)
537 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
538 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
540 p = stgCast(StgArrWords*,(Hp-words_needed+1))-1;
541 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, words_needed);
545 hi = (W_)((LW_)val / 0x100000000ULL);
546 if ( val >= 0x100000000ULL ) {
550 } else if ( val != 0 ) {
553 } else /* val==0 */ {
557 /* returns (# alloc :: Int#,
562 TICK_RET_UNBOXED_TUP(3);
568 #endif /* HAVE_LONG_LONG */
570 /* ToDo: this is shockingly inefficient */
572 #define GMP_TAKE2_RET1(name,mp_fun) \
575 MP_INT arg1, arg2, result; \
581 /* call doYouWantToGC() */ \
582 MAYBE_GC(R3_PTR | R6_PTR, name); \
586 d1 = stgCast(StgArrWords*,R3.p); \
589 d2 = stgCast(StgArrWords*,R6.p); \
591 arg1._mp_alloc = (a1); \
592 arg1._mp_size = (s1); \
593 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
594 arg2._mp_alloc = (a2); \
595 arg2._mp_size = (s2); \
596 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
598 STGCALL1(mpz_init,&result); \
600 /* Perform the operation */ \
601 STGCALL3(mp_fun,&result,&arg1,&arg2); \
603 TICK_RET_UNBOXED_TUP(3); \
604 RET_NNP(result._mp_alloc, \
606 result._mp_d-sizeofW(StgArrWords)); \
610 #define GMP_TAKE2_RET2(name,mp_fun) \
613 MP_INT arg1, arg2, result1, result2; \
619 /* call doYouWantToGC() */ \
620 MAYBE_GC(R3_PTR | R6_PTR, name); \
624 d1 = stgCast(StgArrWords*,R3.p); \
627 d2 = stgCast(StgArrWords*,R6.p); \
629 arg1._mp_alloc = (a1); \
630 arg1._mp_size = (s1); \
631 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
632 arg2._mp_alloc = (a2); \
633 arg2._mp_size = (s2); \
634 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
636 STGCALL1(mpz_init,&result1); \
637 STGCALL1(mpz_init,&result2); \
639 /* Perform the operation */ \
640 STGCALL4(mp_fun,&result1,&result2,&arg1,&arg2); \
642 TICK_RET_UNBOXED_TUP(6); \
643 RET_NNPNNP(result1._mp_alloc, \
645 result1._mp_d-sizeofW(StgArrWords), \
648 result2._mp_d-sizeofW(StgArrWords)); \
652 GMP_TAKE2_RET1(plusIntegerzh_fast, mpz_add);
653 GMP_TAKE2_RET1(minusIntegerzh_fast, mpz_sub);
654 GMP_TAKE2_RET1(timesIntegerzh_fast, mpz_mul);
655 GMP_TAKE2_RET1(gcdIntegerzh_fast, mpz_gcd);
657 GMP_TAKE2_RET2(quotRemIntegerzh_fast, mpz_tdiv_qr);
658 GMP_TAKE2_RET2(divModIntegerzh_fast, mpz_fdiv_qr);
660 #ifndef FLOATS_AS_DOUBLES
661 FN_(decodeFloatzh_fast)
669 /* arguments: F1 = Float# */
672 HP_CHK_GEN(sizeof(StgArrWords)+1, NO_PTRS, decodeFloatzh_fast,);
673 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
674 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
676 /* Be prepared to tell Lennart-coded __decodeFloat */
677 /* where mantissa._mp_d can be put (it does not care about the rest) */
678 p = stgCast(StgArrWords*,Hp)-1;
679 SET_ARR_HDR(p,&ARR_WORDS_info,CCCS,1)
680 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
682 /* Perform the operation */
683 STGCALL3(__decodeFloat,&mantissa,&exponent,arg);
685 /* returns: (R1 = Int# (expn), R2 = Int#, R3 = Int#, R4 = ByteArray#) */
686 TICK_RET_UNBOXED_TUP(4);
687 RET_NNNP(exponent,mantissa._mp_alloc,mantissa._mp_size,p);
690 #endif /* !FLOATS_AS_DOUBLES */
692 #define DOUBLE_MANTISSA_SIZE (sizeof(StgDouble)/sizeof(W_))
693 #define ARR_SIZE (sizeof(StgArrWords) + DOUBLE_MANTISSA_SIZE)
695 FN_(decodeDoublezh_fast)
702 /* arguments: D1 = Double# */
705 HP_CHK_GEN(ARR_SIZE, NO_PTRS, decodeDoublezh_fast,);
706 TICK_ALLOC_PRIM(sizeof(StgArrWords),DOUBLE_MANTISSA_SIZE,0);
707 CCS_ALLOC(CCCS,ARR_SIZE); /* ccs prof */
709 /* Be prepared to tell Lennart-coded __decodeDouble */
710 /* where mantissa.d can be put (it does not care about the rest) */
711 p = stgCast(StgArrWords*,Hp-ARR_SIZE+1);
712 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, DOUBLE_MANTISSA_SIZE);
713 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
715 /* Perform the operation */
716 STGCALL3(__decodeDouble,&mantissa,&exponent,arg);
718 /* returns: (R1 = Int# (expn), R2 = Int#, R3 = Int#, R4 = ByteArray#) */
719 TICK_RET_UNBOXED_TUP(4);
720 RET_NNNP(exponent,mantissa._mp_alloc,mantissa._mp_size,p);
724 /* -----------------------------------------------------------------------------
725 * Concurrency primitives
726 * -------------------------------------------------------------------------- */
731 /* args: R1 = closure to spark */
733 if (closure_SHOULD_SPARK(stgCast(StgClosure*,R1.p))) {
735 MAYBE_GC(R1_PTR, forkzh_fast);
737 /* create it right now, return ThreadID in R1 */
738 R1.t = RET_STGCALL2(StgTSO *, createIOThread,
739 RtsFlags.GcFlags.initialStkSize, R1.cl);
741 /* switch at the earliest opportunity */
745 JMP_(ENTRY_CODE(Sp[0]));
749 FN_(killThreadzh_fast)
752 /* args: R1.p = TSO to kill */
754 /* The thread is dead, but the TSO sticks around for a while. That's why
755 * we don't have to explicitly remove it from any queues it might be on.
757 STGCALL1(deleteThread, (StgTSO *)R1.p);
759 /* We might have killed ourselves. In which case, better return to the
762 if ((StgTSO *)R1.p == CurrentTSO) {
763 JMP_(stg_stop_thread_entry); /* leave semi-gracefully */
766 JMP_(ENTRY_CODE(Sp[0]));
777 HP_CHK_GEN(sizeofW(StgMVar), NO_PTRS, newMVarzh_fast,);
778 TICK_ALLOC_PRIM(sizeofW(StgMutVar)-1, // consider head,tail,link as admin wds
780 CCS_ALLOC(CCCS,sizeofW(StgMVar)); /* ccs prof */
782 mvar = (StgMVar *) (Hp - sizeofW(StgMVar) + 1);
783 SET_INFO(mvar,&EMPTY_MVAR_info);
784 mvar->head = mvar->tail = (StgTSO *)&END_TSO_QUEUE_closure;
785 mvar->value = (StgClosure *)&END_TSO_QUEUE_closure;
787 TICK_RET_UNBOXED_TUP(1);
798 /* args: R1 = MVar closure */
800 mvar = (StgMVar *)R1.p;
802 /* If the MVar is empty, put ourselves on its blocking queue,
803 * and wait until we're woken up.
805 if (GET_INFO(mvar) != &FULL_MVAR_info) {
806 if (mvar->head == (StgTSO *)&END_TSO_QUEUE_closure) {
807 mvar->head = CurrentTSO;
809 mvar->tail->link = CurrentTSO;
811 CurrentTSO->link = (StgTSO *)&END_TSO_QUEUE_closure;
812 mvar->tail = CurrentTSO;
814 BLOCK(R1_PTR, takeMVarzh_fast);
817 SET_INFO(mvar,&EMPTY_MVAR_info);
819 mvar->value = (StgClosure *)&END_TSO_QUEUE_closure;
821 TICK_RET_UNBOXED_TUP(1);
832 /* args: R1 = MVar, R2 = value */
834 mvar = (StgMVar *)R1.p;
835 if (GET_INFO(mvar) == &FULL_MVAR_info) {
837 fprintf(stderr, "putMVar#: MVar already full.\n");
838 stg_exit(EXIT_FAILURE);
841 SET_INFO(mvar,&FULL_MVAR_info);
844 /* wake up the first thread on the queue,
845 * it will continue with the takeMVar operation and mark the MVar
849 if (tso != (StgTSO *)&END_TSO_QUEUE_closure) {
850 PUSH_ON_RUN_QUEUE(tso);
851 mvar->head = tso->link;
852 tso->link = (StgTSO *)&END_TSO_QUEUE_closure;
853 if (mvar->head == (StgTSO *)&END_TSO_QUEUE_closure) {
854 mvar->tail = (StgTSO *)&END_TSO_QUEUE_closure;
858 /* ToDo: yield here for better communication performance? */
859 JMP_(ENTRY_CODE(Sp[0]));
863 /* -----------------------------------------------------------------------------
864 Stable pointer primitives
865 ------------------------------------------------------------------------- */
867 FN_(makeStableNamezh_fast)
870 StgStableName *sn_obj;
873 HP_CHK_GEN(sizeofW(StgStableName), R1_PTR, makeStableNamezh_fast,);
874 TICK_ALLOC_PRIM(sizeofW(StgHeader),
875 sizeofW(StgStableName)-sizeofW(StgHeader), 0);
876 CCS_ALLOC(CCCS,sizeofW(StgStableName)); /* ccs prof */
878 index = RET_STGCALL1(StgWord,lookupStableName,R1.p);
880 sn_obj = (StgStableName *) (Hp - sizeofW(StgStableName) + 1);
881 sn_obj->header.info = &STABLE_NAME_info;
884 TICK_RET_UNBOXED_TUP(1);
888 #endif /* COMPILER */