@@ -34,11 +34,11 @@
 
 	return tree;
 }
 
 static void
-insertTree(OFHuffmanTree *tree, uint16_t code, uint8_t length, uint16_t value)
+treeInsert(OFHuffmanTree *tree, uint16_t code, uint8_t length, uint16_t value)
 {
 	while (length > 0) {
 		uint8_t bit;
 
 		length--;
@@ -96,11 +96,11 @@
 
 		for (uint16_t i = 0; i <= maxCode; i++) {
 			uint8_t length = lengths[i];
 
 			if (length > 0)
-				insertTree(tree, nextCode[length]++, length, i);
+				treeInsert(tree, nextCode[length]++, length, i);
 		}
 	} @finally {
 		OFFreeMemory(lengthCount);
 		OFFreeMemory(nextCode);
 	}