// Functions that interpret the shape of a type to perform various low-level // actions, such as copying, freeing, comparing, and so on. #ifndef RUST_SHAPE_H #define RUST_SHAPE_H // Tell ISAAC to let go of max() and min() defines. #undef max #undef min #include #include "rust_internal.h" // ISAAC pollutes our namespace. #undef align #define ARENA_SIZE 256 //#define DPRINT(fmt,...) fprintf(stderr, fmt, ##__VA_ARGS__) //#define DPRINTCX(cx) shape::print::print_cx(cx) #define DPRINT(fmt,...) #define DPRINTCX(cx) namespace shape { typedef unsigned long tag_variant_t; typedef unsigned long tag_align_t; typedef unsigned long ref_cnt_t; // Constants const uint8_t SHAPE_U8 = 0u; const uint8_t SHAPE_U16 = 1u; const uint8_t SHAPE_U32 = 2u; const uint8_t SHAPE_U64 = 3u; const uint8_t SHAPE_I8 = 4u; const uint8_t SHAPE_I16 = 5u; const uint8_t SHAPE_I32 = 6u; const uint8_t SHAPE_I64 = 7u; const uint8_t SHAPE_F32 = 8u; const uint8_t SHAPE_F64 = 9u; const uint8_t SHAPE_VEC = 11u; const uint8_t SHAPE_TAG = 12u; const uint8_t SHAPE_BOX = 13u; const uint8_t SHAPE_STRUCT = 17u; const uint8_t SHAPE_FN = 18u; const uint8_t SHAPE_OBJ = 19u; const uint8_t SHAPE_RES = 20u; const uint8_t SHAPE_VAR = 21u; const uint8_t SHAPE_UNIQ = 22u; #ifdef _LP64 const uint8_t SHAPE_PTR = SHAPE_U64; #else const uint8_t SHAPE_PTR = SHAPE_U32; #endif // Forward declarations struct rust_obj; struct size_align; class ptr; class type_param; // Arenas; these functions must execute very quickly, so we use an arena // instead of malloc or new. class arena { uint8_t *ptr; uint8_t data[ARENA_SIZE]; public: arena() : ptr(data) {} template inline T *alloc(size_t count = 1) { // FIXME: align size_t sz = count * sizeof(T); T *rv = (T *)ptr; ptr += sz; if (ptr > &data[ARENA_SIZE]) { fprintf(stderr, "Arena space exhausted, sorry\n"); abort(); } return rv; } }; // Alignment inquiries // // We can't directly use __alignof__ everywhere because that returns the // preferred alignment of the type, which is different from the ABI-mandated // alignment of the type in some cases (e.g. doubles on x86). The latter is // what actually gets used for struct elements. template inline size_t alignof() { #ifdef _MSC_VER return __alignof(T); #else return __alignof__(T); #endif } template<> inline size_t alignof() { return 4; } // Utility classes struct size_align { size_t size; size_t alignment; size_align(size_t in_size = 0, size_t in_align = 1) : size(in_size), alignment(in_align) {} bool is_set() const { return alignment != 0; } inline void set(size_t in_size, size_t in_align) { size = in_size; alignment = in_align; } inline void add(const size_align &other) { add(other.size, other.alignment); } inline void add(size_t extra_size, size_t extra_align) { size += extra_size; alignment = std::max(alignment, extra_align); } static inline size_align make(size_t in_size) { size_align sa; sa.size = sa.alignment = in_size; return sa; } static inline size_align make(size_t in_size, size_t in_align) { size_align sa; sa.size = in_size; sa.alignment = in_align; return sa; } }; struct tag_info { uint16_t tag_id; // The tag ID. const uint8_t *info_ptr; // Pointer to the info table. uint16_t variant_count; // Number of variants in the tag. const uint8_t *largest_variants_ptr; // Ptr to largest variants table. size_align tag_sa; // Size and align of this tag. uint16_t n_params; // Number of type parameters. const type_param *params; // Array of type parameters. }; // Utility functions inline uint16_t get_u16(const uint8_t *addr) { return *reinterpret_cast(addr); } inline uint16_t get_u16_bump(const uint8_t *&addr) { uint16_t result = get_u16(addr); addr += sizeof(uint16_t); return result; } template inline void fmt_number(std::ostream &out, T n) { out << n; } // Override the character interpretation for these two. template<> inline void fmt_number(std::ostream &out, uint8_t n) { out << (int)n; } template<> inline void fmt_number(std::ostream &out, int8_t n) { out << (int)n; } // Contexts // The base context, an abstract class. We use the curiously recurring // template pattern here to avoid virtual dispatch. template class ctxt { public: const uint8_t *sp; // shape pointer const type_param *params; // shapes of type parameters const rust_shape_tables *tables; rust_task *task; bool align; ctxt(rust_task *in_task, bool in_align, const uint8_t *in_sp, const type_param *in_params, const rust_shape_tables *in_tables) : sp(in_sp), params(in_params), tables(in_tables), task(in_task), align(in_align) {} template ctxt(const ctxt &other, const uint8_t *in_sp = NULL, const type_param *in_params = NULL, const rust_shape_tables *in_tables = NULL) : sp(in_sp ? in_sp : other.sp), params(in_params ? in_params : other.params), tables(in_tables ? in_tables : other.tables), task(other.task), align(other.align) {} void walk(); void walk_reset(); std::pair get_variant_sp(tag_info &info, tag_variant_t variant_id); protected: inline uint8_t peek() { return *sp; } inline size_align get_size_align(const uint8_t *&addr); private: void walk_vec(); void walk_tag(); void walk_box(); void walk_uniq(); void walk_struct(); void walk_res(); void walk_var(); }; // Core Rust types struct rust_fn { void (*code)(uint8_t *rv, rust_task *task, void *env, ...); void *env; }; struct rust_closure { type_desc *tydesc; uint32_t target_0; uint32_t target_1; uint32_t bindings[0]; uint8_t *get_bindings() const { return (uint8_t *)bindings; } }; struct rust_obj_box { type_desc *tydesc; uint8_t *get_bindings() const { return (uint8_t *)this; } }; struct rust_vtable { CDECL void (*dtor)(void *rv, rust_task *task, rust_obj obj); }; struct rust_obj { rust_vtable *vtable; void *box; }; // Type parameters class type_param { private: static type_param *make(const type_desc **tydescs, unsigned n_tydescs, arena &arena); public: const uint8_t *shape; const rust_shape_tables *tables; const type_param *params; // subparameters // Constructs type parameters from a function shape. static type_param *from_fn_shape(const uint8_t *sp, ptr dp, arena &arena); // Creates type parameters from an object shape description. static type_param *from_obj_shape(const uint8_t *sp, ptr dp, arena &arena); template inline void set(ctxt *cx) { shape = cx->sp; tables = cx->tables; params = cx->params; } // Creates type parameters from a type descriptor. static inline type_param *from_tydesc(const type_desc *tydesc, arena &arena) { // In order to find the type parameters of objects and functions, we // have to actually have the data pointer, since we don't statically // know from the type of an object or function which type parameters // it closes over. assert(!tydesc->n_obj_params && "Type-parametric objects and " "functions must go through from_tydesc_and_data() instead!"); return make(tydesc->first_param, tydesc->n_params, arena); } static type_param *from_tydesc_and_data(const type_desc *tydesc, uint8_t *dp, arena &arena) { if (tydesc->n_obj_params) { uintptr_t n_obj_params = tydesc->n_obj_params; const type_desc **first_param; if (n_obj_params & 0x80000000) { // Function closure. DPRINT("n_obj_params FN %lu, tydesc %p, starting at %p\n", (unsigned long)n_obj_params, tydesc, dp + sizeof(uintptr_t) + tydesc->size); n_obj_params &= 0x7fffffff; first_param = (const type_desc **)(dp + sizeof(uintptr_t)); } else { // Object closure. DPRINT("n_obj_params OBJ %lu, tydesc %p, starting at %p\n", (unsigned long)n_obj_params, tydesc, dp + sizeof(uintptr_t) * 2); first_param = (const type_desc **)(dp + sizeof(uintptr_t) * 2); } return make(first_param, n_obj_params, arena); } return make(tydesc->first_param, tydesc->n_params, arena); } }; // Traversals #define WALK_NUMBER(c_type) \ static_cast(this)->template walk_number() #define WALK_SIMPLE(method) static_cast(this)->method() template void ctxt::walk() { switch (*sp++) { case SHAPE_U8: WALK_NUMBER(uint8_t); break; case SHAPE_U16: WALK_NUMBER(uint16_t); break; case SHAPE_U32: WALK_NUMBER(uint32_t); break; case SHAPE_U64: WALK_NUMBER(uint64_t); break; case SHAPE_I8: WALK_NUMBER(int8_t); break; case SHAPE_I16: WALK_NUMBER(int16_t); break; case SHAPE_I32: WALK_NUMBER(int32_t); break; case SHAPE_I64: WALK_NUMBER(int64_t); break; case SHAPE_F32: WALK_NUMBER(float); break; case SHAPE_F64: WALK_NUMBER(double); break; case SHAPE_VEC: walk_vec(); break; case SHAPE_TAG: walk_tag(); break; case SHAPE_BOX: walk_box(); break; case SHAPE_STRUCT: walk_struct(); break; case SHAPE_FN: WALK_SIMPLE(walk_fn); break; case SHAPE_OBJ: WALK_SIMPLE(walk_obj); break; case SHAPE_RES: walk_res(); break; case SHAPE_VAR: walk_var(); break; case SHAPE_UNIQ: walk_uniq(); break; default: abort(); } } template void ctxt::walk_reset() { const uint8_t *old_sp = sp; walk(); sp = old_sp; } template size_align ctxt::get_size_align(const uint8_t *&addr) { size_align result; result.size = get_u16_bump(addr); result.alignment = *addr++; return result; } // Returns a pointer to the beginning and a pointer to the end of the shape of // the tag variant with the given ID. template std::pair ctxt::get_variant_sp(tag_info &tinfo, tag_variant_t variant_id) { uint16_t variant_offset = get_u16(tinfo.info_ptr + variant_id * sizeof(uint16_t)); const uint8_t *variant_ptr = tables->tags + variant_offset; uint16_t variant_len = get_u16_bump(variant_ptr); const uint8_t *variant_end = variant_ptr + variant_len; return std::make_pair(variant_ptr, variant_end); } template void ctxt::walk_vec() { bool is_pod = *sp++; uint16_t sp_size = get_u16_bump(sp); const uint8_t *end_sp = sp + sp_size; static_cast(this)->walk_vec(is_pod, sp_size); sp = end_sp; } template void ctxt::walk_tag() { tag_info tinfo; tinfo.tag_id = get_u16_bump(sp); // Determine the info pointer. uint16_t info_offset = get_u16(tables->tags + tinfo.tag_id * sizeof(uint16_t)); tinfo.info_ptr = tables->tags + info_offset; tinfo.variant_count = get_u16_bump(tinfo.info_ptr); // Determine the largest-variants pointer. uint16_t largest_variants_offset = get_u16_bump(tinfo.info_ptr); tinfo.largest_variants_ptr = tables->tags + largest_variants_offset; // Determine the size and alignment. tinfo.tag_sa = get_size_align(tinfo.info_ptr); // Determine the number of parameters. tinfo.n_params = get_u16_bump(sp); // Read in the tag type parameters. type_param params[tinfo.n_params]; for (uint16_t i = 0; i < tinfo.n_params; i++) { uint16_t len = get_u16_bump(sp); params[i].set(this); sp += len; } tinfo.params = params; // Call to the implementation. static_cast(this)->walk_tag(tinfo); } template void ctxt::walk_box() { uint16_t sp_size = get_u16_bump(sp); const uint8_t *end_sp = sp + sp_size; static_cast(this)->walk_box(); sp = end_sp; } template void ctxt::walk_uniq() { uint16_t sp_size = get_u16_bump(sp); const uint8_t *end_sp = sp + sp_size; static_cast(this)->walk_uniq(); sp = end_sp; } template void ctxt::walk_struct() { uint16_t sp_size = get_u16_bump(sp); const uint8_t *end_sp = sp + sp_size; static_cast(this)->walk_struct(end_sp); sp = end_sp; } template void ctxt::walk_res() { uint16_t dtor_offset = get_u16_bump(sp); const rust_fn **resources = reinterpret_cast(tables->resources); const rust_fn *dtor = resources[dtor_offset]; uint16_t n_ty_params = get_u16_bump(sp); // Read in the tag type parameters. type_param params[n_ty_params]; for (uint16_t i = 0; i < n_ty_params; i++) { uint16_t ty_param_len = get_u16_bump(sp); const uint8_t *next_sp = sp + ty_param_len; params[i].set(this); sp = next_sp; } uint16_t sp_size = get_u16_bump(sp); const uint8_t *end_sp = sp + sp_size; static_cast(this)->walk_res(dtor, n_ty_params, params, end_sp); sp = end_sp; } template void ctxt::walk_var() { uint8_t param = *sp++; static_cast(this)->walk_var(param); } // A shape printer, useful for debugging class print : public ctxt { public: template print(const ctxt &other, const uint8_t *in_sp = NULL, const type_param *in_params = NULL, const rust_shape_tables *in_tables = NULL) : ctxt(other, in_sp, in_params, in_tables) {} print(rust_task *in_task, bool in_align, const uint8_t *in_sp, const type_param *in_params, const rust_shape_tables *in_tables) : ctxt(in_task, in_align, in_sp, in_params, in_tables) {} void walk_tag(tag_info &tinfo); void walk_struct(const uint8_t *end_sp); void walk_res(const rust_fn *dtor, unsigned n_params, const type_param *params, const uint8_t *end_sp); void walk_var(uint8_t param); void walk_vec(bool is_pod, uint16_t sp_size) { DPRINT("vec<"); walk(); DPRINT(">"); } void walk_box() { DPRINT("box<"); walk(); DPRINT(">"); } void walk_fn() { DPRINT("fn"); } void walk_obj() { DPRINT("obj"); } void walk_closure(); template void walk_number() {} template static void print_cx(const T *cx) { print self(*cx); self.align = false; self.walk(); } }; // // Size-of (which also computes alignment). Be warned: this is an expensive // operation. // // TODO: Maybe dynamic_size_of() should call into this somehow? // class size_of : public ctxt { private: size_align sa; public: size_of(const size_of &other, const uint8_t *in_sp = NULL, const type_param *in_params = NULL, const rust_shape_tables *in_tables = NULL) : ctxt(other, in_sp, in_params, in_tables) {} template size_of(const ctxt &other, const uint8_t *in_sp = NULL, const type_param *in_params = NULL, const rust_shape_tables *in_tables = NULL) : ctxt(other, in_sp, in_params, in_tables) {} void walk_tag(tag_info &tinfo); void walk_struct(const uint8_t *end_sp); void walk_box() { sa.set(sizeof(void *), sizeof(void *)); } void walk_fn() { sa.set(sizeof(void *)*2, sizeof(void *)); } void walk_obj() { sa.set(sizeof(void *)*2, sizeof(void *)); } void walk_closure(); void walk_vec(bool is_pod, uint16_t sp_size) { sa.set(sizeof(void *), sizeof(void *)); } void walk_var(uint8_t param_index) { const type_param *param = ¶ms[param_index]; size_of sub(*this, param->shape, param->params, param->tables); sub.walk(); sa = sub.sa; } void walk_res(const rust_fn *dtor, unsigned n_params, const type_param *params, const uint8_t *end_sp) { abort(); // TODO } template void walk_number() { sa.set(sizeof(T), alignof()); } void compute_tag_size(tag_info &tinfo); template static void compute_tag_size(const ctxt &other_cx, tag_info &tinfo) { size_of cx(other_cx); cx.compute_tag_size(tinfo); } template static size_align get(const ctxt &other_cx, unsigned back_up = 0) { size_of cx(other_cx, other_cx.sp - back_up); cx.align = false; cx.walk(); assert(cx.sa.alignment > 0); return cx.sa; } }; // Pointer wrappers for data traversals class ptr { private: uint8_t *p; public: template struct data { typedef T t; }; ptr() : p(NULL) {} ptr(uint8_t *in_p) : p(in_p) {} ptr(uintptr_t in_p) : p((uint8_t *)in_p) {} inline ptr operator+(const size_t amount) const { return make(p + amount); } inline ptr &operator+=(const size_t amount) { p += amount; return *this; } inline bool operator<(const ptr other) { return p < other.p; } inline ptr operator++() { ptr rv(*this); p++; return rv; } inline uint8_t operator*() { return *p; } template inline operator T *() { return (T *)p; } inline operator bool() const { return p != NULL; } inline operator uintptr_t() const { return (uintptr_t)p; } static inline ptr make(uint8_t *in_p) { ptr self(in_p); return self; } }; template static inline T bump_dp(ptr &dp) { T x = *((T *)dp); dp += sizeof(T); return x; } template static inline T get_dp(ptr dp) { return *((T *)dp); } // Pointer pairs for structural comparison template class data_pair { public: T fst, snd; data_pair() {} data_pair(T &in_fst, T &in_snd) : fst(in_fst), snd(in_snd) {} inline void operator=(const T rhs) { fst = snd = rhs; } static data_pair make(T &fst, T &snd) { data_pair data(fst, snd); return data; } }; class ptr_pair { public: uint8_t *fst, *snd; template struct data { typedef data_pair t; }; ptr_pair() : fst(NULL), snd(NULL) {} ptr_pair(uint8_t *in_fst, uint8_t *in_snd) : fst(in_fst), snd(in_snd) {} ptr_pair(data_pair &other) : fst(other.fst), snd(other.snd) {} inline void operator=(uint8_t *rhs) { fst = snd = rhs; } inline operator bool() const { return fst != NULL && snd != NULL; } inline ptr_pair operator+(size_t n) const { return make(fst + n, snd + n); } inline ptr_pair operator+=(size_t n) { fst += n; snd += n; return *this; } inline ptr_pair operator-(size_t n) const { return make(fst - n, snd - n); } inline bool operator<(const ptr_pair &other) const { return fst < other.fst && snd < other.snd; } static inline ptr_pair make(uint8_t *fst, uint8_t *snd) { ptr_pair self(fst, snd); return self; } static inline ptr_pair make(const data_pair &pair) { ptr_pair self(pair.fst, pair.snd); return self; } }; // NB: This function does not align. template inline data_pair bump_dp(ptr_pair &ptr) { data_pair data(*reinterpret_cast(ptr.fst), *reinterpret_cast(ptr.snd)); ptr += sizeof(T); return data; } template inline data_pair get_dp(ptr_pair &ptr) { data_pair data(*reinterpret_cast(ptr.fst), *reinterpret_cast(ptr.snd)); return data; } } // end namespace shape inline shape::ptr_pair align_to(const shape::ptr_pair &pair, size_t n) { return shape::ptr_pair::make(align_to(pair.fst, n), align_to(pair.snd, n)); } namespace shape { // An abstract class (again using the curiously recurring template pattern) // for methods that actually manipulate the data involved. #define ALIGN_TO(alignment) \ if (this->align) { \ dp = align_to(dp, (alignment)); \ if (this->end_dp && !(dp < this->end_dp)) \ return; \ } #define DATA_SIMPLE(ty, call) \ ALIGN_TO(alignof()); \ U end_dp = dp + sizeof(ty); \ static_cast(this)->call; \ dp = end_dp; template class data : public ctxt< data > { public: U dp; protected: U end_dp; void walk_box_contents(); void walk_uniq_contents(); void walk_fn_contents(ptr &dp); void walk_obj_contents(ptr &dp); void walk_variant(tag_info &tinfo, tag_variant_t variant); static std::pair get_vec_data_range(ptr dp); static std::pair get_vec_data_range(ptr_pair &dp); public: data(rust_task *in_task, bool in_align, const uint8_t *in_sp, const type_param *in_params, const rust_shape_tables *in_tables, U const &in_dp) : ctxt< data >(in_task, in_align, in_sp, in_params, in_tables), dp(in_dp), end_dp() {} void walk_tag(tag_info &tinfo); void walk_struct(const uint8_t *end_sp) { static_cast(this)->walk_struct(end_sp); } void walk_vec(bool is_pod, uint16_t sp_size) { DATA_SIMPLE(void *, walk_vec(is_pod, sp_size)); } void walk_box() { DATA_SIMPLE(void *, walk_box()); } void walk_uniq() { DATA_SIMPLE(void *, walk_uniq()); } void walk_fn() { ALIGN_TO(alignof()); U next_dp = dp + sizeof(void *) * 2; static_cast(this)->walk_fn(); dp = next_dp; } void walk_obj() { ALIGN_TO(alignof()); U next_dp = dp + sizeof(void *) * 2; static_cast(this)->walk_obj(); dp = next_dp; } void walk_res(const rust_fn *dtor, unsigned n_params, const type_param *params, const uint8_t *end_sp) { typename U::template data::t live = bump_dp(dp); // Delegate to the implementation. static_cast(this)->walk_res(dtor, n_params, params, end_sp, live); } void walk_var(uint8_t param_index) { const type_param *param = &this->params[param_index]; T sub(*static_cast(this), param->shape, param->params, param->tables); static_cast(this)->walk_subcontext(sub); dp = sub.dp; } template void walk_number() { DATA_SIMPLE(W, walk_number()); } }; template void data::walk_box_contents() { typename U::template data::t box_ptr = bump_dp(dp); U ref_count_dp(box_ptr); T sub(*static_cast(this), ref_count_dp + sizeof(ref_cnt_t)); static_cast(this)->walk_box_contents(sub, ref_count_dp); } template void data::walk_uniq_contents() { typename U::template data::t box_ptr = bump_dp(dp); U data_ptr(box_ptr); T sub(*static_cast(this), data_ptr); static_cast(this)->walk_uniq_contents(sub); } template void data::walk_variant(tag_info &tinfo, tag_variant_t variant_id) { std::pair variant_ptr_and_end = this->get_variant_sp(tinfo, variant_id); static_cast(this)->walk_variant(tinfo, variant_id, variant_ptr_and_end); } template std::pair data::get_vec_data_range(ptr dp) { rust_vec* ptr = bump_dp(dp); uint8_t* data = &ptr->data[0]; return std::make_pair(data, data + ptr->fill); } template std::pair data::get_vec_data_range(ptr_pair &dp) { std::pair fst = get_vec_data_range(dp.fst); std::pair snd = get_vec_data_range(dp.snd); ptr_pair start(fst.first, snd.first); ptr_pair end(fst.second, snd.second); return std::make_pair(start, end); } template void data::walk_tag(tag_info &tinfo) { size_of::compute_tag_size(*this, tinfo); if (tinfo.variant_count > 1) ALIGN_TO(alignof()); U end_dp = dp + tinfo.tag_sa.size; typename U::template data::t tag_variant; if (tinfo.variant_count > 1) tag_variant = bump_dp(dp); else tag_variant = 0; static_cast(this)->walk_tag(tinfo, tag_variant); dp = end_dp; } template void data::walk_fn_contents(ptr &dp) { dp += sizeof(void *); // Skip over the code pointer. uint8_t *box_ptr = bump_dp(dp); if (!box_ptr) return; type_desc *subtydesc = *reinterpret_cast(box_ptr + sizeof(void *)); ptr closure_dp(box_ptr + sizeof(void *)); arena arena; type_param *params = type_param::from_fn_shape(subtydesc->shape, closure_dp, arena); closure_dp += sizeof(void *); T sub(*static_cast(this), subtydesc->shape, params, subtydesc->shape_tables, closure_dp); sub.align = true; sub.walk(); } template void data::walk_obj_contents(ptr &dp) { dp += sizeof(void *); // Skip over the vtable. uint8_t *box_ptr = bump_dp(dp); type_desc *subtydesc = *reinterpret_cast(box_ptr + sizeof(void *)); ptr obj_closure_dp(box_ptr + sizeof(void *)); if (!box_ptr) // Null check. return; arena arena; type_param *params = type_param::from_obj_shape(subtydesc->shape, obj_closure_dp, arena); T sub(*static_cast(this), subtydesc->shape, params, subtydesc->shape_tables, obj_closure_dp); sub.align = true; sub.walk(); } // Polymorphic logging, for convenience class log : public data { friend class data; private: std::ostream &out; const char *prefix; bool in_string; log(log &other, const uint8_t *in_sp, const type_param *in_params, const rust_shape_tables *in_tables = NULL) : data(other.task, other.align, in_sp, in_params, in_tables ? in_tables : other.tables, other.dp), out(other.out), prefix("") {} log(log &other, const uint8_t *in_sp, const type_param *in_params, const rust_shape_tables *in_tables, ptr in_dp) : data(other.task, other.align, in_sp, in_params, in_tables, in_dp), out(other.out), prefix("") {} log(log &other, ptr in_dp) : data(other.task, other.align, other.sp, other.params, other.tables, in_dp), out(other.out), prefix("") {} void walk_vec(bool is_pod, uint16_t sp_size) { if (!get_dp(dp)) out << prefix << "(null)"; else walk_vec(is_pod, get_vec_data_range(dp)); } void walk_tag(tag_info &tinfo, tag_variant_t tag_variant) { out << prefix << "tag" << tag_variant; data::walk_variant(tinfo, tag_variant); } void walk_box() { out << prefix << "@"; prefix = ""; data::walk_box_contents(); } void walk_uniq() { out << prefix << "~"; prefix = ""; data::walk_uniq_contents(); } void walk_fn() { out << prefix << "fn"; prefix = ""; data::walk_fn_contents(dp); } void walk_obj() { out << prefix << "obj"; prefix = ""; data::walk_obj_contents(dp); } void walk_subcontext(log &sub) { sub.walk(); } void walk_box_contents(log &sub, ptr &ref_count_dp) { out << prefix; if (!ref_count_dp) { out << "(null)"; } else { sub.align = true; sub.walk(); } } void walk_uniq_contents(log &sub) { out << prefix; sub.align = true; sub.walk(); } void walk_struct(const uint8_t *end_sp); void walk_vec(bool is_pod, const std::pair &data); void walk_variant(tag_info &tinfo, tag_variant_t variant_id, const std::pair variant_ptr_and_end); void walk_string(const std::pair &data); void walk_res(const rust_fn *dtor, unsigned n_params, const type_param *params, const uint8_t *end_sp, bool live); template inline void walk_number() { out << prefix; fmt_number(out, get_dp(dp)); } public: log(rust_task *in_task, bool in_align, const uint8_t *in_sp, const type_param *in_params, const rust_shape_tables *in_tables, uint8_t *in_data, std::ostream &in_out) : data(in_task, in_align, in_sp, in_params, in_tables, in_data), out(in_out), prefix("") {} }; } // end namespace shape #endif