X-Git-Url: http://demsky.eecs.uci.edu/git/?a=blobdiff_plain;f=nodestack.cc;h=d5425e335dad86614b4e09db71717e0b00dfe2d2;hb=8497408d26002ec1a9d7cfd42458f92f2cdd9864;hp=533f75a7fab1bbc2c014d7fc883133b957bb94ed;hpb=7ba211ec7d1cacbaa3ef2027f1a0f534888f1708;p=model-checker.git

diff --git a/nodestack.cc b/nodestack.cc
index 533f75a..d5425e3 100644
--- a/nodestack.cc
+++ b/nodestack.cc
@@ -178,7 +178,7 @@ bool Node::add_future_value(uint64_t value, modelclock_t expiration) {
  * @return true if the future_values set is empty.
  */
 bool Node::future_value_empty() {
-	return ((future_index + 1) >= future_values.size());
+	return ((future_index + 1) >= ((int)future_values.size()));
 }
 
 /**
@@ -288,12 +288,12 @@ void Node::add_read_from(const ModelAction *act)
  * @return The first element in future_values
  */
 uint64_t Node::get_future_value() {
-	ASSERT(future_index<future_values.size());
+	ASSERT(future_index<((int)future_values.size()));
 	return future_values[future_index].value;
 }
 
 modelclock_t Node::get_future_value_expiration() {
-	ASSERT(future_index<future_values.size());
+	ASSERT(future_index<((int)future_values.size()));
 	return future_values[future_index].expiration;
 }
 
@@ -325,9 +325,9 @@ const ModelAction * Node::get_read_from() {
 bool Node::increment_read_from() {
 	DBG();
 	promises.clear();
-	if ((read_from_index+1) < may_read_from.size()) {
+	if (read_from_index < may_read_from.size()) {
 		read_from_index++;
-		return true;
+		return read_from_index < may_read_from.size();
 	}
 	return false;
 }
@@ -339,9 +339,9 @@ bool Node::increment_read_from() {
 bool Node::increment_future_value() {
 	DBG();
 	promises.clear();
-	if ((future_index+1) < future_values.size()) {
+	if (future_index < ((int)future_values.size())) {
 		future_index++;
-		return true;
+		return (future_index < ((int)future_values.size()));
 	}
 	return false;
 }
@@ -418,6 +418,8 @@ void NodeStack::pop_restofstack(int numAhead)
 {
 	/* Diverging from previous execution; clear out remainder of list */
 	unsigned int it=iter+numAhead;
+	for(unsigned int i=it;i<node_list.size();i++)
+		delete node_list[i];
 	node_list.resize(it);
 }