114 static FILE *f_names_c;  variable
298     f_names_c = open_path(output_name,names_c,"w");  in OpenAllFiles()
339     fprintf(f_names_c,"/* Generated routines, do not edit. */\n");  in GenerateInitialFileLines()
340     fprintf(f_names_c,"/* Generated sourcedate %s */\n",  in GenerateInitialFileLines()
342     fprintf(f_names_c,"\n/* BEGIN FILE */\n\n");  in GenerateInitialFileLines()
343     fprintf(f_names_c,"#include \"dwarf.h\"\n\n");  in GenerateInitialFileLines()
344     fprintf(f_names_c,"#include \"libdwarf.h\"\n\n");  in GenerateInitialFileLines()
347         fprintf(f_names_c,"typedef struct Names_Data {\n");  in GenerateInitialFileLines()
348         fprintf(f_names_c,"    const char *l_name; \n");  in GenerateInitialFileLines()
349         fprintf(f_names_c,"    unsigned    value;  \n");  in GenerateInitialFileLines()
350         fprintf(f_names_c,"} Names_Data;\n\n");  in GenerateInitialFileLines()
353         fprintf(f_names_c,"/* Use standard binary search to get entry */\n");  in GenerateInitialFileLines()
354         fprintf(f_names_c,"static int\nfind_entry(Names_Data *table,"  in GenerateInitialFileLines()
356         fprintf(f_names_c,"{\n");  in GenerateInitialFileLines()
357         fprintf(f_names_c,"    int low = 0;\n");  in GenerateInitialFileLines()
358         fprintf(f_names_c,"    int high = last;\n");  in GenerateInitialFileLines()
359         fprintf(f_names_c,"    int mid;\n");  in GenerateInitialFileLines()
360         fprintf(f_names_c,"    unsigned maxval = table[last-1].value;\n");  in GenerateInitialFileLines()
361         fprintf(f_names_c,"\n");  in GenerateInitialFileLines()
362         fprintf(f_names_c,"    if (value > maxval) {\n");  in GenerateInitialFileLines()
363         fprintf(f_names_c,"        return DW_DLV_NO_ENTRY;\n");  in GenerateInitialFileLines()
364         fprintf(f_names_c,"    }\n");  in GenerateInitialFileLines()
365         fprintf(f_names_c,"    while (low < high) {\n");  in GenerateInitialFileLines()
366         fprintf(f_names_c,"        mid = low + ((high - low) / 2);\n");  in GenerateInitialFileLines()
367         fprintf(f_names_c,"        if(mid == last) {\n");  in GenerateInitialFileLines()
368         fprintf(f_names_c,"            break;\n");  in GenerateInitialFileLines()
369         fprintf(f_names_c,"        }\n");  in GenerateInitialFileLines()
370         fprintf(f_names_c,"        if (table[mid].value < value) {\n");  in GenerateInitialFileLines()
371         fprintf(f_names_c,"            low = mid + 1;\n");  in GenerateInitialFileLines()
372         fprintf(f_names_c,"        }\n");  in GenerateInitialFileLines()
373         fprintf(f_names_c,"        else {\n");  in GenerateInitialFileLines()
374         fprintf(f_names_c,"              high = mid;\n");  in GenerateInitialFileLines()
375         fprintf(f_names_c,"        }\n");  in GenerateInitialFileLines()
376         fprintf(f_names_c,"    }\n");  in GenerateInitialFileLines()
377         fprintf(f_names_c,"\n");  in GenerateInitialFileLines()
378         fprintf(f_names_c,"    if (low < last && table[low].value == value) {\n");  in GenerateInitialFileLines()
379         fprintf(f_names_c,"        /* Found: low is the entry */\n");  in GenerateInitialFileLines()
380         fprintf(f_names_c,"      *s_out = table[low].l_name;\n");  in GenerateInitialFileLines()
381         fprintf(f_names_c,"      return DW_DLV_OK;\n");  in GenerateInitialFileLines()
382         fprintf(f_names_c,"    }\n");  in GenerateInitialFileLines()
383         fprintf(f_names_c,"    return DW_DLV_NO_ENTRY;\n");  in GenerateInitialFileLines()
384         fprintf(f_names_c,"}\n");  in GenerateInitialFileLines()
385         fprintf(f_names_c,"\n");  in GenerateInitialFileLines()
409     fprintf(f_names_c,"\n/* END FILE */\n");  in WriteFileTrailers()
419     fclose(f_names_c);  in CloseAllFiles()
458     fprintf(f_names_c,"/* ARGSUSED */\n");  in GenerateOneSet()
459     fprintf(f_names_c,"int\n");  in GenerateOneSet()
460     fprintf(f_names_c,"dwarf_get_%s_name (unsigned int val,const char ** s_out)\n",prefix_id);  in GenerateOneSet()
461     fprintf(f_names_c,"{\n");  in GenerateOneSet()
463         fprintf(f_names_c,"    static Names_Data Dwarf_%s_n[] = {\n",prefix_id);  in GenerateOneSet()
465         fprintf(f_names_c,"    switch (val) {\n");  in GenerateOneSet()
471             fprintf(f_names_c,  in GenerateOneSet()
489             fprintf(f_names_c,"    {/* %3u */ \"%s_%s\", ",  in GenerateOneSet()
491             fprintf(f_names_c," %s_%s}", prefix,group_array[u].name);  in GenerateOneSet()
492             fprintf(f_names_c,(u + 1 < array_count) ? ",\n" : "\n");  in GenerateOneSet()
494             fprintf(f_names_c,"    case %s_%s:\n",  in GenerateOneSet()
496             fprintf(f_names_c,"        *s_out = \"%s_%s\";\n",  in GenerateOneSet()
498             fprintf(f_names_c,"        return DW_DLV_OK;\n");  in GenerateOneSet()
508         fprintf(f_names_c,"    };\n\n");  in GenerateOneSet()
511         fprintf(f_names_c,"    const int last_entry = %d;\n",actual_array_count);  in GenerateOneSet()
512         fprintf(f_names_c,"    /* find the entry */\n");  in GenerateOneSet()
513         fprintf(f_names_c,"    int r = find_entry(Dwarf_%s_n,last_entry,val,s_out);\n",prefix_id);  in GenerateOneSet()
514         fprintf(f_names_c,"    return r;\n");  in GenerateOneSet()
515         fprintf(f_names_c,"}\n");  in GenerateOneSet()
517         fprintf(f_names_c,"    }\n");  in GenerateOneSet()
518         fprintf(f_names_c,"    return DW_DLV_NO_ENTRY;\n");  in GenerateOneSet()
519         fprintf(f_names_c,"}\n");  in GenerateOneSet()