Fix some more obscure warnings
This commit is contained in:
@@ -23,6 +23,12 @@
|
|||||||
#include "dispatchkit/function_call.hpp"
|
#include "dispatchkit/function_call.hpp"
|
||||||
#include "dispatchkit/dynamic_object.hpp"
|
#include "dispatchkit/dynamic_object.hpp"
|
||||||
|
|
||||||
|
#ifdef BOOST_HAS_DECLSPEC
|
||||||
|
#define CHAISCRIPT_MODULE_EXPORT extern "C" __declspec(dllexport)
|
||||||
|
#else
|
||||||
|
#define CHAISCRIPT_MODULE_EXPORT extern "C"
|
||||||
|
#endif
|
||||||
|
|
||||||
#include "language/chaiscript_eval.hpp"
|
#include "language/chaiscript_eval.hpp"
|
||||||
#include "language/chaiscript_engine.hpp"
|
#include "language/chaiscript_engine.hpp"
|
||||||
|
|
||||||
|
@@ -344,11 +344,11 @@ namespace chaiscript
|
|||||||
// Is it in the stack?
|
// Is it in the stack?
|
||||||
for (int i = stack.get<1>().size()-1; i >= 0; --i)
|
for (int i = stack.get<1>().size()-1; i >= 0; --i)
|
||||||
{
|
{
|
||||||
std::map<std::string, Boxed_Value>::const_iterator itr = (stack.get<1>())[i].find(name);
|
std::map<std::string, Boxed_Value>::const_iterator stackitr = (stack.get<1>())[i].find(name);
|
||||||
if (itr != (stack.get<1>())[i].end())
|
if (stackitr != (stack.get<1>())[i].end())
|
||||||
{
|
{
|
||||||
cache[name] = itr->second;
|
cache[name] = stackitr->second;
|
||||||
return itr->second;
|
return stackitr->second;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -359,7 +359,7 @@ namespace chaiscript
|
|||||||
{
|
{
|
||||||
public:
|
public:
|
||||||
Proxy_Function_Impl(const boost::function<Func> &f)
|
Proxy_Function_Impl(const boost::function<Func> &f)
|
||||||
: Proxy_Function_Base(build_param_type_list((Func *)(0))),
|
: Proxy_Function_Base(build_param_type_list(static_cast<Func *>(0))),
|
||||||
m_f(f), m_dummy_func(0)
|
m_f(f), m_dummy_func(0)
|
||||||
{
|
{
|
||||||
}
|
}
|
||||||
|
@@ -51,6 +51,9 @@ namespace chaiscript
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
DLModule(const DLModule &); // Explicitly unimplemented copy constructor
|
||||||
|
DLModule &operator=(const DLModule &); // Explicitly unimplemented assignment operator
|
||||||
|
|
||||||
~DLModule()
|
~DLModule()
|
||||||
{
|
{
|
||||||
dlclose(m_data);
|
dlclose(m_data);
|
||||||
|
@@ -152,22 +152,8 @@ namespace chaiscript
|
|||||||
*/
|
*/
|
||||||
template <typename Eval_System>
|
template <typename Eval_System>
|
||||||
Boxed_Value eval_single_quoted_string(Eval_System &ss, const TokenPtr &node) {
|
Boxed_Value eval_single_quoted_string(Eval_System &ss, const TokenPtr &node) {
|
||||||
/*
|
|
||||||
if (node->text.size() == 1) {
|
|
||||||
//return Boxed_Value(char(node->text[0]));
|
|
||||||
return const_var(char(node->text[0]));
|
|
||||||
}
|
|
||||||
else {
|
|
||||||
//return Boxed_Value(char((int)node->text[0] * 0xff + (int)node->text[0]));
|
|
||||||
return const_var(char((int)node->text[0] * 0xff + (int)node->text[0]));
|
|
||||||
}
|
|
||||||
*/
|
|
||||||
|
|
||||||
if (!node->is_cached) {
|
if (!node->is_cached) {
|
||||||
cache_const(ss, node,
|
cache_const(ss, node, const_var(char(node->text[0])));
|
||||||
node->text.size() == 1 ?
|
|
||||||
const_var(char(node->text[0])) :
|
|
||||||
const_var(char((int)node->text[0] * 0xff + (int)node->text[0])));
|
|
||||||
}
|
}
|
||||||
return node->cached_value;
|
return node->cached_value;
|
||||||
}
|
}
|
||||||
@@ -177,10 +163,10 @@ namespace chaiscript
|
|||||||
*/
|
*/
|
||||||
template <typename Eval_System>
|
template <typename Eval_System>
|
||||||
Boxed_Value eval_equation(Eval_System &ss, const TokenPtr &node) {
|
Boxed_Value eval_equation(Eval_System &ss, const TokenPtr &node) {
|
||||||
unsigned int i;
|
int i;
|
||||||
Boxed_Value retval = eval_token(ss, node->children.back());
|
Boxed_Value retval = eval_token(ss, node->children.back());
|
||||||
if (node->children.size() > 1) {
|
if (node->children.size() > 1) {
|
||||||
for (i = node->children.size()-3; ((int)i) >= 0; i -= 2) {
|
for (i = node->children.size()-3; i >= 0; i -= 2) {
|
||||||
if (node->children[i+1]->text == "=") {
|
if (node->children[i+1]->text == "=") {
|
||||||
Boxed_Value lhs = eval_token(ss, node->children[i]);
|
Boxed_Value lhs = eval_token(ss, node->children[i]);
|
||||||
|
|
||||||
@@ -552,7 +538,6 @@ namespace chaiscript
|
|||||||
*/
|
*/
|
||||||
template <typename Eval_System>
|
template <typename Eval_System>
|
||||||
Boxed_Value eval_dot_access(Eval_System &ss, const TokenPtr &node) {
|
Boxed_Value eval_dot_access(Eval_System &ss, const TokenPtr &node) {
|
||||||
std::vector<std::pair<std::string, Proxy_Function > > fn;
|
|
||||||
Dispatch_Engine::Stack prev_stack = ss.get_stack();
|
Dispatch_Engine::Stack prev_stack = ss.get_stack();
|
||||||
Dispatch_Engine::Stack new_stack = ss.new_stack();
|
Dispatch_Engine::Stack new_stack = ss.new_stack();
|
||||||
unsigned int i, j;
|
unsigned int i, j;
|
||||||
@@ -588,9 +573,7 @@ namespace chaiscript
|
|||||||
throw Eval_Error(ee.reason, node->children[i]);
|
throw Eval_Error(ee.reason, node->children[i]);
|
||||||
}
|
}
|
||||||
try {
|
try {
|
||||||
//fn = ss.get_function(fun_name);
|
|
||||||
ss.set_stack(new_stack);
|
ss.set_stack(new_stack);
|
||||||
//retval = dispatch(fn, plb);
|
|
||||||
retval = (*boxed_cast<Const_Proxy_Function >(fn))(plb);
|
retval = (*boxed_cast<Const_Proxy_Function >(fn))(plb);
|
||||||
ss.set_stack(prev_stack);
|
ss.set_stack(prev_stack);
|
||||||
}
|
}
|
||||||
|
@@ -30,6 +30,9 @@ namespace chaiscript
|
|||||||
singleline_comment = "//";
|
singleline_comment = "//";
|
||||||
}
|
}
|
||||||
|
|
||||||
|
ChaiScript_Parser(const ChaiScript_Parser &); // explicitly unimplemented copy constructor
|
||||||
|
ChaiScript_Parser &operator=(const ChaiScript_Parser &); // explicitly unimplemented assignment operator
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Prints the parsed tokens as a tree
|
* Prints the parsed tokens as a tree
|
||||||
*/
|
*/
|
||||||
@@ -68,7 +71,7 @@ namespace chaiscript
|
|||||||
*/
|
*/
|
||||||
void build_match(Token_Type::Type match_type, int match_start) {
|
void build_match(Token_Type::Type match_type, int match_start) {
|
||||||
//so we want to take everything to the right of this and make them children
|
//so we want to take everything to the right of this and make them children
|
||||||
if (match_start != (int)match_stack.size()) {
|
if (match_start != int(match_stack.size())) {
|
||||||
TokenPtr t(new Token("", match_type, filename, match_stack[match_start]->start.line, match_stack[match_start]->start.column, line, col));
|
TokenPtr t(new Token("", match_type, filename, match_stack[match_start]->start.line, match_stack[match_start]->start.column, line, col));
|
||||||
t->children.assign(match_stack.begin() + (match_start), match_stack.end());
|
t->children.assign(match_stack.begin() + (match_start), match_stack.end());
|
||||||
match_stack.erase(match_stack.begin() + (match_start), match_stack.end());
|
match_stack.erase(match_stack.begin() + (match_start), match_stack.end());
|
||||||
|
Reference in New Issue
Block a user