1 ;;;; unknown-values VOPs for the x86 VM
3 ;;;; This software is part of the SBCL system. See the README file for
6 ;;;; This software is derived from the CMU CL system, which was
7 ;;;; written at Carnegie Mellon University and released into the
8 ;;;; public domain. The software is in the public domain and is
9 ;;;; provided with absolutely no warranty. See the COPYING and CREDITS
10 ;;;; files for more information.
14 (define-vop (reset-stack-pointer)
15 (:args (ptr :scs (any-reg)))
19 (define-vop (%%nip-values)
20 (:args (last-nipped-ptr :scs (any-reg) :target rdi)
21 (last-preserved-ptr :scs (any-reg) :target rsi)
22 (moved-ptrs :scs (any-reg) :more t))
23 (:results (r-moved-ptrs :scs (any-reg) :more t)
26 (:temporary (:sc any-reg :offset rsi-offset) rsi)
27 (:temporary (:sc any-reg :offset rdi-offset) rdi)
28 (:ignore r-moved-ptrs)
30 (move rdi last-nipped-ptr)
31 (move rsi last-preserved-ptr)
32 (inst sub rsi n-word-bytes)
33 (inst sub rdi n-word-bytes)
43 (inst lea rsp-tn (make-ea :qword :base rdi :disp n-word-bytes))
45 (loop for moved = moved-ptrs then (tn-ref-across moved)
47 do (inst add (tn-ref-tn moved) rdi))))
49 ;;; Push some values onto the stack, returning the start and number of values
50 ;;; pushed as results. It is assumed that the Vals are wired to the standard
51 ;;; argument locations. Nvals is the number of values to push.
53 ;;; The generator cost is pseudo-random. We could get it right by defining a
54 ;;; bogus SC that reflects the costs of the memory-to-memory moves for each
55 ;;; operand, but this seems unworthwhile.
56 (define-vop (push-values)
57 (:args (vals :more t))
58 (:temporary (:sc unsigned-reg :to (:result 0) :target start) temp)
59 (:results (start) (count))
62 (move temp rsp-tn) ; WARN pointing 1 below
63 (do ((val vals (tn-ref-across val)))
65 (inst push (tn-ref-tn val)))
67 (inst mov count (fixnumize nvals))))
69 ;;; Push a list of values on the stack, returning Start and Count as used in
70 ;;; unknown values continuations.
71 (define-vop (values-list)
72 (:args (arg :scs (descriptor-reg) :target list))
75 (:results (start :scs (any-reg))
76 (count :scs (any-reg)))
77 (:temporary (:sc descriptor-reg :from (:argument 0) :to (:result 1)) list)
78 (:temporary (:sc dword-reg :offset eax-offset :to (:result 1)) eax)
80 (:save-p :compute-only)
83 (move start rsp-tn) ; WARN pointing 1 below
86 (inst cmp list nil-value)
88 (pushw list cons-car-slot list-pointer-lowtag)
89 (loadw list list cons-cdr-slot list-pointer-lowtag)
90 (inst mov eax (make-dword-tn list))
91 (inst and al-tn lowtag-mask)
92 (inst cmp al-tn list-pointer-lowtag)
94 (error-call vop 'bogus-arg-to-values-list-error list)
97 (inst mov count start) ; start is high address
98 (inst sub count rsp-tn) ; stackp is low address
99 #!-#.(cl:if (cl:= sb!vm:word-shift sb!vm:n-fixnum-tag-bits) '(and) '(or))
100 (inst shr count (- word-shift n-fixnum-tag-bits))))
102 ;;; Copy the more arg block to the top of the stack so we can use them
103 ;;; as function arguments.
105 ;;; Accepts a context as produced by more-arg-context; points to the first
106 ;;; value on the stack, not 4 bytes above as in other contexts.
108 ;;; Return a context that is 4 bytes above the first value, suitable for
109 ;;; defining a new stack frame.
110 (define-vop (%more-arg-values)
111 (:args (context :scs (descriptor-reg any-reg) :target src)
112 (skip :scs (any-reg immediate))
113 (num :scs (any-reg) :target count))
114 (:arg-types * positive-fixnum positive-fixnum)
115 (:temporary (:sc any-reg :offset rsi-offset :from (:argument 0)) src)
116 (:temporary (:sc descriptor-reg :offset rax-offset) temp)
117 (:temporary (:sc unsigned-reg :offset rcx-offset) loop-index)
118 (:results (start :scs (any-reg))
119 (count :scs (any-reg)))
123 (cond ((zerop (tn-value skip))
127 (inst lea src (make-ea :dword :base context
128 :disp (- (* (tn-value skip)
131 (inst sub count (* (tn-value skip) n-word-bytes)))))
135 #!+#.(cl:if (cl:= sb!vm:word-shift sb!vm:n-fixnum-tag-bits) '(and) '(or))
137 #!-#.(cl:if (cl:= sb!vm:word-shift sb!vm:n-fixnum-tag-bits) '(and) '(or))
139 ;; FIXME: This can't be efficient, but LEA (my first choice)
140 ;; doesn't do subtraction.
141 (inst shl skip (- word-shift n-fixnum-tag-bits))
143 (inst shr skip (- word-shift n-fixnum-tag-bits)))
145 (inst sub count skip)))
147 (inst lea loop-index (make-ea :byte :index count
148 :scale (ash 1 (- word-shift n-fixnum-tag-bits))))
149 (inst mov start rsp-tn)
150 (inst jrcxz DONE) ; check for 0 count?
152 (inst sub rsp-tn loop-index)
153 (inst sub src loop-index)
156 (inst mov temp (make-ea :qword :base src :index loop-index))
157 (inst sub loop-index n-word-bytes)
158 (inst mov (make-ea :qword :base rsp-tn :index loop-index) temp)