File: parser.pm

package info (click to toggle)
darktable 4.2.1-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 52,960 kB
  • sloc: ansic: 329,632; cpp: 90,717; xml: 18,803; lisp: 12,673; sh: 3,478; javascript: 3,264; perl: 1,888; python: 1,082; ruby: 972; makefile: 536; asm: 46; sql: 38; awk: 21
file content (367 lines) | stat: -rw-r--r-- 11,639 bytes parent folder | download | duplicates (4)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
#  This file is part of darktable,
#  copyright (c) 2013-2020 tobias ellinghaus.
#
#  darktable is free software: you can redistribute it and/or modify
#  it under the terms of the GNU General Public License as published by
#  the Free Software Foundation, either version 3 of the License, or
#  (at your option) any later version.
#
#  darktable is distributed in the hope that it will be useful,
#  but WITHOUT ANY WARRANTY; without even the implied warranty of
#  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
#  GNU General Public License for more details.
#
#  You should have received a copy of the GNU General Public License
#  along with darktable.  If not, see <http://www.gnu.org/licenses/>.

package parser;

use strict;
use warnings;

use scanner;

use Exporter;
our @ISA = 'Exporter';
our @EXPORT = qw( parse parse_dt_module_introspection parse_comments get_typedef );


sub print_error
{
  my $message = shift;
  print STDERR "error: ".$token[$P_FILENAME].":".$token[$P_LINENO].": $message\n" if($main::ERROR_LEVEL >= 1);
}

################# the exposed parser functions #################

sub parse
{
  return parse_typedef();
}

# DT_MODULE_INTROSPECTION(<version>, <params_type>)
sub parse_dt_module_introspection
{
  if(!isdtmoduleintrospection(@token)) { print_error "expecting 'DT_MODULE_INTROSPECTION', found '".token2string(@token)."'"; return; }
  advance_token();

  if(!isleftround(@token)) { print_error "expecting '(', found '".token2string(@token)."'"; return; }
  advance_token();

  if(!isinteger(@token)) { print_error "expecting an integer literal, found '".token2string(@token)."'"; return; }
  my $version = $token[$P_VALUE];
  advance_token();

  if(!iscomma(@token)) { print_error "expecting ',', found '".token2string(@token)."'"; return; }
  advance_token();

  my $params_type = parse_id();
  return if(!defined($params_type));

  if(!isrightround(@token)) { print_error "expecting ')', found '".token2string(@token)."'"; return; }

  return ($version, $params_type);
}

