This repository has been archived on 2023-08-20. You can view files and clone it, but cannot push or open issues or pull requests.
yap-6.3/CXX/yapq.hh

405 lines
8.9 KiB
C++
Raw Normal View History

2017-05-02 07:38:23 +01:00
2017-03-20 15:52:48 +00:00
/**
2017-04-07 23:10:59 +01:00
* @file yapq.hh
2017-05-02 07:38:23 +01:00
*
2017-03-20 15:52:48 +00:00
* @defgroup yap-cplus-query-hanadlinge Query Handling in the YAP interface.
2017-04-07 23:10:59 +01:00
* @brief Engine and Query Management
2017-03-20 15:52:48 +00:00
*
* @ingroup yap-cplus-interface
*
2017-04-07 23:10:59 +01:00
* @{
2017-05-02 07:38:23 +01:00
*
* These classes wrap engine and query. An engine is an environment where we can rum
2017-03-20 15:52:48 +00:00
* Prolog, that is, where we can run queries.
2017-04-07 23:10:59 +01:00
*
2017-05-02 07:38:23 +01:00
* Also, supports callbacks and engine configuration.
*
2017-03-20 15:52:48 +00:00
*/
2015-02-09 01:52:10 +00:00
#ifndef YAPQ_HH
#define YAPQ_HH 1
2016-07-31 16:22:24 +01:00
class YAPPredicate;
2015-02-09 01:52:10 +00:00
/**
Queries and engines
*/
/**
* @brief Queries
*
* interface to a YAP Query;
* uses an SWI-like status info internally.
*/
2017-02-20 14:38:00 +00:00
class YAPQuery : public YAPPredicate
{
2016-07-31 16:22:24 +01:00
bool q_open;
int q_state;
yhandle_t q_g, q_handles;
struct yami *q_p, *q_cp;
2017-02-20 14:38:00 +00:00
sigjmp_buf q_env;
2016-07-31 16:22:24 +01:00
int q_flags;
YAP_dogoalinfo q_h;
YAPQuery *oq;
2017-05-02 07:38:23 +01:00
YAPPairTerm names;
YAPTerm goal;
2016-09-21 20:41:23 +01:00
// temporaries
2017-05-02 07:38:23 +01:00
Term tnames, tgoal ;
2015-04-13 13:28:17 +01:00
2017-05-02 07:38:23 +01:00
void openQuery(Term t);
2016-07-31 16:22:24 +01:00
2015-02-09 01:52:10 +00:00
public:
/// main constructor, uses a predicate and an array of terms
///
2016-07-31 16:22:24 +01:00
/// It is given a YAPPredicate _p_ , and an array of terms that must have at
/// least
2015-02-09 01:52:10 +00:00
/// the same arity as the functor.
YAPQuery(YAPPredicate p, YAPTerm t[]);
/// full constructor,
///
2017-05-02 07:38:23 +01:00
///
2016-07-31 16:22:24 +01:00
/// It is given a functor, module, and an array of terms that must have at
/// least
2015-02-09 01:52:10 +00:00
/// the same arity as the functor.
YAPQuery(YAPFunctor f, YAPTerm mod, YAPTerm t[]);
/// functor/term constructor,
///
/// It is given a functor, and an array of terms that must have at least
/// the same arity as the functor. Works within the current module.
2016-12-10 07:01:10 +00:00
//YAPQuery(YAPFunctor f, YAPTerm t[]);
2015-02-09 01:52:10 +00:00
/// string constructor without varnames
///
2016-07-31 16:22:24 +01:00
/// It is given a string, calls the parser and obtains a Prolog term that
/// should be a callable
2015-04-13 13:28:17 +01:00
/// goal.
2017-05-02 07:38:23 +01:00
inline YAPQuery(const char *s) : YAPPredicate(s, tgoal, tnames)
2017-02-20 14:38:00 +00:00
{
2016-11-11 07:23:34 +00:00
__android_log_print(ANDROID_LOG_INFO, "YAPDroid", "got game %ld",
2016-07-31 16:22:24 +01:00
LOCAL_CurSlot);
2016-09-27 18:28:54 +01:00
if (!ap)
return;
2017-02-20 14:38:00 +00:00
__android_log_print(ANDROID_LOG_INFO, "YAPDroid", "%s", vnames.text());
2017-05-02 07:38:23 +01:00
goal = YAPTerm(tgoal);
names = YAPPairTerm(tnames);
openQuery(tgoal);
2016-07-31 16:22:24 +01:00
};
/// string constructor with just an atom
///
/// It is given an atom, and a Prolog term that should be a callable
/// goal, say `main`, `init`, `live`.
2017-02-20 14:38:00 +00:00
inline YAPQuery(YAPAtom g) : YAPPredicate(g)
{
2017-05-02 07:38:23 +01:00
goal = YAPAtomTerm(g);
names = YAPPairTerm( );
openQuery(goal.term());
2015-04-13 13:28:17 +01:00
};
2015-02-09 01:52:10 +00:00
/// set flags for query execution, currently only for exception handling
2016-07-31 16:22:24 +01:00
void setFlag(int flag) { q_flags |= flag; }
2015-02-09 01:52:10 +00:00
/// reset flags for query execution, currently only for exception handling
2016-07-31 16:22:24 +01:00
void resetFlag(int flag) { q_flags &= ~flag; }
/// first query
2015-02-09 01:52:10 +00:00
///
/// actually implemented by calling the next();
inline bool first() { return next(); }
/// ask for the next solution of the current query
/// same call for every solution
bool next();
2016-04-12 16:22:53 +01:00
/// does this query have open choice-points?
/// or is it deterministic?
bool deterministic();
2015-02-09 01:52:10 +00:00
/// represent the top-goal
2015-04-13 13:28:17 +01:00
const char *text();
2016-07-31 16:22:24 +01:00
/// remove alternatives in the current search space, and finish the current
/// query
2015-02-09 01:52:10 +00:00
/// finish the current query: undo all bindings.
void close();
/// query variables.
2017-02-20 14:38:00 +00:00
void cut();
2017-05-02 07:38:23 +01:00
Term namedVars() {return names.term(); };
2016-07-31 16:22:24 +01:00
/// query variables, but copied out
2017-05-02 07:38:23 +01:00
std::vector<Term> namedVarsVector() {
return names.listToArray(); };
2016-07-31 16:22:24 +01:00
/// convert a ref to a binding.
YAPTerm getTerm(yhandle_t t);
/// simple YAP Query;
/// just calls YAP and reports success or failure, Useful when we just
/// want things done, eg YAPCommand("load_files(library(lists), )")
2017-02-20 14:38:00 +00:00
inline bool command()
{
bool rc = next();
close();
return rc;
};
2015-02-09 01:52:10 +00:00
};
// Java support
2016-07-31 16:22:24 +01:00
/// This class implements a callback Prolog-side. It will be inherited by the
/// Java or Python
2015-02-09 01:52:10 +00:00
/// class that actually implements the callback.
2017-02-20 14:38:00 +00:00
class YAPCallback
{
2015-02-09 01:52:10 +00:00
public:
2016-07-31 16:22:24 +01:00
virtual ~YAPCallback() {}
virtual void run() { LOG("callback"); }
virtual void run(char *s) {}
2015-02-09 01:52:10 +00:00
};
2017-05-02 07:38:23 +01:00
class YAPEngine;
/// @brief Setup all arguments to a new engine
class YAPEngineArgs {
friend class YAPEngine;
YAP_init_args init_args;
void fetch_defaults();
public:
inline void setEmbedded( bool fl )
{
init_args.Embedded = fl;
};
inline bool getEmbedded( )
{
return init_args.Embedded;
};
inline void setSavedState( char *fl )
{
init_args.SavedState = fl;
};
inline const char * getSavedState( )
{
return init_args.SavedState;
};
inline void setStackSize( bool fl )
{
init_args.StackSize = fl;
};
inline bool getStackSize( )
{
return init_args.StackSize;
};
inline void setTrailSize( bool fl )
{
init_args.TrailSize = fl;
};
inline bool getTrailSize( )
{
return init_args.TrailSize;
};
inline bool getMStackSize( )
{
return init_args.StackSize;
};
inline void setMaxTrailSize( bool fl )
{
init_args.MaxTrailSize = fl;
};
inline bool getMaxTrailSize( )
{
return init_args.MaxTrailSize;
};
inline void setYapLibDir( const char * fl )
{
init_args.YapLibDir = fl;
};
inline const char * getYapLibDir( )
{
return init_args.YapLibDir;
};
inline void setYapShareDir( const char * fl )
{
init_args.YapShareDir = fl;
};
inline const char * getYapShareDir( )
{
return init_args.YapShareDir;
};
inline void setYapPrologBootFile( const char * fl )
{
init_args.YapPrologBootFile = fl;
};
inline const char * getYapPrologBootFile( )
{
return init_args.YapPrologBootFile;
};
inline void setYapPrologGoal( const char * fl )
{
init_args.YapPrologGoal = fl;
};
inline const char * getYapPrologGoal( )
{
return init_args.YapPrologGoal;
};
inline void setYapPrologTopLevelGoal( const char * fl )
{
init_args.YapPrologTopLevelGoal = fl;
};
inline const char * getYapPrologTopLevelGoal( )
{
return init_args.YapPrologTopLevelGoal;
};
inline void setHaltAfterConsult( bool fl )
{
init_args.HaltAfterConsult = fl;
};
inline bool getHaltAfterConsult( )
{
return init_args.HaltAfterConsult;
};
inline void setFastBoot( bool fl )
{
init_args.FastBoot = fl;
};
inline bool getFastBoot( )
{
return init_args.FastBoot;
};
inline void setArgc( int fl )
{
init_args.Argc = fl;
};
inline int getArgc( )
{
return init_args.Argc;
};
inline void setArgv( char ** fl )
{
init_args.Argv = fl;
};
inline char ** getArgv( )
{
return init_args.Argv;
};
YAPEngineArgs() {
fetch_defaults();
};
};
2015-02-09 01:52:10 +00:00
/**
* @brief YAP Engine: takes care of the execution environment
where we can go executing goals.
*
*
*/
2017-02-20 14:38:00 +00:00
class YAPEngine
{
2015-02-09 01:52:10 +00:00
private:
2017-05-02 07:38:23 +01:00
YAPEngineArgs engine_args;
2015-02-09 01:52:10 +00:00
YAPCallback *_callback;
YAPError yerror;
2016-07-31 16:22:24 +01:00
void doInit(YAP_file_type_t BootMode);
2016-10-16 23:18:51 +01:00
YAP_dogoalinfo q;
2016-07-31 16:22:24 +01:00
2015-02-09 01:52:10 +00:00
public:
2016-07-31 16:22:24 +01:00
/// construct a new engine; may use a variable number of arguments
2017-05-02 07:38:23 +01:00
YAPEngine(YAPEngineArgs &cargs); /// construct a new engine, including aaccess to callbacks
2016-07-31 16:22:24 +01:00
/// construct a new engine using argc/argv list of arguments
YAPEngine(int argc, char *argv[],
YAPCallback *callback = (YAPCallback *)NULL);
/// kill engine
2015-02-09 01:52:10 +00:00
~YAPEngine() { delYAPCallback(); }
/// remove current callback
void delYAPCallback() { _callback = 0; }
/// set a new callback
2017-02-20 14:38:00 +00:00
void setYAPCallback(YAPCallback *cb)
{
2016-07-31 16:22:24 +01:00
delYAPCallback();
_callback = cb;
}
2015-02-09 01:52:10 +00:00
/// execute the callback.
2017-05-02 07:38:23 +01:00
////void run() { if (_callback) _callback.run(); }
2015-02-09 01:52:10 +00:00
/// execute the callback with a text argument.
2017-02-20 14:38:00 +00:00
void run(char *s)
{
2016-07-31 16:22:24 +01:00
if (_callback)
_callback->run(s);
}
2016-09-21 20:41:23 +01:00
/// stop yap
2016-09-27 18:28:54 +01:00
void close() { Yap_exit(0); }
2016-09-21 20:41:23 +01:00
2015-02-09 01:52:10 +00:00
/// execute the callback with a text argument.
2016-09-21 20:41:23 +01:00
bool hasError() { return LOCAL_Error_TYPE != YAP_NO_ERROR; }
2015-02-09 01:52:10 +00:00
/// build a query on the engine
2016-07-31 16:22:24 +01:00
YAPQuery *query(const char *s) { return new YAPQuery(s); };
2015-02-09 01:52:10 +00:00
/// current module for the engine
2016-07-31 16:22:24 +01:00
YAPModule currentModule() { return YAPModule(); }
/// given a handle, fetch a term from the engine
inline YAPTerm getTerm(yhandle_t h) { return YAPTerm(h); }
2015-07-23 01:33:30 +01:00
/// current directory for the engine
2016-09-21 20:41:23 +01:00
bool call(YAPPredicate ap, YAPTerm ts[]);
2016-09-27 18:28:54 +01:00
/// current directory for the engine
2017-02-20 14:38:00 +00:00
bool goalt(YAPTerm Yt) { return Yt.term(); };
/// current directory for the engine
bool mgoal(Term t, Term tmod);
2016-10-16 23:18:51 +01:00
/// current directory for the engine
2017-02-20 14:38:00 +00:00
bool goal(Term t)
{
return mgoal(t, CurrentModule);
}
2016-10-16 23:18:51 +01:00
/// reset Prolog state
void reSet();
2017-05-02 07:38:23 +01:00
/// assune that there are no stack pointers, just release memory
2016-10-16 23:18:51 +01:00
// for last execution
void release();
2016-09-21 20:41:23 +01:00
2017-02-20 14:38:00 +00:00
const char *currentDir()
{
2016-07-31 16:22:24 +01:00
char dir[1024];
std::string s = Yap_getcwd(dir, 1024 - 1);
return s.c_str();
};
/// report YAP version as a string
2017-02-20 14:38:00 +00:00
const char *version()
{
2016-07-31 16:22:24 +01:00
std::string s = Yap_version();
return s.c_str();
};
2017-05-02 07:38:23 +01:00
//> call a deterninistic predicate: the user will construct aterm of
//> arity N-1. YAP adds an extra variable which will have the
//> output.
YAPTerm fun(YAPTerm t);
2016-10-16 23:18:51 +01:00
Term fun(Term t);
2015-02-09 01:52:10 +00:00
};
#endif /* YAPQ_HH */
2017-03-20 15:52:48 +00:00
/// @}