source: libcfa/src/parseconfig.cfa@ a3f2a3e

ADT ast-experimental enum forall-pointer-decay jacob/cs343-translation pthread-emulation qualifiedEnum
Last change on this file since a3f2a3e was a3f2a3e, checked in by Jacob Prud'homme <jafprudhomme@…>, 4 years ago

Simplified validation logic

  • Property mode set to 100644
File size: 4.0 KB
RevLine 
[1896c1f]1#include <fstream.hfa>
[8f01cb04]2#include <parseargs.hfa>
[716e4e6]3#include <stdlib.hfa>
4#include <string.h>
[16f9aca]5#include "parseconfig.hfa"
6
[80ae121]7
8// *********************************** exceptions ***********************************
9
10
[6d8e1ab]11static vtable(Parse_Failure) Parse_Failure_vt;
12
13void ?{}( Parse_Failure & this ) with ( this ) {
14 virtual_table = &Parse_Failure_vt;
15}
16
[d322f62]17static vtable(Validation_Failure) Validation_Failure_vt;
18
[6d8e1ab]19void ?{}( Validation_Failure & this ) with ( this ) {
20 virtual_table = &Validation_Failure_vt;
[80ae121]21}
22
23
24// *********************************** main code ***********************************
25
26
[5e0e488]27struct KVPairs {
[57dff2f]28 size_t size, max_size;
[5e0e488]29 * [ char *, char * ] data;
30};
[f62e741]31
[e74ba77]32void ?{}( KVPairs & kvp ) with ( kvp ) { // default constructor
[5e0e488]33 size = 0; max_size = 0; data = 0p;
34}
[f62e741]35
[e4b37a1]36void ?{}( KVPairs & kvp, size_t size ) { // initialization
[58ebd786]37 kvp.[ size, max_size ] = [ 0, size ];
38 kvp.data = alloc( size );
[5e0e488]39}
[f62e741]40
[e74ba77]41void ^?{}( KVPairs & kvp ) with ( kvp ) { // destructor
[5241ec2]42 for ( i; size ) free( data[i] );
[5e0e488]43 free( data );
44 size = 0; max_size = 0; data = 0p;
45}
46
[02a22a2]47void add_kv_pair( KVPairs & kv_pairs, char * k, char * v ) with ( kv_pairs ) {
[ad78e08]48 if ( max_size == 0 ) {
49 max_size = 1;
50 data = alloc( max_size );
51 } else if ( size == max_size ) {
[58ebd786]52 max_size *= 2;
[cac1d52]53 data = alloc( max_size, data`realloc );
[5e0e488]54 }
55
[82820da]56 data[size].0 = alloc( strlen( k ) );
57 data[size].1 = alloc( strlen( v ) );
58 strcpy( data[size].0, k );
59 strcpy( data[size].1, v );
[5e0e488]60 ++size;
61}
62
[ba61cd9]63
[ecfa7607]64bool comments( ifstream & in, char name[] ) {
[181ef73]65 while () {
[ecfa7607]66 in | name;
67 if ( eof( in ) ) return true;
68 if ( name[0] != '#' ) return false;
69 in | nl; // ignore remainder of line
70 } // while
[16f9aca]71} // comments
72
[33800ac8]73// Parse configuration from a file formatted in shell style
[d8db0af]74KVPairs * parse_tabular_config_format( const char * config_file, size_t num_entries ) {
[e4b37a1]75 * KVPairs kv_pairs = new( num_entries );
[5e0e488]76
[1e05e09]77 ifstream in;
[c2016b6]78 try {
[1e05e09]79 open( in, config_file ); // open the configuration file for input
[cfadd08]80
[12b5b226]81 char key[64];
82 char value[256];
[16f9aca]83
[12b5b226]84 while () { // parameter names can appear in any order
[c1dafea]85 // Must add check to see if already read in a key-value pair,
86 // once we switch to using hash table as intermediate storage
87 if ( comments( in, key ) ) break; // eof ?
[0cfa768]88 in | value;
[d5cfc7e]89
[e4b37a1]90 add_kv_pair( *kv_pairs, key, value );
[d5cfc7e]91
[8e0f2db]92 if ( eof( in ) ) break;
[c1dafea]93 in | nl; // ignore remainder of line
[16f9aca]94 } // for
[1896c1f]95 } catch( Open_Failure * ex; ex->istream == &in ) {
[4bdb7bf]96 delete( kv_pairs );
[6d8e1ab]97 throw *ex;
[16f9aca]98 } // try
[ff3be413]99 close( in );
[e7e5b81]100
[d8db0af]101 return kv_pairs;
[33800ac8]102}
103
[58ebd786]104// Parse configuration values from intermediate format
[d8db0af]105void parse_config( const char * config_file, config_entry entries[], size_t num_entries, config_format format ) {
[f03b1db]106 KVPairs * kv_pairs = 0p;
[d8db0af]107 choose ( format ) {
108 case TABULAR_CONFIG:
109 kv_pairs = parse_tabular_config_format( config_file, num_entries );
110 }
[33800ac8]111
[e7e5b81]112 int entries_so_far = 0;
[d8db0af]113 for ( i; kv_pairs->size ) {
[e7e5b81]114 if ( entries_so_far == num_entries ) break;
115
116 char * src_key, * src_value;
[d8db0af]117 [ src_key, src_value ] = kv_pairs->data[i];
[e7e5b81]118
119 for ( j; num_entries ) {
120 if ( strcmp( src_key, entries[j].key ) != 0 ) continue;
[a3f2a3e]121 // Parse the data
[a0d6987]122 if ( !entries[j].parse( src_value, entries[j].variable ) ) {
123 delete( kv_pairs );
124 throw (Parse_Failure){};
[e7e5b81]125 }
126
[a3f2a3e]127 // Validate the data
128 if ( !entries[j].validate( entries[j].variable ) ) {
[a0d6987]129 delete( kv_pairs );
130 throw (Validation_Failure){};
131 }
132
133 ++entries_so_far;
134
135 break;
[e7e5b81]136 }
137 }
[d8db0af]138
[4bdb7bf]139 delete( kv_pairs );
[16f9aca]140} // processConfigFile
141
[e7e5b81]142
[930609e2]143// *********************************** validation ***********************************
144
145
[c58c65a]146forall(T | Relational( T ))
[930609e2]147bool is_nonnegative( T & value ) {
148 T zero_val = 0;
149 return value >= zero_val;
150}
151
[c58c65a]152forall(T | Relational( T ))
[930609e2]153bool is_positive( T & value ) {
154 T zero_val = 0;
155 return value > zero_val;
156}
157
[c58c65a]158forall(T | Relational( T ))
[930609e2]159bool is_nonpositive( T & value ) {
160 T zero_val = 0;
161 return value <= zero_val;
162}
163
[c58c65a]164forall(T | Relational( T ))
[930609e2]165bool is_negative( T & value ) {
166 T zero_val = 0;
167 return value < zero_val;
168}
169
170
[16f9aca]171// Local Variables: //
172// tab-width: 4 //
173// compile-command: "cfa parseconfig.cfa" //
174// End: //
Note: See TracBrowser for help on using the repository browser.