/
generate.py
executable file
·1576 lines (1322 loc) · 53.9 KB
/
generate.py
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
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#!/usr/bin/env python3
import sys
import re
# Jump to the bottom of this file for the main routine
# Some hacks to make the API more readable, and to keep backwards compability
_cname_re = re.compile('([A-Z0-9][a-z]+|[A-Z0-9]+(?![a-z])|[a-z]+)')
_cname_special_cases = {'DECnet': 'decnet'}
_to_snake_case_re = re.compile(r'(?<![\^A-Z])(?=[A-Z])')
_extension_special_cases = ['XPrint', 'XCMisc', 'BigRequests']
_c_keywords = {
'type': 'type_',
'match': 'match_',
}
_hlines = []
_hlevel = 0
_clines = []
_clevel = 0
_ns = None
# global variable to keep track of serializers and
# switch data types due to weird dependencies
finished_serializers = []
finished_sizeof = []
finished_switch = []
# keeps enum objects so that we can refer to them when generating manpages.
enums = {}
manpaths = False
def to_snake_case(s):
return _to_snake_case_re.sub('_', s).lower()
def _h(fmt, *args):
'''
Writes the given line to the header file.
'''
_hlines[_hlevel].append(fmt % args)
def _h_setlevel(idx):
'''
Changes the array that header lines are written to.
Supports writing different sections of the header file.
'''
global _hlevel
while len(_hlines) <= idx:
_hlines.append([])
_hlevel = idx
def _n_item(str):
'''
Does C-name conversion on a single string fragment.
Uses a regexp with some hard-coded special cases.
'''
if str in _cname_special_cases:
return _cname_special_cases[str]
else:
split = _cname_re.finditer(str)
name_parts = [match.group(0) for match in split]
return '_'.join(name_parts)
def _cpp(str):
'''
Checks for certain C++ reserved words and fixes them.
'''
if str in _c_keywords:
return _c_keywords[str]
else:
return str
def _ext(str):
'''
Does C-name conversion on an extension name.
Has some additional special cases on top of _n_item.
'''
if str in _extension_special_cases:
return _n_item(str).lower()
else:
return str.lower()
def _n(list):
'''
Does C-name conversion on a tuple of strings.
Different behavior depending on length of tuple, extension/not extension, etc.
Basically C-name converts the individual pieces, then joins with underscores.
'''
if len(list) == 1:
parts = list
elif len(list) == 2:
parts = [list[0], _n_item(list[1])]
elif _ns.is_ext:
parts = [list[0], _ext(list[1])] + [_n_item(i) for i in list[2:]]
else:
parts = [list[0]] + [_n_item(i) for i in list[1:]]
return '_'.join(parts).lower()
c_type_to_rust = {
'uint8_t': 'u8',
'uint16_t': 'u16',
'uint32_t': 'u32',
'uint64_t': 'u64',
'int8_t': 'i8',
'int16_t': 'i16',
'int32_t': 'i32',
'int64_t': 'i64',
'char': 'c_char',
'float': 'f32',
'double': 'f64',
'void': 'c_void',
}
def _t(list):
'''
Does C-name conversion on a tuple of strings representing a type.
Same as _n but adds a "_t" on the end.
'''
if len(list) == 1:
parts = list
if list[0] in c_type_to_rust:
return c_type_to_rust[list[0]]
elif len(list) == 2:
parts = [list[0], _n_item(list[1]), 't']
elif _ns.is_ext:
parts = [list[0], _ext(list[1])] + [_n_item(i) for i in list[2:]] + ['t']
else:
parts = [list[0]] + [_n_item(i) for i in list[1:]] + ['t']
return '_'.join(parts).lower()
def add_sym(name, params, rv='()', fn=True):
params_str = ''
args_str = ''
for pname, ty in params:
params_str += f'{pname}: {ty}, '
args_str += f'{pname}, '
invocation = ''
unsafe = ''
if fn:
invocation = f'({args_str})'
unsafe = 'unsafe '
body = f'sym!(self, {name}){invocation}'
if not fn:
body = 'unsafe { ' + body + ' }'
if rv == '()':
fnrv = ''
else:
fnrv = ' -> ' + rv
_h_setlevel(1)
if fn:
_h(f' {name}: LazySymbol<unsafe fn({params_str}){fnrv}>,')
else:
_h(f' {name}: LazySymbol<{rv}>,')
_h_setlevel(2)
_h(' #[inline]')
_h(f' pub {unsafe}fn {name}(&self, {params_str}){fnrv} {{ {body} }}')
_h('')
_h(f' /// Returns `true` iff the symbol `{name}` could be loaded.')
_h(f' #[cfg(feature = "has_symbol")]')
_h(f' pub fn has_{name}(&self) -> bool {{ has_sym!(self, {name}) }}')
_h_setlevel(3)
_h(f' assert!(lib.has_{name}());')
def c_open(self):
'''
Exported function that handles module open.
Opens the files and writes out the auto-generated comment, header file includes, etc.
'''
global _ns
_ns = self.namespace
_ns.c_ext_global_name = _n(_ns.prefix + ('id',))
obj_names = {
'bigreq': 'Xcb',
'xc_misc': 'Xcb',
'xproto': 'Xcb',
'xf86dri': 'XcbXf86dri',
}
if _ns.header in obj_names:
_ns.rust_obj_name = obj_names[_ns.header]
else:
_ns.rust_obj_name = 'Xcb' + _ns.header.title()
no_feature = {'bigreq', 'xc_misc', 'xproto'}
if _ns.header in no_feature:
feature = None
else:
feature = f'#[cfg(feature = "xcb_{_ns.header.lower()}")]'
local_obj_name = f'{_ns.rust_obj_name}{_ns.header.title()}'
# Build the type-name collision avoidance table used by c_enum
build_collision_table()
_h_setlevel(0)
_h('// This file was generated using generate.py. Do not edit.')
_h('#![allow(unused_macros)]')
_h('')
_h('use crate::ffi::*;')
_h('use crate::*;')
_h('use crate::lazy::*;')
_h('use std::os::raw::*;')
_h('')
_h_setlevel(1)
_h('')
if feature:
_h(feature)
_h(f'pub(crate) struct {local_obj_name} {{')
_h_setlevel(2)
_h('')
_h('macro_rules! sym {')
_h(' ($self:expr, $f:ident) => {')
_h(f' $self.{_ns.header}.$f.get(&$self.lib, concat!(stringify!($f), "\\0"))')
_h(' };')
_h('}')
_h('')
_h('macro_rules! has_sym {')
_h(' ($self:expr, $f:ident) => {')
_h(' unsafe {')
_h(f' $self.{_ns.header}.$f.exists(&$self.lib, concat!(stringify!($f), "\\0"))')
_h(' }')
_h(' };')
_h('}')
_h('')
if feature:
_h(feature)
_h(f'impl {_ns.rust_obj_name} {{')
_h_setlevel(3)
_h('')
if feature:
_h(feature)
_h('#[cfg(all(test, feature = "has_symbol"))]')
_h('mod test {')
_h(' #[test]')
_h(' fn has_all() {')
_h(f' let lib = unsafe {{ crate::{_ns.rust_obj_name}::load().unwrap() }};')
if _ns.is_ext:
_h_setlevel(0)
_h(f'/// The name of the `{_ns.ext_name}` extension.')
_h(f'pub const {_n(_ns.prefix + ("name",)).upper()}: &[u8] = b"{_ns.ext_xname}";')
_h(f'')
_h(f'/// The name of the `{_ns.ext_name}` extension.')
_h(f'pub const {_n(_ns.prefix + ("name", "str")).upper()}: &str = "{_ns.ext_xname}";')
_h(f'')
_h_setlevel(2)
_h(f'/// The libxcb identifier of the `{_ns.ext_name}` extension.')
add_sym(_ns.c_ext_global_name, [], rv='*mut xcb_extension_t', fn=False)
def c_close(self):
'''
Exported function that handles module close.
Writes out all the stored content lines, then closes the files.
'''
_h_setlevel(1)
_h(f'}}')
_h_setlevel(2)
_h(f'}}')
_h_setlevel(3)
_h(f' }}')
_h(f'}}')
# Write header file
hfile = open('src/headers/%s.rs' % _ns.header, 'w')
for list in _hlines:
for line in list:
hfile.write(line)
hfile.write('\n')
hfile.close()
def build_collision_table():
global namecount
namecount = {}
for v in module.types.values():
name = _t(v[0])
namecount[name] = (namecount.get(name) or 0) + 1
def c_enum(self, name):
'''
Exported function that handles enum declarations.
'''
enums[name] = self
tname = _t(name)
if namecount[tname] > 1:
tname = _t(name + ('enum',))
_h_setlevel(0)
_h('')
_h(f'/// The `{_opcode_name(name)}` enum.')
_h('///')
_h('/// This enum has the following variants:')
_h('///')
for (enam, eval) in self.values:
_h(f'/// - [`{_opcode_name(name)}::{enam}`]({_n(name + (enam,)).upper()})')
_h(f'pub type {tname} = u32;')
last_given = None
num_since_last_given = 0
for (enam, eval) in self.values:
if eval == '':
if last_given:
val = f'{last_given} + {num_since_last_given}'
else:
val = f'{num_since_last_given}'
num_since_last_given += 1
else:
val = eval
num_since_last_given = 1
_h(f'/// The `{_opcode_name(name)}::{enam}` enum variant.')
_h(f'///')
_h(f'/// This is a variant of [`{tname}`].')
_h(f'pub const {_n(name + (enam,)).upper()}: {tname} = {val};')
def _c_type_setup(self, name, postfix):
'''
Sets up all the C-related state by adding additional data fields to
all Field and Type objects. Here is where we figure out most of our
variable and function names.
Recurses into child fields and list member types.
'''
# Do all the various names in advance
self.c_type = _t(name + postfix)
self.c_iterator_type = _t(name + ('iterator',))
self.c_next_name = _n(name + ('next',))
self.c_end_name = _n(name + ('end',))
self.c_request_name = _n(name)
self.c_checked_name = _n(name + ('checked',))
self.c_unchecked_name = _n(name + ('unchecked',))
self.c_reply_name = _n(name + ('reply',))
self.c_reply_type = _t(name + ('reply',))
self.c_cookie_type = _t(name + ('cookie',))
self.c_reply_fds_name = _n(name + ('reply_fds',))
self.c_need_aux = False
self.c_need_serialize = False
self.c_need_sizeof = False
self.c_aux_name = _n(name + ('aux',))
self.c_aux_checked_name = _n(name + ('aux', 'checked'))
self.c_aux_unchecked_name = _n(name + ('aux', 'unchecked'))
self.c_serialize_name = _n(name + ('serialize',))
self.c_unserialize_name = _n(name + ('unserialize',))
self.c_unpack_name = _n(name + ('unpack',))
self.c_sizeof_name = _n(name + ('sizeof',))
# special case: structs where variable size fields are followed by fixed size fields
self.c_var_followed_by_fixed_fields = False
if self.is_switch:
self.c_need_serialize = True
self.c_container = 'struct'
for bitcase in self.bitcases:
bitcase.c_field_name = _cpp(bitcase.field_name)
bitcase_name = bitcase.field_type if bitcase.type.has_name else name
_c_type_setup(bitcase.type, bitcase_name, ())
elif self.is_container:
self.c_container = 'union' if self.is_union else 'struct'
prev_varsized_field = None
prev_varsized_offset = 0
first_field_after_varsized = None
for field in self.fields:
if field.type.is_event:
field.c_field_type = _t(field.field_type + ('event',))
else:
field.c_field_type = _t(field.field_type)
if field.type.nmemb and field.type.nmemb > 1:
field.c_field_type = f'[{field.c_field_type}; {field.type.nmemb}]'
field.has_c_field_const_type = False if field.type.nmemb == 1 else True
field.c_field_name = _cpp(field.field_name)
field.has_c_pointer = False if field.type.nmemb == 1 else True
# correct the c_pointer field for variable size non-list types
if not field.type.fixed_size() and not field.has_c_pointer:
field.has_c_pointer = True
if field.type.is_list and not field.type.member.fixed_size():
field.has_c_pointer = True
if field.type.is_switch:
field.has_c_pointer = True
field.has_c_field_const_type = True
self.c_need_aux = True
if not field.type.fixed_size() and not field.type.is_case_or_bitcase and field.wire:
self.c_need_sizeof = True
field.c_iterator_type = _t(field.field_type + ('iterator',)) # xcb_fieldtype_iterator_t
field.c_iterator_name = _n(name + (field.field_name, 'iterator')) # xcb_container_field_iterator
field.c_accessor_name = _n(name + (field.field_name,)) # xcb_container_field
field.c_length_name = _n(name + (field.field_name, 'length')) # xcb_container_field_length
field.c_end_name = _n(name + (field.field_name, 'end')) # xcb_container_field_end
field.prev_varsized_field = prev_varsized_field
field.prev_varsized_offset = prev_varsized_offset
if prev_varsized_offset == 0:
first_field_after_varsized = field
field.first_field_after_varsized = first_field_after_varsized
if field.type.fixed_size():
if field.wire:
prev_varsized_offset += field.type.size
# special case: intermixed fixed and variable size fields
if prev_varsized_field is not None and not field.type.is_pad and field.wire:
if not self.is_union:
self.c_need_serialize = True
self.c_var_followed_by_fixed_fields = True
else:
self.last_varsized_field = field
prev_varsized_field = field
prev_varsized_offset = 0
if self.c_var_followed_by_fixed_fields:
if field.type.fixed_size():
field.prev_varsized_field = None
# recurse into this field this has to be done here, i.e.,
# after the field has been set up. Otherwise the function
# _c_helper_fieldaccess_expr will produce garbage or crash
_c_type_setup(field.type, field.field_type, ())
if field.type.is_list:
_c_type_setup(field.type.member, field.field_type, ())
if (field.type.nmemb is None and field.wire):
self.c_need_sizeof = True
if self.c_need_serialize:
# when _unserialize() is wanted, create _sizeof() as well for consistency reasons
self.c_need_sizeof = True
# as switch does never appear at toplevel,
# continue here with type construction
if self.is_switch:
if self.c_type not in finished_switch:
finished_switch.append(self.c_type)
# special: switch C structs get pointer fields for variable-sized members
_c_complex(self, _opcode_name(name), 'switch')
for bitcase in self.bitcases:
bitcase_name = bitcase.type.name if bitcase.type.has_name else name
_c_accessors(bitcase.type, bitcase_name, bitcase_name)
# no list with switch as element, so no call to
# _c_iterator(field.type, field_name) necessary
if not self.is_case_or_bitcase:
if self.c_need_serialize:
if self.c_serialize_name not in finished_serializers:
finished_serializers.append(self.c_serialize_name)
_c_serialize('serialize', self)
# _unpack() and _unserialize() are only needed for special cases:
# switch -> unpack
# special cases -> unserialize
if self.is_switch or self.c_var_followed_by_fixed_fields:
_c_serialize('unserialize', self)
if self.c_need_sizeof:
if self.c_sizeof_name not in finished_sizeof:
if not module.namespace.is_ext or self.name[:2] == module.namespace.prefix:
finished_sizeof.append(self.c_sizeof_name)
_c_serialize('sizeof', self)
# Functions for querying field properties
def _c_field_needs_list_accessor(field):
return field.type.is_list and not field.type.fixed_size()
def _c_field_needs_field_accessor(field):
if field.type.is_list:
return False
else:
return (field.prev_varsized_field is not None or
not field.type.fixed_size())
def _c_field_needs_accessor(field):
return (_c_field_needs_list_accessor(field) or
_c_field_needs_field_accessor(field))
def _c_field_is_member_of_case_or_bitcase(field):
return field.parent and field.parent.is_case_or_bitcase
def _c_helper_fieldaccess_expr(prefix, field=None):
"""
turn prefix, which is a list of tuples (name, separator, Type obj) into a string
representing a valid field-access-expression in C (based on the context)
if field is not None, append access to the field as well.
"separator" is one of the C-operators "." or "->".
A field access expression can consist of the following components:
* struct/union member access from a value with the "."-operator
* struct/union member access from a pointer with "->"-operator
* function-call of an accessor function:
This is used when a xcb-field is not contained in a struct.
This can, e.g., happen for fields after var-sized fields, etc.
"""
prefix_str = ''
last_sep = ''
for name, sep, obj in prefix:
prefix_str += last_sep + name
last_sep = sep
if field is None:
# add separator for access to a yet unknown field
prefix_str += last_sep
else:
if _c_field_needs_accessor(field):
if _c_field_is_member_of_case_or_bitcase(field):
# case members are available in the deserialized struct,
# so there is no need to use the accessor function
# (also, their accessor function needs a different arglist
# so this would require special treatment here)
# Therefore: Access as struct member
prefix_str += last_sep + _cpp(field.field_name)
else:
# Access with the accessor function
prefix_str = field.c_accessor_name + "(" + prefix_str + ")"
else:
# Access as struct member
prefix_str += last_sep + _cpp(field.field_name)
return prefix_str
def _c_helper_field_mapping(complex_type, prefix, flat=False):
"""
generate absolute names, based on prefix, for all fields starting from complex_type
if flat == True, nested complex types are not taken into account
"""
all_fields = {}
if complex_type.is_switch:
for b in complex_type.bitcases:
if b.type.has_name:
switch_name, switch_sep, switch_type = prefix[-1]
bitcase_prefix = prefix + [(b.type.name[-1], '.', b.type)]
else:
bitcase_prefix = prefix
if (flat and not b.type.has_name) or not flat:
all_fields.update(_c_helper_field_mapping(b.type, bitcase_prefix, flat))
else:
for f in complex_type.fields:
fname = _c_helper_fieldaccess_expr(prefix, f)
if f.field_name in all_fields:
raise Exception("field name %s has been registered before" % f.field_name)
all_fields[f.field_name] = (fname, f)
if f.type.is_container and not flat:
if f.type.is_case_or_bitcase and not f.type.has_name:
new_prefix = prefix
elif f.type.is_switch and len(f.type.parents) > 1:
# nested switch gets another separator
new_prefix = prefix + [(f.c_field_name, '.', f.type)]
else:
new_prefix = prefix + [(f.c_field_name, '->', f.type)]
all_fields.update(_c_helper_field_mapping(f.type, new_prefix, flat))
return all_fields
def _c_helper_resolve_field_names(prefix):
"""
get field names for all objects in the prefix array
"""
all_fields = {}
tmp_prefix = []
# look for fields in the remaining containers
for idx, (name, sep, obj) in enumerate(prefix):
if '' == sep:
# sep can be preset in prefix, if not, make a sensible guess
sep = '.' if (obj.is_switch or obj.is_case_or_bitcase) else '->'
# exception: 'toplevel' object (switch as well!) always have sep '->'
sep = '->' if idx < 1 else sep
if not obj.is_case_or_bitcase or (obj.is_case_or_bitcase and obj.has_name):
tmp_prefix.append((name, sep, obj))
all_fields.update(_c_helper_field_mapping(obj, tmp_prefix, flat=True))
return all_fields
def get_expr_fields(self):
"""
get the Fields referenced by switch or list expression
"""
def get_expr_field_names(expr):
if expr.op is None or expr.op == 'calculate_len':
if expr.lenfield_name is not None:
return [expr.lenfield_name]
else:
# constant value expr
return []
else:
if expr.op == '~':
return get_expr_field_names(expr.rhs)
elif expr.op == 'popcount':
return get_expr_field_names(expr.rhs)
elif expr.op == 'sumof':
# sumof expr references another list,
# we need that list's length field here
field = None
for f in expr.lenfield_parent.fields:
if f.field_name == expr.lenfield_name:
field = f
break
if field is None:
raise Exception("list field '%s' referenced by sumof not found" % expr.lenfield_name)
# referenced list + its length field
return [expr.lenfield_name] + get_expr_field_names(field.type.expr)
elif expr.op == 'enumref':
return []
else:
return get_expr_field_names(expr.lhs) + get_expr_field_names(expr.rhs)
# get_expr_field_names()
# resolve the field names with the parent structure(s)
unresolved_fields_names = get_expr_field_names(self.expr)
# construct prefix from self
prefix = [('', '', p) for p in self.parents]
if self.is_container:
prefix.append(('', '', self))
all_fields = _c_helper_resolve_field_names(prefix)
resolved_fields_names = [x for x in unresolved_fields_names if x in all_fields]
if len(unresolved_fields_names) != len(resolved_fields_names):
raise Exception("could not resolve all fields for %s" % self.name)
resolved_fields = [all_fields[n][1] for n in resolved_fields_names]
return resolved_fields
def resolve_expr_fields(complex_obj):
"""
find expr fields appearing in complex_obj and descendents that cannot be resolved within complex_obj
these are normally fields that need to be given as function parameters
"""
all_fields = []
expr_fields = []
unresolved = []
for field in complex_obj.fields:
all_fields.append(field)
if field.type.is_switch or field.type.is_list:
expr_fields += get_expr_fields(field.type)
if field.type.is_container:
expr_fields += resolve_expr_fields(field.type)
# try to resolve expr fields
for e in expr_fields:
if e not in all_fields and e not in unresolved:
unresolved.append(e)
return unresolved
def resolve_expr_fields_list(self, parents):
"""
Find expr fields appearing in a list and descendents
that cannot be resolved within the parents of the list.
These are normally fields that need to be given as function parameters
for length and iterator functions.
"""
all_fields = []
expr_fields = get_expr_fields(self)
unresolved = []
dont_resolve_this = ''
for complex_obj in parents:
for field in complex_obj.fields:
if field.type.is_list and field.type.expr.op == 'calculate_len':
dont_resolve_this = field.type.expr.lenfield_name
if field.wire:
all_fields.append(field)
# try to resolve expr fields
for e in expr_fields:
if e not in all_fields and e not in unresolved and e.field_name != dont_resolve_this:
unresolved.append(e)
return unresolved
def get_serialize_params(context, self, buffer_var='_buffer', aux_var='_aux'):
"""
functions like _serialize(), _unserialize(), and _unpack() sometimes need additional parameters:
E.g. in order to unpack switch, extra parameters might be needed to evaluate the switch
expression. This function tries to resolve all fields within a structure, and returns the
unresolved fields as the list of external parameters.
"""
def add_param(params, param):
if param not in params:
params.append(param)
else:
raise 'Should not happen'
# collect all fields into param_fields
param_fields = []
for field in self.fields:
if field.visible:
# the field should appear as a parameter in the function call
param_fields.append(field)
# in case of switch, parameters always contain any fields referenced in the switch expr
# we do not need any variable size fields here, as the switch data type contains both
# fixed and variable size fields
if self.is_switch:
param_fields = get_expr_fields(self)
# _serialize()/_unserialize()/_unpack() function parameters
# note: don't use set() for params, it is unsorted
params = []
parameter = ''
if self.is_list:
parameter = self.type.expr.lenfield_name
# 1. the parameter for the void * buffer
if 'serialize' == context:
params.append((buffer_var, '*mut *mut c_void'))
elif context in ('unserialize', 'unpack', 'sizeof'):
params.append((buffer_var, '*const c_void'))
# 2. any expr fields that cannot be resolved within self and descendants
unresolved_fields = resolve_expr_fields(self)
for f in unresolved_fields:
add_param(params, (f.c_field_name, f.c_field_type))
# 3. param_fields contain the fields necessary to evaluate the switch expr or any other fields
# that do not appear in the data type struct
for p in param_fields:
if self.is_switch:
if p.has_c_pointer:
if p.has_c_field_const_type:
ty = f'*const {p.c_field_type}'
else:
ty = f'*mut {p.c_field_type}'
else:
ty = p.c_field_type
add_param(params, (p.c_field_name, ty))
else:
if p.visible and not p.wire and not p.auto and p.field_name != parameter:
add_param(params, (p.c_field_name, p.c_field_type))
# 4. aux argument
if 'serialize' == context:
add_param(params, (aux_var, f'*const {self.c_type}'))
elif 'unserialize' == context:
add_param(params, (aux_var, f'*mut *mut {self.c_type}'))
elif 'unpack' == context:
add_param(params, (aux_var, f'*mut {self.c_type}'))
# 5. switch contains all variable size fields as struct members
# for other data types though, these have to be supplied separately
# this is important for the special case of intermixed fixed and
# variable size fields
if not self.is_switch and 'serialize' == context:
for p in param_fields:
if not p.type.fixed_size():
if p.has_c_field_const_type:
ty = f'*const {p.c_field_type}'
else:
ty = f'*mut {p.c_field_type}'
add_param(params, (p.c_field_name, ty))
return params
def _c_get_additional_type_params(type):
"""
compute list of additional params for functions created for the given type
"""
if type.is_simple:
return []
else:
params = get_serialize_params('sizeof', type)
return params[1:]
def _c_serialize(context, self):
"""
depending on the context variable, generate _serialize(), _unserialize(), _unpack(), or _sizeof()
for the ComplexType variable self
"""
if self.is_switch and context == 'unserialize':
context = 'unpack'
cases = {'serialize': self.c_serialize_name,
'unserialize': self.c_unserialize_name,
'unpack': self.c_unpack_name,
'sizeof': self.c_sizeof_name}
func_name = cases[context]
params = get_serialize_params(context, self)
_h_setlevel(2)
_h('')
if context == 'serialize':
_h(f'/// Serializes a `{self.c_type}` object.')
elif context == 'unserialize':
_h(f'/// Deserializes a `{self.c_type}` object.')
_h(f'///')
_h(f'/// The object returned in `_aux` should be freed with `libc::free`.')
elif context == 'unpack':
_h(f'/// Unpacks a `{self.c_type}` object.')
elif context == 'sizeof':
_h(f'/// Computes the size of a `{self.c_type}` object.')
else:
raise
add_sym(func_name, params, rv='c_int')
def impl_default(name):
_h('')
_h(f'impl Default for {name} {{')
_h(' fn default() -> Self {')
_h(' unsafe { std::mem::MaybeUninit::zeroed().assume_init() }')
_h(' }')
_h('}')
def _c_iterator(self, name):
'''
Declares the iterator structure and next/end functions for a given type.
'''
_h_setlevel(0)
_h('')
_h(f'/// An iterator over `{_opcode_name(name)}` objects.')
_h('#[derive(Copy, Clone, Debug)]')
_h('#[repr(C)]')
_h('pub struct %s {', self.c_iterator_type)
_h(' /// The value of the current iteration.')
_h(f' pub data: *mut {self.c_type},')
_h(' /// The number of elements remaining including this one.')
_h(' pub rem: c_int,')
_h(' /// The offset of `data`, in bytes, from the start of the containing object.')
_h(' pub index: c_int,')
# add additional params of the type "self" as fields to the iterator struct
# so that they can be passed to the sizeof-function by the iterator's next-function
params = _c_get_additional_type_params(self)
for name, ty in params:
_h(f' pub {to_snake_case(name)}: {ty},')
_h('}')
impl_default(self.c_iterator_type)
_h_setlevel(2)
_h('')
_h(f'/// Advances a `{self.c_iterator_type}` iterator by 1 element.')
add_sym(self.c_next_name, [('i', f'*mut {self.c_iterator_type}')])
_h_setlevel(2)
_h('')
_h(f'/// Returns a `xcb_generic_iterator_t` pointing just past the end of a `{self.c_iterator_type}`.')
add_sym(self.c_end_name, [('i', f'{self.c_iterator_type}')], rv='xcb_generic_iterator_t')
def _c_accessors_field(self, field):
'''
Declares the accessor functions for a non-list field that follows a variable-length field.
'''
# special case: switch
switch_obj = self if self.is_switch else None
if self.is_case_or_bitcase:
switch_obj = self.parents[-1]
if switch_obj is None:
c_type = self.c_type
else:
c_type = switch_obj.c_type
pointer = ''
if field.type.is_simple:
return_type = field.c_field_type
else:
pointer = ' a pointer to'
if field.type.is_switch and switch_obj is None:
return_type = '*mut c_void'
else:
return_type = '*mut ' + field.c_field_type
_h_setlevel(2)
_h('')
_h(f'/// Returns{pointer} the `{field.c_field_name}` field of a `{c_type}` struct.')
add_sym(field.c_accessor_name, [('r', f'*const {c_type}')], rv=return_type)
def _c_accessors_list(self, field):
'''
Declares the accessor functions for a list field.
Declares a direct-accessor function only if the list members are fixed size.
Declares length and get-iterator functions always.
'''
list = field.type
# special case: switch
# in case of switch, 2 params have to be supplied to certain accessor functions:
# 1. the anchestor object (request or reply)
# 2. the (anchestor) switch object
# the reason is that switch is either a child of a request/reply or nested in another switch,
# so whenever we need to access a length field, we might need to refer to some anchestor type
switch_obj = self if self.is_switch else None
if self.is_case_or_bitcase:
switch_obj = self.parents[-1]
params = []
fields = {}
parents = self.parents if hasattr(self, 'parents') else [self]
# 'R': parents[0] is always the 'toplevel' container type
params.append(('r', f'*const {parents[0].c_type}'))
fields.update(_c_helper_field_mapping(parents[0], [('r', '->', parents[0])], flat=True))
# auxiliary object for 'R' parameters
R_obj = parents[0]
if switch_obj is not None:
# now look where the fields are defined that are needed to evaluate
# the switch expr, and store the parent objects in accessor_params and
# the fields in switch_fields
# 'S': name for the 'toplevel' switch
toplevel_switch = parents[1]
params.append(('s', f'*const {toplevel_switch.c_type}'))
fields.update(_c_helper_field_mapping(toplevel_switch, [('s', '->', toplevel_switch)], flat=True))
# initialize prefix for everything "below" S
prefix = [('s', '->', toplevel_switch)]
# look for fields in the remaining containers
for p in parents[2:] + [self]:
# the separator between parent and child is always '.' here,
# because of nested switch statements
if not p.is_case_or_bitcase or (p.is_case_or_bitcase and p.has_name):
prefix.append((p.name[-1], '.', p))
fields.update(_c_helper_field_mapping(p, prefix, flat=True))
# auxiliary object for 'S' parameter
S_obj = parents[1]
# for functions generated below:
# * compute list of additional parameters which contains as parameter
# any expr fields that cannot be resolved within self and descendants.
# * and make sure that they are accessed without prefix within the function.
unresolved_fields = resolve_expr_fields_list(list, parents)
additional_params = []
additional_param_names = set();
for f in unresolved_fields:
if f.c_field_name not in additional_param_names:
# add to the list of additional params
additional_params.append((to_snake_case(f.c_field_name), f.c_field_type))
# make sure that the param is accessed without prefix within the function
fields[f.c_field_name] = (f.c_field_name, f)
_h_setlevel(1)
if list.member.fixed_size():
idx = 1 if switch_obj is not None else 0
_h_setlevel(2)
_h('')
_h(f'/// Returns a pointer to the `{field.c_field_name}` field of a `{self.c_type}` struct.')
add_sym(field.c_accessor_name, [params[idx]], rv=f'*mut {field.c_field_type}')