This repository was archived by the owner on Nov 1, 2018. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathRawFiles.hs
3199 lines (3168 loc) · 120 KB
/
RawFiles.hs
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
module RawFiles where
import Data.ByteString.Unsafe
import Data.ByteString
import System.IO.Unsafe
-- | Generated from src\/data\/ViaGhc.hs
{-# NOINLINE viaghc_hs #-}
viaghc_hs :: ByteString
viaghc_hs = unsafePerformIO $ unsafePackAddress "\
\{-# OPTIONS_GHC -fglasgow-exts -fno-implicit-prelude #-}\n\
\module Main(main) where\n\
\\n\
\import GHC.Int\n\
\import GHC.Word\n\
\import GHC.IOBase\n\
\import GHC.Prim\n\
\import GHC.Base\n\
\import GHC.Ptr\n\
\import GHC.Err\n\
\\n\
\type World__ = State# RealWorld\n\
\type Array__ a = Array# a\n\
\type MutArray__ a = MutableArray# RealWorld a\n\
\type Ref__ a = MutVar# RealWorld a\n\
\\n\
\type Nothing = ()\n\
\\n\
\theNothing :: Nothing\n\
\theNothing = ()\n\
\\n\
\type JIO a = World__ -> (# World__, a #)\n\
\\n\
\main :: IO ()\n\
\main = IO $ \\rw -> case theRealMain rw of rw' -> (# rw', () #)\n\
\\n\
\unPtr :: Ptr a -> Addr#\n\
\unPtr ptr = case ptr of\n\
\ Ptr addr -> addr\n\
\\n\
\unFunPtr :: FunPtr a -> Addr#\n\
\unFunPtr ptr = case ptr of\n\
\ FunPtr addr -> addr\n\
\\n\
\fromBool :: Bool -> Int#\n\
\fromBool b = case b of\n\
\ False -> 0#\n\
\ True -> 1#\n\
\\n\
\gteChar# a b = gtChar# a b || eqChar# a b\n\
\lteChar# a b = ltChar# a b || eqChar# a b\n\
\\n\
\plusAddr__ :: Addr# -> Addr# -> Addr#\n\
\plusAddr__ a1 a2 = plusAddr# a1 (addr2Int# a2)\n\
\\n\
\alloca__ :: Int# -> (Addr# -> JIO a) -> JIO a\n\
\alloca__ size action s =\n\
\ case newPinnedByteArray# size s of { (# s, mbarr# #) ->\n\
\ case unsafeFreezeByteArray# mbarr# s of { (# s, barr# #) ->\n\
\ case action (byteArrayContents# barr#) s of { (# s, r #) ->\n\
\ case touch# barr# s of { s -> (# s, r #) }\n\
\ }}}\n\
\\n\
\word2Char__ x = chr# (word2Int# x)\n\
\char2Word__ x = int2Word# (ord# x)\n\
\addr2Word__ x = int2Word# (addr2Int# x)\n\
\word2Addr__ x = int2Addr# (word2Int# x)\n\
\\n\
\convertString :: [Char] -> ListTCon Char\n\
\convertString [] = jhc_EmptyList\n\
\convertString (x:xs) = jhc_Cons x (convertString xs)\n\
\\n\
\{-\n\
\error__ :: Addr# -> a\n\
\error__ s = unsafePerformIO $ do\n\
\ error_show s\n\
\ error_exit (I# 255#)\n\
\\n\
\errorInt__ :: Addr# -> Int#\n\
\errorInt__ s = seq (unsafePerformIO $ do\n\
\ error_show s\n\
\ error_exit (I# 255#)) 0#\n\
\\n\
\errorWord__ :: Addr# -> Word#\n\
\errorWord__ s = seq (unsafePerformIO $ do\n\
\ error_show s\n\
\ error_exit (I# 255#)) (int2Word# 0#)\n\
\\n\
\errorAddr__ :: Addr# -> Addr#\n\
\errorAddr__ s = seq (unsafePerformIO $ do\n\
\ error_show s\n\
\ error_exit (I# 255#)) (int2Addr# 0#)\n\
\foreign import ccall unsafe \"puts\" error_show :: Ptr a -> IO ()\n\
\foreign import ccall unsafe \"exit\" error_exit :: Int -> IO a\n\
\ -}\n\
\\n\
\{-# NOINLINE newWorld__ #-}\n\
\newWorld__ :: a -> World__\n\
\newWorld__ a = case lazy a of\n\
\ _ -> realWorld#\n\
\\n\
\theRealMain :: World__ -> World__\n\
\\n\
\"#
-- | Generated from src\/data\/prelude.m4
{-# NOINLINE prelude_m4 #-}
prelude_m4 :: ByteString
prelude_m4 = unsafePerformIO $ unsafePackAddress "\
\m4_divert(`-1')\n\
\m4_define(LBRACE,{)\n\
\m4_define(RBRACE,})\n\
\m4_define(LPAREN,`(')\n\
\m4_define(RPAREN,`)')\n\
\m4_define(COMMA,`,')\n\
\m4_changequote({{,}})\n\
\\n\
\m4_changecom({-,-})\n\
\\n\
\m4_define(ONCE,{{m4_ifdef(done-$1,{{m4_dnl}},{{m4_define(done-$1,1)$1}})}})\n\
\\n\
\m4_define({{m4_for}},{{m4_ifelse($#,0,{{{{$0}}}},{{m4_ifelse(m4_eval($2<=$3),1,\n\
\{{m4_pushdef({{$1}},$2)$4{{}}m4_popdef({{$1}})$0({{$1}},m4_incr($2),$3,{{$4}})}})}})}})\n\
\\n\
\m4_define({{m4_foreach}},{{m4_ifelse(m4_eval($#>2),1,\n\
\{{m4_pushdef({{$1}},{{$3}})$2{{}}m4_popdef({{$1}})m4_dnl\n\
\{{}}m4_ifelse(m4_eval($#>3),1,{{$0({{$1}},{{$2}},m4_shift(m4_shift(m4_shift($@))))}})}})}})\n\
\m4_divert{{}}m4_dnl\n\
\"#
-- | Generated from src\/data\/targets.ini
{-# NOINLINE targets_ini #-}
targets_ini :: ByteString
targets_ini = unsafePerformIO $ unsafePackAddress "\
\;\n\
\; configuration file for architectures and compiler options.\n\
\;\n\
\; the final value set is the one used.\n\
\;\n\
\; all '-m' parameters on the command line are parsed and processed in order.\n\
\;\n\
\; there is an implicit -mdefault processed first\n\
\; entries in the user config file are appended to this one.\n\
\;\n\
\; the cross compilation entries in this file should be treated as examples.\n\
\; although they work out of the box for many systems, cross compilation\n\
\; environments differ, so you may need to override them for your\n\
\; specific setup.\n\
\\n\
\[default]\n\
\cc=gcc\n\
\gc=jgc\n\
\cflags=-std=gnu99 -D_GNU_SOURCE -falign-functions=4 -ffast-math -Wextra -Wall -Wno-unused-parameter -fno-strict-aliasing\n\
\cflags_debug=-g\n\
\cflags_nodebug=-DNDEBUG -O3\n\
\profile=false\n\
\autoload=haskell2010,haskell-extras,haskell98\n\
\\n\
\\n\
\; cross compilation entries\n\
\\n\
\[win32]\n\
\cc=i586-mingw32msvc-gcc\n\
\executable_extension=.exe\n\
\merge=i686\n\
\\n\
\[wii]\n\
\cc=powerpc-eabi-gcc\n\
\byteorder=be\n\
\cflags+=-g -DGEKKO -D__WORDSIZE=32 -mrvl -mcpu=750 -meabi -mhard-float\n\
\executable_extension=.elf\n\
\bits=32\n\
\bits_max=64\n\
\merge=be32\n\
\\n\
\; macintosh, this is for cross compiling, not for native compilation on osx\n\
\[osx]\n\
\\n\
\[osx-intel]\n\
\cc=i686-apple-darwin9-gcc\n\
\merge=i686\n\
\merge=osx\n\
\\n\
\[osx-powerpc]\n\
\cc=powerpc-apple-darwin9-gcc\n\
\merge=be32\n\
\merge=osx\n\
\\n\
\; a couple specific cpus\n\
\[i686]\n\
\merge=le32\n\
\arch=i686\n\
\bits_max=64\n\
\cflags_nodebug+=-fomit-frame-pointer\n\
\\n\
\[x86_64]\n\
\bits_max=64\n\
\merge=le64\n\
\\n\
\[le32]\n\
\\n\
\byteorder=le\n\
\merge=32\n\
\\n\
\[be32]\n\
\byteorder=be\n\
\merge=32\n\
\\n\
\[le64]\n\
\byteorder=le\n\
\merge=64\n\
\\n\
\[be64]\n\
\byteorder=be\n\
\merge=64\n\
\\n\
\[32]\n\
\cflags+=-m32\n\
\bits=32\n\
\\n\
\[64]\n\
\cflags+=-m64\n\
\bits=64\n\
\\n\
\"#
-- | Generated from rts\/rts\/constants.h
{-# NOINLINE constants_h #-}
constants_h :: ByteString
constants_h = unsafePerformIO $ unsafePackAddress "\
\#ifndef RTS_CONSTANTS_H\n\
\#define RTS_CONSTANTS_H\n\
\/* these constants are shared between jhc-prim and the rts. */\n\
\\n\
\// Normal memory block.\n\
\#define SLAB_FLAG_NONE 0\n\
\\n\
\// Each element has a finalizer-list as its second word.\n\
\#define SLAB_FLAG_FINALIZER 1\n\
\\n\
\// In addition to whatever other finalization is done, 'free' should be called\n\
\// on the first word of each entry.\n\
\#define SLAB_FLAG_FREE 2\n\
\\n\
\// Finalizers should be delayed until entire slab is freed up and individually\n\
\// freed members need not be kept track of.\n\
\#define SLAB_FLAG_DELAY 4\n\
\\n\
\// A global finalizer exists for this slab\n\
\#define SLAB_GLOBAL_FINALIZER 8\n\
\\n\
\// slab is a monolith, should be 'free'd when done with and not returned to\n\
\// cache.\n\
\#define SLAB_MONOLITH 16\n\
\\n\
\// virtual flags are never set in a cache but are used internally to keep track\n\
\// of things.\n\
\\n\
\// virtual flag to indicate location is a value\n\
\#define SLAB_VIRTUAL_VALUE 256\n\
\\n\
\// virtual flag to indicate location has a special intererpretation.\n\
\#define SLAB_VIRTUAL_SPECIAL 512\n\
\\n\
\// virtual flag to indication location is a constant.\n\
\#define SLAB_VIRTUAL_CONSTANT 1024\n\
\\n\
\// virtual flag to indication location has been freed. (for debugging)\n\
\#define SLAB_VIRTUAL_FREED 2048\n\
\\n\
\// virtual flag to indication location is lazy.\n\
\#define SLAB_VIRTUAL_LAZY 4096\n\
\\n\
\// virtual flag to indication location is func.\n\
\#define SLAB_VIRTUAL_FUNC 8192\n\
\\n\
\#endif\n\
\"#
-- | Generated from rts\/rts\/stableptr.c
{-# NOINLINE stableptr_c #-}
stableptr_c :: ByteString
stableptr_c = unsafePerformIO $ unsafePackAddress "\
\#include \"jhc_rts_header.h\"\n\
\#include \"sys/queue.h\"\n\
\\n\
\struct StablePtr_list root_StablePtrs = LIST_HEAD_INITIALIZER();\n\
\\n\
\wptr_t c_newStablePtr(sptr_t c)\n\
\{\n\
\ struct StablePtr *sp = malloc(sizeof(struct StablePtr));\n\
\ sp->contents = c;\n\
\ LIST_INSERT_HEAD(&root_StablePtrs, sp, link);\n\
\ assert(GET_PTYPE(sp) == 0);\n\
\ return (wptr_t)TO_SPTR(P_VALUE, (wptr_t)sp);\n\
\}\n\
\\n\
\void c_freeStablePtr(wptr_t wp)\n\
\{\n\
\ struct StablePtr *sp = FROM_SPTR((HsPtr)wp);\n\
\ LIST_REMOVE(sp, link);\n\
\ free(sp);\n\
\}\n\
\\n\
\sptr_t c_derefStablePtr(wptr_t wp)\n\
\{\n\
\ struct StablePtr *sp = FROM_SPTR((HsPtr)wp);\n\
\ return sp->contents;\n\
\}\n\
\\n\
\void hs_free_stable_ptr(HsStablePtr sp)\n\
\{\n\
\ c_freeStablePtr((HsStablePtr)sp);\n\
\}\n\
\void hs_free_fun_ptr(HsFunPtr fp) {}\n\
\\n\
\/*\n\
\wptr_t c_castPtrToStablePtr(void *)\n\
\void * c_castStablePtrToPtr(wptr_t)\n\
\*/\n\
\"#
-- | Generated from rts\/sys\/queue.h
{-# NOINLINE queue_h #-}
queue_h :: ByteString
queue_h = unsafePerformIO $ unsafePackAddress "\
\/*\n\
\ * Copyright (c) 1991, 1993\n\
\ *\x0009\&The Regents of the University of California. All rights reserved.\n\
\ *\n\
\ * Redistribution and use in source and binary forms, with or without\n\
\ * modification, are permitted provided that the following conditions\n\
\ * are met:\n\
\ * 1. Redistributions of source code must retain the above copyright\n\
\ * notice, this list of conditions and the following disclaimer.\n\
\ * 2. Redistributions in binary form must reproduce the above copyright\n\
\ * notice, this list of conditions and the following disclaimer in the\n\
\ * documentation and/or other materials provided with the distribution.\n\
\ * 3. Neither the name of the University nor the names of its contributors\n\
\ * may be used to endorse or promote products derived from this software\n\
\ * without specific prior written permission.\n\
\ *\n\
\ * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND\n\
\ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\n\
\ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\n\
\ * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE\n\
\ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n\
\ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\n\
\ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\n\
\ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\n\
\ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\n\
\ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\n\
\ * SUCH DAMAGE.\n\
\ *\n\
\ *\x0009\&@(#)queue.h\x0009\&8.5 (Berkeley) 8/20/94\n\
\ */\n\
\\n\
\#ifndef\x0009\&_SYS_QUEUE_H_\n\
\#define\x0009\&_SYS_QUEUE_H_\n\
\\n\
\/*\n\
\ * This file defines five types of data structures: singly-linked lists,\n\
\ * lists, simple queues, tail queues, and circular queues.\n\
\ *\n\
\ * A singly-linked list is headed by a single forward pointer. The\n\
\ * elements are singly linked for minimum space and pointer manipulation\n\
\ * overhead at the expense of O(n) removal for arbitrary elements. New\n\
\ * elements can be added to the list after an existing element or at the\n\
\ * head of the list. Elements being removed from the head of the list\n\
\ * should use the explicit macro for this purpose for optimum\n\
\ * efficiency. A singly-linked list may only be traversed in the forward\n\
\ * direction. Singly-linked lists are ideal for applications with large\n\
\ * datasets and few or no removals or for implementing a LIFO queue.\n\
\ *\n\
\ * A list is headed by a single forward pointer (or an array of forward\n\
\ * pointers for a hash table header). The elements are doubly linked\n\
\ * so that an arbitrary element can be removed without a need to\n\
\ * traverse the list. New elements can be added to the list before\n\
\ * or after an existing element or at the head of the list. A list\n\
\ * may only be traversed in the forward direction.\n\
\ *\n\
\ * A simple queue is headed by a pair of pointers, one the head of the\n\
\ * list and the other to the tail of the list. The elements are singly\n\
\ * linked to save space, so elements can only be removed from the\n\
\ * head of the list. New elements can be added to the list after\n\
\ * an existing element, at the head of the list, or at the end of the\n\
\ * list. A simple queue may only be traversed in the forward direction.\n\
\ *\n\
\ * A tail queue is headed by a pair of pointers, one to the head of the\n\
\ * list and the other to the tail of the list. The elements are doubly\n\
\ * linked so that an arbitrary element can be removed without a need to\n\
\ * traverse the list. New elements can be added to the list before or\n\
\ * after an existing element, at the head of the list, or at the end of\n\
\ * the list. A tail queue may be traversed in either direction.\n\
\ *\n\
\ * A circle queue is headed by a pair of pointers, one to the head of the\n\
\ * list and the other to the tail of the list. The elements are doubly\n\
\ * linked so that an arbitrary element can be removed without a need to\n\
\ * traverse the list. New elements can be added to the list before or after\n\
\ * an existing element, at the head of the list, or at the end of the list.\n\
\ * A circle queue may be traversed in either direction, but has a more\n\
\ * complex end of list detection.\n\
\ *\n\
\ * For details on the use of these macros, see the queue(3) manual page.\n\
\ */\n\
\\n\
\/*\n\
\ * List definitions.\n\
\ */\n\
\#define\x0009\&LIST_HEAD(name, type)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct name {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type *lh_first;\x0009\&/* first element */\x0009\&\x0009\&\x0009\&\\\n\
\}\n\
\\n\
\#define\x0009\&LIST_HEAD_INITIALIZER(head)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&{ NULL }\n\
\\n\
\#define\x0009\&LIST_ENTRY(type)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type *le_next;\x0009\&/* next element */\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type **le_prev;\x0009\&/* address of previous next element */\x0009\&\\\n\
\}\n\
\\n\
\/*\n\
\ * List functions.\n\
\ */\n\
\#define\x0009\&LIST_INIT(head) do {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->lh_first = NULL;\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&LIST_INSERT_AFTER(listelm, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if (((elm)->field.le_next = (listelm)->field.le_next) != NULL)\x0009\&\\\n\
\\x0009\&\x0009\&(listelm)->field.le_next->field.le_prev =\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\& &(elm)->field.le_next;\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(listelm)->field.le_next = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.le_prev = &(listelm)->field.le_next;\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&LIST_INSERT_BEFORE(listelm, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.le_prev = (listelm)->field.le_prev;\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.le_next = (listelm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&*(listelm)->field.le_prev = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(listelm)->field.le_prev = &(elm)->field.le_next;\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&LIST_INSERT_HEAD(head, elm, field) do {\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if (((elm)->field.le_next = (head)->lh_first) != NULL)\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->lh_first->field.le_prev = &(elm)->field.le_next;\\\n\
\\x0009\&(head)->lh_first = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.le_prev = &(head)->lh_first;\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&LIST_REMOVE(elm, field) do {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if ((elm)->field.le_next != NULL)\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(elm)->field.le_next->field.le_prev = \x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\& (elm)->field.le_prev;\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&*(elm)->field.le_prev = (elm)->field.le_next;\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&LIST_FOREACH(var, head, field)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&for ((var) = ((head)->lh_first);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var) = ((var)->field.le_next))\n\
\\n\
\/*\n\
\ * List access methods.\n\
\ */\n\
\#define\x0009\&LIST_EMPTY(head)\x0009\&\x0009\&((head)->lh_first == NULL)\n\
\#define\x0009\&LIST_FIRST(head)\x0009\&\x0009\&((head)->lh_first)\n\
\#define\x0009\&LIST_NEXT(elm, field)\x0009\&\x0009\&((elm)->field.le_next)\n\
\\n\
\/*\n\
\ * Singly-linked List definitions.\n\
\ */\n\
\#define\x0009\&SLIST_HEAD(name, type)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct name {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type *slh_first;\x0009\&/* first element */\x0009\&\x0009\&\x0009\&\\\n\
\}\n\
\\n\
\#define\x0009\&SLIST_HEAD_INITIALIZER(head)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&{ NULL }\n\
\\n\
\#define\x0009\&SLIST_ENTRY(type)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type *sle_next;\x0009\&/* next element */\x0009\&\x0009\&\x0009\&\\\n\
\}\n\
\\n\
\/*\n\
\ * Singly-linked List functions.\n\
\ */\n\
\#define\x0009\&SLIST_INIT(head) do {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->slh_first = NULL;\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&SLIST_INSERT_AFTER(slistelm, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.sle_next = (slistelm)->field.sle_next;\x0009\&\x0009\&\\\n\
\\x0009\&(slistelm)->field.sle_next = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&SLIST_INSERT_HEAD(head, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.sle_next = (head)->slh_first;\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->slh_first = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&SLIST_REMOVE_HEAD(head, field) do {\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->slh_first = (head)->slh_first->field.sle_next;\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&SLIST_REMOVE(head, elm, type, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if ((head)->slh_first == (elm)) {\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&SLIST_REMOVE_HEAD((head), field);\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&}\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&else {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&struct type *curelm = (head)->slh_first;\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&while(curelm->field.sle_next != (elm))\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&\x0009\&curelm = curelm->field.sle_next;\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&curelm->field.sle_next =\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\& curelm->field.sle_next->field.sle_next;\x0009\&\x0009\&\\\n\
\\x0009\&}\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&SLIST_FOREACH(var, head, field)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)\n\
\\n\
\/*\n\
\ * Singly-linked List access methods.\n\
\ */\n\
\#define\x0009\&SLIST_EMPTY(head)\x0009\&((head)->slh_first == NULL)\n\
\#define\x0009\&SLIST_FIRST(head)\x0009\&((head)->slh_first)\n\
\#define\x0009\&SLIST_NEXT(elm, field)\x0009\&((elm)->field.sle_next)\n\
\\n\
\/*\n\
\ * Singly-linked Tail queue declarations.\n\
\ */\n\
\#define\x0009\&STAILQ_HEAD(name, type)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct name {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type *stqh_first;\x0009\&/* first element */\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type **stqh_last;\x0009\&/* addr of last next element */\x0009\&\x0009\&\\\n\
\}\n\
\\n\
\#define\x0009\&STAILQ_HEAD_INITIALIZER(head)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&{ NULL, &(head).stqh_first }\n\
\\n\
\#define\x0009\&STAILQ_ENTRY(type)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type *stqe_next;\x0009\&/* next element */\x0009\&\x0009\&\x0009\&\\\n\
\}\n\
\\n\
\/*\n\
\ * Singly-linked Tail queue functions.\n\
\ */\n\
\#define\x0009\&STAILQ_INIT(head) do {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->stqh_first = NULL;\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->stqh_last = &(head)->stqh_first;\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&STAILQ_INSERT_HEAD(head, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if (((elm)->field.stqe_next = (head)->stqh_first) == NULL)\x0009\&\\\n\
\\x0009\&\x0009\&(head)->stqh_last = &(elm)->field.stqe_next;\x0009\&\x0009\&\\\n\
\\x0009\&(head)->stqh_first = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&STAILQ_INSERT_TAIL(head, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.stqe_next = NULL;\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&*(head)->stqh_last = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->stqh_last = &(elm)->field.stqe_next;\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&STAILQ_INSERT_AFTER(head, listelm, elm, field) do {\x0009\&\x0009\&\\\n\
\\x0009\&if (((elm)->field.stqe_next = (listelm)->field.stqe_next) == NULL)\\\n\
\\x0009\&\x0009\&(head)->stqh_last = &(elm)->field.stqe_next;\x0009\&\x0009\&\\\n\
\\x0009\&(listelm)->field.stqe_next = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&STAILQ_REMOVE_HEAD(head, field) do {\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if (((head)->stqh_first = (head)->stqh_first->field.stqe_next) == NULL) \\\n\
\\x0009\&\x0009\&(head)->stqh_last = &(head)->stqh_first;\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&STAILQ_REMOVE(head, elm, type, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if ((head)->stqh_first == (elm)) {\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&STAILQ_REMOVE_HEAD((head), field);\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&} else {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&struct type *curelm = (head)->stqh_first;\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&while (curelm->field.stqe_next != (elm))\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&\x0009\&curelm = curelm->field.stqe_next;\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&if ((curelm->field.stqe_next =\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&\x0009\&curelm->field.stqe_next->field.stqe_next) == NULL) \\\n\
\\x0009\&\x0009\&\x0009\& (head)->stqh_last = &(curelm)->field.stqe_next; \\\n\
\\x0009\&}\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&STAILQ_FOREACH(var, head, field)\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&for ((var) = ((head)->stqh_first);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var) = ((var)->field.stqe_next))\n\
\\n\
\#define\x0009\&STAILQ_CONCAT(head1, head2) do {\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if (!STAILQ_EMPTY((head2))) {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&*(head1)->stqh_last = (head2)->stqh_first;\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head1)->stqh_last = (head2)->stqh_last;\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&STAILQ_INIT((head2));\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&}\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\/*\n\
\ * Singly-linked Tail queue access methods.\n\
\ */\n\
\#define\x0009\&STAILQ_EMPTY(head)\x0009\&((head)->stqh_first == NULL)\n\
\#define\x0009\&STAILQ_FIRST(head)\x0009\&((head)->stqh_first)\n\
\#define\x0009\&STAILQ_NEXT(elm, field)\x0009\&((elm)->field.stqe_next)\n\
\\n\
\/*\n\
\ * Simple queue definitions.\n\
\ */\n\
\#define\x0009\&SIMPLEQ_HEAD(name, type)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct name {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type *sqh_first;\x0009\&/* first element */\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type **sqh_last;\x0009\&/* addr of last next element */\x0009\&\x0009\&\\\n\
\}\n\
\\n\
\#define\x0009\&SIMPLEQ_HEAD_INITIALIZER(head)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&{ NULL, &(head).sqh_first }\n\
\\n\
\#define\x0009\&SIMPLEQ_ENTRY(type)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type *sqe_next;\x0009\&/* next element */\x0009\&\x0009\&\x0009\&\\\n\
\}\n\
\\n\
\/*\n\
\ * Simple queue functions.\n\
\ */\n\
\#define\x0009\&SIMPLEQ_INIT(head) do {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->sqh_first = NULL;\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->sqh_last = &(head)->sqh_first;\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&SIMPLEQ_INSERT_HEAD(head, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if (((elm)->field.sqe_next = (head)->sqh_first) == NULL)\x0009\&\\\n\
\\x0009\&\x0009\&(head)->sqh_last = &(elm)->field.sqe_next;\x0009\&\x0009\&\\\n\
\\x0009\&(head)->sqh_first = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&SIMPLEQ_INSERT_TAIL(head, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.sqe_next = NULL;\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&*(head)->sqh_last = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->sqh_last = &(elm)->field.sqe_next;\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {\x0009\&\x0009\&\\\n\
\\x0009\&if (((elm)->field.sqe_next = (listelm)->field.sqe_next) == NULL)\\\n\
\\x0009\&\x0009\&(head)->sqh_last = &(elm)->field.sqe_next;\x0009\&\x0009\&\\\n\
\\x0009\&(listelm)->field.sqe_next = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&SIMPLEQ_REMOVE_HEAD(head, field) do {\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if (((head)->sqh_first = (head)->sqh_first->field.sqe_next) == NULL) \\\n\
\\x0009\&\x0009\&(head)->sqh_last = &(head)->sqh_first;\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&SIMPLEQ_REMOVE(head, elm, type, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if ((head)->sqh_first == (elm)) {\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&SIMPLEQ_REMOVE_HEAD((head), field);\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&} else {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&struct type *curelm = (head)->sqh_first;\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&while (curelm->field.sqe_next != (elm))\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&\x0009\&curelm = curelm->field.sqe_next;\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&if ((curelm->field.sqe_next =\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&\x0009\&curelm->field.sqe_next->field.sqe_next) == NULL) \\\n\
\\x0009\&\x0009\&\x0009\& (head)->sqh_last = &(curelm)->field.sqe_next; \\\n\
\\x0009\&}\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&SIMPLEQ_FOREACH(var, head, field)\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&for ((var) = ((head)->sqh_first);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var) = ((var)->field.sqe_next))\n\
\\n\
\/*\n\
\ * Simple queue access methods.\n\
\ */\n\
\#define\x0009\&SIMPLEQ_EMPTY(head)\x0009\&\x0009\&((head)->sqh_first == NULL)\n\
\#define\x0009\&SIMPLEQ_FIRST(head)\x0009\&\x0009\&((head)->sqh_first)\n\
\#define\x0009\&SIMPLEQ_NEXT(elm, field)\x0009\&((elm)->field.sqe_next)\n\
\\n\
\/*\n\
\ * Tail queue definitions.\n\
\ */\n\
\#define\x0009\&_TAILQ_HEAD(name, type, qual)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct name {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&qual type *tqh_first;\x0009\&\x0009\&/* first element */\x0009\&\x0009\&\\\n\
\\x0009\&qual type *qual *tqh_last;\x0009\&/* addr of last next element */\x0009\&\\\n\
\}\n\
\#define TAILQ_HEAD(name, type)\x0009\&_TAILQ_HEAD(name, struct type,)\n\
\\n\
\#define\x0009\&TAILQ_HEAD_INITIALIZER(head)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&{ NULL, &(head).tqh_first }\n\
\\n\
\#define\x0009\&_TAILQ_ENTRY(type, qual)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&qual type *tqe_next;\x0009\&\x0009\&/* next element */\x0009\&\x0009\&\\\n\
\\x0009\&qual type *qual *tqe_prev;\x0009\&/* address of previous next element */\\\n\
\}\n\
\#define TAILQ_ENTRY(type)\x0009\&_TAILQ_ENTRY(struct type,)\n\
\\n\
\/*\n\
\ * Tail queue functions.\n\
\ */\n\
\#define\x0009\&TAILQ_INIT(head) do {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->tqh_first = NULL;\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->tqh_last = &(head)->tqh_first;\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&TAILQ_INSERT_HEAD(head, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if (((elm)->field.tqe_next = (head)->tqh_first) != NULL)\x0009\&\\\n\
\\x0009\&\x0009\&(head)->tqh_first->field.tqe_prev =\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\& &(elm)->field.tqe_next;\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&else\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->tqh_last = &(elm)->field.tqe_next;\x0009\&\x0009\&\\\n\
\\x0009\&(head)->tqh_first = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.tqe_prev = &(head)->tqh_first;\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&TAILQ_INSERT_TAIL(head, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.tqe_next = NULL;\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.tqe_prev = (head)->tqh_last;\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&*(head)->tqh_last = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->tqh_last = &(elm)->field.tqe_next;\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&TAILQ_INSERT_AFTER(head, listelm, elm, field) do {\x0009\&\x0009\&\\\n\
\\x0009\&if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\\\n\
\\x0009\&\x0009\&(elm)->field.tqe_next->field.tqe_prev = \x0009\&\x0009\&\\\n\
\\x0009\&\x0009\& &(elm)->field.tqe_next;\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&else\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->tqh_last = &(elm)->field.tqe_next;\x0009\&\x0009\&\\\n\
\\x0009\&(listelm)->field.tqe_next = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.tqe_prev = &(listelm)->field.tqe_next;\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&TAILQ_INSERT_BEFORE(listelm, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.tqe_prev = (listelm)->field.tqe_prev;\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.tqe_next = (listelm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&*(listelm)->field.tqe_prev = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(listelm)->field.tqe_prev = &(elm)->field.tqe_next;\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&TAILQ_REMOVE(head, elm, field) do {\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if (((elm)->field.tqe_next) != NULL)\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(elm)->field.tqe_next->field.tqe_prev = \x0009\&\x0009\&\\\n\
\\x0009\&\x0009\& (elm)->field.tqe_prev;\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&else\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->tqh_last = (elm)->field.tqe_prev;\x0009\&\x0009\&\\\n\
\\x0009\&*(elm)->field.tqe_prev = (elm)->field.tqe_next;\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&TAILQ_FOREACH(var, head, field)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&for ((var) = ((head)->tqh_first);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var) = ((var)->field.tqe_next))\n\
\\n\
\#define\x0009\&TAILQ_FOREACH_REVERSE(var, head, headname, field)\x0009\&\x0009\&\\\n\
\\x0009\&for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last));\x0009\&\\\n\
\\x0009\&\x0009\&(var);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var) = (*(((struct headname *)((var)->field.tqe_prev))->tqh_last)))\n\
\\n\
\#define\x0009\&TAILQ_CONCAT(head1, head2, field) do {\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if (!TAILQ_EMPTY(head2)) {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&*(head1)->tqh_last = (head2)->tqh_first;\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head2)->tqh_first->field.tqe_prev = (head1)->tqh_last;\x0009\&\\\n\
\\x0009\&\x0009\&(head1)->tqh_last = (head2)->tqh_last;\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&TAILQ_INIT((head2));\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&}\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\/*\n\
\ * Tail queue access methods.\n\
\ */\n\
\#define\x0009\&TAILQ_EMPTY(head)\x0009\&\x0009\&((head)->tqh_first == NULL)\n\
\#define\x0009\&TAILQ_FIRST(head)\x0009\&\x0009\&((head)->tqh_first)\n\
\#define\x0009\&TAILQ_NEXT(elm, field)\x0009\&\x0009\&((elm)->field.tqe_next)\n\
\\n\
\#define\x0009\&TAILQ_LAST(head, headname) \\\n\
\\x0009\&(*(((struct headname *)((head)->tqh_last))->tqh_last))\n\
\#define\x0009\&TAILQ_PREV(elm, headname, field) \\\n\
\\x0009\&(*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))\n\
\\n\
\/*\n\
\ * Circular queue definitions.\n\
\ */\n\
\#define\x0009\&CIRCLEQ_HEAD(name, type)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct name {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type *cqh_first;\x0009\&\x0009\&/* first element */\x0009\&\x0009\&\\\n\
\\x0009\&struct type *cqh_last;\x0009\&\x0009\&/* last element */\x0009\&\x0009\&\\\n\
\}\n\
\\n\
\#define\x0009\&CIRCLEQ_HEAD_INITIALIZER(head)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&{ (void *)&head, (void *)&head }\n\
\\n\
\#define\x0009\&CIRCLEQ_ENTRY(type)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\struct {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&struct type *cqe_next;\x0009\&\x0009\&/* next element */\x0009\&\x0009\&\\\n\
\\x0009\&struct type *cqe_prev;\x0009\&\x0009\&/* previous element */\x0009\&\x0009\&\\\n\
\}\n\
\\n\
\/*\n\
\ * Circular queue functions.\n\
\ */\n\
\#define\x0009\&CIRCLEQ_INIT(head) do {\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->cqh_first = (void *)(head);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(head)->cqh_last = (void *)(head);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.cqe_next = (listelm)->field.cqe_next;\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.cqe_prev = (listelm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if ((listelm)->field.cqe_next == (void *)(head))\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->cqh_last = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&else\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(listelm)->field.cqe_next->field.cqe_prev = (elm);\x0009\&\\\n\
\\x0009\&(listelm)->field.cqe_next = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.cqe_next = (listelm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.cqe_prev = (listelm)->field.cqe_prev;\x0009\&\x0009\&\\\n\
\\x0009\&if ((listelm)->field.cqe_prev == (void *)(head))\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->cqh_first = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&else\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(listelm)->field.cqe_prev->field.cqe_next = (elm);\x0009\&\\\n\
\\x0009\&(listelm)->field.cqe_prev = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&CIRCLEQ_INSERT_HEAD(head, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.cqe_next = (head)->cqh_first;\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.cqe_prev = (void *)(head);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if ((head)->cqh_last == (void *)(head))\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->cqh_last = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&else\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->cqh_first->field.cqe_prev = (elm);\x0009\&\x0009\&\\\n\
\\x0009\&(head)->cqh_first = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&CIRCLEQ_INSERT_TAIL(head, elm, field) do {\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.cqe_next = (void *)(head);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(elm)->field.cqe_prev = (head)->cqh_last;\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if ((head)->cqh_first == (void *)(head))\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->cqh_first = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&else\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->cqh_last->field.cqe_next = (elm);\x0009\&\x0009\&\\\n\
\\x0009\&(head)->cqh_last = (elm);\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&CIRCLEQ_REMOVE(head, elm, field) do {\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if ((elm)->field.cqe_next == (void *)(head))\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->cqh_last = (elm)->field.cqe_prev;\x0009\&\x0009\&\\\n\
\\x0009\&else\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(elm)->field.cqe_next->field.cqe_prev =\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\& (elm)->field.cqe_prev;\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&if ((elm)->field.cqe_prev == (void *)(head))\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(head)->cqh_first = (elm)->field.cqe_next;\x0009\&\x0009\&\\\n\
\\x0009\&else\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(elm)->field.cqe_prev->field.cqe_next =\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\& (elm)->field.cqe_next;\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\} while (/*CONSTCOND*/0)\n\
\\n\
\#define\x0009\&CIRCLEQ_FOREACH(var, head, field)\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&for ((var) = ((head)->cqh_first);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var) != (const void *)(head);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var) = ((var)->field.cqe_next))\n\
\\n\
\#define\x0009\&CIRCLEQ_FOREACH_REVERSE(var, head, field)\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&for ((var) = ((head)->cqh_last);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var) != (const void *)(head);\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&\x0009\&(var) = ((var)->field.cqe_prev))\n\
\\n\
\/*\n\
\ * Circular queue access methods.\n\
\ */\n\
\#define\x0009\&CIRCLEQ_EMPTY(head)\x0009\&\x0009\&((head)->cqh_first == (void *)(head))\n\
\#define\x0009\&CIRCLEQ_FIRST(head)\x0009\&\x0009\&((head)->cqh_first)\n\
\#define\x0009\&CIRCLEQ_LAST(head)\x0009\&\x0009\&((head)->cqh_last)\n\
\#define\x0009\&CIRCLEQ_NEXT(elm, field)\x0009\&((elm)->field.cqe_next)\n\
\#define\x0009\&CIRCLEQ_PREV(elm, field)\x0009\&((elm)->field.cqe_prev)\n\
\\n\
\#define CIRCLEQ_LOOP_NEXT(head, elm, field)\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(((elm)->field.cqe_next == (void *)(head))\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\& ? ((head)->cqh_first)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\& : (elm->field.cqe_next))\n\
\#define CIRCLEQ_LOOP_PREV(head, elm, field)\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\&(((elm)->field.cqe_prev == (void *)(head))\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\& ? ((head)->cqh_last)\x0009\&\x0009\&\x0009\&\x0009\&\x0009\&\\\n\
\\x0009\& : (elm->field.cqe_prev))\n\
\\n\
\#endif\x0009\&/* sys/queue.h */\n\
\"#
-- | Generated from rts\/HsFFI.h
{-# NOINLINE hsffi_h #-}
hsffi_h :: ByteString
hsffi_h = unsafePerformIO $ unsafePackAddress "\
\/* HsFFI.h for jhc */\n\
\\n\
\#ifndef _JHC_HSFFI_H\n\
\#define _JHC_HSFFI_H\n\
\\n\
\#include <stdint.h>\n\
\#include <stdbool.h>\n\
\#include <stddef.h>\n\
\\n\
\typedef int32_t HsInt;\n\
\typedef int8_t HsInt8;\n\
\typedef int16_t HsInt16;\n\
\typedef int32_t HsInt32;\n\
\typedef int64_t HsInt64;\n\
\\n\
\typedef uint32_t HsWord;\n\
\typedef uint8_t HsWord8;\n\
\typedef uint16_t HsWord16;\n\
\typedef uint32_t HsWord32;\n\
\typedef uint64_t HsWord64;\n\
\\n\
\typedef wchar_t HsChar;\n\
\typedef bool HsBool;\n\
\\n\
\typedef double HsDouble;\n\
\typedef float HsFloat;\n\
\\n\
\typedef void *HsPtr;\n\
\typedef void (*HsFunPtr)(void);\n\
\typedef void *HsStablePtr;\n\
\\n\
\#define HS_BOOL_FALSE 0\n\
\#define HS_BOOL_TRUE 1\n\
\\n\
\void hs_init (int *argc, char **argv[]);\n\
\void hs_exit (void);\n\
\void hs_set_argv(int argc, char *argv[]);\n\
\void hs_perform_gc(void);\n\
\void hs_free_stable_ptr(HsStablePtr sp);\n\
\void hs_free_fun_ptr(HsFunPtr fp);\n\
\\n\
\#endif\n\
\"#
-- | Generated from rts\/sys\/wsize.h
{-# NOINLINE wsize_h #-}
wsize_h :: ByteString
wsize_h = unsafePerformIO $ unsafePackAddress "\
\#ifndef WSIZE_H\n\
\#define WSIZE_H\n\
\\n\
\/*\n\
\ * wsize.h\n\
\ * define appropriate __WORDSIZE and __BYTE_ORDER macros\n\
\ *\n\
\ * always use operating systems headers rather than checking for architectures\n\
\ * when possible. if adding new cases. Checking the CPU type should be a last\n\
\ * resort.\n\
\ *\n\
\ */\n\
\\n\
\#include <limits.h>\n\
\\n\
\#ifdef __linux__\n\
\#include<endian.h>\n\
\#endif\n\
\\n\
\#ifndef __LITTLE_ENDIAN\n\
\#define\x0009\&__LITTLE_ENDIAN\x0009\&1234\n\
\#endif\n\
\#ifndef __BIG_ENDIAN\n\
\#define\x0009\&__BIG_ENDIAN\x0009\&4321\n\
\#endif\n\
\#ifndef __PDP_ENDIAN\n\
\#define\x0009\&__PDP_ENDIAN\x0009\&3412\n\
\#endif\n\
\\n\
\#ifndef __BYTE_ORDER\n\
\#ifdef _BIG_ENDIAN\n\
\#define __BYTE_ORDER __BIG_ENDIAN\n\
\#elif defined(__BIG_ENDIAN__)\n\
\#define __BYTE_ORDER __BIG_ENDIAN\n\
\#elif defined(_LITTLE_ENDIAN)\n\
\#define __BYTE_ORDER __LITTLE_ENDIAN\n\
\#elif defined(__LITTLE_ENDIAN__)\n\
\#define __BYTE_ORDER __LITTLE_ENDIAN\n\
\#elif defined(__i386__)\n\
\#define __BYTE_ORDER __LITTLE_ENDIAN\n\
\#else\n\
\#error Could not determine Byte Order\n\
\#endif\n\
\#endif\n\
\\n\
\#ifndef __WORDSIZE\n\
\#ifdef __SIZEOF_POINTER__\n\
\#define __WORDSIZE (CHAR_BIT*__SIZEOF_POINTER__)\n\
\#elif defined(__i386__)\n\
\#define __WORDSIZE 32\n\
\#elif defined(__x86_64__)\n\