projects
/
model-checker.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (parent:
8ea66f2
)
nodestack: style
author
Brian Norris
<banorris@uci.edu>
Sat, 15 Dec 2012 00:34:20 +0000
(16:34 -0800)
committer
Brian Norris
<banorris@uci.edu>
Sat, 15 Dec 2012 01:56:27 +0000
(17:56 -0800)
nodestack.cc
patch
|
blob
|
history
diff --git
a/nodestack.cc
b/nodestack.cc
index 2f99aef24639a9cf128f5083362596aaf0c374e5..d4c97652b3c08084d3b08be614638dd054f54913 100644
(file)
--- a/
nodestack.cc
+++ b/
nodestack.cc
@@
-108,7
+108,8
@@
void Node::print_may_read_from()
* Sets a promise to explore meeting with the given node.
* @param i is the promise index.
*/
* Sets a promise to explore meeting with the given node.
* @param i is the promise index.
*/
-void Node::set_promise(unsigned int i, bool is_rmw) {
+void Node::set_promise(unsigned int i, bool is_rmw)
+{
if (i >= promises.size())
promises.resize(i + 1, PROMISE_IGNORE);
if (promises[i] == PROMISE_IGNORE) {
if (i >= promises.size())
promises.resize(i + 1, PROMISE_IGNORE);
if (promises[i] == PROMISE_IGNORE) {
@@
-132,7
+133,8
@@
bool Node::get_promise(unsigned int i) const
* Increments to the next combination of promises.
* @return true if we have a valid combination.
*/
* Increments to the next combination of promises.
* @return true if we have a valid combination.
*/
-bool Node::increment_promise() {
+bool Node::increment_promise()
+{
DBG();
unsigned int rmw_count = 0;
for (unsigned int i = 0; i < promises.size(); i++) {
DBG();
unsigned int rmw_count = 0;
for (unsigned int i = 0; i < promises.size(); i++) {
@@
-189,7
+191,8
@@
int Node::get_misc() const
return misc_index;
}
return misc_index;
}
-bool Node::increment_misc() {
+bool Node::increment_misc()
+{
return (misc_index < misc_max) && ((++misc_index) < misc_max);
}
return (misc_index < misc_max) && ((++misc_index) < misc_max);
}
@@
-209,7
+212,8
@@
bool Node::misc_empty() const
* @param value is the value to backtrack to.
* @return True if the future value was successully added; false otherwise
*/
* @param value is the value to backtrack to.
* @return True if the future value was successully added; false otherwise
*/
-bool Node::add_future_value(uint64_t value, modelclock_t expiration) {
+bool Node::add_future_value(uint64_t value, modelclock_t expiration)
+{
int idx = -1; /* Highest index where value is found */
for (unsigned int i = 0; i < future_values.size(); i++) {
if (future_values[i].value == value) {
int idx = -1; /* Highest index where value is found */
for (unsigned int i = 0; i < future_values.size(); i++) {
if (future_values[i].value == value) {
@@
-408,7
+412,8
@@
const ModelAction * Node::get_read_from() const
* Increments the index into the readsfrom set to explore the next item.
* @return Returns false if we have explored all items.
*/
* Increments the index into the readsfrom set to explore the next item.
* @return Returns false if we have explored all items.
*/
-bool Node::increment_read_from() {
+bool Node::increment_read_from()
+{
DBG();
promises.clear();
if (read_from_index < may_read_from.size()) {
DBG();
promises.clear();
if (read_from_index < may_read_from.size()) {
@@
-422,7
+427,8
@@
bool Node::increment_read_from() {
* Increments the index into the future_values set to explore the next item.
* @return Returns false if we have explored all values.
*/
* Increments the index into the future_values set to explore the next item.
* @return Returns false if we have explored all values.
*/
-bool Node::increment_future_value() {
+bool Node::increment_future_value()
+{
DBG();
promises.clear();
if (future_index < ((int)future_values.size())) {
DBG();
promises.clear();
if (future_index < ((int)future_values.size())) {