| Index: trunk/extensions/NativePreprocessor/nodes.h |
| — | — | @@ -106,7 +106,7 @@ |
| 107 | 107 | ALLOC_NODESTRING(); \ |
| 108 | 108 | serializeNode(nodeString + nodeStringLen, &tmpnode); \ |
| 109 | 109 | nodeStringLen += NODE_LEN; \ |
| 110 | | - storedLength += length; printf("storedLength: %d @%d\n", storedLength, __LINE__);\ |
| | 110 | + storedLength += length; \ |
| 111 | 111 | } while (0); |
| 112 | 112 | |
| 113 | 113 | /** |
| — | — | @@ -114,7 +114,7 @@ |
| 115 | 115 | * Adjacent literal nodes are stored inside of a single node. |
| 116 | 116 | */ |
| 117 | 117 | #define addLiteral(literalText,offset,length) \ |
| 118 | | - do { printf("Addliteral '%.*s'\n", length, literalText+offset);\ |
| | 118 | + do { \ |
| 119 | 119 | int my_len = length; \ |
| 120 | 120 | assert( literalText == text ); \ |
| 121 | 121 | if ( my_len == -1 ) { \ |
| — | — | @@ -139,7 +139,7 @@ |
| 140 | 140 | struct node* tmpnode; \ |
| 141 | 141 | if ( currentLiteral.len ) { \ |
| 142 | 142 | storeNodeWithText(literal_node, currentLiteral.from, currentLiteral.len); \ |
| 143 | | - currentLiteral.len = 0; printf("currentLiteral committed\n"); \ |
| | 143 | + currentLiteral.len = 0; \ |
| 144 | 144 | } \ |
| 145 | 145 | \ |
| 146 | 146 | tmpnode = alloc_node(); \ |
| — | — | @@ -156,7 +156,7 @@ |
| 157 | 157 | ALLOC_NODESTRING(); \ |
| 158 | 158 | serializeNode(nodeString + nodeStringLen, tmpnode); \ |
| 159 | 159 | nodeStringLen += NODE_LEN; \ |
| 160 | | - storedLength += charsToSkip; printf("storedLength: %d @%d\n", storedLength, __LINE__);\ |
| | 160 | + storedLength += charsToSkip; \ |
| 161 | 161 | } while(0) |
| 162 | 162 | |
| 163 | 163 | #define closeNode(nodeType) \ |
| — | — | @@ -165,9 +165,8 @@ |
| 166 | 166 | assert( nodeType == tmpnode->type ); \ |
| 167 | 167 | if ( currentLiteral.len ) { \ |
| 168 | 168 | storeNodeWithText(literal_node, currentLiteral.from, currentLiteral.len); \ |
| 169 | | - printf("adding literal of %d with parent %c\n", currentLiteral.len, tmpnode->type); \ |
| 170 | 169 | currentLiteral.len = 0; \ |
| 171 | | - } printf("closing node %c at %d with len of %d\n", tmpnode->type, tmpnode->index, tmpnode->contentLength); \ |
| | 170 | + } \ |
| 172 | 171 | tmpnode->nextSibling = nodeStringLen - tmpnode->index - NODE_LEN; \ |
| 173 | 172 | serializeNode( nodeString + tmpnode->index, tmpnode ); \ |
| 174 | 173 | parentNode = parentNode->parent; \ |
| — | — | @@ -233,7 +232,7 @@ |
| 234 | 233 | * may be our nephew, instead of our sister (we could ask our |
| 235 | 234 | * parent, though) |
| 236 | 235 | */ |
| 237 | | -printf("breakSyntax(%.*s)\n", *nodeStringLen, nodeString); |
| | 236 | + |
| 238 | 237 | if ( node->type == bracket_node ) { |
| 239 | 238 | node->type = literal_node; |
| 240 | 239 | node->nextSibling = 0; |
| — | — | @@ -259,7 +258,7 @@ |
| 260 | 259 | } |
| 261 | 260 | |
| 262 | 261 | /* Go for part nodes */ |
| 263 | | - while ( readpos < *nodeStringLen ) {printf("breakSyntaw(%.*s) %d %d\n", *nodeStringLen, nodeString, readpos, writepos); |
| | 262 | + while ( readpos < *nodeStringLen ) { |
| 264 | 263 | assert( nodeString[readpos] == part_node ); /* <part> node */ |
| 265 | 264 | assert( !memcmp( nodeString + readpos + 8, "00000001", 8 ) ); /* Part nodes contain exactly one character (the pipe) */ |
| 266 | 265 | node->contentLength = 1; |