@@ -102,12 +102,12 @@
 
 			if (length > 0)
 				insertTree(tree, nextCode[length]++, length, i);
 		}
 	} @finally {
-		of_free(lengthCount);
-		of_free(nextCode);
+		free(lengthCount);
+		free(nextCode);
 	}
 
 	return tree;
 }
 
@@ -126,7 +126,7 @@
 {
 	for (uint_fast8_t i = 0; i < 2; i++)
 		if OF_LIKELY (tree->leaves[i] != NULL)
 			of_huffman_tree_release(tree->leaves[i]);
 
-	of_free(tree);
+	free(tree);
 }