nkeynes@359 | 1 | #include <stdlib.h>
|
nkeynes@359 | 2 | #include <stdio.h>
|
nkeynes@359 | 3 | #include <string.h>
|
nkeynes@359 | 4 | #include <ctype.h>
|
nkeynes@359 | 5 | #include "tools/gendec.h"
|
nkeynes@359 | 6 |
|
nkeynes@359 | 7 | #define CONSUME_CHAR(x) if( **str != x ) { fprintf( stderr, "Unexpected input character '%c', expected '%c' at line %d\n", **str, x, yyline ); return -1; } else { (*str)++; }
|
nkeynes@359 | 8 | static int yyline;
|
nkeynes@359 | 9 |
|
nkeynes@359 | 10 | struct rule *new_rule() {
|
nkeynes@359 | 11 | struct rule *rule = malloc( sizeof( struct rule ) );
|
nkeynes@359 | 12 | memset( rule, 0, sizeof( struct rule ) );
|
nkeynes@359 | 13 | return rule;
|
nkeynes@359 | 14 | }
|
nkeynes@359 | 15 |
|
nkeynes@420 | 16 | int parse_registers_block( char *buf, int buflen, FILE *f );
|
nkeynes@420 | 17 | int parse_rule( char **str, struct rule *rule );
|
nkeynes@420 | 18 | int parse_bitstring( char **str, struct rule *rule );
|
nkeynes@420 | 19 | int parse_bitoperand( char **str, struct rule *rule );
|
nkeynes@420 | 20 | int parse_integer( char **str );
|
nkeynes@420 | 21 | int parse_rule_format( char **str, struct rule *rule );
|
nkeynes@420 | 22 | int parse_operand_uses( char **str, struct rule *rule );
|
nkeynes@420 | 23 |
|
nkeynes@420 | 24 |
|
nkeynes@420 | 25 |
|
nkeynes@359 | 26 | struct ruleset *parse_ruleset_file( FILE *f )
|
nkeynes@359 | 27 | {
|
nkeynes@359 | 28 | struct ruleset *rules = malloc( sizeof(struct ruleset ) );
|
nkeynes@359 | 29 | char buf[512];
|
nkeynes@359 | 30 |
|
nkeynes@359 | 31 | rules->rule_count = 0;
|
nkeynes@359 | 32 | yyline = 0;
|
nkeynes@359 | 33 | while( fgets( buf, sizeof(buf), f ) != NULL ) {
|
nkeynes@359 | 34 | yyline++;
|
nkeynes@359 | 35 | if( strncasecmp(buf, "registers", 9) == 0 ) {
|
nkeynes@359 | 36 | parse_registers_block(buf, sizeof(buf), f);
|
nkeynes@359 | 37 | } else if( buf[0] != '\0' && buf[0] != '#' && buf[0] != '\n' ) {
|
nkeynes@359 | 38 | struct rule *rule;
|
nkeynes@359 | 39 | char *p = buf;
|
nkeynes@359 | 40 | rule = new_rule();
|
nkeynes@359 | 41 | if( parse_rule( &p, rule ) != 0 ) {
|
nkeynes@359 | 42 | free( rule );
|
nkeynes@359 | 43 | } else {
|
nkeynes@359 | 44 | rules->rules[rules->rule_count++] = rule;
|
nkeynes@359 | 45 | }
|
nkeynes@359 | 46 | }
|
nkeynes@359 | 47 | }
|
nkeynes@359 | 48 | return rules;
|
nkeynes@359 | 49 | }
|
nkeynes@359 | 50 |
|
nkeynes@359 | 51 | int parse_registers_block( char *buf, int buflen, FILE *f ) {
|
nkeynes@359 | 52 | do {
|
nkeynes@359 | 53 | if( strchr(buf, '}') != NULL ) {
|
nkeynes@359 | 54 | break;
|
nkeynes@359 | 55 | }
|
nkeynes@359 | 56 | } while( fgets( buf, buflen, f ) != NULL );
|
nkeynes@420 | 57 | return 0;
|
nkeynes@359 | 58 | }
|
nkeynes@359 | 59 |
|
nkeynes@359 | 60 | /**
|
nkeynes@359 | 61 | * Parse a single complete rule
|
nkeynes@359 | 62 | * @return 0 on success, non-zero on failure
|
nkeynes@359 | 63 | */
|
nkeynes@359 | 64 | int parse_rule( char **str, struct rule *rule )
|
nkeynes@359 | 65 | {
|
nkeynes@359 | 66 | if( parse_bitstring( str, rule ) != 0 ) {
|
nkeynes@359 | 67 | return -1;
|
nkeynes@359 | 68 | }
|
nkeynes@359 | 69 |
|
nkeynes@359 | 70 | /* consume whitespace in between */
|
nkeynes@359 | 71 | while( isspace(**str) ) (*str)++;
|
nkeynes@359 | 72 | if( **str == '\0' ) {
|
nkeynes@359 | 73 | fprintf( stderr, "Unexpected end of file in rule on line %d\n", yyline );
|
nkeynes@359 | 74 | return -1;
|
nkeynes@359 | 75 | }
|
nkeynes@359 | 76 |
|
nkeynes@359 | 77 | int result = parse_rule_format( str, rule );
|
nkeynes@359 | 78 | if( result == 0 ) {
|
nkeynes@359 | 79 | /* Reverse operand bit shifts */
|
nkeynes@359 | 80 | int j;
|
nkeynes@359 | 81 | for( j=0; j<rule->operand_count; j++ ) {
|
nkeynes@359 | 82 | rule->operands[j].bit_shift =
|
nkeynes@359 | 83 | rule->bit_count - rule->operands[j].bit_shift - rule->operands[j].bit_count;
|
nkeynes@359 | 84 | }
|
nkeynes@359 | 85 | if( **str == '!' ) {
|
nkeynes@359 | 86 | (*str)++;
|
nkeynes@359 | 87 | result = parse_operand_uses( str, rule );
|
nkeynes@359 | 88 | }
|
nkeynes@359 | 89 | }
|
nkeynes@359 | 90 |
|
nkeynes@359 | 91 | return 0;
|
nkeynes@359 | 92 | }
|
nkeynes@359 | 93 |
|
nkeynes@359 | 94 | int parse_bitstring( char **str, struct rule *rule )
|
nkeynes@359 | 95 | {
|
nkeynes@359 | 96 | while( !isspace(**str) ) {
|
nkeynes@359 | 97 | int ch = **str;
|
nkeynes@359 | 98 | (*str)++;
|
nkeynes@359 | 99 | switch( ch ) {
|
nkeynes@359 | 100 | case '0':
|
nkeynes@359 | 101 | rule->bits = rule->bits << 1;
|
nkeynes@359 | 102 | rule->mask = (rule->mask << 1) | 1;
|
nkeynes@359 | 103 | rule->bit_count++;
|
nkeynes@359 | 104 | break;
|
nkeynes@359 | 105 | case '1':
|
nkeynes@359 | 106 | rule->bits = (rule->bits << 1) | 1;
|
nkeynes@359 | 107 | rule->mask = (rule->mask << 1) | 1;
|
nkeynes@359 | 108 | rule->bit_count++;
|
nkeynes@359 | 109 | break;
|
nkeynes@359 | 110 | case '(':
|
nkeynes@359 | 111 | if( parse_bitoperand( str, rule ) != 0 ) {
|
nkeynes@359 | 112 | return -1 ;
|
nkeynes@359 | 113 | }
|
nkeynes@359 | 114 | break;
|
nkeynes@359 | 115 | default:
|
nkeynes@359 | 116 | (*str)--;
|
nkeynes@359 | 117 | fprintf( stderr, "Unexpected character '%c' in bitstring at line %d\n", ch, yyline );
|
nkeynes@359 | 118 | return -1;
|
nkeynes@359 | 119 | }
|
nkeynes@359 | 120 | }
|
nkeynes@359 | 121 | return 0;
|
nkeynes@359 | 122 | }
|
nkeynes@359 | 123 |
|
nkeynes@359 | 124 | int parse_bitoperand( char **str, struct rule *rule )
|
nkeynes@359 | 125 | {
|
nkeynes@359 | 126 | char *p = rule->operands[rule->operand_count].name;
|
nkeynes@359 | 127 |
|
nkeynes@359 | 128 | if( rule->operand_count == MAX_OPERANDS ) {
|
nkeynes@359 | 129 | fprintf( stderr, "Maximum operands/rule exceeded (%d) at line %d\n", MAX_OPERANDS, yyline );
|
nkeynes@359 | 130 | return -1;
|
nkeynes@359 | 131 | }
|
nkeynes@359 | 132 |
|
nkeynes@359 | 133 | while( isalnum(**str) || **str == '_' ) {
|
nkeynes@359 | 134 | *p++ = *(*str)++;
|
nkeynes@359 | 135 | }
|
nkeynes@359 | 136 | *p = '\0';
|
nkeynes@359 | 137 | CONSUME_CHAR(':');
|
nkeynes@359 | 138 |
|
nkeynes@359 | 139 | int size = parse_integer( str );
|
nkeynes@359 | 140 | if( size == -1 ) {
|
nkeynes@359 | 141 | return -1;
|
nkeynes@359 | 142 | }
|
nkeynes@359 | 143 | rule->operands[rule->operand_count].bit_count = size;
|
nkeynes@359 | 144 | if( **str == 's' || **str == 'S' ) {
|
nkeynes@359 | 145 | (*str)++;
|
nkeynes@359 | 146 | rule->operands[rule->operand_count].is_signed = 1;
|
nkeynes@359 | 147 | } else if( **str == 'u' || **str == 'U' ) {
|
nkeynes@359 | 148 | (*str)++;
|
nkeynes@359 | 149 | rule->operands[rule->operand_count].is_signed = 0;
|
nkeynes@359 | 150 | }
|
nkeynes@359 | 151 | if( **str == '<' ) {
|
nkeynes@359 | 152 | (*str)++;
|
nkeynes@359 | 153 | CONSUME_CHAR('<');
|
nkeynes@359 | 154 | int lsl = parse_integer(str);
|
nkeynes@359 | 155 | if( lsl == -1 ) {
|
nkeynes@359 | 156 | return -1;
|
nkeynes@359 | 157 | }
|
nkeynes@359 | 158 | rule->operands[rule->operand_count].left_shift = lsl;
|
nkeynes@359 | 159 | }
|
nkeynes@359 | 160 | CONSUME_CHAR(')');
|
nkeynes@359 | 161 |
|
nkeynes@359 | 162 | rule->operands[rule->operand_count].bit_shift = rule->bit_count;
|
nkeynes@359 | 163 | rule->bit_count += size;
|
nkeynes@359 | 164 | rule->bits = rule->bits << size;
|
nkeynes@359 | 165 | rule->mask = rule->mask << size;
|
nkeynes@359 | 166 | rule->operand_count++;
|
nkeynes@359 | 167 | return 0;
|
nkeynes@359 | 168 | }
|
nkeynes@359 | 169 |
|
nkeynes@359 | 170 | int parse_integer( char **str )
|
nkeynes@359 | 171 | {
|
nkeynes@359 | 172 | uint32_t val = 0;
|
nkeynes@359 | 173 | if( !isdigit(**str) ) {
|
nkeynes@359 | 174 | fprintf(stderr, "Expected digit (0-9) but was '%c' at line %d\n", **str, yyline );
|
nkeynes@359 | 175 | return -1;
|
nkeynes@359 | 176 | }
|
nkeynes@359 | 177 | do {
|
nkeynes@359 | 178 | val = val * 10 + (**str - '0');
|
nkeynes@359 | 179 | (*str)++;
|
nkeynes@359 | 180 | } while( isdigit(**str) );
|
nkeynes@359 | 181 | return val;
|
nkeynes@359 | 182 | }
|
nkeynes@359 | 183 |
|
nkeynes@359 | 184 | int parse_rule_format( char **str, struct rule *rule )
|
nkeynes@359 | 185 | {
|
nkeynes@359 | 186 |
|
nkeynes@359 | 187 | char tmp[64];
|
nkeynes@359 | 188 | char *p = tmp;
|
nkeynes@359 | 189 | while( **str != '\n' && **str != '\0' && **str != '!' ) {
|
nkeynes@359 | 190 | *p++ = *(*str)++;
|
nkeynes@359 | 191 | }
|
nkeynes@359 | 192 | *p = '\0';
|
nkeynes@359 | 193 | strcpy( rule->format, tmp );
|
nkeynes@359 | 194 |
|
nkeynes@359 | 195 | return 0;
|
nkeynes@359 | 196 | }
|
nkeynes@359 | 197 |
|
nkeynes@359 | 198 | int parse_operand_uses( char **str, struct rule *rule )
|
nkeynes@359 | 199 | {
|
nkeynes@420 | 200 | return 0;
|
nkeynes@359 | 201 | }
|
nkeynes@359 | 202 |
|
nkeynes@359 | 203 | void dump_ruleset( struct ruleset *rules, FILE *f )
|
nkeynes@359 | 204 | {
|
nkeynes@359 | 205 | int i, j;
|
nkeynes@359 | 206 | fprintf( f, "Rulset: %d rules\n", rules->rule_count );
|
nkeynes@359 | 207 | for( i=0; i<rules->rule_count; i++ ) {
|
nkeynes@359 | 208 | struct rule *rule = rules->rules[i];
|
nkeynes@359 | 209 | fprintf( f, "Match: %08X/%08X %s: ", rule->bits, rule->mask, rule->format );
|
nkeynes@359 | 210 | for( j=0; j<rule->operand_count; j++ ) {
|
nkeynes@359 | 211 | fprintf( f, "%s = (%s)(ir>>%d)&0x%X ", rule->operands[j].name,
|
nkeynes@359 | 212 | rule->operands[j].is_signed ? "signed" : "unsigned",
|
nkeynes@359 | 213 | rule->operands[j].bit_shift,
|
nkeynes@359 | 214 | (1<<rule->operands[j].bit_count)-1 );
|
nkeynes@359 | 215 | }
|
nkeynes@359 | 216 | fprintf( f, "\n" );
|
nkeynes@359 | 217 | }
|
nkeynes@359 | 218 | }
|
nkeynes@359 | 219 |
|
nkeynes@359 | 220 | void dump_rulesubset( struct ruleset *rules, int ruleidx[], int rule_count, FILE *f )
|
nkeynes@359 | 221 | {
|
nkeynes@359 | 222 | int i,j;
|
nkeynes@359 | 223 | for( i=0; i<rule_count; i++ ) {
|
nkeynes@359 | 224 | struct rule *rule = rules->rules[ruleidx[i]];
|
nkeynes@359 | 225 | fprintf( f, "Match: %08X/%08X %s: ", rule->bits, rule->mask, rule->format );
|
nkeynes@359 | 226 | for( j=0; j<rule->operand_count; j++ ) {
|
nkeynes@359 | 227 | fprintf( f, "%s = (%s)(ir>>%d)&0x%X ", rule->operands[j].name,
|
nkeynes@359 | 228 | rule->operands[j].is_signed ? "signed" : "unsigned",
|
nkeynes@359 | 229 | rule->operands[j].bit_shift,
|
nkeynes@359 | 230 | (1<<rule->operands[j].bit_count)-1 );
|
nkeynes@359 | 231 | }
|
nkeynes@359 | 232 | fprintf( f, "\n" );
|
nkeynes@359 | 233 | }
|
nkeynes@359 | 234 | }
|