Index: bxl_decode.c
===================================================================
--- bxl_decode.c	(revision 30734)
+++ bxl_decode.c	(revision 30735)
@@ -133,7 +133,7 @@
 	while(node != NULL) {
 		node = hnode_add_child(t, t->root, leaf_count);
 		if ((node != NULL) && (is_leaf(node))) {
-			t->nodeList[leaf_count] = node;
+			t->node_linear[leaf_count] = node;
 			leaf_count++;
 		}
 	}
@@ -261,7 +261,7 @@
 {
 	int depth = 0;
 	int encoded[257]; /* we need to account for very asymmetric tree topologies */
-	hnode_t *node = ctx->tree.nodeList[inchr];
+	hnode_t *node = ctx->tree.node_linear[inchr];
 
 	ctx->plain_len++;
 	ctx->out_len = 0;
@@ -291,7 +291,7 @@
 		ctx->after_first_bit = 1;
 	}
 
-	htree_update(ctx->tree.nodeList[inchr]);
+	htree_update(ctx->tree.node_linear[inchr]);
 	return ctx->out_len;
 }
 
Index: bxl_decode.h
===================================================================
--- bxl_decode.h	(revision 30734)
+++ bxl_decode.h	(revision 30735)
@@ -37,7 +37,7 @@
 typedef struct htree_s {
 	hnode_t *root;
 	hnode_t pool[512];
-	hnode_t *nodeList[256];
+	hnode_t *node_linear[256];
 	int pool_used;
 } htree_t;