sub parse_comments
{
  foreach my $filename (keys(%comments))
  {
    foreach (@{$comments{$filename}})
    {
      next unless defined($_);
      my $joined_line = "";
      foreach(@{%{$_}{raw}})
      {
        $joined_line .= $_;
      }
      if($joined_line =~ /\$MIN[\s]*:[\s]*([^\s,]+)/) { $_->{min} = $1; }
      if($joined_line =~ /\$MAX[\s]*:[\s]*([^\s,]+)/) { $_->{max} = $1; }
      if($joined_line =~ /\$DEFAULT[\s]*:[\s]*([^\s,]+)/) { $_->{default} = $1; }
      if($joined_line =~ /\$DESCRIPTION[\s]*:[\s]*"([^"]+)"/) { $_->{description} = $1; }
      elsif($joined_line =~ /\$DESCRIPTION[\s]*:[\s]*([^"\s,]+)/) { $_->{description} = $1; }
    }
  }
}

################# the parser internals #################

sub advance_token
{
  @token = get_token();
  if($token[$P_TYPE] == $T_NONE) { print_error "premature EOF"; }
}

sub parse_id
{
  if(!isid(@token)) { print_error "expecting identifier, found '".token2string(@token)."'"; return; }
  my $id = $token[$P_VALUE];
  advance_token();
  return $id;
}

sub parse_typedef
{
  if(!istypedef(@token)) { print_error "expecting 'typedef', found '".token2string(@token)."'"; return; }
  advance_token();

  my $type = parse_type();
  return if(!defined($type));

  my $name = parse_id();
  return if(!defined($name));

  if(!issemicolon(@token)) { print_error "expecting ';', found '".token2string(@token)."'"; return; }

  return ast_typedef_node->new(\@token, $type, $name);
}

sub parse_type
{
  my $ast;
  if(isid(@token))
  {
    # some custom type we don't know. parsing that is out of scope for us. however, we try to fix these later
    $ast = ast_type_typedef_node->new(\@token);
    return if(!defined($ast));
    advance_token();
  }
  elsif($token[$P_TYPE] == $T_KEYWORD)
  {
    if   ($token[$P_VALUE] == $K_UNSIGNED) { advance_token(); $ast = parse_type(); return if(!defined($ast)); return if(!$ast->set_unsigned()); }
    elsif($token[$P_VALUE] == $K_SIGNED) { advance_token(); $ast = parse_type(); return if(!defined($ast)); return if(!$ast->set_signed()); }
    elsif($token[$P_VALUE] == $K_GBOOLEAN) { $ast = ast_type_gboolean_node->new(\@token); advance_token(); }
    elsif($token[$P_VALUE] == $K_CHAR) { $ast = ast_type_char_node->new(\@token); advance_token(); }
    elsif($token[$P_VALUE] == $K_INT8) { $ast = ast_type_char_node->new(\@token); $ast->set_signed(); advance_token(); }
    elsif($token[$P_VALUE] == $K_UINT8) { $ast = ast_type_char_node->new(\@token); $ast->set_unsigned(); advance_token(); }
    elsif($token[$P_VALUE] == $K_SHORT) { $ast = ast_type_short_node->new(\@token); advance_token(); }
    elsif($token[$P_VALUE] == $K_USHORT) { $ast = ast_type_short_node->new(\@token); $ast->set_unsigned(); advance_token(); }
    elsif($token[$P_VALUE] == $K_INT) { $ast = ast_type_int_node->new(\@token); advance_token(); }
    elsif($token[$P_VALUE] == $K_UINT) { $ast = ast_type_int_node->new(\@token); $ast->set_unsigned(); advance_token(); }
    elsif($token[$P_VALUE] == $K_LONG) { $ast = ast_type_long_node->new(\@token); advance_token(); }
    elsif($token[$P_VALUE] == $K_FLOAT) {
      my @next_token = look_ahead(1);
      if($next_token[$P_TYPE] == $T_KEYWORD && $next_token[$P_VALUE] == $K_COMPLEX)
      {
        advance_token();
        $ast = ast_type_float_complex_node->new(\@token);
      }
      else
      {
        $ast = ast_type_float_node->new(\@token);
      }
      advance_token();
    }
    elsif($token[$P_VALUE] == $K_DOUBLE) { $ast = ast_type_double_node->new(\@token);  advance_token(); }
    elsif($token[$P_VALUE] == $K_STRUCT || $token[$P_VALUE] == $K_UNION) { $ast = parse_struct_or_union(); return if(!defined($ast)); }
    elsif($token[$P_VALUE] == $K_CONST) { advance_token(); $ast = parse_type(); return if(!defined($ast)); $ast->set_const(); }
    elsif($token[$P_VALUE] == $K_STATIC) { advance_token(); $ast = parse_type(); return if(!defined($ast)); $ast->set_static(); }
    elsif($token[$P_VALUE] == $K_ENUM) { $ast = parse_enum(); return if(!defined($ast)); }
    elsif($token[$P_VALUE] == $K_VOID) { $ast = ast_type_void_node->new(\@token); advance_token(); }
    else { print_error "'".token2string(@token)."' is not a valid type"; return; }
  }
  else { print_error "expecting a standard type or an identifier, found '".token2string(@token)."'"; return; }

  return $ast;
}

sub parse_struct_or_union
{
  my $name;
  my $type;

  if(isstruct(@token) || isunion(@token)) { $type = $token[$P_VALUE]; }
  else { print_error "expecting 'struct', found '".token2string(@token)."'"; return; }

  advance_token();

  if(isid(@token)) { $name = parse_id(); return if(!defined($name));}

  if(!isleftcurly(@token)) { print_error "expecting '{', found '".token2string(@token)."'"; return; }

  advance_token();

  my @decl_list = parse_struct_decl_list();
  return if(!@decl_list);

  if(!isrightcurly(@token)) { print_error "expecting '}', found '".token2string(@token)."'"; return; }

  my $ast;
  if($type == $K_STRUCT) { $ast = ast_type_struct_node->new(\@token, $name, \@decl_list); }
  else { $ast = ast_type_union_node->new(\@token, $name, \@decl_list); }

  advance_token();

  return $ast;
}

sub parse_struct_decl_list
{
  my @decl_list;
  while(!isrightcurly(@token))
  {
    my $type = parse_type();
    return if(!defined($type));
    my @declarators = parse_struct_declarator_list();
    return if(!@declarators);
    if(!issemicolon(@token)) { print_error "expecting ';', found '".token2string(@token)."'"; return; }
    advance_token();

    # we want to split something like "int foo, bar;" into "int foo; int bar;"
    foreach(@declarators)
    {
      my $declaration = $_;
      my @tmp_token = ($declaration->{lineno}, $declaration->{filename}, $T_NONE, 0);
      push(@decl_list, ast_declaration_node->new(\@tmp_token, $type, $declaration));
    }
  }
  return @decl_list;
}

sub parse_struct_declarator_list
{
  my @declarators;
  my $declarator = parse_struct_declarator();
  return if(!defined($declarator));
  push(@declarators, $declarator);
  while(iscomma(@token))
  {
    advance_token();
    my $declarator = parse_struct_declarator();
    return if(!defined($declarator));
    push(@declarators, $declarator);
  }
  return @declarators;
}

# we don't support bitfields, so this is a simplified version of what it should be
sub parse_struct_declarator
{
  return parse_declarator();
}

sub parse_enum
{
  my $name;

  if(!isenum(@token)) { print_error "expecting 'enum', found '".token2string(@token)."'"; return; }

  advance_token();

  if(isid(@token)) { $name = parse_id(); return if(!defined($name)); }

  if(!isleftcurly(@token)) { print_error "expecting '{', found '".token2string(@token)."'"; return; }

  advance_token();

  my @enumerator_list = parse_enumerator_list();
  return if(!@enumerator_list);

  if(!isrightcurly(@token)) { print_error "expecting '}', found '".token2string(@token)."'"; return; }

  my $ast = ast_type_enum_node->new(\@token, $name, \@enumerator_list);

  advance_token();

  return $ast;
}

sub parse_enumerator_list
{
  my @enumerator_list;
  while(!isrightcurly(@token))
  {
    # we have to add a copy of token, otherwise we will store a reference and overwrite it again!
    my @id_token = [@token];
    my $id = parse_id();
    return if(!defined($id));
    push(@enumerator_list, [$id, \@id_token]);
    if(isequal(@token))
    {
      # TODO: for now skip everything until a ',' or '}' is found
      while(!iscomma(@token) && !isrightcurly(@token)) { advance_token(); }
    }
    if(iscomma(@token)) { advance_token(); }
  }
  return @enumerator_list;
}

sub parse_declarator
{
  if(isasterisk(@token))
  {
    my $pointer = parse_pointer();
    return if(!defined($pointer));
  }
  return parse_direct_declarator();
}

sub parse_pointer
{
  if(!isasterisk(@token)) { print_error "expecting '*', found '".token2string(@token)."'"; return; }
  print_error "found a pointer. you really shouldn't do that (if it's in the type used for parameters).\n";
  return;

  while(isasterisk(@token) || isconst(@token) || isvolatile(@token))
  {
    advance_token();
  }
}

# only a subset of the C standard is supported here: <id> '[' <integer> ']'
sub parse_direct_declarator
{
  my $declarator;
  if(isleftround(@token))
  {
    advance_token();
    $declarator = parse_declarator();
    return if(!defined($declarator));
    if(!isrightround(@token)) { print_error "expecting ')', found '".token2string(@token)."'"; return; }
    advance_token();
  }
  else
  {
    my @dimension_list;
    my $id = parse_id();
    return if(!defined($id));
    while(isleftsquare(@token))
    {
      my $size = parse_array();
      return if(!defined($size));
      push(@dimension_list, $size);
    }
    $declarator = ast_declarator_node->new(\@token, $id, \@dimension_list);
  }
  return $declarator;
}

sub parse_array
{
  my $size = "";
  my $depth = 0;
  my $space = "";
  if(!isleftsquare(@token)) { print_error "expecting '[', found '".token2string(@token)."'"; return; }

  advance_token();

  while(!(isrightsquare(@token) && $depth == 0))
  {
    $depth++ if(isleftsquare(@token));
    $depth-- if(isrightsquare(@token));
    $size .= $space.token2string(@token);
    $space = " ";
    advance_token();
  }

  if(!isrightsquare(@token)) { print_error "expecting ']', found '".token2string(@token)."'"; return; }

  advance_token();
  return $size;
}

1;

# modelines: These editor modelines have been set for all relevant files by tools/update_modelines.sh
# vim: shiftwidth=2 expandtab tabstop=2 cindent
# kate: tab-indents: off; indent-width 2; replace-tabs on; indent-mode cstyle; remove-trailing-space on;