aboutsummaryrefslogtreecommitdiff
path: root/src/zonefile.c
diff options
context:
space:
mode:
authorGravatar Jonas Gunz <himself@jonasgunz.de> 2020-03-16 03:22:23 +0100
committerGravatar Jonas Gunz <himself@jonasgunz.de> 2020-03-16 03:22:23 +0100
commit47334cfaa2315828e6f7b959a1bde180c9c29604 (patch)
treeacf365c3c947664faa97b40e892c63eadb332b35 /src/zonefile.c
parent9dc2a544f88ddedea24d16f05170cb90858c3e9a (diff)
downloaddns-47334cfaa2315828e6f7b959a1bde180c9c29604.tar.gz
moved tree_* functions to tree.h/.c
Diffstat (limited to 'src/zonefile.c')
-rw-r--r--src/zonefile.c81
1 files changed, 0 insertions, 81 deletions
diff --git a/src/zonefile.c b/src/zonefile.c
index 3ed47c8..7ef3535 100644
--- a/src/zonefile.c
+++ b/src/zonefile.c
@@ -16,85 +16,4 @@ int zonefile_query ( char* _hostname, struct record_entry* _entry )
return 1;
}
-static int tree_insert ( struct record_node* _root, struct record_entry* _node )
-{
- struct record_node* node = _root;
-
- while(node) {
- int ret = string_compare ( node->rr->name, _node->name );
- if ( ret > 0 ) {
- node = node->above;
- } else if ( ret < 0 ) {
- node = node->below;
- } else { //Already exists
- return 1;
- }
- }
-
- node = malloc (sizeof(*node));
- if(!node)
- return 1;
-
- node->rr = _node;
-
- return 0;
-}
-
-static int tree_balance ( struct record_node* _root )
-{
- return 1;
-}
-
-static struct record_entry* tree_get ( struct record_node* _root, char* _query )
-{
- struct record_node* node = _root;
-
- while(node) {
- int ret = string_compare ( node->rr->name, _query );
- if ( ret > 0 ) {
- node = node->above;
- } else if ( ret < 0 ) {
- node = node->below;
- } else {
- break;
- }
- }
- return node ? node->rr : NULL;
-
- return 0;
-}
-
-static int tree_destroy ( struct record_node* _root )
-{
- return 1;
-}
-
-int string_compare ( char* _1, char* _2 )
-{
- if ( !_1 || !_2 )
- return 99;
- int i;
- for (i = 0; _1[i] && _2[i]; i++) {
- char c1 = _1[i];
- char c2 = _2[i];
-
- //Convert to uppercase
- if ( c1 >= 97 && c1 <= 122 )
- c1 -= 32;
- if ( c2 >= 97 && c2 <= 122 )
- c2 -= 32;
-
- if (c1 > c2)
- return 1;
- if (c1 < c2)
- return -1;
- }
-
- if ( _1[i] == _2[i] )
- return 0;
- if ( _1[i] )
- return 1;
- if ( _2[i] )
- return -1;
-}