1 /* -----------------------------------------------------------------------------
2 * $Id: PrimOps.hc,v 1.7 1999/01/26 11:12:46 simonm Exp $
4 * Primitive functions / data
6 * ---------------------------------------------------------------------------*/
13 #include "StgStartup.h"
18 #include "BlockAlloc.h" /* tmp */
19 #include "StablePriv.h"
23 classes CCallable and CReturnable don't really exist, but the
24 compiler insists on generating dictionaries containing references
25 to GHC_ZcCCallable_static_info etc., so we provide dummy symbols
29 W_ GHC_ZcCCallable_static_info[0];
30 W_ GHC_ZcCReturnable_static_info[0];
32 #ifndef aix_TARGET_OS /* AIX gives link errors with this as a const (RO assembler section) */
35 StgClosure *PrelBase_Bool_closure_tbl[] = {
40 /* -----------------------------------------------------------------------------
41 Macros for Hand-written primitives.
42 -------------------------------------------------------------------------- */
45 * Horrible macros for returning unboxed tuples.
47 * How an unboxed tuple is returned depends on two factors:
48 * - the number of real registers we have available
49 * - the boxedness of the returned fields.
51 * To return an unboxed tuple from a primitive operation, we have macros
52 * RET_<layout> where <layout> describes the boxedness of each field of the
53 * unboxed tuple: N indicates a non-pointer field, and P indicates a pointer.
55 * We only define the cases actually used, to avoid having too much
56 * garbage in this section. Warning: any bugs in here will be hard to
60 /*------ All Regs available */
62 # define RET_P(a) R1.w = (W_)(a); JMP_(ENTRY_CODE(Sp[0]));
63 # define RET_N(a) RET_P(a)
65 # define RET_PP(a,b) R1.w = (W_)(a); R2.w = (W_)(b); JMP_(ENTRY_CODE(Sp[0]));
66 # define RET_NN(a,b) RET_PP(a,b)
67 # define RET_NP(a,b) RET_PP(a,b)
69 # define RET_PPP(a,b,c) \
70 R1.w = (W_)(a); R2.w = (W_)(b); R3.w = (W_)(c); JMP_(ENTRY_CODE(Sp[0]));
71 # define RET_NNP(a,b,c) RET_PPP(a,b,c)
73 # define RET_NNNP(a,b,c,d) \
74 R1.w = (W_)(a); R2.w = (W_)(b); R3.w = (W_)(c); R4.w = (W_)d; \
75 JMP_(ENTRY_CODE(Sp[0]));
77 # define RET_NNPNNP(a,b,c,d,e,f) \
78 R1.w = (W_)(a); R2.w = (W_)(b); R3.w = (W_)(c); \
79 R4.w = (W_)(d); R5.w = (W_)(e); R6.w = (W_)(f); \
80 JMP_(ENTRY_CODE(Sp[0]));
84 #if defined(REG_R7) || defined(REG_R6) || defined(REG_R5) || \
85 defined(REG_R4) || defined(REG_R3) || defined(REG_R2)
86 # error RET_n macros not defined for this setup.
89 /*------ 1 Register available */
91 # define RET_P(a) R1.w = (W_)(a); JMP_(ENTRY_CODE(Sp[0]));
92 # define RET_N(a) RET_P(a)
94 # define RET_PP(a,b) R1.w = (W_)(a); Sp[-1] = (W_)(b); Sp -= 1; \
95 JMP_(ENTRY_CODE(Sp[1]));
96 # define RET_NN(a,b) R1.w = (W_)(a); Sp[-1] = (W_)(b); Sp -= 2; \
97 JMP_(ENTRY_CODE(Sp[2]));
98 # define RET_NP(a,b) RET_PP(a,b)
100 # define RET_PPP(a,b,c) \
101 R1.w = (W_)(a); Sp[-2] = (W_)(b); Sp[-1] = (W_)(c); Sp -= 2; \
102 JMP_(ENTRY_CODE(Sp[2]));
103 # define RET_NNP(a,b,c) \
104 R1.w = (W_)(a); Sp[-2] = (W_)(b); Sp[-1] = (W_)(c); Sp -= 3; \
105 JMP_(ENTRY_CODE(Sp[3]));
107 # define RET_NNNP(a,b,c,d) \
109 /* Sp[-5] = ARGTAG(1); */ \
111 /* Sp[-3] = ARGTAG(1); */ \
115 JMP_(ENTRY_CODE(Sp[5]));
117 # define RET_NNPNNP(a,b,c,d,e,f) \
121 /* Sp[-3] = ARGTAG(1); */ \
123 /* Sp[-5] = ARGTAG(1); */ \
126 /* Sp[-8] = ARGTAG(1); */ \
128 JMP_(ENTRY_CODE(Sp[8]));
130 #else /* 0 Regs available */
132 #define PUSH_P(o,x) Sp[-o] = (W_)(x)
133 #define PUSH_N(o,x) Sp[1-o] = (W_)(x); /* Sp[-o] = ARGTAG(1) */
134 #define PUSHED(m) Sp -= (m); JMP_(ENTRY_CODE(Sp[m]));
136 /* Here's how to construct these macros:
138 * N = number of N's in the name;
139 * P = number of P's in the name;
141 * while (nonNull(name)) {
142 * if (nextChar == 'P') {
153 # define RET_P(a) PUSH_P(1,a); PUSHED(1)
154 # define RET_N(a) PUSH_N(2,a); PUSHED(2)
156 # define RET_PP(a,b) PUSH_P(2,a); PUSH_P(1,b); PUSHED(2)
157 # define RET_NN(a,b) PUSH_N(4,a); PUSH_N(2,b); PUSHED(4)
158 # define RET_NP(a,b) PUSH_N(3,a); PUSH_P(1,b); PUSHED(3)
160 # define RET_PPP(a,b,c) PUSH_P(3,a); PUSH_P(2,b); PUSH_P(1,c); PUSHED(3)
161 # define RET_NNP(a,b,c) PUSH_N(6,a); PUSH_N(4,b); PUSH_N(2,c); PUSHED(6)
163 # 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)
164 # 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)
171 /*-----------------------------------------------------------------------------
174 Basically just new*Array - the others are all inline macros.
176 The size arg is always passed in R1, and the result returned in R1.
178 The slow entry point is for returning from a heap check, the saved
179 size argument must be re-loaded from the stack.
180 -------------------------------------------------------------------------- */
182 /* for objects that are *less* than the size of a word, make sure we
183 * round up to the nearest word for the size of the array.
186 #define BYTES_TO_STGWORDS(n) ((n) + sizeof(W_) - 1)/sizeof(W_)
188 #define newByteArray(ty,scale) \
189 FN_(new##ty##ArrayZh_fast) \
191 W_ stuff_size, size, n; \
194 MAYBE_GC(NO_PTRS,new##ty##ArrayZh_fast); \
196 stuff_size = BYTES_TO_STGWORDS(n*scale); \
197 size = sizeofW(StgArrWords)+ stuff_size; \
198 p = (StgArrWords *)RET_STGCALL1(P_,allocate,size); \
199 TICK_ALLOC_PRIM(sizeofW(StgArrWords),stuff_size,0); \
200 SET_HDR(p, &MUT_ARR_WORDS_info, CCCS); \
201 p->words = stuff_size; \
202 TICK_RET_UNBOXED_TUP(1) \
207 newByteArray(Char, sizeof(C_))
208 newByteArray(Int, sizeof(I_));
209 newByteArray(Word, sizeof(W_));
210 newByteArray(Addr, sizeof(P_));
211 newByteArray(Float, sizeof(StgFloat));
212 newByteArray(Double, sizeof(StgDouble));
213 newByteArray(StablePtr, sizeof(StgStablePtr));
223 MAYBE_GC(R2_PTR,newArrayZh_fast);
225 size = sizeofW(StgMutArrPtrs) + n;
226 arr = (StgMutArrPtrs *)RET_STGCALL1(P_, allocate, size);
227 TICK_ALLOC_PRIM(sizeofW(StgMutArrPtrs), n, 0);
229 SET_HDR(arr,&MUT_ARR_PTRS_info,CCCS);
233 for (p = (P_)arr + sizeofW(StgMutArrPtrs);
234 p < (P_)arr + size; p++) {
238 TICK_RET_UNBOXED_TUP(1);
243 FN_(newMutVarZh_fast)
246 /* Args: R1.p = initialisation value */
249 HP_CHK_GEN(sizeofW(StgMutVar), R1_PTR, newMutVarZh_fast,);
250 TICK_ALLOC_PRIM(sizeofW(StgHeader)+1,1, 0); /* hack, dependent on rep. */
251 CCS_ALLOC(CCCS,sizeofW(StgMutVar));
253 mv = (StgMutVar *)(Hp-sizeofW(StgMutVar)+1);
254 SET_HDR(mv,&MUT_VAR_info,CCCS);
257 TICK_RET_UNBOXED_TUP(1);
262 /* -----------------------------------------------------------------------------
263 Foreign Object Primitives
265 -------------------------------------------------------------------------- */
268 FN_(makeForeignObjZh_fast)
270 /* R1.p = ptr to foreign object,
272 StgForeignObj *result;
275 HP_CHK_GEN(sizeofW(StgForeignObj), NO_PTRS, makeForeignObjZh_fast,);
276 TICK_ALLOC_PRIM(sizeofW(StgHeader),
277 sizeofW(StgForeignObj)-sizeofW(StgHeader), 0);
278 CCS_ALLOC(CCCS,sizeofW(StgForeignObj)); /* ccs prof */
280 result = (StgForeignObj *) (Hp + 1 - sizeofW(StgForeignObj));
281 SET_HDR(result,&FOREIGN_info,CCCS);
284 /* returns (# s#, ForeignObj# #) */
285 TICK_RET_UNBOXED_TUP(1);
291 /* -----------------------------------------------------------------------------
292 Weak Pointer Primitives
293 -------------------------------------------------------------------------- */
306 HP_CHK_GEN(sizeofW(StgWeak), R1_PTR|R2_PTR|R3_PTR, mkWeakZh_fast,);
307 TICK_ALLOC_PRIM(sizeofW(StgHeader)+1, // +1 is for the link field
308 sizeofW(StgWeak)-sizeofW(StgHeader)-1, 0);
309 CCS_ALLOC(CCCS,sizeofW(StgWeak)); /* ccs prof */
311 w = (StgWeak *) (Hp + 1 - sizeofW(StgWeak));
312 SET_HDR(w, &WEAK_info, CCCS);
316 w->finaliser = R3.cl;
318 w->link = weak_ptr_list;
320 IF_DEBUG(weak, fprintf(stderr,"New weak pointer at %p\n",w));
322 TICK_RET_UNBOXED_TUP(1);
327 FN_(deRefWeakZh_fast)
334 TICK_RET_UNBOXED_TUP(2);
336 if (w->header.info == &WEAK_info) {
346 /* -----------------------------------------------------------------------------
347 Arbitrary-precision Integer operations.
348 -------------------------------------------------------------------------- */
350 FN_(int2IntegerZh_fast)
352 /* arguments: R1 = Int# */
354 I_ val, s; /* to avoid aliasing */
355 StgArrWords* p; /* address of array result */
359 HP_CHK_GEN(sizeofW(StgArrWords)+1, NO_PTRS, int2IntegerZh_fast,);
360 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
361 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
363 p = stgCast(StgArrWords*,Hp)-1;
364 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, 1);
366 /* mpz_set_si is inlined here, makes things simpler */
370 } else if (val > 0) {
377 /* returns (# alloc :: Int#,
382 TICK_RET_UNBOXED_TUP(3);
387 FN_(word2IntegerZh_fast)
389 /* arguments: R1 = Word# */
391 W_ val; /* to avoid aliasing */
393 StgArrWords* p; /* address of array result */
397 HP_CHK_GEN(sizeofW(StgArrWords)+1, NO_PTRS, word2IntegerZh_fast,)
398 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
399 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
401 p = stgCast(StgArrWords*,Hp)-1;
402 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, 1);
411 /* returns (# alloc :: Int#,
416 TICK_RET_UNBOXED_TUP(3);
421 FN_(addr2IntegerZh_fast)
427 MAYBE_GC(NO_PTRS,addr2IntegerZh_fast);
429 /* args: R1 :: Addr# */
432 /* Perform the operation */
433 if (RET_STGCALL3(int, mpz_init_set_str,&result,(str),/*base*/10))
436 TICK_RET_UNBOXED_TUP(3);
437 RET_NNP(result._mp_alloc, result._mp_size,
438 result._mp_d - sizeofW(StgArrWords));
443 * 'long long' primops for converting to/from Integers.
446 #ifdef SUPPORT_LONG_LONGS
448 FN_(int64ToIntegerZh_fast)
450 /* arguments: L1 = Int64# */
452 StgInt64 val; /* to avoid aliasing */
454 I_ s,a, neg, words_needed;
455 StgArrWords* p; /* address of array result */
461 if ( val >= 0x100000000LL || val <= -0x100000000LL ) {
464 /* minimum is one word */
467 HP_CHK_GEN(sizeofW(StgArrWords)+words_needed, NO_PTRS, int64ToIntegerZh_fast,)
468 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
469 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
471 p = stgCast(StgArrWords*,(Hp-words_needed+1))-1;
472 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, words_needed);
481 hi = (W_)((LW_)val / 0x100000000ULL);
487 } else if ( val != 0 ) {
490 } else /* val==0 */ {
493 s = ( neg ? -s : s );
495 /* returns (# alloc :: Int#,
500 TICK_RET_UNBOXED_TUP(3);
505 FN_(word64ToIntegerZh_fast)
507 /* arguments: L1 = Word64# */
509 StgNat64 val; /* to avoid aliasing */
512 StgArrWords* p; /* address of array result */
516 if ( val >= 0x100000000ULL ) {
521 HP_CHK_GEN(sizeofW(StgArrWords)+words_needed, NO_PTRS, word64ToIntegerZh_fast,)
522 TICK_ALLOC_PRIM(sizeofW(StgArrWords),words_needed,0);
523 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+words_needed); /* ccs prof */
525 p = stgCast(StgArrWords*,(Hp-words_needed+1))-1;
526 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, words_needed);
530 hi = (W_)((LW_)val / 0x100000000ULL);
531 if ( val >= 0x100000000ULL ) {
535 } else if ( val != 0 ) {
538 } else /* val==0 */ {
542 /* returns (# alloc :: Int#,
547 TICK_RET_UNBOXED_TUP(3);
553 #endif /* HAVE_LONG_LONG */
555 /* ToDo: this is shockingly inefficient */
557 #define GMP_TAKE2_RET1(name,mp_fun) \
560 MP_INT arg1, arg2, result; \
566 /* call doYouWantToGC() */ \
567 MAYBE_GC(R3_PTR | R6_PTR, name); \
571 d1 = stgCast(StgArrWords*,R3.p); \
574 d2 = stgCast(StgArrWords*,R6.p); \
576 arg1._mp_alloc = (a1); \
577 arg1._mp_size = (s1); \
578 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
579 arg2._mp_alloc = (a2); \
580 arg2._mp_size = (s2); \
581 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
583 STGCALL1(mpz_init,&result); \
585 /* Perform the operation */ \
586 STGCALL3(mp_fun,&result,&arg1,&arg2); \
588 TICK_RET_UNBOXED_TUP(3); \
589 RET_NNP(result._mp_alloc, \
591 result._mp_d-sizeofW(StgArrWords)); \
595 #define GMP_TAKE2_RET2(name,mp_fun) \
598 MP_INT arg1, arg2, result1, result2; \
604 /* call doYouWantToGC() */ \
605 MAYBE_GC(R3_PTR | R6_PTR, name); \
609 d1 = stgCast(StgArrWords*,R3.p); \
612 d2 = stgCast(StgArrWords*,R6.p); \
614 arg1._mp_alloc = (a1); \
615 arg1._mp_size = (s1); \
616 arg1._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d1)); \
617 arg2._mp_alloc = (a2); \
618 arg2._mp_size = (s2); \
619 arg2._mp_d = (unsigned long int *) (BYTE_ARR_CTS(d2)); \
621 STGCALL1(mpz_init,&result1); \
622 STGCALL1(mpz_init,&result2); \
624 /* Perform the operation */ \
625 STGCALL4(mp_fun,&result1,&result2,&arg1,&arg2); \
627 TICK_RET_UNBOXED_TUP(6); \
628 RET_NNPNNP(result1._mp_alloc, \
630 result1._mp_d-sizeofW(StgArrWords), \
633 result2._mp_d-sizeofW(StgArrWords)); \
637 GMP_TAKE2_RET1(plusIntegerZh_fast, mpz_add);
638 GMP_TAKE2_RET1(minusIntegerZh_fast, mpz_sub);
639 GMP_TAKE2_RET1(timesIntegerZh_fast, mpz_mul);
640 GMP_TAKE2_RET1(gcdIntegerZh_fast, mpz_gcd);
642 GMP_TAKE2_RET2(quotRemIntegerZh_fast, mpz_tdiv_qr);
643 GMP_TAKE2_RET2(divModIntegerZh_fast, mpz_fdiv_qr);
645 #ifndef FLOATS_AS_DOUBLES
646 FN_(decodeFloatZh_fast)
654 /* arguments: F1 = Float# */
657 HP_CHK_GEN(sizeof(StgArrWords)+1, NO_PTRS, decodeFloatZh_fast,);
658 TICK_ALLOC_PRIM(sizeofW(StgArrWords),1,0);
659 CCS_ALLOC(CCCS,sizeofW(StgArrWords)+1); /* ccs prof */
661 /* Be prepared to tell Lennart-coded __decodeFloat */
662 /* where mantissa._mp_d can be put (it does not care about the rest) */
663 p = stgCast(StgArrWords*,Hp)-1;
664 SET_ARR_HDR(p,&ARR_WORDS_info,CCCS,1)
665 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
667 /* Perform the operation */
668 STGCALL3(__decodeFloat,&mantissa,&exponent,arg);
670 /* returns: (R1 = Int# (expn), R2 = Int#, R3 = Int#, R4 = ByteArray#) */
671 TICK_RET_UNBOXED_TUP(4);
672 RET_NNNP(exponent,mantissa._mp_alloc,mantissa._mp_size,p);
675 #endif /* !FLOATS_AS_DOUBLES */
677 #define DOUBLE_MANTISSA_SIZE (sizeof(StgDouble)/sizeof(W_))
678 #define ARR_SIZE (sizeof(StgArrWords) + DOUBLE_MANTISSA_SIZE)
680 FN_(decodeDoubleZh_fast)
687 /* arguments: D1 = Double# */
690 HP_CHK_GEN(ARR_SIZE, NO_PTRS, decodeDoubleZh_fast,);
691 TICK_ALLOC_PRIM(sizeof(StgArrWords),DOUBLE_MANTISSA_SIZE,0);
692 CCS_ALLOC(CCCS,ARR_SIZE); /* ccs prof */
694 /* Be prepared to tell Lennart-coded __decodeDouble */
695 /* where mantissa.d can be put (it does not care about the rest) */
696 p = stgCast(StgArrWords*,Hp-ARR_SIZE+1);
697 SET_ARR_HDR(p, &ARR_WORDS_info, CCCS, DOUBLE_MANTISSA_SIZE);
698 mantissa._mp_d = (void *)BYTE_ARR_CTS(p);
700 /* Perform the operation */
701 STGCALL3(__decodeDouble,&mantissa,&exponent,arg);
703 /* returns: (R1 = Int# (expn), R2 = Int#, R3 = Int#, R4 = ByteArray#) */
704 TICK_RET_UNBOXED_TUP(4);
705 RET_NNNP(exponent,mantissa._mp_alloc,mantissa._mp_size,p);
709 /* -----------------------------------------------------------------------------
710 * Concurrency primitives
711 * -------------------------------------------------------------------------- */
716 /* args: R1 = closure to spark */
718 if (closure_SHOULD_SPARK(stgCast(StgClosure*,R1.p))) {
720 MAYBE_GC(R1_PTR, forkZh_fast);
722 /* create it right now, return ThreadID in R1 */
723 R1.t = RET_STGCALL2(StgTSO *, createIOThread,
724 RtsFlags.GcFlags.initialStkSize, R1.cl);
726 /* switch at the earliest opportunity */
730 JMP_(ENTRY_CODE(Sp[0]));
734 FN_(killThreadZh_fast)
737 /* args: R1.p = TSO to kill */
739 /* The thread is dead, but the TSO sticks around for a while. That's why
740 * we don't have to explicitly remove it from any queues it might be on.
742 STGCALL1(deleteThread, (StgTSO *)R1.p);
744 /* We might have killed ourselves. In which case, better return to the
747 if ((StgTSO *)R1.p == CurrentTSO) {
748 JMP_(stg_stop_thread_entry); /* leave semi-gracefully */
751 JMP_(ENTRY_CODE(Sp[0]));
762 HP_CHK_GEN(sizeofW(StgMVar), NO_PTRS, newMVarZh_fast,);
763 TICK_ALLOC_PRIM(sizeofW(StgMutVar)-1, // consider head,tail,link as admin wds
765 CCS_ALLOC(CCCS,sizeofW(StgMVar)); /* ccs prof */
767 mvar = (StgMVar *) (Hp - sizeofW(StgMVar) + 1);
768 SET_INFO(mvar,&EMPTY_MVAR_info);
769 mvar->head = mvar->tail = (StgTSO *)&END_TSO_QUEUE_closure;
770 mvar->value = (StgClosure *)&END_TSO_QUEUE_closure;
772 TICK_RET_UNBOXED_TUP(1);
783 /* args: R1 = MVar closure */
785 mvar = (StgMVar *)R1.p;
787 /* If the MVar is empty, put ourselves on its blocking queue,
788 * and wait until we're woken up.
790 if (GET_INFO(mvar) != &FULL_MVAR_info) {
791 if (mvar->head == (StgTSO *)&END_TSO_QUEUE_closure) {
792 mvar->head = CurrentTSO;
794 mvar->tail->link = CurrentTSO;
796 CurrentTSO->link = (StgTSO *)&END_TSO_QUEUE_closure;
797 mvar->tail = CurrentTSO;
799 BLOCK(R1_PTR, takeMVarZh_fast);
802 SET_INFO(mvar,&EMPTY_MVAR_info);
804 mvar->value = (StgClosure *)&END_TSO_QUEUE_closure;
806 TICK_RET_UNBOXED_TUP(1);
817 /* args: R1 = MVar, R2 = value */
819 mvar = (StgMVar *)R1.p;
820 if (GET_INFO(mvar) == &FULL_MVAR_info) {
822 fprintf(stderr, "putMVar#: MVar already full.\n");
823 stg_exit(EXIT_FAILURE);
826 SET_INFO(mvar,&FULL_MVAR_info);
829 /* wake up the first thread on the queue,
830 * it will continue with the takeMVar operation and mark the MVar
834 if (tso != (StgTSO *)&END_TSO_QUEUE_closure) {
835 PUSH_ON_RUN_QUEUE(tso);
836 mvar->head = tso->link;
837 tso->link = (StgTSO *)&END_TSO_QUEUE_closure;
838 if (mvar->head == (StgTSO *)&END_TSO_QUEUE_closure) {
839 mvar->tail = (StgTSO *)&END_TSO_QUEUE_closure;
843 /* ToDo: yield here for better communication performance? */
844 JMP_(ENTRY_CODE(Sp[0]));
848 /* -----------------------------------------------------------------------------
849 Stable pointer primitives
850 ------------------------------------------------------------------------- */
852 FN_(makeStableNameZh_fast)
855 StgStableName *sn_obj;
858 HP_CHK_GEN(sizeofW(StgStableName), R1_PTR, makeStableNameZh_fast,);
859 TICK_ALLOC_PRIM(sizeofW(StgHeader),
860 sizeofW(StgStableName)-sizeofW(StgHeader), 0);
861 CCS_ALLOC(CCCS,sizeofW(StgStableName)); /* ccs prof */
863 index = RET_STGCALL1(StgWord,lookupStableName,R1.p);
865 sn_obj = (StgStableName *) (Hp - sizeofW(StgStableName) + 1);
866 sn_obj->header.info = &STABLE_NAME_info;
869 TICK_RET_UNBOXED_TUP(1);
873 #endif /* COMPILER */