/* asmpars.c */
/*****************************************************************************/
/* SPDX-License-Identifier: GPL-2.0-only OR GPL-3.0-only                     */
/*                                                                           */
/* AS-Portierung                                                             */
/*                                                                           */
/* Verwaltung von Symbolen und das ganze Drumherum...                        */
/*                                                                           */
/*****************************************************************************/

#include "stdinc.h"
#include <string.h>
#include <ctype.h>
#include <assert.h>

#include "be_le.h"
#include "bpemu.h"
#include "nls.h"
#include "nlmessages.h"
#include "as.rsc"
#include "strutil.h"
#include "strcomp.h"

#include "asmdef.h"
#include "asmsub.h"
#include "errmsg.h"
#include "asmfnums.h"
#include "asmrelocs.h"
#include "asmstructs.h"
#include "chunks.h"
#include "trees.h"
#include "fwd_sym.h"
#include "fwd_refs.h"
#include "operator.h"
#include "function.h"
#include "intformat.h"
#include "as_float.h"
#include "chartrans.h"
#include "assume.h"
#include "dynstr_nls.h"
#include "cmdarg.h"

#include "asmpars.h"

#define LEAVE  goto func_exit
#define LEAVE2 goto func_exit2

/* Allow this for the moment: */

#define NULLSTRING_EVAL_RESULT True

#define TREAT_LARGEINT_FLOAT 1

/* Mask, Min & Max are computed at initialization */

tIntTypeDef IntTypeDefs[IntTypeCnt] =
{
  { 0x0000, 0, 0, 0 }, /* UInt0 */
  { 0x0001, 0, 0, 0 }, /* UInt1 */
  { 0x0002, 0, 0, 0 }, /* UInt2 */
  { 0x0003, 0, 0, 0 }, /* UInt3 */
  { 0x8004, 0, 0, 0 }, /* SInt4 */
  { 0x0004, 0, 0, 0 }, /* UInt4 */
  { 0xc004, 0, 0, 0 }, /* Int4 */
  { 0x8005, 0, 0, 0 }, /* SInt5 */
  { 0x0005, 0, 0, 0 }, /* UInt5 */
  { 0xc005, 0, 0, 0 }, /* Int5 */
  { 0x8006, 0, 0, 0 }, /* SInt6 */
  { 0x0006, 0, 0, 0 }, /* UInt6 */
  { 0xc006, 0, 0, 0 }, /* Int6 */
  { 0x8007, 0, 0, 0 }, /* SInt7 */
  { 0x0007, 0, 0, 0 }, /* UInt7 */
  { 0x8008, 0, 0, 0 }, /* SInt8 */
  { 0x0008, 0, 0, 0 }, /* UInt8 */
  { 0xc008, 0, 0, 0 }, /* Int8 */
  { 0x8009, 0, 0, 0 }, /* SInt9 */
  { 0x0009, 0, 0, 0 }, /* UInt9 */
  { 0x000a, 0, 0, 0 }, /* UInt10 */
  { 0xc00a, 0, 0, 0 }, /* Int10 */
  { 0x000b, 0, 0, 0 }, /* UInt11 */
  { 0x000c, 0, 0, 0 }, /* UInt12 */
  { 0xc00c, 0, 0, 0 }, /* Int12 */
  { 0x000d, 0, 0, 0 }, /* UInt13 */
  { 0x000e, 0, 0, 0 }, /* UInt14 */
  { 0xc00e, 0, 0, 0 }, /* Int14 */
  { 0x800f, 0, 0, 0 }, /* SInt15 */
  { 0x000f, 0, 0, 0 }, /* UInt15 */
  { 0xc00f, 0, 0, 0 }, /* Int15 */
  { 0x8010, 0, 0, 0 }, /* SInt16 */
  { 0x0010, 0, 0, 0 }, /* UInt16 */
  { 0xc010, 0, 0, 0 }, /* Int16 */
  { 0x0011, 0, 0, 0 }, /* UInt17 */
  { 0x0012, 0, 0, 0 }, /* UInt18 */
  { 0xc012, 0, 0, 0 }, /* Int18 */
  { 0x0013, 0, 0, 0 }, /* UInt19 */
  { 0x8014, 0, 0, 0 }, /* SInt20 */
  { 0x0014, 0, 0, 0 }, /* UInt20 */
  { 0xc014, 0, 0, 0 }, /* Int20 */
  { 0x8015, 0, 0, 0 }, /* SInt21 */
  { 0x0015, 0, 0, 0 }, /* UInt21 */
  { 0xc015, 0, 0, 0 }, /* Int21 */
  { 0x0016, 0, 0, 0 }, /* UInt22 */
  { 0x0017, 0, 0, 0 }, /* UInt23 */
  { 0x8018, 0, 0, 0 }, /* SInt24 */
  { 0x0018, 0, 0, 0 }, /* UInt24 */
  { 0xc018, 0, 0, 0 }, /* Int24 */
  { 0x801e, 0, 0, 0 }, /* SInt30 */
  { 0x001e, 0, 0, 0 }, /* UInt30 */
  { 0xc01e, 0, 0, 0 }, /* Int30 */
  { 0x8020, 0, 0, 0 }, /* SInt32 */
  { 0x0020, 0, 0, 0 }, /* UInt32 */
  { 0xc020, 0, 0, 0 }, /* Int32 */
#ifdef HAS64
  { 0x8040, 0, 0, 0 }, /* SInt64 */
  { 0x0040, 0, 0, 0 }, /* UInt64 */
  { 0xc040, 0, 0, 0 }, /* Int64 */
#else
  { 0x0000, 0, 0, 0 },
  { 0x0000, 0, 0, 0 },
  { 0x0000, 0, 0, 0 },
#endif
#ifdef HAS128
  { 0x8080, 0, 0, 0 }, /* SInt128 */
  { 0x0080, 0, 0, 0 }, /* UInt128 */
  { 0xc080, 0, 0, 0 }, /* Int128 */
#else
  { 0x0000, 0, 0, 0 },
  { 0x0000, 0, 0, 0 },
  { 0x0000, 0, 0, 0 },
#endif
};

typedef enum
{
  e_lookup_error_none,
  e_lookup_error_expand,
  e_lookup_error_getsymsection,
  e_lookup_error_namecheck,
  e_lookup_error_notfound
} lookup_symbol_error_t;

typedef struct
{
  Boolean Back;
  LongInt Counter;
} TTmpSymLog;

LongInt MomLocHandle;          /* Merker, den lokale Symbole erhalten        */
LongInt TmpSymCounter,         /* counters for local symbols                 */
        FwdSymCounter,
        BackSymCounter;
char TmpSymCounterVal[10];     /* representation as string                   */
TTmpSymLog TmpSymLog[LOCSYMSIGHT];
LongInt TmpSymLogDepth;

static LongInt next_loc_handle;

typedef struct sSymbolEntry
{
  TTree Tree;
  Byte flags;
  TempResult SymWert;
  LargeInt unchanged_value;
  PCrossRef RefList;
  Byte FileNum;
  LongInt LineNum;
} TSymbolEntry, *PSymbolEntry;

