src/qsa/src/engine/qsinternal.h

Ir a la documentación de este archivo.

/****************************************************************************
** $Id: qsinternal.h  1.1.5   edited 2006-02-23T15:39:57$
**
** Copyright (C) 2001-2006 Trolltech AS.  All rights reserved.
**
** This file is part of the Qt Script for Applications framework (QSA).
**
** This file may be distributed and/or modified under the terms of the
** GNU General Public License version 2 as published by the Free Software
** Foundation and appearing in the file LICENSE.GPL included in the
** packaging of this file.
**
** Licensees holding a valid Qt Script for Applications license may use
** this file in accordance with the Qt Script for Applications License
** Agreement provided with the Software.
**
** This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
** WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
**
** See http://www.trolltech.com/pricing.html or email sales@trolltech.com for
**   information about QSA Commercial License Agreements.
** See http://www.trolltech.com/gpl/ for GPL licensing information.
**
** Contact info@trolltech.com if any conditions of this licensing are
** not clear to you.
**
*****************************************************************************/

#ifndef QSINTERNAL_H
#define QSINTERNAL_H

#ifdef HAVE_CONFIG_H
#include "config.h"
#endif

#include "qsengine.h"
#include "qsobject.h"
#include "qsfunction.h"
#include "qsclass.h"
#include <qstring.h>

class QSNode;
class QSFunctionBodyNode;
class QSProgramNode;
class QSClassClass;

class Object;
class RegExp;
#ifdef QSDEBUGGER
class Debugger;
#endif

class LabelStack
{
public:
  LabelStack(): tos(0L) {}

  ~LabelStack() {
    StackElm *prev;
    while (tos) {
      prev = tos->prev;
      delete tos;
      tos = prev;
    }
  }

  bool push(const QString &id) {
    if (id.isEmpty() || contains(id))
      return false;

    StackElm *newtos = new StackElm;
    newtos->id = id;
    newtos->prev = tos;
    tos = newtos;
    return true;
  }

  bool contains(const QString &id) const {
    if (id.isEmpty())
      return true;

    for (StackElm *curr = tos; curr; curr = curr->prev)
      if (curr->id == id)
        return true;

    return false;
  }

  void pop() {
    if (tos) {
      StackElm *prev = tos->prev;
      delete tos;
      tos = prev;
    }
  }

private:
  struct StackElm {
    QString id;
    StackElm *prev;
  };

  StackElm *tos;
};

class FunctionImp;

class QSArgumentsClass : public QSWritableClass
{
public:
  QSArgumentsClass(QSClass *b) : QSWritableClass(b) { }
  QString name() const {
    return QString::fromLatin1("Arguments");
  }
  QSObject construct(FunctionImp *func, const QSList *args) const;
};

class ExecutionStack;
class QSEnv;

class QSEngineImp
{
public:
  QSEngineImp(QSEngine *s);
  ~QSEngineImp();

  QSEngine *interpreter() const {
    return scr;
  }
  QSEnv *env() const {
    return en;
  }

#ifdef QSDEBUGGER

  void attachDebugger(Debugger *d);
  Debugger *debugger() const {
    return dbg;
  }
  int sourceId() const {
    return sid;
  }
  void incrSourceId() {
    sid++;
  }
  void decrSourceId() {
    sid--;
  }
  bool setBreakpoint(int id, int line, bool set);
#endif

private:
  void init();
  void clear();
  void globalInit();
  void globalClear();
  bool evaluate(const QString &code, const QSObject *thisV = 0,
                bool onlyCheckSyntax = FALSE, int checkMode = QSEngine::DisallowGlobal,
                int lineZero = 0);
  bool call(QSObject *scope, const QString &func, const QSList &args);

private:
  QSProgramNode *progNode() const;
  void setProgNode(QSProgramNode *p);
  QSNode *firstNode() const;
  void setFirstNode(QSNode *n);

  bool initialized;
  QSEngine *scr;
  QSEnv *en;
  Global *glob;
  int errType;
  QValueList<uint> errLines;
  QStringList errMsgs;
#ifdef QSDEBUGGER
  Debugger *dbg;
  int sid;
#endif
  QSObject retVal;
  ExecutionStack *stack;
  int recursion;

  static int instances; // total number of instances

  friend class QSEngine;
  friend class Global;
};

#endif