mem.h 2.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475
  1. /*
  2. Memory access facilities
  3. */
  4. /* $Id$ */
  5. /******** Memory address & location defines ********/
  6. #define data_loc(a) (*(data + (p2i(a))))
  7. #define stack_loc(a) (*(stackML - (a)))
  8. #define mem_loc(a) (in_stack(a) ? stack_loc(a) : data_loc(a))
  9. #define loc_addr(o) (((o) < 0) ? (LB + (o)) : (AB + (o)))
  10. /******** Checks on adresses and ranges ********/
  11. #define is_aligned(a,n) ((p2i(a)) % (n) == 0)
  12. #define is_wordaligned(a) \
  13. (((p2i(a)) & wsizem1) == 0)
  14. #define ch_aligned(a,n) { if (!is_aligned(a, min(n, wsize))) \
  15. { trap(EBADPTR); } }
  16. #define ch_wordaligned(a) \
  17. { if (!is_wordaligned(a)) \
  18. { trap(EBADPTR); } }
  19. #define in_gda(p) ((p) < HB)
  20. #define in_stack(p) (SP <= (p) && (p) <= ML)
  21. #define is_in_data(a,n) ((a) + (n) <= HP)
  22. #define ch_in_data(a,n) { if (!is_in_data(a, n)) { trap(EMEMFLT); } }
  23. #define is_in_stack(a,n) (SP <= (a) && (a) + (n) - 1 <= ML)
  24. #define ch_in_stack(a,n) { if (!is_in_stack(a, n)) { trap(EMEMFLT); } }
  25. #define w_is_in_stack(a) (SP <= (a) && (a) + wsizem1 <= ML)
  26. #define ch_w_in_stack(a) { if (!w_is_in_stack(a)) { trap(EMEMFLT); } }
  27. #define is_in_FRA(a,n) ((a) + (n) <= FRASize)
  28. /******* Address-depending memory defines *******/
  29. #define is_in_mem(a,n) (is_in_data(a, n) || is_in_stack(a, n))
  30. #define mem_stn(a,l,n) { if (in_stack(a)) st_stn(a, l, n); else dt_stn(a, l, n); }
  31. #define mem_lddp(a) (in_stack(a) ? st_lddp(a) : dt_lddp(a))
  32. #define mem_ldip(a) (in_stack(a) ? st_ldip(a) : dt_ldip(a))
  33. #define mem_ldu(a,n) (in_stack(a) ? st_ldu(a, n) : dt_ldu(a, n))
  34. #define mem_lduw(a) (in_stack(a) ? st_lduw(a) : dt_lduw(a))
  35. #define mem_lds(a,n) (in_stack(a) ? st_lds(a, n) : dt_lds(a, n))
  36. #define mem_ldsw(a) (in_stack(a) ? st_ldsw(a) : dt_ldsw(a))
  37. #define push_m(a,n) { if (in_stack(a)) push_st(a, n); else push_dt(a, n); }
  38. #define pushw_m(a) { if (in_stack(a)) pushw_st(a); else pushw_dt(a); }
  39. #define pop_m(a,n) { if (in_stack(a)) pop_st(a, n); else pop_dt(a, n); }
  40. #define popw_m(a) { if (in_stack(a)) popw_st(a); else popw_dt(a); }
  41. /******** Simple stack manipulation ********/
  42. #define st_inc(n) newSP(SP - (n)) /* stack grows */
  43. #define st_dec(n) newSP(SP + (n)) /* stack shrinks */
  44. /******** Function return types ********/
  45. extern ptr st_ldip(), dt_ldip();
  46. extern ptr st_lddp(), dt_lddp(), dppop();
  47. extern long st_lds(), st_ldsw(), dt_lds(), dt_ldsw(), spop(), swpop(), wpop();
  48. extern unsigned long st_ldu(), st_lduw(), dt_ldu(), dt_lduw(), upop(), uwpop();