| 188 | | #define UR_BOS ur_thread->bos |
| 189 | | #define UR_S_PUSH(v) *--UR_TOS = v |
| 190 | | #define UR_S_GROW --UR_TOS |
| 191 | | #define UR_S_GROWN(n) UR_TOS -= n |
| 192 | | #define UR_S_DROP ++UR_TOS |
| 193 | | #define UR_S_DROPN(n) UR_TOS += n |
| | 188 | #define UR_BOS ur_thread->dstack |
| | 189 | #define UR_S_PUSH(v) *++UR_TOS = v |
| | 190 | #define UR_S_GROW ++UR_TOS |
| | 191 | #define UR_S_GROWN(n) UR_TOS += n |
| | 192 | #define UR_S_DROP --UR_TOS |
| | 193 | #define UR_S_DROPN(n) UR_TOS -= n |
| 195 | | #define UR_S_DUP --UR_TOS; *UR_TOS = UR_TOS[1] |
| 196 | | #define UR_S_NIP UR_TOS[1] = *UR_TOS; UR_S_DROP |
| 197 | | #define ur_s_atBottom(sp) (sp == ur_thread->bos) |
| 198 | | #define ur_s_notBottom(sp) (sp != ur_thread->bos) |
| 199 | | #define ur_s_prev(v) (v + 1) |
| 200 | | #define ur_s_next(v) (v - 1) |
| 201 | | #define ur_s_backN(v,n) (v + (n)) |
| 202 | | #define ur_s_aheadN(v,n) (v - (n)) |
| | 195 | #define UR_S_DUP UR_TOS[1] = *UR_TOS; ++UR_TOS |
| | 196 | #define UR_S_NIP --UR_TOS; *UR_TOS = UR_TOS[1] |
| | 197 | #define ur_s_atBottom(sp) (sp == ur_thread->dstack) |
| | 198 | #define ur_s_notBottom(sp) (sp != ur_thread->dstack) |
| | 199 | #define ur_s_prev(v) (v - 1) |
| | 200 | #define ur_s_next(v) (v + 1) |
| | 201 | #define ur_s_backN(v,n) (v - (n)) |
| | 202 | #define ur_s_aheadN(v,n) (v + (n)) |