void print_hash_table

(

)

Definition at line 1667 of file dns.c.

References dll_get_next(), foutptr, i, MAX_HASH_ENTRIES, red_serv::serv_name, and node::servp.

Referenced by main().

{
        int i;
        RED_DNS_SERVICE *servp;
        int n_entries, max_entry_index = 0;
        int max_entries = 0;

#ifdef VMS
        if( ( foutptr = fopen( "scratch$week:[cp_operator]dim_dns.log", "w" ) 
                ) == (FILE *)0 )
        {
                printf("Cannot open: scratch$week:[cp_operator]dim_dns.log for writing\n");
                fflush(stdout);
                return;
        }       
#endif                                                           
        
        for( i = 0; i < MAX_HASH_ENTRIES; i++ ) 
        {
                n_entries = 0;
#ifdef VMS
                fprintf(foutptr,"HASH[%d] : \n",i);
#endif                                                           
                servp = Service_hash_table[i];
                while( (servp = (RED_DNS_SERVICE *) dll_get_next(
                                                (DLL *) Service_hash_table[i],
                                                (DLL *) servp)) )
                {
#ifdef VMS
                        fprintf(foutptr,"%s\n",servp->serv_name);
#endif                                                           
                        n_entries++;
                }
#ifdef VMS
                fprintf(foutptr,"\n\n");
#endif                                                           
                if(n_entries != 0)
                        printf("HASH[%d] - %d entries\n", i, n_entries);  
                if(n_entries > max_entries)
                {
                        max_entries = n_entries;
                        max_entry_index = i;
                }
        }
#ifdef VMS
        fclose(foutptr);
#endif                                                           
        printf("Maximum : HASH[%d] - %d entries\n", max_entry_index, max_entries);  
        fflush(stdout);
}

Here is the call graph for this function:

Here is the caller graph for this function: