/*
 *      Interactive disassembler (IDA).
 *      Version 3.06
 *      Copyright (c) 1990-96 by Ilfak Guilfanov.
 *      ALL RIGHTS RESERVED.
 *                              FIDO:   2:5020/209
 *                              E-mail: ig@estar.msk.su
 *
 */

#ifndef __SISTACK_HPP
#define __SISTACK_HPP
#pragma pack(push, 1)           // IDA uses 1 byte alignments!

const int ST_SIZE = (MAXSPECSIZE/sizeof(uval_t));

class sistack_t;
idaman void ida_export sistack_t_flush(sistack_t *ss);

class sistack_t
{
  friend void ida_export sistack_t_flush(sistack_t *ss);
  uval_t code;                  // number of node
  size_t chunk;                 // number of current chunk
  size_t ptr;                   // pointer into chunk
  uval_t cache[ ST_SIZE ];      // Top of stack

public:
  ~sistack_t(void)          { if ( code != BADADDR ) flush(); }
  int  attach(const char *name);
  void create(const char *name);
  void kill(void);

  void flush(void)      { sistack_t_flush(this); }

  size_t size(void) const { return chunk*ST_SIZE+ptr; }
  void doempty(void)    { chunk = ptr = 0; }

  void push(uval_t x);
  uval_t pop(void);
  uval_t get(size_t depth); // return the value of the item at a given depth.
                            // return BADADDR if the item doesn't exist (depth > size()).
  uval_t top(void);
  uval_t dup(void)      { uval_t x = top(); push(x); return x; }

protected:
  uval_t netcode(void) const { return code; } // graph info uses loc_gtag in this netnode
};

#pragma pack(pop)
#endif // __SISTACK_HPP
