You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
160 lines
3.7 KiB
160 lines
3.7 KiB
/* This file is part of the KDE project
|
|
Copyright (C) 1998, 1999 Torben Weis <weis@kde.org>
|
|
|
|
This library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Library General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2 of the License, or (at your option) any later version.
|
|
|
|
This library is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Library General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Library General Public License
|
|
along with this library; see the file COPYING.LIB. If not, write to
|
|
the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
|
|
Boston, MA 02110-1301, USA.
|
|
*/
|
|
|
|
#include <assert.h>
|
|
#include <stdlib.h>
|
|
|
|
// TODO: Torben: On error free memory!
|
|
|
|
extern "C"
|
|
{
|
|
#include "ktraderparse.h"
|
|
}
|
|
|
|
#include "ktraderparsetree.h"
|
|
#include <kdebug.h>
|
|
|
|
using namespace KIO;
|
|
|
|
static ParseTreeBase::Ptr *pTree = 0;
|
|
static const char* sCode = 0;
|
|
|
|
ParseTreeBase::Ptr KIO::parseConstraints( const TQString& _constr )
|
|
{
|
|
TQCString str = _constr.utf8();
|
|
sCode = str.data();
|
|
KTraderParse_mainParse( sCode );
|
|
sCode = 0;
|
|
assert( pTree );
|
|
return *pTree;
|
|
}
|
|
|
|
ParseTreeBase::Ptr KIO::parsePreferences( const TQString& _prefs )
|
|
{
|
|
TQCString str = _prefs.utf8();
|
|
sCode = str.data();
|
|
KTraderParse_mainParse( sCode );
|
|
sCode = 0;
|
|
assert( pTree );
|
|
return *pTree;
|
|
}
|
|
|
|
void KTraderParse_setParseTree( void *_ptr1 )
|
|
{
|
|
if ( !pTree )
|
|
pTree = new ParseTreeBase::Ptr; // ### leak; should use KStaticDeleter
|
|
*pTree = static_cast<ParseTreeBase*>( _ptr1 );
|
|
}
|
|
|
|
|
|
void KTraderParse_error( const char* err )
|
|
{
|
|
kdWarning(7014) << "Parsing '" << sCode << "' gave " << err << endl;
|
|
}
|
|
|
|
void* KTraderParse_newOR( void *_ptr1, void *_ptr2 )
|
|
{
|
|
return new ParseTreeOR( (ParseTreeBase*)_ptr1, (ParseTreeBase*)_ptr2 );
|
|
}
|
|
|
|
void* KTraderParse_newAND( void *_ptr1, void *_ptr2 )
|
|
{
|
|
return new ParseTreeAND( (ParseTreeBase*)_ptr1, (ParseTreeBase*)_ptr2 );
|
|
}
|
|
|
|
void* KTraderParse_newCMP( void *_ptr1, void *_ptr2, int _i )
|
|
{
|
|
return new ParseTreeCMP( (ParseTreeBase*)_ptr1, (ParseTreeBase*)_ptr2, _i );
|
|
}
|
|
|
|
void* KTraderParse_newIN( void *_ptr1, void *_ptr2 )
|
|
{
|
|
return new ParseTreeIN( (ParseTreeBase*)_ptr1, (ParseTreeBase*)_ptr2 );
|
|
}
|
|
|
|
void* KTraderParse_newMATCH( void *_ptr1, void *_ptr2 )
|
|
{
|
|
return new ParseTreeMATCH( (ParseTreeBase*)_ptr1, (ParseTreeBase*)_ptr2 );
|
|
}
|
|
|
|
void* KTraderParse_newCALC( void *_ptr1, void *_ptr2, int _i )
|
|
{
|
|
return new ParseTreeCALC( (ParseTreeBase*)_ptr1, (ParseTreeBase*)_ptr2, _i );
|
|
}
|
|
|
|
void* KTraderParse_newBRACKETS( void *_ptr1 )
|
|
{
|
|
return new ParseTreeBRACKETS( (ParseTreeBase*)_ptr1 );
|
|
}
|
|
|
|
void* KTraderParse_newNOT( void *_ptr1 )
|
|
{
|
|
return new ParseTreeNOT( (ParseTreeBase*)_ptr1 );
|
|
}
|
|
|
|
void* KTraderParse_newEXIST( char *_ptr1 )
|
|
{
|
|
ParseTreeEXIST *t = new ParseTreeEXIST( _ptr1 );
|
|
free(_ptr1);
|
|
return t;
|
|
}
|
|
|
|
void* KTraderParse_newID( char *_ptr1 )
|
|
{
|
|
ParseTreeID *t = new ParseTreeID( _ptr1 );
|
|
free(_ptr1);
|
|
return t;
|
|
}
|
|
|
|
void* KTraderParse_newSTRING( char *_ptr1 )
|
|
{
|
|
ParseTreeSTRING *t = new ParseTreeSTRING( _ptr1 );
|
|
free(_ptr1);
|
|
return t;
|
|
}
|
|
|
|
void* KTraderParse_newNUM( int _i )
|
|
{
|
|
return new ParseTreeNUM( _i );
|
|
}
|
|
|
|
void* KTraderParse_newFLOAT( float _f )
|
|
{
|
|
return new ParseTreeDOUBLE( _f );
|
|
}
|
|
|
|
void* KTraderParse_newBOOL( char _b )
|
|
{
|
|
return new ParseTreeBOOL( (bool)_b );
|
|
}
|
|
|
|
void* KTraderParse_newMAX2( char *_id )
|
|
{
|
|
ParseTreeMAX2 *t = new ParseTreeMAX2( _id );
|
|
free(_id);
|
|
return t;
|
|
}
|
|
|
|
void* KTraderParse_newMIN2( char *_id )
|
|
{
|
|
ParseTreeMIN2 *t = new ParseTreeMIN2( _id );
|
|
free(_id);
|
|
return t;
|
|
}
|