aboutsummaryrefslogtreecommitdiff
path: root/engines/sci/engine/klists.cpp
diff options
context:
space:
mode:
authorMax Horn2010-07-01 16:04:29 +0000
committerMax Horn2010-07-01 16:04:29 +0000
commit3f429d64a2ef826782bf9af8971ba397b0e2743c (patch)
tree8f366f8353dfc1a4badb420d6f9cf434171b00b4 /engines/sci/engine/klists.cpp
parente309f05162b3b49b3236ebd8faaed124d9c5862a (diff)
downloadscummvm-rg350-3f429d64a2ef826782bf9af8971ba397b0e2743c.tar.gz
scummvm-rg350-3f429d64a2ef826782bf9af8971ba397b0e2743c.tar.bz2
scummvm-rg350-3f429d64a2ef826782bf9af8971ba397b0e2743c.zip
SCI: Rename some variables to match our naming conventions
svn-id: r50549
Diffstat (limited to 'engines/sci/engine/klists.cpp')
-rw-r--r--engines/sci/engine/klists.cpp12
1 files changed, 6 insertions, 6 deletions
diff --git a/engines/sci/engine/klists.cpp b/engines/sci/engine/klists.cpp
index 8e9ec6dccd..0701883a9b 100644
--- a/engines/sci/engine/klists.cpp
+++ b/engines/sci/engine/klists.cpp
@@ -179,7 +179,7 @@ reg_t kEmptyList(EngineState *s, int argc, reg_t *argv) {
return make_reg(0, ((list) ? list->first.isNull() : 0));
}
-static void _k_add_to_front(EngineState *s, reg_t listRef, reg_t nodeRef) {
+static void addToFront(EngineState *s, reg_t listRef, reg_t nodeRef) {
List *list = s->_segMan->lookupList(listRef);
Node *newNode = s->_segMan->lookupNode(nodeRef);
@@ -202,7 +202,7 @@ static void _k_add_to_front(EngineState *s, reg_t listRef, reg_t nodeRef) {
list->first = nodeRef;
}
-static void _k_add_to_end(EngineState *s, reg_t listRef, reg_t nodeRef) {
+static void addToEnd(EngineState *s, reg_t listRef, reg_t nodeRef) {
List *list = s->_segMan->lookupList(listRef);
Node *newNode = s->_segMan->lookupNode(nodeRef);
@@ -250,7 +250,7 @@ reg_t kNodeValue(EngineState *s, int argc, reg_t *argv) {
}
reg_t kAddToFront(EngineState *s, int argc, reg_t *argv) {
- _k_add_to_front(s, argv[0], argv[1]);
+ addToFront(s, argv[0], argv[1]);
return s->r_acc;
}
@@ -288,14 +288,14 @@ reg_t kAddAfter(EngineState *s, int argc, reg_t *argv) {
s->_segMan->lookupNode(oldnext)->pred = argv[2];
} else { // !firstnode
- _k_add_to_front(s, argv[0], argv[2]); // Set as initial list node
+ addToFront(s, argv[0], argv[2]); // Set as initial list node
}
return s->r_acc;
}
reg_t kAddToEnd(EngineState *s, int argc, reg_t *argv) {
- _k_add_to_end(s, argv[0], argv[1]);
+ addToEnd(s, argv[0], argv[1]);
return s->r_acc;
}
@@ -417,7 +417,7 @@ reg_t kSort(EngineState *s, int argc, reg_t *argv) {
for (i = 0;i < input_size;i++) {
reg_t lNode = s->_segMan->newNode(temp_array[i].value, temp_array[i].key);
- _k_add_to_end(s, output_data, lNode);
+ addToEnd(s, output_data, lNode);
}
free(temp_array);