#define set_symbol_entry_flag(dest, flag, value) \
do { \
 (dest)->flags = (value) ? ((dest)->flags | e_symbol_entry_flag_##flag) : ((dest)->flags & ~e_symbol_entry_flag_##flag); \
} while (0)

#define get_symbol_entry_flag(src, flag) \
 (!!((src)->flags & e_symbol_entry_flag_##flag))

typedef struct sSymbolStackEntry
{
  struct sSymbolStackEntry *Next;
  TempResult Contents;
} TSymbolStackEntry, *PSymbolStackEntry;

typedef struct sSymbolStack
{
  struct sSymbolStack *Next;
  char *Name;
  PSymbolStackEntry Contents;
} TSymbolStack, *PSymbolStack;

typedef struct sDefSymbol
{
  struct sDefSymbol *Next;
  char *SymName;
  TempResult Wert;
} TDefSymbol, *PDefSymbol;

typedef struct sCToken
{
  struct sCToken *Next;
  char *Name;
  LongInt Parent;
  ChunkList Usage;
} TCToken, *PCToken;

typedef struct sLocHeap
{
  struct sLocHeap *Next;
  LongInt Cont;
} TLocHeap, *PLocHandle;

typedef struct sRegDefList
{
  struct sRegDefList *Next;
  LongInt Section;
  char *Value;
  Boolean Used;
} TRegDefList, *PRegDefList;

typedef struct sRegDef
{
  struct sRegDef *Left, *Right;
  char *Orig;
  PRegDefList Defs, DoneDefs;
} TRegDef, *PRegDef;

static PSymbolEntry FirstSymbol, FirstLocSymbol;
static PDefSymbol FirstDefSymbol;
/*static*/ PCToken FirstSection;
static Boolean DoRefs,              /* Querverweise protokollieren */
               RegistersDefined;
static PLocHandle FirstLocHandle;
static PSymbolStack FirstStack;
static PCToken MomSection;
static char *LastGlobSymbol;
static PFunction FirstFunction;	        /* Liste definierter Funktionen */
static const char inf_name[] = "INF";
static Boolean inf_reserved;
static int def_radix_base;

/*!------------------------------------------------------------------------
 * \fn     initpass_asmpars(void)
 * \brief  module-specific pass initialization
 * ------------------------------------------------------------------------ */

void initpass_asmpars(void)
{
  RadixBase = def_radix_base;
  OutRadixBase = 16;
  next_loc_handle = LOC_HANDLE_OFFSET;
}

/*!------------------------------------------------------------------------
 * \fn     AsmParsInit(void)
 * \brief  initialize/register module
 * ------------------------------------------------------------------------ */

void AsmParsInit(void)
{
  FirstSymbol = NULL;

  FirstLocSymbol = NULL; MomLocHandle = -1; SetMomSection(-1);
  FirstSection = NULL;
  FirstLocHandle = NULL;
  FirstStack = NULL;
  FirstFunction = NULL;
  DoRefs = True;
  RegistersDefined = False;

  initpass_asmpars();
  AddInitPassProc(initpass_asmpars);
}

/*!------------------------------------------------------------------------
 * \fn     range_not_checkable(IntType type)
 * \brief  can integer type's range not be checked on host system?
 * \param  type integer type
 * \return true if range can NOT be checked
 * ------------------------------------------------------------------------ */

static Boolean range_not_checkable(IntType type)
{
#ifdef HAS128
  return (((int)type) >= ((int)SInt128));
#else
#ifdef HAS64
  return (((int)type) >= ((int)SInt64));
#else
  return (((int)type) >= ((int)SInt32));
#endif
#endif
}

/*!------------------------------------------------------------------------
 * \fn     RangeCheck(LargeInt Wert, IntType Typ)
 * \brief  check whether value is within integer type's ranges
 * \param  Wert value to check
 * \param  Typ integer type giving range
 * \return true if within range
 * ------------------------------------------------------------------------ */

Boolean RangeCheck(LargeInt Wert, IntType Typ)
{
  return range_not_checkable(Typ) || ((Wert >= IntTypeDefs[(int)Typ].Min) && (Wert <= IntTypeDefs[(int)Typ].Max));
}

/*!------------------------------------------------------------------------
 * \fn     ChkRangeByType(LargeInt value, IntType type, const struct sStrComp *p_comp)
 * \brief  check whether value is within integer type's ranges, and throw error if not
 * \param  value value to check
 * \param  type integer type giving range
 * \param  p_comp corresponding source argument
 * \return true if within range
 * ------------------------------------------------------------------------ */

Boolean ChkRangeByType(LargeInt value, IntType type, const struct sStrComp *p_comp)
{
  return range_not_checkable(type) || ChkRangePos(value, IntTypeDefs[(int)type].Min, IntTypeDefs[(int)type].Max, p_comp);
}

/*!------------------------------------------------------------------------
 * \fn     ChkRangeWarnByType(LargeInt value, IntType type, const struct sStrComp *p_comp)
 * \brief  check whether value is within integer type's ranges, and throw warning if not
 * \param  value value to check
 * \param  type integer type giving range
 * \param  p_comp corresponding source argument
 * \return true if within range
 * ------------------------------------------------------------------------ */

Boolean ChkRangeWarnByType(LargeInt value, IntType type, const struct sStrComp *p_comp)
{
  return range_not_checkable(type) || ChkRangeWarnPos(value, IntTypeDefs[(int)type].Min, IntTypeDefs[(int)type].Max, p_comp);
}

Boolean SingleBit(LargeInt Inp, LargeInt *Erg)
{
  *Erg = 0;
  do
  {
    if (!Odd(Inp))
      (*Erg)++;
    if (!Odd(Inp))
      Inp = Inp >> 1;
  }
  while ((*Erg != LARGEBITS) && (!Odd(Inp)));
  return (*Erg != LARGEBITS) && (Inp == 1);
}	

IntType GetSmallestUIntType(LargeWord MaxValue)
{
  IntType Result;

  Result = (IntType) 0;
  for (Result = (IntType) 0; Result < IntTypeCnt; Result++)
  {
    if (IntTypeDefs[Result].Min < 0)
      continue;
    if (IntTypeDefs[Result].Max >= (LargeInt)MaxValue)
      return Result;
  }
  return UInt32;
}

IntType GetUIntTypeByBits(unsigned Bits)
{
  IntType Result;
  for (Result = (IntType) 0; Result < IntTypeCnt; Result++)
  {
    if (IntTypeDefs[Result].SignAndWidth & 0x8000)
      continue;
    if (Lo(IntTypeDefs[Result].SignAndWidth) == Bits)
      return Result;
  }
  return UInt0;
}

static Boolean ProcessBk(char **Start, char *Erg)
{
  LongInt System = 0, Acc = 0, Digit = 0;
  char ch;
  int cnt;
  Boolean Finish;

  switch (as_toupper(**Start))
  {
    case '\'': case '\\': case '"':
      *Erg = **Start;
      (*Start)++;
      return True;
    case 'H':
      *Erg = '\'';
      (*Start)++;
      return True;
    case 'I':
      *Erg = '"';
      (*Start)++;
    return True;
    case 'B':
      *Erg = Char_BS;
      (*Start)++;
      return True;
    case 'A':
      *Erg = Char_BEL;
      (*Start)++;
      return True;
    case 'E':
      *Erg = Char_ESC;
      (*Start)++;
       return True;
    case 'T':
      *Erg = Char_HT;
      (*Start)++;
       return True;
    case 'N':
      *Erg = Char_LF;
      (*Start)++;
      return True;
    case 'R':
      *Erg = Char_CR;
      (*Start)++;
      return True;
    case 'X':
      System = 16;
      (*Start)++;
      /* fall-through */
    case '0': case '1': case '2': case '3': case '4':
    case '5': case '6': case '7': case '8': case '9':
      if (System == 0)
        System = (**Start == '0') ? 8 : 10;
      cnt = (System == 16) ? 1 : ((System == 10) ? 0 : -1);
      do
      {
        ch = as_toupper(**Start);
        Finish = False;
        if ((ch >= '0') && (ch <= '9'))
          Digit = ch - '0';
        else if ((System == 16) && (ch >= 'A') && (ch <= 'F'))
          Digit = (ch - 'A') + 10;
        else
          Finish = True;
        if (!Finish)
        {
          (*Start)++;
          cnt++;
          if (Digit >= System)
          {
            WrError(ErrNum_OverRange);
            return False;
          }
          Acc = (Acc * System) + Digit;
        }
      }
      while ((!Finish) && (cnt < 3));
      if (!ChkRange(Acc, 0, 255))
        return False;
      *Erg = Acc;
      return True;
    default:
      WrError(ErrNum_InvEscSequence);
      return False;
  }
}

/*!------------------------------------------------------------------------
 * \fn     NonZString2Int(const struct as_nonz_dynstr *p_str, LargeInt *p_result)
 * \brief  convert string to its "ASCII representation"
 * \param  p_str string containing characters
 * \param  p_result dest buffer
 * \return 0 or error message
 * ------------------------------------------------------------------------ */

tErrorNum NonZString2Int(const struct as_nonz_dynstr *p_str, LargeInt *p_result)
{
  if ((p_str->len > 0) && (p_str->len <= 4))
  {
    unsigned digit, shift;
    const char *p_run = p_str->p_str;
    size_t run_len = p_str->len;
    int ret;

    *p_result = shift = 0;
    while (!(ret = as_chartrans_xlate_next(CurrTransTable->p_table, &digit, &p_run, &run_len)))
      if (multi_char_le)
      {
        *p_result |= ((LargeWord)digit) << shift;
        shift += 8;
      }
      else
        *p_result = (*p_result << 8) | (digit & 0xff);
    /* ENOMEM -> regular end of string */
    return (ret == ENOMEM) ? ErrNum_None : ErrNum_UnmappedChar;
  }
  return ErrNum_MultiCharInvLength;
}

Boolean Int2NonZString(struct as_nonz_dynstr *p_str, LargeInt src)
{
  char *p_dest;
  int ret;

  if (p_str->capacity < 32)
    as_nonz_dynstr_realloc(p_str, 32);
  p_str->len = 0;
  p_dest = &p_str->p_str[multi_char_le ? 0 : p_str->capacity];
  while (src && (p_str->len < p_str->capacity))
  {
    ret = as_chartrans_xlate_rev(CurrTransTable->p_table, src & 0xff);
    if (ret >= 0)
    {
      *(multi_char_le ? p_dest++ : --p_dest) = ret;
      p_str->len++;
    }
    src = (src >> 8) & 0xfffffful;
  }
  if (!multi_char_le)
    memmove(p_str->p_str, p_dest, p_str->len);
  return True;
}

/*!------------------------------------------------------------------------
 * \fn     TempResultToInt(TempResult *pResult)
 * \brief  convert TempResult to integer
 * \param  pResult temp result to convert
 * \return 0 or error code
 * ------------------------------------------------------------------------ */

int TempResultToInt(TempResult *pResult)
{
  int ret = 0;

  switch (pResult->Typ)
  {
    case TempInt:
      break;
    case TempString:
    {
      LargeInt Result;
      tErrorNum error_num = NonZString2Int(&pResult->Contents.str, &Result);

      if (error_num == ErrNum_None)
        as_tempres_set_int(pResult, Result);
      else
      {
        WrError(error_num);
        as_tempres_set_none(pResult);
        ret = -1;
      }
      break;
    }
    default:
      as_tempres_set_none(pResult);
      ret = -1;
  }
  return ret;
}

/*!------------------------------------------------------------------------
 * \fn     MultiCharToInt(TempResult *pResult, unsigned MaxLen)
 * \brief  optionally convert multi-character constant to integer
 * \param  pResult holding value
 * \param  MaxLen maximum length of multi-character constant
 * \return True if converted
 * ------------------------------------------------------------------------ */

Boolean MultiCharToInt(TempResult *pResult, unsigned MaxLen)
{
  if ((pResult->Typ == TempString)
   && (pResult->Contents.str.len <= MaxLen)
   && (pResult->Flags & eSymbolFlag_StringSingleQuoted))
  {
    TempResultToInt(pResult);
    return True;
  }
  return False;
}

/*!------------------------------------------------------------------------
 * \fn     ExpandStrSymbol(tStrComp *p_dest, const tStrComp *p_src, Boolean convert_upper)
 * \brief  expand symbol name from string component
 * \param  p_dest dest buffer (initialize to 0 capacity)
 * \param  p_src source component
 * \param  convert_upper convert to upper while copying?
 * \return resulting component or NULL if error
 * ------------------------------------------------------------------------ */

tStrComp *ExpandStrSymbol(tStrComp *p_dest, const tStrComp *p_src, Boolean convert_upper)
{
  tStrComp src_comp;
  Boolean first = True;

  StrCompRefRight(&src_comp, p_src, 0);
  while (True)
  {
    const char *p_start = QuotPos(src_comp.str.p_str, '{');
    if (first)
    {
      p_dest->Pos = p_src->Pos;
      p_dest->str.p_str[0] = '\0';
    }
    if (p_start)
    {
      unsigned ls = p_start - src_comp.str.p_str;
      String expr;
      tStrComp expr_comp;
      tEvalResult eval_result;
      const char *p_stop;
      as_nonz_dynstr_t result;

      if (convert_upper)
        as_dynstr_append_upr(&p_dest->str, src_comp.str.p_str, ls);
      else
        as_dynstr_append(&p_dest->str, src_comp.str.p_str, ls);

      p_stop = QuotPos(p_start + 1, '}');
      if (!p_stop)
      {
        WrStrErrorPos(ErrNum_InvSymName, p_src);
        return NULL;
      }
      StrCompMkTemp(&expr_comp, expr, sizeof(expr));
      StrCompCopySub(&expr_comp, &src_comp, p_start + 1 - src_comp.str.p_str, p_stop - p_start - 1);
      as_nonz_dynstr_ini(&result, 0);
      EvalStrStringExpressionWithResult(&expr_comp, &eval_result, &result);
      if (eval_result.OK && mFirstPassUnknown(eval_result.Flags))
      {
        WrStrErrorPos(ErrNum_FirstPassCalc, &expr_comp);
        eval_result.OK = False;
      }
      if (eval_result.OK)
      {
        if (CaseSensitive)
          as_dynstr_append(&p_dest->str, result.p_str, result.len);
        else
          as_dynstr_append_upr(&p_dest->str, result.p_str, result.len);
      }
      as_nonz_dynstr_free(&result);
      if (!eval_result.OK)
        return NULL;
      StrCompIncRefLeft(&src_comp, p_stop + 1 - src_comp.str.p_str);
      first = False;
    }
    else
    {
      if (convert_upper)
        as_dynstr_append_c_str_upr(&p_dest->str, src_comp.str.p_str);
      else
        as_dynstr_append_c_str(&p_dest->str, src_comp.str.p_str);
      return p_dest;
    }
  }
}

/*- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -*/
/* check whether this is a local symbol and expand local counter if yes.  They
   have to be handled in different places of the parser, therefore two separate
   functions */

void InitTmpSymbols(void)
{
  TmpSymCounter = FwdSymCounter = BackSymCounter = 0;
  *TmpSymCounterVal = '\0';
  TmpSymLogDepth = 0;
  *LastGlobSymbol = '\0';
}

static void AddTmpSymLog(Boolean Back, LongInt Counter)
{
  /* shift out oldest value */

  if (TmpSymLogDepth)
  {
    LongInt ShiftCnt = min(TmpSymLogDepth, LOCSYMSIGHT - 1);

    memmove(TmpSymLog + 1, TmpSymLog, sizeof(TTmpSymLog) * (ShiftCnt));
  }

  /* insert new one */

  TmpSymLog[0].Back = Back;
  TmpSymLog[0].Counter = Counter;
  if (TmpSymLogDepth < LOCSYMSIGHT)
    TmpSymLogDepth++;
}

static Boolean ChkTmp1(char *Name, as_symbol_source_t symbol_source)
{
  char *Src, *Dest;
  Boolean Result = FALSE;

  /* $$-Symbols: append current $$-counter */

  if (!strncmp(Name, "$$", 2))
  {
    /* manually copy since this will implicitly give us the point to append
       the number */

    for (Src = Name + 2, Dest = Name; *Src; *(Dest++) = *(Src++));

    /* append number. only generate the number once */

    if (*TmpSymCounterVal == '\0')
      as_snprintf(TmpSymCounterVal, sizeof(TmpSymCounterVal), "%d", TmpSymCounter);
    strcpy(Dest, TmpSymCounterVal);
    Result = TRUE;
  }

  /* no special local symbol: increment $$-counter */

  else if (symbol_source != e_symbol_source_none)
  {
    TmpSymCounter++;
    *TmpSymCounterVal = '\0';
  }

  return Result;
}

static Boolean ChkTmp2(char *pDest, const char *pSrc, as_symbol_source_t symbol_source)
{
  const char *pRun, *pBegin, *pEnd;
  int Cnt;
  Boolean Result = FALSE;

  for (pBegin = pSrc; as_isspace(*pBegin); pBegin++);
  for (pEnd = pSrc + strlen(pSrc); (pEnd > pBegin) && as_isspace(*(pEnd - 1)); pEnd--);

  /* Note: We have to deal with three symbol definitions:

      "-" for backward-only referencing
      "+" for forward-only referencing
      "/" for either way of referencing

      "/" and "+" are both expanded to forward symbol names, so the
      forward refencing to both types is unproblematic, however
      only "/" and "-" are stored in the backlog of the three
      most-recent symbols for backward referencing.
  */

  /* backward references ? */

  if (*pBegin == '-')
  {
    for (pRun = pBegin; *pRun; pRun++)
      if (*pRun != '-')
        break;
    Cnt = pRun - pBegin;
    if (pRun == pEnd)
    {
      if ((symbol_source != e_symbol_source_none) && (Cnt == 1))
      {
        as_snprintf(pDest, STRINGSIZE, "__BACK%d", (int)BackSymCounter);
        AddTmpSymLog(TRUE, BackSymCounter);
        BackSymCounter++;
        Result = TRUE;
      }

      /* TmpSymLogDepth cannot become larger than LOCSYMSIGHT, so we only
         have to check against the log's actual depth. */

      else if (Cnt <= TmpSymLogDepth)
      {
        Cnt--;
        as_snprintf(pDest, STRINGSIZE, "__%s%d",
                    TmpSymLog[Cnt].Back ? "BACK" : "FORW",
                    (int)TmpSymLog[Cnt].Counter);
        Result = TRUE;
      }
    }
  }

  /* forward references ? */

  else if (*pBegin == '+')
  {
    for (pRun = pBegin; *pRun; pRun++)
      if (*pRun != '+')
        break;
    Cnt = pRun - pBegin;
    if (pRun == pEnd)
    {
      if ((symbol_source != e_symbol_source_none) && (Cnt == 1))
      {
        as_snprintf(pDest, STRINGSIZE, "__FORW%d", (int)FwdSymCounter++);
        Result = TRUE;
      }
      else if (Cnt <= LOCSYMSIGHT)
      {
        as_snprintf(pDest, STRINGSIZE, "__FORW%d", (int)(FwdSymCounter + (Cnt - 1)));
        Result = TRUE;
      }
    }
  }

  /* slash: only allowed for definition, but add to log for backward ref. */

  else if ((pEnd - pBegin == 1) && (*pBegin == '/') && (symbol_source != e_symbol_source_none))
  {
    AddTmpSymLog(FALSE, FwdSymCounter);
    as_snprintf(pDest, STRINGSIZE, "__FORW%d", (int)FwdSymCounter);
    FwdSymCounter++;
    Result = TRUE;
  }

  return Result;
}

static Boolean ChkTmp3(char *Name, as_symbol_source_t symbol_source)
{
  if ('.' == *Name)
  {
    strmaxprep2(Name, LastGlobSymbol, STRINGSIZE);
    return True;
  }

#if 0
  if (symbol_source == e_symbol_source_label)
#else
  if (symbol_source != e_symbol_source_none)
#endif
    strmaxcpy(LastGlobSymbol, Name, STRINGSIZE);
  return False;
}

static Boolean ChkTmp(char *Name, as_symbol_source_t symbol_source)
{
  Boolean IsTmp1, IsTmp2, IsTmp3;

  IsTmp1 = ChkTmp1(Name, symbol_source);
  IsTmp2 = ChkTmp2(Name, Name, symbol_source);
  IsTmp3 = ChkTmp3(Name, IsTmp2 ? e_symbol_source_none : symbol_source);
  return IsTmp1 || IsTmp2 || IsTmp3;
}

Boolean IdentifySection(const tStrComp *pName, LongInt *p_ret)
{
  PSaveSection SLauf;
  String exp_name_buf;
  tStrComp exp_name, *p_exp_name;
  sint Depth;
  size_t exp_len;

  StrCompMkTemp(&exp_name, exp_name_buf, sizeof(exp_name_buf));
  p_exp_name = ExpandStrSymbol(&exp_name, pName, !CaseSensitive);
  if (!p_exp_name)
    return False;

  exp_len = strlen(p_exp_name->str.p_str);
  if (!exp_len)
  {
    *p_ret = -1;
    return True;
  }
  else if (((exp_len == 6) || (exp_len == 7))
       && !as_strncasecmp(p_exp_name->str.p_str, "PARENT", 6)
       && ((exp_len == 6) || as_isdigit(p_exp_name->str.p_str[6])))
  {
    Depth = (exp_len == 6) ? 1 : p_exp_name->str.p_str[6] - AscOfs;
    SLauf = SectionStack;
    *p_ret = MomSectionHandle;
    while ((Depth > 0) && (*p_ret != -2))
    {
      if (!SLauf) *p_ret = -2;
      else
      {
        *p_ret = SLauf->Handle;
        SLauf = SLauf->Next;
      }
      Depth--;
    }
    if (*p_ret == -2)
    {
      WrStrErrorPos(ErrNum_InvSection, pName);
      return False;
    }
    else
      return True;
  }
  else if (!strcmp(p_exp_name->str.p_str, GetSectionName(MomSectionHandle)))
  {
    *p_ret = MomSectionHandle;
    return True;
  }
  else
  {
    SLauf = SectionStack;
    while ((SLauf) && (strcmp(GetSectionName(SLauf->Handle), p_exp_name->str.p_str)))
      SLauf = SLauf->Next;
    if (!SLauf)
    {
      WrStrErrorPos(ErrNum_InvSection, pName);
      return False;
    }
    else
    {
      *p_ret = SLauf->Handle;
      return True;
    }
  }
}

static Boolean GetSymSection(tStrComp *p_name, LongInt *p_ret, const tStrComp *pUnexpComp)
{
  tStrComp TmpComp;
  char *q;
  int l = strlen(p_name->str.p_str), pos;

  if (!l || (p_name->str.p_str[l - 1] != ']'))
  {
    *p_ret = -2;
    return True;
  }

  p_name->str.p_str[l - 1] = '\0';
  q = RQuotPos(p_name->str.p_str, '[');
  if (!q)
  {
    *p_ret = -2;
    return True;
  }
  p_name->str.p_str[l - 1] = ']';
  if (p_name->str.p_str + l - q <= 1)
  {
    WrStrErrorPos(ErrNum_InvSymName, pUnexpComp ? pUnexpComp : p_name);
    return False;
  }

  StrCompShorten(p_name, 1); l--;
  pos = q - p_name->str.p_str;
  StrCompRefRight(&TmpComp, p_name, pos + 1);
  StrCompShorten(p_name, l - pos);

  return IdentifySection(&TmpComp, p_ret);
}

/*****************************************************************************
 * Function:    ConstIntVal
 * Purpose:     evaluate integer constant
 * Result:      integer value
 *****************************************************************************/

static LargeInt ConstIntVal(const char *pExpr, IntType Typ, Boolean *pResult, int *p_outof_range)
{
  LargeInt Wert;
  Boolean NegFlag = False;
  LargeWord acc, acc_max, mul_max;
  int Digit;
  tIntCheckCtx Ctx;
  const tIntFormatList *pIntFormat;

  *p_outof_range = 0;

  /* empty string is interpreted as 0 */

  if (!*pExpr)
  {
    *pResult = NULLSTRING_EVAL_RESULT;
    return 0;
  }

  *pResult = False;

  /* sign: */

  acc_max = (LargeWord)-1;
  switch (*pExpr)
  {
    case '-':
      NegFlag = True;
      acc_max = (acc_max >> 1) + 1;
      /* else fall-through */
    case '+':
      pExpr++;
      break;
  }
  Ctx.pExpr = pExpr;
  Ctx.ExprLen = strlen(pExpr);
  Ctx.Base = -1;

  for (pIntFormat = IntFormatList; pIntFormat->Check; pIntFormat++)
    if (pIntFormat->Check(&Ctx, pIntFormat->Ch))
    {
      Ctx.Base = (pIntFormat->Base > 0) ? pIntFormat->Base : RadixBase;
      break;
    }
  if (Ctx.Base <= 0)
    return -1;
  mul_max = acc_max / Ctx.Base;

  /* we may have decremented Ctx.ExprLen, so do not run until string end */

  acc = 0;
  while (Ctx.ExprLen > 0)
  {
    if (256 == Ctx.Base)
    {
      Digit = as_chartrans_xlate(CurrTransTable->p_table, ((unsigned)*Ctx.pExpr) & 0xff);
      if (Digit < 0)
      {
        WrError(ErrNum_UnmappedChar);
        Digit = 0;
      }
    }
    else
      Digit = DigitVal(as_toupper(*Ctx.pExpr), Ctx.Base);
    if (Digit == -1)
      return -1;
    if (acc > mul_max)
    {
      *pResult = True;
      *p_outof_range = NegFlag ? -1 : 1;
      return NegFlag ? -acc_max : acc_max;
    }
    acc = acc * Ctx.Base;
    if (acc_max - acc < (unsigned)Digit)
    {
      *pResult = True;
      *p_outof_range = NegFlag ? -1 : 1;
      return NegFlag ? -acc_max : acc_max;
    }
    acc = acc + Digit;
    Ctx.pExpr++; Ctx.ExprLen--;
  }

  Wert = NegFlag ? -acc : acc;

  /* post-processing, range check */

  *pResult = RangeCheck(Wert, Typ);
  if (*pResult)
    return Wert;
  else if (HardRanges)
  {
    WrError(ErrNum_OverRange);
    return -1;
  }
  else
  {
    *pResult = True;
    WrError(ErrNum_WOverRange);
    return Wert & IntTypeDefs[(int)Typ].Mask;
  }
}

/*****************************************************************************
 * Function:    ConstFloatVal
 * Purpose:     evaluate floating point constant
 * Result:      value
 *****************************************************************************/

static as_float_t ConstFloatVal(const char *pExpr, Boolean *pResult, int *p_outof_range)
{
  as_float_t Erg;
  char *pEnd;

  if (*pExpr)
  {
    /* Some strtod() implementations interpret hex constants starting with '0x'.  We
       don't want this here.  Either 0x for hex constants is allowed, then it should
       have been parsed before by ConstIntVal(), or not, then we don't want the constant
       be stored as float either. */

    if ((strlen(pExpr) >= 2)
     && (pExpr[0] == '0')
     && (toupper(pExpr[1]) == 'X'))
    {
      Erg = 0;
      *p_outof_range = 0;
      *pResult = False;
    }

    else
    {
      Erg = as_strtof(pExpr, &pEnd);
      *pResult = (*pEnd == '\0');
      if ((Erg == AS_HUGE_VAL) && (errno == ERANGE) && *pResult)
        *p_outof_range = 1;
      else if ((Erg == -AS_HUGE_VAL) && (errno == ERANGE) && *pResult)
        *p_outof_range = -1;
      else
        *p_outof_range = 0;
    }
  }
  else
  {
    Erg = 0.0;
    *p_outof_range = False;
    *pResult = NULLSTRING_EVAL_RESULT;
  }
  return Erg;
}

/*****************************************************************************
 * Function:    ConstStringVal
 * Purpose:     evaluate string constant
 * Result:      value
 *****************************************************************************/

static void ConstStringVal(const tStrComp *pExpr, TempResult *pDest, Boolean *pResult)
{
  tStrComp Raw, Copy, Remainder;
  char *pPos, QuoteChar;
  int l, TLen;

  *pResult = False;

  l = strlen(pExpr->str.p_str);
  if (l < 2)
    return;
  switch (*pExpr->str.p_str)
  {
    case '"':
    case '\'':
      QuoteChar = *pExpr->str.p_str;
      if (pExpr->str.p_str[l - 1] == QuoteChar)
      {
        if ('\'' == QuoteChar)
          pDest->Flags |= eSymbolFlag_StringSingleQuoted;
        break;
      }
      /* conditional fall-through */
    default:
      return;
  }

  StrCompAlloc(&Raw, STRINGSIZE);
  StrCompCopySub(&Raw, pExpr, 1, l - 2);
  /* use LEAVE from now on instead of return */

  /* go through source */

  as_tempres_set_c_str(pDest, "");
  StrCompRefRight(&Copy, &Raw, 0);
  while (1)
  {
    pPos = strchr(Copy.str.p_str, '\\');
    if (pPos)
      StrCompSplitRef(&Copy, &Remainder, &Copy, pPos);

    /* " before \ -> not a simple string but something like "...." ... " */

    if (strchr(Copy.str.p_str, QuoteChar))
    {
      as_tempres_set_none(pDest);
      LEAVE;
    }

    /* copy part up to next '\' verbatim: */

    as_nonz_dynstr_append_raw(&pDest->Contents.str, Copy.str.p_str, strlen(Copy.str.p_str));

    /* are we done? If not, advance pointer to behind '\' */

    if (!pPos)
      break;
    Copy = Remainder;

    /* treat escaped section: stringification? */

    if (*Copy.str.p_str == '{')
    {
      TempResult t;
      char *pStr;
      String Str;
      Boolean OK = True;

      as_tempres_ini(&t);
      StrCompIncRefLeft(&Copy, 1);

      /* cut out part in {...} */

      pPos = QuotPos(Copy.str.p_str, '}');
      if (!pPos)
      {
        OK = False;
        LEAVE2;
      }
      StrCompSplitRef(&Copy, &Remainder, &Copy, pPos);
      KillPrefBlanksStrCompRef(&Copy);
      KillPostBlanksStrComp(&Copy);

      /* evaluate expression */

      EvalStrExpression(&Copy, &t);
      if (t.Relocs)
      {
        WrStrErrorPos(ErrNum_NoRelocs, &Copy);
        FreeRelocs(&t.Relocs);
        as_tempres_set_none(&t);
      }

      /* append result */

      switch (t.Typ)
      {
        case TempInt:
          TLen = SysString(Str, sizeof(Str), t.Contents.Int, OutRadixBase, 0, False, HexStartCharacter, SplitByteCharacter);
          pStr = Str;
          break;
        case TempFloat:
          FloatString(Str, sizeof(Str), t.Contents.Float);
          pStr = Str;
          TLen = strlen(pStr);
          break;
        case TempString:
          pStr = t.Contents.str.p_str;
          TLen = t.Contents.str.len;
          break;
        default:
          *pResult = True;
          pStr = NULL;
          TLen = 0;
          OK = False;
      }
      if (OK)
      {
        as_nonz_dynstr_append_raw(&pDest->Contents.str, pStr, TLen);
        pDest->Flags |= t.Flags & eSymbolFlags_Promotable;
      }

      /* advance source pointer to behind '}' */

      Copy = Remainder;

   func_exit2:
      as_tempres_free(&t);
      if (!OK)
      {
        as_tempres_set_none(pDest);
        LEAVE;
      }
    }

    /* simple character escape: */

    else
    {
      char Res, *pNext = Copy.str.p_str;

      if (!ProcessBk(&pNext, &Res))
      {
        as_tempres_set_none(pDest);
        LEAVE;
      }
      as_nonz_dynstr_append_raw(&pDest->Contents.str, &Res, 1);
      StrCompIncRefLeft(&Copy, pNext - Copy.str.p_str);
    }
  }

  *pResult = True;
func_exit:
  StrCompFree(&Raw);
}


typedef enum { e_expand_chk_none, e_expand_chk_upto, e_expand_chk_empty_upto } expand_chk_t;

static PSymbolEntry ExpandAndFindNodeRet(const struct sStrComp *pName, struct sStrComp *p_expanded_name, TempType SearchType, Boolean SearchLocal, expand_chk_t chk, lookup_symbol_error_t *p_lookup_error);
static PSymbolEntry ExpandAndFindNode(const struct sStrComp *pName, TempType SearchType, Boolean SearchLocal, expand_chk_t chk, lookup_symbol_error_t *p_lookup_error);

/*!------------------------------------------------------------------------
 * \fn     EvalResultClear(tEvalResult *pResult)
 * \brief  reset all elements of EvalResult to 'none'
 * ------------------------------------------------------------------------ */

void EvalResultClear(tEvalResult *pResult)
{
  pResult->OK = False;
  pResult->Flags = eSymbolFlag_None;
  pResult->AddrSpaceMask = 0;
  pResult->DataSize = eSymbolSizeUnknown;
}

/*!------------------------------------------------------------------------
 * \fn     as_eval_cb_data_ini(struct as_eval_cb_data *p_data, as_eval_cb_t cb)
 * \brief  initialize evaluation data callback
 * \param  p_data callback data
 * \param  cb callback function
 * ------------------------------------------------------------------------ */

void as_eval_cb_data_ini(struct as_eval_cb_data *p_data, as_eval_cb_t cb)
{
  p_data->callback = cb;
  p_data->p_stack = NULL;
  p_data->p_other_arg = NULL;
  p_data->p_operators = no_operators;
}

/*!------------------------------------------------------------------------
 * \fn     as_dump_eval_cb_data_stack(const as_eval_cb_data_stack_t *p_stack)
 * \brief  dump eval callback data operator stack
 * \param  p_stack stack to dump
 * ------------------------------------------------------------------------ */

void as_dump_eval_cb_data_stack(const as_eval_cb_data_stack_t *p_stack)
{
  while (True)
  {
    static const char type_names[][4] = { "op", "fnc" };
    printf(" <- ");
    if (!p_stack)
      break;
    printf("[%s '%s'(#%d)]",
           ((size_t)p_stack->type < as_array_size(type_names)) ? type_names[p_stack->type] : "???",
           p_stack->p_ident, p_stack->arg_index);
    p_stack = p_stack->p_next;
  }
  printf("\n");
}

/*!------------------------------------------------------------------------
 * \fn     as_eval_cb_data_stack_depth(const as_eval_cb_data_stack_t *p_stack)
 * \brief  retrieve depth of formula stack
 * \param  p_stack stack to analyze
 * \return depth
 * ------------------------------------------------------------------------ */

unsigned as_eval_cb_data_stack_depth(const as_eval_cb_data_stack_t *p_stack)
{
  unsigned ret = 0;
  for (; p_stack; p_stack = p_stack->p_next)
    ret++;
  return ret;
}

/*!------------------------------------------------------------------------
 * \fn     as_eval_cb_data_stack_plain_add(const as_eval_cb_data_stack_t *p_stack)
 * \brief  check whether argument at given position in formula stack is plain add @ outermost level
 * \param  p_stack stack to analyze
 * \return True if plain add
 * ------------------------------------------------------------------------ */

Boolean as_eval_cb_data_stack_plain_add(const as_eval_cb_data_stack_t *p_stack)
{
  Boolean negate = False;

  for (; p_stack; p_stack = p_stack->p_next)
    if (p_stack->type != e_operator)
      return False;
    else if (!as_strcasecmp(p_stack->p_ident, "+"));
    else if (!as_strcasecmp(p_stack->p_ident, "-"))
    {
      if (p_stack->arg_index)
        negate = !negate;
    }
    else
      return False;

  return !negate;
}

/*!------------------------------------------------------------------------
 * \fn     as_eval_cb_data_stackelem_mul(const as_eval_cb_data_stack_t *p_stack)
 * \brief  check whether operator at given position in formula stack is product
 * \param  p_stack stack element to analyze
 * \return True if plain add
 * ------------------------------------------------------------------------ */

extern Boolean as_eval_cb_data_stackelem_mul(const as_eval_cb_data_stack_t *p_stack)
{
  return (p_stack->type == e_operator)
       && !as_strcasecmp(p_stack->p_ident, "*");
}

/*****************************************************************************
 * Function:    EvalStrExpression
 * Purpose:     evaluate expression
 * Result:      implicitly in pErg
 *****************************************************************************/

#define LEAVE goto func_exit

static tErrorNum DeduceExpectTypeErrMsgMask(unsigned Mask, TempType ActType)
{
  switch (ActType)
  {
    case TempInt:
      switch (Mask)
      {
        case TempString:
          return ErrNum_StringButInt;
        /* int is convertible to float, so combinations are impossible: */
        case TempFloat:
        case TempFloat | TempString:
        default:
          return ErrNum_InternalError;
      }
    case TempFloat:
      switch (Mask)
      {
        case TempInt:
          return ErrNum_IntButFloat;
        case TempString:
          return ErrNum_StringButFloat;
        case TempInt | TempString:
          return ErrNum_StringOrIntButFloat;
        default:
          return ErrNum_InternalError;
      }
    case TempString:
      switch (Mask)
      {
        case TempInt:
          return ErrNum_IntButString;
        case TempFloat:
          return ErrNum_FloatButString;
        case TempInt | TempFloat:
          return ErrNum_IntOrFloatButString;
        default:
          return ErrNum_InternalError;
      }
    case TempReg:
      switch (Mask)
      {
        case TempInt:
          return ErrNum_ExpectInt;
        case TempString:
          return ErrNum_ExpectString;
        case TempInt | TempString:
          return ErrNum_ExpectIntOrString;
        case TempInt | TempFloat:
          return ErrNum_IntOrFloatButReg;
        case TempInt | TempFloat | TempString:
          return ErrNum_StringOrIntOrFloatButReg;
        default:
          return ErrNum_InternalError;
      }
    default:
      return ErrNum_InternalError;
  }
}

static Byte GetOpTypeMask(Byte TotMask, int OpIndex)
{
  return (TotMask >> (OpIndex * 4)) & 15;
}

static Byte TryConvert(Byte TypeMask, TempType ActType, int OpIndex)
{
  if (TypeMask & ActType)
    return 0 << (4 * OpIndex);
  if ((TypeMask & TempFloat) && (ActType == TempInt))
    return 1 << (4 * OpIndex);
  if ((TypeMask & TempInt) && (ActType == TempString))
    return 2 << (4 * OpIndex);
  if ((TypeMask & TempFloat) && (ActType == TempString))
    return (1|2) << (4 * OpIndex);
  return 255;
}

typedef struct operator_search_cb_data
{
  as_quoted_iterator_cb_data_t data;
  sint l_klamm, r_klamm, w_klamm;
  ptrdiff_t op_pos;
  const as_operator_t *p_best_op;
  const char *p_after_last_op_start;
  const as_operator_t *found_ops[OPERATOR_MAXCNT];
  size_t found_op_cnt;
} operator_search_cb_data_t;

static Boolean is_non_space_upto(const char *p_from, const char *p_to)
{
  for (; p_from < p_to; p_from++)
    if (!as_isspace(*p_from))
      return True;
  return False;
}

static Boolean is_non_space(const char *p_from)
{
  for (; *p_from; p_from++)
    if (!as_isspace(*p_from))
      return True;
  return False;
}

static int operator_search_cb(const char *p_pos, as_quoted_iterator_cb_data_t *p_cb_data)
{
  operator_search_cb_data_t *p_data = (operator_search_cb_data_t*)p_cb_data;
  int extra_skip = 0;

  switch (*p_pos)
  {
    case '(':
      p_data->l_klamm++;
      break;
    case ')':
      p_data->r_klamm++;
      break;
    case '{':
      p_data->w_klamm++;
      break;
    case '}':
      p_data->w_klamm--;
      break;
    default:
      if ((p_data->l_klamm == p_data->r_klamm) && !p_data->w_klamm)
      {
        const as_operator_t *p_pos_best_op = NULL;
        Boolean pos_best_op_argcnt_match = False;
        size_t zop;

        /* Operators with same 'match quality' override earlier ones.
           This way, target- or expression-specific operators get higher priority
           over built-in ones: */

        for (zop = 0; zop < p_data->found_op_cnt; zop++)
        {
          const as_operator_t *p_this_op = p_data->found_ops[zop];
          Boolean this_op_argcnt_match;

          /* Possible at all:
             (a) operator string itself must match */

          if (strncmp(p_pos, p_this_op->Id, p_this_op->IdLen))
            continue;

          /* (b) non-blank content right to op */

          if (!is_non_space(p_pos + p_this_op->IdLen))
            continue;

          /* (c) non-blank content left to binary op,
                 blank content right to unary op */

          this_op_argcnt_match = (p_this_op->op_type != e_op_monadic) == is_non_space_upto(p_data->p_after_last_op_start, p_pos);
          if (!this_op_argcnt_match)
            continue;

          /* Better match? */

          if (!p_pos_best_op
           || (p_this_op->IdLen > p_pos_best_op->IdLen)
           || ((p_this_op->IdLen == p_pos_best_op->IdLen) && (this_op_argcnt_match > pos_best_op_argcnt_match)))
          {
            p_pos_best_op = p_this_op;
            pos_best_op_argcnt_match = this_op_argcnt_match;
          }
        }

        if (p_pos_best_op)
        {
          /* NOTE: Due to the way we split up an expression in sub-operands, it is important to find the last
             operator if several on the same level are of same prio.  For instance, A/B*C must be treated as
             (A/B)*C and not A/(B*C): */

          if (!p_data->p_best_op
           || (p_pos_best_op->Priority >= p_data->p_best_op->Priority))
          {
            p_data->p_best_op = p_pos_best_op;
            p_data->op_pos = p_pos - p_cb_data->p_str;
          }
          extra_skip = p_pos_best_op->IdLen - 1;
          p_data->p_after_last_op_start = p_pos + p_pos_best_op->IdLen;
        }
      }
  }
  return extra_skip;
}

static void test_found_op(operator_search_cb_data_t *p_data, const as_operator_t *p_op, const char *p_str)
{
  const char *p_op_pos = (p_op->IdLen == 1) ? (strchr(p_str, *p_op->Id)) : (strstr(p_str, p_op->Id));

  if (p_op_pos)
    p_data->found_ops[p_data->found_op_cnt++] = p_op;
}

typedef struct
{
  as_eval_cb_data_t cb_data;
  PFunction p_function;
  TempResult **p_arg_vals;
} function_eval_cb_data_t;

DECLARE_AS_EVAL_CB(function_eval_cb)
{
  function_eval_cb_data_t *p_function_eval_cb_data = (function_eval_cb_data_t*)p_data;
  int z;
  const char *p_arg_name;
  StringRecPtr p_run;

  for (z = 0, p_arg_name = GetStringListFirst(p_function_eval_cb_data->p_function->p_arg_list, &p_run);
       z < p_function_eval_cb_data->p_function->ArguCnt;
       z++, p_arg_name = GetStringListNext(&p_run))
  {
    Boolean match = CaseSensitive
                  ? !strcmp(p_arg->str.p_str, p_arg_name)
                  : !as_strcasecmp(p_arg->str.p_str, p_arg_name);
    if (match)
    {
      as_tempres_copy(p_res, p_function_eval_cb_data->p_arg_vals[z]);
      return e_eval_ok;
    }
  }
  return e_eval_none;
}

void EvalStrExpressionWithCallback(const tStrComp *pExpr, TempResult *pErg, as_eval_flags_t eval_flags, as_eval_cb_data_t *p_callback_data)
{
  Boolean OK;
  int int_outof_range, float_outof_range;
  tStrComp InArgs[3];
  TempResult InVals[3];
  int z1, cnt;
  char Save = '\0';
  operator_search_cb_data_t operator_search_data;
  const as_operator_t *p_run_op;
  char *p_arg_split_pos;
  PFunction ValFunc;
  tStrComp CopyComp, STempComp;
  const tFunction *pFunction;
  PRelocEntry TReloc;
  tSymbolFlags PromotedFlags;
  unsigned PromotedAddrSpaceMask;
  tSymbolSize PromotedDataSize;
  as_eval_cb_data_stack_t cb_data_stack;

  ChkStack();

  for (z1 = 0; z1 < 3; z1++)
    as_tempres_ini(&InVals[z1]);
  StrCompAlloc(&CopyComp, STRINGSIZE);
  StrCompAlloc(&STempComp, STRINGSIZE);
  cb_data_stack.p_next = p_callback_data->p_stack;

  if (MakeDebug)
    fprintf(Debug, "Parse '%s'\n", pExpr->str.p_str);

  /* Annahme Fehler */

  as_tempres_set_none(pErg);
  pErg->Relocs = NULL;
  pErg->Flags = eSymbolFlag_None;
  pErg->AddrSpaceMask = 0;
  pErg->DataSize = eSymbolSizeUnknown;

  StrCompCopy(&CopyComp, pExpr);
  KillPrefBlanksStrComp(&CopyComp);
  KillPostBlanksStrComp(&CopyComp);

  /* sort out local symbols like - and +++.  Do it now to get them out of the
     formula parser's way. */

  ChkTmp2(CopyComp.str.p_str, CopyComp.str.p_str, e_symbol_source_none);
  StrCompCopy(&STempComp, &CopyComp);

  /* Programmzaehler ? */

  if (PCSymbol && (!as_strcasecmp(CopyComp.str.p_str, PCSymbol)))
  {
    as_tempres_set_int(pErg, EProgCounter());
    pErg->Relocs = NULL;
    pErg->AddrSpaceMask |= 1 << ActPC;
    LEAVE;
  }

  /* Konstanten ? */

  pErg->Contents.Int = ConstIntVal(CopyComp.str.p_str, (IntType) (IntTypeCnt - 1), &OK, &int_outof_range);
  if (OK)
  {
    if (int_outof_range)
    {
#if !TREAT_LARGEINT_FLOAT
      WrStrErrorPos((int_outof_range > 0) ? ErrNum_OverRange : ErrNum_UnderRange, &CopyComp);
      LEAVE;
#endif
    }
    else
    {
      pErg->Typ = TempInt;
      pErg->Relocs = NULL;
      LEAVE;
    }
  }

  pErg->Contents.Float = ConstFloatVal(CopyComp.str.p_str, &OK, &float_outof_range);
  if (OK)
  {
    if (float_outof_range)
      WrStrErrorPos((float_outof_range > 0) ? ErrNum_OverRange : ErrNum_UnderRange, &CopyComp);
    else
    {
#if TREAT_LARGEINT_FLOAT
      if (int_outof_range)
        WrStrErrorPos(ErrNum_LargeIntAsFloat, &CopyComp);
#endif
      pErg->Typ = TempFloat;
      pErg->Relocs = NULL;
    }
    LEAVE;
  }

  ConstStringVal(&CopyComp, pErg, &OK);
  if (OK)
  {
    pErg->Relocs = NULL;
    LEAVE;
  }

  /* Constands given by the target's generator code?  Note
     the per-call given callback has higher prio then the 'global'
     one.  This way, we do not need extra code to hand
     register symbols to the callback:  */

  pErg->Relocs = NULL;
  if (p_callback_data && p_callback_data->callback)
    switch (p_callback_data->callback(p_callback_data, &CopyComp, pErg))
    {
      case e_eval_none:
        break;
      case e_eval_fail:
        as_tempres_set_none(pErg);
        /* FALL-THRU */
      case e_eval_ok:
        LEAVE;
    }
  InternSymbol(CopyComp.str.p_str, pErg);
  if (pErg->Typ != TempNone)
  {
    LEAVE;
  }

  /* find out which operators *might* occur in expression */

  operator_search_data.data.callback_before = False;
  operator_search_data.data.qualify_quote = QualifyQuote;
  operator_search_data.p_best_op = NULL;
  operator_search_data.p_after_last_op_start = CopyComp.str.p_str;
  operator_search_data.op_pos = -1;
  operator_search_data.l_klamm = 0;
  operator_search_data.r_klamm = 0;
  operator_search_data.w_klamm = 0;
  operator_search_data.found_op_cnt = 0;
  for (p_run_op = operators; p_run_op->Id; p_run_op++)
    test_found_op(&operator_search_data, p_run_op, CopyComp.str.p_str);
  for (p_run_op = target_operators; p_run_op->Id; p_run_op++)
    test_found_op(&operator_search_data, p_run_op, CopyComp.str.p_str);
  for (p_run_op = p_callback_data->p_operators; p_run_op->Id; p_run_op++)
    test_found_op(&operator_search_data, p_run_op, CopyComp.str.p_str);

  /* search for highest-prio operator outside parentheses */

  as_iterate_str_quoted(CopyComp.str.p_str, operator_search_cb, &operator_search_data.data);

  /* Klammerfehler ? */

  if (operator_search_data.l_klamm != operator_search_data.r_klamm)
  {
    WrStrErrorPos(ErrNum_BrackErr, &CopyComp);
    LEAVE;
  }

  /* Operator gefunden ? */


  if (operator_search_data.p_best_op)
  {
    int ThisArgCnt, CompLen, z, z2;
    const int op_arg_cnt = (operator_search_data.p_best_op->op_type == e_op_monadic) ? 1 : 2,
              first_op_index = 2 - op_arg_cnt;
    Byte ThisOpMatch, BestOpMatch, SumCombinations, TypeMask;
    tLineComp op_line_pos;
    Boolean lhs_evaluated = False;

    /* Operandenzahl pruefen */

    CompLen = strlen(CopyComp.str.p_str);
    op_line_pos.StartCol = CopyComp.Pos.StartCol + operator_search_data.op_pos;
    op_line_pos.Len = operator_search_data.p_best_op->IdLen;
    if (CompLen <= 1)
      ThisArgCnt = 0;
    else if (!operator_search_data.op_pos || (operator_search_data.op_pos == (ptrdiff_t)strlen(CopyComp.str.p_str) - 1))
      ThisArgCnt = 1;
    else
      ThisArgCnt = 2;
    if (!ChkArgCntExtPos(ThisArgCnt, op_arg_cnt, op_arg_cnt, &op_line_pos))
      LEAVE;

    /* Teilausdruecke rekursiv auswerten: */

    Save = StrCompSplitRef(&InArgs[0], &InArgs[1], &CopyComp, CopyComp.str.p_str + operator_search_data.op_pos);
    StrCompIncRefLeft(&InArgs[1], strlen(operator_search_data.p_best_op->Id) - 1);
    cb_data_stack.type = e_operator;
    cb_data_stack.p_ident = operator_search_data.p_best_op->Id;
    p_callback_data->p_stack = &cb_data_stack;

    /* If short circuit evaluation is defined for the operator, evaluate
       lhs first and exit if success: */

    if (operator_search_data.p_best_op->op_type == e_op_dyadic_short)
    {
      cb_data_stack.arg_index = 0;
      EvalStrExpressionWithCallback(&InArgs[0], &InVals[0], eval_flags, p_callback_data);
      lhs_evaluated = True;
      if ((InVals[0].Typ == TempInt) && operator_search_data.p_best_op->pFunc(pErg, &InVals[0], NULL))
      {
        CopyComp.str.p_str[operator_search_data.op_pos] = Save;
        LEAVE;
      }
    }

    /* OK, no short circuit.  But avoid evaluating lhs once again: */
    
    cb_data_stack.arg_index = 1;
    EvalStrExpressionWithCallback(&InArgs[1], &InVals[1], eval_flags, p_callback_data);
    if (op_arg_cnt == 2)
    {
      if (!lhs_evaluated)
      {
        cb_data_stack.arg_index = 0;
        p_callback_data->p_other_arg = &InVals[1];
        EvalStrExpressionWithCallback(&InArgs[0], &InVals[0], eval_flags, p_callback_data);
        p_callback_data->p_other_arg = NULL;
      }
    }
    else if (InVals[1].Typ == TempFloat)
      as_tempres_set_float(&InVals[0], 0.0);
    else
    {
      as_tempres_set_int(&InVals[0], 0);
      InVals[0].Relocs = NULL;
    }
    CopyComp.str.p_str[operator_search_data.op_pos] = Save;

    /* Abbruch, falls dabei Fehler */

    if ((InVals[0].Typ == TempNone) || (InVals[1].Typ == TempNone))
      LEAVE;

    /* relokatible Symbole nur fuer + und - erlaubt */

    if (strcmp(operator_search_data.p_best_op->Id, "+") && strcmp(operator_search_data.p_best_op->Id, "-") && (InVals[0].Relocs || InVals[1].Relocs))
    {
      WrStrErrorPos(ErrNum_NoRelocs, &CopyComp);
      LEAVE;
    }

    /* see whether data types match operator's restrictions: */

    BestOpMatch = 255;
    SumCombinations = 0;
    for (z = 0; z < OPERATOR_MAXCOMB; z++)
    {
      if (!operator_search_data.p_best_op->TypeCombinations[z])
        break;
      SumCombinations |= operator_search_data.p_best_op->TypeCombinations[z];

      ThisOpMatch = 0;
      for (z2 = first_op_index; z2 < 2; z2++)
        ThisOpMatch |= TryConvert(GetOpTypeMask(operator_search_data.p_best_op->TypeCombinations[z], z2), InVals[z2].Typ, z2);
      if (ThisOpMatch < BestOpMatch)
        BestOpMatch = ThisOpMatch;
      if (!BestOpMatch)
        break;
    }

    /* did not find a way to satisfy restrictions, even by conversions? */

    if (BestOpMatch >= 255)
    {
      for (z2 = first_op_index; z2 < 2; z2++)
      {
        TypeMask = GetOpTypeMask(SumCombinations, z2);
        if (!(TypeMask & InVals[z2].Typ))
          WrStrErrorPos(DeduceExpectTypeErrMsgMask(TypeMask, InVals[z2].Typ), &InArgs[z2]);
      }
      LEAVE;
    }

    /* necessary conversions: */

    for (z2 = first_op_index; z2 < 2; z2++)
    {
      TypeMask = (BestOpMatch >> (z2 * 4)) & 15;
      if (TypeMask & 2)  /* String -> Int */
        TempResultToInt(&InVals[z2]);
      if (TypeMask & 1) /* Int -> Float */
        TempResultToFloat(&InVals[z2]);
    }

    /* actual operation */

    operator_search_data.p_best_op->pFunc(pErg, &InVals[0], &InVals[1]);
    LEAVE;
  } /* if (OpMax) */

  /* kein Operator gefunden: Klammerausdruck ? */

  if (operator_search_data.l_klamm != 0)
  {
    tStrComp FName, FArg, Remainder;
    char *p_opening_pos;

    /* erste Klammer suchen, Funktionsnamen abtrennen */

    p_opening_pos = strchr(CopyComp.str.p_str, '(');

    /* Funktionsnamen abschneiden */

    StrCompSplitRef(&FName, &FArg, &CopyComp, p_opening_pos);
    StrCompShorten(&FArg, 1);
    KillPostBlanksStrComp(&FName);

    /* Nullfunktion: nur Argument */

    if (*FName.str.p_str == '\0')
    {
      /* No need to establish another callback data stack level in this case: */
      EvalStrExpressionWithCallback(&FArg, pErg, eval_flags, p_callback_data);
      LEAVE;
    }

    /* selbstdefinierte Funktion ? */

    ValFunc = FindFunction(FName.str.p_str);
    if (ValFunc)
    {
      tStrComp func_def_arg;
      function_eval_cb_data_t fnc_cb_data;

      as_eval_cb_data_ini(&fnc_cb_data.cb_data, function_eval_cb);
      fnc_cb_data.p_function = ValFunc;
      fnc_cb_data.p_arg_vals = (TempResult**)calloc(ValFunc->ArguCnt, sizeof(*fnc_cb_data.p_arg_vals));

      PromotedFlags = eSymbolFlag_None;
      PromotedAddrSpaceMask = 0;
      PromotedDataSize = eSymbolSizeUnknown;
      cb_data_stack.type = e_function;
      cb_data_stack.p_ident = FName.str.p_str;
      p_callback_data->p_stack = &cb_data_stack;
      for (z1 = 0, cb_data_stack.arg_index = 0;
           z1 < ValFunc->ArguCnt;
           z1++, cb_data_stack.arg_index++)
      {
        if (!*FArg.str.p_str)
        {
          WrError(ErrNum_InvFuncArgCnt);
          LEAVE2;
        }

        p_arg_split_pos = QuotPos(FArg.str.p_str, ',');
        if (p_arg_split_pos)
          StrCompSplitRef(&FArg, &Remainder, &FArg, p_arg_split_pos);

        fnc_cb_data.p_arg_vals[z1]
         = (z1 < (int)as_array_size(InVals))
         ? &InVals[z1]
         : as_tempres_dyn_ini();

        EvalStrExpressionWithCallback(&FArg, fnc_cb_data.p_arg_vals[z1], eval_flags, p_callback_data);
        if (fnc_cb_data.p_arg_vals[z1]->Relocs)
        {
          WrStrErrorPos(ErrNum_NoRelocs, &FArg);
          FreeRelocs(&fnc_cb_data.p_arg_vals[z1]->Relocs);
          LEAVE2;
        }
        PromotedFlags |= fnc_cb_data.p_arg_vals[z1]->Flags & eSymbolFlags_Promotable;
        PromotedAddrSpaceMask |= fnc_cb_data.p_arg_vals[z1]->AddrSpaceMask;
        if (PromotedDataSize == eSymbolSizeUnknown)
          PromotedDataSize = fnc_cb_data.p_arg_vals[z1]->DataSize;

        if (p_arg_split_pos)
          FArg = Remainder;
        else
          StrCompReset(&FArg);
      }
      if (*FArg.str.p_str)
      {
        WrError(ErrNum_InvFuncArgCnt);
        LEAVE2;
      }
      StrCompMkTemp(&func_def_arg, ValFunc->Definition, strlen(ValFunc->Definition));
      EvalStrExpressionWithCallback(&func_def_arg, pErg, eval_flags, &fnc_cb_data.cb_data);
      pErg->Flags |= PromotedFlags;
      pErg->AddrSpaceMask |= PromotedAddrSpaceMask;
      if (pErg->DataSize == eSymbolSizeUnknown) pErg->DataSize = PromotedDataSize;
func_exit2:
      for (z1 = 0; z1 < ValFunc->ArguCnt; z1++)
      {
        if (z1 >= (int)as_array_size(InVals))
          as_tempres_free(fnc_cb_data.p_arg_vals[z1]);
        fnc_cb_data.p_arg_vals[z1] = NULL;
      }
      free(fnc_cb_data.p_arg_vals);
      LEAVE;
    }

    /* hier einmal umwandeln ist effizienter */

    NLS_UpString(FName.str.p_str);

    /* symbolbezogene Funktionen */

    if (!strcmp(FName.str.p_str, "SYMTYPE"))
    {
      as_tempres_set_int(pErg, GetSymbolType(&FArg));
      LEAVE;
    }

    else if (!strcmp(FName.str.p_str, "DEFINED"))
    {
      as_tempres_set_int(pErg, !!IsSymbolDefined(&FArg));
      LEAVE;
    }

    else if (!strcmp(FName.str.p_str, "SYMEXIST"))
    {
      as_tempres_set_int(pErg, !!is_symbol_existing(&FArg));
      LEAVE;
    }

    else if (!strcmp(FName.str.p_str, "SYMUSED"))
    {
      as_tempres_set_int(pErg, !!IsSymbolUsed(&FArg));
      LEAVE;
    }

    else if (!strcmp(FName.str.p_str, "ASSUMEDVAL"))
    {
      const as_assume_rec_t *p_rec = assume_lookup(FArg.str.p_str);

      if (p_rec)
        as_tempres_set_int(pErg, *(p_rec->p_dest));
      else
        WrStrErrorPos(ErrNum_SymbolUndef, &FArg);
      LEAVE;
    }

    /* Unterausdruck auswerten (interne Funktionen maxmimal mit drei Argumenten) */

    cnt = 0;
    PromotedFlags = eSymbolFlag_None;
    PromotedAddrSpaceMask = 0;
    PromotedDataSize = eSymbolSizeUnknown;
    cb_data_stack.type = e_function;
    cb_data_stack.p_ident = FName.str.p_str;
    cb_data_stack.arg_index = 0;
    p_callback_data->p_stack = &cb_data_stack;
    do
    {
      p_arg_split_pos = QuotPos(FArg.str.p_str, ',');
      if (p_arg_split_pos)
        StrCompSplitRef(&InArgs[cnt], &Remainder, &FArg, p_arg_split_pos);
      else
        InArgs[cnt] = FArg;
      if (cnt < 3)
      {
        EvalStrExpressionWithCallback(&InArgs[cnt], &InVals[cnt], eval_flags, p_callback_data);
        if (InVals[cnt].Typ == TempNone)
          LEAVE;
        TReloc = InVals[cnt].Relocs;
      }
      else
      {
        WrError(ErrNum_InvFuncArgCnt);
        LEAVE;
      }
      if (TReloc)
      {
        WrStrErrorPos(ErrNum_NoRelocs, &InArgs[cnt]);
        FreeRelocs(&TReloc);
        LEAVE;
      }
      if (p_arg_split_pos)
        FArg = Remainder;
      PromotedFlags |= InVals[cnt].Flags & eSymbolFlags_Promotable;
      PromotedAddrSpaceMask |= InVals[cnt].AddrSpaceMask;
      if (PromotedDataSize == eSymbolSizeUnknown) PromotedDataSize = InVals[0].DataSize;
      cnt++;
      cb_data_stack.arg_index++;
    }
    while (p_arg_split_pos);

    /* search function */

    pFunction = function_find(FName.str.p_str);
    if (!pFunction)
    {
      WrStrErrorPos(ErrNum_UnknownFunc, &FName);
      LEAVE;
    }

    /* argument checking */

    if ((cnt < pFunction->MinNumArgs) || (cnt > pFunction->MaxNumArgs))
    {
      WrError(ErrNum_InvFuncArgCnt);
      LEAVE;
    }
    for (z1 = 0; z1 < cnt; z1++)
    {
      if ((InVals[z1].Typ == TempInt) && !(pFunction->ArgTypes[z1] & TempInt))
        TempResultToFloat(&InVals[z1]);
      if (!(pFunction->ArgTypes[z1] & InVals[z1].Typ))
      {
        WrStrErrorPos(DeduceExpectTypeErrMsgMask(pFunction->ArgTypes[z1], InVals[z1].Typ), &InArgs[z1]);
        LEAVE;
      }
    }
    if (!pFunction->pFunc(pErg, InVals, cnt))
    {
      WrStrErrorPos(ErrNum_UnknownFunc, &FName);
      LEAVE;
    }
    pErg->Flags |= PromotedFlags;
    pErg->AddrSpaceMask |= PromotedAddrSpaceMask;
    if (pErg->DataSize == eSymbolSizeUnknown) pErg->DataSize = PromotedDataSize;

    LEAVE;
  }

  /* nichts dergleichen, dann einfaches Symbol: urspruenglichen Wert wieder
     herstellen, dann Pruefung auf $$-temporaere Symbole */

  StrCompCopy(&CopyComp, &STempComp);
  KillPrefBlanksStrComp(&CopyComp);
  KillPostBlanksStrComp(&CopyComp);

  ChkTmp1(CopyComp.str.p_str, e_symbol_source_none);

  /* interne Symbole ? */

  if (!as_strcasecmp(CopyComp.str.p_str, "MOMFILE"))
  {
    as_tempres_set_c_str(pErg, CurrFileName);
    LEAVE;
  }

  if (!as_strcasecmp(CopyComp.str.p_str, "MOMLINE"))
  {
    as_tempres_set_int(pErg, CurrLine);
    LEAVE;
  }

  if (!as_strcasecmp(CopyComp.str.p_str, "MOMPASS"))
  {
    as_tempres_set_int(pErg, PassNo);
    LEAVE;
  }

  if (!as_strcasecmp(CopyComp.str.p_str, "MOMSECTION"))
  {
    as_tempres_set_c_str(pErg, GetSectionName(MomSectionHandle));
    LEAVE;
  }

  if (!as_strcasecmp(CopyComp.str.p_str, "MOMSEGMENT"))
  {
    as_tempres_set_c_str(pErg, SegNames[ActPC]);
    LEAVE;
  }

  /* plain symbol */

  {
    String exp_name_buf;
    tStrComp exp_name;

    StrCompMkTemp(&exp_name, exp_name_buf, sizeof(exp_name_buf));
    LookupSymbolRet(&CopyComp, &exp_name, pErg, True, TempAll, eval_flags, NULL);

    /* no forward reference entries if just ifdef was queried: */

    if ((pErg->Flags & eSymbolFlag_FirstPassUnknown)
     && !(eval_flags & e_eval_flag_undefined_is_unknown))
    {
      as_forward_ref_add(exp_name.str.p_str);
    }
  }

func_exit:

  p_callback_data->p_stack = cb_data_stack.p_next;

  StrCompFree(&CopyComp);
  StrCompFree(&STempComp);

  for (z1 = 0; z1 < 3; z1++)
  {
    if (InVals[z1].Relocs)
      FreeRelocs(&InVals[z1].Relocs);
    as_tempres_free(&InVals[z1]);
  }
}

void EvalStrExpression(const tStrComp *pExpr, TempResult *pErg)
{
  as_eval_cb_data_t cb_data;
  
  as_eval_cb_data_ini(&cb_data, NULL);
  EvalStrExpressionWithCallback(pExpr, pErg, e_eval_flag_none, &cb_data);
}

void EvalExpression(const char *pExpr, TempResult *pErg)
{
  tStrComp Expr;

  StrCompMkTemp(&Expr, (char*)pExpr, 0);
  EvalStrExpression(&Expr, pErg);
}

LargeInt EvalStrIntExprWithResultAndCallback(const tStrComp *pComp, IntType Type, tEvalResult *pResult, as_eval_cb_data_t *p_callback_data)
{
  TempResult t;
  LargeInt Result = -1;

  as_tempres_ini(&t);
  EvalResultClear(pResult);

  EvalStrExpressionWithCallback(pComp, &t, e_eval_flag_none, p_callback_data);
  SetRelocs(t.Relocs);

  switch (t.Typ)
  {
    case TempInt:
      Result = t.Contents.Int;
      pResult->Flags = t.Flags;
      pResult->AddrSpaceMask = t.AddrSpaceMask;
      pResult->DataSize = t.DataSize;
      break;
    case TempString:
    {
      int l = t.Contents.str.len;

      if ((l > 0) && (l <= 4))
      {
        int ret = NonZString2Int(&t.Contents.str, &Result);

        if (ENOENT == ret)
        {
          WrStrErrorPos(ErrNum_UnmappedChar, pComp);
          FreeRelocs(&LastRelocs);
          LEAVE;
        }
        pResult->Flags = t.Flags;
        pResult->AddrSpaceMask = t.AddrSpaceMask;
        pResult->DataSize = t.DataSize;
        break;
      }
      else
      {
        WrStrErrorPos(ErrNum_IntButString, pComp);
        FreeRelocs(&LastRelocs);
        LEAVE;
      }
    }
    /* else fall-through */
    default:
      if (t.Typ != TempNone)
        WrStrErrorPos(DeduceExpectTypeErrMsgMask(TempInt | TempString, t.Typ), pComp);
      FreeRelocs(&LastRelocs);
      LEAVE;
  }

  if (mFirstPassUnknown(t.Flags))
    Result &= IntTypeDefs[(int)Type].Mask;

  pResult->OK = HardRanges ? ChkRangeByType(Result, Type, pComp) : ChkRangeWarnByType(Result, Type, pComp);
  if (!pResult->OK)
  {
    if (HardRanges)
    {
      FreeRelocs(&LastRelocs);
      Result = -1;
      LEAVE;
    }
    else
    {
      pResult->OK = True;
      Result &= IntTypeDefs[(int)Type].Mask;
    }
  }

func_exit:
  as_tempres_free(&t);
  return Result;
}

LargeInt EvalStrIntExpressionWithResult(const tStrComp *pComp, IntType Type, tEvalResult *pResult)
{
  as_eval_cb_data_t cb_data;

  as_eval_cb_data_ini(&cb_data, NULL);
  return EvalStrIntExprWithResultAndCallback(pComp, Type, pResult, &cb_data);
}

LargeInt EvalStrIntExpressionWithFlags(const tStrComp *pComp, IntType Type, Boolean *pResult, tSymbolFlags *pFlags)
{
  tEvalResult EvalResult;
  LargeInt Result = EvalStrIntExpressionWithResult(pComp, Type, &EvalResult);

  *pResult = EvalResult.OK;
  if (pFlags)
    *pFlags = EvalResult.Flags;
  return Result;
}

LargeInt EvalStrIntExpression(const tStrComp *pComp, IntType Type, Boolean *pResult)
{
  tEvalResult EvalResult;
  LargeInt Result = EvalStrIntExpressionWithResult(pComp, Type, &EvalResult);

  *pResult = EvalResult.OK;
  return Result;
}

LargeInt EvalStrIntExpressionOffsWithResult(const tStrComp *pExpr, int Offset, IntType Type, tEvalResult *pResult)
{
  if (Offset)
  {
    tStrComp Comp;

    StrCompRefRight(&Comp, pExpr, Offset);
    return EvalStrIntExpressionWithResult(&Comp, Type, pResult);
  }
  else
    return EvalStrIntExpressionWithResult(pExpr, Type, pResult);
}

LargeInt EvalStrIntExprOffsWithResultAndCallback(const tStrComp *pExpr, int Offset, IntType Type, tEvalResult *pResult, as_eval_cb_data_t *p_callback_data)
{
  if (Offset)
  {
    tStrComp Comp;
        
    StrCompRefRight(&Comp, pExpr, Offset);
    return EvalStrIntExprWithResultAndCallback(&Comp, Type, pResult, p_callback_data);
  }
  else
    return EvalStrIntExprWithResultAndCallback(pExpr, Type, pResult, p_callback_data);
}

LargeInt EvalStrIntExpressionOffsWithFlags(const tStrComp *pComp, int Offset, IntType Type, Boolean *pResult, tSymbolFlags *pFlags)
{
  tEvalResult EvalResult;
  LargeInt Result = EvalStrIntExpressionOffsWithResult(pComp, Offset, Type, &EvalResult);

  *pResult = EvalResult.OK;
  if (pFlags)
    *pFlags = EvalResult.Flags;
  return Result;
}

LargeInt EvalStrIntExpressionOffs(const tStrComp *pComp, int Offset, IntType Type, Boolean *pResult)
{
  tEvalResult EvalResult;
  LargeInt Result = EvalStrIntExpressionOffsWithResult(pComp, Offset, Type, &EvalResult);

  *pResult = EvalResult.OK;
  return Result;
}

as_float_t EvalStrFloatExpressionWithResult(const tStrComp *pExpr, tEvalResult *pResult)
{
  TempResult t;
  as_float_t Result = -1;

  as_tempres_ini(&t);
  EvalResultClear(pResult);

  EvalStrExpression(pExpr, &t);
  switch (t.Typ)
  {
    case TempNone:
      LEAVE;
    case TempInt:
      Result = t.Contents.Int;
      pResult->Flags = t.Flags;
      pResult->AddrSpaceMask = t.AddrSpaceMask;
      pResult->DataSize = t.DataSize;
      break;
    case TempString:
    {
      WrStrErrorPos(ErrNum_FloatButString, pExpr);
      LEAVE;
    }
    default:
      Result = t.Contents.Float;
  }

  pResult->OK = True;
func_exit:
  as_tempres_free(&t);
  return Result;
}

as_float_t EvalStrFloatExpression(const tStrComp *pExpr, Boolean *pResult)
{
  as_float_t Ret;
  tEvalResult Result;

  Ret = EvalStrFloatExpressionWithResult(pExpr, &Result);
  *pResult = Result.OK;
  return Ret;
}

void EvalStrStringExpressionWithResult(const tStrComp *pExpr, tEvalResult *pResult, struct as_nonz_dynstr *pEvalResult)
{
  TempResult t;

  as_tempres_ini(&t);
  EvalResultClear(pResult);

  EvalStrExpression(pExpr, &t);
  if (t.Typ != TempString)
  {
    as_nonz_dynstr_copy_c_str(pEvalResult, "");
    if (t.Typ != TempNone)
    {
      if (mFirstPassUnknown(t.Flags))
      {
        as_nonz_dynstr_copy_c_str(pEvalResult, "");
        pResult->Flags = t.Flags;
        pResult->AddrSpaceMask = t.AddrSpaceMask;
        pResult->DataSize = t.DataSize;
        pResult->OK = True;
      }
      else
        WrStrErrorPos(DeduceExpectTypeErrMsgMask(TempString, t.Typ), pExpr);
    }
  }
  else
  {
    as_nonz_dynstr_swap(pEvalResult, &t.Contents.str);
    pResult->Flags = t.Flags;
    pResult->AddrSpaceMask = t.AddrSpaceMask;
    pResult->DataSize = t.DataSize;
    pResult->OK = True;
  }
  as_tempres_free(&t);
}

void EvalStrStringExpression(const tStrComp *pExpr, Boolean *pResult, struct as_nonz_dynstr *pEvalResult)
{
  tEvalResult Result;

  EvalStrStringExpressionWithResult(pExpr, &Result, pEvalResult);
  *pResult = Result.OK;
}

/*!------------------------------------------------------------------------
 * \fn     EvalStrRegExpressionWithResult(const struct sStrComp *pExpr, struct sRegDescr *pResult, struct sEvalResult *pEvalResult, Boolean IssueErrors)
 * \brief  retrieve/evaluate register expression
 * \param  pExpr source code expression
 * \param  pResult retrieved register
 * \param  pEvalResult success flag, symbol size & flags
 * \param  IssueErrors print errors at all?
 * \return occured error
 * ------------------------------------------------------------------------ */

tErrorNum EvalStrRegExpressionWithResult(const struct sStrComp *pExpr, tRegDescr *pResult, tEvalResult *pEvalResult)
{
  PSymbolEntry pEntry;

  EvalResultClear(pEvalResult);

  pEntry = ExpandAndFindNode(pExpr, TempAll, True, e_expand_chk_empty_upto, NULL);
  if (!pEntry)
    return ErrNum_SymbolUndef;
  if (pEntry->SymWert.Typ != TempReg)
    return ErrNum_ExpectReg;

  *pResult = pEntry->SymWert.Contents.RegDescr;
  set_symbol_entry_flag(pEntry, used, True);
  pEvalResult->DataSize = pEntry->SymWert.DataSize;

  if (pEntry->SymWert.Contents.RegDescr.Dissect != DissectReg)
    return ErrNum_RegWrongTarget;

  pEvalResult->OK = True;
  return ErrNum_None;
}

/*!------------------------------------------------------------------------
 * \fn     EvalStrRegExpressionAsOperand(const tStrComp *pArg, struct sRegDescr *pResult, struct sEvalResult *pEvalResult, tSymbolSize ReqSize, Boolean MustBeReg)
 * \brief  check for possible register in instruction operand
 * \param  pArg source argument
 * \param  ReqSize possible fixed operand size
 * \param  MustBeReg operand cannot be anything else but register
 * \return eIsReg: argument is a register
           eIsNoReg: argument is no register
           eRegAbort: argument is faulty, abort anyway (only if !MustBeReg)
 * ------------------------------------------------------------------------ */

tRegEvalResult EvalStrRegExpressionAsOperand(const tStrComp *pArg, struct sRegDescr *pResult, struct sEvalResult *pEvalResult, tSymbolSize ReqSize, Boolean MustBeReg)
{
  tErrorNum ErrorNum;

  ErrorNum = EvalStrRegExpressionWithResult(pArg, pResult, pEvalResult);
  if (pEvalResult->OK && (ReqSize != eSymbolSizeUnknown) && (pEvalResult->DataSize != ReqSize))
  {
    pEvalResult->OK = False;
    ErrorNum = ErrNum_InvOpSize;
  }
  switch (ErrorNum)
  {
    case ErrNum_None:
      return eIsReg;
    case ErrNum_SymbolUndef:
      if (MustBeReg)
      {
        if (PassNo <= MaxSymPass)
        {
          pResult->Reg = 0;
          pEvalResult->DataSize = ReqSize;
          pResult->Dissect = NULL;
          pResult->compare = NULL;
          Repass = True;
          return eIsReg;
        }
        else
        {
          WrStrErrorPos(ErrNum_InvReg, pArg);
          return eIsNoReg;
        }
      }
      else
        return eIsNoReg;
    case ErrNum_ExpectReg:
      if (MustBeReg)
        WrStrErrorPos(ErrorNum, pArg);
      return eIsNoReg;
    default:
      WrStrErrorPos(ErrorNum, pArg);
      return MustBeReg ? eIsNoReg : eRegAbort;
  }
}

static void FreeSymbolEntry(PSymbolEntry *Node, Boolean Destroy)
{
  PCrossRef Lauf;

  if ((*Node)->Tree.Name)
  {
    free((*Node)->Tree.Name);
   (*Node)->Tree.Name = NULL;
  }

  as_tempres_free(&(*Node)->SymWert);

  while ((*Node)->RefList)
  {
    Lauf = (*Node)->RefList->Next;
    free((*Node)->RefList);
    (*Node)->RefList = Lauf;
  }

  FreeRelocs(&((*Node)->SymWert.Relocs));

  if (Destroy)
  {
    free(*Node);
    Node = NULL;
  }
}

static char *serr, *snum;
typedef struct
{
  Boolean MayChange, DoCross;
} TEnterStruct, *PEnterStruct;

static Boolean SymbolAdder(PTree *PDest, PTree Neu, void *pData)
{
  PSymbolEntry NewEntry = (PSymbolEntry)Neu, *Node;
  PEnterStruct EnterStruct = (PEnterStruct) pData;

  /* added to an empty leaf ? */

  if (!PDest)
  {
    set_symbol_entry_flag(NewEntry, defined, True);
    /* usage by possible forward references is updated on-demand in update_and_get_used() */
    set_symbol_entry_flag(NewEntry, used, False);
    set_symbol_entry_flag(NewEntry, changeable, EnterStruct->MayChange);
    NewEntry->RefList = NULL;
    if (EnterStruct->DoCross)
    {
      NewEntry->FileNum = GetFileNum(CurrFileName);
      NewEntry->LineNum = CurrLine;
    }
    return True;
  }

  /* replace en entry: check for validity */

  Node = (PSymbolEntry*)PDest;

  /* tried to redefine a symbol with EQU ? */

  if (get_symbol_entry_flag((*Node), defined) && !get_symbol_entry_flag(*Node, changeable) && !EnterStruct->MayChange)
  {
    strmaxcpy(serr, (*Node)->Tree.Name, STRINGSIZE);
    if (EnterStruct->DoCross)
      as_snprcatf(serr, STRINGSIZE, ",%s %s:%ld",
                  getmessage(Num_PrevDefMsg),
                  GetFileName((*Node)->FileNum), (long)((*Node)->LineNum));
    WrXError(ErrNum_DoubleDef, serr);
    FreeSymbolEntry(&NewEntry, TRUE);
    return False;
  }

  /* Tried to reassign a constant (EQU) a value with SET and vice versa ?
     Forwards may always be overwritten. */

  else if (get_symbol_entry_flag((*Node), defined)
        && (EnterStruct->MayChange != get_symbol_entry_flag(*Node, changeable))
        && ((*Node)->SymWert.Typ != TempNone) )
  {
    strmaxcpy(serr, (*Node)->Tree.Name, STRINGSIZE);
    if (EnterStruct->DoCross)
      as_snprcatf(serr, STRINGSIZE, ",%s %s:%ld",
                  getmessage(Num_PrevDefMsg),
                  GetFileName((*Node)->FileNum), (long)((*Node)->LineNum));
    WrXError(get_symbol_entry_flag(*Node, changeable) ? ErrNum_VariableRedefinedAsConstant : ErrNum_ConstantRedefinedAsVariable, serr);
    FreeSymbolEntry(&NewEntry, TRUE);
    return False;
  }

  /* Forward (none) definition shall not overwrite actual symbol type: */

  else if (((*Node)->SymWert.Typ != TempNone) && (NewEntry->SymWert.Typ == TempNone))
    return False;

  else
  {
    if (!EnterStruct->MayChange)
    {
      Boolean value_changed;

#if 0
      if (NewEntry->SymWert.Typ == TempInt)
        fprintf(stderr, "NewEntry 0x%lx Node 0x%lx Node changed %d\n",
                NewEntry->SymWert.Contents.Int, (*Node)->SymWert.Contents.Int, get_symbol_entry_flag(*Node, changed));
#endif

      /* If the symbol value was changed after entry (padding of label),
         compare to the originally set value, because this is what we get
         here as initial value to set (before padding) in the next pass: */

      if (NewEntry->SymWert.Typ != (*Node)->SymWert.Typ)
        value_changed = True;
      else switch (NewEntry->SymWert.Typ)
      {
        case TempInt:
          value_changed = NewEntry->SymWert.Contents.Int != (get_symbol_entry_flag(*Node, changed) ? (*Node)->unchanged_value : (*Node)->SymWert.Contents.Int);
          break;
        default:
          value_changed = !!as_tempres_cmp(&NewEntry->SymWert, &(*Node)->SymWert);
      }
      if (value_changed)
      {
        if (!Repass && (JmpErrors > 0))
        {
          if (ThrowErrors)
            ErrorCount -= JmpErrors;
          JmpErrors = 0;
        }
        Repass = True;
        if (MsgIfRepass && (PassNo >= PassNoForMessage))
        {
          strmaxcpy(serr, Neu->Name, STRINGSIZE);
          if (Neu->Attribute != -1)
          {
            strmaxcat(serr, "[", STRINGSIZE);
            strmaxcat(serr, GetSectionName(Neu->Attribute), STRINGSIZE);
            strmaxcat(serr, "]", STRINGSIZE);
          }
          WrXError(ErrNum_PhaseErr, serr);
        }
      }
    }
    if (EnterStruct->DoCross)
    {
      NewEntry->LineNum = (*Node)->LineNum;
      NewEntry->FileNum = (*Node)->FileNum;
    }

    /* take over values from existing node that shall be kept */

    NewEntry->RefList = (*Node)->RefList;
    (*Node)->RefList = NULL;
    set_symbol_entry_flag(NewEntry, defined, True);
    set_symbol_entry_flag(NewEntry, used, get_symbol_entry_flag(*Node, used));
    set_symbol_entry_flag(NewEntry, changeable, EnterStruct->MayChange);

    /* since NewEntry will be copied over Node, free the latter's dynamic data: */

    FreeSymbolEntry(Node, False);
    return True;
  }
}

static void EnterLocSymbol(PSymbolEntry Neu)
{
  TEnterStruct EnterStruct;
  PTree TreeRoot;

  Neu->Tree.Attribute = MomLocHandle;
  EnterStruct.MayChange = EnterStruct.DoCross = FALSE;
  TreeRoot = &FirstLocSymbol->Tree;
  EnterTree(&TreeRoot, (&Neu->Tree), SymbolAdder, &EnterStruct);
  FirstLocSymbol = (PSymbolEntry)TreeRoot;
}

static void EnterSymbol(PSymbolEntry Neu, Boolean MayChange, LongInt ResHandle)
{
  String CombName;
  PSaveSection RunSect;
  LongInt MSect;
  PSymbolEntry Copy;
  TEnterStruct EnterStruct;
  PTree TreeRoot = &(FirstSymbol->Tree);

  EnterStruct.MayChange = MayChange;
  EnterStruct.DoCross = MakeCrossList;
  Neu->Tree.Attribute = (ResHandle == -2) ? MomSectionHandle : ResHandle;

  /* Within a section: special treatment for FORWARD, PUBLIC and GLOBAL: */

  if (SectionStack && (Neu->Tree.Attribute == MomSectionHandle))
  {
    LongInt override_section;

    /* FORWARD: just an info to avoid resolution to global symbol.  This symbol remains
       in current section: */

    if (as_fwd_sym_search_and_move_dest_section(&(SectionStack->LocSyms), Neu->Tree.Name, &override_section))
    { }

    /* PUBLIC: relocate scope of symbol to given section: */

    else if (as_fwd_sym_search_and_move_dest_section(&(SectionStack->GlobSyms), Neu->Tree.Name, &override_section))
      Neu->Tree.Attribute = override_section;

    /* GLOBAL: create copy with scope in given section: */

    else if (as_fwd_sym_search_and_move_dest_section(&(SectionStack->ExportSyms), Neu->Tree.Name, &override_section))
    {
      strmaxcpy(CombName, Neu->Tree.Name, STRINGSIZE);
      RunSect = SectionStack;
      MSect = MomSectionHandle;
      while ((MSect != override_section) && (RunSect))
      {
        strmaxprep(CombName, "_", STRINGSIZE);
        strmaxprep(CombName, GetSectionName(MSect), STRINGSIZE);
        MSect = RunSect->Handle;
        RunSect = RunSect->Next;
      }
      Copy = (PSymbolEntry) calloc(1, sizeof(TSymbolEntry));
      *Copy = (*Neu);
      Copy->Tree.Name = as_strdup(CombName);
      Copy->Tree.Attribute = override_section;
      Copy->SymWert.Relocs = DupRelocs(Neu->SymWert.Relocs);
      if (Copy->SymWert.Typ == TempString)
      {
        size_t l = Neu->SymWert.Contents.str.len;
        Copy->SymWert.Contents.str.p_str = (char*)malloc(l);
        memcpy(Copy->SymWert.Contents.str.p_str, Neu->SymWert.Contents.str.p_str,
               Copy->SymWert.Contents.str.len = Copy->SymWert.Contents.str.capacity = l);
      }
      EnterTree(&TreeRoot, &(Copy->Tree), SymbolAdder, &EnterStruct);
    }
  }
  EnterTree(&TreeRoot, &(Neu->Tree), SymbolAdder, &EnterStruct);
  FirstSymbol = (PSymbolEntry)TreeRoot;
}

void PrintSymTree(char *Name)
{
  fprintf(Debug, "---------------------\n");
  fprintf(Debug, "Enter Symbol %s\n\n", Name);
  PrintSymbolTree();
  PrintSymbolDepth();
}

/*!------------------------------------------------------------------------
 * \fn     ChangeSymbol(PSymbolEntry pEntry, LargeInt Value)
 * \brief  change value of symbol in symbol table (use with caution)
 * \param  pEntry symbol entry to modify
 * \param  Value new (integer)value
 * ------------------------------------------------------------------------ */

void ChangeSymbol(PSymbolEntry pEntry, LargeInt Value)
{
  if (!get_symbol_entry_flag(pEntry, changed))
  {
    pEntry->unchanged_value = (pEntry->SymWert.Typ == TempInt) ? pEntry->SymWert.Contents.Int : 0;
    set_symbol_entry_flag(pEntry, changed, True);
  }
  as_tempres_set_int(&pEntry->SymWert, Value);
}

/*!------------------------------------------------------------------------
 * \fn     CreateSymbolEntry(const tStrComp *pName, LongInt *pDestHandle, tSymbolFlags symbol_flags)
 * \brief  create empty container for symbol table entry
 * \param  pName unexpanded symbol name
 * \param  pDestHandle section handle (out)
 * \param  symbol_flags symbol flags
 * \return * to container or NULL
 * ------------------------------------------------------------------------ */

PSymbolEntry CreateSymbolEntry(const tStrComp *pName, LongInt *pDestHandle, tSymbolFlags symbol_flags)
{
  PSymbolEntry pNeu = NULL;
  String exp_name_buf;
  tStrComp *p_exp_name, exp_name;

  StrCompMkTemp(&exp_name, exp_name_buf, sizeof exp_name_buf);
  p_exp_name = ExpandStrSymbol(&exp_name, pName, !CaseSensitive);
  if (!p_exp_name)
    LEAVE;
  if (!GetSymSection(p_exp_name, pDestHandle, pName))
    LEAVE;
  (void)ChkTmp(p_exp_name->str.p_str, (symbol_flags & eSymbolFlag_Label) ? e_symbol_source_label : e_symbol_source_define);
  if (!ChkSymbName(p_exp_name->str.p_str))
  {
    WrStrErrorPos(ErrNum_InvSymName, pName);
    LEAVE;
  }
  pNeu = (PSymbolEntry) calloc(1, sizeof(TSymbolEntry));
  pNeu->Tree.Name = as_strdup(p_exp_name->str.p_str);
  as_tempres_ini(&pNeu->SymWert);
func_exit:
  StrCompFree(&exp_name);
  return pNeu;
}

/*!------------------------------------------------------------------------
 * \fn     EnterIntSymbolWithFlags(const tStrComp *pName, LargeInt Wert, as_addrspace_t addrspace, Boolean MayChange, tSymbolFlags Flags)
 * \brief  add integer symbol to symbol table
 * \param  pName unexpanded name
 * \param  Wert integer value
 * \param  addrspace symbol's address space
 * \param  MayChange constant or variable?
 * \param  Flags additional flags
 * \return * to newly created entry in tree
 * ------------------------------------------------------------------------ */

static Boolean symbol_name_reserved(const char *p_name)
{
  if (inf_reserved)
  {
    if (*p_name == '-')
      p_name++;
    return !as_strcasecmp(p_name, inf_name);
  }
  return False;
}

PSymbolEntry EnterIntSymbolWithFlags(const tStrComp *pName, LargeInt Wert, as_addrspace_t addrspace, Boolean MayChange, tSymbolFlags Flags)
{
  LongInt DestHandle;
  PSymbolEntry pNeu;

  if (symbol_name_reserved(pName->str.p_str))
  {
    WrStrErrorPos(ErrNum_RsvdSymName, pName);
    return NULL;
  }

  pNeu = CreateSymbolEntry(pName, &DestHandle, Flags);
  if (!pNeu)
    return NULL;

  as_tempres_set_int(&pNeu->SymWert, Wert);
  pNeu->SymWert.AddrSpaceMask = (addrspace != SegNone) ? 1 << addrspace : 0;
  pNeu->SymWert.Flags = Flags;
  pNeu->SymWert.DataSize = eSymbolSizeUnknown;
  pNeu->RefList = NULL;
  pNeu->SymWert.Relocs = NULL;

  if ((MomLocHandle == -1) || (DestHandle != -2))
  {
    EnterSymbol(pNeu, MayChange, DestHandle);
    if (MakeDebug)
      PrintSymTree(pNeu->Tree.Name);
  }
  else
    EnterLocSymbol(pNeu);
  return pNeu;
}

/*!------------------------------------------------------------------------
 * \fn     EnterExtSymbol(const tStrComp *pName, LargeInt Wert, as_addrspace_t addrspace, Boolean MayChange)
 * \brief  create extended symbol
 * \param  pName unexpanded name
 * \param  Wert symbol value
 * \param  AddrSpace symbol's address space
 * \param  MayChange variable or constant?
 * ------------------------------------------------------------------------ */

void EnterExtSymbol(const tStrComp *pName, LargeInt Wert, as_addrspace_t addrspace, Boolean MayChange)
{
  LongInt DestHandle;
  PSymbolEntry pNeu = CreateSymbolEntry(pName, &DestHandle, eSymbolFlag_None);

  if (!pNeu)
    return;

  as_tempres_set_int(&pNeu->SymWert, Wert);  
  pNeu->SymWert.AddrSpaceMask = (addrspace != SegNone) ? 1 << addrspace : 0;
  pNeu->SymWert.Flags = eSymbolFlag_None;
  pNeu->SymWert.DataSize = eSymbolSizeUnknown;
  pNeu->RefList = NULL;
  pNeu->SymWert.Relocs = (PRelocEntry) malloc(sizeof(TRelocEntry));
  pNeu->SymWert.Relocs->Next = NULL;
  pNeu->SymWert.Relocs->Ref = as_strdup(pNeu->Tree.Name);
  pNeu->SymWert.Relocs->Add = True;

  if ((MomLocHandle == -1) || (DestHandle != -2))
  {
    EnterSymbol(pNeu, MayChange, DestHandle);
    if (MakeDebug)
      PrintSymTree(pNeu->Tree.Name);
  }
  else
    EnterLocSymbol(pNeu);
}

/*!------------------------------------------------------------------------
 * \fn     EnterRelSymbol(const tStrComp *pName, LargeInt Wert, as_addrspace_t addrspace, Boolean MayChange)
 * \brief  enter relocatable symbol
 * \param  pName unexpanded name
 * \param  Wert symbol value
 * \param  addrspace symbol's address space
 * \param  MayChange variable or constant?
 * \return * to created entry in tree
 * ------------------------------------------------------------------------ */

PSymbolEntry EnterRelSymbol(const tStrComp *pName, LargeInt Wert, as_addrspace_t addrspace, Boolean MayChange)
{
  LongInt DestHandle;
  PSymbolEntry pNeu = CreateSymbolEntry(pName, &DestHandle, eSymbolFlag_None);

  if (!pNeu)
    return NULL;

  as_tempres_set_int(&pNeu->SymWert, Wert);
  pNeu->SymWert.AddrSpaceMask = (addrspace != SegNone) ? 1 << addrspace : 0;
  pNeu->SymWert.Flags = eSymbolFlag_None;
  pNeu->SymWert.DataSize = eSymbolSizeUnknown;
  pNeu->RefList = NULL;
  pNeu->SymWert.Relocs = (PRelocEntry) malloc(sizeof(TRelocEntry));
  pNeu->SymWert.Relocs->Next = NULL;
  pNeu->SymWert.Relocs->Ref = as_strdup(RelName_SegStart);
  pNeu->SymWert.Relocs->Add = True;

  if ((MomLocHandle == -1) || (DestHandle != -2))
  {
    EnterSymbol(pNeu, MayChange, DestHandle);
    if (MakeDebug)
      PrintSymTree(pNeu->Tree.Name);
  }
  else
    EnterLocSymbol(pNeu);

  return pNeu;
}

/*!------------------------------------------------------------------------
 * \fn     EnterFloatSymbol(const tStrComp *pName, as_float_t Wert, Boolean MayChange)
 * \brief  enter floating point symbol
 * \param  pName unexpanded name
 * \param  Wert symbol value
 * \param  MayChange variable or constant?
 * ------------------------------------------------------------------------ */

void EnterFloatSymbol(const tStrComp *pName, as_float_t Wert, Boolean MayChange)
{
  LongInt DestHandle;
  PSymbolEntry pNeu = CreateSymbolEntry(pName, &DestHandle, eSymbolFlag_None);

  if (!pNeu)
    return;

  as_tempres_set_float(&pNeu->SymWert, Wert);
  pNeu->SymWert.AddrSpaceMask = 0;
  pNeu->SymWert.Flags = eSymbolFlag_None;
  pNeu->SymWert.DataSize = eSymbolSizeUnknown;
  pNeu->RefList = NULL;
  pNeu->SymWert.Relocs = NULL;

  if ((MomLocHandle == -1) || (DestHandle != -2))
  {
    EnterSymbol(pNeu, MayChange, DestHandle);
    if (MakeDebug)
      PrintSymTree(pNeu->Tree.Name);
  }
  else
    EnterLocSymbol(pNeu);
}

/*!------------------------------------------------------------------------
 * \fn     EnterNonZStringSymbolWithFlags(const tStrComp *pName, const as_nonz_dynstr_t *p_value, Boolean MayChange, tSymbolFlags Flags)
 * \brief  enter string symbol
 * \param  pName unexpanded name
 * \param  pValue symbol value
 * \param  MayChange variable or constant?
 * \param  Flags special symbol flags to store
 * ------------------------------------------------------------------------ */

void EnterNonZStringSymbolWithFlags(const tStrComp *pName, const as_nonz_dynstr_t *p_value, Boolean MayChange, tSymbolFlags Flags)
{
  LongInt DestHandle;
  PSymbolEntry pNeu = CreateSymbolEntry(pName, &DestHandle, Flags);

  if (!pNeu)
    return;

  /* TODO: TempRes alloc exact len */
  pNeu->SymWert.Contents.str.p_str = (char*)malloc(p_value->len);
  memcpy(pNeu->SymWert.Contents.str.p_str, p_value->p_str, p_value->len);
  pNeu->SymWert.Contents.str.len =
  pNeu->SymWert.Contents.str.capacity = p_value->len;
  pNeu->SymWert.Typ = TempString;
  pNeu->SymWert.AddrSpaceMask = 0;
  pNeu->SymWert.Flags = Flags;
  pNeu->SymWert.DataSize = eSymbolSizeUnknown;
  pNeu->RefList = NULL;
  pNeu->SymWert.Relocs = NULL;

  if ((MomLocHandle == -1) || (DestHandle != -2))
  {
    EnterSymbol(pNeu, MayChange, DestHandle);
    if (MakeDebug)
      PrintSymTree(pNeu->Tree.Name);
  }
  else
    EnterLocSymbol(pNeu);
}

/*!------------------------------------------------------------------------
 * \fn     EnterStringSymbol(const tStrComp *pName, const char *pValue, Boolean MayChange)
 * \brief  enter string symbol
 * \param  pName unexpanded name
 * \param  pValue symbol value
 * \param  MayChange variable or constant?
 * ------------------------------------------------------------------------ */

void EnterStringSymbol(const tStrComp *pName, const char *pValue, Boolean MayChange)
{
  as_nonz_dynstr_t NonZString;

  as_nonz_dynstr_ini_c_str(&NonZString, pValue);
  EnterNonZStringSymbol(pName, &NonZString, MayChange);
  as_nonz_dynstr_free(&NonZString);
}

/*!------------------------------------------------------------------------
 * \fn     EnterRegSymbol(const struct sStrComp *pName, const tRegDescr *pDescr, tSymbolSize Size, Boolean MayChange, Boolean AddList)
 * \brief  enter register symbol
 * \param  pName unexpanded name
 * \param  pDescr register's numeric value & associated dissector
 * \param  Size register's data size
 * \param  MayChange variable or constant?
 * \param  AddList add value to listing?
 * ------------------------------------------------------------------------ */

void EnterRegSymbol(const struct sStrComp *pName, const tRegDescr *pDescr, tSymbolSize Size, Boolean MayChange, Boolean AddList)
{
  LongInt DestHandle;
  PSymbolEntry pNeu = CreateSymbolEntry(pName, &DestHandle, eSymbolFlag_None);

  if (!pNeu)
    return;

  as_tempres_set_reg(&pNeu->SymWert, pDescr);
  pNeu->SymWert.AddrSpaceMask = 0;
  pNeu->SymWert.Flags = eSymbolFlag_None;
  pNeu->SymWert.DataSize = Size;
  pNeu->RefList = NULL;
  pNeu->SymWert.Relocs = NULL;

  if ((MomLocHandle == -1) || (DestHandle != -2))
  {
    EnterSymbol(pNeu, MayChange, DestHandle);
    if (MakeDebug)
      PrintSymTree(pNeu->Tree.Name);
    RegistersDefined = True;
  }
  else
    EnterLocSymbol(pNeu);

  if (AddList)
  {
    *ListLine = '=';
    pDescr->Dissect(&ListLine[1], STRINGSIZE - 1, pDescr->Reg, Size);
  }
}

/*!------------------------------------------------------------------------
 * \fn     EnterNoneSymbol(const struct sStrComp *p_name)
 * \brief  enter empty (forward) symbol
 * \param  p_name unexpanded name
 * ------------------------------------------------------------------------ */

void EnterNoneSymbol(const struct sStrComp *p_name)
{
  LongInt dest_handle;
  PSymbolEntry p_new;

  if (symbol_name_reserved(p_name->str.p_str))
  {
    WrStrErrorPos(ErrNum_RsvdSymName, p_name);
    return;
  }

  p_new = CreateSymbolEntry(p_name, &dest_handle, eSymbolFlag_None);
  if (!p_new)
    return;

  as_tempres_set_none(&p_new->SymWert);
  p_new->SymWert.AddrSpaceMask = 0;
  p_new->SymWert.Flags = eSymbolFlag_None;
  p_new->SymWert.DataSize = eSymbolSizeUnknown;
  p_new->RefList = NULL;
  p_new->SymWert.Relocs = NULL;

  if ((MomLocHandle == -1) || (dest_handle != -2))
  {
    EnterSymbol(p_new, True, dest_handle);
    if (MakeDebug)
      PrintSymTree(p_new->Tree.Name);
  }
  else
    EnterLocSymbol(p_new);
}

static void AddReference(PSymbolEntry Node)
{
  PCrossRef Lauf, Neu;

  /* Speicher belegen */

  Neu = (PCrossRef) malloc(sizeof(TCrossRef));
  Neu->LineNum = CurrLine;
  Neu->OccNum = 1;
  Neu->Next = NULL;

  /* passende Datei heraussuchen */

  Neu->FileNum = GetFileNum(CurrFileName);

  /* suchen, ob Eintrag schon existiert */

  Lauf = Node->RefList;
  while ((Lauf)
     && ((Lauf->FileNum != Neu->FileNum) || (Lauf->LineNum != Neu->LineNum)))
   Lauf = Lauf->Next;

  /* schon einmal in dieser Datei in dieser Zeile aufgetaucht: nur Zaehler
    rauf: */

  if (Lauf)
  {
    Lauf->OccNum++;
   free(Neu);
  }

  /* ansonsten an Kettenende anhaengen */

  else if (!Node->RefList) Node->RefList = Neu;

  else
  {
    Lauf = Node->RefList;
    while (Lauf->Next)
      Lauf = Lauf->Next;
    Lauf->Next = Neu;
  }
}

static PSymbolEntry FindGlobNode_FNode(const char *Name, TempType SearchType, LongInt Handle)
{
  PSymbolEntry Lauf;

  Lauf = (PSymbolEntry) SearchTree((PTree)FirstSymbol, Name, Handle);

  if (Lauf)
  {
    if ((Lauf->SymWert.Typ & SearchType) || (SearchType == TempAll))
    {
      if (MakeCrossList && DoRefs)
        AddReference(Lauf);
    }
    else
      Lauf = NULL;
  }

  return Lauf;
}

static PSymbolEntry FindGlobNode(const char *p_name, TempType SearchType, LongInt DestSection)
{
  PSaveSection Lauf;
  PSymbolEntry Result = NULL;

#if 0
  if (SectionStack
   && (PassNo <= MaxSymPass)
   && search_forward_symbol(SectionStack->LocSyms, p_name))
     DestSection = MomSectionHandle;
#endif

  if (DestSection == -2)
  {
    Result = FindGlobNode_FNode(p_name, SearchType, MomSectionHandle);
    if (Result)
      return Result;
    Lauf = SectionStack;
    while (Lauf)
    {
      Result = FindGlobNode_FNode(p_name, SearchType, Lauf->Handle);
      if (Result)
        break;
      Lauf = Lauf->Next;
    }
  }
  else
    Result = FindGlobNode_FNode(p_name, SearchType, DestSection);

  return Result;
}

static PSymbolEntry FindLocNode_FNode(const char *Name, TempType SearchType, LongInt Handle)
{
  PSymbolEntry Lauf;

  Lauf = (PSymbolEntry) SearchTree((PTree)FirstLocSymbol, Name, Handle);

  if (Lauf)
  {
    if ((SearchType != TempAll) && !(Lauf->SymWert.Typ & SearchType))
      Lauf = NULL;
  }

  return Lauf;
}

static PSymbolEntry FindLocNode(const char *p_name, TempType SearchType)
{
  PLocHandle RunLocHandle;
  PSymbolEntry Result = NULL;

  Result = FindLocNode_FNode(p_name, SearchType, MomLocHandle);
  if (Result)
    return Result;

  RunLocHandle = FirstLocHandle;
  while ((RunLocHandle) && (RunLocHandle->Cont != -1))
  {
    Result = FindLocNode_FNode(p_name, SearchType, RunLocHandle->Cont);
    if (Result)
      break;
    RunLocHandle = RunLocHandle->Next;
  }

  return Result;
}

/*!------------------------------------------------------------------------
 * \fn     FindNode(const tStrComp *p_exp_name, TempType SearchType, Boolean SearchLocal, lookup_symbol_error_t *p_lookup_error)
 * \brief  find node in global and/or local symbol table
 * \param  p_exp_name name of symbol to search
 * \param  SearchType data type to search for
 * \param  SearchLocal search in local table as well
 * \param  p_lookup_error may return e_lookup_error_getsymsection if NULL due to invalid section spec
 * \return * to node or NULL
 * ------------------------------------------------------------------------ */

static PSymbolEntry FindNode(const tStrComp *p_exp_name, TempType SearchType, Boolean SearchLocal, lookup_symbol_error_t *p_lookup_error)
{
  String name;
  tStrComp name_comp;
  LongInt DestSection = -1;
  PSymbolEntry p_result = NULL;

  StrCompMkTemp(&name_comp, name, sizeof(name));
  StrCompCopy(&name_comp, p_exp_name);
  ChkTmp3(name_comp.str.p_str, e_symbol_source_none);
  if (p_lookup_error)
    *p_lookup_error = e_lookup_error_none;

  if (!GetSymSection(&name_comp, &DestSection, p_exp_name))
  {
    if (p_lookup_error)
      *p_lookup_error = e_lookup_error_getsymsection;
    return NULL;
  }
  if (DestSection != -2)
    SearchLocal = False;

  if (SearchLocal && (MomLocHandle != -1))
    p_result = FindLocNode(name_comp.str.p_str, SearchType);
  if (!p_result)
    p_result = FindGlobNode(name_comp.str.p_str, SearchType, DestSection);
  if (!p_result && p_lookup_error)
    *p_lookup_error = e_lookup_error_notfound;
  return p_result;
}

/*!------------------------------------------------------------------------
 * \fn     ExpandAndFindNode(const struct sStrComp *pName, TempType SearchType, Boolean SearchLocal, expand_chk_t chk, lookup_symbol_error_t *p_lookup_error)
 * \brief  expand, optionally check and find node in global and/or local symbol table
 * \param  pComp name of symbol to expand & search
 * \param  SearchType data type to search for
 * \param  SearchLocal search in local table as well
 * \param  chk preliminary checks to perform
 * \param  p_lookup_error may return != e_lookup_error_none if NULL due to symbol syntax error
 * \return * to node or NULL
 * ------------------------------------------------------------------------ */

PSymbolEntry ExpandAndFindNodeRet(const struct sStrComp *pName, struct sStrComp *p_exp_name, TempType SearchType, Boolean SearchLocal, expand_chk_t chk, lookup_symbol_error_t *p_lookup_error)
{
  const tStrComp *p_exp_name_ret;
  const char *pKlPos;

  if (p_lookup_error) *p_lookup_error = e_lookup_error_none;
  p_exp_name_ret = ExpandStrSymbol(p_exp_name, pName, !CaseSensitive);
  if (!p_exp_name_ret)
  {
    if (p_lookup_error) *p_lookup_error = e_lookup_error_expand;
    return NULL;
  }

  if (chk != e_expand_chk_none)
  {
    /* just [...] without symbol name itself is not valid */

    pKlPos = strchr(p_exp_name_ret->str.p_str, '[');
    if ((pKlPos == p_exp_name_ret->str.p_str) || (ChkSymbNameUpTo(p_exp_name->str.p_str, pKlPos) != pKlPos))
    {
      if (p_lookup_error) *p_lookup_error = e_lookup_error_namecheck;
      return NULL;
    }
  }

  return FindNode(p_exp_name_ret, SearchType, SearchLocal, p_lookup_error);
}

PSymbolEntry ExpandAndFindNode(const struct sStrComp *pName, TempType SearchType, Boolean SearchLocal, expand_chk_t chk, lookup_symbol_error_t *p_lookup_error)
{
  String exp_name_buf;
  tStrComp exp_name;

  StrCompMkTemp(&exp_name, exp_name_buf, sizeof(exp_name_buf));
  return ExpandAndFindNodeRet(pName, &exp_name, SearchType, SearchLocal, chk, p_lookup_error);
}

/**
void SetSymbolType(const tStrComp *pName, Byte NTyp)
{
  PSymbolEntry Lauf;
  Boolean HRef;

  HRef = DoRefs;
  DoRefs = False;
  Lauf = ExpandAndFindNode(pName, TempInt, True, expand_chk_none, NULL);
  if (Lauf)
    Lauf->SymType = NTyp;
  DoRefs = HRef;
}
**/

void LookupSymbolRet(const struct sStrComp *pComp, struct sStrComp *p_exp_name, TempResult *pValue, Boolean WantRelocs, TempType ReqType,
                  as_eval_flags_t eval_flags, as_symbol_entry_flags_t *p_symbol_entry_flags)
{
  lookup_symbol_error_t lookup_error;
  PSymbolEntry pEntry = ExpandAndFindNodeRet(pComp, p_exp_name, ReqType, True, e_expand_chk_upto, &lookup_error);

  if (pEntry)
  {
    /* A pure forward definition is handled like a 'not found' at this place.  Only
       set the flag that the entry was used: */

    if (pEntry->SymWert.Typ == TempNone)
    {
      set_symbol_entry_flag(pEntry, used, True);
      lookup_error = e_lookup_error_notfound;
      pEntry = NULL;
    }

    /* Was it requested to treat yet-not-defined symbols as unknown? */

    else if (!get_symbol_entry_flag(pEntry, defined) && (eval_flags & e_eval_flag_undefined_is_unknown))
    {
      lookup_error = e_lookup_error_notfound;
      pEntry = NULL;
    }
  }

  if (pEntry)
  {
    as_tempres_copy_value(pValue, &pEntry->SymWert);
    if (p_symbol_entry_flags)
      *p_symbol_entry_flags = (as_symbol_entry_flags_t)pEntry->flags;
    if (pValue->Typ != TempNone)
    {
      if (WantRelocs)
        pValue->Relocs = DupRelocs(pEntry->SymWert.Relocs);
      pValue->Flags = pEntry->SymWert.Flags;
    }
    pValue->AddrSpaceMask = pEntry->SymWert.AddrSpaceMask;
    if ((pEntry->SymWert.DataSize != eSymbolSizeUnknown) && (pValue->DataSize == eSymbolSizeUnknown))
      pValue->DataSize = pEntry->SymWert.DataSize;
    if (!get_symbol_entry_flag(pEntry, defined))
    {
      if (Repass)
        pValue->Flags |= eSymbolFlag_Questionable;
      pValue->Flags |= eSymbolFlag_UsesForwards;
    }

    /* If this is part of an IFDEF query, accesses to the symbol shall not set the
       'used' flag: */

    if (!(eval_flags & e_eval_flag_undefined_is_unknown))
      set_symbol_entry_flag(pEntry, used, True);
  }

  else switch (lookup_error)
  {
    case e_lookup_error_namecheck:
      WrStrErrorPos(ErrNum_InvSymName, pComp);
      as_tempres_set_none(pValue);
      break;

    case e_lookup_error_notfound:
      if ((PassNo <= MaxSymPass) || (eval_flags & e_eval_flag_undefined_is_unknown))
      {
        as_tempres_set_int(pValue, EProgCounter());
        if (!(eval_flags & e_eval_flag_undefined_is_unknown))
        {
          Repass = True;
          if (MsgIfRepass && (PassNo >= PassNoForMessage))
            WrStrErrorPos(ErrNum_RepassUnknown, pComp);
        }
        pValue->Flags |= eSymbolFlag_FirstPassUnknown;
      }
      else
        WrStrErrorPos(ErrNum_SymbolUndef, pComp);
      break;

    default:
      as_tempres_set_none(pValue);
  }
}

void LookupSymbol(const struct sStrComp *pComp, TempResult *pValue, Boolean WantRelocs, TempType ReqType,
                  as_eval_flags_t eval_flags, as_symbol_entry_flags_t *p_symbol_entry_flags)
{
  String exp_name_buf;
  tStrComp exp_name;

  StrCompMkTemp(&exp_name, exp_name_buf, sizeof(exp_name_buf));
  LookupSymbolRet(pComp, &exp_name, pValue, WantRelocs, ReqType, eval_flags, p_symbol_entry_flags);
}
/*!------------------------------------------------------------------------
 * \fn     SetSymbolOrStructElemSize(const struct sStrComp *pName, tSymbolSize Size)
 * \brief  set (integer) data size associated with a symbol
 * \param  pName unexpanded name of symbol
 * \param  Size operand size to set
 * ------------------------------------------------------------------------ */

void SetSymbolOrStructElemSize(const struct sStrComp *pName, tSymbolSize Size)
{
  if (pInnermostNamedStruct)
    SetStructElemSize(pInnermostNamedStruct->StructRec, pName, Size);
  else
  {
    PSymbolEntry pEntry;
    Boolean HRef;

    HRef = DoRefs;
    DoRefs = False;
    pEntry = ExpandAndFindNode(pName, TempInt, True, e_expand_chk_none, NULL);
    if (pEntry)
      pEntry->SymWert.DataSize = Size;
    DoRefs = HRef;
  }
}

/*!------------------------------------------------------------------------
 * \fn     IsSymbolDefined(const struct sStrComp *pName)
 * \brief  check whether symbol has been defined so far
 * \param  pName unexpanded symbol name
 * \return true if symbol exists and has been defined so far
 * ------------------------------------------------------------------------ */

Boolean IsSymbolDefined(const struct sStrComp *pName)
{
#if 1
  as_eval_cb_data_t cb_data;
  TempResult result;
  Boolean ret;

  as_tempres_ini(&result);
  as_eval_cb_data_ini(&cb_data, NULL);
  EvalStrExpressionWithCallback(pName, &result, e_eval_flag_undefined_is_unknown, &cb_data);
  ret = (result.Typ != TempNone)
     && (!(result.Flags & eSymbolFlag_FirstPassUnknown));
  as_tempres_free(&result);
  return ret;
#else
  lookup_symbol_error_t error_on_find;
  PSymbolEntry pEntry = ExpandAndFindNode(pName, TempAll, True, e_expand_chk_upto, &error_on_find);
  if (error_on_find)
    WrStrErrorPos(ErrNum_InvSymName, pName);

  return pEntry && get_symbol_entry_flag(pEntry, defined);
#endif
}

/*!------------------------------------------------------------------------
 * \fn     is_symbol_existing(const struct sStrComp *p_name)
 * \brief  check whether symbol of given name exists
 * \param  p_name name of symbol
 * \return true if existing
 * ------------------------------------------------------------------------ */

Boolean is_symbol_existing(const struct sStrComp *p_name)
{
  lookup_symbol_error_t error_on_find;
  PSymbolEntry p_entry = ExpandAndFindNode(p_name, TempAll, True, e_expand_chk_upto, &error_on_find);
  if (error_on_find == e_lookup_error_namecheck)
    WrStrErrorPos(ErrNum_InvSymName, p_name);

  return !!p_entry;
}

/*!------------------------------------------------------------------------
 * \fn     update_and_get_used(TSymbolEntry *p_entry)
 * \brief  retrieve the 'used flag of a node, an possibly update it before
 * \param  p_entry symbol in question
 * \return True if used
 * ------------------------------------------------------------------------ */

static Boolean update_and_get_used(TSymbolEntry *p_entry)
{
  if (!get_symbol_entry_flag(p_entry, used))
    set_symbol_entry_flag(p_entry, used, as_forward_ref_search_and_mark(p_entry->Tree.Name, p_entry->Tree.Attribute));
  return get_symbol_entry_flag(p_entry, used);
}

/*!------------------------------------------------------------------------
 * \fn     IsSymbolUsed(const struct sStrComp *pName)
 * \brief  check whether symbol nas been used so far
 * \param  pName unexpanded symbol name
 * \return true if symbol exists and has been used
 * ------------------------------------------------------------------------ */

Boolean IsSymbolUsed(const struct sStrComp *pName)
{
  lookup_symbol_error_t lookup_error;
  PSymbolEntry pEntry = ExpandAndFindNode(pName, TempAll, True, e_expand_chk_upto, &lookup_error);
  if (lookup_error == e_lookup_error_namecheck)
    WrStrErrorPos(ErrNum_InvSymName, pName);

  return pEntry && update_and_get_used(pEntry);
}

/*!------------------------------------------------------------------------
 * \fn     GetSymbolType(const struct sStrComp *pName)
 * \brief  retrieve type (int/float/string) of symbol
 * \param  pName unexpanded name
 * \return type or -1 if non-existent
 * ------------------------------------------------------------------------ */

as_addrspace_t addrspace_from_mask(unsigned mask)
{
  as_addrspace_t space;

  for (space = SegCode; space < SegCount; space++)
    if (mask & (1 << space))
      return space;
  return SegNone;
}

Integer GetSymbolType(const struct sStrComp *pName)
{
  PSymbolEntry pEntry = ExpandAndFindNode(pName, TempAll, True, e_expand_chk_none, NULL);

  if (!pEntry)
    return -1;
  else if (pEntry->SymWert.Typ == TempReg)
    return 0x80;
  else
    return addrspace_from_mask(pEntry->SymWert.AddrSpaceMask);
}

typedef struct
{
  int Width, cwidth;
  LongInt Sum, USum;
  as_dynstr_t Zeilenrest;
  int ZeilenrestLen,
      ZeilenrestVisibleLen;
  as_dynstr_t s1, sh;
} TListContext;

static void PrintSymbolList_AddOut(char *s, TListContext *pContext)
{
  int AddVisibleLen = visible_strlen(s),
      AddLen = strlen(s);

  if (AddVisibleLen + pContext->ZeilenrestVisibleLen > pContext->Width)
  {
    pContext->Zeilenrest.p_str[pContext->ZeilenrestLen - 1] = '\0';
    WrLstLine(pContext->Zeilenrest.p_str);
    as_dynstr_copy_c_str(&pContext->Zeilenrest, s);
    pContext->ZeilenrestLen = AddLen;
    pContext->ZeilenrestVisibleLen = AddVisibleLen;
  }
  else
  {
    as_dynstr_append_c_str(&pContext->Zeilenrest, s);
    pContext->ZeilenrestLen += AddLen;
    pContext->ZeilenrestVisibleLen += AddVisibleLen;
  }
}

static void PrintSymbolList_PNode(PTree Tree, void *pData)
{
  PSymbolEntry Node = (PSymbolEntry) Tree;

  if (Node->SymWert.Typ != TempReg)
  {
    TListContext *pContext = (TListContext*) pData;
    int l1, nBlanks;
    const TempResult *pValue = &Node->SymWert;
    Boolean symbol_used;

    if ((pValue->Typ == TempInt) && DissectBit && (pValue->AddrSpaceMask & (1 << SegBData)))
      DissectBit(pContext->s1.p_str, pContext->s1.capacity, pValue->Contents.Int);
    else
      StrSym(pValue, False, &pContext->s1, ListRadixBase);

    symbol_used = update_and_get_used(Node);
    as_sdprintf(&pContext->sh, "%c%s", symbol_used ? ' ' : '*', Tree->Name);
    if (Tree->Attribute != -1)
      as_sdprcatf(&pContext->sh, "[%s]", GetSectionName(Tree->Attribute));
    as_sdprcatf(&pContext->sh, " : ");
    l1 = (strlen(pContext->s1.p_str) + visible_strlen(pContext->sh.p_str) + 4);
    for (nBlanks = pContext->cwidth - 1 - l1; nBlanks < 0; nBlanks += pContext->cwidth);
    as_sdprcatf(&pContext->sh, "%s%s %c | ", Blanks(nBlanks), pContext->s1.p_str, SegShorts[addrspace_from_mask(pValue->AddrSpaceMask)]);
    PrintSymbolList_AddOut(pContext->sh.p_str, pContext);
    pContext->Sum++;
    if (!symbol_used)
      pContext->USum++;
  }
}

void PrintSymbolList(void)
{
  int ActPageWidth;
  TListContext Context;

  as_dynstr_ini(&Context.Zeilenrest, STRINGSIZE);
  as_dynstr_ini(&Context.s1, STRINGSIZE);
  as_dynstr_ini(&Context.sh, STRINGSIZE);
  Context.Width = (PageWidth == 0) ? 80 : PageWidth;
  NewPage(ChapDepth, True);
  WrLstLine(getmessage(Num_ListSymListHead1));
  WrLstLine(getmessage(Num_ListSymListHead2));
  WrLstLine("");

  Context.ZeilenrestLen =
  Context.ZeilenrestVisibleLen = 0;
  Context.Sum = Context.USum = 0;
  ActPageWidth = (PageWidth == 0) ? 80 : PageWidth;
  Context.cwidth = ActPageWidth >> 1;
  IterTree((PTree)FirstSymbol, PrintSymbolList_PNode, &Context);
  if (Context.Zeilenrest.p_str[0] != '\0')
  {
    Context.Zeilenrest.p_str[strlen(Context.Zeilenrest.p_str) - 1] = '\0';
    WrLstLine(Context.Zeilenrest.p_str);
  }
  WrLstLine("");
  as_sdprintf(&Context.Zeilenrest, "%7lu%s",
              (unsigned long)Context.Sum,
              getmessage((Context.Sum == 1) ? Num_ListSymSumMsg : Num_ListSymSumsMsg));
  WrLstLine(Context.Zeilenrest.p_str);
  as_sdprintf(&Context.Zeilenrest, "%7lu%s",
              (unsigned long)Context.USum,
              getmessage((Context.USum == 1) ? Num_ListUSymSumMsg : Num_ListUSymSumsMsg));
  WrLstLine(Context.Zeilenrest.p_str);
  WrLstLine("");
  as_dynstr_free(&Context.s1);
  as_dynstr_free(&Context.sh);
  as_dynstr_free(&Context.Zeilenrest);
}

typedef struct
{
  FILE *f;
  Boolean HWritten;
  as_addrspace_t Space;
  as_dynstr_t s;
} TDebContext;

static Boolean match_space_mask(unsigned mask, as_addrspace_t space)
{
  if (SegNone == space)
    return !mask;
  else
    return !!((mask >> space) & 1);
}

static void PrintDebSymbols_PNode(PTree Tree, void *pData)
{
  PSymbolEntry Node = (PSymbolEntry) Tree;
  TDebContext *DebContext = (TDebContext*) pData;
  int l1;

  if (!match_space_mask(Node->SymWert.AddrSpaceMask, DebContext->Space))
    return;

  if (!DebContext->HWritten)
  {
    fprintf(DebContext->f, "\n"); ChkIO(ErrNum_FileWriteError);
    fprintf(DebContext->f, "Symbols in Segment %s\n", SegNames[DebContext->Space]); ChkIO(ErrNum_FileWriteError);
    DebContext->HWritten = True;
  }

  fprintf(DebContext->f, "%s", Node->Tree.Name); ChkIO(ErrNum_FileWriteError);
  l1 = strlen(Node->Tree.Name);
  if (Node->Tree.Attribute != -1)
  {
    as_sdprintf(&DebContext->s, "[%d]", (int)Node->Tree.Attribute);
    fprintf(DebContext->f, "%s", DebContext->s.p_str); ChkIO(ErrNum_FileWriteError);
    l1 += strlen(DebContext->s.p_str);
  }
  fprintf(DebContext->f, "%s ", Blanks(37 - l1)); ChkIO(ErrNum_FileWriteError);
  switch (Node->SymWert.Typ)
  {
    case TempInt:
      fprintf(DebContext->f, "Int    ");
      break;
    case TempFloat:
      fprintf(DebContext->f, "Float  ");
      break;
    case TempString:
      fprintf(DebContext->f, "String ");
      break;
    default:
      break;
  }
  ChkIO(ErrNum_FileWriteError);
  if (Node->SymWert.Typ == TempString)
  {
    errno = 0;
    l1 = fstrlenprint(DebContext->f, Node->SymWert.Contents.str.p_str, Node->SymWert.Contents.str.len);
    ChkIO(ErrNum_FileWriteError);
  }
  else
  {
    StrSym(&Node->SymWert, False, &DebContext->s, 16);
    l1 = strlen(DebContext->s.p_str);
    fprintf(DebContext->f, "%s", DebContext->s.p_str); ChkIO(ErrNum_FileWriteError);
  }
  fprintf(DebContext->f, "%s %-3d %d %d\n", Blanks(25 - l1), Node->SymWert.DataSize,
          update_and_get_used(Node), get_symbol_entry_flag(Node, changeable));
  ChkIO(ErrNum_FileWriteError);
}

void PrintDebSymbols(FILE *f)
{
  TDebContext DebContext;

  as_dynstr_ini(&DebContext.s, 256);
  DebContext.f = f;
  for (DebContext.Space = SegNone; DebContext.Space < SegCount; DebContext.Space++)
  {
    DebContext.HWritten = False;
    IterTree((PTree)FirstSymbol, PrintDebSymbols_PNode, &DebContext);
  }
  as_dynstr_free(&DebContext.s);
}

typedef struct
{
  FILE *f;
  LongInt Handle;
} TNoISymContext;

static void PrNoISection(PTree Tree, void *pData)
{
  PSymbolEntry Node = (PSymbolEntry)Tree;
  TNoISymContext *pContext = (TNoISymContext*) pData;

  if ((Node->SymWert.AddrSpaceMask & NoICEMask) && (Node->Tree.Attribute == pContext->Handle) && (Node->SymWert.Typ == TempInt))
  {
    String buf;
    as_snprintf(buf, sizeof(buf), "DEFINE %s 0x%lllx\n", Node->Tree.Name, Node->SymWert.Contents.Int);
    fputs(buf, pContext->f); ChkIO(ErrNum_FileWriteError);
  }
}

void PrintNoISymbols(FILE *f)
{
  PCToken CurrSection;
  TNoISymContext Context;

  Context.f = f;
  Context.Handle = -1;
  IterTree((PTree)FirstSymbol, PrNoISection, &Context);
  Context.Handle++;
  for (CurrSection = FirstSection; CurrSection; CurrSection = CurrSection->Next)
    if (ChunkSum(&CurrSection->Usage) > 0)
    {
      String buf;
      as_snprintf(buf, sizeof(buf), "FUNCTION %s %llld\n", CurrSection->Name, ChunkMin(&CurrSection->Usage));
      fputs(buf, f); ChkIO(ErrNum_FileWriteError);
      IterTree((PTree)FirstSymbol, PrNoISection, &Context);
      Context.Handle++;
      as_snprintf(buf, sizeof(buf), "}FUNC %llld\n", ChunkMax(&CurrSection->Usage));
      fputs(buf, f); ChkIO(ErrNum_FileWriteError);
    }
}

void PrintSymbolTree(void)
{
  DumpTree(Debug, (PTree)FirstSymbol);
}

static void ClearSymbolList_ClearNode(PTree Node, void *pData)
{
  PSymbolEntry SymbolEntry = (PSymbolEntry) Node;
  UNUSED(pData);

  FreeSymbolEntry(&SymbolEntry, FALSE);
}

void ClearSymbolList(void)
{
  PTree TreeRoot;

  TreeRoot = &(FirstSymbol->Tree);
  FirstSymbol = NULL;
  DestroyTree(&TreeRoot, ClearSymbolList_ClearNode, NULL);
  TreeRoot = &(FirstLocSymbol->Tree);
  FirstLocSymbol = NULL;
  DestroyTree(&TreeRoot, ClearSymbolList_ClearNode, NULL);
}

/*-------------------------------------------------------------------------*/
/* Stack-Verwaltung */

static PSymbolStack find_stack(const char *p_name, PSymbolStack *pp_stack_prev, Boolean allow_create)
{
  PSymbolStack p_stack_run;

  p_stack_run = FirstStack;
  *pp_stack_prev = NULL;
  while (p_stack_run && (strcmp(p_stack_run->Name, p_name) < 0))
  {
    *pp_stack_prev = p_stack_run;
    p_stack_run = p_stack_run->Next;
  }

  if (!p_stack_run || (strcmp(p_stack_run->Name, p_name) > 0))
  {
    PSymbolStack p_stack_new;

    if (!allow_create)
      return NULL;

    p_stack_new = (PSymbolStack) malloc(sizeof(TSymbolStack));
    p_stack_new->Name = as_strdup(p_name);
    p_stack_new->Contents = NULL;
    p_stack_new->Next = p_stack_run;
    if (!*pp_stack_prev)
      FirstStack = p_stack_new;
    else
      (*pp_stack_prev)->Next = p_stack_new;
    return p_stack_new;
  }
  else
    return p_stack_run;
}

Boolean PushSymbol(const tStrComp *pSymName, const tStrComp *pStackName)
{
  PSymbolEntry pSrc;
  PSymbolStack LStack, PStack;
  PSymbolStackEntry Elem;
  tStrComp exp_sym_name, exp_stack_name;
  const tStrComp *p_exp_sym_name, *p_exp_stack_name;
  String exp_sym_name_buf, exp_stack_name_buf;

  StrCompMkTemp(&exp_sym_name, exp_sym_name_buf, sizeof(exp_sym_name_buf));
  p_exp_sym_name = ExpandStrSymbol(&exp_sym_name, pSymName, !CaseSensitive);
  if (!p_exp_sym_name)
    return False;

  pSrc = FindNode(p_exp_sym_name, TempAll, False, NULL);
  if (!pSrc)
  {
    WrStrErrorPos(ErrNum_SymbolUndef, pSymName);
    return False;
  }

  StrCompMkTemp(&exp_stack_name, exp_stack_name_buf, sizeof(exp_stack_name_buf));
  if (*pStackName->str.p_str)
  {
    p_exp_stack_name = ExpandStrSymbol(&exp_stack_name, pStackName, !CaseSensitive);
    if (!p_exp_stack_name)
      return False;
  }
  else
  {
    strmaxcpy(exp_stack_name.str.p_str, DefStackName, exp_stack_name.str.capacity);
    p_exp_stack_name = &exp_stack_name;
  }
  if (!ChkSymbName(p_exp_stack_name->str.p_str))
  {
    WrStrErrorPos(ErrNum_InvSymName, pStackName);
    return False;
  }

  LStack = find_stack(p_exp_stack_name->str.p_str, &PStack, True);
  Elem = (PSymbolStackEntry) malloc(sizeof(TSymbolStackEntry));
  Elem->Next = LStack->Contents;
  Elem->Contents = pSrc->SymWert;
  LStack->Contents = Elem;

  return True;
}

Boolean PopSymbol(const tStrComp *pSymName, const tStrComp *pStackName)
{
  PSymbolEntry pDest;
  PSymbolStack LStack, PStack;
  PSymbolStackEntry Elem;
  tStrComp exp_sym_name, exp_stack_name;
  const tStrComp *p_exp_sym_name, *p_exp_stack_name;
  String exp_sym_name_buf, exp_stack_name_buf;

  StrCompMkTemp(&exp_sym_name, exp_sym_name_buf, sizeof(exp_sym_name_buf));
  p_exp_sym_name = ExpandStrSymbol(&exp_sym_name, pSymName, !CaseSensitive);
  if (!p_exp_sym_name)
    return False;

  pDest = FindNode(p_exp_sym_name, TempAll, False, NULL);
  if (!pDest)
  {
    WrStrErrorPos(ErrNum_SymbolUndef, pSymName);
    return False;
  }

  StrCompMkTemp(&exp_stack_name, exp_stack_name_buf, sizeof(exp_stack_name_buf));
  if (*pStackName->str.p_str)
  {
    p_exp_stack_name = ExpandStrSymbol(&exp_stack_name, pStackName, !CaseSensitive);
    if (!p_exp_stack_name)
      return False;
  }
  else
  {
    strmaxcpy(exp_stack_name.str.p_str, DefStackName, exp_stack_name.str.capacity);
    p_exp_stack_name = &exp_stack_name;
  }
  if (!ChkSymbName(p_exp_stack_name->str.p_str))
  {
    WrStrErrorPos(ErrNum_InvSymName, pStackName);
    return False;
  }

  LStack = find_stack(p_exp_stack_name->str.p_str, &PStack, False);
  if (!LStack)
  {
    WrStrErrorPos(ErrNum_StackEmpty, pStackName);
    return False;
  }

  Elem = LStack->Contents;
  pDest->SymWert = Elem->Contents;
  LStack->Contents = Elem->Next;
  if (!LStack->Contents)
  {
    if (!PStack)
      FirstStack = LStack->Next;
    else
      PStack->Next = LStack->Next;
    free(LStack->Name);
    free(LStack);
  }
  free(Elem);

  return True;
}

void ClearStacks(void)
{
  PSymbolStack Act;
  PSymbolStackEntry Elem;
  int z;
  String s;

  while (FirstStack)
  {
    z = 0;
    Act = FirstStack;
    while (Act->Contents)
    {
      Elem = Act->Contents;
      Act->Contents = Elem->Next;
      free(Elem);
      z++;
    }
    as_snprintf(s, sizeof(s), "%s(%d)", Act->Name, z);
    WrXError(ErrNum_StackNotEmpty, s);
    free(Act->Name);
    FirstStack = Act->Next;
    free(Act);
  }
}

/*-------------------------------------------------------------------------*/
/* Funktionsverwaltung */

void EnterFunction(const tStrComp *pComp, const char *FDefinition, Byte NewCnt, StringList *p_arg_list)
{
  PFunction Neu;
  String FName_N;
  const char *pFName;

  if (!CaseSensitive)
  {
    strmaxcpy(FName_N, pComp->str.p_str, STRINGSIZE);
    NLS_UpString(FName_N);
    pFName = FName_N;
  }
  else
     pFName = pComp->str.p_str;

  if (!ChkSymbName(pFName))
  {
    WrStrErrorPos(ErrNum_InvSymName, pComp);
    ClearStringList(p_arg_list);
    return;
  }

  if (FindFunction(pFName))
  {
    if (PassNo == 1)
      WrStrErrorPos(ErrNum_DoubleDef, pComp);
    ClearStringList(p_arg_list);
    return;
  }

  Neu = (PFunction) malloc(sizeof(TFunction));
  Neu->Next = FirstFunction;
  Neu->ArguCnt = NewCnt;
  Neu->Name = as_strdup(pFName);
  Neu->Definition = as_strdup(FDefinition);
  Neu->p_arg_list = *p_arg_list; *p_arg_list = NULL;
  FirstFunction = Neu;
}

PFunction FindFunction(const char *Name)
{
  PFunction Lauf = FirstFunction;
  String Name_N;

  if (!CaseSensitive)
  {
    strmaxcpy(Name_N, Name, STRINGSIZE);
    NLS_UpString(Name_N);
    Name = Name_N;
  }

  while (Lauf && (strcmp(Lauf->Name, Name)))
    Lauf = Lauf->Next;
  return Lauf;
}

void PrintFunctionList(void)
{
  PFunction Lauf;
  String OneS;
  Boolean cnt;

  if (!FirstFunction)
    return;

  NewPage(ChapDepth, True);
  WrLstLine(getmessage(Num_ListFuncListHead1));
  WrLstLine(getmessage(Num_ListFuncListHead2));
  WrLstLine("");

  OneS[0] = '\0';
  Lauf = FirstFunction;
  cnt = False;
  while (Lauf)
  {
    strmaxcat(OneS, Lauf->Name, STRINGSIZE);
    if (strlen(Lauf->Name) < 37)
      strmaxcat(OneS, Blanks(37-strlen(Lauf->Name)), STRINGSIZE);
    if (!cnt) strmaxcat(OneS, " | ", STRINGSIZE);
    else
    {
      WrLstLine(OneS);
      OneS[0] = '\0';
    }
    cnt = !cnt;
    Lauf = Lauf->Next;
  }
  if (cnt)
  {
    OneS[strlen(OneS)-1] = '\0';
    WrLstLine(OneS);
  }
  WrLstLine("");
}

void ClearFunctionList(void)
{
  PFunction Lauf;

  while (FirstFunction)
  {
    Lauf = FirstFunction->Next;
    free(FirstFunction->Name);
    free(FirstFunction->Definition);
    ClearStringList(&FirstFunction->p_arg_list);
    free(FirstFunction);
    FirstFunction = Lauf;
  }
}

/*-------------------------------------------------------------------------*/

static void ResetSymbolDefines_ResetNode(PTree Node, void *pData)
{
  PSymbolEntry SymbolEntry = (PSymbolEntry) Node;
  UNUSED(pData);

  set_symbol_entry_flag(SymbolEntry, defined, False);
  set_symbol_entry_flag(SymbolEntry, used, False);
}

void ResetSymbolDefines(void)
{
  IterTree(&(FirstSymbol->Tree), ResetSymbolDefines_ResetNode, NULL);
  IterTree(&(FirstLocSymbol->Tree), ResetSymbolDefines_ResetNode, NULL);
}

void SetFlag(Boolean *Flag, const char *Name, Boolean Wert)
{
  tStrComp TmpComp;

  *Flag = Wert;
  StrCompMkTemp(&TmpComp, (char*)Name, 0);
  PushLocHandle(-1);
  EnterIntSymbol(&TmpComp, *Flag ? 1 : 0, SegNone, True);
  PopLocHandle();
}

void AddDefSymbol(char *Name, TempResult *Value)
{
  PDefSymbol Neu;

  Neu = FirstDefSymbol;
  while (Neu)
  {
    if (!strcmp(Neu->SymName, Name))
      return;
    Neu = Neu->Next;
  }

  Neu = (PDefSymbol) malloc(sizeof(TDefSymbol));
  Neu->Next = FirstDefSymbol;
  Neu->SymName = as_strdup(Name);
  Neu->Wert = (*Value);
  FirstDefSymbol = Neu;
}

void RemoveDefSymbol(char *Name)
{
  PDefSymbol Save, Lauf;

  if (!FirstDefSymbol)
    return;

  if (!strcmp(FirstDefSymbol->SymName, Name))
  {
    Save = FirstDefSymbol;
    FirstDefSymbol = FirstDefSymbol->Next;
  }
  else
  {
    Lauf = FirstDefSymbol;
    while ((Lauf->Next) && (strcmp(Lauf->Next->SymName, Name)))
      Lauf = Lauf->Next;
    if (!Lauf->Next)
      return;
    Save = Lauf->Next;
    Lauf->Next = Lauf->Next->Next;
  }
  free(Save->SymName);
  free(Save);
}

void CopyDefSymbols(void)
{
  PDefSymbol Lauf;
  tStrComp TmpComp;

  Lauf = FirstDefSymbol;
  while (Lauf)
  {
    StrCompMkTemp(&TmpComp, Lauf->SymName, 0);
    switch (Lauf->Wert.Typ)
    {
      case TempInt:
        EnterIntSymbol(&TmpComp, Lauf->Wert.Contents.Int, SegNone, True);
        break;
      case TempFloat:
        EnterFloatSymbol(&TmpComp, Lauf->Wert.Contents.Float, True);
        break;
      case TempString:
      {
        EnterNonZStringSymbol(&TmpComp, &Lauf->Wert.Contents.str, True);
        break;
      }
      default:
        break;
    }
    Lauf = Lauf->Next;
  }
}

const TempResult *FindDefSymbol(const char *pName)
{
  PDefSymbol pRun;

  for (pRun = FirstDefSymbol; pRun; pRun = pRun->Next)
    if (!strcmp(pName, pRun->SymName))
      return &pRun->Wert;
  return NULL;
}

void PrintSymbolDepth(void)
{
  LongInt TreeMin, TreeMax;

  GetTreeDepth(&(FirstSymbol->Tree), &TreeMin, &TreeMax);
  fprintf(Debug, " MinTree %ld\n", (long)TreeMin);
  fprintf(Debug, " MaxTree %ld\n", (long)TreeMax);
}

LongInt GetSectionHandle(const char *SName, Boolean AddEmpt, LongInt Parent)
{
  PCToken Lauf, Prev;
  LongInt z;

  Lauf = FirstSection;
  Prev = NULL;
  z = 0;
  while (Lauf && (strcmp(Lauf->Name, SName) || (Lauf->Parent != Parent)))
  {
    z++;
    Prev = Lauf;
    Lauf = Lauf->Next;
  }

  if (!Lauf)
  {
    if (AddEmpt)
    {
      Lauf = (PCToken) malloc(sizeof(TCToken));
      Lauf->Parent = MomSectionHandle;
      Lauf->Name = as_strdup(SName);
      Lauf->Next = NULL;
      InitChunk(&(Lauf->Usage));
      if (!Prev)
        FirstSection = Lauf;
      else
        Prev->Next = Lauf;
    }
    else
      z = -2;
  }
  return z;
}

const char *GetSectionName(LongInt Handle)
{
  PCToken Lauf = FirstSection;
  static const char *Dummy = "";

  if (Handle == -1)
    return Dummy;
  while ((Handle > 0) && (Lauf))
  {
    Lauf = Lauf->Next;
    Handle--;
  }
  return Lauf ? Lauf->Name : Dummy;
}

void SetMomSection(LongInt Handle)
{
  LongInt z;

  MomSectionHandle = Handle;
  if (Handle < 0)
    MomSection = NULL;
  else
  {
    MomSection = FirstSection;
    for (z = 1; z <= Handle; z++)
      if (MomSection)
        MomSection = MomSection->Next;
  }
}

void AddSectionUsage(LongInt Start, LongInt Length)
{
  if ((ActPC != SegCode) || (!MomSection))
    return;
  AddChunk(&(MomSection->Usage), Start, Length, False);
}

void ClearSectionUsage(void)
{
  PCToken Tmp;

  for (Tmp = FirstSection; Tmp; Tmp = Tmp->Next)
    ClearChunk(&(Tmp->Usage));
}

static void PrintSectionList_PSection(LongInt Handle, int Indent)
{
  PCToken Lauf;
  LongInt Cnt;
  String h;

  ChkStack();
  if (Handle != -1)
  {
    strmaxcpy(h, Blanks(Indent << 1), STRINGSIZE);
    strmaxcat(h, GetSectionName(Handle), STRINGSIZE);
    WrLstLine(h);
  }
  Lauf = FirstSection;
  Cnt = 0;
  while (Lauf)
  {
    if (Lauf->Parent == Handle)
      PrintSectionList_PSection(Cnt, Indent + 1);
    Lauf = Lauf->Next;
    Cnt++;
  }
}

void PrintSectionList(void)
{
  if (!FirstSection)
    return;

  NewPage(ChapDepth, True);
  WrLstLine(getmessage(Num_ListSectionListHead1));
  WrLstLine(getmessage(Num_ListSectionListHead2));
  WrLstLine("");
  PrintSectionList_PSection(-1, 0);
}

void PrintDebSections(FILE *f)
{
  PCToken Lauf;
  LongInt Cnt, z, l, s;
  char Str[30];

  Lauf = FirstSection; Cnt = 0;
  while (Lauf)
  {
    fputs("\nInfo for Section ", f); ChkIO(ErrNum_FileWriteError);
    fprintf(f, LongIntFormat, Cnt); ChkIO(ErrNum_FileWriteError);
    fputc(' ', f); ChkIO(ErrNum_FileWriteError);
    fputs(GetSectionName(Cnt), f); ChkIO(ErrNum_FileWriteError);
    fputc(' ', f); ChkIO(ErrNum_FileWriteError);
    fprintf(f, LongIntFormat, Lauf->Parent); ChkIO(ErrNum_FileWriteError);
    fputc('\n', f); ChkIO(ErrNum_FileWriteError);
    for (z = 0; z < Lauf->Usage.RealLen; z++)
    {
      l = Lauf->Usage.Chunks[z].Length;
      s = Lauf->Usage.Chunks[z].Start;
      HexString(Str, sizeof(Str), s, 0);
      fputs(Str, f);
      ChkIO(ErrNum_FileWriteError);
      if (l == 1)
        fprintf(f, "\n");
      else
      {
        HexString(Str, sizeof(Str), s + l - 1, 0);
        fprintf(f, "-%s\n", Str);
      }
      ChkIO(ErrNum_FileWriteError);
    }
    Lauf = Lauf->Next;
    Cnt++;
  }
}

/*!------------------------------------------------------------------------
 * \fn     get_section_parent(LongInt section_handle)
 * \brief  retrieve parent of section
 * \param  section_handle child section
 * \return section handle of parent or -2
 * ------------------------------------------------------------------------ */

LongInt get_section_parent(LongInt section_handle)
{
  PCToken p_run = FirstSection;

  if (section_handle <= 0)
    return -2;
  while ((section_handle > 0) && p_run)
  {
    p_run = p_run->Next;
    section_handle--;
  }
  return p_run ? p_run->Parent : -2;
}

/*!------------------------------------------------------------------------
 * \fn     is_sub_section(LongInt child, LongInt parent)
 * \brief  check whether one section is direct or indirect child of another section
 * \param  child possible child
 * \param  parent possible parent
 * \return True if yes
 * ------------------------------------------------------------------------ */

Boolean is_sub_section(LongInt child, LongInt parent)
{
  while (child >= 0)
  {
    child = get_section_parent(child);
    if (child == parent)
      return True;
  }
  return False;
}

void ClearSectionList(void)
{
  PCToken Tmp;

  while (FirstSection)
  {
    Tmp = FirstSection;
    free(Tmp->Name);
    ClearChunk(&(Tmp->Usage));
    FirstSection = Tmp->Next; free(Tmp);
  }
}

/*---------------------------------------------------------------------------------*/

/*!------------------------------------------------------------------------
 * \fn     PrintCrossList_PNode(PTree Node, void *pData)
 * \brief  printf cross refence list of a single symbol table entry
 * \param  Node node base object
 * \param  pData actual symbol entry
 * \return
 * ------------------------------------------------------------------------ */

static void PrintCrossList_PNode(PTree Node, void *pData)
{
  int FileZ;
  PCrossRef pCross;
  String LineAcc;
  String h;
  char LineStr[30];
  PSymbolEntry SymbolEntry = (PSymbolEntry) Node;
  as_dynstr_t *p_val_str = (as_dynstr_t*)pData;
  Boolean First;

  if (!SymbolEntry->RefList)
    return;

  StrSym(&SymbolEntry->SymWert, False, p_val_str, ListRadixBase);
  as_snprintf(LineStr, sizeof(LineStr), LongIntFormat, SymbolEntry->LineNum);

  as_snprintf(h, sizeof(h), "%s%s",
              getmessage(Num_ListCrossSymName), Node->Name);
  if (Node->Attribute != -1)
    as_snprcatf(h, sizeof(h), "[%s]", GetSectionName(Node->Attribute));
  as_snprcatf(h, sizeof(h), " (=%s, %s:%s):",
              p_val_str->p_str, GetFileName(SymbolEntry->FileNum), LineStr);

  WrLstLine(h);

  for (FileZ = 0; FileZ < GetFileCount(); FileZ++)
  {
    First = True;
    strcpy(LineAcc, "  ");
    for (pCross = SymbolEntry->RefList; pCross; pCross = pCross->Next)
      if (pCross->FileNum == FileZ)
      {
        if (First)
        {
          strcpy(h, " ");
          strmaxcat(h, getmessage(Num_ListCrossFileName), STRINGSIZE);
          strmaxcat(h, GetFileName(FileZ), STRINGSIZE);
          strmaxcat(h, " :", STRINGSIZE);
          WrLstLine(h);
          First = False;
        }
        as_snprcatf(LineAcc, sizeof(LineAcc), "%5ld", (long)pCross->LineNum);
        if (pCross->OccNum != 1)
          as_snprcatf(LineAcc, sizeof(LineAcc), "(%2ld)", (long)pCross->OccNum);
        else
          strmaxcat(LineAcc, "    ", STRINGSIZE);
        if (strlen(LineAcc) >= 72)
        {
          WrLstLine(LineAcc);
          strcpy(LineAcc, "  ");
        }
      }
    if (strcmp(LineAcc, "  "))
      WrLstLine(LineAcc);
  }
  WrLstLine("");
}

void PrintCrossList(void)
{
  as_dynstr_t val_str;

  as_dynstr_ini(&val_str, 256);
  WrLstLine("");
  WrLstLine(getmessage(Num_ListCrossListHead1));
  WrLstLine(getmessage(Num_ListCrossListHead2));
  WrLstLine("");
  IterTree(&(FirstSymbol->Tree), PrintCrossList_PNode, &val_str);
  WrLstLine("");
  as_dynstr_free(&val_str);
}

static void ClearCrossList_CNode(PTree Tree, void *pData)
{
  PCrossRef Lauf;
  PSymbolEntry SymbolEntry = (PSymbolEntry) Tree;
  UNUSED(pData);

  while (SymbolEntry->RefList)
  {
    Lauf = SymbolEntry->RefList->Next;
    free(SymbolEntry->RefList);
    SymbolEntry->RefList = Lauf;
  }
}

void ClearCrossList(void)
{
  IterTree(&(FirstSymbol->Tree), ClearCrossList_CNode, NULL);
}

/*--------------------------------------------------------------------------*/

LongInt GetLocHandle(void)
{
  return next_loc_handle++;
}

void PushLocHandle(LongInt NewLoc)
{
  PLocHandle NewLocHandle;

  NewLocHandle = (PLocHandle) malloc(sizeof(TLocHeap));
  NewLocHandle->Cont = MomLocHandle;
  NewLocHandle->Next = FirstLocHandle;
  FirstLocHandle = NewLocHandle; MomLocHandle = NewLoc;
}

void PopLocHandle(void)
{
  PLocHandle OldLocHandle;

  OldLocHandle = FirstLocHandle;
  if (!OldLocHandle) return;
  MomLocHandle = OldLocHandle->Cont;
  FirstLocHandle = OldLocHandle->Next;
  free(OldLocHandle);
}

void ClearLocStack(void)
{
  while (MomLocHandle != -1)
    PopLocHandle();
}

/*--------------------------------------------------------------------------*/

static void PrintRegList_PNode(PTree Tree, void *pData)
{
  PSymbolEntry Node = (PSymbolEntry) Tree;

  if (Node->SymWert.Typ == TempReg)
  {
    TListContext *pContext = (TListContext*) pData;
    String tmp, tmp2;
    Boolean symbol_used;

    if (Node->SymWert.Contents.RegDescr.Dissect)
      Node->SymWert.Contents.RegDescr.Dissect(tmp2, sizeof(tmp2), Node->SymWert.Contents.RegDescr.Reg, Node->SymWert.DataSize);
    else
      *tmp2 = '\0';
    *tmp = '\0';
    if (Tree->Attribute != -1)
      as_snprcatf(tmp, sizeof(tmp), "[%s]", GetSectionName(Tree->Attribute));
    symbol_used = update_and_get_used(Node);
    as_snprcatf(tmp, sizeof(tmp), "%c%s --> %s", symbol_used ? ' ' : '*', Tree->Name, tmp2);
    if ((int)strlen(tmp) > pContext->cwidth - 3)
    {
      if (*pContext->Zeilenrest.p_str)
        WrLstLine(pContext->Zeilenrest.p_str);
      *pContext->Zeilenrest.p_str = '\0';
      WrLstLine(tmp);
    }
    else
    {
      strmaxcat(tmp, Blanks(pContext->cwidth - 3 - strlen(tmp)), STRINGSIZE);
      if (!*pContext->Zeilenrest.p_str)
        as_dynstr_copy_c_str(&pContext->Zeilenrest, tmp);
      else
      {
        as_sdprcatf(&pContext->Zeilenrest, " | %s", tmp);
        WrLstLine(pContext->Zeilenrest.p_str);
        *pContext->Zeilenrest.p_str = '\0';
      }
    }
    pContext->Sum++;
    if (!symbol_used)
      pContext->USum++;
  }
}

void PrintRegDefs(void)
{
  String buf;
  LongInt ActPageWidth;
  TListContext Context;

  if (!RegistersDefined)
    return;

  NewPage(ChapDepth, True);
  WrLstLine(getmessage(Num_ListRegDefListHead1));
  WrLstLine(getmessage(Num_ListRegDefListHead2));
  WrLstLine("");

  as_dynstr_ini(&Context.Zeilenrest, STRINGSIZE);
  as_dynstr_ini(&Context.s1, 1);
  as_dynstr_ini(&Context.sh, 1);
  Context.Sum = Context.USum = 0;
  ActPageWidth = (PageWidth == 0) ? 80 : PageWidth;
  Context.cwidth = ActPageWidth >> 1;
  IterTree((PTree)FirstSymbol, PrintRegList_PNode, &Context);

  if (*Context.Zeilenrest.p_str)
    WrLstLine(Context.Zeilenrest.p_str);
  WrLstLine("");
  as_snprintf(buf, sizeof(buf), "%7ld%s",
              (long) Context.Sum,
              getmessage((Context.Sum == 1) ? Num_ListRegDefSumMsg : Num_ListRegDefSumsMsg));
  WrLstLine(buf);
  as_snprintf(buf, sizeof(buf), "%7ld%s",
              (long)Context.USum,
              getmessage((Context.USum == 1) ? Num_ListRegDefUSumMsg : Num_ListRegDefUSumsMsg));
  WrLstLine("");
  as_dynstr_free(&Context.Zeilenrest);
  as_dynstr_free(&Context.s1);
  as_dynstr_free(&Context.sh);
}

/*--------------------------------------------------------------------------*/

/*!------------------------------------------------------------------------
 * \fn     FindCodepage(const char *p_name, PTransTable p_source)
 * \brief  look up a code page by name
 * \param  p_name name to look for
 * \param  p_source source to copy from if creation allowed, otehrwise NULL
 * \return * to found/created code page
 * ------------------------------------------------------------------------ */

PTransTable FindCodepage(const char *p_name, PTransTable p_source)
{
  PTransTable p_prev, p_run, p_new;
  /* If TransTables is empty, p_name is right behind non-existing
     last entry: */
  int cmp_res = 1;

  for (p_run = TransTables, p_prev = NULL; p_run; p_prev = p_run, p_run = p_run->Next)
  {
    cmp_res = CaseSensitive ? strcmp(p_name, p_run->Name) : as_strcasecmp(p_name, p_run->Name);
    if (cmp_res <= 0)
      break;
  }
  if (!cmp_res)
    return p_run;
  else if (!p_source)
    return NULL;
  else
  {
    p_new = (PTransTable) malloc(sizeof(TTransTable));
    if (p_new)
    {
      p_new->Next = p_run;
      p_new->Name = as_strdup(p_name);
      if (!CaseSensitive)
        UpString(p_new->Name);
      p_new->p_table = as_chartrans_table_dup(p_source->p_table);
      if (p_prev)
        p_prev->Next = p_new;
      else
        TransTables = p_new;
    }
    return p_new;
  }
}

void ClearCodepages(void)
{
  PTransTable Old;

  while (TransTables)
  {
    Old = TransTables;
    TransTables = Old->Next;
    free(Old->Name);
    as_chartrans_table_free(Old->p_table);
    free(Old);
  }
}

void PrintCodepages(void)
{
  char buf[500];
  PTransTable Table;
  int z, cnt, cnt2;

  NewPage(ChapDepth, True);
  WrLstLine(getmessage(Num_ListCodepageListHead1));
  WrLstLine(getmessage(Num_ListCodepageListHead2));
  WrLstLine("");

  cnt2 = 0;
  for (Table = TransTables; Table; Table = Table->Next)
  {
    for (z = cnt = 0; z < 256; z++)
      if (Table->p_table->mapping[z] != z)
        cnt++;
    as_snprintf(buf, sizeof(buf), "%s (%d%s)", Table->Name, cnt,
                getmessage((cnt == 1) ? Num_ListCodepageChange : Num_ListCodepagePChange));
    WrLstLine(buf);
    cnt2++;
  }
  WrLstLine("");
  as_snprintf(buf, sizeof(buf), "%d%s", cnt2,
              getmessage((cnt2 == 1) ? Num_ListCodepageSumMsg : Num_ListCodepageSumsMsg));
  WrLstLine(buf);
}

/*--------------------------------------------------------------------------*/

static as_cmd_result_t cmd_radix(Boolean negate, const char *p_arg)
{
  if (negate)
  {
    def_radix_base = 10;
    return e_cmd_ok;
  }
  else if (!p_arg)
    return e_cmd_err;
  else
  {
    const char *p_end;
    int new_def_radix_base = as_cmd_strtol(p_arg, &p_end);

    if (*p_end || (new_def_radix_base < 2) || (new_def_radix_base > 36))
      return e_cmd_err;
    def_radix_base = new_def_radix_base;
    return e_cmd_arg;
  }
}

static const as_cmd_rec_t asmpars_params[] =
{
  { "radix"     , cmd_radix       },
};

void asmpars_init(void)
{
  tIntTypeDef *pCurr;
  char *p_end;

  function_init();

  serr = (char*)malloc(sizeof(char) * STRINGSIZE);
  snum = (char*)malloc(sizeof(char) * STRINGSIZE);
  FirstDefSymbol = NULL;
  FirstFunction = NULL;
  BalanceTrees = False;

  for (pCurr = IntTypeDefs; pCurr < IntTypeDefs + (sizeof(IntTypeDefs) / sizeof(*IntTypeDefs)); pCurr++)
  {
    unsigned SignType = Hi(pCurr->SignAndWidth);
    unsigned Bits, Cnt;

    Bits = Lo(pCurr->SignAndWidth) - ((SignType == 0x80) ? 1 : 0);
    for (Cnt = 0, pCurr->Mask = 0; Cnt < Bits; Cnt++)
      pCurr->Mask = (pCurr->Mask << 1) | 1;

    pCurr->Max = (LargeInt)pCurr->Mask;

    switch (SignType & 0xc0)
    {
      case 0x80:
        pCurr->Min = -pCurr->Max - 1;
        break;
      case 0xc0:
        pCurr->Min = (LargeInt)(pCurr->Mask / 2);
        pCurr->Min = -pCurr->Min - 1;
        break;
      default:
        pCurr->Min = 0;
        break;
    }
  }

  LastGlobSymbol = (char*)malloc(sizeof(char) * STRINGSIZE);

  (void)strtod(inf_name, &p_end);
  inf_reserved = !*p_end;

  def_radix_base = 10;
  as_cmd_register(asmpars_params, as_array_size(asmpars_params));
}
