h$#      !"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnop q r s t u v w x y z { | } ~                                                                                                                                                                                                                         !"""""""################################################################################$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ $ $ $ $ $ $ $ $ $ $ $ $   % % % % % & & & & & & ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '                       ( ( ( ( ( ( ( ( ( ( ) ) ) ) ) * * * * * + + + + + + + + + + + , , , , , , , , , - - . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / / 0 1 1 1 1 1 1 2 3 3 3 4 4 4 4 4 4 4 4 4 5 6 6 6 6 6 7 7 7 7 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 8 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 9 : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :   ; ; ; ; ; ; ; ; ; ; ; <                        = = = = = = = = = = = = = > > > > ? ? ? ? ? ? ? ? @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ @ A A A A A A B C C C C C D D D D D D D D D D D D D D D D D D D D                                                                                                                          E E E E E E E E E E E E E EEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEFFFFFFFFFFFFFFFGGGGGGGGGGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHIIIIII>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJKKKKLLLLLLLLLLLLLLMMMMMMMMMMMMNNNNNNNNNNNNNOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUVVVVVVVVWWWWWWWWWWWWWWWWWWWWWWWWWWWWXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXYYYYYYZZZZZZZZZ[[[[[[[[[\\\\\\\\\\\\\\\\]]]]]]]]]]]]]]]]]]]]]]]]]]]]]^^^^^^^^^^^^^^^^                                        ____________________________________________````````aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbb55555555555555555?????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????ccccccccccccccccddddeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeffffffffffffgggggggggggggghhhhiiiiiiiiiiiiiiiiiiiiiiiiiiijjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjkkkkkkkkkkkkkllllllllllllmmmmmmmmmmmmmmmmmnnnnnnnnnnnnnnnnnnnnnnnnnnooooooooooooppppppppppppppppppppppppppppppppppppppppppqqqqqqqqqqqrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrsssssssssstuuuuuuuuvvvwwxxxxxwxywwxyxyzzzzzzzzxxxx{xxxxxxxxxxxxx|||||}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}} } } } } } } } } } } } } } } } } } } ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~!~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~"~""""""""""""""""""""""""""""""################################################################################################################################$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((())))))))))))))))))))))))))))))))))))))))))))))))))))x))))))))))))))))))))))))))))))))))))))))))))))))))))))))))x)x)))))))))))))))))********************************I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I*I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+I+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+`+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s+s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,s,,,,,,,,,,,,,,,,,,,,,,,,,,,,,--------------------------------------------------------------------------------------------------------------------------------................................................................................................................................////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111112222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222233333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444445555555555555555555555555555w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w5w55555555555555555555555555555555555555555555555555555555555555555566666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777778888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<================================================================================================================================>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>u>u>u>u>u>u>u>u>u>u>u>u>u>u>u>u>u>u>u>u>u>u>u>u>u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u?u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@AAAAAAAAAAAAAAxAxAxAxAxAxAxAwAwAwAwAyAyAyAyAwAwAwAyAwAwAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAxAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAxAyAyAyAxAxAxAyAxAxAzAzAxAyAxAxAxAxAxAxAxAxAxAxAxAwAwAxAxAxAwAyAAAAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyAyA A A B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B B BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCCCCCCCCCCCCCCCCCCCC{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{C{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{D{DxDxDxDxDxDxDxDxDxDxDxDxDxDxDxDxDxDxDxDxDxDxExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExExFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHIIIIIIIIIIIIIIIIIIIIIIIIIIII|I|I|I|I|I|I|I|I|I|I|I|I|I|I|I|I|I|I|I|I|I|IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIJJJJJJJJJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwJwKwKwKwKwKwKwKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYUYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVYVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtVtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWvWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0X0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Y0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^________________________________________________________________________________________________________________________________````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffgggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggghhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii,i,i,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppqqqqqqqqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttt t t t t t t t t t t t t t t t t t t t t t t t t t t t t t t t t t t t t t t tuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~€ÀĀŀƀǀȀɀʀˀ̀̀΀πЀрҀӀԀՀր׀؀ـڀۀ܀݀ހ߀ÁāŁƁǁȁɁʁˁ́́΁ρЁсҁӁԁՁցׁ؁فځہ܁݁ށ߁‚ÂĂłƂǂȂɂʂ˂̂͂΂ςЂт҂ӂԂՂւׂ؂قڂۂ܂݂ނ߂ƒÃăŃƃǃȃɃʃ˃̃̓΃σЃу҃ӃԃՃփ׃؃كڃۃ܃݃ރ߃„ÄĄńƄDŽȄɄʄ˄̄̈́΄τЄф҄ӄԄՄքׄ؄لڄۄ܄݄ބ߄…ÅąŅƅDžȅɅʅ˅̅ͅ΅υЅх҅ӅԅՅօׅ؅مڅۅ܅݅ޅ߅†ÆĆņƆdžȆɆʆˆ̆͆ΆφІц҆ӆԆՆֆ׆؆نچۆ܆݆ކ߆‡ÇćŇƇLJȇɇʇˇ͇̇·χЇч҇ӇԇՇևׇ؇هڇۇ܇݇އ߇ˆÈĈňƈLjȈɈʈˈ͈̈ΈψЈш҈ӈԈՈֈ׈؈وڈۈ܈݈ވ߈‰ÉĉʼnƉljȉɉʉˉ͉̉ΉωЉщ҉ӉԉՉ։׉؉ىډۉ܉݉މ߉ŠÊĊŊƊNJȊɊʊˊ̊͊ΊϊЊъҊӊԊՊ֊׊؊يڊۊ܊݊ފߊ‹ËċŋƋNjȋɋʋˋ̋͋΋ϋЋыҋӋԋՋ֋׋؋ًڋۋ܋݋ދߋŒÌČŌƌnjȌɌʌˌ̌͌ΌόЌьҌӌԌՌ֌׌،ٌڌی܌݌ތߌÍčōƍǍȍɍʍˍ͍̍΍ύЍэҍӍԍՍ֍׍؍ٍڍۍ܍ݍލߍŽÎĎŎƎǎȎɎʎˎ͎̎ΎώЎюҎӎԎՎ֎׎؎َڎێ܎ݎގߎÏďŏƏǏȏɏʏˏ̏͏ΏϏЏяҏӏԏՏ֏׏؏ُڏۏ܏ݏޏߏÐĐŐƐǐȐɐʐː̐͐ΐϐАѐҐӐԐՐ֐אِؐڐېܐݐސߐ‘ÑđőƑǑȑɑʑˑ̑͑ΑϑБёґӑԑՑ֑בّؑڑۑܑݑޑߑ’ÒĒŒƒǒȒɒʒ˒̒͒ΒϒВђҒӒԒՒ֒גْؒڒےܒݒޒߒ33333333333333333333333333333333333333333“3Ó3ē3œ3Ɠ3Ǔ3ȓ3ɓ3ʓ3˓3̓3͓3Γ3ϓ3Г3ѓ3ғ3ӓ3ԓ3Փ3֓3ד3ؓ3ٓ3ړ3ۓ3ܓ3ݓ3ޓ3ߓ333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333”3Ô3Ĕ3Ŕ3Ɣ3ǔ3Ȕ3ɔ3ʔ3˔3̔3͔3Δ3ϔ3Д3є3Ҕ3Ӕ3Ԕ3Ք֔הؔٔڔ۔ܔݔޔߔ•ÕĕŕƕǕȕɕʕ˕͕̕ΕϕЕѕҕӕԕՕ֕וٕؕڕەܕݕޕߕ–ÖĖŖƖǖȖɖʖ˖̖͖ΖϖЖіҖӖԖՖ֖זٖؖږۖܖݖޖߖ—×ėŗƗǗȗɗʗ˗̗͗ΗϗЗїҗӗԗ՗֗חؗٗڗۗܗݗޗߗ˜ØĘŘƘǘȘɘʘ˘̘͘ΘϘИјҘӘԘ՘֘טؘ٘ژۘܘݘޘߘ™ÙęřƙǙșəʙ˙̙͙ΙϙЙљҙәԙՙ֙יؙٙڙۙܙݙޙߙšÚĚŚƚǚȚɚʚ˚͚̚ΚϚКњҚӚԚ՚֚ךؚٚښۚܚݚޚߚ›ÛěśƛǛțɛʛ˛̛͛ΛϛЛћқӛԛ՛֛כ؛ٛڛۛܛݛޛߛœÜĜŜƜǜȜɜʜ˜̜͜ΜϜМќҜӜԜ՜֜ל؜ٜڜۜܜݜޜߜÝĝŝƝǝȝɝʝ˝̝͝ΝϝНѝҝӝԝ՝֝ם؝ٝڝ۝ܝݝޝߝžÞĞŞƞǞȞɞʞ˞̞͞ΞϞОўҞӞԞ՞֞מ؞ٞڞ۞ܞݞޞߞŸßğşƟǟȟɟʟ˟̟͟ΟϟПџҟӟԟ՟֟ן؟ٟڟ۟ܟݟޟߟ àĠŠƠǠȠɠʠˠ̠͠ΠϠРѠҠӠԠՠ֠נؠ٠ڠ۠ܠݠޠߠ¡áġšơǡȡɡʡˡ̡͡ΡϡСѡҡӡԡա֡סء١ڡۡܡݡޡߡ¢âĢŢƢǢȢɢʢˢ̢͢΢ϢТѢҢӢԢբ֢עآ٢ڢۢܢݢޢߢ£ãģţƣǣȣɣʣˣ̣ͣΣϣУѣңӣԣգ֣ףأ٣ڣۣܣݣޣߣ¤äĤŤƤǤȤɤʤˤ̤ͤΤϤФѤҤӤԤդ֤פؤ٤ڤۤܤݤޤߤ¥åĥťƥǥȥɥʥ˥̥ͥΥϥХѥҥӥԥե֥ץإ٥ڥۥܥݥޥߥ¦æĦŦƦǦȦɦʦ˦̦ͦΦϦЦѦҦӦԦզ֦צئ٦ڦۦܦݦަߦ§çħŧƧǧȧɧʧ˧̧ͧΧϧЧѧҧӧԧէ֧ק-ا-٧-ڧ-ۧ-ܧ-ݧ-ާ-ߧ----¨èĨŨƨǨȨɨʨ˨̨ͨΨϨШѨҨӨԨը֨רب٨ڨۨܨݨިߨ©éĩũƩǩȩɩʩ˩̩ͩΩϩЩѩҩөԩթ֩שة٩ک۩ܩݩީߩ%%%%%%%%%ª%ê%Ī%Ū%ƪ%Ǫ%Ȫ%ɪ%ʪ%˪%̪%ͪ%Ϊ%Ϫ%Ъ%Ѫ%Ҫ%Ӫ%Ԫ%ժ%֪%ת%ت%٪%ڪ%۪%ܪ%ݪ%ު%ߪ%%%%%%%%%%%%%%&&&&&&&&&&&&&&& Safe-Inferredghc-lib-parserExpand occurrences of the $topdir interpolation in a string.ghc-lib-parser expandPathVar var value str!replaces occurrences of variable $var with value in str.ghc-lib-parser&Calculate the location of the base dir Safe-Inferred28? Safe-Inferred8ghc-lib-parser/Return the size of the closures header in words Safe-Inferred Safe-Inferred8)ghc-lib-parserThis is a somewhat faithful representation of an info table. See  https://gitlab.haskell.org/ghc/ghc/blob/master/rts/include/rts/storage/InfoTables.h* for more details on this data structure.   Safe-Inferredghc-lib-parserRead an InfoTable from the heap into a haskell type. WARNING: This code assumes it is passed a pointer to a "standard" info table. If tables_next_to_code is enabled, it will look 1 byte before the start for the entry field.ghc-lib-parser%Size in bytes of a standard InfoTable Safe-Inferredghc-lib-parserRead an InfoTable from the heap into a haskell type. WARNING: This code assumes it is passed a pointer to a "standard" info table. If tables_next_to_code is enabled, it will look 1 byte before the start for the entry field. Safe-Inferred8ghc-lib-parser?This is a somewhat faithful representation of IndexTable. See  https://gitlab.haskell.org/ghc/ghc/blob/master/rts/include/rts/prof/CCS.h* for more details on this data structure.ghc-lib-parser?This is a somewhat faithful representation of CostCentre. See  https://gitlab.haskell.org/ghc/ghc/blob/master/rts/include/rts/prof/CCS.h* for more details on this data structure.ghc-lib-parserThis is a somewhat faithful representation of CostCentreStack. See  https://gitlab.haskell.org/ghc/ghc/blob/master/rts/include/rts/prof/CCS.h* for more details on this data structure.ghc-lib-parserThis is a somewhat faithful representation of StgTSOProfInfo. See  https://gitlab.haskell.org/ghc/ghc/blob/master/rts/include/rts/storage/TSO.h* for more details on this data structure.!! Safe-Inferred8V Safe-Inferred&ghc-lib-parserThis implementation is used when PROFILING is undefined. It always returns H/, because there is no profiling info available. Safe-Inferred_None #$5678ghc-lib-parserPlease report this as a bugghc-lib-parserPlease report this as a bugghc-lib-parserPlease report this as a bugghc-lib-parserThis is the representation of a Haskell value on the heap. It reflects https://gitlab.haskell.org/ghc/ghc/blob/master/rts/include/rts/storage/Closures.h!The data type is parametrized by b6: the type to store references in. Usually this is a  with the type synonym .All Heap objects have the same basic layout. A header containing a pointer to the info table and a payload with various fields. The info field below always refers to the info table pointed to by the header. The remaining fields are the payload.See  https://gitlab.haskell.org/ghc/ghc/wikis/commentary/rts/storage/heap-objects for more information.ghc-lib-parserA data constructorghc-lib-parser A functionghc-lib-parser8A thunk, an expression not obviously in head normal formghc-lib-parser3A thunk which performs a simple selection operationghc-lib-parser#An unsaturated function applicationghc-lib-parserA function applicationghc-lib-parserA suspended thunk evaluationghc-lib-parserA pointer to another closure, introduced when a thunk is updated to point at its valueghc-lib-parserA byte-code object (BCO) which can be interpreted by GHC's byte-code interpreter (e.g. as used by GHCi)ghc-lib-parser*A thunk under evaluation by another threadghc-lib-parserA  ByteArray#ghc-lib-parserA MutableByteArray# ghc-lib-parserA SmallMutableArray#ghc-lib-parserAn MVar#7, with a queue of thread state objects blocking on themghc-lib-parserAn IOPort#7, with a queue of thread state objects blocking on themghc-lib-parserA MutVar#ghc-lib-parserAn STM blocking queue.ghc-lib-parserRepresentation of StgTSO: A Thread State Object. The values for ,  and  are defined in  Constants.h.ghc-lib-parser1Representation of StgStack: The 'tsoStack ' of a .ghc-lib-parser Primitive Intghc-lib-parserPrimitive Wordghc-lib-parserPrimitive Int64ghc-lib-parserPrimitive Word64ghc-lib-parserPrimitive Addrghc-lib-parserPrimitive Floatghc-lib-parserPrimitive Doubleghc-lib-parserAnother kind of closureghc-lib-parserPointer argumentsghc-lib-parserNon-pointer argumentsghc-lib-parser Package nameghc-lib-parser Module nameghc-lib-parserConstructor nameghc-lib-parser,Pointer to the object being selected fromghc-lib-parser Arity of the partial applicationghc-lib-parserSize of the payload in wordsghc-lib-parser Pointer to a ghc-lib-parser(Sequence of already applied argumentsghc-lib-parserTarget closureghc-lib-parser+A pointer to an ArrWords of instructionsghc-lib-parser'A pointer to an ArrWords of literalsghc-lib-parser0A pointer to an ArrWords of byte code objectsghc-lib-parserThe size of this BCO in wordsghc-lib-parserAn StgLargeBitmap describing the pointerhood of its args/free varsghc-lib-parserSize of array in bytesghc-lib-parser Array payloadghc-lib-parserNumber of pointersghc-lib-parser ?? Closures.h vs ClosureMacros.hghc-lib-parser!Array payload Card table ignoredghc-lib-parserPointer to head of queueghc-lib-parserPointer to tail of queueghc-lib-parserPointer to closureghc-lib-parserPointer to contentsghc-lib-parser?? Here so it looks like an INDghc-lib-parserThe blackhole closureghc-lib-parserThe owning thread state objectghc-lib-parser??ghc-lib-parserstackobj from StgTSOghc-lib-parsernon-zero => dirtyghc-lib-parserstack size in *words*ghc-lib-parsernon-zero => dirtyghc-lib-parserAn arbitrary Haskell value in a safe Box. The point is that even unevaluated thunks can safely be moved around inside the Box, and when required, e.g. in getBoxedClosureData>, the function knows how far it has to evaluate the argument.ghc-lib-parserThis takes an arbitrary value and puts it into a box. Note that calls like asBox (head list)-will put the thunk "head list" into the box, not the element at the head of the list. For that, use careful case expressions: case list of x:_ -> asBox xghc-lib-parserBoxes can be compared, but this is not pure, as different heap objects can, after garbage collection, become the same object.ghc-lib-parserFor generic code, this function returns all referenced closures. ghc-lib-parserGet the size of the top-level closure in words. Includes header and payload. Does not follow pointers.Noneghc-lib-parserGet non-pointer fields from StgTSO_ (TSO.h)ghc-lib-parserGet non-closure fields from  StgStack_ (TSO.h)Noneghc-lib-parserGet non-pointer fields from StgTSO_ (TSO.h)ghc-lib-parserGet non-closure fields from  StgStack_ (TSO.h)NonepNone(c) 2012 Joachim BreitnerBSD3+Joachim Breitner None ./>$ghc-lib-parser.Decode a closure to it's heap representation ().ghc-lib-parserConvert an unpacked heap object, to a `GenClosure b`. The inputs to this function can be generated from a heap object using .ghc-lib-parserLike , but taking a , so it is easier to work with.ghc-lib-parserClosure to decode.ghc-lib-parser#Heap representation of the closure.ghc-lib-parserA continuation used to decode the constructor description field, in ghc-debug this code can lead to segfaults because dataConNames will dereference a random part of memory.ghc-lib-parserA continuation which is used to decode a cost centre stack In ghc-debug, this code will need to call back into the debuggee to fetch the representation of the CCS before decoding it. Using  peekTopCCS for this argument can lead to segfaults in ghc-debug as the CCS argument will point outside the copied closure.ghc-lib-parserThe 9 of the closure, extracted from the heap representation.ghc-lib-parser2Heap representation of the closure as returned by . This includes all of the object including the header, info table pointer, pointer data, and non-pointer data. The ByteArray# may be pinned or unpinned.ghc-lib-parserPointers in the payload of the closure, extracted from the heap representation as returned by `collect_pointers()` in  . The type b* is some representation of a pointer e.g.  or `Ptr Any`.ghc-lib-parser#Heap representation of the closure. Safe-Inferred8)ghc-lib-parser'Foreign formats supported by GHC via THghc-lib-parserCghc-lib-parserC++ghc-lib-parser Objective Cghc-lib-parser Objective C++ghc-lib-parserAssembly language (.s)ghc-lib-parser Object (.o) Safe-Inferred) (c) The GHC Teamghc-devs@haskell.orgportableSafe8+ghc-lib-parser%The language extensions known to GHC.Note that there is an orphan Binary) instance for this type supplied by the GHC.LanguageExtensions module provided by ghc-boot. We can't provide here as this would require adding transitive dependencies to the template-haskell3 package, which must have a minimal dependency set.! Safe-Inferred-"(c) The GHC Teamghc-devs@haskell.orgportable Safe-Inferred/ghc-lib-parserIs this character acceptable in a symbol (after the first char)? See alexGetByte in GHC.Parser.Lexer# Safe-Inferred2 ghc-lib-parserOperating systems.Using OSUnknown to generate code should produce a sensible default, but no promises.ghc-lib-parserPowerPC 64-bit ABIghc-lib-parser PowerPC64ghc-lib-parser PowerPC64 LEghc-lib-parserARM ABIghc-lib-parserARM extensionsghc-lib-parser ARM Instruction Set Architectureghc-lib-parser ArchitecturesTODO: It might be nice to extend these constructors with information about what instruction set extensions an architecture might support.ghc-lib-parserPlatform architecture and OS.ghc-lib-parserSee Note [Platform Syntax].ghc-lib-parserSee Note [Platform Syntax].44$ Safe-Inferred3     Safe-Inferred5 %&'() *+,-  ./012356$#"78]_`^9:! ;GJ<=>?@AHIBOMNCDEFKLdefghijklmno  %&'() *+,-  ./012356$#"78]_`^9:! ;GJ<=>?@AHIBOMNCDEFKLdefghijklmno ' Safe-Inferred 35679   Safe-Inferred >C? ghc-lib-parser Stream m a b is a computation in some Monad m/ that delivers a sequence of elements of type a followed by a result of type b.!More concretely, a value of type  Stream m a b can be run using runStreamInternal in the Monad m, and it delivers eitherthe final result: Done b, or Yield a str where a( is the next element in the stream, and str is the rest of the stream Effect mstr where mstr is some action running in m* which generates the rest of the stream.4Stream is itself a Monad, and provides an operation   that produces a new element of the stream. This makes it convenient to turn existing monadic computations into streams.The idea is that Stream is useful for making a monadic computation that produces values from time to time. This can be used for knitting together two complex monadic operations, so that the producer does not have to produce all its values before the consumer starts consuming them. We make the producer into a Stream, and the consumer pulls on the stream each time it wants a new value.  is implemented in the "yoneda" style for efficiency. By representing a stream in this manner  and  operations are accumulated in the function parameters before being applied once when the stream is destroyed. In the old implementation each usage of   and  would traverse the entire stream in order to apply the substitution at the leaves.The >>= operation for  . was a hot-spot in the ticky profile for the ManyConstructors test which called the cg function many times in  StgToCmm.hs ghc-lib-parserTurn a Stream into an ordinary list, by demanding all the elements. ghc-lib-parserTurn a list into a  #, by yielding each element in turn. ghc-lib-parser&Apply a function to each element of a  , lazily ghc-lib-parser/Apply a monadic operation to each element of a  , lazily ghc-lib-parserNote this is not very efficient because it traverses the whole stream before rebuilding it, avoid using it if you can. mapAccumL used to implemented but it wasn't used anywhere in the compiler and has similar effiency problems.S  S (None +E ghc-lib-parser+Copy and freeze a slice of a mutable array. ghc-lib-parser!Freeze a mutable array (no copy!) ghc-lib-parser)Index a small-array (no bounds checking!) ghc-lib-parserConvert a list into an array. ghc-lib-parsersizeghc-lib-parserinitial contents ghc-lib-parserarrayghc-lib-parserindexghc-lib-parser new element ghc-lib-parsersourceghc-lib-parseroffsetghc-lib-parserlength ghc-lib-parserarrayghc-lib-parserindex ) Safe-InferredF   *NoneFH  + Safe-InferredG  ghc-lib-parser  ghc-lib-parser  ghc-lib-parser  ghc-lib-parser  ghc-lib-parser  .None 567GE: : / Safe-Inferred'(./25MZ ghc-lib-parser2A sequence of nodes. May be any of four shapes (OO, OC, CO, CC). Open at the entry means single entry, mutatis mutandis for exit. A closedclosed block is a basic/ block and can't be extended further. Clients should avoid manipulating blocks and should stick to either nodes or graphs. ghc-lib-parser!Maybe type indexed by open/closed ghc-lib-parser6Either type indexed by closed/open using type families ghc-lib-parserUsed at the type level to indicate "open" vs "closed" structure. ghc-lib-parserAn "open" structure with a unique, unnamed control-flow edge flowing in or out. "Fallthrough" and concatenation are permitted at an open point. ghc-lib-parserA "closed" structure which supports control transfer only through the use of named labels---no "fallthrough" is permitted. The number of control-flow edges is unconstrained. ghc-lib-parserSplit a closed block into its entry node, open middle block, and exit node. ghc-lib-parser#map a function over the nodes of a  ghc-lib-parser A strict  ghc-lib-parsermap over a block, with different functions to apply to first nodes, middle nodes and last nodes respectively. The map is strict.) ) 1 Safe-Inferred '(P ghc-lib-parserRepresents a serialized value of a particular type. Attempts can be made to deserialize it at certain types ghc-lib-parserPut a Typeable value that we are able to actually turn into bytes into a  & value ready for deserialization later ghc-lib-parserIf the   value contains something of the given type, then use the specified deserializer to return Just that. Otherwise return Nothing. ghc-lib-parserUse a > instance to implement a serialization scheme dual to that of  ghc-lib-parserUse a  instance to implement a deserialization scheme dual to that of    2NoneQ ghc-lib-parserDoes the controlling terminal support ANSI color sequences? This memoized to avoid thread-safety issues in ncurses (see #17922).  4 Safe-InferredSN ghc-lib-parserThis is used to signal if one of my imports used HPC instrumentation even if there is no module-local HPC usage ghc-lib-parser;Information about a modules use of Haskell Program Coverage ghc-lib-parser*Is hpc used anywhere on the module *tree*? ghc-lib-parserFind out if HPC is used by this module or any of the modules it depends upon 6 Safe-InferredU] ghc-lib-parserWhen invoking external tools as part of the compilation pipeline, we pass these a sequence of options on the command-line. Rather than just using a list of Strings, we use a type that allows us to distinguish between filepaths and 'other stuff'. The reason for this is that this type gives us a handle on transforming filenames, and filenames only, to whatever format they're expected to be on a particular platform.  7 Safe-InferredU  8None V ghc-lib-parser,Converts a 64-bit word into a base-62 string  9None <Z ghc-lib-parserA   is a modified UTF-8 encoded string meant for short strings like file paths, module descriptions, etc. ghc-lib-parserO(n) Returns the length of the   in characters. ghc-lib-parserO(1) Returns the length of the   in bytes. ghc-lib-parserO(n) Convert a  into a  . ghc-lib-parserO(n) Convert a   into a . ghc-lib-parserO(1) Test whether the   is the empty string. ghc-lib-parserO(n) Split a   representing a file path into its components by separating on the file separator characters for this platform. ghc-lib-parserO(1)* Returns the first UTF-8 codepoint in the  . Depending on the string in question, this may or may not be the actual first character in the string due to Unicode non-printable characters. ghc-lib-parserO(n) The   function takes two  s and returns I the remainder of the second iff the first is its prefix, and otherwise Nothing. :6(c) The University of Glasgow 2009, Duncan Coutts 2014ghc-devs@haskell.orgportableNone #$'(/2567>s`- ghc-lib-parser  holds a value of type t but only in   mode. So it is like A but with a type argument for the mode to enforce that the mode is used consistently. ghc-lib-parserMode to open a package db in. ghc-lib-parser"Represents a lock of a package db. ghc-lib-parserghc-boot4's instantiated unit id, serialized to the database. ghc-lib-parserInstantiated unit ghc-lib-parserUninstantiated unit ghc-lib-parserghc-boot's Module, serialized to the database. ghc-lib-parserInformation about an unit (a unit is an installed module library).This is a subset of Cabal's InstalledPackageInfo0, with just the bits that GHC is interested in.Some types are left as parameters to be instantiated differently in ghc-pkg and in ghc itself. ghc-lib-parserUnique unit identifier that is used during compilation (e.g. to generate symbols). ghc-lib-parserIdentifier of an indefinite unit (i.e. with module holes) that this unit is an instance of.1For non instantiated units, unitInstanceOf=unitId ghc-lib-parserHow this unit instantiates some of its module holes. Map hole module names to actual module ghc-lib-parserSource package identifier.Cabal instantiates this with Distribution.Types.PackageId.PackageId type which only contains the source package name and version. Notice that it doesn't contain the Hackage revision, nor any kind of hash. ghc-lib-parserSource package name ghc-lib-parserSource package version ghc-lib-parserName of the component.Cabal supports more than one components (libraries, executables, testsuites) in the same package. Each component has a name except the default one (that can only be a library component) for which we use Nothing.GHC only deals with "library" components as they are the only kind of components that can be registered in a database and used by other modules. ghc-lib-parserABI hash used to avoid mixing up units compiled with different dependencies, compiler, options, etc. ghc-lib-parser,Identifiers of the units this one depends on ghc-lib-parserLike  , but each dependency is annotated with the ABI hash we expect the dependency to respect. ghc-lib-parser(Directories containing module interfaces ghc-lib-parser4Names of the Haskell libraries provided by this unit ghc-lib-parserNames of the external system libraries that this unit depends on. See also   field. ghc-lib-parserBecause of slight differences between the GHC dynamic linker (in GHC.Runtime.Linker) and the native system linker, some packages have to link with a different list of libraries when using GHC's. Examples include: libs that are actually gnu ld scripts, and the possibility that the .a libs do not exactly match the .so/.dll equivalents.7If this field is set, then we use that instead of the   field. ghc-lib-parserDirectories containing libraries provided by this unit. See also  .It seems to be used to store paths to external library dependencies too. ghc-lib-parserDirectories containing the dynamic libraries provided by this unit. See also  .It seems to be used to store paths to external dynamic library dependencies too. ghc-lib-parserNames of the external MacOS frameworks that this unit depends on. ghc-lib-parserDirectories containing MacOS frameworks that this unit depends on. ghc-lib-parser%Linker (e.g. ld) command line options ghc-lib-parserC compiler options that needs to be passed to the C compiler when we compile some C code against this unit. ghc-lib-parserC header files that are required by this unit (provided by this unit or external) ghc-lib-parserDirectories containing C header files that this unit depends on. ghc-lib-parser.Paths to Haddock interface files for this unit ghc-lib-parser2Paths to Haddock directories containing HTML files ghc-lib-parserModules exposed by the unit.A module can be re-exported from another package. In this case, we indicate the module origin in the second parameter. ghc-lib-parserHidden modules.These are useful for error reporting (e.g. if a hidden module is imported) ghc-lib-parserTrue if this unit has some module holes that need to be instantiated with real modules to make the unit usable (a.k.a. Backpack). ghc-lib-parserTrue if the unit is exposed. A unit could be installed in a database by "disabled" by not being exposed. ghc-lib-parser-True if the unit is trusted (cf Safe Haskell) ghc-lib-parserghc-boot('s UnitInfo, serialized to the database. ghc-lib-parser)Convert between GenericUnitInfo instances ghc-lib-parserAcquire an exclusive lock related to package DB under given location. ghc-lib-parser'Release the lock related to package DB. ghc-lib-parser:Read the part of the package DB that GHC is interested in. ghc-lib-parser=Read the part of the package DB that ghc-pkg is interested inNote that the Binary instance for ghc-pkg's representation of packages is not defined in this package. This is because ghc-pkg uses Cabal types (and Binary instances for these) which this package does not depend on.If we open the package db in read only mode, we get its contents. Otherwise we additionally receive a PackageDbLock that represents a lock on the database, so that we can safely update it later. ghc-lib-parser.Write the whole of the package DB, both parts. ghc-lib-parserPerform path/URL variable substitution as per the Cabal ${pkgroot} spec (http:/www.haskell.org pipermail libraries2009-May/011772.html) Paths/URLs can be relative to ${pkgroot} or ${pkgrooturl}. The "pkgroot" is the directory containing the package database.Also perform a similar substitution for the older GHC-specific "$topdir" variable. The "topdir" is the location of the ghc installation (obtained from the -B option).9 9 None-tkpqsrtuvwxyz{|}~ pqsrtuvwxyz{|}~ Noneu abcP Pcba;Nonev( <Nonev}   Safe-Inferred{ ghc-lib-parsermapAndUnzipM for triples ghc-lib-parserMonadic version of mapAccumL ghc-lib-parserMonadic version of mapSnd ghc-lib-parserMonadic version of concatMap ghc-lib-parserApplicative version of mapMaybe ghc-lib-parserMonadic version of fmap ghc-lib-parserMonadic version of fmap ghc-lib-parserMonadic version of &, aborts the computation at the first True value ghc-lib-parserMonad version of &, aborts the computation at the first False value ghc-lib-parserMonadic version of or ghc-lib-parser1Monadic version of foldl that discards its result ghc-lib-parser-Monadic version of fmap specialised for Maybe ghc-lib-parserMonadic version of when#, taking the condition in the monad ghc-lib-parserMonadic version of unless#, taking the condition in the monad ghc-lib-parserLike ), only it reverses the sense of the test. ghc-lib-parsercombining functionghc-lib-parser initial stateghc-lib-parserinputsghc-lib-parserfinal state, outputs%46#"$TSX %6#"$4TS X   =None| ghc-lib-parser+A state monad which is strict in the state s, but lazy in the value a.See Note [Strict State monad] for the particular notion of strictness and implementation details. @ Safe-Inferred~ ghc-lib-parserA colour/style for use with coloured. ghc-lib-parser;Parse the colour scheme from a string (presumably from the  GHC_COLORS environment variable). ghc-lib-parserAllow colours to be combined (e.g. bold + red); In case of conflict, right side takes precedence.  A Safe-Inferred~  B Safe-Inferred ghc-lib-parserA filepath like x86_64-linux-7.6.3 with the platform string to use when constructing platform-version-dependent files that need to co-exist.  C Safe-Inferred  DNone ghc-lib-parserThis type is very similar to J, but it omits the constructors that involve pretty-printing via > . Due to the implementation of  for J , this type can be caught as a J.Note that this should only be used for throwing exceptions, not for catching, as J3 will not be converted to this type when catching. ghc-lib-parser(Some other fatal signal (SIGHUP,SIGTERM) ghc-lib-parser*Prints the short usage msg after the error ghc-lib-parserA problem with the command line arguments, but don't print usage. ghc-lib-parserThe  impossible happened. ghc-lib-parserThe user tickled something that's known not to work yet, but we're not counting it as a bug. ghc-lib-parserAn installation problem. ghc-lib-parser&An error in the user's code, probably. ghc-lib-parser;Append a description of the given exception to this string. ghc-lib-parserPanics and asserts. ghc-lib-parserPanics and asserts. ghc-lib-parserPanics and asserts. ghc-lib-parserThrow a failed assertion exception for a given filename and line number.  None -u* ghc-lib-parser'A call stack constraint, but only when  isDebugOn. ghc-lib-parser+Apply a function iff some condition is met. ghc-lib-parserApply a function n times to a given value. ghc-lib-parser3Like filter, only it reverses the sense of the test ghc-lib-parserUses a function to determine which of two output lists an input element should join ghc-lib-parser  is a kind of 0 that is lazy in the second list (observe the ~) ghc-lib-parser  is like  but is lazy in the second list. The length of the output is always the same as the length of the first list. ghc-lib-parser  is like  but is lazy in the second and third lists. The length of the output is always the same as the length of the first list. ghc-lib-parser  takes a list of Bools and a list of some elements and filters out these elements for which the corresponding value in the list of Bools is False. This function does not check whether the lists have equal length. ghc-lib-parser  takes a list of Bools and two lists as input, and outputs a new list consisting of elements from the last two input lists. For each Bool in the list, if it is J;, then it takes an element from the former list. If it is G, it takes an element from the latter list. The elements taken correspond to the index of the Bool in its list. For example: filterByLists [True, False, True, False] "abcd" "wxyz" = "axcz" This function does not check whether the lists have equal length. ghc-lib-parser  takes a list of Bools and a list of some elements and partitions the list according to the list of Bools. Elements corresponding to J+ go to the left; elements corresponding to G go to the right. For example, ;partitionByList [True, False, True] [1,2,3] == ([1,3], [2]) This function does not check whether the lists have equal length; when one list runs out, the function stops. ghc-lib-parserstretchZipWith p z f xs ys stretches ys by inserting z in the places where p returns True ghc-lib-parserThis has the effect of making the two lists have equal length by dropping the tail of the longer one. ghc-lib-parseratLength atLen atEnd ls n unravels list ls to position n . Precisely:  atLength atLenPred atEndPred ls n | n < 0 = atLenPred ls | length ls < n = atEndPred (n - length ls) | otherwise = atLenPred (drop n ls) ghc-lib-parser &(lengthExceeds xs n) = (length xs > n) ghc-lib-parser '(lengthAtLeast xs n) = (length xs >= n) ghc-lib-parser "(lengthIs xs n) = (length xs == n) ghc-lib-parser %(lengthIsNot xs n) = (length xs /= n) ghc-lib-parser &(lengthAtMost xs n) = (length xs <= n) ghc-lib-parser ((lengthLessThan xs n) == (length xs < n) ghc-lib-parserTrue if length xs == length ys ghc-lib-parserTrue if length xs <= length ys ghc-lib-parserTrue if length xs < length ys ghc-lib-parser=Utility function to go from a singleton list to it's element.Wether or not the argument is a singleton list is only checked in debug builds. ghc-lib-parserExtract the single element of a list and panic with the given message if there are more elements or the list was empty. Like  expectJust, but for lists. ghc-lib-parserSplit a list into chunks of n elements ghc-lib-parser8Replace the last element of a list with another element. ghc-lib-parserApply an effectful function to the last list element. Assumes a non-empty list (panics otherwise). ghc-lib-parser4Merge an unsorted list of sorted lists, for example: mergeListsBy compare [ [2,5,15], [1,10,100] ] = [1,2,5,10,15,100] O(n \log{} k) ghc-lib-parser=Remove duplicates but keep elements in order. O(n * log n) ghc-lib-parser=Remove duplicates but keep elements in order. O(n * log n) ghc-lib-parser;Given two lists xs and ys, return `splitAt (length xs) ys`. ghc-lib-parser+spanEnd p l == reverse (span p (reverse l)). The first list returns actually comes after the second list (when you look at the input list). ghc-lib-parser-Get the last two elements in a list. Partial! ghc-lib-parser onJust x m f? applies f to the value inside the Just or returns the default. ghc-lib-parserSplit a list into its last element and the initial part of the list. %snocView xs = Just (init xs, last xs) for non-empty lists. snocView xs = Nothing otherwise. Unless both parts of the result are guaranteed to be used prefer separate calls to last + init. If you are guaranteed to use both, this will be more efficient. ghc-lib-parser=Convert a word to title case by capitalising the first letter ghc-lib-parserSearch for possible matches to the users input in the given list, returning a small number of ranked results ghc-lib-parser*Determine the $log_2$ of exact powers of 2 ghc-lib-parserParse a string into a significand and exponent. A trivial example might be: ghci> readSignificandExponentPair "1E2" (1,2) In a more complex case we might return a exponent different than that which the user wrote. This is needed in order to use a Integer significand. ghci> readSignificandExponentPair "-1.11E5" (-111,3) ghc-lib-parserParse a string into a significand and exponent according to the "Hexadecimal Floats in Haskell" proposal. A trivial example might be: ghci> readHexSignificandExponentPair "0x1p+1" (1,1) Behaves similar to readSignificandExponentPair but the base is 16 and numbers are given in hexadecimal: ghci> readHexSignificandExponentPair "0xAp-4" (10,-4) ghci> readHexSignificandExponentPair "0x1.2p3" (18,-1) ghc-lib-parserA sample hash function for Strings. We keep multiplying by the golden ratio and adding. The implementation is: hashString = foldl' f golden where f m c = fromIntegral (ord c) * magic + hashInt32 m magic = 0xdeadbeef2Where hashInt32 works just as hashInt shown above.Knuth argues that repeated multiplication by the golden ratio will minimize gaps in the hash space, and thus it's a good choice for combining together multiple keys to form one.Here we know that individual characters c are often small, and this produces frequent collisions if we use ord c alone. A particular problem are the shorter low ASCII and ISO-8859-1 character strings. We pre-multiply by a magic twiddle factor to obtain a good distribution. In fact, given the following test: testp :: Int32 -> Int testp k = (n - ) . length . group . sort . map hs . take n $ ls where ls = [] : [c : l | l <- ls, c <- ['\0'..'\xff']] hs = foldl' f golden f m c = fromIntegral (ord c) * k + hashInt32 m n = 100000!We discover that testp magic = 0.QR  Q R   9  3 2 None -5? ghc-lib-parserTakes a list of Maybes and returns the first Just if there is one, or Nothing otherwise. ghc-lib-parserTakes computations returnings Maybes6; tries each one in order. The first one to return a Just wins. Returns Nothing if all computations return Nothing. ghc-lib-parserFlipped version of  fromMaybe, useful for chaining. ghc-lib-parserTry performing an D action, failing on error.AHI    4ENone  3< ghc-lib-parserA  5 is a pointer to some array of Latin-1 encoded chars. ghc-lib-parserLexical FastStringThis is a simple FastString wrapper with an Ord instance using  (i.e. which compares FastStrings on their String representation). Hence it is deterministic from one run to the other. ghc-lib-parserNon-deterministic FastStringThis is a simple FastString wrapper with an Ord instance using  (i.e. which compares FastStrings on their Uniques). Hence it is not deterministic from one run to the other. ghc-lib-parserA  : is a UTF-8 encoded string together with a unique ID. All  s are stored in a global hashtable to support fast O(1) comparison.It is also associated with a lazy reference to the Z-encoding of this string which is used by the compiler internally. ghc-lib-parserLazily computed Z-encoding of this string. See Note [Z-Encoding] in GHC.Utils.Encoding.Since  s are globally memoized this is computed at most once for any given string. ghc-lib-parser:Gives the Modified UTF-8 encoded bytes corresponding to a  ghc-lib-parser:Gives the Modified UTF-8 encoded bytes corresponding to a  ghc-lib-parserCompare FastString lexically2If you don't care about the lexical ordering, use  instead.ghc-lib-parser3Compare FastString by their Unique (not lexically).Much cheaper than  but non-deterministic!ghc-lib-parser Create a   by copying an existing ghc-lib-parser Create a   from an existing  without copying.ghc-lib-parserCreates a UTF-8 encoded   from a ghc-lib-parser Creates a   from a UTF-8 encoded [Word8]ghc-lib-parserReturns the length of the   in charactersghc-lib-parserReturns True if the   is emptyghc-lib-parser"Unpacks and decodes the FastStringghc-lib-parser!Returns a Z-encoded version of a  . This might be the original, if it was already Z-encoded. The first time this function is applied to a particular  , the results are memoized.ghc-lib-parser Outputs a   with no decoding at all,, that is, you get the actual bytes in the   written to the .ghc-lib-parserWrap an unboxed address into a  .ghc-lib-parser Encode a  into a newly allocated   using Latin-1 encoding. The original string must not contain non-Latin-1 characters (above codepoint 0xff).ghc-lib-parser Decode a   back into a  using Latin-1 encoding. This does not free the memory associated with  .ghc-lib-parserReturn the length of a  1 1    FNonenghc-lib-parser$Is this an acceptable variable name?ghc-lib-parser'Is this an acceptable constructor name?ghc-lib-parser Is this an acceptable type name?ghc-lib-parserIs this an acceptable alphanumeric variable name, assuming it starts with an acceptable letter?ghc-lib-parserIs this an acceptable symbolic variable name, assuming it starts with an acceptable character?ghc-lib-parserIs this an acceptable alphanumeric constructor name, assuming it starts with an acceptable letter?ghc-lib-parserIs this an acceptable symbolic constructor name, assuming it starts with an acceptable character?GNoneghc-lib-parserReplicate an 8-bit character  H"(c) The University of Glasgow 2001 BSD-style (see the file LICENSE)!David Terei stableportableNoneɄ(ghc-lib-parserRendering mode.ghc-lib-parserNormalghc-lib-parserWith zig-zag cutsghc-lib-parser%No indentation, infinitely long linesghc-lib-parserAll on one lineghc-lib-parserA rendering style.ghc-lib-parserThe rendering modeghc-lib-parserLength of line, in charsghc-lib-parser%Ratio of line length to ribbon lengthghc-lib-parserThe TextDetails data typeA TextDetails represents a fragment of text that will be output at some point.ghc-lib-parserA single Char fragmentghc-lib-parserA whole String fragmentghc-lib-parserThe abstract type of documents. A Doc represents a *set* of layouts. A Doc with no occurrences of Union or NoDoc represents just one layout.ghc-lib-parserA document of height and width 1, containing a literal character.ghc-lib-parser5A document of height 1 containing a literal string.  satisfies the following laws:  s   t =  (st) ""  x = x, if x non-empty8The side condition on the last law is necessary because  "" has height 1, while  has no height.ghc-lib-parserSome text with any width. (text s = sizedText (length s) s)ghc-lib-parserSome text, but without any width. Use for non-printing text such as a HTML or Latex tagsghc-lib-parser*Empty text (one line high but no width). (emptyText = text "")ghc-lib-parser2The empty document, with no height and no width.  is the identity for , ,  and ), and anywhere in the argument list for , , , ,  etc.ghc-lib-parserReturns J if the document is emptyghc-lib-parserApply  to  if boolean is true.ghc-lib-parserList version of .ghc-lib-parserList version of .ghc-lib-parserList version of .ghc-lib-parserNest (or indent) a document by a given number of positions (which may also be negative).  satisfies the laws:  0 x = x  k ( k' x) =  (k+k') x  k (x  y) =  k z   k y  k (x  y) =  k x   k y  k  = x   k y = x  y, if x non-empty6The side condition on the last law is needed because  is a left identity for .ghc-lib-parser "hang d1 n d2 = sep [d1, nest n d2]ghc-lib-parserApply  to the arguments if the first  is not empty.ghc-lib-parser punctuate p [d1, ... dn] = [d1 <> p, d2 <> p, ... dn-1 <> p, dn]ghc-lib-parserAbove, except that if the last line of the first argument stops at least one position before the first line of the second begins, these two lines are overlapped. For example: % text "hi" $$ nest 5 (text "there") lays out as  hi there rather than  hi there is associative, with identity , and also satisfies(x  y)  z = x  (y  z), if y non-empty.ghc-lib-parserAbove, with no overlapping.  is associative, with identity .ghc-lib-parser Beside.  is associative, with identity .ghc-lib-parser;Beside, separated by space, unless one of the arguments is .  is associative, with identity .ghc-lib-parserEither  or .ghc-lib-parserEither  or .ghc-lib-parser"Paragraph fill" version of .ghc-lib-parser"Paragraph fill" version of .ghc-lib-parserThe default style (7mode=PageMode False, lineLength=100, ribbonsPerLine=1.5).ghc-lib-parser Render the Doc to a String using the given Style.ghc-lib-parserDefault TextDetails printerghc-lib-parser The general rendering interface.ghc-lib-parserA ';' characterghc-lib-parserA ',' characterghc-lib-parserA : characterghc-lib-parserA space characterghc-lib-parserA '=' characterghc-lib-parserA '(' characterghc-lib-parserA ')' characterghc-lib-parserA '[' characterghc-lib-parserA ']' characterghc-lib-parserA '{' characterghc-lib-parserA '}' characterghc-lib-parser int n = text (show n)ghc-lib-parser integer n = text (show n)ghc-lib-parser float n = text (show n)ghc-lib-parser double n = text (show n)ghc-lib-parser rational n = text (show n)ghc-lib-parser%See Note [Print Hexadecimal Literals]ghc-lib-parserWrap document in '...'ghc-lib-parserWrap document in "..."ghc-lib-parserWrap document in (...)ghc-lib-parserWrap document in [...]ghc-lib-parserWrap document in {...}ghc-lib-parserRendering modeghc-lib-parser Line lengthghc-lib-parserRibbons per lineghc-lib-parserWhat to do with textghc-lib-parserWhat to do at the endghc-lib-parser The documentghc-lib-parserResult5566>None2<> ghc-lib-parser'Represents a pretty-printable document.To display an  , use , , , or . Avoid calling . directly as it breaks the abstraction layer.ghc-lib-parserWhen we print a binder, we often want to print its type too. The OutputableBndr class encapsulates this idea.ghc-lib-parser is used to tell the thing that prints binder what language construct is binding the identifier. This can be used to decide how much info to print. Also see Note [Binding-site specific printing] in  GHC.Core.Pprghc-lib-parserThe x in (x. e)ghc-lib-parser+The x in case scrut of x { (y,z) -> ... }ghc-lib-parser+The y,z in case scrut of x { (y,z) -> ... }ghc-lib-parserThe x in (let x = rhs in e)ghc-lib-parserWrapper for types having a Outputable instance when an OutputableP instance is required.ghc-lib-parser5Outputable class with an additional environment value See Note [The OutputableP class]ghc-lib-parser(Class designating that some type has an   representationghc-lib-parser stopghc-lib-parserUse  field as depthghc-lib-parserStyle of label pretty-printing.When we produce C sources or headers, we have to take into account that C compilers transform C labels when they convert them into symbols. For example, they can add prefixes (e.g., "_" on Darwin) or suffixes (size for stdcalls on Windows). So we provide two ways to pretty-print CLabels: C style or Asm style.ghc-lib-parser+C label style (used by C and LLVM backends)ghc-lib-parser%Asm label style (used by NCG backend)ghc-lib-parser!Print code; either C or assemblerghc-lib-parser$NB: This won't ever show package IDsghc-lib-parserDefault style for error messages, when we don't know PrintUnqualified It's a bit of a hack because it doesn't take into account what's in scope Only used for desugarer warnings, and typechecker errors in interface sigsghc-lib-parser!Style for printing error messagesghc-lib-parserDefault pretty-printing optionsghc-lib-parser6Truncate a list that is longer than the current depth.ghc-lib-parser'Indicate if -dppr-debug mode is enabledghc-lib-parser,Says what to do with and without -dppr-debugghc-lib-parser7Says what to do with -dppr-debug; without, return emptyghc-lib-parserThe analog of  for  , which tries to make sure the terminal doesn't get screwed up by the ANSI color codes if an exception is thrown during pretty-printing.ghc-lib-parserLike  but appends an extra newline.ghc-lib-parserAn efficient variant of  specialized for  that outputs to a .ghc-lib-parserdoublePrec p n shows a floating point number n with p. digits of precision after the decimal point.ghc-lib-parserIndent   some specified amountghc-lib-parser Join two  $ together horizontally without a gapghc-lib-parser Join two  . together horizontally with a gap between themghc-lib-parser Join two   together vertically; if there is no vertical overlap it "dovetails" the two onto one lineghc-lib-parser Join two   together verticallyghc-lib-parser Concatenate   horizontallyghc-lib-parser Concatenate  + horizontally with a space between each oneghc-lib-parser Concatenate   vertically with dovetailingghc-lib-parserSeparate: is either like  or like , depending on what fitsghc-lib-parserCatenate: is either like  or like , depending on what fitsghc-lib-parserA paragraph-fill combinator. It's much like sep, only it keeps fitting things on one line until it can't fit any more.ghc-lib-parserThis behaves like , but it uses ( for horizontal conposition rather than ghc-lib-parserThis behaves like , but does not indent the second document when the header is empty.ghc-lib-parser.Apply the given colour/style for the argument.)Only takes effect if colours are enabled.ghc-lib-parser2Special combinator for showing character literals.ghc-lib-parser/Special combinator for showing string literals.ghc-lib-parser3Special combinator for showing bytestring literals.ghc-lib-parser0Special combinator for showing unboxed literals.ghc-lib-parser9Normalise, escape and render a string representing a pathe.g. "c:\whatever"ghc-lib-parserReturns the separated concatenation of the pretty printed things.ghc-lib-parserReturns the comma-separated concatenation of the pretty printed things.ghc-lib-parserReturns the comma-separated concatenation of the quoted pretty printed things. ,y,z] ==> `x', `y', `z'ghc-lib-parser&Converts an integer to a verbal index: speakNth 1 = text "first" speakNth 5 = text "fifth" speakNth 21 = text "21st"ghc-lib-parser-Converts an integer to a verbal multiplicity: speakN 0 = text "none" speakN 5 = text "five" speakN 10 = text "10"ghc-lib-parserConverts an integer and object description to a statement about the multiplicity of those objects: speakNOf 0 (text "melon") = text "no melons" speakNOf 1 (text "melon") = text "one melon" speakNOf 3 (text "melon") = text "three melons"ghc-lib-parserDetermines the pluralisation suffix appropriate for the length of a list: plural [] = char 's' plural ["Hello"] = empty plural ["Hello", "World"] = char 's'ghc-lib-parserDetermines the singular verb suffix appropriate for the length of a list: singular [] = empty singular["Hello"] = char 's' singular ["Hello", "World"] = emptyghc-lib-parserDetermines the form of to be appropriate for the length of a list: isOrAre [] = text "are" isOrAre ["Hello"] = text "is" isOrAre ["Hello", "World"] = text "are"ghc-lib-parserDetermines the form of to do appropriate for the length of a list: doOrDoes [] = text "do" doOrDoes ["Hello"] = text "does" doOrDoes ["Hello", "World"] = text "do"ghc-lib-parserDetermines the form of possessive appropriate for the length of a list: itsOrTheir [x] = text "its" itsOrTheir [x,y] = text "their" itsOrTheir [] = text "their" -- probably avoid thisghc-lib-parserDetermines the form of subject appropriate for the length of a list: thisOrThese [x] = text "This" thisOrThese [x,y] = text "These" thisOrThese [] = text "These" -- probably avoid thisghc-lib-parser"has" or "have"# depending on the length of a list.ghc-lib-parser The headerghc-lib-parserAmount to indent the hung bodyghc-lib-parser3The hung body, indented and placed below the headerghc-lib-parserThe punctuationghc-lib-parserThe list that will have punctuation added between every adjacent pair of elementsghc-lib-parserPunctuated listghc-lib-parser#The pretty printing function to useghc-lib-parserThe things to be pretty printedghc-lib-parser  where the things have been pretty printed, comma-separated and finally packed into a paragraph.ghc-lib-parser#The pretty printing function to useghc-lib-parserThe things to be pretty printedghc-lib-parser  where the things have been pretty printed, bar-separated and finally packed into a paragraph.       JNoneIghc-lib-parser=GHC's own exception type error messages all take the form:  : If the location is on the command line, or in GHC itself, then ="ghc". All of the error types below correspond to a of "ghc", except for ProgramError (where the string is assumed to contain a location already, so we don't print one).ghc-lib-parser(Some other fatal signal (SIGHUP,SIGTERM)ghc-lib-parser*Prints the short usage msg after the errorghc-lib-parserA problem with the command line arguments, but don't print usage.ghc-lib-parserThe  impossible happened.ghc-lib-parserThe user tickled something that's known not to work yet, but we're not counting it as a bug.ghc-lib-parserAn installation problem.ghc-lib-parser&An error in the user's code, probably.ghc-lib-parserShow an exception as a string.ghc-lib-parserShow an exception which can possibly throw other exceptions. Used when displaying exception thrown within TH code.ghc-lib-parser;Append a description of the given exception to this string.Note that this uses >, which doesn't use the options set by the user via DynFlags.ghc-lib-parser;Append a description of the given exception to this string.ghc-lib-parser7Throw an exception saying "bug in GHC" with a callstackghc-lib-parser&Throw an exception saying "bug in GHC"ghc-lib-parser3Throw an exception saying "this isn't finished yet"ghc-lib-parserThrow an exception saying "bug in pgm being compiled" (used for unusual program errors)ghc-lib-parserLike try, but pass through UserInterrupt and Panic exceptions. Used when we want soft failures when reading interface files, for example. TODO: I'm not entirely sure if this is catching what we really want to catchghc-lib-parserTemporarily install standard signal handlers for catching ^C, which just throw an exception in the current thread.ghc-lib-parserPanic with an assertion failure, recording the given file and line number. Should typically be accessed with the ASSERT family of macros*z *    zNoneQghc-lib-parser!If debug output is on, show some   on the screenghc-lib-parserpprTraceWith desc f x is equivalent to pprTrace desc (f x) x. This allows you to print details from the returned value as well as from ambient variables.ghc-lib-parserpprTraceIt desc x is equivalent to pprTrace desc (ppr x) xghc-lib-parserpprTraceException desc x action< runs action, printing a message if it throws an exception.ghc-lib-parser!If debug output is on, show some  7 on the screen along with a call stack when available.ghc-lib-parserJust warn about an assertion failure, recording the given file and line number.ghc-lib-parserFor when we want to show the user a non-fatal WARNING so that they can report a GHC bug, but don't want to panic.  KNoneghc-lib-parserExpand occurrences of the $tooldir interpolation in a string on Windows, leave the string untouched otherwise.ghc-lib-parser.Returns a Unix-format path pointing to TopDir.ghc-lib-parser.whether we are use the ambiant mingw toolchainghc-lib-parsertooldirghc-lib-parser,Maybe TopDir path (without the '-B' prefix).ghc-lib-parserTopDir (in Unix format  separated)ghc-lib-parser.whether we are use the ambiant mingw toolchainghc-lib-parsertopdirLNoneMNoneghc-lib-parser2Edge weights to use when generating a CFG from CMMghc-lib-parserDefault edge weights  NNone '(>]ghc-lib-parser-Simple data type to represent JSON documents.  ONoneghc-lib-parser9Subset of UnitInfo: just enough to pretty-print a unit-idInstead of printing the unit-id which may contain a hash, we print: package-version:componentnameghc-lib-parser Identifierghc-lib-parserSource package nameghc-lib-parserSource package versionghc-lib-parserComponent namePNoneghc-lib-parser%Class of things that we can obtain a  fromghc-lib-parserUnique identifier.The type of unique identifiers that are used in many places in GHC for fast ordering and equality tests. You should generate these with the functions from the  UniqSupply moduleThese are sometimes also referred to as "keys" in comments in GHC.ghc-lib-parserThe interface file symbol-table encoding assumes that known-key uniques fit in 30-bits; verify this.3See Note [Symbol table representation of names] in GHC.Iface.Binary for details.QNone  ghc-lib-parser)A monad for generating unique identifiersghc-lib-parserGet a new UniqueSupplyghc-lib-parserGet a new unique identifierghc-lib-parser.Get an infinite list of new unique identifiersghc-lib-parser/A monad which just gives the ability to obtain sghc-lib-parser Unique SupplyA value of type  is unique, and it can supply one distinct . Also, from the supply, one can also manufacture an arbitrary number of further  UniqueSupply values, which will be distinct from the first and from all others.ghc-lib-parserCreate a unique supply out of thin air. The "mask" (Char) supplied is purely cosmetic, making it easier to figure out where a Unique was born. See Note [Uniques and masks].The payload part of the Uniques allocated from this UniqSupply are guaranteed distinct wrt all other supplies, regardless of their "mask". This is achieved by allocating the payload part from a single source of Uniques, namely ", shared across all UniqSupply's.ghc-lib-parser Build two 6 from a single one, each of which can supply its own .ghc-lib-parserCreate an infinite list of  from a single oneghc-lib-parser Obtain the  from this particular ghc-lib-parserObtain an infinite list of : that can be generated by constant splitting of the supplyghc-lib-parser Obtain the  from this particular , and a new supplyghc-lib-parserRun the  action, returning the final ghc-lib-parserRun the  action, discarding the final RNone3 ghc-lib-parserA wrapper around  with the sole purpose of informing call sites that the provided 7 and 8 instances are nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM to learn about determinism.ghc-lib-parserA finite map from uniques* of one type to elements in another type.The key is just here to keep us honest. It's always safe to use a single type as key. If two types don't overlap in their uniques it's also safe to index the same map at multiple key types. But this is very much discouraged.ghc-lib-parserAdd elements to the map, combining existing values with inserted ones using the given function.ghc-lib-parser1`plusUFM_CD f m1 d1 m2 d2` merges the maps using f! as the combinding function and d1 resp. d2/ as the default value if there is no entry in m1 reps. m2-. The domain is the union of the domains of m1 and m2.IMPORTANT NOTE: This function strictly applies the modification function and forces the result unlike most the other functions in this module.Representative example: plusUFM_CD f {A: 1, B: 2} 23 {B: 3, C: 4} 42 == {A: f 1 42, B: f 2 3, C: f 23 4 } ghc-lib-parser,`plusUFM_CD2 f m1 m2` merges the maps using f$ as the combining function. Unlike =, a missing value is not defaulted: it is instead passed as H to f. f' can never have both its arguments be H.IMPORTANT NOTE: This function strictly applies the modification function and forces the result.`plusUFM_CD2 f m1 m2` is the same as `plusUFM_CD f (mapUFM Just m1) Nothing (mapUFM Just m2) Nothing`.ghc-lib-parserminusUFC_C f map1 map2 returns map1, except that every mapping key |-> value1 in map1" that shares a key with a mapping key |-> value2 in map2 is altered by f: value1 is replaced by f value1 value2 , where I& means that the new value is used and H$ means that the mapping is deleted.ghc-lib-parserIn essence foldM See Note [Deterministic UniqFM] to learn about nondeterminism. If you use this please provide a justification why it doesn't introduce nondeterminism.ghc-lib-parser Cast the key domain of a UniqFM.As long as the domains don't overlap in their uniques this is safe.ghc-lib-parserPretty-print a non-deterministic set. The order of variables is non-deterministic and for pretty-printing that shouldn't be a problem. Having this function helps contain the non-determinism created with nonDetEltsUFM.ghc-lib-parserPretty-print a non-deterministic set. The order of variables is non-deterministic and for pretty-printing that shouldn't be a problem. Having this function helps contain the non-determinism created with nonDetUFMToList.ghc-lib-parserDetermines the pluralisation suffix appropriate for the length of a set in the same way that plural from Outputable does for lists.ghc-lib-parserInherently nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM to learn about determinism.ghc-lib-parserInherently nondeterministic. If you use this please provide a justification why it doesn't introduce nondeterminism. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM to learn about determinism.ghc-lib-parserThe things to be pretty printedghc-lib-parser3The pretty printing function to use on the elementsghc-lib-parser + where the things have been pretty printedghc-lib-parserThe things to be pretty printedghc-lib-parser3The pretty printing function to use on the elementsghc-lib-parser + where the things have been pretty printedSNone 35ghc-lib-parserMaps indexed by  keys""TNone 3567Partition UniqDFM into two UniqDFMs according to the predicateghc-lib-parser(Delete a list of elements from a UniqDFMghc-lib-parser7This allows for lossy conversion from UniqDFM to UniqFMghc-lib-parser(Apply a function to a particular elementghc-lib-parser(Apply a function to a particular elementghc-lib-parserThe expression (alterUDFM f k map) alters value x at k, or absence thereof. alterUDFM can be used to insert, delete, or update a value in UniqDFM. Use addToUDFM, delFromUDFM or adjustUDFM when possible, they are more efficient.ghc-lib-parser,Map a function over every value in a UniqDFMghc-lib-parser Cast the key domain of a UniqFM.As long as the domains don't overlap in their uniques this is safe.ghc-lib-parserDeterministic, in O(n log n).ghc-lib-parserDeterministic, in O(n log n).ghc-lib-parserThe things to be pretty printedghc-lib-parser3The pretty printing function to use on the elementsghc-lib-parser + where the things have been pretty printed//UNone3)ghc-lib-parserWhat's the point you might ask? We might have changed an object without it's key changing. In which case this lookup makes sense.ghc-lib-parser converts a  a into a  a0 assuming, without checking, that it maps each  to a value that has that . See Note [UniqSet invariant].$$VNone13ghc-lib-parserA  whose domain is sets of /s, each of which share a common value of type ele. Every such set ("equivalence class") has a distinct representative . Supports merging the entries of multiple such sets in a union-find like fashion.An accurate model is that of [(Set key, Maybe ele)]!: A finite mapping from sets of keys to possibly absent entries ele+, where the sets don't overlap. Example:  m = [({u1,u3}, Just ele1), ({u2}, Just ele2), ({u4,u7}, Nothing)] 9 On this model we support the following main operations: m u3 == Just ele1,  m u4 == Nothing,  m u5 == Nothing. m u1 u3 is a no-op, but  m u1 u2 merges {u1,u3} and {u2} to point to  Just ele2 and returns the old entry of {u1,u3},  Just ele1. m u3 ele4 sets the entry of {u1,u3} to  Just ele4.8As well as a few means for traversal/conversion to list.ghc-lib-parserlookupSUDFM env x looks up an entry for x, looking through all s until it finds a shared .$Examples in terms of the model (see ): >>> lookupUSDFM [({u1,u3}, Just ele1), ({u2}, Just ele2)] u3 == Just ele1 >>> lookupUSDFM [({u1,u3}, Just ele1), ({u2}, Just ele2)] u4 == Nothing >>> lookupUSDFM [({u1,u3}, Just ele1), ({u2}, Nothing)] u2 == Nothingghc-lib-parserequateUSDFM env x y makes x and y+ point to the same entry, thereby merging x's class with y 's. If both x and y$ are in the domain of the map, then y.'s entry will be chosen as the new entry and x's old entry will be returned.$Examples in terms of the model (see ): >>> equateUSDFM [] u1 u2 == (Nothing, [({u1,u2}, Nothing)]) >>> equateUSDFM [({u1,u3}, Just ele1)] u3 u4 == (Nothing, [({u1,u3,u4}, Just ele1)]) >>> equateUSDFM [({u1,u3}, Just ele1)] u4 u3 == (Nothing, [({u1,u3,u4}, Just ele1)]) >>> equateUSDFM [({u1,u3}, Just ele1), ({u2}, Just ele2)] u3 u2 == (Just ele1, [({u2,u1,u3}, Just ele2)])ghc-lib-parseraddToUSDFM env x a sets the entry x is associated with to a1, thereby modifying its whole equivalence class.$Examples in terms of the model (see ): >>> addToUSDFM [] u1 ele1 == [({u1}, Just ele1)] >>> addToUSDFM [({u1,u3}, Just ele1)] u3 ele2 == [({u1,u3}, Just ele2)]WNone345XNone#$3567>?U2ghc-lib-parser$Layout information for declarations.ghc-lib-parser$Explicit braces written by the user. 'class C a where { foo :: a; bar :: a } ghc-lib-parser0Virtual braces inserted by the layout algorithm. &class C a where foo :: a bar :: a ghc-lib-parserEmpty or compiler-generated blocks do not have layout information associated with them.ghc-lib-parserA location as produced by the parser. Consists of two components:'The location in the file, adjusted for  line and {-" LINE ... #-} pragmas (RealSrcLoc)The location in the string buffer (BufPos) with monotonicity guarantees (see #17632)ghc-lib-parserWe attach SrcSpans to lots of things, so let's have a datatype for it.ghc-lib-parser Source SpanA  identifies either a specific portion of a text file or a human-readable description of a location.ghc-lib-parserStringBuffer Source Spanghc-lib-parserA  delimits a portion of a text file. It could be represented by a pair of (line,column) coordinates, but in fact we optimise slightly by using more compact representations for single-line and zero-length spans, both of which are quite common.-The end position is defined to be the column after the end of the span. That is, a span of (1,1)-(1,2) is one character long, and a span of (1,1)-(1,1) is zero characters long.Real Source Spanghc-lib-parserSource Locationghc-lib-parser30-based offset identifying the raw location in the  StringBuffer.The lexer increments the  every time a character (UTF-8 code point) is read from the input buffer. As UTF-8 is a variable-length encoding and  StringBuffer% needs a byte offset for indexing, a  cannot be used for indexing.The parser guarantees that  are monotonic. See #17632. This means that syntactic constructs that appear later in the  StringBuffer" are guaranteed to have a higher . Constrast that with , which does *not* make the analogous guarantee about higher line/column numbers.This is due to  line and {-3 LINE ... #-} pragmas that can arbitrarily modify  . Notice how  setSrcLoc and resetAlrLastLoc in GHC.Parser.Lexer update  , modifying  but preserving .Monotonicity makes  useful to determine the order in which syntactic elements appear in the source. Consider this example (haddockA041 in the test suite):haddockA041.hs {- LANGUAGE CPP -} -- | Module header documentation module Comments_and_CPP_include where #include "IncludeMe.hs"IncludeMe.hs: -- | Comment on T data T = MkT -- ^ Comment on MkT#After the C preprocessor runs, the  StringBuffer will contain a program that looks like this (unimportant lines at the beginning removed):# 1 "haddockA041.hs" {- LANGUAGE CPP -} -- | Module header documentation module Comments_and_CPP_include where # 1 "IncludeMe.hs" 1 -- | Comment on T data T = MkT -- ^ Comment on MkT # 7 "haddockA041.hs" 2The line pragmas inserted by CPP make the error messages more informative. The downside is that we can't use RealSrcLoc to determine the ordering of syntactic elements.With RealSrcLoc, we have the following location information recorded in the AST: * The module name is located at haddockA041.hs:3:8-31 * The Haddock comment "Comment on T" is located at IncludeMe:1:1-17 * The data declaration is located at IncludeMe.hs:2:1-32Is the Haddock comment located between the module name and the data declaration? This is impossible to tell because the locations are not comparable; they even refer to different files.On the other hand, with , we have the following location information: * The module name is located at 846-870 * The Haddock comment "Comment on T" is located at 898-915 * The data declaration is located at 916-928Aside: if you're wondering why the numbers are so high, try running ghc -E haddockA041.hs and see the extra fluff that CPP inserts at the start of the file.For error messages,  is not useful at all. On the other hand, this is exactly what we need to determine the order of syntactic elements: 870 < 898, therefore the Haddock comment appears *after* the module name. 915 < 916, therefore the Haddock comment appears *before* the data declaration.We use  in in GHC.Parser.PostProcess.Haddock to associate Haddock comments with parts of the AST using location information (#17544).ghc-lib-parserReal Source Location'Represents a single point within a fileghc-lib-parserBuilt-in "bad"  values for particular locationsghc-lib-parserBuilt-in "bad"  values for particular locationsghc-lib-parserBuilt-in "bad"  values for particular locationsghc-lib-parserCreates a "bad" 4 that has no detailed information about its locationghc-lib-parserGives the filename of the ghc-lib-parser%Raises an error when used on a "bad" ghc-lib-parser%Raises an error when used on a "bad" ghc-lib-parser Move the  down by one line if the character is a newline, to the next 8-char tabstop if it is a tab, and across by one character in any other caseghc-lib-parserBuilt-in "bad" ,s for common sources of location uncertaintyghc-lib-parserBuilt-in "bad" ,s for common sources of location uncertaintyghc-lib-parserBuilt-in "bad" ,s for common sources of location uncertaintyghc-lib-parserBuilt-in "bad" ,s for common sources of location uncertaintyghc-lib-parserCreate a "bad" " that has not location informationghc-lib-parser Create a  corresponding to a single pointghc-lib-parser Create a  between two points in a fileghc-lib-parser Create a  between two points in a fileghc-lib-parser Combines two  into one that spans at least all the characters within both spans. Returns UnhelpfulSpan if the files differ.ghc-lib-parser Combines two  into one that spans at least all the characters within both spans. Assumes the "file" part is the same in both inputsghc-lib-parserConvert a SrcSpan into one that represents only its first characterghc-lib-parser Test if a 1 is "good", i.e. has precise location informationghc-lib-parserTrue if the span is known to straddle only one line. For "bad" , it returns Falseghc-lib-parserTrue if the span has a width of zero, as returned for "virtual" semicolons in the lexer. For "bad" , it returns Falseghc-lib-parserTests whether the first span "contains" the other span, meaning that it covers at least as much source code. True where spans are equal.ghc-lib-parser)Returns the location at the start of the  or a "bad"  if that is unavailableghc-lib-parser'Returns the location at the end of the  or a "bad"  if that is unavailableghc-lib-parserObtains the filename for a  if it is "good"ghc-lib-parserCombine locations from two % things and add them to a third thingghc-lib-parser.Tests whether the two located things are equalghc-lib-parser,Tests the ordering of the two located thingsghc-lib-parser Compare the  of two located things./Precondition: both operands have an associated .ghc-lib-parser4Always prints the location, even without -dppr-debugghc-lib-parserStrategies for ordering sghc-lib-parserStrategies for ordering sghc-lib-parserStrategies for ordering sghc-lib-parserDetermines whether a span encloses a given line and column indexghc-lib-parser4Determines whether a span is enclosed by another oneghc-lib-parser4Determines whether a span is enclosed by another oneghc-lib-parser vghc-lib-parser&Representation for nodes of the Graph.The payload1 is user data, just carried around in this moduleThe key is the node identifier. Key has an Ord instance for performance reasons.The [key] are the dependencies of the node; it's ok to have extra keys in the dependencies that are not the key of any Node in the graphghc-lib-parser User dataghc-lib-parserUser defined node idghc-lib-parser#Dependencies/successors of the nodeghc-lib-parserFind a reasonably short cycle a->b->c->a, in a strongly connected component. The input nodes are presumed to be a SCC, so you can start anywhere.ghc-lib-parser1Given a list of roots return all reachable nodes.ghc-lib-parserEfficiently construct a map which maps each key to it's set of transitive dependencies.ghc-lib-parserGiven a start vertex, a way to get successors from a node and a list of (directed) edges classify the types of edges.##_None 5e&ghc-lib-parsercombining functionghc-lib-parser initial stateghc-lib-parserinputsghc-lib-parserfinal state, outputsghc-lib-parsercombining functionghc-lib-parser initial stateghc-lib-parserinputsghc-lib-parserfinal state, outputs$$33aNone'(.2>m ghc-lib-parserInformation we keep around during interface file serialization/deserialization. Namely we keep the functions for serializing and deserializing s and  s. We do this because we actually use serialization in two distinct settings,+When serializing interface files themselvesWhen computing the fingerprint of an IfaceDecl (which we computing by hashing its Binary serialization)These two settings have different needs while serializing Names:Names in interface files are serialized via a symbol table (see Note [Symbol table representation of names] in GHC.Iface.Binary).During fingerprinting a binding Name is serialized as the OccName and a non-binding Name is serialized as the fingerprint of the thing they represent. See Note [Fingerprinting IfaceDecls] for further discussion.ghc-lib-parserserialize a non-binding ( (e.g. a reference to another binding).ghc-lib-parserserialize a binding  (e.g. the name of an IfaceDecl)ghc-lib-parserEncode the argument in it's full length. This is different from many default binary instances which make no guarantee about the actual encoding and might do things use variable length encoding.ghc-lib-parserDo not rely on instance sizes for general types, we use variable length encoding for many of them.ghc-lib-parser$Get access to the underlying buffer.ghc-lib-parserSerialize the constructor strictly but lazily serialize a value inside a I.This way we can check for the presence of a value without deserializing the value itself.ghc-lib-parser"Deserialize a value serialized by .ghc-lib-parser;This instance doesn't rely on the determinism of the keys' .! instance, so it works e.g. for s too.ghc-lib-parserhow to deserialize sghc-lib-parserhow to serialize non-binding sghc-lib-parserhow to serialize binding s11bNone '(.n5Nonep\ ghc-lib-parser2A ModuleName is essentially a simple string, e.g.  Data.List.ghc-lib-parser6Compares module names lexically, rather than by their sghc-lib-parserReturns the string version of the module name, with dots replaced by slashes.ghc-lib-parserReturns the string version of the module name, with dots replaced by colons.  ?None%3567<>& ghc-lib-parserA Module is a pair of a   and a  . ghc-lib-parserA unit identifier identifies a (possibly partially) instantiated library. It is primarily used as part of  , which in turn is used in Name=, which is used to give names to entities when typechecking.#There are two possible forms for a  :1) It can be a , in which case we just have a  that uniquely identifies some fully compiled, installed library we have on disk.2) It can be an . When we are typechecking a library with missing holes, we may need to instantiate a library on the fly (in which case we don't have any on-disk representation.) In that case, you have an , which explicitly records the instantiation, so that we can substitute over it. ghc-lib-parser6A generic module is a pair of a unit identifier and a  . ghc-lib-parserA UnitId identifies a built library in a database and is used to generate unique symbols, etc. It's usually of the form:pkgname-1.2:libname+hash(These UnitId are provided to us via the  -this-unit-id flag.The library in question may be definite or indefinite; if it is indefinite, none of the holes have been filled (we never install partially instantiated libraries as we can cheaply instantiate them on-the-fly, cf VirtUnit). Put another way, an installed unit id is either fully instantiated, or not instantiated at all. ghc-lib-parserUnit the module belongs to ghc-lib-parserModule name (e.g. A.B.C)ghc-lib-parser"This data type just pairs a value - with an IsBootInterface flag. In practice,  is usually a Module or  ModuleName'.ghc-lib-parserIndicates whether a module name is referring to a boot interface (hs-boot file) or regular module (hs file). We need to treat boot modules specially when building compilation graphs, since they break cycles. Regular source files and signature files are treated equivalently.ghc-lib-parser3A definite unit (i.e. without any free module hole)ghc-lib-parserA  is an   with the invariant that it only refers to a definite library; i.e., one we have generated code for.ghc-lib-parserThe full hashed unit identifier, including the component id and the hash.ghc-lib-parserAn instantiated unit.It identifies an indefinite library (with holes) that has been instantiated.This unit may be indefinite or not (i.e. with remaining holes or not). If it is definite, we don't know if it has already been compiled and installed in a database. Nevertheless, we have a mechanism called "improvement" to try to match a fully instantiated unit with existing compiled and installed units: see Note [VirtUnit to RealUnit improvement].?An indefinite unit identifier pretty-prints to something like p[H= H ,A=aimpl:A>] (p is the  5, and the brackets enclose the module substitution).ghc-lib-parserA private, uniquely identifying representation of an InstantiatedUnit. This string is completely private to GHC and is just used to get a unique.ghc-lib-parserCached unique of .ghc-lib-parser)The (indefinite) unit being instantiated.ghc-lib-parserThe sorted (by  ) instantiations of this unit.ghc-lib-parser$A cache of the free module holes of &. This lets us efficiently tell if a  has been fully instantiated (empty set of free module holes) and whether or not a substitution can have any effect.ghc-lib-parserInstalled definite unit (either a fully instantiated unit or a closed unit)ghc-lib-parserVirtual unit instantiated on-the-fly. It may be definite if all the holes are instantiated but we don't have code objects for it.ghc-lib-parserFake hole unitghc-lib-parserA unit key in the databaseghc-lib-parserClass for types that are used as unit identifiers (UnitKey, UnitId, Unit)We need this class because we create new unit ids for virtual units (see VirtUnit) and they have to to be made from units with different kinds of identifiers.ghc-lib-parserAn  is a  " whose unit is identified with an .ghc-lib-parserA  is like an  but we expect to find it in one of the home units rather than the package database.ghc-lib-parserA  is a  # whose unit is identified with an  .ghc-lib-parser2Compares unit ids lexically, rather than by their sghc-lib-parser+Retrieve the set of free module holes of a  .ghc-lib-parserCalculate the free holes of a  . If this set is non-empty, this module was defined in an indefinite library that had required signatures.If a module has free holes, that means that substitutions can operate on it; if it has no free holes, substituting over a module has no effect.ghc-lib-parser Create a new ' given an explicit module substitution.ghc-lib-parser*Smart constructor for instantiated GenUnitghc-lib-parserGenerate a uniquely identifying hash (internal unit-id) for an instantiated unit.This is a one-way function. If the indefinite unit has not been instantiated at all, we return its unit-id.This hash is completely internal to GHC and is not used for symbol names or file paths. It is different from the hash Cabal would produce for the same instantiated unit.ghc-lib-parser+Create a new simple unit identifier from a  . Internally, this is primarily used to specify wired-in unit identifiers.ghc-lib-parserMap over the unit type of a  ghc-lib-parser4Map over the unit identifier of unit instantiations.ghc-lib-parserReturn the UnitId of the Unit. For on-the-fly instantiated units, return the UnitId of the indefinite unit this unit is an instance of.ghc-lib-parser=Return the virtual UnitId of an on-the-fly instantiated unit.ghc-lib-parserA  % is definite if it has no free holes.ghc-lib-parserThis is the package Id for the current program. It is the default package Id if you don't specify a package name. We don't add this prefix to symbol names, since there can be only one main package per program.         cNone ghc-lib-parserModule LocationWhere a module lives on the file system: the actual locations of the .hs, .hi, .dyn_hi, .o, .dyn_o and .hie files, if we have them.For a module in another unit, the ml_hs_file and ml_obj_file components of ModLocation are undefined.The locations specified by a ModLocation may or may not correspond to actual files yet: for example, even if the object file doesn't exist, the ModLocation still contains the path to where the object file will reside if/when it is created.The paths of anything which can affect recompilation should be placed inside ModLocation.When a ModLocation is created none of the filepaths will have -boot suffixes. This is because in --make mode the ModLocation is put in the finder cache which is indexed by ModuleName, when a ModLocation is retrieved from the FinderCache the boot suffixes are appended. The other case is in -c mode, there the ModLocation immediately gets given the boot suffixes in mkOneShotModLocation.ghc-lib-parserThe source file, if we have one. Package modules probably don't have source files.ghc-lib-parserWhere the .hi file is, whether or not it exists yet. Always of form foo.hi, even if there is an hi-boot file (we add the -boot suffix later)ghc-lib-parser9Where the .dyn_hi file is, whether or not it exists yet.ghc-lib-parserWhere the .o file is, whether or not it exists yet. (might not exist either because the module hasn't been compiled yet, or because it is part of a unit with a .a file)ghc-lib-parser5Where the .dy file is, whether or not it exists yet.ghc-lib-parser6Where the .hie file is, whether or not it exists yet.ghc-lib-parserAdd the -boot suffix to .hs, .hi and .o filesghc-lib-parser Remove the -boot suffix to .hs, .hi and .o filesghc-lib-parserAdd the -boot suffix if the Bool argument is Trueghc-lib-parserAdd the -boot4 suffix to all file paths associated with the moduleghc-lib-parserAdd the -boot suffix to all output file paths associated with the module, not including the input file itselfdNoneeNoneghc-lib-parserA map keyed off of ghc-lib-parserA map keyed off of  s (actually, their s) Has deterministic folds and can be deterministically converted to a listghc-lib-parserA map keyed off of  s (actually, their s)ghc-lib-parser A set of  sghc-lib-parserA map keyed off of  s//fNone5i  gNone #$>o ghc-lib-parserA  % is definite if it has no free holes.ghc-lib-parser!Get a string representation of a   that's unique and stable across recompilations. eg. "$aeson_70dylHtv1FFGeai1IoxcQr$Data.Aeson.Types.Internal"ghc-lib-parserThis gives a stable ordering, as opposed to the Ord instance which gives an ordering based on the Uniques of the components, which may not be stable from run to run of the compiler.ghc-lib-parser Test if a   corresponds to a given , modulo instantiation.ghc-lib-parserGiven a possibly on-the-fly instantiated module, split it into a   that we definitely can find on-disk, as well as an instantiation if we need to instantiate it on the fly. If the instantiation is Nothing" no on-the-fly renaming is needed.ghc-lib-parserReturn the unit-id this unit is an instance of and the module instantiations (if any).ghc-lib-parser4Remove instantiations of the given instantiated unitghc-lib-parser;Remove instantiations of the given module instantiated unitghc-lib-parser$Test if a Module is not instantiatedghc-lib-parserCreate a hole Module    hNoneiNoneghc-lib-parserInformation about the home unit (i.e., the until that will contain the modules we are compiling)The unit identifier of the instantiating units is left open to allow switching from UnitKey (what is provided by the user) to UnitId (internal unit identifier) with .TODO: this isn't implemented yet. UnitKeys are still converted too early into UnitIds in GHC.Unit.State.readUnitDataBaseghc-lib-parser.Definite home unit (i.e. that we can compile).Nothing: not an instantiated unit Just (i,insts): made definite by instantiating "i" with "insts"ghc-lib-parser6Indefinite home unit (i.e. that we can only typecheck)All the holes are instantiated with fake modules from the Hole unit. See Note [Representation of module/name variables] in GHC.Unitghc-lib-parserReturn home unit idghc-lib-parserReturn home unit instantiationsghc-lib-parserReturn the unit id of the unit that is instantiated by the home unit.-E.g. if home unit = q[A=p:B,...] we return q.If the home unit is not an instance of another unit, we return its own unit id (it is an instance of itself if you will).ghc-lib-parserReturn the unit id of the unit that is instantiated by the home unit.4E.g. if home unit = q[A=p:B,...] we return (Just q).If the home unit is not an instance of another unit, we return Nothing.ghc-lib-parser&Return the home unit as a normal unit.We infer from the home unit itself the kind of unit we create: 1. If the home unit is definite, we must be compiling so we return a real unit. The definite home unit may be the result of a unit instantiation, say `p = q[A=r:X]`. In this case we could have returned a virtual unit `q[A=r:X]` but it's not what the clients of this function expect, especially because p is lost when we do this. The unit id of a virtual unit is made up internally so `unitId(q[A=r:X])` is not equal to p. If the home unit is indefinite we can only create a virtual unit from it. It's ok because we must be only typechecking the home unit so we won't produce any code object that rely on the unit id of this virtual unit.ghc-lib-parser4Map over the unit identifier for instantiating unitsghc-lib-parser/Test if we are type-checking an indefinite unit7(if it is not, we should never use on-the-fly renaming)ghc-lib-parser(Test if we are compiling a definite unit3(if it is, we should never use on-the-fly renaming)ghc-lib-parser9Test if we are compiling by instantiating a definite unitghc-lib-parser!Test if the unit is the home unitghc-lib-parser'Test if the unit-id is the home unit-idghc-lib-parser+Test if the unit-id is not the home unit-idghc-lib-parser9Test if the home unit is an instance of the given unit-idghc-lib-parser+Test if the module comes from the home unitghc-lib-parser+Test if the module comes from the home unitghc-lib-parser6Test if a module doesn't come from the given home unitghc-lib-parser6Test if a module doesn't come from the given home unitghc-lib-parser6Test if a module doesn't come from the given home unitghc-lib-parser6Test if a module doesn't come from the given home unitghc-lib-parserMake a module in home unitghc-lib-parserMake a module in home unitghc-lib-parserReturn the module that is used to instantiate the given home module name. If the ModuleName doesn't refer to a signature, return the actual home module."E.g., the instantiating module of A in  p[A=q[]:B] is q[]:B%. the instantiating module of A in p is p:A.ghc-lib-parserReturn the module that is used to instantiate the given home module.If the given module isn't a module hole, return the actual home module."E.g., the instantiating module of p:A in  p[A=q[]:B] is q[]:B%. the instantiating module of r:A in  p[A=q[]:B] is r:A%. the instantiating module of p:A in p is p:A%. the instantiating module of r:A in p is r:A.jNone3 ghc-lib-parserA String Literal in the source, including its original raw format for use by source to source manipulation tools.ghc-lib-parserFractional LiteralUsed (instead of Rational) to represent exactly the floating point literal that we encountered in the user's source program. This allows us to pretty-print exactly what the user wrote, which is important e.g. for floating point numbers that can't represented as Doubles (we used to via Double for pretty-printing). See also #2245. Note [FractionalLit representation] in GHC.HsToCore.Match.Literal The actual value then is: sign * fl_signi * (fl_exp_base^fl_exp) where sign = if fl_neg then (-1) else 1For example FL { fl_neg = True, fl_signi = 5.3, fl_exp = 4, fl_exp_base = Base10 } denotes -5300ghc-lib-parser'How the value was written in the sourceghc-lib-parserIntegral LiteralUsed (instead of Integer) to represent negative zegative zero which is required for NegativeLiterals extension to correctly parse `-0::Double` as negative zero. See also #13211.ghc-lib-parserFor when code is generated, e.g. TH, deriving. The pretty printer will then make its own representation of the item.ghc-lib-parser/Special combinator for showing string literals.ghc-lib-parser7The integer should already be negated if it's negative.ghc-lib-parser=The arguments should already be negated if they are negative.ghc-lib-parserBe wary of using this instance to compare for equal *values* when exponents are large. The same value expressed in different syntactic form won't compare as equal when any of the exponents is >= 100.ghc-lib-parserBe wary of using this instance to compare for equal *values* when exponents are large. The same value expressed in different syntactic form won't compare as equal when any of the exponents is >= 100.!!kNone3(ghc-lib-parser Package-qualifier after renamingRenaming detects if "this" or the unit-id of the home-unit was used as a package qualifier.ghc-lib-parserNo package qualifierghc-lib-parserImport from home-unitghc-lib-parserImport from another unitghc-lib-parser"Package-qualifier as it was parsedghc-lib-parserNo package qualifierghc-lib-parserRaw package qualifier string.lNoneghc-lib-parser.hs fileghc-lib-parser .hs-boot fileghc-lib-parser .hsig fileghc-lib-parser Tests if an 9 is a boot file, primarily for constructing elements of  BuildModule. We conflate signatures and modules because they are bound in the same namespace; only boot interfaces can be disambiguated with `import {- SOURCE -}`.mNone ghc-lib-parserSafe Haskell information for ModIface Simply a wrapper around SafeHaskellMode to sepperate iface and flagsghc-lib-parserThe various Safe Haskell modesghc-lib-parserinferred unsafeghc-lib-parserdeclared and checkedghc-lib-parserdeclared and checkedghc-lib-parserdeclared and checkedghc-lib-parserinferred as safeghc-lib-parser-fno-safe-haskell stateghc-lib-parserIs an import a safe import?  nNone34ghc-lib-parserCaptures the fixity of declarations as they are parsed. This is not necessarily the same as the fixity declaration, as the normal fixity may be overridden using parens or backticks.oNoneghc-lib-parserReadingghc-lib-parserWriting  pNone3sghc-lib-parser$A continguous chunk of documentationghc-lib-parser'|' is the decoratorghc-lib-parser is the decoratorghc-lib-parser'$ string' is the decoratorghc-lib-parser%The decorator is the given number of sghc-lib-parserHaskell Documentation StringRich structure to support exact printing The location around each chunk doesn't include the decoratorsghc-lib-parser#The first chunk is preceded by "--  decorator" and each following chunk is preceded by "--" Example: -- | This is a docstring for foo$. It is the line with the decorator '|' and is always included -- This continues that docstring and is the second element in the NonEmpty list foo :: a -> aghc-lib-parser The docstring is preceded by "{- decorator" and followed by "-}" The chunk contains balanced pairs of '{-' and '-}'ghc-lib-parserA docstring generated either internally or via TH Pretty printed with the '-- |' decorator This is because it may contain unbalanced pairs of '{-' and '-}' and not form a valid ghc-lib-parserAnnotate a pretty printed thing with its doc The docstring comes after if is  Otherwise it comes before. Note - we convert MultiLineDocString HsDocStringPrevious to HsDocStringNext because we can't control if something else will be pretty printed on the same lineghc-lib-parser Create a  from a UTF8-encoded .ghc-lib-parser:Pretty print with decorators, exactly as the user wrote itghc-lib-parser:Pretty print with decorators, exactly as the user wrote itghc-lib-parser.Just get the docstring, without any decoratorsghc-lib-parserJust get the docstring, without any decorators Seperates docstrings using "nn", which is how haddock likes to render themqNoneghc-lib-parserRepresents the  as a bit set.+Assumes that all elements are non-negative.This is only efficient for values that are sufficiently small, for example in the lower hundreds.rNoneTghc-lib-parser-Enumerates the simple on-or-off dynamic flagsghc-lib-parser.Append dump output to files instead of stdout.ghc-lib-parserdeprecated, no effect and behaviour is now default. Allowed switching of a special demand transformer for dictionary selectorsghc-lib-parser)Use the cfg based block layout algorithm.ghc-lib-parser+Layout based on last instruction per block.ghc-lib-parser;Do W/W split for unlifting even if we won't unbox anything.ghc-lib-parser -fPICghc-lib-parser -fPIEghc-lib-parser -pieghc-lib-parserUse regular thunks even when we could use std ap thunks in order to get entry countsghc-lib-parser -fcompact-unwindghc-lib-parserSuppress timestamps in dumpsghc-lib-parser-Suppress per binding Core size stats in dumpsghc-lib-parserDebugging flagsghc-lib-parser#Dump the cfg used for block layout.ghc-lib-parserInitial STG (CoreToStg output)ghc-lib-parserSTG after unariseghc-lib-parserSTG (after stg2stg)ghc-lib-parser!Result of tag inference analysis.ghc-lib-parserFinal STG (before cmm gen)ghc-lib-parser!Return the names of a WarningFlagOne flag may have several names because of US/UK spelling. The first one is the "preferred one" that will be displayed in warning messages.ghc-lib-parserWarning groups.As all warnings are in the Weverything set, it is ignored when displaying to the user which group a warning is in.ghc-lib-parserWarning group hierarchies, where there is an explicit inclusion relation.Each inner list is a hierarchy of warning groups, ordered from smallest to largest, where each group is a superset of the one before it.Separating this from  allows for multiple hierarchies with no inherent relation to be defined.3The special-case Weverything group is not included.ghc-lib-parserFind the smallest group in every hierarchy which a warning belongs to, excluding Weverything.ghc-lib-parser+Warnings enabled unless specified otherwiseghc-lib-parserThings you get with -Wghc-lib-parserThings you get with -Wallghc-lib-parserThings you get with -Weverything, i.e. *all* known warnings flagsghc-lib-parserThings you get with -Wcompat.This is intended to group together warnings that will be enabled by default at some point in the future, so that library authors eager to make their code future compatible to fix issues before they even generate warnings.ghc-lib-parser"Things you get with -Wunused-binds}None3ۑghc-lib-parser A C type, used in CAPI FFI calls :   '{-# CTYPE' , , ,  '#-}',ghc-lib-parser,How to call a particular function in C-land.ghc-lib-parserMight invoke Haskell GC, or do a call back, or switch threads, etc. So make sure things are tidy before the call. Additionally, in the threaded RTS we arrange for the external call to be executed by a separate OS thread, i.e., _concurrently_ to the execution of other Haskell threads.ghc-lib-parserLike PlaySafe, but additionally the worker thread running this foreign call may be unceremoniously killed, so it must be scheduled on an unbound thread.ghc-lib-parserNone of the above can happen; the call will return without interacting with the runtime system at all. Specifically:No GC No call backs No blockingNo precise exceptions!!~None 3>?8 ghc-lib-parserSpecify whether to default kind variables, and type variables of kind  RuntimeRep  Multiplicity. ghc-lib-parserDefault kind variables:default kind variables of kind Type to Type,default  RuntimeRep  Multiplicity kind variables to  LiftedRep Many, respectively.When this strategy is used, it means that we have determined that the variables we are considering defaulting are all kind variables.;Usually, we pass this option when -XNoPolyKinds is enabled. ghc-lib-parser=Default (or don't default) non-standard variables, of kinds  RuntimeRep,   and  Multiplicity. ghc-lib-parser2Specify whether to default type variables of kind  RuntimeRep  Multiplicity. ghc-lib-parser*Default type variables of the given kinds:default  RuntimeRep variables to  LiftedRepdefault   variables to  default  Multiplicity variables to Many ghc-lib-parser/Try not to default type variables of the kinds  RuntimeRep  Multiplicity.Note that these might get defaulted anyway, if they are kind variables and `-XNoPolyKinds` is enabled. ghc-lib-parser/Are we dealing with an expression or a pattern?Used only for the textual output of certain error messages; see the  FRRDataConArg constructor of  FRROrigin. ghc-lib-parserFlag to see whether we're type-checking terms or kind-checking types ghc-lib-parser = $(f x y) ghc-lib-parser =* f x y, i.e. a naked top level expression ghc-lib-parserAn integer or infinity ghc-lib-parserInline Specification ghc-lib-parserRule Match Information ghc-lib-parser Phase Number ghc-lib-parserDefault Method Specification ghc-lib-parser Inside Lambda ghc-lib-parserOccurs inside a non-linear lambda Substituting a redex for this occurrence is dangerous because it might duplicate work. ghc-lib-parserInteresting Context ghc-lib-parserFunction: is applied Data value: scrutinised by a case with at least one non-DEFAULT branch ghc-lib-parser!identifier Occurrence Information ghc-lib-parser2There are many occurrences, or unknown occurrences ghc-lib-parserMarks unused variables. Sometimes useful for lambda and case-bound variables. ghc-lib-parser3Occurs exactly once (per branch), not inside a rule ghc-lib-parserThis identifier breaks a loop of mutually recursive functions. The field marks whether it is only a loop breaker due to a reference in a rule ghc-lib-parserEmbedding Projection pair ghc-lib-parser7Are we dealing with an unboxed tuple or an unboxed sum?!Used when validity checking, see check_ubx_tuple_or_sum. ghc-lib-parser2A general-purpose pretty-printing precedence type. ghc-lib-parser'This instance must not overlap another  - instance. However, it may be overlapped by   instances, and it may overlap   instances. ghc-lib-parserSilently ignore this instance if you find a more specific one that matches the constraint you are trying to resolveExample: constraint (Foo [Int]) instance Foo [Int] instance {- OVERLAPPABLE  -} Foo [a]Since the second instance has the Overlappable flag, the first instance will be chosen (otherwise its ambiguous which to choose) ghc-lib-parserSilently ignore any more general instances that may be used to solve the constraint..Example: constraint (Foo [Int]) instance {- OVERLAPPING 4-} Foo [Int] instance Foo [a]Since the first instance has the Overlapping flag, the second---more general---instance will be ignored (otherwise it is ambiguous which to choose) ghc-lib-parserEquivalent to having both   and   flags. ghc-lib-parserBehave like Overlappable and Overlapping, and in addition pick an arbitrary one if there are multiple matching candidates, and don't worry about later instantiationExample: constraint (Foo [b]) instance {-# INCOHERENT -} Foo [Int] instance Foo [a] Without the Incoherent flag, we'd complain that instantiating b would change which instance was chosen. See also Note [Incoherent instances] in GHC.Core.InstEnv ghc-lib-parserThe semantics allowed for overlapping instances for a particular instance. See Note [Safe Haskell isSafeOverlap] (in GHC.Core.InstEnv) for a explanation of the   field. :  '{-# OVERLAPPABLE'" or '{-# OVERLAPPING'" or '{-# OVERLAPS'" or '{-# INCOHERENT',  `#-}`, ghc-lib-parserRecursivity Flag ghc-lib-parser4Should an argument be passed evaluated *and* tagged.!ghc-lib-parserIs a TyCon a promoted data constructor or just a normal type constructor?!ghc-lib-parserIf the Id is a lambda-bound variable then it may have lambda-bound variable info. Sometimes we know whether the lambda binding this variable is a "one-shot" lambda; that is, whether it is applied at most once.This information may be useful in optimisation, as computations may safely be floated inside such a lambda without risk of duplicating work.+See also Note [OneShotInfo overview] above.!ghc-lib-parserNo information!ghc-lib-parser#The lambda is applied at most once.!ghc-lib-parserA power-of-two alignment!ghc-lib-parser A *zero-indexed* constructor tag!ghc-lib-parserA *one-index* constructor tagType of the tags associated with each constructor possibility or superclass selector!ghc-lib-parserFullArgCount is the number of type or value arguments in an application, or the number of type or value binders in a lambda. Note: it includes both type and value arguments!!ghc-lib-parserThe number of arguments that a join point takes. Unlike the arity of a function, this is a purely syntactic property and is fixed when the join point is created (or converted from a value). Both type and value arguments are counted.!ghc-lib-parserRepresentation ArityThe number of represented arguments that can be applied to a value before it does "real work". So: fib 100 has representation arity 0 x -> fib x has representation arity 1 ( x, y +) -> fib (x + y) has representation arity 2!ghc-lib-parserThe number of value arguments that can be applied to a value before it does "real work". So: fib 100 has arity 0 x -> fib x has arity 1 See also Note [Definition of arity] in GHC.Core.Opt.Arity!ghc-lib-parserTags are allocated from here for real constructors or for superclass selectors!ghc-lib-parser$It is always safe to assume that an Id) has no lambda-bound variable information!ghc-lib-parser=Pretty print an alternative in an unboxed sum e.g. "| a | |".!ghc-lib-parser0Outputs string for pragma name for any of INLINE INLINABLENOINLINE. This differs from the Outputable instance for the InlineSpec type where the pragma name string as well as the accompanying SourceText (if any) is printed.!ghc-lib-parserA representation of infinity!ghc-lib-parser Subtract an  from an  !ghc-lib-parserTurn a positive number into an  , where 0 represents infinity!ghc-lib-parserInject any integer into an  "ghc-lib-parserIf there is any  interesting identifier occurrence, then the aggregated occurrence info of that identifier is considered interesting."ghc-lib-parserIf any occurrence of an identifier is inside a lambda, then the occurrence info of that identifier marks it as occurring inside a lambda!ghc-lib-parser#The pretty printing function to useghc-lib-parserThe things to be pretty printedghc-lib-parserAlternative (one-based)ghc-lib-parserArityghc-lib-parser  where the alternative havs been pretty printed and finally packed into a paragraph. !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!! !!! !! !!!! ! ! !!!!!!! !!! !!!!!!!!!!! !!!!!!!!!!! ! !!! !!!!!! !!! !!!!!!!! !! ! !!!!!!!!!!!!!!!!!!!!!! !!! !!!!! !! !! !None "ghc-lib-parserTest if the given Integer is representable with a platform Int#ghc-lib-parser?Test if the given Integer is representable with a platform Word#ghc-lib-parserFor some architectures the C calling convention is that any integer shorter than 64 bits is replaced by its 64 bits representation using sign or zero extension.#ghc-lib-parserTry to locate "GhclibDerivedConstants.h" file in the given dirs and to parse the PlatformConstants from it.See Note [Platform constants]WVU """"""""""""""""""""""""""""""###########################""""""""""""##"""##WVU##############"""""""""""""""### ######Nonee #ghc-lib-parserSettings for what GHC this is.#ghc-lib-parserPaths to various files and directories used by GHC, including those that provide more settings.#ghc-lib-parser)Settings for other executables GHC calls.Probably should further split down by phase, or split between platform-specific and platform-agnostic.#ghc-lib-parserLLVM: opt llvm optimiser#ghc-lib-parserLLVM: llc static compiler#ghc-lib-parserLLVM: c compiler#ghc-lib-parser?cached Fingerprint of sOpt_P See Note [Repeated -optP hashing]#ghc-lib-parserLLVM: llvm optimiser#ghc-lib-parserLLVM: llc static compiler#ghc-lib-parserLLVM: c compiler#ghc-lib-parser iserv options#ghc-lib-parserDynamic library suffix""""""""""""""""""###########################################################################################$$$$$$$$$$$$$$$$$$$$$$$#############################################################""""""""""""##""""""############################$$$$$$$$$$$$$$$$$$$$$$$NoneP$ghc-lib-parserA way4Don't change the constructor order as it us used by $ to create a unique tag (e.g. thr_debug_p) which is expected by other tools (e.g. Cabal).$ghc-lib-parser,for GHC API clients building custom variants$ghc-lib-parser'(RTS only) Multithreaded runtime system$ghc-lib-parser1Debugging, enable trace messages and extra checks$ghc-lib-parser:Profiling, enable cost-centre stacks and profiling reports$ghc-lib-parser)(RTS only) enable event logging (tracing)$ghc-lib-parserDynamic linking$ghc-lib-parserTest if a way is enabled$ghc-lib-parserTest if a way is not enabled$ghc-lib-parser Add a way$ghc-lib-parser Remove a way$ghc-lib-parser)Check if a combination of ways is allowed$ghc-lib-parser'Unique tag associated to a list of ways$ghc-lib-parser-Unique build-tag associated to a list of waysRTS only ways are filtered out because they have no impact on the build.$ghc-lib-parser$Unique build-tag associated to a way$ghc-lib-parserReturn true for ways that only impact the RTS, not the generated code$ghc-lib-parser.Filter ways that have an impact on compilation$ghc-lib-parserFilter RTS-only ways (ways that don't have an impact on compilation)$ghc-lib-parser*Turn these flags on when enabling this way$ghc-lib-parser+Turn these flags off when enabling this way$ghc-lib-parser;Pass these options to the C compiler when enabling this way$ghc-lib-parser3Pass these options to linker when enabling this way$ghc-lib-parser=Pass these options to the preprocessor when enabling this way$ghc-lib-parserConsult the RTS to find whether it has been built with profiling enabled.$ghc-lib-parserConsult the RTS to find whether GHC itself has been built with dynamic linking. This can't be statically known at compile-time, because we build both the static and dynamic versions together with -dynamic-too.$ghc-lib-parser Host ways.$ghc-lib-parserHost "full" ways (i.e. ways that have an impact on the compilation, not RTS only ways).These ways must be used when compiling codes targeting the internal interpreter. $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$ $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$None #$>! $ghc-lib-parserInformation about an installed unit (units are identified by their internal UnitId)$ghc-lib-parserInformation about an installed unit (units are identified by their database UnitKey)$ghc-lib-parser#Information about an installed unitWe parameterize on the unit identifier: * UnitKey: identifier used in the database (cf $5) * UnitId: identifier used to generate code (cf $)These two identifiers are different for wired-in packages. See Note [About units] in GHC.Unit$ghc-lib-parser9Convert a DbUnitInfo (read from a package database) into $$ghc-lib-parserMap over the unit parameter$ghc-lib-parserMake a   from a $ If the unit is definite, make a  from   field."If the unit is indefinite, make a  from   and  8 fields. Note that in this case we don't keep track of  . It can be retrieved later with "improvement", i.e. matching on `unitInstanceOf/unitInstantiations` fields (see Note [About units] in GHC.Unit).$ghc-lib-parser$Create a UnitPprInfo from a UnitInfo$ghc-lib-parser3Find all the include directories in the given units$ghc-lib-parser2Find all the C-compiler options in the given units$ghc-lib-parserFind all the library directories in the given units for the given ways$ghc-lib-parser*Find all the frameworks in the given units$ghc-lib-parserFind all the package framework paths in these and the preload packages:\[ZY $$$$$$$$$$$$$$$$$$$$$: $$$$$$$$$$$$\[ZY$$$$$$$$$None$$ghc-lib-parserA platform profile fully describes the kind of objects that are generated for a platform." doesn't fully describe the ABI of an object. Compiler ways (profiling, debug, dynamic) also modify the ABI.$ghc-lib-parserPlatform$ghc-lib-parserWays$ghc-lib-parserGet platform constants$ghc-lib-parserIs profiling enabled$ghc-lib-parserWord size in bytes$ghc-lib-parser Unique build tag for the profile$$$$$$$$$$$$$$$$None-$ghc-lib-parser8An ArgDescr describes the argument pattern of a function$ghc-lib-parserWe represent liveness bitmaps as a Bitmap (whose internal representation really is a bitmap). These are pinned onto case return vectors to indicate the state of the stack for the garbage collector.In the compiled program, liveness bitmaps that fit inside a single word (StgWord) are stored as a single word, while larger bitmaps are stored as a pointer to an array of words.$ghc-lib-parserTrue <=> This is a static closure. Affects how we garbage-collect it. Static closure have an extra static link field at the end. Constructors do not have a static variant; see Note [static constructors]$ghc-lib-parserA description of the layout of a closure. Corresponds directly to the closure types in includes/rts/storage/ClosureTypes.h.$ghc-lib-parserWord offset, or word count$ghc-lib-parserByte offset, or byte count$ghc-lib-parserRound up the given byte count to the next byte count that's a multiple of the machine's word size.$ghc-lib-parser Round up base to a multiple of size.$ghc-lib-parser7Convert the given number of words to a number of bytes.This function morally has type WordOff -> ByteOff , but uses Num a to allow for overloading.$ghc-lib-parserFirst round the given byte count up to a multiple of the machine's word size and then convert the result to words.%ghc-lib-parserHalf word size in bytes%ghc-lib-parserSize of a closure header (StgHeader in includes/rts/storage/Closures.h)%ghc-lib-parserSize of the profiling part of a closure header (StgProfHeader in includes/rts/storage/Closures.h)%ghc-lib-parser(The total size of the closure, in words.%ghc-lib-parserThe byte offset into the card table of the card for a given element%ghc-lib-parser>Convert a number of elements to a number of cards, rounding up%ghc-lib-parser"The size of a card table, in bytes%ghc-lib-parser"The size of a card table, in words%ghc-lib-parser%Derives the RTS closure type from an $$$$$$$$$$$$$$$$$$$$$$$$$$$$$$$%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%$$$$$$$$%$%%%%$$$$$$$$$$$$$$$$$$$$$%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%None0*%ghc-lib-parser*Compute the output file name of a program.StaticLink boolean is used to indicate if the program is actually a static library (e.g., on iOS).Use the provided filename (if any), otherwise use "main.exe" (Windows), "a.out (otherwise without StaticLink set), "liba.a". In every case, add the extension if it is missing.%%None2%ghc-lib-parserUntyped Phase description%ghc-lib-parser -E%ghc-lib-parser -C%ghc-lib-parser -S%ghc-lib-parser -c%ghc-lib-parserWhen we are given files (modified by -x arguments) we need to determine if they are Haskellish or not to figure out how we should try to compile it. The rules are: If no -x flag was specified, we check to see if the file looks like a module name, has no extension, or has a Haskell source extension.If an -x flag was specified, we just make sure the specified suffix is a Haskell one.%ghc-lib-parserForeign language of the phase if the phase deals with a foreign code0%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%0%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%None= %ghc-lib-parserCode generation backends.GHC supports several code generation backends serving different purposes (producing machine code, producing ByteCode for the interpreter) and supporting different platforms.%ghc-lib-parserNative code generator backend.Compiles Cmm code into textual assembler, then relies on an external assembler toolchain to produce machine code.4Only supports a few platforms (X86, PowerPC, SPARC).See  GHC.CmmToAsm.%ghc-lib-parser LLVM backend.Compiles Cmm code into LLVM textual IR, then relies on LLVM toolchain to produce machine code.It relies on LLVM support for the calling convention used by the NCG backend to produce code objects ABI compatible with it (see "cc 10" or "ghccc" calling convention in  7https://llvm.org/docs/LangRef.html#calling-conventions).3Support a few platforms (X86, AArch64, s390x, ARM).See  GHC.CmmToLlvm%ghc-lib-parserVia-C backend.Compiles Cmm code into C code, then relies on a C compiler to produce machine code.It produces code objects that are *not* ABI compatible with those produced by NCG and LLVM backends.Produced code is expected to be less efficient than the one produced by NCG and LLVM backends because STG registers are not pinned into real registers. On the other hand, it supports more target platforms (those having a valid C toolchain).See  GHC.CmmToC%ghc-lib-parserByteCode interpreter.#Produce ByteCode objects (BCO, see  GHC.ByteCode/) that can be interpreted. It is used by GHCi.?Currently some extensions are not supported (foreign primops).See GHC.StgToByteCode%ghc-lib-parserNo code generated.Use this to disable code generation. It is particularly useful when GHC is used as a library for other purpose than generating code (e.g. to generate documentation with Haddock) or when the user requested it (via -fno-code) for some reason.%ghc-lib-parser.Default backend to use for the given platform.%ghc-lib-parser7Is the platform supported by the Native Code Generator?%ghc-lib-parser5Will this backend produce an object file on the disk?%ghc-lib-parserDoes this backend retain *all* top-level bindings for a module, rather than just the exported bindings, in the TypeEnv and compiled code (if any)?Interpreter backend does this, so that GHCi can call functions inside a module.When no backend is used we also do it, so that Haddock can get access to the GlobalRdrEnv for a module after typechecking it. %%%%%%%%%% %%%%%%%%%%NoneCh %ghc-lib-parseris -falignment-sanitisation enabled?&ghc-lib-parser.The width of the current platform's word size.&ghc-lib-parser3The width of the current platform's half-word size.&ghc-lib-parser7A bit-mask for the lower half-word of current platform.&ghc-lib-parserA width in bits.&ghc-lib-parserA width in bytes. %widthFromBytes (widthInBytes w) === w&ghc-lib-parser*Partial* A width from the number of bytes.&ghc-lib-parser:log_2 of the width in bytes, useful for generating shifts.&ghc-lib-parserNarrow a signed or unsigned value to the given width. The result will reside in  [0, +2^width). narrowU W8 256 == 256narrowU W8 255 == 255narrowU W8 128 == 128narrowU W8 127 == 127narrowU W8 0 == 0narrowU W8 (-127) == 129narrowU W8 (-128) == 128narrowU W8 (-129) == 127narrowU W8 (-255) == 1narrowU W8 (-256) == 0&ghc-lib-parserNarrow a signed value to the given width. The result will reside in [-2^(width-1), +2^(width-1)). narrowS W8 256 == 0narrowS W8 255 == -1narrowS W8 128 == -128narrowS W8 127 == 127narrowS W8 0 == 0narrowS W8 (-127) == -127narrowS W8 (-128) == -128narrowS W8 (-129) == 127narrowS W8 (-255) == 1narrowS W8 (-256) == 0%%%%%%%%&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&%%&&&&&&&&&&&&&&&&&&&&%%%%%&&&&&&&&&&&&&&&%NoneL &ghc-lib-parser$The operation to perform atomically.'ghc-lib-parser'Atomic compare-and-swap. Arguments are [dest, expected, new]. Sequentially consistent. Possible future refactoring: should this be an' variant?'ghc-lib-parserAtomic swap. Arguments are  [dest, new]'ghc-lib-parserMachine-level primops; ones which we can reasonably delegate to the native code generators to handle.)Most operations are parameterised by the % that they operate on. Some operations have separate signed and unsigned versions, and float and integer versions.Note that there are variety of places in the native code generator where we assume that the code produced for a MachOp does not introduce new blocks.(ghc-lib-parserReturns J if the MachOp has commutable arguments. This is used in the platform-independent Cmm optimisations.If in doubt, return G. This generates worse code on the native routes, but is otherwise harmless.(ghc-lib-parserReturns J$ if the MachOp is associative (i.e. (x+y)+z == x+(y+z)=) This is used in the platform-independent Cmm optimisations.If in doubt, return G. This generates worse code on the native routes, but is otherwise harmless.(ghc-lib-parserReturns J if the MachOp is a comparison.If in doubt, return False. This generates worse code on the native routes, but is otherwise harmless.(ghc-lib-parserReturns Just w6 if the operation is an integer comparison with width w, or Nothing otherwise.(ghc-lib-parser.Returns the MachRep of the result of a MachOp.(ghc-lib-parserThis function is used for debugging only: we can check whether an application of a MachOp is "type-correct" by checking that the MachReps of its arguments are the same as the MachOp expects. This is used when linting a CmmExpr.(ghc-lib-parser!Return (results_hints,args_hints)(ghc-lib-parserThe alignment of a memcpy-ish operation.&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''((((((((((((((((((((((((((((((((((((((((''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''((((((((''''''''''''(((((((((((((((((((((((((((((&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&''''''''''''''''''''''''''''''''''''''''''''''''''''(((&&&&&&&None<=S(ghc-lib-parserForeign export stubs(ghc-lib-parserWe don't have any stubs(ghc-lib-parser!There are some stubs. Parameters:?1) Header file prototypes for "foreign exported" functions2) C stubs to use when calling "foreign exported" functions(ghc-lib-parserInitializers to be run at startup See Note [Initializers and finalizers in Cmm] in GHC.Cmm.InitFini.(ghc-lib-parser Finalizers to be run at shutdown(ghc-lib-parser!initializerCStub fn_nm decls body is a (: containing C initializer function (e.g. an entry of the  .init_array section) named fn_nm7 with the given body and the given set of declarations.(ghc-lib-parserfinalizerCStub fn_nm decls body is a (8 containing C finalizer function (e.g. an entry of the  .fini_array section) named fn_nm7 with the given body and the given set of declarations.((((((((((((((((((((((((((((None b(ghc-lib-parserA StringBuffer is an internal pointer to a sized chunk of bytes. The bytes are intended to be *immutable*. There are pure operations to read the contents of a StringBuffer.A StringBuffer may have a finalizer, depending on how it was obtained.(ghc-lib-parserRead a file into a (. The resulting buffer is automatically managed by the garbage collector.(ghc-lib-parser Encode a  into a ( as UTF-8. The resulting buffer is automatically managed by the garbage collector.(ghc-lib-parserConvert a UTF-8 encoded  into a 'StringBuffer. This really relies on the internals of both  and (.O(n) (but optimized into a memcpy by  bytestring under the hood)(ghc-lib-parser/Return the first UTF-8 character of a nonempty (2 and as well the remaining portion (analogous to ). Warning:# The behavior is undefined if the ( is empty. The result shares the same buffer as the original. Similar to  0, if the character cannot be decoded as UTF-8, '\0' is returned.(ghc-lib-parserReturns true if the buffer contains Unicode bi-directional formatting characters. https://www.unicode.org/reports/tr9/#Bidirectional_Character_TypesBidirectional format characters are one of 'x202a' : "U+202A LEFT-TO-RIGHT EMBEDDING (LRE)" 'x202b' : "U+202B RIGHT-TO-LEFT EMBEDDING (RLE)" 'x202c' : "U+202C POP DIRECTIONAL FORMATTING (PDF)" 'x202d' : "U+202D LEFT-TO-RIGHT OVERRIDE (LRO)" 'x202e' : "U+202E RIGHT-TO-LEFT OVERRIDE (RLO)" 'x2066' : "U+2066 LEFT-TO-RIGHT ISOLATE (LRI)" 'x2067' : "U+2067 RIGHT-TO-LEFT ISOLATE (RLI)" 'x2068' : "U+2068 FIRST STRONG ISOLATE (FSI)" 'x2069' : "U+2069 POP DIRECTIONAL ISOLATE (PDI)"This list is encoded in ((ghc-lib-parser/Return the first UTF-8 character of a nonempty ( (analogous to ). Warning:# The behavior is undefined if the ( is empty. Similar to  0, if the character cannot be decoded as UTF-8, '\0' is returned.(ghc-lib-parser Return a (7 with the first UTF-8 character removed (analogous to ). Warning:# The behavior is undefined if the (? is empty. The result shares the same buffer as the original.(ghc-lib-parser Return a ( with the first n bytes removed. Warning:2 If there aren't enough characters, the returned ( will be invalid and any use of it may lead to undefined behavior. The result shares the same buffer as the original.(ghc-lib-parser-Compute the difference in offset between two ( s that share the same buffer. Warning:# The behavior is undefined if the (s use separate buffers.(ghc-lib-parserCheck whether a ( is empty (analogous to ).(ghc-lib-parser%Computes a hash of the contents of a (.(ghc-lib-parser Computes a ( which points to the first character of the wanted line. Lines begin at 1.(ghc-lib-parserDecode the first n bytes of a ( as UTF-8 into a . Similar to  , if the character cannot be decoded as UTF-8, they will be replaced with '\0'.(ghc-lib-parserReturn the previous n* characters (or fewer if we are less than n characters into the buffer.(ghc-lib-parsern, the number of bytes(ghc-lib-parsern, the number of bytes(ghc-lib-parsern, the number of bytes((((((((((((((((((((((((((((((((((((((((((((((((((((Nonec(ghc-lib-parserA non-deterministic set of FastStrings. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM for explanation why it's not deterministic and why it matters. Use DFastStringEnv if the set eventually gets converted into a list or folded over in a way where the order changes the generated code.((((((((((((((((((((((((((((((((((((((((((((((((None 3?k(ghc-lib-parserFlag to indicate whether the FieldSelectors extension is enabled.(ghc-lib-parser.Selector functions are available (the default)(ghc-lib-parser$Selector functions are not available(ghc-lib-parserFlag to indicate whether the DuplicateRecordFields extension is enabled.(ghc-lib-parser+Fields may be duplicated in a single module(ghc-lib-parser3Fields must be unique within a module (the default)(ghc-lib-parser:Fields in an algebraic record type; see Note [FieldLabel].(ghc-lib-parserUser-visible label of the field(ghc-lib-parserWas DuplicateRecordFields- on in the defining module for this datatype?(ghc-lib-parserWas FieldSelectors enabled in the defining module for this datatype? See Note [NoFieldSelectors] in GHC.Rename.Env)ghc-lib-parserRecord selector function)ghc-lib-parser2A map from labels to all the auxiliary information)ghc-lib-parserField labels are just represented as strings; they are not necessarily unique (even within a module))ghc-lib-parserRecord selector OccNames are built from the underlying field name and the name of the first data constructor of the type, to support duplicate record field names. See Note [Why selector names include data constructors].)ghc-lib-parserUndo the name mangling described in Note [FieldLabel] to produce a Name that has the user-visible OccName (but the selector's unique). This should be used only when generating output, when we want to show the label, but may need to qualify it with a module prefix.)ghc-lib-parser We need the  Binary Name> constraint here even though there is an instance defined in GHC.Types.Name, because the we have a SOURCE import, so the instance is not in scope. And the instance cannot be added to Name.hs-boot because GHC.Utils.Binary itself depends on GHC.Types.Name.((((((((((())))))))((((()))(((((()None3m)ghc-lib-parser9An index into a given cost centre module,name,flavour set)ghc-lib-parser2Per-module state for tracking cost centre indices.See documentation of  for more details.)ghc-lib-parserInitialize cost centre state.)ghc-lib-parser-Get a new index for a given cost centre name.))))))))))Nonen'*ghc-lib-parserGet the  associated with a known-key .************************************************************INone  3w ghc-lib-parserOther names in the compiler add additional information to an OccName. This class provides a consistent way to access the underlying OccName. ghc-lib-parserOccurrence NameIn this context that means: "classified (i.e. as a type name, value name, etc) but not qualified and not yet resolved"*ghc-lib-parserAlters (replaces or removes) those elements of the map that are mentioned in the second map*ghc-lib-parserlghc-lib-parser*A class allowing convenient access to the  of various datatypesghc-lib-parserA unique, unambiguous name for something, containing information about where that thing originated.+ghc-lib-parser!BuiltInSyntax is for things like (:), [] and tuples, which have special syntactic forms. They aren't in scope as such.+ghc-lib-parser Will the ( come from a dynamically linked package?+ghc-lib-parserReturns True if the name is (a) Internal (b) External but from the specified module (c) External but from the  interactive packageThe key idea is that False means: the entity is defined in some other module you can find the details (type, fixity, instances) in some interface file those details will be stored in the EPT or HPTTrue means: the entity is defined in this module or earlier in the GHCi session you can find details (type, fixity, instances) in the TcGblEnv or TcLclEnvThe isInteractiveModule part is because successive interactions of a GHCi session each give rise to a fresh module (Ghci1, Ghci2, etc), but they all come from the magic  interactive package; and all the details are kept in the TcLclEnv, TcGblEnv, NOT in the HPT or EPT. See Note [The interactive package] in GHC.Runtime.Context+ghc-lib-parser1Returns True if the name is external or from the  interactive package See documentation of + function+ghc-lib-parserReturns True if the Name comes from some other package: neither this package nor the interactive package.+ghc-lib-parserCreate a name which is (for now at least) local to the current module and hence does not need a   to disambiguate it from other s+ghc-lib-parser=Create a name which definitely originates in the given module+ghc-lib-parser>Create a name which is actually defined by the compiler itself+ghc-lib-parser0Create a name brought into being by the compiler+ghc-lib-parserMake a name for a foreign call+ghc-lib-parser Make the ? into an internal name, regardless of what it was to begin with+ghc-lib-parserCompare Names lexicographically This only works for Names that originate in the source code or have been tidied.+ghc-lib-parser?.ghc-lib-parser*Type variable that might be a metavariableghc-lib-parserType or Coercion Variableghc-lib-parser Identifierghc-lib-parserType or kind Variableghc-lib-parser Whether an +' argument may appear in source Haskell.ghc-lib-parserVariableEssentially a typed ?, that may also contain some additional information about the  and its use sites.ghc-lib-parserThe non-dependent version of . See Note [AnonArgFlag] Appears here partly so that it's together with its friends ArgFlag and ForallVisFlag, but also because it is used in IfaceType, rather early in the compilation chainghc-lib-parser Argument Flag3Is something required to appear in source Haskell (+), permitted by request (,) (visible type application), or prohibited entirely from appearing in source Haskell (,)? See Note [VarBndrs, TyCoVarBinders, TyConBinders, and visibility] in GHC.Core.TyCo.Rep+ghc-lib-parserVariable BinderA + is the binder of a ForAllTy It's convenient to define this synonym here rather its natural home in GHC.Core.TyCo.Rep/, because it's used in GHC.Core.DataCon.hs-bootA + is a binder with only TyVar+ghc-lib-parser Used for (->): an ordinary non-dependent arrow. The argument is visible in source code.+ghc-lib-parser Used for (=>): a non-dependent predicate arrow. The argument is invisible in source code.+ghc-lib-parserthe argument may not appear in source Haskell, it is only inferred.+ghc-lib-parser?the argument may appear in source Haskell, but isn't required.+ghc-lib-parserThe type or kind of the  in question+ghc-lib-parserEquality Variable+ghc-lib-parserImplicit parameter Identifier+ghc-lib-parserDictionary Identifier+ghc-lib-parserDictionary Function Identifier+ghc-lib-parserEvidence Variable,ghc-lib-parserEvidence Identifier,ghc-lib-parser Kind Variable,ghc-lib-parser Type Variable,ghc-lib-parserType or Kind Variable,ghc-lib-parser,ghc-lib-parserCoercion Variable,ghc-lib-parserCompare Vars by their Uniques. This is what Ord Var does, provided here to make it explicit at the call-site that it can introduce non-determinism. See Note [Unique Determinism],ghc-lib-parser Update a s type. Does not update the  multiplicity stored in an , if any. Because of the possibility for abuse, ASSERTs that there is no multiplicity to update.,ghc-lib-parser Update a (s type monadically. Does not update the  multiplicity stored in an , if any. Because of the possibility for abuse, ASSERTs that there is no multiplicity to update.,ghc-lib-parser Does this 1 classify an argument that is written in Haskell?,ghc-lib-parser Does this 5 classify an argument that is not written in Haskell?,ghc-lib-parser.Do these denote the same level of visibility? + arguments are visible, others are not. So this function equates , and ,. Used for printing.,ghc-lib-parserMake a named binder,ghc-lib-parserMake a named binder var should be a type variable,ghc-lib-parserMake many named binders,ghc-lib-parser , v == not (, v).,ghc-lib-parserIs this a term variable ( ) that is not! a coercion variable? Satisfies , v ==> , v == not (, v).,ghc-lib-parser, returns True% for type variables as well as local s These are the variables that we need to pay attention to when finding free variables, or doing dependency analysis.,ghc-lib-parser, returns True of s and s that must have a binding in this module. The converse is not quite right: there are some global s that must have bindings, such as record selectors. But that doesn't matter, because it's only used for assertions,ghc-lib-parserisExportedIdVar means "don't throw this away"++++++++++,,+++++++++++++++++,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,++++,++,,,+++++++++,++,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,++,,,,++++,,,,++++,,,,,,,,,,,,,,,,,,,,,,,,,,,,None,ghc-lib-parser+Deterministic Type or Coercion Variable Set,ghc-lib-parserDeterministic Type Variable Set,ghc-lib-parserDeterministic Identifier Set,ghc-lib-parserDeterministic Variable Set,ghc-lib-parserType or Coercion Variable Set,ghc-lib-parserCoercion Variable Set,ghc-lib-parserType Variable Set,ghc-lib-parserIdentifier Set,ghc-lib-parser A non-deterministic Variable SetA non-deterministic set of variables. See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM for explanation why it's not deterministic and why it matters. Use DVarSet if the set eventually gets converted into a list or folded over in a way where the order changes the generated code, for example when abstracting variables.-ghc-lib-parser5map the function over the list, and union the results-ghc-lib-parserDetermines the pluralisation suffix appropriate for the length of a set in the same way that plural from Outputable does for lists.-ghc-lib-parserPretty-print a non-deterministic set. The order of variables is non-deterministic and for pretty-printing that shouldn't be a problem. Having this function helps contain the non-determinism created with nonDetEltsUFM. Passing a list to the pretty-printing function allows the caller to decide on the order of Vars (eg. toposort them) without them having to use nonDetEltsUFM at the call site. This prevents from let-binding non-deterministically ordered lists and reusing them where determinism matters.-ghc-lib-parser5Map the function over the list, and union the results-ghc-lib-parserTrue if empty intersection-ghc-lib-parserTrue if non-empty intersection-ghc-lib-parser2Partition DVarSet according to the predicate given-ghc-lib-parser'Delete a list of variables from DVarSet-ghc-lib-parser"Add a list of variables to DVarSet-ghc-lib-parserConvert a DVarSet to a VarSet by forgetting the order of insertion-ghc-lib-parsertransCloVarSet for DVarSet-ghc-lib-parserThe things to be pretty printedghc-lib-parser4The pretty printing function to use on the elementsghc-lib-parser + where the things have been pretty printed,,,,,,,,,,,,,,,,,,,,,,,,,,,,,--------------------------------------------,,,,,,,,,,,-,,-,--,,,,,,-----,,,,-,----,,,,------------------------------Nonel -ghc-lib-parser.Predicate on possible free variables: returns True! iff the variable is interesting-ghc-lib-parserRun a free variable computation, returning a list of distinct free variables in deterministic order.-ghc-lib-parserRun a free variable computation, returning a deterministic set of free variables. Note that this is just a wrapper around the version that returns a deterministic list. If you need a list you should use -.-ghc-lib-parserRun a free variable computation, returning a non-deterministic set of free variables. Don't use if the set will be later converted to a list and the order of that list will impact the generated code.-ghc-lib-parserAdd a variable - when free, to the returned free variables. Ignores duplicates and respects the filtering function.-ghc-lib-parserReturn no free variables.-ghc-lib-parser%Union two free variable computations.-ghc-lib-parser5Mark the variable as not free by putting it in scope.-ghc-lib-parser%Mark many free variables as not free.-ghc-lib-parser#Filter a free variable computation.-ghc-lib-parserMap a free variable computation over a list and union the results.-ghc-lib-parser&Union many free variable computations.-ghc-lib-parserAdd multiple variables - when free, to the returned free variables. Ignores duplicates and respects the filtering function.----------------------------None, -ghc-lib-parser'Deterministic Type Variable Environment-ghc-lib-parserDeterministic Identifier Environment Sadly not always indexed by Id, but it is in the common case.-ghc-lib-parser"Deterministic Variable Environment-ghc-lib-parserCoercion Variable Environment-ghc-lib-parser%Type or Coercion Variable Environment-ghc-lib-parserType Variable Environment-ghc-lib-parserIdentifier Environment-ghc-lib-parserVariable Environment-ghc-lib-parserTidy EnvironmentWhen tidying up print names, we keep a mapping of in-scope occ-names (the *+) and a Var-to-Var of the current renamings-ghc-lib-parserRename Environment 2When we are comparing (or matching) types or terms, we are faced with "going under" corresponding binders. E.g. when comparing: \x. e1 ~ \y. e2Basically we want to rename [x -> y] or [y -> x], but there are lots of things we must be careful of. In particular, x might be free in e2 , or y in e1. So the idea is that we come up with a fresh binder that is free in neither, and rename x and y, respectively. That means we must maintain: 'A renaming for the left-hand expression)A renaming for the right-hand expressionsAn in-scope setFurthermore, when matching, we want to be able to have an 'occurs check', to prevent: \x. f ~ \y. ymatching with [f -> y]. So for each expression we want to know that set of locally-bound variables. That is precisely the domain of the mappings 1. and 2., but we must ensure that we always extend the mappings as we go in.-All of this information is bundled up in the --ghc-lib-parser3A set of variables that are in scope at some point.Note that this is a superset of the variables that are currently in scope. See Note [The InScopeSet invariant]."Secrets of the Glasgow Haskell Compiler inliner" Section 3.2 provides the motivation for this abstraction.-ghc-lib-parserLook up a variable the -. This lets you map from the variable's identity (unique) to its full value.-ghc-lib-parseruniqAway in_scope v finds a unique that is not used in the in-scope set, and gives that to v. See Note [Local uniques] and Note [The InScopeSet invariant].-ghc-lib-parserunsafeGetFreshUnique in_scope3 finds a unique that is not in-scope in the given -. This must be used very carefully since one can very easily introduce non-unique %s this way. See Note [Local uniques].-ghc-lib-parserRetrieve the left mapping-ghc-lib-parserRetrieve the right mapping-ghc-lib-parserApplies - to several variables: the two variable lists must be of equal length-ghc-lib-parserrnBndr2 env bL bR goes under a binder bL5 in the Left term, and binder bR, in the Right term. It finds a new binder, new_b&, and returns an environment mapping  bL -> new_b and  bR -> new_b-ghc-lib-parser Similar to -= but returns the new variable as well as the new environment-ghc-lib-parser Similar to -7 but used when there's a binder on the left side only.-ghc-lib-parser Similar to -8 but used when there's a binder on the right side only.-ghc-lib-parser Similar to -5 but used for eta expansion See Note [Eta expansion]-ghc-lib-parser Similar to -5 but used for eta expansion See Note [Eta expansion]-ghc-lib-parser?Look up the renaming of an occurrence in the left or right term-ghc-lib-parser?Look up the renaming of an occurrence in the left or right term-ghc-lib-parser?Look up the renaming of an occurrence in the left or right term-ghc-lib-parser?Look up the renaming of an occurrence in the left or right term-ghc-lib-parser)Tells whether a variable is locally bound-ghc-lib-parser)Tells whether a variable is locally bound-ghc-lib-parser$Wipe the left or right side renaming-ghc-lib-parser$Wipe the left or right side renaming-ghc-lib-parser"swap the meaning of left and right----------------------------------------------------------------------........................................-----....----------.----.........-...---.......................-----------------------------------------------None'(-/>................None .ghc-lib-parserIds which have no CAF references. This is a result of analysis of C--. It is always safe to use an empty .. TODO Refer to Note..ghc-lib-parser A number of .s in dependency order: earlier . scope over later . In a single (def, use) pair, the defs also scope over the uses.ghc-lib-parser(Just ds, us) => The use of any member of the ds, implies that all the us+ are used too. Also, us may mention ds. Nothing => Nothing is defined in this group, but nevertheless all the uses are essential. Used for instance declarations, for example.ghc-lib-parser&A set of names that are used somewhere.ghc-lib-parser)A set of names that are defined somewhere.ghc-lib-parser,True if there is a non-empty intersection. s1 . s2 doesn't compute s2 if s1 is empty.ghc-lib-parserGet the elements of a NameSet with some stable ordering. This only works for Names that originate in the source code or have been tidied. See Note [Deterministic UniqFM] to learn about nondeterminism.ghc-lib-parser Just like ., but . are not eliminated from the . returned.ghc-lib-parser Collect all .>, regardless of whether the group is itself used, but remove . on the way.ghc-lib-parser Given some . and some ., find all the uses, transitively. The result is a superset of the input .,; and includes things defined in the input . (but only if they are used)-.............................................-.............................................Nonei.ghc-lib-parserDeterministic Name Environment#See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM' for explanation why we need DNameEnv..ghc-lib-parserName Environment+.........................//////////////////+............./....../....//.//////////////.Noneg/ghc-lib-parserFixity information for an . We keep the OccName in the range so that we can generate an interface from it/ghc-lib-parser2Fixity environment mapping names to their fixities/ghc-lib-parserCreates cached lookup for the  mi_fix_fn field of ModIface//////////////None3 /ghc-lib-parserA Cost Centre Stack is something that can be attached to a closure. This is either:$the current cost centre stack (CCCS)a pre-defined cost centre stack (there are several pre-defined CCSs, see below)./ghc-lib-parserThe flavour of a cost centre.Index fields represent 0-based indices giving source-code ordering of centres with the same module, name, and flavour./ghc-lib-parserAuto-generated top-level thunk/ghc-lib-parserExplicitly annotated expression/ghc-lib-parser Explicitly annotated declaration/ghc-lib-parserGenerated by HPC for coverage/ghc-lib-parserA Cost Centre is a single {- SCC -} annotation./ghc-lib-parserTwo cost centres may have the same name and module but different SrcSpans, so we need a way to distinguish them easily and give them different object-code labels. So every CostCentre has an associated flavour that indicates how it was generated, and flavours that allow multiple instances of the same name and module have a deterministic 0-based index./ghc-lib-parserName of the cost centre itself/ghc-lib-parser Name of module defining this CC./ghc-lib-parser.Is this a cost-centre which records scc counts/ghc-lib-parser)Is this a cost-centre which can be sccd ?/ghc-lib-parserPrint a flavour in Core#///////////////////////////////////#///////////////////////////////////None3/ghc-lib-parserUsed where we may have an ordinary name or a record field label. See Note [GreNames] in GHC.Types.Name.Reader./ghc-lib-parserA collection of /& - several things that are "available"/ghc-lib-parser2Records what things are "available", i.e. in scope/ghc-lib-parserAn ordinary identifier in scope, or a field label without a parent type (see Note [Representing pattern synonym fields in AvailInfo])./ghc-lib-parserA type or class in scopeThe AvailTC Invariant=: If the type or class is itself to be in scope, it must be first in this list. Thus, typically: AvailTC Eq [Eq, ==, \/=]/ghc-lib-parserCompare lexicographically/ghc-lib-parser Does this / export the parent decl? This depends on the invariant that the parent is first if it appears at all./ghc-lib-parserJust the main name made available, i.e. not the available pieces of type or class brought into scope by the //ghc-lib-parserAll names made available by the availability information (excluding overloaded selectors)/ghc-lib-parserAll names made available by the availability information (including overloaded selectors)/ghc-lib-parserNames for non-fields made available by the availability information/ghc-lib-parser5Fields made available by the availability information/ghc-lib-parserNames and fields made available by the availability information./ghc-lib-parserNames and fields made available by the availability information, other than the main decl itself./ghc-lib-parserA  for internal use, but not for output to the user. For fields, the  will be the selector. See Note [GreNames] in GHC.Types.Name.Reader./ghc-lib-parserA 3 suitable for output to the user. For fields, the  will be the field label. See Note [GreNames] in GHC.Types.Name.Reader./ghc-lib-parser trims an / to keep only a single name/ghc-lib-parserfilters /s by the given predicate/ghc-lib-parser filters an / by the given predicate/ghc-lib-parser Combines /s from the same family avails may have several items with the same availName E.g import Ix( Ix(..), index ) will give Ix(Ix,index,range) and Ix(index) We want to combine these; addAvail does that/ghc-lib-parser/Used when deciding if the interface has changed/ghc-lib-parserThe name of the type or classghc-lib-parserThe available pieces of type or class (see Note [Representing fields in AvailInfo])."//////////////////////////////////"//////////////////////////////////None3w0/ghc-lib-parserImport Item Specification'Describes import info a particular Name/ghc-lib-parser4The import had no import list, or had a hiding list/ghc-lib-parser$The import had an import list. The / field is True iff the thing was named  explicitly in the import specs rather than being imported as part of a "..." group. Consider: import C( T(..) )Here the constructors of T! are not named explicitly; only T is named explicitly./ghc-lib-parser Import Declaration SpecificationDescribes a particular import declaration and is shared among all the  Provenances for that decl/ghc-lib-parserModule imported, e.g.  import Muggle Note the Muggle5 may well not be the defining module for this thing!/ghc-lib-parserImport alias, e.g. from as M (or Muggle if there is no as clause)/ghc-lib-parserWas this import qualified?/ghc-lib-parser-The location of the entire import declaration/ghc-lib-parserImport SpecificationThe / of something says how it came to be imported It's quite elaborate so that we can give accurate unused-name warnings.0ghc-lib-parserSee Note [Parents]0ghc-lib-parserGlobal Reader ElementAn element of the 00ghc-lib-parserSee Note [GreNames]0ghc-lib-parserSee Note [Parents]0ghc-lib-parserTrue  = the thing was defined locally0ghc-lib-parserIn scope through these imports0ghc-lib-parserGlobal Reader Environment Keyed by 3; when looking up a qualified name we look up the  part, and then check the  Provenance to see if the appropriate qualification is valid. This saves routinely doubling the size of the env by adding both qualified and unqualified names to the domain.The list in the codomain is required because there may be name clashes These only get reported on lookup, not on constructionINVARIANT 1: All the members of the list have distinct 0$ fields; that is, no duplicate NamesINVARIANT 2: Imported provenance => Name is an ExternalName However LocalDefs can have an InternalName. This happens only when type-checking a [d| ... |] Template Haskell quotation; see this note in GHC.Rename.Names Note [Top-level Names in Template Haskell decl quotes]INVARIANT 3: If the GlobalRdrEnv maps [occ -> gre], then greOccName gre = occNB: greOccName gre is usually the same as nameOccName (greMangledName gre), but not always in the case of record selectors; see Note [GreNames]0ghc-lib-parser0Local Reader Environment See Note [LocalRdrEnv]0ghc-lib-parser Reader NameDo not use the data constructors of RdrName directly: prefer the family of functions that creates them, such as 0Note: A Located RdrName will only have API Annotations if it is a compound one, e.g.  `bar` ( ~ ) :  ,  '(' or '[' or '[:' ,  ')' or ']' or ':]',,  '`' ,  ,0ghc-lib-parserUnqualified name1Used for ordinary, unqualified occurrences, e.g. x, y or Foo. Create such a 0 with 00ghc-lib-parserQualified name)A qualified name written by the user in source code. The module isn't necessarily the module where the thing is defined; just the one from which it is imported. Examples are Bar.x, Bar.y or Bar.Foo. Create such a 0 with 00ghc-lib-parser Original name$An original name; the module is the defining module. This is used when GHC generates code that will be fed into the renamer (e.g. from deriving clauses), but where we want to say "Use Prelude.map dammit". One of these can be created with 00ghc-lib-parser Exact nameWe know exactly the . This is used: ,When the parser parses built-in syntax like [] and (,), but wants a 0 from it8By Template Haskell, when TH has generated a unique nameSuch a 0 can be created by using 0 on a 0ghc-lib-parserMake a qualified 0& in the given namespace and where the   and the  are taken from the first and second elements of the tuple respectively0ghc-lib-parsermake a 0 where all the elements point to the same Provenance (useful for "hiding" imports, or imports with no details).0ghc-lib-parserSee Note [GreNames]0ghc-lib-parserA - for the GRE for internal use. Careful: the  of this $ is not necessarily the same as the 0 (see Note [GreNames]).0ghc-lib-parserA 3 for the GRE suitable for output to the user. Its  will be the 0 (see Note [GreNames]).0ghc-lib-parser.The SrcSpan of the name pointed to by the GRE.0ghc-lib-parser>The module in which the name pointed to by the GRE is defined.0ghc-lib-parserTakes a list of distinct GREs and folds them into AvailInfos. This is more efficient than mapping each individual GRE to an AvailInfo and the folding using /& but needs the uniqueness assumption.0ghc-lib-parserLook for this 0 in the global environment. Omits record fields without selector functions (see Note [NoFieldSelectors] in GHC.Rename.Env).0ghc-lib-parserLook for this 0 in the global environment. Includes record fields without selector functions (see Note [NoFieldSelectors] in GHC.Rename.Env).0ghc-lib-parserLook for precisely this  in the environment. This tests whether it is in scope, ignoring anything else that might be in scope with the same .0ghc-lib-parserLook for precisely this / in the environment. This tests whether it is in scope, ignoring anything else that might be in scope with the same .0ghc-lib-parserLook for a particular record field selector in the environment, where the selector name and field label may be different: the GlobalRdrEnv is keyed on the label. See Note [GreNames] for why this happens.0ghc-lib-parserLook for precisely this ! in the environment, but with an % that might differ from that of the . See 0 and Note [GreNames].0ghc-lib-parserIs this a record field defined with DuplicateRecordFields? (See Note [GreNames])0ghc-lib-parserIs this a record field defined with NoFieldSelectors? (See Note [NoFieldSelectors] in GHC.Rename.Env)0ghc-lib-parserIs this a record field defined with FieldSelectors? (See Note [NoFieldSelectors] in GHC.Rename.Env)0ghc-lib-parser2Returns the field label of this GRE, if it has one0ghc-lib-parser>Test if an unqualified version of this thing would be in scope0ghc-lib-parser2Takes a list of GREs which have the right OccName x: Pick those GREs that are in scope * Qualified, as 4 if want_qual is Qual M _ * Unqualified, as x if want_unqual is Unqual _Return each such GRE, with its ImportSpecs filtered, to reflect how it is in scope qualified or unqualified respectively. See Note [GRE filtering]0ghc-lib-parserPick GREs that are in scope *both* qualified *and* unqualified Return each GRE that is, as a pair (qual_gre, unqual_gre) These two GREs are the original GRE with imports filtered to express how it is in scope qualified an unqualified respectively9Used only for the 'module M' item in export list; see 0ghc-lib-parser>Apply a transformation function to the GREs for these OccNames0ghc-lib-parserIs in scope unqualified?0ghc-lib-parser,Is in scope qualified with the given module?0ghc-lib-parserPrint out one place where the name was define/imported (With -dppr-debug, print them all)0ghc-lib-parser.Indicate if the given name is the "@" operator////////////////00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000////00000/000///////////00000NoneT0ghc-lib-parser$The name the module is imported with0ghc-lib-parser#the source span of the whole import0ghc-lib-parserwhether this is a safe import0ghc-lib-parser"whether this is an "hiding" import0ghc-lib-parser(all the things the module could provide.4NB. BangPattern here: otherwise this leaks. (#15111)0ghc-lib-parser"whether this is a qualified import0ghc-lib-parserIf a module was "imported" by the user, we associate it with more detailed usage information 0; a module imported by the system only gets used for usage information.1ghc-lib-parserRecords the modules directly imported by a module for extracting e.g. usage information, and also to give better error message 0000000001111 1011000000001None51ghc-lib-parserA collection of annotations1ghc-lib-parserThe kind of annotation target found in the middle end of the compiler1ghc-lib-parserAn annotation target1ghc-lib-parserWe are annotating something with a name: a type or identifier1ghc-lib-parser%We are annotating a particular module1ghc-lib-parserRepresents an annotation after it has been sufficiently desugared from it's initial form of 1ghc-lib-parserThe target of the annotation1ghc-lib-parser An empty annotation environment.1ghc-lib-parserConstruct a new annotation environment that contains the list of annotations provided.1ghc-lib-parser,Add the given annotation to the environment.1ghc-lib-parser"Union two annotation environments.1ghc-lib-parser5Find the annotations attached to the given target as  values of your choice. If no deserializer is specified, only transient annotations will be returned.1ghc-lib-parser5Find the annotations attached to the given target as  values of your choice. If no deserializer is specified, only transient annotations will be returned.1ghc-lib-parserDeserialize all annotations of a given type. This happens lazily, that is no deserialization will take place until the [a] is actually demanded and the [a] can also be empty (the UniqFM is not filtered).1ghc-lib-parserThe "payload" of an annotation allows recovery of its value at a given type, and can be persisted to an interface file1111111111111111111111111111111111None 35>?C1ghc-lib-parserCaptures the sort order of sub elements. This is needed when the sub-elements have been split (as in a HsLocalBind which holds separate binds and sigs) or for infix patterns where the order has been re-arranged. It is captured explicitly so that after the Delta phase a SrcSpan is used purely as an index into the annotations, allowing transformations of the AST including the introduction of new Located items or re-arranging existing ones.1ghc-lib-parserexact print annotation used for capturing the locations of annotations in pragmas.1ghc-lib-parserA 1 can capture the locations of surrounding adornments, such as parens or backquotes. This data type identifies what particular pair are being used.1ghc-lib-parser'(' ')'1ghc-lib-parser'(' ')'1ghc-lib-parser'`'1ghc-lib-parser'[' ']'1ghc-lib-parserexact print annotations for a RdrName. There are many kinds of adornment that can be attached to a given RdrName. This type captures them, as detailed on the individual constructors.1ghc-lib-parser&Used for a name with an adornment, so `foo`, (bar)1ghc-lib-parser Used for (,,,), or @(,,,)#1ghc-lib-parser Used for ( | | )1ghc-lib-parser Used for (), (##), []1ghc-lib-parser Used for ->, as an identifier1ghc-lib-parser Used for an item with a leading '1. The annotation for unquoted item is stored in 1.1ghc-lib-parserUsed when adding a 1 to an existing 1' which has no Api Annotation (via the 1 constructor.1ghc-lib-parserExact print annotation for the Context data type.1ghc-lib-parserlocation and encoding of the '=>' , if present.1ghc-lib-parser!zero or more opening parentheses.1ghc-lib-parser!zero or more closing parentheses.1ghc-lib-parser$Detail of the "brackets" used in an 1 exact print annotation.1ghc-lib-parser'(', ')'1ghc-lib-parser'(', ')'1ghc-lib-parser'[', ']'1ghc-lib-parserexact print annotation for an item having surrounding "brackets", such as tuples or lists1ghc-lib-parserAnnotation for the "container" of a list. This captures surrounding items such as braces if present, and introductory keywords such as 'where'.1ghc-lib-parser#start point of a list having layout1ghc-lib-parsercontext, such as 'where' keyword1ghc-lib-parser)items appearing after the list, such as '=>' for a context1ghc-lib-parserAnnotation for items appearing in a list. They can have one or more trailing punctuations items, such as commas or semicolons.1ghc-lib-parserCaptures the location of punctuation occuring between items, normally in a list. It is captured as a trailing annotation.1ghc-lib-parser Trailing ';'1ghc-lib-parser Trailing ','1ghc-lib-parser Trailing '|'1ghc-lib-parserGeneral representation of a 0 type carrying a parameterised annotation type.1ghc-lib-parser,We mostly use 'SrcSpanAnn'' with an 'EpAnn''1ghc-lib-parser&The 'SrcSpanAnn'' type wraps a normal , together with an extra annotation type. This is mapped to a specific  usage in the AST through the XRec and Anno type families.1ghc-lib-parserWhen we are parsing we add comments that belong a particular AST element, and print them together with the element, interleaving them into the output stream. But when editing the AST to move fragments around it is useful to be able to first separate the comments into those occuring before the AST element and those following it. The 1 constructor is used to do this. The GHC parser will only insert the 1 form.1ghc-lib-parser'If tools modify the parsed source, the 1 variant can directly provide the spacing for this item relative to the previous one when printing. This allows AST fragments with a particular anchor to be freely moved, without worrying about recalculating the appropriate anchor span.1ghc-lib-parserAn 1 records the base location for the start of the syntactic element holding the annotations, and is used as the point of reference for calculating delta positions for contained annotations. It is also normally used as the reference point for the spacing of the element relative to its container. If it is moved, that relationship is tracked in the 1 instead.1ghc-lib-parserBase location for the start of the syntactic element holding the annotations.1ghc-lib-parserThe exact print annotations (EPAs) are kept in the HsSyn AST for the GhcPs phase. We do not always have EPAs though, only for code that has been parsed as they do not exist for generated code. This type captures that they may be missing.A goal of the annotations is that an AST can be edited, including moving subtrees from one place to another, duplicating them, and so on. This means that each fragment must be self-contained. To this end, each annotated fragment keeps track of the anchor position it was originally captured at, being simply the start span of the topmost element of the ast fragment. This gives us a way to later re-calculate all Located items in this layer of the AST, as well as any annotations captured. The comments associated with the AST fragment are also captured here.The 1 type parameter allows this general structure to be specialised to the specific set of locations of original exact print annotation elements. So for HsLet we havetype instance XLet GhcPs = EpAnn AnnsLet data AnnsLet = AnnsLet { alLet :: EpaLocation, alIn :: EpaLocation } deriving DataThe spacing between the items under the scope of a given EpAnn is normally derived from the original 1. But if a sub-element is not in its original position, the required spacing can be directly captured in the 1 field of the 1 Anchor. This allows us to freely move elements around, and stitch together new AST fragments out of old ones, and have them still printed out in a precise way.1ghc-lib-parser?No Annotation for generated code, e.g. from TH, deriving, etc.1ghc-lib-parserBase location for the start of the syntactic element holding the annotations.1ghc-lib-parserAnnotations added by the Parser1ghc-lib-parser6Comments enclosed in the SrcSpan of the element this 1 is attached to1ghc-lib-parserSpacing between output items when exact printing. It captures the spacing from the current print position on the page to the position required for the thing about to be printed. This is either on the same line in which case is is simply the number of spaces to emit, or it is some number of lines down, with a given column offset. The exact printing algorithm keeps track of the column offset pertaining to the current anchor position, so the 15 is the additional spaces to add in this case. See  8https://gitlab.haskell.org/ghc/ghc/wikis/api-annotations for details.1ghc-lib-parserdeltaLine should always be > 01ghc-lib-parserTokens embedded in the AST have an EpaLocation, unless they come from generated code (e.g. by TH).2ghc-lib-parserThe anchor for an 2. The Parser inserts the 2 variant, giving the exact location of the original item in the parsed source. This can be replaced by the 2 version, to provide a position for the item relative to the end of the previous item in the source. This is useful when editing an AST prior to exact printing the changed one. The list of comments in the 2 variant captures any comments between the prior output and the thing being marked here, since we cannot otherwise sort the relative order.2ghc-lib-parser$Captures an annotation, storing the 22 and its location. The parser only ever inserts 2 fields with a RealSrcSpan being the original location of the annotation in the source file. The 2 can also store a delta position if the AST has been modified and needs to be pretty printed again. The usual way an 2 is created is using the mj ("make jump") function, and then it can be inserted into the appropriate annotation.2ghc-lib-parser;a docstring that can be pretty printed using pprHsDocString2ghc-lib-parser(doc options (prune, ignore-exports, etc)2ghc-lib-parsercomment starting by "--"2ghc-lib-parsercomment in {- -}2ghc-lib-parser)empty comment, capturing location of EOF2ghc-lib-parser?The location of the prior token, used in exact printing. The 2 appears as an 1 containing its location. The difference between the end of the prior token and the start of this location is used for the spacing when exact printing the comment.2ghc-lib-parser'2ghc-lib-parser'=>', unicode variant2ghc-lib-parser'::'2ghc-lib-parser'::', unicode variant2ghc-lib-parser2ghc-lib-parser'..'2ghc-lib-parserUnicode variant2ghc-lib-parserfor function name in matches where there are multiple equations for the function.2ghc-lib-parser for CType2ghc-lib-parser'infix' or 'infixl' or 'infixr'2ghc-lib-parser'<-'2ghc-lib-parser'<-', unicode variant2ghc-lib-parserThe E unicode arrow2ghc-lib-parser 2ghc-lib-parser;where a name loses its location in the AST, this carries it2ghc-lib-parser'{-# DEPRECATED' etc. Opening of pragmas where the capitalisation of the string can be changed by the user. The actual text used is stored in a  SourceText on the relevant pragma item.2ghc-lib-parser'(|'2ghc-lib-parser'(|', unicode variant2ghc-lib-parser'{'2ghc-lib-parser'[e|' or '[e||'2ghc-lib-parser'[|'2ghc-lib-parser'[|', unicode variant2ghc-lib-parser'('2ghc-lib-parser'['2ghc-lib-parser'(#'2ghc-lib-parserprefix   -- TemplateHaskell2ghc-lib-parserprefix  -- TemplateHaskell2ghc-lib-parser% -- for HsExplicitMult2ghc-lib-parser'%1' -- for HsLinearArrow2ghc-lib-parser->2ghc-lib-parser->, unicode variant2ghc-lib-parser';'2ghc-lib-parser'''2ghc-lib-parserstatic2ghc-lib-parser double '''2ghc-lib-parser'~'2ghc-lib-parser() for types2ghc-lib-parser e.g. INTEGER2ghc-lib-parser*String value, will need quotes when output2ghc-lib-parser'|'2ghc-lib-parservia2ghc-lib-parser-<2ghc-lib-parser-<, unicode variant2ghc-lib-parser->2ghc-lib-parser->, unicode variant2ghc-lib-parser-<<2ghc-lib-parser-<<, unicode variant2ghc-lib-parser>>-2ghc-lib-parser>>-, unicode variant2ghc-lib-parser;Convert a normal annotation into its unicode equivalent one3ghc-lib-parserSmart constructor for a 1+. It preserves the invariant that for the 1 constructor 1 is always > 0.3ghc-lib-parser%Used in the parser only, extract the  from an 2!. The parser will never insert a 1#, so the partial function is safe.3ghc-lib-parser Maps the 1 to the related opening and closing AnnKeywordId. Used when actually printing the item.3ghc-lib-parser Convert a 1 to an 23ghc-lib-parser,Helper function used in the parser to add a 1" items to an existing annotation.3ghc-lib-parser,Helper function used in the parser to add a 1" items to an existing annotation.3ghc-lib-parserHelper function used in the parser to add a comma location to an existing annotation.3ghc-lib-parserHelper function (temporary) during transition of names Discards any annotations3ghc-lib-parserHelper function (temporary) during transition of names Discards any annotations3ghc-lib-parserHelper function (temporary) during transition of names Discards any annotations3ghc-lib-parserHelper function (temporary) during transition of names Discards any annotations3ghc-lib-parserShort form for 13ghc-lib-parserThe annotations need to all come after the anchor. Make sure this is the case.3ghc-lib-parserCombine locations from two % things and add them to a third thing3ghc-lib-parserAdd additional comments to a 1, used for manipulating the AST prior to exact printing the changed one.3ghc-lib-parser#Replace any existing comments on a 1, used for manipulating the AST prior to exact printing the changed one.3ghc-lib-parserAdd additional comments, used for manipulating the AST prior to exact printing the changed one.3ghc-lib-parserReplace any existing comments, used for manipulating the AST prior to exact printing the changed one.3ghc-lib-parserTransfer comments and trailing items from the annotations in the first 1! argument to those in the second.3ghc-lib-parserRemove the exact print annotations payload, leaving only the anchor and comments.3ghc-lib-parserRemove the comments, leaving the exact print annotations payload1ghc-lib-parser!Api Annotations for comments only11111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111112222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222233333333333333333333333333333333333333333333333333333333333333332222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222331121111133111111111111133311111133331111111111111111111111111111111111113111111111111111111111111111111111111111113333333333333333333333333333333333333333333333333333None 3567H4444444444444444444444444444444444444444NoneI4ghc-lib-parserUsed when we want to fingerprint a structure without depending on the fingerprints of external Names that it refers to.444444None '(/3L:4ghc-lib-parser,For now, we work only with nominal equality.4ghc-lib-parsercoaxrProves returns Nothing when it doesn't like the supplied arguments. When this happens in a coercion that means that the coercion is ill-formed, and Core Lint checks for that.4ghc-lib-parser-A more explicit representation for `t1 ~ t2`.4ghc-lib-parserA 4: is a "coercion constructor", i.e. a named equality axiom.4ghc-lib-parserThe  [CoAxBranch] passed into the mapping function is a list of all previous branches, reversed4444444444444444444444444444444444444444444444444444444444555555555544444444444444444444444444444444444454444445555555444454444444444445NoneND5ghc-lib-parserInformation about an associated type family default implementation. This is used solely for validity checking. See (Note [Type-checking default assoc decls] in  GHC.Tc.TyCl."5555555555555555555555555555555555"5555555555555555555555555555555555NoneO5ghc-lib-parserThe class of a register. Used in the register allocator. We treat all registers in a class as being interchangeable.55555555NoneRS5ghc-lib-parser"A register, either virtual or real5ghc-lib-parserRealRegs are machine regs which are available for allocation, in the usual way. We know what class they are, because that's part of the processor's architecture.5ghc-lib-parser4An identifier for a primitive real machine register.6ghc-lib-parserThe patch function supplied by the allocator maps VirtualReg to RealReg regs, but sometimes we want to apply it to plain old Reg.6ghc-lib-parserPrint a reg in a generic manner If you want the architecture specific names, then use the pprReg function from the appropriate Ppr module.555555555555555556666666555566666655555555555556NoneS>ghc-lib-parserShould this name be considered in-scope, even though it technically isn't?This ensures that we don't filter out information because, e.g., Data.Kind.Type isn't imported. See Note [pretendNameIsInScope].6666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777778888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<================================================================================================================================>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>6666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777777778888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<================================================================================================================================>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>> Safe-Inferredf>ghc-lib-parserDefault maximum depth for both class instance search and type family reduction. See also #5395.>ghc-lib-parserDefault maximum constraint-solver iterations Typically there should be very few >>>>>>>>>> >>>>>>>>>>uNone 3>0ghc-lib-parserTyCons represent type constructors. Type constructors are introduced by things such as:1) Data declarations: data Foo = ... creates the Foo type constructor of kind *2) Type synonyms: type Foo = ... creates the Foo type constructor 3) Newtypes: newtype Foo a = MkFoo ... creates the Foo type constructor of kind * -> *4) Class declarations: class Foo where creates the Foo type constructor of kind *This data type also encodes a number of primitive, built in type constructors such as those for function and tuple types.ghc-lib-parserName of the constructorghc-lib-parserMake a  for the Typeable* representation of the given wired-in typeghc-lib-parser Is this the  for an unboxed tuple?ghc-lib-parser Does this  represent a tuple?NB: when compiling  Data.Tuple, the tycons won't reply True to , because they are built as  AlgTyCons. However they get spat into the interface file as tuple tycons, so I don't think it matters.>ghc-lib-parserPaints a picture of what a  represents, in broad strokes. This is used towards more informative error messages.>ghc-lib-parser e.g., the (->) .>ghc-lib-parserA > is an abstraction of a type. It contains information that the code generator needs in order to pass arguments, return results, and store values of this type. See also Note [RuntimeRep and PrimRep] in GHC.Types.RepType and Note [VoidRep] in GHC.Types.RepType.?ghc-lib-parserUnlifted pointer?ghc-lib-parserSigned, 8-bit value?ghc-lib-parserSigned, 16-bit value?ghc-lib-parserSigned, 32-bit value?ghc-lib-parserSigned, 64 bit value?ghc-lib-parserSigned, word-sized value?ghc-lib-parserUnsigned, 8 bit value?ghc-lib-parserUnsigned, 16 bit value?ghc-lib-parserUnsigned, 32 bit value?ghc-lib-parserUnsigned, 64 bit value?ghc-lib-parserUnsigned, word-sized value?ghc-lib-parserA pointer, but not) to a Haskell value (use '(Un)liftedRep')?ghc-lib-parserA vector?ghc-lib-parser;Information pertaining to the expansion of a type synonym (type)?ghc-lib-parserRepresents an open type family without a fixed right hand side. Additional instances can appear at any time.7These are introduced by either a top level declaration: data family T a :: *Or an associated data type declaration, within a class declaration: !class C a b where data T b :: *?ghc-lib-parser"An open type synonym family e.g. type family F x y :: * -> *?ghc-lib-parser$A closed type synonym family e.g. &type family F x where { F Int = Bool }?ghc-lib-parserA closed type synonym family declared in an hs-boot file with type family F a where ..?ghc-lib-parser0Built-in type family used by the TypeNats solver?ghc-lib-parserDescribes the flavour of an algebraic type constructor. For classes and data families, this flavour includes a reference to the parent .?ghc-lib-parserAn ordinary algebraic type constructor. This includes unlifted and representation-polymorphic datatypes and newtypes and unboxed tuples, but NOT unboxed sums; see UnboxedSumTyCon.?ghc-lib-parserAn unboxed sum type constructor. This is distinct from VanillaAlgTyCon because we currently don't allow unboxed sums to be Typeable since there are too many of them. See #13276.?ghc-lib-parserType constructors representing a class dictionary. See Note [ATyCon for classes] in GHC.Core.TyCo.Rep?ghc-lib-parserType constructors representing an *instance* of a *data* family. Parameters:1) The type family in question*2) Instance types; free variables are the ? of the current  (not the family one). INVARIANT: the number of types matches the arity of the family 3) A CoTyCon identifying the representation type with the type instance family?ghc-lib-parserSome promoted datacons signify extra info relevant to GHC. For example, the IntRep constructor of  RuntimeRep corresponds to the ? constructor of >. This data structure allows us to store this information right in the 6. The other approach would be to look up things like  RuntimeRep's PrimRep by known-key every time. See also Note [Getting from RuntimeRep to PrimRep] in GHC.Types.RepType?ghc-lib-parseran ordinary promoted data con?ghc-lib-parserA constructor of  RuntimeRep. The argument to the function should be the list of arguments to the promoted datacon.?ghc-lib-parserA constructor of VecCount?ghc-lib-parserA constructor of VecElem?ghc-lib-parserA constructor of Levity?ghc-lib-parserA constructor of Levity?ghc-lib-parserRepresents right-hand-sides of s for algebraic types?ghc-lib-parserSays that we know nothing about this data type, except that it's represented by a pointer. Used when we export a data type abstractly into an .hi file.?ghc-lib-parserInformation about those s derived from a data declaration. This includes data types with no constructors at all.?ghc-lib-parserAn unboxed sum type.?ghc-lib-parserInformation about those s derived from a newtype declaration?ghc-lib-parserThe data type constructors; can be empty if the user declares the type to have no constructors'INVARIANT: Kept in order of increasing )/ tag (see the tag assignment in mkTyConTagMap)?ghc-lib-parserCached value: length data_cons?ghc-lib-parserCached value: is this an enumeration type? See Note [Enumeration types]?ghc-lib-parserJ if the data type constructor has a known, fixed levity when fully applied to its arguments, False otherwise.This can only be G with UnliftedDatatypes, e.g. 5data A :: TYPE (BoxedRep l) where { MkA :: Int -> A }This boolean is cached to make it cheaper to check for levity and representation-polymorphism in tcHasFixedRuntimeRep.?ghc-lib-parserThe unique constructor for the newtype. It has no existentials?ghc-lib-parser.Is this a boxed, unboxed or constraint tuple??ghc-lib-parserCached value: the argument type of the constructor, which is just the representation type of the  (remember that newtypes do not exist at runtime so need a different representation type). The free s of this type are the ? from the corresponding ?ghc-lib-parser Same as the ?0, but this time eta-reduced. Hence the list of ?s in this field may be shorter than the declared arity of the .?ghc-lib-parserJ if the newtype has a known, fixed representation when fully applied to its arguments, G# otherwise. This can only ever be G with UnliftedNewtypes.Example: newtype N (a :: TYPE r) = MkN a=Invariant: nt_fixed_rep nt = tcHasFixedRuntimeRep (nt_rhs nt)This boolean is cached to make it cheaper to check if a variable binding is representation-polymorphic in tcHasFixedRuntimeRep.?ghc-lib-parserA Unique of this TyCon. Invariant: identical to Unique of Name stored in tyConName field.?ghc-lib-parser Full binders?ghc-lib-parser Result kind?ghc-lib-parserKind of this TyCon?ghc-lib-parserArity?ghc-lib-parserA pre-allocated TyConApp tycon []?ghc-lib-parser TyVar binders?ghc-lib-parserThe C type that should be used for this type when using the FFI and CAPI?ghc-lib-parser,Maps a label to information about the field?ghc-lib-parserName of result type variable, used for pretty-printing with --show-iface and for reifying TyCon in Template Haskell?ghc-lib-parserScoped tyvars over the tycon's body The range is always a skolem or TcTyVar, be MonoTcTyCon only: see Note [Scoped tyvars in a TcTyCon]?ghc-lib-parserIs this TcTyCon already generalized? Used only to make zonking more efficient?ghc-lib-parserMake a Required TyConBinder. It chooses between NamedTCB and AnonTCB based on whether the tv is mentioned in the dependent set?ghc-lib-parser Create an ? from the data constructors, for a potentially levity-polymorphic datatype (with UnliftedDatatypes).?ghc-lib-parser Create an ? from the data constructors.Use mkLevPolyDataConRhs+ if the datatype can be levity-polymorphic.?ghc-lib-parserExtract those )s that we are able to learn about. Note that visibility in this sense does not correspond to visibility in the context of any particular user program!?ghc-lib-parserThe name (and defining module) for the Typeable representation (TyCon) of a type constructor.&See Note [Grand plan for Typeable] in GHC.Tc.Instance.Typeable.?ghc-lib-parserThe size of a > in bytes.This applies also when used in a constructor, where we allow packing the fields. For instance, in data Foo = Foo Float Float the two fields will take only 8 bytes, which for 64-bit arch will be equal to 1 word. See also mkVirtHeapOffsetsWithPadding for details of how data fields are laid out.?ghc-lib-parserReturn if Rep stands for floating type, returns Nothing for vector types.?ghc-lib-parser-The labels for the fields of this particular ?ghc-lib-parser(Look up a field label belonging to this ?ghc-lib-parserGiven the name of the function type constructor and it's kind, create the corresponding . It is recommended to use  if you want this functionality?ghc-lib-parser#This is the making of an algebraic .?ghc-lib-parserSimpler specialization of ? for classes?ghc-lib-parserMakes a tycon suitable for use during type-checking. It stores a variety of details about the definition of the TyCon, but no right-hand side. It lives only during the type-checking of a mutually-recursive group of tycons; it is then zonked to a proper TyCon in zonkTcTyCon. See also Note [Kind checking recursive type and class declarations] in  GHC.Tc.TyCl.?ghc-lib-parser5No scoped type variables (to be used with mkTcTyCon).?ghc-lib-parserCreate an primitive  , such as Int#, Type or  RealWorld# Primitive TyCons are marshalable iff not lifted. If you'd like to change this, modify marshalablePrimTyCon.?ghc-lib-parserCreate a type synonym ?ghc-lib-parserCreate a type family ?ghc-lib-parser#Create a promoted data constructor  Somewhat dodgily, we give it the same Name as the data constructor itself; when we pretty-print the TyCon we add a quote; see the Outputable TyCon instance?ghc-lib-parser Test if the 8 is algebraic but abstract (invisible data constructors)?ghc-lib-parser Does this 7 represent something that cannot be defined in Haskell??ghc-lib-parserReturns True if the supplied  resulted from either a data or newtype declaration?ghc-lib-parserReturns True9 for vanilla AlgTyCons -- that is, those created with a data or newtype declaration.?ghc-lib-parserReturns True for the  of the  Constraint kind.?ghc-lib-parserReturns True for data types that are  definitely represented by heap-allocated constructors. These are scrutinised by Core-level case: expressions, and they get info tables allocated for them.-Generally, the function will be true for all data types and false for newtype1s, unboxed tuples, unboxed sums and type family &s. But it is not guaranteed to return True in all cases that it could.%NB: for a data type family, only the instance 2s get an info table. The family declaration  does not?ghc-lib-parser? is true of s for which this property holds (where X is the role passed in): If (T a1 b1 c1) ~X (T a2 b2 c2), then (a1 ~X1 a2), (b1 ~X2 b2), and (c1 ~X3 c2) (where X1, X2, and X3, are the roles given by tyConRolesX tc X) See also Note [Decomposing equality] in GHC.Tc.Solver.Canonical?ghc-lib-parser? is true of s for which this property holds (where X is the role passed in): If (T tys ~X t), then (t's head ~X T). See also Note [Decomposing equality] in GHC.Tc.Solver.Canonical?ghc-lib-parser Is this an ? of a  that is generative and injective with respect to representational equality??ghc-lib-parserIs this  that for a newtype?ghc-lib-parserTake a  apart into the s it scopes over, the  it expands into, and (possibly) a coercion from the representation type to the newtype . Returns Nothing if this is not possible.?ghc-lib-parser Is this a * representing a regular H98 type synonym (type)??ghc-lib-parserIs this tycon neither a type family nor a synonym that expands to a type family??ghc-lib-parserIs this a forgetful type synonym? If this is a type synonym whose RHS does not mention one (or more) of its bound variables, returns True. Thus, False means that all bound variables appear on the RHS; True may not mean anything, as the test to set this flag is conservative.?ghc-lib-parserTrue iff we can decompose (T a b c) into ((T a b) c) I.e. is it injective and generative w.r.t nominal equality? That is, if (T a b) ~N d e f, is it always the case that (T ~N d), (a ~N e) and (b ~N f)? Specifically NOT true of synonyms (open and otherwise)It'd be unusual to call mustBeSaturated on a regular H98 type synonym, because you should probably have expanded it first But regardless, it's not decomposable@ghc-lib-parserIs this an algebraic  declared with the GADT syntax?@ghc-lib-parserIs this an algebraic ( which is just an enumeration of values?@ghc-lib-parser Is this a ., synonym or otherwise, that defines a family?@ghc-lib-parser Is this a >, synonym or otherwise, that defines a family with instances?@ghc-lib-parserIs this a synonym 1 that can have may have further instances appear?@ghc-lib-parserIs this a synonym 1 that can have may have further instances appear?@ghc-lib-parser"Is this an open type family TyCon?@ghc-lib-parser0Is this a non-empty closed type family? Returns H( for abstract or empty closed families.@ghc-lib-parser@ tc returns ? is if tc is an injective tycon (where is states for which ? tc is injective), or ? otherwise.@ghc-lib-parser%Is this TyCon for an associated type?@ghc-lib-parserGet the enclosing class TyCon (if there is one) for the given TyCon.@ghc-lib-parserGet the enclosing class TyCon (if there is one) for the given TyConFlavour@ghc-lib-parser Is this the  for a boxed tuple?@ghc-lib-parser Is this the  for an unboxed sum?@ghc-lib-parser Is this the  for a promoted tuple?@ghc-lib-parserIs this a PromotedDataCon?@ghc-lib-parser T a .... See Note [The stupid context] in GHC.Core.DataCon.@ghc-lib-parser Extract the s bound by a vanilla type synonym and the corresponding (unsubstituted) right hand side.@ghc-lib-parserExtract the information pertaining to the right hand side of a type synonym (type) declaration.@ghc-lib-parserExtract the flavour of a type family (with all the extra information that it carries)@ghc-lib-parserIs this  that for a class instance?@ghc-lib-parserIf this  is that for a class instance, return the class it is for. Otherwise returns Nothing@ghc-lib-parser#Return the associated types of the , if any@ghc-lib-parserIs this ! that for a data family instance?@ghc-lib-parserIf this  is that of a data family instance, return the family in question and the instance types. Otherwise, return Nothing@ghc-lib-parserIf this - is that of a data family instance, return a  which represents a coercion identifying the representation type with the type instance family. Otherwise, return Nothing@ghc-lib-parser Extract any ? from this TyCon@ghc-lib-parserIs this flavour of & an open type family or a data family?@ghc-lib-parserReturns whether or not this  is definite, or a hole that may be filled in at some later point. See Note [Skolem abstract data] ?ghc-lib-parser whether the ) has a fixed levity?ghc-lib-parserBinders of the ghc-lib-parser Result kindghc-lib-parserThe roles for each TyVarghc-lib-parser>The C type this type corresponds to when using the CAPI FFIghc-lib-parserStupid theta: see ghc-lib-parser#Information about data constructorsghc-lib-parser0What flavour is it? (e.g. vanilla, type family)ghc-lib-parserWas the  declared with GADT syntax??ghc-lib-parserResult kind of the ghc-lib-parserArity of the tuple ghc-lib-parser%Whether the tuple is boxed or unboxed?ghc-lib-parserKind of the resulting ghc-lib-parserArity of the sumghc-lib-parsers scoped over: see ??ghc-lib-parserresult kind onlyghc-lib-parserScoped type variables; see Note [How TcTyCons work] in GHC.Tc.TyClghc-lib-parser$Is this TcTyCon generalised already?ghc-lib-parser What sort of  this represents?ghc-lib-parserresult kind Must answer J to isFixedRuntimeRepKind (i.e., no representation polymorphism). (If you need a representation-polymorphic PrimTyCon, change tcHasFixedRuntimeRep, marshalablePrimTyCon, reifyTyCon for PrimTyCons.)?ghc-lib-parserresult kind?ghc-lib-parserresult kind@ghc-lib-parser Arguments to ghc-lib-parser Returns a  substitution, the body type of the synonym (not yet substituted) and any arguments remaining from the application ^ Expand a type synonym application Return Nothing if the TyCon is not a synonym, or if not enough arguments are supplied????????????4444>>>>>>>>>>>>>>>>>>>>>>>>>????????????????????????????????????????????????????????????????????????????????????????????????????????????????????@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@?????????????????????????????4444??????????>>>>>>>>>>>>>??????????????????????????????????@@?@@@??@@@@????@??@@@@@@@@@???@@@@@@@@@@?????@@@@@@@@@??@@@@@@@@@@@@?@@@@??@?@?????@@@@@?@?>?????????????????>>>>>>>>>>>????????Noneê@ghc-lib-parserDeterministic TyCon Environment#See Note [Deterministic UniqFM] in GHC.Types.Unique.DFM( for explanation why we need DTyConEnv.@ghc-lib-parserTyCon Environment&@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@AAAAAA&@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@AAAAAANoneŘAghc-lib-parser Initialise a A with A.Aghc-lib-parser8The default upper bound (100) for the number of times a A is allowed to encounter each .Aghc-lib-parser1Change the upper bound for the number of times a A is allowed to encounter each .AAAAAAAAAAyNone3-(ghc-lib-parserA collection of sghc-lib-parser0The key type representing kinds in the compiler.ghc-lib-parserA type of the form p of constraint kind represents a value whose type is the Haskell predicate p/, where a predicate is what occurs before the => in a Haskell type.We use  as documentation to mark those types that we guarantee to have this kind.0It can be expanded into its representation, but:(The type checker must treat it as opaque1The rest of the compiler treats it as transparentConsider these examples: f :: (Eq a) => a -> Int g :: (?x :: Int -> Int) => a -> Int h :: (r\l) => {r} => {l::Int | r} Here the Eq a and ?x :: Int -> Int and rl are all called "predicates"ghc-lib-parserMult is a type alias for Type.Mult must contain Type because multiplicity variables are mere type variables (of kind Multiplicity) in Haskell. So the simplest implementation is to make Mult be Type.Multiplicities can be formed with: - One: GHC.Types.One (= oneDataCon) - Many: GHC.Types.Many (= manyDataCon) - Multiplication: GHC.Types.MultMul (= multMulTyCon)So that Mult feels a bit more structured, we provide pattern synonyms and smart constructors for these.ghc-lib-parser&A shorthand for data with an attached  element (the multiplicity).ghc-lib-parserA semantically more meaningful type to represent what may or may not be a useful .ghc-lib-parserA  represents an argument to a function. TyCoBinders can be dependent (A) or nondependent (A;). They may also be visible or not. See Note [TyCoBinders]ghc-lib-parserFor simplicity, we have just one UnivCo that represents a coercion from some type to some other type, with (in general) no restrictions on the type. The UnivCoProvenance specifies more exactly what the coercion really is and why a program should (or shouldn't!) trust the coercion. It is reasonable to consider each constructor of  as a totally independent coercion form; their only commonality is that they don't tell you what types they coercion between. (That info is in the A constructor of .ghc-lib-parserA  is concrete evidence of the equality/convertibility of two types.ghc-lib-parser creates a nullary A$. In general you should rather use x, which picks the shared nullary TyConApp from inside the TyCon (via tyConNullaryTy. But we have to build the TyConApp tc [] in that TyCon field; that's what  is for.ghc-lib-parserLike mkTyCoForAllTy, but does not check the occurrence of the binder See Note [Unused coercion variable in ForAllTy]Aghc-lib-parser>What to do with coercion holes. See Note [Coercion holes] in GHC.Core.TyCo.Rep.Aghc-lib-parser.The returned env is used in the extended scopeAghc-lib-parserA coercion to be filled in by the type-checker. See Note [Coercion holes]Aghc-lib-parser>See Note [Phantom coercions]. Only in Phantom roled coercionsAghc-lib-parserFrom the fact that any two coercions are considered equivalent. See Note [ProofIrrelProv]. Can be used in Nominal or Representational coercionsAghc-lib-parserFrom a plugin, which asserts that this coercion is sound. The string is for the use of the plugin.Aghc-lib-parser;See Note [Coercion holes] Only present during typecheckingAghc-lib-parserA is like , but there can only be + in the A field.Aghc-lib-parserA type labeled A might have knot-tied tycons in it. See Note [Type checking recursive type and class declarations] in  GHC.Tc.TyClAghc-lib-parser;Vanilla type or kind variable (*never* a coercion variable)Aghc-lib-parser+Type application to something other than a  . Parameters:1) Function: must not be a A or A, must be another A, or A See Note [Respecting definitional equality] (EQ1) about the no A requirement2) Argument typeAghc-lib-parserApplication of a , including newtypes and1 synonyms. Invariant: saturated applications of FunTyCon must use A and saturated synonyms must use their own constructors. However,  unsaturated FunTyCons do appear as As. Parameters:%1) Type constructor being applied to.2) Type arguments. Might not have enough type arguments here to saturate the constructor. Even type synonyms are not necessarily saturated; for example unsaturated type synonyms can appear as the right hand side of a type synonym.Aghc-lib-parserA  type. Note [When we quantify over a coercion variable] INVARIANT: If the binder is a coercion variable, it must be mentioned in the Type. See Note [Unused coercion variable in ForAllTy]Aghc-lib-parserFUN m t1 t2 Very common, so an important special case See Note [Function types]Aghc-lib-parser/Type literals are similar to type constructors.Aghc-lib-parserA kind cast. The coercion is always nominal. INVARIANT: The cast is never reflexive (EQ2) INVARIANT: The Type is not a CastTy (use TransCo instead) (EQ3) INVARIANT: The Type is not a ForAllTy over a tyvar (EQ4) See Note [Respecting definitional equality]Aghc-lib-parserInjection of a Coercion into a type This should only ever be used in the RHS of an AppTy, in the list of a TyConApp, when applying a promoted GADT data constructorAghc-lib-parser/Type synonym used for types of kind RuntimeRep.Aghc-lib-parser3The key representation of types within the compilerAghc-lib-parserRemove the binder's variable from the set, if the binder has a variable.Aghc-lib-parser,Does this binder bind an invisible argument?Aghc-lib-parser)Does this binder bind a visible argument?Aghc-lib-parserIf its a named binder, is the binder a tyvar? Returns True for nondependent binder. This check that we're really returning a *Ty*Binder (as opposed to a coercion binder). That way, if/when we allow coercion quantification in more places, we'll know we missed updating some function.Aghc-lib-parser0Special, common, case: Arrow type with mult ManyAghc-lib-parserMake nested arrow typesAghc-lib-parser/Wraps foralls over the type using the provided s from left to rightAghc-lib-parser/Wraps foralls over the type using the provided s from left to rightAghc-lib-parser+A view function that looks through nothing.Aghc-lib-parserApply a function to both the Mult and the Type in a 'Scaled Type'++++,,AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA!+,,,,,,AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA++,,,,++AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA+A,,,,A,,AAAA!AAAAAAAAAAAAAAAAA3A3A3A3A3 NoneBghc-lib-parserReturns free variables of types, including kind variables as a non-deterministic set. For type synonyms it does not expand the synonym.Bghc-lib-parserAdd the kind variables free in the kinds of the tyvars in the given set. Returns a deterministically ordered list.Bghc-lib-parserAdd the kind variables free in the kinds of the tyvars in the given set. Returns a deterministic set.Bghc-lib-parserB that returns free variables of a type in a deterministic set. For explanation of why using ,6 is not deterministic see Note [Deterministic FV] in  GHC.Utils.FV.Bghc-lib-parserB that returns free variables of a type in deterministic order. For explanation of why using ,6 is not deterministic see Note [Deterministic FV] in  GHC.Utils.FV.Bghc-lib-parserReturns free variables of types, including kind variables as a deterministic set. For type synonyms it does not expand the synonym.Bghc-lib-parserReturns free variables of types, including kind variables as a deterministically ordered list. For type synonyms it does not expand the synonym.Bghc-lib-parserThe worker for B and tyCoFVsOfTypeList$. The previous implementation used , which is O(n+m) and can make the function quadratic. It's exported, so that it can be composed with other functions that compute free variables. See Note [FV naming conventions] in  GHC.Utils.FV.Eta-expanded because that makes it run faster (apparently) See Note [FV eta expansion] in  GHC.Utils.FV for explanation.Bghc-lib-parser6Get a deterministic set of the vars free in a coercionBghc-lib-parserGiven a covar and a coercion, returns True if covar is almost devoid in the coercion. That is, covar can only appear in Refl and GRefl. See last wrinkle in Note [Unused coercion variable in ForAllCo] in GHC.Core.CoercionBghc-lib-parser Returns the free variables of a  that are in injective positions. Specifically, it finds the free variables while:Expanding type synonymsIgnoring the coercion in  (ty |> co)'Ignoring the non-injective fields of a AFor example, if F& is a non-injective type family, then: 9injectiveTyVarsOf( Either c (Maybe (a, F b c)) ) = {a,c} If B ty = itvs, then knowing ty fixes itvs. More formally, if a is in B ty and S1(ty) ~ S2(ty), then S1(a) ~ S2(a) , where S1 and S2 are arbitrary substitutions.See Note [When does a tycon application need an explicit kind signature?].Bghc-lib-parser Returns the free variables of a  that are in injective positions. Specifically, it finds the free variables while:Expanding type synonymsIgnoring the coercion in  (ty |> co)'Ignoring the non-injective fields of a ASee Note [When does a tycon application need an explicit kind signature?].Bghc-lib-parserReturns the set of variables that are used invisibly anywhere within the given type. A variable will be included even if it is used both visibly and invisibly. An invisible use site includes: * In the kind of a variable * In the kind of a bound variable in a forall * In a coercion * In a Specified or Inferred argument to a function See Note [VarBndrs, TyCoVarBinders, TyConBinders, and visibility] in GHC.Core.TyCo.RepBghc-lib-parserLike B, but for many types.Bghc-lib-parserDo a topological sort on a list of tyvars, so that binders occur before occurrences E.g. given [ a::k, k::*, b::k ] it'll return a well-scoped list [ k::*, a::k, b::k ]This is a deterministic sorting operation (that is, doesn't depend on Uniques).It is also meant to be stable: that is, variables should not be reordered unnecessarily. This is specified in Note [ScopedSort] See also Note [Ordering of implicit variables] in GHC.Rename.HsTypeBghc-lib-parser+Get the free vars of a type in scoped orderBghc-lib-parser*Get the free vars of types in scoped orderBghc-lib-parserShould we look under injective type families? See Note [Coverage condition for injective type families] in GHC.Tc.Instance.Family.Bghc-lib-parserlook under injective type families? See Note [Coverage condition for injective type families] in GHC.Tc.Instance.Family.2AAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBB2BBAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBANonewBghc-lib-parserThis tidies up a type for printing in an error message, or in an interface file.;It doesn't change the uniques at all, just the print names.Bghc-lib-parser Add the free s to the env in tidy form, so that we can tidy the type they are free inBghc-lib-parser Treat a new  as a binder, and give it a fresh tidy name using the environment if one has not already been allocated. See also BBghc-lib-parserTidy a list of Types-See Note [Strictness in tidyType and friends]Bghc-lib-parser Tidy a Type-See Note [Strictness in tidyType and friends]Bghc-lib-parser:Grabs the free type variables, tidies them and then uses B to work over the type itselfBghc-lib-parserCalls B= on a top-level type (i.e. with an empty tidying environment)Bghc-lib-parserTidy a Coercion-See Note [Strictness in tidyType and friends]BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBNoneDBghc-lib-parserA substitution of s for ,sBghc-lib-parserA substitution of s for s and s for ,sBghc-lib-parserType & coercion substitutiontcvsubst_invariant* The following invariants must hold of a B: The in-scope set is needed only* to guide the generation of fresh uniquesIn particular, the kind; of the type variables in the in-scope set is not relevantThe substitution is only applied ONCE! This is because in general such application will not reach a fixed point.Bghc-lib-parser(compose env1 env2)(x) is  env1(env2(x)) ; i.e. apply env2 then env14. It assumes that both are idempotent. Typically, env1* is the refinement to a base substitution env2Bghc-lib-parserComposes two substitutions, applying the second one provided first, like in function composition.Bghc-lib-parserMake a TCvSubst with specified tyvar subst and empty covar substBghc-lib-parserMake a TCvSubst with specified covar subst and empty tyvar substBghc-lib-parserReturns the free variables of the types in the range of a substitution as a non-deterministic set.Bghc-lib-parser#Generates the in-scope set for the B from the types in the incoming environment. No CoVars, please!Bghc-lib-parser#Generates the in-scope set for the B from the types in the incoming environment. No TyVars, please!Bghc-lib-parser#Generates the in-scope set for the B from the types in the incoming environment. No CoVars, please!Bghc-lib-parserType substitution, see BBghc-lib-parserType substitution, see B. Disables sanity checks. The problems that the sanity checks in substTy catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTyUnchecked to substTy and remove this function. Please don't use in new code.Bghc-lib-parser.Substitute tyvars within a type using a known -. Pre-condition: the in_scope set should satisfy Note [The substitution invariant]; specifically it should include the free vars of tys , and of ty minus the domain of the subst.Bghc-lib-parserCoercion substitution, see BBghc-lib-parserCoercion substitution, see B. Disables sanity checks. The problems that the sanity checks in substCo catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substCoUnchecked to substCo and remove this function. Please don't use in new code.Bghc-lib-parserSubstitute covars within a typeBghc-lib-parserType substitution, see BBghc-lib-parserType substitution, see BBghc-lib-parserSubstitute within a  after adding the free variables of the type to the in-scope set. This is useful for the case when the free variables aren't already in the in-scope set or easily available. See also Note [The substitution invariant].Bghc-lib-parser When calling B it should be the case that the in-scope set in the substitution is a superset of the free vars of the range of the substitution. See also Note [The substitution invariant].Bghc-lib-parserThis checks if the substitution satisfies the invariant from Note [The substitution invariant].Bghc-lib-parserSubstitute within a  The substitution has to satisfy the invariants described in Note [The substitution invariant].Bghc-lib-parserSubstitute within a  disabling the sanity checks. The problems that the sanity checks in substTy catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTyUnchecked to substTy and remove this function. Please don't use in new code.Bghc-lib-parserSubstitute within several s The substitution has to satisfy the invariants described in Note [The substitution invariant].Bghc-lib-parserSubstitute within several s disabling the sanity checks. The problems that the sanity checks in substTys catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substTysUnchecked to substTys and remove this function. Please don't use in new code.Bghc-lib-parserSubstitute within a  The substitution has to satisfy the invariants described in Note [The substitution invariant].Bghc-lib-parserSubstitute within a  disabling the sanity checks. The problems that the sanity checks in substTys catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substThetaUnchecked to substTheta and remove this function. Please don't use in new code.Cghc-lib-parserSubstitute within a  The substitution has to satisfy the invariants described in Note [The substitution invariant].Cghc-lib-parserSubstitute within a  disabling sanity checks. The problems that the sanity checks in substCo catch are described in Note [The substitution invariant]. The goal of #11371 is to migrate all the calls of substCoUnchecked to substCo and remove this function. Please don't use in new code.Cghc-lib-parserSubstitute within several s The substitution has to satisfy the invariants described in Note [The substitution invariant].BBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCCCCCCCCCCCCCCCCCCBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCBBBBBCCCCCCCCCCCCCBBBCCCCBB{None~Cghc-lib-parser Primitive s that are defined in GHC.Prim but not exposed. It's important to keep these separate as we don't want users to be able to write them (see #15209) or see them in GHCi's :browse output (see #12023).Cghc-lib-parser Primitive 3s that are defined in, and exported from, GHC.Prim.Cghc-lib-parserThe FUN type constructor. FUN :: forall (m :: Multiplicity) -> forall {rep1 :: RuntimeRep} {rep2 :: RuntimeRep}. TYPE rep1 -> TYPE rep2 -> * The runtime representations quantification is left inferred. This means they cannot be specified with -XTypeApplications.This is a deliberate choice to allow future extensions to the function arrow. To allow visible application a type synonym can be defined: type Arr :: forall (rep1 :: RuntimeRep) (rep2 :: RuntimeRep). TYPE rep1 -> TYPE rep2 -> Type type Arr = FUN 'Many Dghc-lib-parserGiven a Role, what TyCon is the type of equality predicates at that role?Dghc-lib-parserThe  for the  'IsRefl#' constraint. 7type IsRefl# :: forall k. k -> k -> TYPE (TupleRep '[]),See Note [IsRefl#] in GHC.Tc.Utils.Concrete.CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDCCCCCCCCCCCCCCCCCCCCCCCCDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDxNone &?vghc-lib-parserGiven a = and a list of argument types, partition the arguments into: , or , (i.e., invisible) arguments and+ (i.e., visible) argumentsghc-lib-parser Extract the   of a type. For example, getLevity Int = Lifted, or !getLevity (Array# Int) = Unlifted.Panics if this is not possible. Does not look through type family applications.ghc-lib-parser The same as fst . splitTyConAppghc-lib-parserAttempts to tease a type apart into a type constructor and the application of a number of arguments to that constructorghc-lib-parserThis version considers Constraint to be the same as *. Returns True if the argument is equivalent to Type/Constraint and False otherwise. See Note [Kind Constraint and kind Type]ghc-lib-parserIs this the type  Multiplicity?ghc-lib-parserIs this the type  ?ghc-lib-parserIs this the type ??ghc-lib-parserGives the typechecker view of a type. This unwraps synonyms but leaves  Constraint alone. c.f. , which turns  Constraint into  . Returns H> if no unwrapping happens. See also Note [coreView vs tcView]ghc-lib-parserThis function strips off the top layer only of a type synonym application (if any) its underlying representation type. Returns H? if there is nothing to look through. This function considers  Constraint to be a synonym of Type.=This function does not look through type family applications.By being non-recursive and inlined, this case analysis gets efficiently joined onto the case analysis that the caller is already doingghc-lib-parserA key function: builds a A or A as appropriate to its arguments. Applies its arguments to the constructor from left to right.ghc-lib-parser(mkTyConTy tc) returns (TyConApp tc []) but arranges to share that TyConApp among all calls See Note [Sharing nullary TyConApps] in GHC.Core.TyConghc-lib-parserMake a A. The Coercion must be nominal. Checks the Coercion for reflexivity, dropping it if it's reflexive. See 'Note [Respecting definitional equality] in GHC.Core.TyCo.Repghc-lib-parser&Applies a type to another, as in e.g. k aDghc-lib-parserThis describes how a "map" operation over a type/coercion should behaveDghc-lib-parser>What to do with coercion holes. See Note [Coercion holes] in GHC.Core.TyCo.Rep.Dghc-lib-parser.The returned env is used in the extended scopeDghc-lib-parserThis is used only for TcTyCons a) To zonk TcTyCons b) To turn TcTyCons into TyCons. See Note [Type checking recursive type and class declarations] in  GHC.Tc.TyClDghc-lib-parserExpand out all type synonyms. Actually, it'd suffice to expand out just the ones that discard type variables (e.g. type Funny a = Int) But we don't know which those are currently, so we just expand all.D only expands out type synonyms mentioned in the type, not in the kinds of any TyCon or TyVar mentioned in the type.Keep this synchronized with synonymTyConsOfTypeDghc-lib-parserExtract the RuntimeRep classifier of a type from its kind. For example, kindRep * = LiftedRep; Panics if this is not possible. Treats * and Constraint as the sameDghc-lib-parserGiven a kind (TYPE rr), extract its RuntimeRep classifier rr. For example,  kindRep_maybe * = Just LiftedRep Returns H if the kind is not of form (TYPE rr) Treats * and Constraint as the sameDghc-lib-parserReturns True if the kind classifies types which are allocated on the GC'd heap and False otherwise. Note that this returns False for representation-polymorphic kinds, which may be specialized to a kind that classifies AddrRep or even unboxed kinds.Dghc-lib-parser9Returns True if the kind classifies unlifted types (like 'Int#') and False otherwise. Note that this returns False for representation-polymorphic kinds, which may be specialized to a kind that classifies unlifted types.Dghc-lib-parserSee .Dghc-lib-parserCheck whether a type of kind ?! is lifted, unlifted, or unknown.isLiftedRuntimeRep rr returns: Just Lifted if rr is LiftedRep :: RuntimeRep Just Unlifted if rr is definitely unlifted, e.g. IntRepNothing if not known (e.g. it's a type variable or a type family application).Dghc-lib-parserCheck whether a type of kind ? is lifted.D is:True of LiftedRep :: RuntimeRepFalse of type variables, type family applications, and of other reps such as IntRep :: RuntimeRep.Dghc-lib-parserCheck whether a type of kind ? is unlifted.True of definitely unlifted ?s such as ?, ?, ?, ... False of ?,6False for type variables and type family applications.Dghc-lib-parserIs a tyvar of type ??Eghc-lib-parserIs a tyvar of type  ?Eghc-lib-parserIs a tyvar of type  Multiplicity?Eghc-lib-parser2Attempts to obtain the type variable underlying a , and panics with the given message if this is not a type variable type. See also EEghc-lib-parser2Attempts to obtain the type variable underlying a Eghc-lib-parserIf the type is a tyvar, possibly under a cast, returns it, along with the coercion. Thus, the co is :: kind tv ~N kind tyEghc-lib-parser2Attempts to obtain the type variable underlying a , without any expansionEghc-lib-parserAttempt to take a type application apart, whether it is a function, type constructor, or plain type application. Note that type family applications are NEVER unsaturated by this!Eghc-lib-parserDoes the AppTy split as in E7, but assumes that any Core view stuff is already doneEghc-lib-parserDoes the AppTy split as in tcSplitAppTy_maybe, but assumes that any coreView stuff is already done. Refuses to look through (c => t)Eghc-lib-parser1Attempts to take a type application apart, as in E%, and panics if this is not possibleEghc-lib-parserRecursively splits a type as far as is possible, leaving a residual type being applied to and the type arguments applied to it. Never fails, even if that means returning an empty list of type applications.Eghc-lib-parserLike E(, but doesn't look through type synonymsEghc-lib-parser>Is this a numeric literal. We also look through type synonyms.Eghc-lib-parser=Is this a symbol literal. We also look through type synonyms.Eghc-lib-parser;Is this a char literal? We also look through type synonyms.Eghc-lib-parser2Is this a type literal (symbol, numeric, or char)?Eghc-lib-parserIs this type a custom user error? If so, give us the kind and the error message.Eghc-lib-parser=Render a type corresponding to a user type error into a SDoc.Eghc-lib-parserAttempts to extract the multiplicity, argument and result types from a type, and panics if that is not possible. See also EEghc-lib-parserAttempts to extract the multiplicity, argument and result types from a typeEghc-lib-parserExtract the function result type and panic if that is not possibleEghc-lib-parser Just like E/ but for a single argument Try not to iterate , because it's inefficient to substitute one variable at a time; instead use 'piResultTys"Extract the function argument type and panic if that is not possibleEghc-lib-parser(piResultTys f_ty [ty1, .., tyn]) gives the type of (f ty1 .. tyn) where f :: f_ty E" is interesting because: 1. f_ty may have more for-alls than there are args 2. Less obviously, it may have fewer for-alls For case 2. think of: piResultTys (forall a.a) [forall b.b, Int] This really can happen, but only (I think) in situations involving undefined. For example: undefined :: forall a. a Term: undefined (forall b. b->b) Int This term should have type (Int -> Int), but notice that there are more type args than foralls in s type.Eghc-lib-parser), as that's not a TyCon in the type-checker.If you only need the , consider using tcTyConAppTyCon_maybe.Eghc-lib-parserLike , but doesn't look through synonyms. This assumes the synonyms have already been dealt with.Eghc-lib-parserLike E, but doesn't look through synonyms. This assumes the synonyms have already been dealt with.Moreover, for a FunTy, it only succeeds if the argument types have enough info to extract the runtime-rep arguments that the funTyCon requires. This will usually be true; but may be temporarily false during canonicalization: see Note [Decomposing FunTy] in GHC.Tc.Solver.Canonical and Note [The Purely Kinded Type Invariant (PKTI)] in GHC.Tc.Gen.HsType, Wrinkle around FunTyEghc-lib-parserAttempts to tease a list type apart and gives the type of the elements if successful (looks through type synonyms)Eghc-lib-parser Unwrap one layer of newtype on a type constructor and its arguments, using an eta-reduced version of the newtype2 if possible. This requires tys to have at least newTyConInstArity tycon elements.Eghc-lib-parser Make a dependent forall over an , variableEghc-lib-parserLike E, but tv should be a tyvarEghc-lib-parserLike A/, but assumes all variables are dependent and ,, a common caseEghc-lib-parserLike E#, but tvs should be a list of tyvarEghc-lib-parserLike ,, but assumes the variable is dependent and ,, a common caseEghc-lib-parserLike A/, but assumes all variables are dependent and ,, a common caseEghc-lib-parserLike mkForAllTys, but assumes all variables are dependent and visibleEghc-lib-parserGiven a list of type-level vars and the free vars of a result kind, makes TyCoBinders, preferring anonymous binders if the variable is, in fact, not dependent. e.g. mkTyConBindersPreferAnon  k->k(k:*),(b:k),(c:k)- We want (k:*) Named, (b:k) Anon, (c:k) AnonAll non-coercion binders are visible.Eghc-lib-parserTake a ForAllTy apart, returning the list of tycovars and the result type. This always succeeds, even if it returns only an empty list. Note that the result type returned may have free variables that were bound by a forall.Eghc-lib-parserLike E, but only splits As with + type variable binders. Furthermore, each returned tyvar is annotated with ().Eghc-lib-parserLike E, but only splits As with + type variable binders. Furthermore, each returned tyvar is annotated with its .Eghc-lib-parser Bool -> Double) == [(Int, VisArg), (Bool, VisArg)] getRuntimeArgTys (Identity Int -> Bool -> Double) == [(Identity Int, VisArg), (Bool, VisArg)] getRuntimeArgTys (Int -> Identity (Bool -> Identity Double)) == [(Int, VisArg), (Bool, VisArg)] getRuntimeArgTys (forall a. Show a => Identity a -> a -> Int -> Bool) == [(Show a, InvisArg), (Identity a, VisArg),(a, VisArg),(Int, VisArg)] Note that, in the last case, the returned types might mention an out-of-scope type variable. This function is used only when we really care about the kinds' of the returned types, so this is OK.*Warning**: this function can return an infinite list. For example:  newtype N a = MkN (a -> N a) getRuntimeArgTys (N a) == repeat (a, VisArg) Eghc-lib-parserLike E but split off only named binders and returns +s rather than sEghc-lib-parserLike E, but returns only *invisible* binders, including constraints. Stops at the first visible binder.Eghc-lib-parserSame as E$, but stop when - you have found n +s, - or you run out of invisible bindersEghc-lib-parserGiven a  and a list of argument types, filter out any invisible (i.e., , or , ) arguments.Eghc-lib-parserGiven a . and a list of argument types, filter out any , arguments.Eghc-lib-parserGiven a list of things paired with their visibilities, partition the things into (invisible things, visible things).Eghc-lib-parserGiven a + and a list of argument types to which the 5 is applied, determine each argument's visibility (,, ,, or +).)Wrinkle: consider the following scenario: T :: forall k. k -> k tyConArgFlags T [forall m. m -> m -> m, S, R, Q]After substituting, we get T (forall m. m -> m -> m) :: (forall m. m -> m -> m) -> forall n. n -> n -> n'Thus, the first argument is invisible, S is visible, R is invisible again, and Q is visible.Eghc-lib-parserGiven a + and a list of argument types to which the 5 is applied, determine each argument's visibility (,, ,, or +).(Most of the time, the arguments will be +, but not always. Consider f :: forall a. a -> Type. In  f Type Bool, the first argument (Type) is , and the second argument (Bool) is +?. It is precisely this sort of higher-rank situation in which E comes in handy, since  f Type Bool$ would be represented in Core using As. (See also #15792).Eghc-lib-parserMake an anonymous binderEghc-lib-parser)Does this binder bind a variable that is not erased? Returns J for anonymous binders.Eghc-lib-parser)Extract a relevant type, if there is one.Eghc-lib-parserGiven a family instance TyCon and its arg types, return the corresponding family type. E.g: 1data family T a data instance T (Maybe b) = MkT b%Where the instance tycon is :RTL, so: +mkFamilyTyConApp :RTL Int = T (Maybe Int)Eghc-lib-parserGet the type on the LHS of a coercion induced by a type/data family instance.Eghc-lib-parserDoes this type classify a core (unlifted) Coercion? At either role nominal or representational (t1 ~ t2) or (t1 ~R t2) See Note [Types for coercions, predicates, and evidence] in GHC.Core.TyCo.RepEghc-lib-parserTries to compute the  / of the given type. Returns either a definite  , or H if we aren't sure (e.g. the type is representation-polymorphic).+Panics if the kind does not have the shape TYPE r.Eghc-lib-parser,Is the given type definitely unlifted? See Type#type_classification for what an unlifted type is.0Panics on representation-polymorphic types; See E for a more approximate predicate that behaves better in the presence of representation polymorphism.Eghc-lib-parserState token type.Eghc-lib-parserReturns:G if the type is  guaranteed unlifted orJ if it lifted, OR we aren't sure (e.g. in a representation-polymorphic case)Eghc-lib-parserReturns:G if the type is  guaranteed lifted orJ if it is unlifted, OR we aren't sure (e.g. in a representation-polymorphic case)Eghc-lib-parserSee Type#type_classification for what a boxed type is. Panics on representation-polymorphic types; See E for a more approximate predicate that behaves better in the presence of representation polymorphism.Eghc-lib-parser3Is this a type of kind RuntimeRep? (e.g. LiftedRep)Eghc-lib-parser+Drops prefix of RuntimeRep constructors in As. Useful for e.g. dropping 'LiftedRep arguments of unboxed tuple TyCon applications:dropRuntimeRepArgs [ 'LiftedRep, 'IntRep , String, Int ] == [String, Int]Eghc-lib-parser Int then j could be a binary join point returning an Int, but it could *not* be a unary join point returning a -> Int.4TODO: See Note [Excess polymorphism and join points]Eghc-lib-parser5Type equality on source types. Does not look through newtypes, s or type families, but it does look through type synonyms. This first checks that the kinds of the types are equal and then checks whether the types are equal, ignoring casts and coercions. (The kind check is a recursive call, but since all kinds have type Type, there is no need to check the types of kinds.) See also Note [Non-trivial definitional equality] in GHC.Core.TyCo.Rep.Eghc-lib-parser7Compare types with respect to a (presumably) non-empty -.Eghc-lib-parserType equality on lists of types, looking through type synonyms but not newtypes.Eghc-lib-parser Compare two s. NB: This should never see  Constraint (as recognized by Kind.isConstraintKindCon) which is considered a synonym for 7 in Core. See Note [Kind Constraint and kind Type] in  GHC.Core.Type*. See Note [nonDetCmpType nondeterminism]Eghc-lib-parserIs this kind equivalent to ?This considers  Constraint to be distinct from 8. For a version that treats them as the same type, see .Fghc-lib-parserIs this kind equivalent to TYPE (BoxedRep l) for some  l :: Levity?This considers  Constraint to be distinct from 8. For a version that treats them as the same type, see .Fghc-lib-parserIs this kind equivalent to TYPE r (for some unknown r)?This considers  Constraint to be distinct from *.Fghc-lib-parserReturns True if a type has a fixed runtime rep, as per Note [Fixed RuntimeRep] in GHC.Tc.Utils.Concrete.This function is equivalent to (F . E), but much faster. Precondition: The type has kind (TYPE blah)Fghc-lib-parserLooking past all pi-types, does the end result have a fixed runtime rep, as per Note [Fixed RuntimeRep] in GHC.Tc.Utils.Concrete? Examples: False for %(forall r (a :: TYPE r). String -> a) True for <(forall r1 r2 (a :: TYPE r1) (b :: TYPE r2). a -> b -> Type)Fghc-lib-parserAll type constructors occurring in the type; looking through type synonyms, but not newtypes. When it finds a Class, it returns the class TyCon.Fghc-lib-parserRetrieve the free variables in this type, splitting them based on whether they are used visibly or invisibly. Invisible ones come first.Fghc-lib-parserChecks that a kind of the form ,  Constraint or 'TYPE r is concrete. See F. Precondition: The type has kind (TYPE blah).Fghc-lib-parserTests whether the given type is concrete, i.e. it whether it consists only of concrete type constructors, concrete type variables, and applications.3See Note [Concrete types] in GHC.Tc.Utils.Concrete.Fghc-lib-parserDoes this classify a type allowed to have values? Responds True to things like *, TYPE Lifted, TYPE IntRep, TYPE v, Constraint.$True of any sub-kind of OpenTypeKindFghc-lib-parserDoes a  (that is applied to some number of arguments) need to be ascribed with an explicit kind signature to resolve ambiguity if rendered as a source-syntax type? (See Note [When does a tycon application need an explicit kind signature?]; for a full explanation of what this function checks for.)Fghc-lib-parserScale a payload by ManyFghc-lib-parserScale a payload by OneFghc-lib-parser8Scale a payload by Many; used for type arguments in coreFghc-lib-parser isLinear t returns True of a if t is a type of (curried) function where at least one argument is linear (or otherwise non-unrestricted). We use this function to check whether it is safe to eta reduce an Id in CorePrep. It is always safe to return J , because J deactivates the optimisation.Eghc-lib-parserbindersghc-lib-parserfree variables of resultEghc-lib-parserresult kindFghc-lib-parserShould specified binders count towards injective positions in the kind of the TyCon? (If you're using visible kind applications, then you want True here.ghc-lib-parserThe number of args the  is applied to.ghc-lib-parserDoes  T t_1 ... t_n need a kind signature? (Where n is the number of arguments)+++++++,,)))++,,,,,,,,,,,,,,?AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCCCCCCCCCCDDDDDDDDDDDDDDDDDDDDDDEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEFFFFFFFFFFFFFFFFFFFFFF++,,,,++++A,++AAAEEEE,+EEEEEEEAAAAAAAAEEEEEEEEEEEEEEEAAEEEEEEEEEEEEEEEEEEEEAAEEEEEEEEEEEEEDDEEEEEEEEEEEEEEDDDDDDDEEAAAAAAAAAE,,,,,,EE,,,,EEEE,,AAAEC)EEEEEEEEEEEEFEDDDDDDDDDEEEEEEEEEEEEDEEEEEFFFFFFDDFFFEEFFEEFFF))BBBBAABBBBBBFFDAFBBBBBBEEEEEEEEEEEFBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCBCCBBCCCCCCBBBBBBBBBBBBB?FFFNone 3 Fghc-lib-parserNumeric literal typeFghc-lib-parserBignat (see Note [BigNum literals])Fghc-lib-parserInt# - according to target machineFghc-lib-parserInt8# - exactly 8 bitsFghc-lib-parserInt16# - exactly 16 bitsFghc-lib-parserInt32# - exactly 32 bitsFghc-lib-parserInt64# - exactly 64 bitsFghc-lib-parserWord# - according to target machineFghc-lib-parserWord8# - exactly 8 bitsFghc-lib-parserWord16# - exactly 16 bitsFghc-lib-parserWord32# - exactly 32 bitsFghc-lib-parserWord64# - exactly 64 bitsFghc-lib-parser So-called F s are one of:An unboxed numeric literal or floating-point literal which is presumed to be surrounded by appropriate constructors (Int#2, etc.), so that the overall thing makes sense.#We maintain the invariant that the @ in the F constructor is actually in the (possibly target-dependent) range. The mkLit{Int,Word}*Wrap smart constructors ensure this by applying the target machine's wrapping semantics. Use these in situations where you know the wrapping semantics are correct.The literal derived from the label mentioned in a "foreign label" declaration (F)A F3 to be used in place of values that are never used. A characterA stringThe NULL pointerFghc-lib-parserChar#" - at least 31 bits. Create with FFghc-lib-parserAny numeric literal that can be internally represented with an Integer.Fghc-lib-parserA string-literal: stored and emitted UTF-8 encoded, we'll arrange to decode it at runtime. Also emitted with a '\0' terminator. Create with FFghc-lib-parserThe NULL pointer, the only pointer value that can be represented as a Literal. Create with FFghc-lib-parserA nonsense value of the given representation. See Note [Rubbish literals].The Type argument, rr, is of kind RuntimeRep. The type of the literal is forall (a:TYPE rr). aINVARIANT: the Type has no free variables and so substitution etc can ignore itFghc-lib-parserFloat#. Create with FFghc-lib-parserDouble#. Create with FFghc-lib-parserA label literal. Parameters::1) The name of the symbol mentioned in the declaration2) The size (in bytes) of the arguments the label expects. Only applicable with stdcall labels. Just x => ? will be appended to label name when emitting assembly.3) Flag indicating whether the symbol references a function or a dataFghc-lib-parserCoerce a literal number into another using wrapping semantics.Fghc-lib-parserNarrow a literal number by converting it into another number type and then converting it back to its original type.Fghc-lib-parser>Check that a given number is in the range of a numeric literalFghc-lib-parserGet the literal rangeFghc-lib-parserCreate a numeric F of the given typeFghc-lib-parser Creates a F of type Int#Fghc-lib-parser Creates a F of type Int#. If the argument is out of the (target-dependent) range, it is wrapped. See Note [Word Int underflow overflow]Fghc-lib-parser Creates a F of type Int# without checking its range.Fghc-lib-parser Creates a F of type Int#, as well as a ;ean flag indicating overflow. That is, if the argument is out of the (target-dependent) range the argument is wrapped and the overflow flag will be set. See Note [Word Int underflow overflow]Fghc-lib-parser Creates a F of type Word#Fghc-lib-parser Creates a F of type Word#. If the argument is out of the (target-dependent) range, it is wrapped. See Note [Word Int underflow overflow]Fghc-lib-parser Creates a F of type Word# without checking its range.Fghc-lib-parser Creates a F of type Word#, as well as a ;ean flag indicating carry. That is, if the argument is out of the (target-dependent) range the argument is wrapped and the carry flag will be set. See Note [Word Int underflow overflow]Fghc-lib-parser Creates a F of type Int8#Fghc-lib-parser Creates a F of type Int8#8. If the argument is out of the range, it is wrapped.Fghc-lib-parser Creates a F of type Int8# without checking its range.Fghc-lib-parser Creates a F of type Word8#Fghc-lib-parser Creates a F of type Word8#8. If the argument is out of the range, it is wrapped.Fghc-lib-parser Creates a F of type Word8# without checking its range.Fghc-lib-parser Creates a F of type Int16#Fghc-lib-parser Creates a F of type Int16#8. If the argument is out of the range, it is wrapped.Fghc-lib-parser Creates a F of type Int16# without checking its range.Fghc-lib-parser Creates a F of type Word16#Fghc-lib-parser Creates a F of type Word16#8. If the argument is out of the range, it is wrapped.Fghc-lib-parser Creates a F of type Word16# without checking its range.Fghc-lib-parser Creates a F of type Int32#Fghc-lib-parser Creates a F of type Int32#8. If the argument is out of the range, it is wrapped.Fghc-lib-parser Creates a F of type Int32# without checking its range.Fghc-lib-parser Creates a F of type Word32#Fghc-lib-parser Creates a F of type Word32#8. If the argument is out of the range, it is wrapped.Fghc-lib-parser Creates a F of type Word32# without checking its range.Fghc-lib-parser Creates a F of type Int64#Fghc-lib-parser Creates a F of type Int64#8. If the argument is out of the range, it is wrapped.Fghc-lib-parser Creates a F of type Int64# without checking its range.Fghc-lib-parser Creates a F of type Word64#Fghc-lib-parser Creates a F of type Word64#8. If the argument is out of the range, it is wrapped.Fghc-lib-parser Creates a F of type Word64# without checking its range.Fghc-lib-parser Creates a F of type Float#Fghc-lib-parser Creates a F of type Double#Fghc-lib-parser Creates a F of type Char#Fghc-lib-parser Creates a F of type Addr#, which is appropriate for passing to e.g. some of the "error" functions in GHC.Err such as GHC.Err.runtimeErrorFghc-lib-parserTests whether the literal represents a zero of whatever type it isFghc-lib-parserTests whether the literal represents a one of whatever type it isFghc-lib-parser Returns the @ contained in the F', for when that makes sense, i.e. for < and numbers.Fghc-lib-parser Returns the @ contained in the F', for when that makes sense, i.e. for < and numbers.Fghc-lib-parserApply a function to the @ contained in the F', for when that makes sense, e.g. for < and numbers. For fixed-size integral literals, the result will be wrapped in accordance with the semantics of the target type. See Note [Word Int underflow overflow]Fghc-lib-parser-Extend or narrow a fixed-width literal (e.g. #) to a target word-sized literal ( or ). Narrowing can only happen on 32-bit architectures when we convert a 64-bit literal into a 32-bit one.Fghc-lib-parser-Extend or narrow a fixed-width literal (e.g. #) to a target word-sized literal ( or ). Narrowing can only happen on 32-bit architectures when we convert a 64-bit literal into a 32-bit one.Fghc-lib-parserTrue if there is absolutely no penalty to duplicating the literal. False principally of strings."Why?", you say? I'm glad you asked. Well, for one duplicating strings would blow up code sizes. Not only this, it's also unsafe.Consider a program that wants to traverse a string. One way it might do this is to first compute the Addr# pointing to the end of the string, and then, starting from the beginning, bump a pointer using eqAddr# to determine the end. For instance, -- Given pointers to the start and end of a string, count how many zeros -- the string contains. countZeros :: Addr -> Addr -> -> Int countZeros start end = go start 0 where go off n | off addrEq#- end = n | otherwise = go (off  1) n' where n' | isTrue (indexInt8OffAddr off 0 == 0#) = n + 1 | otherwise = n Consider what happens if we considered strings to be trivial (and therefore duplicable) and emitted a call like countZeros "hello" ("hello" plusAddr# 5). The beginning and end pointers do not belong to the same string, meaning that an iteration like the above would blow up terribly. This is what happened in #12757.Ultimately the solution here is to make primitive strings a bit more structured, ensuring that the compiler can't inline in ways that will break user code. One approach to this is described in #8472.Fghc-lib-parser?True if code space does not go bad if we duplicate this literalFghc-lib-parserFind the Haskell  the literal occupiesGghc-lib-parserNeeded for the Ord instance of AltCon, which in turn is needed in .FFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFFNone >?GGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGG1G1G1None567>GGGGGGGGGGGGNone'(IGghc-lib-parserA SwitchPlan abstractly describes how a Switch statement ought to be implemented. See Note [createSwitchPlan]Gghc-lib-parser>A value of type SwitchTargets contains the alternatives for a  CmmSwitch value, and knows whether the value is signed, the possible range, an optional default value and a map from values to jump labels.Gghc-lib-parserThe smart constructor mkSwitchTargets normalises the map a bit: * No entries outside the range * No entries equal to the default * No default if all elements have explicit valuesGghc-lib-parser7Changes all labels mentioned in the SwitchTargets valueGghc-lib-parserReturns the list of non-default branches of the SwitchTargets valueGghc-lib-parser3Return the default label of the SwitchTargets valueGghc-lib-parser+Return the range of the SwitchTargets valueGghc-lib-parser.Return whether this is used for a signed valueGghc-lib-parserswitchTargetsToTable creates a dense jump table, usable for code generation.Also returns an offset to add to the value; the list is 0-based on the result of that addition.The conversion from Integer to Int is a bit of a wart, as the actual scrutinee might be an unsigned word, but it just works, due to wrap-around arithmetic (as verified by the CmmSwitchTest test case).Gghc-lib-parserGghc-lib-parserGraph' is abstracted over the block type, so that we can build graphs of annotated blocks for example (Compiler.Hoopl.Dataflow needs this).Gghc-lib-parserA control-flow graph, which may take any of four shapes (O/O, OC, CO, C/C). A graph open at the entry has a single, distinguished, anonymous entry point; if a graph is closed at the entry, its entry point(s) are supplied by a context.Gghc-lib-parserGives access to the anchor points for nonlocal edges as well as the edges themselvesGghc-lib-parser5A (possibly empty) collection of closed/closed blocksGghc-lib-parserMaps over all nodes in a graph.Gghc-lib-parser Function G enables a change of representation of blocks, nodes, or both. It lifts a polymorphic block transform into a polymorphic graph transform. When the block representation stabilizes, a similar function should be provided for blocks.Gghc-lib-parserReturns a list of blocks reachable from the provided Labels in the reverse postorder.This is the most important traversal over this data structure. It drops unreachable code and puts blocks in an order that is good for solving forward dataflow problems quickly. The reverse order is good for solving backward dataflow problems quickly. The forward order is also reasonably good for emitting instructions, except that it will not usually exploit Forrest Baskett's trick of eliminating the unconditional branch from a loop. For that you would need a more serious analysis, probably based on dominators, to identify loop headers.For forward analyses we want reverse postorder visitation, consider: - A -> [B,C] B -> D C -> D  Postorder: [D, C, B, A] (or [D, B, C, A]) Reverse postorder: [A, B, C, D] (or [A, C, B, D]) This matters for, e.g., forward analysis, because we want to analyze *both* B and C before we analyze D.Gghc-lib-parser"The label of a first node or blockGghc-lib-parserGives control-flow successorsGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGGNone >ghc-lib-parser3A kind of universal type, used for types and kinds. Any time a Type0 is pretty-printed, it is first converted to an  before being printed. See Note [Pretty printing via Iface syntax] in GHC.Types.TyThing.Pprghc-lib-parser;Stores the arguments in a type application as a list. See &Note [Suppressing invisible arguments].Gghc-lib-parserShow forall flag1Unconditionally show the forall quantifier with (G ) or when (G) the names used are free in the binder or when compiling with -fprint-explicit-foralls.Gghc-lib-parserDo we want to suppress kind annotations on binders? See Note [Suppressing binder signatures]Hghc-lib-parser!See Note [Holes in IfaceCoercion]Hghc-lib-parserThe various types of TyCons which have special, built-in syntax.Hghc-lib-parsera regular tyconHghc-lib-parsera tuple, e.g.  (a, b, c) or (a, b, c). The arity is the tuple width, not the tycon arity (which is twice the width in the case of unboxed tuples).Hghc-lib-parseran unboxed sum, e.g. ( a | b | c )Hghc-lib-parserA heterogeneous equality TyCon (i.e. eqPrimTyCon, eqReprPrimTyCon, heqTyCon) that is actually being applied to two types of the same kind. This affects pretty-printing only: see Note [Equality predicates in IfaceType]Hghc-lib-parserMake an H from an H.Hghc-lib-parser Build the ?: from the binders and the result kind. Keep in sync with ? in GHC.Core.TyCon.Hghc-lib-parser?Given a kind K, is K of the form (TYPE ('BoxedRep 'LiftedRep))?Hghc-lib-parser Extract an  from an H.Hghc-lib-parser"Extract the variable name from an H.Hghc-lib-parser Extract an  from an H.Hghc-lib-parser"Extract the variable name from an H.Hghc-lib-parser The type 'Many :: Multiplicity'.Hghc-lib-parserLike H, but always uses an explicit forall.Hghc-lib-parser;Render the "forall ... ." or "forall ... ->" bit of a type.Hghc-lib-parserPrints "(C a, D b) =>", including the arrow. Used when we want to print a context in a type, so we use ! to decide whether to parenthesise a singleton predicate; e.g. Num a => a -> aHghc-lib-parserPrints a context or ()- if empty You give it the context precedenceHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH++++,,GGGGGGGGGGGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHGGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH++,,,,++GGGHHHHHHHHHHHHGGGGGGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH|None5Ighc-lib-parserPrint a user-level forall; see Note [When to print foralls] in GHC.Iface.Type.Ighc-lib-parserdebugPprType is a simple pretty printer that prints a type without going through IfaceType. It does not format as prettily as the normal route, but it's much more direct, and that can be useful for debugging. E.g. with -dppr-debug it prints the kind on type-variable  occurrences1 which the normal route fundamentally cannot do.Ighc-lib-parser#Display all kind information (with -fprint-explicit-kinds) when the provided ; argument is J. See 'Note [Kind arguments in error messages] in  GHC.Tc.Errors.Ighc-lib-parserThis variant preserves any use of TYPE in a type, effectively locally setting -fprint-explicit-runtime-reps.Ighc-lib-parserPretty prints a , using the family instance in case of a representation tycon. For example: data T [a] = ...In that case we want to print T [a], where T is the family # !!!!!!IIIIIIIIIIIIIIIIIIIIII# !!!!!!IIIIIIIIIIIIIIIIIIIIIINone35˴Ighc-lib-parserTrie of [RoughMatchTc] Examples*  insert [OtherTc] 1 insert [OtherTc] 2 lookup [OtherTc] == [1,2] Ighc-lib-parser/The position only matches the specified KnownTcIghc-lib-parser1The position definitely doesn't match any KnownTcIghc-lib-parserThe position can match anythingIghc-lib-parser!Order of result is deterministic.Ighc-lib-parserN.B. Returns a  for matches, which allows us to avoid rebuilding all of the lists we find in ,, which would otherwise be necessary due to  if we returned a list. We use a list for unifiers becuase the tail is computed lazily and we often only care about the first couple of potential unifiers. Constructing a bag forces the tail which performs much too much work.>See Note [Matching a RoughMap] See Note [Matches vs Unifiers]Ighc-lib-parserFilter all elements that might match a particular key with the given predicate.IIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIINoneIghc-lib-parserPattern SynonymSee Note [Pattern synonym representation] See Note [Pattern synonym signature contexts]Ighc-lib-parserBuild a new pattern synonymIghc-lib-parserThe  of the I+, giving it a unique, rooted identificationIghc-lib-parser Should the I be presented infix?Ighc-lib-parserArity of the pattern synonymIghc-lib-parserIs this a 'vanilla' pattern synonym (no existentials, no provided constraints)?Ighc-lib-parser5Extract the type for any given labelled field of the DataConIghc-lib-parserPrint the type of a pattern synonym. The foralls are printed explicitlyIghc-lib-parser&Is the pattern synonym declared infix?ghc-lib-parser:Universially-quantified type variables and required dictsghc-lib-parser;Existentially-quantified type variables and provided dictsghc-lib-parserOriginal arguments These must have a fixed RuntimeRep as per Note [Fixed RuntimeRep] in GHC.Tc.Utils.Concrete.ghc-lib-parserOriginal result typeghc-lib-parserMatcherghc-lib-parserBuilderghc-lib-parser/Names of fields for a record pattern synonymIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIINoneҽIghc-lib-parsermkMultSup w1 w2" returns a multiplicity such that mkMultSup w1 w2 >= w1 and mkMultSup w1 w2 >= w2.. See Note [Overapproximating multiplicities].Ighc-lib-parser submult w1 w2' check whether a value of multiplicity w1+ is allowed where a value of multiplicity w2& is expected. This is a partial order.AAAADDFFFFFFIIIIIIIIIDDIIIIAAAFFFFFFIIIIIANoneJghc-lib-parser|lookupUE x env| returns the multiplicity assigned to |x| in |env|, if |x| is not bound in |env|, then returns |Zero| or |Bottom|.IIIIIIIIIIJJJJJJIIIIIJIIJJJIJJIIwNone?5ghc-lib-parser$Sometimes we want to look through a newtype< and get its associated coercion. This function strips off newtype1 layers enough to reveal something that isn't a newtype&. Specifically, here's the invariant: 5topNormaliseNewType_maybe rec_nts ty = Just (co, ty') then (a)  co : ty ~ ty'". (b) ty' is not a newtype.The function returns Nothing for non-newtypes, or unsaturated applicationsThis function does *not* look through type families, because it has no access to the type family environment. If you do have that at hand, consider to use topNormaliseType_maybe, which should be a drop-in replacement for topNormaliseNewType_maybe If topNormliseNewType_maybe ty = Just (co, ty'), then co : ty ~R ty'5ghc-lib-parserIf it is the case that c :: (t1 ~ t2)i.e. the kind of c relates t1 and t2, then coercionKind c = Pair t1 t2.5ghc-lib-parserliftCoSubst role lc ty produces a coercion (at role role) that coerces between  lc_left(ty) and  lc_right(ty) , where lc_left is a substitution mapping type variables to the left-hand types of the mapped coercions in lc, and similar for lc_right.5ghc-lib-parserMakes a coercion type from two types: the types whose equality is proven by the relevant 5ghc-lib-parserSlowly checks if the coercion is reflexive. Don't call this in a loop, as it walks over the entire coercion.5ghc-lib-parserTests if this coercion is obviously reflexive. Guaranteed to work very quickly. Sometimes a coercion can be reflexive, but not obviously so. c.f. 55ghc-lib-parserTests if this coercion is obviously a generalized reflexive coercion. Guaranteed to work very quickly.5ghc-lib-parser$Make a "coercion between coercions".5ghc-lib-parserGiven co :: (a :: k) ~ (b :: k') produce  co' :: k ~ k'.5ghc-lib-parser!Make a nominal reflexive coercion5ghc-lib-parser%Make a generalized reflexive coercion5ghc-lib-parserInstantiates a .5ghc-lib-parser Create a new  by composing the two given s transitively. (co1 ; co2)5ghc-lib-parser(Create a symmetric version of the given  that asserts equality between the same types but in the other "direction", so a kind of t1 ~ t2 becomes the kind t2 ~ t1.5ghc-lib-parser6Make a universal coercion between two arbitrary types.5ghc-lib-parserMake a phantom coercion between two types. The coercion passed in must be a nominal coercion between the kinds of the types.5ghc-lib-parserBuild a function  from two other s. That is, given  co1 :: a ~ b and  co2 :: x ~ y produce co :: (a -> x) ~ (b -> y).5ghc-lib-parserMake a Coercion from a tycovar, a kind coercion, and a body coercion. The kind of the tycovar should be the left-hand kind of the kind coercion. See Note [Unused coercion variable in ForAllCo]5ghc-lib-parserApply a  to another . The second coercion must be Nominal, unless the first is Phantom. If the first is Phantom, then the second can be either Phantom or Nominal.5ghc-lib-parserApply a type constructor to a list of coercions. It is the caller's responsibility to get the roles correct on argument coercions.5ghc-lib-parserMake a reflexive coercionJghc-lib-parser9The result of stepping in a normalisation function. See J.Jghc-lib-parserNothing more to doJghc-lib-parser2Utter failure. The outer function should fail too.Jghc-lib-parserWe stepped, yielding new bits; ^ ev is evidence; Usually a co :: old type ~ new typeJghc-lib-parserA function to check if we can reduce a type by one step. Used with J.Jghc-lib-parserTests if this MCoercion is obviously generalized reflexive Guaranteed to work very quickly.Jghc-lib-parser'Compose two MCoercions via transitivityJghc-lib-parserGet the reverse of an Jghc-lib-parserCast a type by an Jghc-lib-parserLike J, but with an Jghc-lib-parserThis breaks a  with type T A B C ~ T D E F into a list of  s of kinds A ~ D, B ~ E and E ~ F. Hence: decomposeCo 3 c [r1, r2, r3] = [nth r1 0 c, nth r2 1 c, nth r3 2 c]Jghc-lib-parser2Attempts to obtain the type variable underlying a Jghc-lib-parserAttempts to tease a coercion apart into a type constructor and the application of a number of coercion arguments to that constructorJghc-lib-parser-Attempt to take a coercion application apart.Jghc-lib-parserLike J(, but only returns Just for tyvar binderJghc-lib-parserLike J(, but only returns Just for covar binderJghc-lib-parserReturns the type coerced if this coercion is a generalized reflexive coercion. Guaranteed to work very quickly.Jghc-lib-parserReturns the type coerced if this coercion is reflexive. Guaranteed to work very quickly. Sometimes a coercion can be reflexive, but not obviously so. c.f. JJghc-lib-parserExtracts the coerced type from a reflexive coercion. This potentially walks over the entire coercion, so avoid doing this in a loop.Jghc-lib-parser*Make a representational reflexive coercionJghc-lib-parserApplies multiple  s to another  , from left to right. See also 5.Jghc-lib-parserMake nested ForAllCosJghc-lib-parserMake a Coercion quantified over a type/coercion variable; the variable has the same type in both sides of the coercionJghc-lib-parserExtract a covar, if possible. This check is dirty. Be ashamed of yourself. (It's dirty because it cares about the structure of a coercion, which is morally reprehensible.)Jghc-lib-parserReturn the left-hand type of the axiom, when the axiom is instantiated at the types given.Jghc-lib-parser5Instantiate the left-hand side of an unbranched axiomJghc-lib-parser$Make a coercion from a coercion holeJghc-lib-parser Extract the nth field of a FunCoJghc-lib-parserIf you're about to call mkNthCo r n co, then r should be whatever nthCoRole n co returns.Jghc-lib-parserGiven ty :: k1,  co :: k1 ~ k2 , produces co' :: ty ~r (ty |> co)Jghc-lib-parserGiven ty :: k1,  co :: k1 ~ k2 , produces co' :: (ty |> co) ~r tyJghc-lib-parserGiven ty :: k1,  co :: k1 ~ k2, co2:: ty ~r ty', produces @co' :: (ty |> co) ~r ty' It is not only a utility function, but it saves allocation when co is a GRefl coercion.Jghc-lib-parserGiven ty :: k1,  co :: k1 ~ k2, co2:: ty' ~r ty, produces @co' :: ty' ~r (ty |> co) It is not only a utility function, but it saves allocation when co is a GRefl coercion.Jghc-lib-parserLike , but panics if the change isn't a downgrade. See Note [Role twiddling functions]Jghc-lib-parserConverts a coercion to be nominal, if possible. See Note [Role twiddling functions]Jghc-lib-parserlike mkKindCo, but aggressively & recursively optimizes to avoid using a KindCo constructor. The output role is nominal.Jghc-lib-parserCreates a new coercion with both of its types casted by different casts !castCoercionKind2 g r t1 t2 h1 h2, where  g :: t1 ~r t2 , has type (t1 |> h1) ~r (t2 |> h2). h1 and h2 must be nominal.Jghc-lib-parsercastCoercionKind1 g r t1 t2 h = coercionKind g r t1 t2 h h That is, it's a specialised form of castCoercionKind, where the two kind coercions are identical castCoercionKind1 g r t1 t2 h, where  g :: t1 ~r t2 , has type (t1 |> h) ~r (t2 |> h). h/ must be nominal. See Note [castCoercionKind1]Jghc-lib-parserCreates a new coercion with both of its types casted by different casts castCoercionKind g h1 h2, where  g :: t1 ~r t2 , has type (t1 |> h1) ~r (t2 |> h2). h1 and h2 must be nominal. It calls coercionKindRole#, so it's quite inefficient (which I stands for) Use castCoercionKind2 instead if t1, t2, and r are known beforehand.Jghc-lib-parserGiven a family instance  and its arg $s, return the corresponding family . E.g: 1data family T a data instance T (Maybe b) = MkT bWhere the instance  is :RTL, so: mkFamilyTyConAppCo :RTL (co :: a ~# Int) = T (Maybe a) ~# T (Maybe Int)cf. EJghc-lib-parserMake a forall , where both types related by the coercion are quantified over the same variable.Jghc-lib-parserIf co :: T ts ~ rep_ty then: +instNewTyCon_maybe T ts = Just (rep_ty, co)-Checks for a newtype, and for being saturatedJghc-lib-parserTry one stepper and then try the next, if the first doesn't make progress. So if it returns NS_Done, it means that both steppers are satisfiedJghc-lib-parserA J that unwraps newtypes, careful not to fall into a loop. If it would fall into a loop, it produces J.Jghc-lib-parserA general function for normalising the top-level of a type. It continues to use the provided J until that function fails, and then this function returns. The roles of the coercions produced by the J must all be the same, which is the role returned from the call to J.Typically ev is Coercion.If topNormaliseTypeX step plus ty = Just (ev, ty') then ty ~ev1~ t1 ~ev2~ t2 ... ~evn~ ty' and ev = ev1 plus ev2 plus ... plus evn If it returns Nothing then no newtype unwrapping could happenJghc-lib-parserSyntactic equality of coercionsJghc-lib-parser Compare two s, with respect to an RnEnv2Jghc-lib-parser,Extend a lifting context with a new mapping.Jghc-lib-parserExtend a lifting context with a new mapping, and extend the in-scope setJghc-lib-parser+Erase the environments in a lifting contextJghc-lib-parserLike C , but works on a lifting contextJghc-lib-parser,Is a var in the domain of a lifting context?Jghc-lib-parser"Apply "sym" to all coercions in a JJghc-lib-parser;Extract the underlying substitution from the LiftingContextJghc-lib-parserGet the - from a 5Jghc-lib-parserApply 5 to multiple sJghc-lib-parserGet a coercion's kind and role.Jghc-lib-parser"Retrieve the role from a coercion.Jghc-lib-parserCreates a primitive type equality predicate. Invariant: the types are not CoercionsJghc-lib-parser3Makes a lifted equality predicate at the given roleJghc-lib-parser?Creates a primitive type equality predicate with explicit kindsJghc-lib-parserCreates a primitive representational type equality predicate with explicit kindsJghc-lib-parserAssuming that two types are the same, ignoring coercions, find a nominal coercion between the types. This is useful when optimizing transitivity over coercion applications, where splitting two AppCos might yield different kinds. See Note [EtaAppCo] in GHC.Core.Coercion.Opt.Kghc-lib-parser&Is there a coercion hole in this type?Kghc-lib-parser*Is there a coercion hole in this coercion?Kghc-lib-parserSet the type of a A5ghc-lib-parser!role of the created coercion, "r"ghc-lib-parser:: phi1 ~N phi2ghc-lib-parser g1 :: phi1ghc-lib-parser g2 :: phi2ghc-lib-parser :: g1 ~r g25ghc-lib-parserrole of the built coercion, "r"ghc-lib-parsert1 :: k1ghc-lib-parsert2 :: k2ghc-lib-parser :: t1 ~r t25ghc-lib-parser :: t1 ~r t2ghc-lib-parser%:: s1 ~N s2, where s1 :: k1, s2 :: k2ghc-lib-parser:: t1 s1 ~r t2 s2Jghc-lib-parser"n"ghc-lib-parsermultiplicity coercionghc-lib-parserargument coercionghc-lib-parserresult coercionghc-lib-parsernth coercion from a FunCo See Note [Function coercions] If FunCo _ mult arg_co res_co :: (s1:TYPE sk1 :mult-> s2:TYPE sk2) ~ (t1:TYPE tk1 :mult-> t2:TYPE tk2) Then we want to behave as if co was TyConAppCo mult argk_co resk_co arg_co res_co where argk_co :: sk1 ~ tk1 = mkNthCo 0 (mkKindCo arg_co) resk_co :: sk2 ~ tk2 = mkNthCo 0 (mkKindCo res_co) i.e. mkRuntimeRepCoJghc-lib-parser original LCghc-lib-parsernew variable to map...ghc-lib-parser...to this lifted versionJghc-lib-parser Original LCghc-lib-parsernew variable to map...ghc-lib-parserto this coercionJghc-lib-parsercoercion getterghc-lib-parsercallbackAA!!!!,,,44445J5555555555555555555555555555555555AAAAAAAAAABBBBBBBBBBBBBBCCCCCCIJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJKKKKAAAAAAAAAAA!!!,4444JJJJJ5555555JJJ55J55JJJJJJJJJJ555JJ555J55J5JJ5J5555J5JJJJ5JJJJJJJJJJJJJJJJJJJ5JJJ5JJJJJJJJJJJ!55JJ5JJJJJJJJJJJJJJJJJ,,JJJJBBBBBBABBBCCCCCBCBB5JJJJJJJJJJJJJJ5JJJJJJJJJJ5IJJJJJJBBJJJKKKKNone< Kghc-lib-parserK describes all the special predicates that are currently used in GHC.;These are different from the special typeclasses (such as KnownNat, Typeable,  Coercible, ...), as special predicates can't be expressed as typeclasses, as they hold evidence of a different kind.Kghc-lib-parser 'IsRefl#'.Kghc-lib-parser>A choice of equality relation. This is separate from the type 4 because 43 does not define a (non-trivial) equality relation.Kghc-lib-parserA predicate in the solver. The solver tries to prove Wanted predicates from Given ones.Kghc-lib-parserA typeclass predicate.Kghc-lib-parserA type equality predicate.Kghc-lib-parserAn irreducible predicate.Kghc-lib-parserA quantified predicate. sym kco )Kghc-lib-parser Create a K from a pair of a  and a 'Type.Pre-condition: the RHS type of the coercion matches the provided type (perhaps up to zonking).Use K! when you only have the coercion.Kghc-lib-parser4Get the original, unreduced type corresponding to a K.This is obtained by computing the LHS kind of the stored coercion, which may be slow.Kghc-lib-parserTurn a  into a K- by inspecting the RHS type of the coercion. Prefer using K when you already know the RHS type of the coercion, to avoid computing it anew.Kghc-lib-parser1Downgrade the role of the coercion stored in the K.Kghc-lib-parser1Downgrade the role of the coercion stored in the K, from 4 to 4.Kghc-lib-parser0Compose a reduction with a coercion on the left.Pre-condition: the provided coercion's RHS type must match the LHS type of the coercion that is stored in the reduction.Kghc-lib-parserThe reflexive reduction.Kghc-lib-parser Create a K from a kind cast, in which the casted type is the rewritten type.Given ty :: k1, mco :: k1 ~ k2, produces the K ty ~res_co~> (ty |> mco) at the given 4.Kghc-lib-parser Create a K from a kind cast, in which the casted type is the rewritten type.Given ty :: k1, mco :: k1 ~ k2, produces the K ty ~res_co~> (ty |> mco) at the given 4.Kghc-lib-parser Create a K from a kind cast, in which the casted type is the original (non-rewritten) type.Given ty :: k1, mco :: k1 ~ k2, produces the K (ty |> mco) ~res_co~> ty at the given 4.Kghc-lib-parser Create a K from a kind cast, in which the casted type is the original (non-rewritten) type.Given ty :: k1, mco :: k1 ~ k2, produces the K (ty |> mco) ~res_co~> ty at the given 4.Kghc-lib-parser Apply a cast to the result of a K.Given a K ty1 ~co1~> (ty2 :: k2) and a kind coercion kco with LHS kind k2, produce a new K ty1 ~co2~> ( ty2 |> kco ) of the given 4; (which must match the role of the coercion stored in the K argument).Kghc-lib-parser Apply a cast to the result of a K , using an .Given a K ty1 ~co1~> (ty2 :: k2) and a kind coercion mco with LHS kind k2, produce a new K ty1 ~co2~> ( ty2 |> mco ) of the given 4; (which must match the role of the coercion stored in the K argument).Kghc-lib-parserApply a cast to a K1, casting both the original and the reduced type.Given cast_co and K  ty ~co~> xi, this function returns the K ,(ty |> cast_co) ~return_co~> (xi |> cast_co) of the given 4; (which must match the role of the coercion stored in the K argument).Pre-condition: the  passed in is the same as the LHS type of the coercion stored in the K.Kghc-lib-parserApply casts on both sides of a K (of the given 4).Use K when you want to cast both the original and reduced types in a K using the same coercion.Pre-condition: the  passed in is the same as the LHS type of the coercion stored in the K.Kghc-lib-parser Apply one K to another. Combines 5 and .Kghc-lib-parserCreate a function K. Combines 5 and A.Kghc-lib-parser Create a K& associated to a  type, from a kind K and a body K. Combines 5 and .Kghc-lib-parser Create a K of a quantified type from a K of the body. Combines J and A.Kghc-lib-parser Create a K# from a coercion between coercions. Combines 5 and E.Kghc-lib-parserCreate a reflexive K whose RHS is the given , with the specified 4.Kghc-lib-parserCreate K. from individual lists of coercions and types.The lists should be of the same length, and the RHS type of each coercion should match the specified type in the other list.Kghc-lib-parser Combines J and E.Kghc-lib-parser TyConAppCo for K s: combines 5 and .Kghc-lib-parserReduce the arguments of a 5 .Kghc-lib-parserObtain K from a list of Ks by unzipping.Kghc-lib-parserheterogeneous reductionghc-lib-parser kind coercionKghc-lib-parser desired roleghc-lib-parser current roleKghc-lib-parser original typeghc-lib-parsercoercion to cast withghc-lib-parser'rewritten type, with rewriting coercionKghc-lib-parser original typeghc-lib-parser!coercion to cast with on the leftghc-lib-parser'rewritten type, with rewriting coercionghc-lib-parser"coercion to cast with on the rightKghc-lib-parsermultiplicity reductionghc-lib-parserargument reductionghc-lib-parserresult reductionKghc-lib-parserkind reductionghc-lib-parserbody reductionKghc-lib-parser!role of the created coercion, "r"ghc-lib-parserco :: phi1 ~N phi2ghc-lib-parser g1 :: phi1ghc-lib-parser g2 :: phi2ghc-lib-parserres_co :: g1 ~r g2)KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK)KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKNone >?9Kghc-lib-parserA K is a K which allows us to distinguish between binding forms whose binders have different types. For example, if we are doing a G lookup on (x :: Int) -> ()), we should not pick up an entry in the G for (x :: Bool) -> (): we can disambiguate this by matching on the type (or kind, if this a binder in a type) of the binder.We also need to do the same for multiplicity! Which, since multiplicities are encoded simply as a , amounts to have a Trie for a pair of types. Tries of pairs are composition.Kghc-lib-parser DeBruijn a represents a modulo alpha-renaming. This is achieved by equipping the value with a K, which tracks an on-the-fly deBruijn numbering. This allows us to define an ' instance for  DeBruijn a., even if this was not (easily) possible for a. Note: we purposely don't export the constructor. Make a helper function if you find yourself needing it.Kghc-lib-parserA K doesn't do a kind-check. Thus, when lookup up (t |> g), you'll find entries inserted under (t), even if (g) is non-reflexive.Kghc-lib-parser TypeMap a is a map from  to a. If you are a client, this is the type you want. The keys in this map may have different kinds.Kghc-lib-parser TypeMapG a is a map from  DeBruijn Type to a. The extended key makes it suitable for recursive traversal, since it can track binders, but it is strictly internal to this module. If you are including a K inside another G, this is the type you want. Note that this lookup does not do a kind-check. Thus, all keys in this map must have the same kind. Also note that this map respects the distinction between Type and  Constraint, despite the fact that they are equivalent type synonyms in Core.Kghc-lib-parser Extend a K$ with a type in the given context. 8extendTypeMapWithScope m (mkDeBruijnContext [a,b,c]) t v is equivalent to #extendTypeMap m (forall a b c. t) v<, but allows reuse of the context over multiple insertions.Kghc-lib-parserConstruct a deBruijn environment with the given variables in scope. e.g. mkDeBruijnEnv [a,b,c] constructs a context  forall a b c.Kghc-lib-parserSynthesizes a  DeBruijn a from an a9, by assuming that there are no bound binders (an empty K<). This is usually what you want if there isn't already a K in scope.(GGGGGGGGGKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKK(GGGGGGGGGKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKNone5S)Lghc-lib-parserA regular type variableLghc-lib-parser#Declare that this type variable is apart from the type provided. That is, the type variable will never be instantiated to that type. See also Note [Binding when looking up instances] in GHC.Core.InstEnv.Lghc-lib-parserWhy are two types L? L takes precedence: This is used (only) in Note [Infinitary substitution in lookup] in GHC.Core.InstEnv As of Feb 2022, we never differentiate between MARTypeFamily and MARTypeVsConstraint; it's really only MARInfinite that's interesting here.Lghc-lib-parsermatching e.g. F Int ~? BoolLghc-lib-parsermatching e.g. a ~? Maybe aLghc-lib-parsermatching Type ~? Constraint See Note [coreView vs tcView] in GHC.Core.TypeLghc-lib-parserSee Note [Unification result]Lghc-lib-parser2Some unification functions are parameterised by a L, which says whether or not to allow a certain unification to take place. A L takes the  involved along with the " it will potentially be bound to.It is possible for the variable to actually be a coercion variable (Note [Matching coercion variables]), but only when one-way matching. In this case, the  will be a A.Lghc-lib-parsertcMatchTy t1 t2) produces a substitution (over fvs(t1)) s such that s(t1) equals t2. The returned substitution might bind coercion variables, if the variable is an argument to a GADT constructor.Precondition: typeKind ty1 E typeKind ty2We don't pass in a set of "template variables" to be bound by the match, because tcMatchTy (and similar functions) are always used on top-level types, so we can bind any of the free variables of the LHS. See also Note [tcMatchTy vs tcMatchTyKi]Lghc-lib-parserLike L, but allows the kinds of the types to differ, and thus matches them as well. See also Note [tcMatchTy vs tcMatchTyKi]Lghc-lib-parserThis is similar to L, but extends a substitution See also Note [tcMatchTy vs tcMatchTyKi]Lghc-lib-parserLike L but over a list of types. See also Note [tcMatchTy vs tcMatchTyKi]Lghc-lib-parserLike L but over a list of types. See also Note [tcMatchTy vs tcMatchTyKi]Lghc-lib-parserLike L, but extending a substitution See also Note [tcMatchTy vs tcMatchTyKi]Lghc-lib-parserLike L, but extending a substitution See also Note [tcMatchTy vs tcMatchTyKi]Lghc-lib-parserThis one is called from the expression matcher, which already has a MatchEnv in handLghc-lib-parserAllow binding only for any variable in the set. Variables may be bound to any type. Used when doing simple matching; e.g. can we find a substitution S = [a :-> t1, b :-> t2] such that S( Maybe (a, b->Int ) = Maybe (Bool, Char -> Int) Lghc-lib-parser-Allow the binding of any variable to any typeLghc-lib-parserGiven a list of pairs of types, are any two members of a pair surely apart, even after arbitrary type function evaluation and substitution?Lghc-lib-parserSimple unification of two types; all type variables are bindable Precondition: the kinds are already equalLghc-lib-parserLike L, but also unifies the kindsLghc-lib-parserUnify two types, treating type family applications as possibly unifying with anything and looking through injective type family applications. Precondition: kinds are the sameLghc-lib-parserLike L but also unifies the kindsLghc-lib-parsertcUnifyTysFG bind_tv tys1 tys2! attempts to find a substitution s% (whose domain elements all respond L to bind_tv ) such that s(tys1) and that of s(tys2) are equal, as witnessed by the returned Coercions. This version requires that the kinds of the types are the same, if you unify left-to-right.Lghc-lib-parserL is sort of inverse to 5. In particular, if  liftCoMatch vars ty co == Just s, then liftCoSubst s ty == co , where == there means that the result of 5 has the same type as the original co; but may be different under the hood. That is, it matches a type against a coercion of the same "shape", and returns a lifting substitution which could have been used to produce the given coercion from the given type. Note that this function is incomplete -- it might return Nothing when there does indeed exist a possible lifting context.This function is incomplete in that it doesn't respect the equality in E. That is, it's possible that this will succeed for t1 and fail for t2, even when t1 E t2. That's because it depends on there being a very similar structure between the type and the coercion. This incompleteness shouldn't be all that surprising, especially because it depends on the structure of the coercion, which is a silly thing to do.The lifting context produced doesn't have to be exacting in the roles of the mappings. This is because any use of the lifting context will also require a desired role. Thus, this algorithm prefers mapping to nominal coercions where it can do so.Lghc-lib-parserSubstitution to extendghc-lib-parserTemplateghc-lib-parserTargetLghc-lib-parserTemplateghc-lib-parserTargetghc-lib-parserOne-shot; in principle the template variables could be free in the targetLghc-lib-parserTemplateghc-lib-parserTargetghc-lib-parserOne-shot substitutionLghc-lib-parserSubstitution to extendghc-lib-parserTemplateghc-lib-parserTargetghc-lib-parserOne-shot substitutionLghc-lib-parserSubstitution to extendghc-lib-parserTemplateghc-lib-parserTargetghc-lib-parserOne-shot substitutionLghc-lib-parsertemplate variablesghc-lib-parsertype substitution to extendghc-lib-parserTemplateghc-lib-parserTargetLghc-lib-parserTrue  =" do two-way unification; False  =: do one-way matching. See end of sec 5.2 from the paperLghc-lib-parserA regular one-shot (idempotent) substitution that unifies the erased types. See comments for L)IIIILLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL)LLLLLLLLLIIILLLLILLLLLLLLLLLLLLLLLLLLLLLLNone '(5_6 Lghc-lib-parser;Result of testing two type family equations for injectiviy.Lghc-lib-parserEither RHSs are distinct or unification of RHSs leads to unification of LHSsLghc-lib-parserRHSs unify but LHSs don't unify under that substitution. Relevant for closed type families where equation after unification might be overlpapped (in which case it is OK if they don't unify). Constructor stores axioms after unification.Lghc-lib-parser Create a L from  indices. INVARIANTS: * The fs_tvs are distinct in each FamInst of a range value of the map (so we can safely unify them)Lghc-lib-parser/Makes no particular effort to detect conflicts.Lghc-lib-parserCheck whether two type family axioms don't violate injectivity annotation.Lghc-lib-parserCreate a coercion constructor (axiom) suitable for the given newtype . The % should be that of a new coercion 4, the  s the arguments expected by the newtype8 and the type the appropriate right hand side of the newtype/, with the free variables a subset of those s.Lghc-lib-parserCheck whether an open type family equation can be added to already existing instance environment without causing conflicts with supplied injectivity annotations. Returns list of conflicting axioms (type instance declarations).Lghc-lib-parserDo an apartness check, as described in the "Closed Type Families" paper (POPL '14). This should be used when determining if an equation (4) of a closed type family can be used to reduce a certain target type family application.Lghc-lib-parserGet rid of *outermost* (or toplevel) * type function redex * data family redex * newtypes returning an appropriate Representational coercion. Specifically, if topNormaliseType_maybe env ty = Just (co, ty') then (a) co :: ty ~R ty' (b) ty' is not a newtype, and is not a type-family or data-family redexHowever, ty' can be something like (Maybe (F ty)), where (F ty) is a redex.Always operates homogeneously: the returned type has the same kind as the original type, and the returned coercion is always homogeneous.Lghc-lib-parserTry to simplify a type-family application, by *one* step If topReduceTyFamApp_maybe env r F tys = Just (HetReduction (Reduction co rhs) res_co) then co :: F tys ~R# rhs res_co :: typeKind(F tys) ~ typeKind(rhs) Type families and data families; always Representational roleLghc-lib-parser flattened target arguments. Make sure they're flattened! See Note [Flattening type-family applications when matching instances] in GHC.Core.Unify.ghc-lib-parserthe candidate equation we wish to use Precondition: this matches the targetghc-lib-parserTrue  = equation can fire;LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLL;LLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLLNone3?)ghc-lib-parserAn ) is a tyvar/type pair representing an equality made in rejigging a GADT constructor)ghc-lib-parserData Constructor Representation See Note [Data constructor workers and wrappers])ghc-lib-parserA data constructor : , ,)ghc-lib-parserReturns an Id which looks like the Haskell-source constructor by using the wrapper if it exists (see M') and failing over to the worker (see )))ghc-lib-parserThe "full signature" of the ) returns, in order:1) The result of M2) The result of )3) The non-dependent GADT equalities. Dependent GADT equalities are implied by coercion variables in return value (2).4) The other constraints of the data constructor type, excluding GADT equalities&5) The original argument types to the ) (i.e. before any change of the representation of the type) with linearity annotations#6) The original result type of the ))ghc-lib-parserThe "stupid theta" of the ) , such as  data Eq a in: data Eq a => T a = ...See Note [The stupid context].)ghc-lib-parserReturns just the instantiated value argument types of a ), (excluding dictionary args))ghc-lib-parser-The labels for the fields of this particular ))ghc-lib-parser*Source-level arity of the data constructor)ghc-lib-parsers for the type variables of the constructor, in the order the user wrote them)ghc-lib-parserThe type variables of the constructor, in the order the user wrote them)ghc-lib-parserThe existentially-quantified type/coercion variables of the constructor including dependent (kind-) GADT equalities)ghc-lib-parserThe type constructor that we are building via this data constructor)ghc-lib-parserGet the Id of the ) worker: a function that is the "actual" constructor and has no top level binding in the program. The type may be different from the obvious one written in the source program. Panics if there is no such  for this ))ghc-lib-parserThe  of the )+, giving it a unique, rooted identificationLghc-lib-parserSource Unpackedness$What unpackedness the user requestedMghc-lib-parser{- UNPACK  -} specifiedMghc-lib-parser{- NOUNPACK  -} specifiedMghc-lib-parserno unpack pragmaMghc-lib-parserSource Strictness)What strictness annotation the user wroteMghc-lib-parser Lazy, ie '~'Mghc-lib-parser Strict, ie !Mghc-lib-parserno strictness annotationMghc-lib-parserHaskell Implementation BangBangs of data constructor arguments as generated by the compiler after consulting HsSrcBang, flags, etc.Mghc-lib-parser(Lazy field, or one with an unlifted typeMghc-lib-parserStrict but not unpacked fieldMghc-lib-parser;Strict and unpacked field co :: arg-ty ~ product-ty HsBangMghc-lib-parserHaskell Source BangBangs on data constructor arguments as the user wrote them in the source code.(HsSrcBang _ SrcUnpack SrcLazy) and #(HsSrcBang _ SrcUnpack NoSrcStrict) (without StrictData) makes no sense, we emit a warning (in checkValidDataCon) and treat it like !(HsSrcBang _ NoSrcUnpack SrcLazy)Mghc-lib-parserMake a non-dependent )Mghc-lib-parserSubstitute in an ). Precondition: if the LHS of the EqSpec is mapped in the substitution, it is mapped to a type variable, not a full type.Mghc-lib-parserFilter out any s mentioned in an ).Mghc-lib-parserCompare strictness annotationsMghc-lib-parserBuild a new data constructorMghc-lib-parserThe tag used for ordering )sMghc-lib-parserThe original type constructor used in the definition of this data constructor. In case of a data family instance, that will be the family type constructor.Mghc-lib-parserThe representation type of the data constructor, i.e. the sort type that will represent values of this type at runtimeMghc-lib-parser Should the ) be presented infix?Mghc-lib-parser b -> T [a] rather than: 3T :: forall a c. forall b. (c~[a]) => a -> b -> T cThe type variables are quantified in the order that the user wrote them. See )Note [DataCon user type variable binders].NB: If the constructor is part of a data instance, the result type mentions the family tycon, not the internal one.Mghc-lib-parserFinds the instantiated types of the arguments required to construct a ) representation NB: these INCLUDE any dictionary args but EXCLUDE the data-declaration context, which is discarded It's all post-flattening etc; this is a representation typeMghc-lib-parserGiven a data constructor dc with n( universally quantified type variables a_{1}, a_{2}, ..., a_{n}&, and given a list of argument types dc_args of length m where m <= n, then: dataConInstUnivs dc dc_args  Will return: ?[dc_arg_{1}, dc_arg_{2}, ..., dc_arg_{m}, a_{m+1}, ..., a_{n}] ;That is, return the list of universal type variables with a_{1}, a_{2}, ..., a_{m} instantiated with  dc_arg_{1},  dc_arg_{2}, ...,  dc_arg_{m}. It is possible for m to be less than n, in which case the remaining n - m elements will simply be universal type variables (with their kinds possibly instantiated). Examples:Given the data constructor D :: forall a b. Foo a b and dc_args  [Int, Bool], then dataConInstUnivs D dc_args will return  [Int, Bool].Given the data constructor D :: forall a b. Foo a b and dc_args [Int], then @dataConInstUnivs D dc_args will return [Int, b].Given the data constructor E :: forall k (a :: k). Bar k a and dc_args [Type], then @dataConInstUnivs D dc_args will return [Type, (a :: Type)].This is primarily used in GHC.Tc.Deriv.* in service of instantiating data constructors' field types. See 2Note [Instantiating field types in stock deriving] for a notable example of this.Mghc-lib-parserReturns the argument types of the wrapper, excluding all dictionary arguments and without substituting for any type variablesMghc-lib-parserReturns constraints in the wrapper type, other than those in the dataConEqSpecMghc-lib-parserReturns the arg types of the worker, including *all* non-dependent evidence, after any flattening has been done and without substituting for any type variablesMghc-lib-parser The string package:module.name identifying a constructor, which is attached to its info table and used by the GHCi debugger and the heap profilerMghc-lib-parserVanilla )8s are those that are nice boring Haskell 98 constructorsMghc-lib-parser Is this the ) of a newtype?Mghc-lib-parserShould this DataCon be allowed in a type even without -XDataKinds? Currently, only Lifted & UnliftedMghc-lib-parserWere the type variables of the data con written in a different order than the regular order (universal tyvars followed by existential tyvars)?This is not a cheap test, so we minimize its use in GHC as much as possible. Currently, its only call site in the GHC codebase is in  mkDataConRep in MkId , and so M is only called at most once during a data constructor's lifetime.Mghc-lib-parserExtract the type constructor, type argument, data constructor and it's representation4 argument types from a type if it is a product type.Precisely, we return Just" for any data type that is all of:$Concrete (i.e. constructors visible)Single-constructor... which has no existentialsWhether the type is a data type or a newtype.Mghc-lib-parser"Is the constructor declared infix?ghc-lib-parser#TyConRepName for the promoted TyConghc-lib-parser(Strictness/unpack annotations, from userghc-lib-parserField labels for the constructor, if it is a record, otherwise emptyghc-lib-parser Universals.ghc-lib-parser Existentials.ghc-lib-parser User-written +/s. These must be Inferred/Specified. See Note [TyVarBinders in DataCons]ghc-lib-parserGADT equalities ghc-lib-parser0Theta-type occurring before the arguments proper ghc-lib-parserOriginal argument types ghc-lib-parserOriginal result type ghc-lib-parserSee comments on ? ghc-lib-parserRepresentation type constructorghc-lib-parserConstructor tagghc-lib-parser:The "stupid theta", context of the data declaration e.g. data Eq a => T a ...ghc-lib-parser Worker Idghc-lib-parserRepresentationMghc-lib-parserA datacon with no existentials or equality constraints However, it can have a dcTheta (notably it can be a class dictionary, with superclasses)ghc-lib-parserInstantiated at these typesMghc-lib-parserA product type, perhaps!!((((())))MMMMMMM)))))))))))))))LLLLMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMM))MMMMMMMMMMMLMMMMMMMMMLLL!M)MMMMMMM((((())M!MM))MMM)MMMMM)M))MM)MMMM)MM)MMM)MM))MMMMMMMMMMM)MMMMMMMMMMMM)None? Mghc-lib-parserGets rid of the stuff that prevents us from understanding the runtime representation of a type. Including: 1. Casts 2. Newtypes 3. Foralls 4. Synonyms But not type/data families, because we don't have the envs to hand.Mghc-lib-parserGive the demands on the arguments of a Core constructor application (Con dc args) at runtime. Assumes the constructor is not levity polymorphic. For example unboxed tuples won't work.Mghc-lib-parser True if the type has zero width.Mghc-lib-parserGiven the arguments of a sum type constructor application, return the unboxed sum rep type.E.g.( Int | Maybe Int | ( Int, Float ) #)We call `ubxSumRepType [ [IntRep], [LiftedRep], [IntRep, FloatRep] ]`, which returns [WordSlot, PtrSlot, WordSlot, FloatSlot]INVARIANT: Result slots are sorted (via Ord SlotTy), except that at the head of the list we have the slot for the tag.Mghc-lib-parser,Discovers the primitive representation of a . Returns a list of >: it's a list because of the possibility of no runtime representation (void) or multiple (unboxed tuple/sum) See also Note [Getting from RuntimeRep to PrimRep]Mghc-lib-parserLike M*, but assumes that there is precisely one > output; an empty list of PrimReps becomes a VoidRep. This assumption holds after unarise, see Note [Post-unarisation invariants]. Before unarise it may or may not hold. See also Note [RuntimeRep and PrimRep] and Note [VoidRep]Mghc-lib-parserLike M, but returns H instead of panicking, whenThe ty was not of form TYPE reprep was not monomorphicMghc-lib-parser%Find the runtime representation of a . Defined here to avoid module loops. Returns a list of the register shapes necessary. See also Note [Getting from RuntimeRep to PrimRep]Mghc-lib-parserLike M3, but assumed that there is precisely zero or one > output See also Note [Getting from RuntimeRep to PrimRep] and Note [VoidRep]Mghc-lib-parser7Take a type of kind RuntimeRep and extract the list of > that it encodes. See also Note [Getting from RuntimeRep to PrimRep] The [PrimRep] is the final runtime representation after unarisationMghc-lib-parserConvert a PrimRep back to a Type. Used only in the unariser to give types to fresh Ids. Really, only the type's representation matters. See also Note [RuntimeRep and PrimRep].>?????????????????MMMMMMMMMMMMMMMMMMMMMMMMMMMM.MMMMMMMMMM>?????????????????MMMMMMMMMMMMMMMMMMNone &Nghc-lib-parserA demand transformer> is a monotone function from an incoming evaluation context (N) to a N, describing how the denoted thing (i.e. expression, function) uses its arguments and free variables, and whether it diverges.See Note [Understanding DmdType and DmdSig] and Note [What are demand signatures?].Nghc-lib-parserThe depth of the wrapped N encodes the arity at which it is safe to unleash. Better construct this through N.. See Note [Understanding DmdType and DmdSig]Nghc-lib-parserCharacterises how an expressionEvaluates its free variables (N)Evaluates its arguments (N)$Diverges on every code path or not (N)Equality is defined modulo s in N#. See Note [Demand type Equality].Nghc-lib-parser-Demand on explicitly-mentioned free variablesNghc-lib-parserDemand on argumentsNghc-lib-parser?Whether evaluation diverges. See Note [Demand type Divergence]Nghc-lib-parserN characterises whether something surely diverges. Models a subset lattice of the following exhaustive set of divergence results: nnontermination (e.g. loops)ithrows imprecise exceptionpthrows precise exceTtioncconverges (reduces to WHNF).The different lattice elements correspond to different subsets, indicated by juxtaposition of indicators (e.g. nc definitely doesn't throw an exception, and may or may not reduce to WHNF).  Dunno (nipc) | ExnOrDiv (nip) | Diverges (ni) %As you can see, we don't distinguish n and i. See Note [Precise exceptions and strictness analysis] for why p is so special compared to i.Nghc-lib-parser5Definitely throws an imprecise exception or diverges.Nghc-lib-parserDefinitely throws a *precise* exception, an imprecise exception or diverges. Never converges, hence N! See scenario 1 in Note [Precise exceptions and strictness analysis].Nghc-lib-parser7Might diverge, throw any kind of exception or converge.Nghc-lib-parserA sub-demand describes an evaluation context5, e.g. how deep the denoted thing is evaluated. See N for examples. The nested N d of a  Cn(d) is relative- to a single such call. E.g. The expression  f 1 2 + f 3 4 puts call demand  SCS(C1(L)) on f: f is called exactly twice (S), each time exactly once (1) with an additional argument. The nested Ns dn of a N  P(d1,d2,...) apply  absolutely: If dn is a used once demand (cf. N), then that means that the denoted sub-expression is used once in the entire evaluation context described by the surrounding N. E.g., LP(ML) means that the field of the denoted expression is used at most once, although the entire expression might be used many times.See Note [Call demands are relative] and Note [Demand notation]. See also Note [Why Boxity in SubDemand and not in Demand?].Nghc-lib-parserPolymorphic demand, the denoted thing is evaluated arbitrarily deep, with the specified cardinality at every level. The   applies only to the outer evaluation context as well as all inner evaluation context. See Note [Boxity in Poly] for why we want it to carry  . Expands to  via  and to N via N.Poly b n is semantically equivalent to  Prod b [n :* Poly b n, ...] or Call n (Poly Boxed n)@.  and N do these rewrites.In Note [Demand notation]: L === P(L,L,...) and  L === CL(L), B === P(B,B,...) and  B === CB(B), !A === !P(A,A,...) and  !A === !CA(A)(, and so on.We'll only see N with N (B), N (A), N (L) and sometimes N (S) through N, never N (M) or N$ (1) (grep the source code). Hence N, which is closed under lub and plus.Nghc-lib-parser Prod b ds describes the evaluation context of a case scrutinisation on an expression of product type, where the product components are evaluated according to ds. The   b6 says whether or not the box of the product was used.Nghc-lib-parserA demand describes a scaled evaluation context, e.g. how many times and how deep the denoted thing is evaluated.-The "how many" component is represented by a N7inality. The "how deep" component is represented by a N+. Examples (using Note [Demand notation]): puts demand 1A on its first argument: It evaluates the argument strictly (1), but not any deeper (A). puts demand 1P(1L,A) on its argument: It evaluates the argument pair strictly and the first component strictly, but no nested info beyond that (L*). Its second argument is not used at all.  puts demand 1C1(L)" on its first argument: It calls (C>) the argument function with one argument, exactly once (1=). No info on how the result of that call is evaluated (L). puts demand MCM(L) on its second argument: It evaluates the argument function at most once ((M)aybe) and calls it once when it is evaluated. fst p + fst p puts demand SP(SL,A) on p: It's 1P(1L,A)# multiplied by two, so we get S4 (used at least once, possibly multiple times).#This data type is quite similar to Scaled N, but it's scaled by N, which is an interval on  Multiplicity, the upper bound of which could be used to infer uniqueness types. Also we treat N and N specially, as the concept of a N doesn't apply when there isn't any evaluation at all. If you don't care, simply use N.Nghc-lib-parser6A bottoming demand, produced by a diverging function (N), hence there is no N% that describes how it was evaluated.Nghc-lib-parser-An absent demand: Evaluated exactly 0 times (N), hence there is no N% that describes how it was evaluated.Nghc-lib-parser A subtype of N* for which the upper bound is never 1 (no N or N!). The only four inhabitants are N, N, N, N!. Membership can be tested with . See N for use sites and explanation.Nghc-lib-parser A subtype of N* for which the upper bound is never 0 (no N or N!). The only four inhabitants are N, N, N, N!. Membership can be tested with . See  and  for use sites and explanation.Nghc-lib-parserDescribes an interval of evaluation cardinalities. See Note [Evaluation cardinalities] See Note [Bit vector representation for Card]Nghc-lib-parserc :* sd" is a demand that says "evaluated c times, and each time it was evaluated, it was at least as deep as sd".Matching on this pattern synonym is a complete match. If the matched demand was N, it will match as C_00 :* seqSubDmd. If the matched demand was N, it will match as C_10 :* botSubDmd.. The builder of this pattern synonym simply discards the N if the N was absent and returns N or N< instead. It will assert that the discarded sub-demand was  and , respectively.Call sites should consider whether they really want to look at the N" of an absent demand and match on N and/or N otherwise. Really, any other N? would be allowed and might work better, depending on context.Nghc-lib-parserEvery possible cardinality; the top element, {0,1,n}. Pretty-printed as L.Nghc-lib-parserStrict and used (possibly) many times, {1,n}. Pretty-printed as S.Nghc-lib-parser.Used at most once, {0,1}. Pretty-printed as M.Nghc-lib-parser/Strict and used once, {1}. Pretty-printed as 1.Nghc-lib-parser Bottom, {}. Pretty-printed as A.Nghc-lib-parser!Absent, {0}. Pretty-printed as A.Nghc-lib-parserTrue  = lower bound is 1.Nghc-lib-parserTrue  = upper bound is 0.Nghc-lib-parserTrue  = upper bound is 1.Nghc-lib-parserIntersect with [0,1].Nghc-lib-parserDenotes D on N.Nghc-lib-parserDenotes  on lower and upper bounds of N.Nghc-lib-parserDenotes  on lower and upper bounds of N.Nghc-lib-parserA smart constructor for N6, applying rewrite rules along the semantic equality ,Prod b [n :* Poly Boxed n, ...] === Poly b n, simplifying to N Ns when possible. Examples: Rewrites P(L,L) (e.g., arguments Boxed, [L,L]) to L Rewrites  !P(L!L,L!L) (e.g., arguments Unboxed,  [L!L,L!L]) to !LDoes not rewrite P(1L), P(L!L), !P(L) or P(L,A)Nghc-lib-parser viewProd n sd interprets sd as a N of arity n , expanding N demands as necessary.Nghc-lib-parserSets   to   for the N, recursing into Ns.Nghc-lib-parserDenotes D on N.Nghc-lib-parserDenotes D on N.Nghc-lib-parserDenotes  on N.Nghc-lib-parserDenotes  on N.Nghc-lib-parser;Used to suppress pretty-printing of an uninformative demandNghc-lib-parser8Contrast with isStrictUsedDmd. See Note [Strict demands]Nghc-lib-parser7Not absent and used strictly. See Note [Strict demands]Nghc-lib-parserIs the value used at most once?Nghc-lib-parserWe try to avoid tracking weak free variable demands in strictness signatures for analysis performance reasons. See Note [Lazy and unleashable free variables] in GHC.Core.Opt.DmdAnal.Nghc-lib-parserFirst argument of 'GHC.Exts.maskAsyncExceptions#': 1C1(L). Called exactly once.Nghc-lib-parserFirst argument of 'GHC.Exts.atomically#': SCS(L)-. Called at least once, possibly many times.Nghc-lib-parserFirst argument of catch#: MCM(L). Evaluates its arg lazily, but then applies it exactly once to one argument.Nghc-lib-parserSecond argument of catch#:  MCM(C1(L)). Calls its arg lazily, but then applies it exactly once to an additional argument.Nghc-lib-parserMake a N evaluated at-most-once.Nghc-lib-parserMake a N' evaluated at-least-once (e.g. strict).Nghc-lib-parserIf the argument is a used non-newtype dictionary, give it strict demand. Also split the product type & demand and recur in order to similarly strictify the argument's contained used non-newtype superclass dictionaries. We use the demand as our recursive measure to guarantee termination.Nghc-lib-parserMake a N) lazy, setting all lower bounds (outside s) to 0.Nghc-lib-parser Wraps the N with a one-shot call demand: d -> C1(d).Nghc-lib-parsermkCalledOnceDmds n d returns C1(C1...(C1 d)) where there are n C1's.Nghc-lib-parserPeels one call level from the sub-demand, and also returns how many times we entered the lambda body.Nghc-lib-parser"See Note [Computing one-shot info]Nghc-lib-parser"See Note [Computing one-shot info]Nghc-lib-parser(saturatedByOneShots n CM(CM(...)) = True  = There are at least n nested CM(..) calls. See Note [Demand on the worker] in GHC.Core.Opt.WorkWrapNghc-lib-parser True if the N indicates that evaluation will not return. See Note [Dead ends].Nghc-lib-parserkeepAliveDmdType dt vs makes sure that the Ids in vs have some usage in the returned demand types -- they are not Absent. See Note [Absence analysis for stable unfoldings and RULES] in GHC.Core.Opt.DmdAnal.Nghc-lib-parser%Compute the least upper bound of two N*s elicited /by the same incoming demand/!Nghc-lib-parserThe demand type of doing nothing (lazy, absent, no Divergence information). Note that it is 'not' the top of the lattice (which would be "may use everything"), so it is (no longer) called topDmdType.Nghc-lib-parserWhen e is evaluated after executing an IO action that may throw a precise exception, we act as if there is an additional control flow path that is taken if e throws a precise exception. The demand type of this control flow path * is lazy and absent (N9) and boxed in all free variables and arguments * has N N> result See Note [Precise exceptions and strictness analysis]#So we can simply take a variant of N,  . Why not N? Because then the result of e can never be N4! That means failure to drop dead-ends, see #18086.Nghc-lib-parserSee N.Nghc-lib-parserTurns a N computed for the particular ! into a N unleashable at that arity. See Note [Understanding DmdType and DmdSig].Nghc-lib-parserTrue if the signature diverges or throws an exception in a saturated call. See Note [Dead ends].Nghc-lib-parser9True when the signature indicates all arguments are boxedNghc-lib-parserReturns true if an application to n args would diverge or throw an exception.If a function having N is applied to a less number of arguments than its syntactic arity, we cannot say for sure that it is going to diverge. Hence this function conservatively returns False in that case. See Note [Dead ends].Nghc-lib-parser Add extra (N7) arguments to a strictness signature. In contrast to N, this prepends8 additional argument demands. This is used by FloatOut.Nghc-lib-parserWe are expanding (x y. e) to (x y z. e z) or reducing from the latter to the former (when the Simplifier identifies a new join points, for example). In contrast to N, this appends extra arg demands if necessary. This works by looking at the N (which was produced under a call demand for the old arity) and trying to transfer as many facts as we can to the call demand of new arity. An arity increase (resulting in a stronger incoming demand) can retain much of the info, while an arity decrease (a weakening of the incoming demand) must fall back to a conservative default.Nghc-lib-parser Extrapolate a demand signature (N ) into a N.Given a function's N and a N for the evaluation context, return how the function evaluates its free variables and arguments.Nghc-lib-parser A special N for data constructors that feeds product demands into the constructor arguments.Nghc-lib-parser A special N for dictionary selectors that feeds the demand on the result into the indicated dictionary component (if saturated). See Note [Demand transformer for a dictionary selector].Nghc-lib-parser1Remove the demand environment from the signature.Nghc-lib-parser#Remove all `C_01 :*` info (but not CM sub-demands) from the demandNghc-lib-parser#Remove all `C_01 :*` info (but not CM. sub-demands) from the strictness signatureNghc-lib-parserDrop all boxityOghc-lib-parserSee Note [Demand notation] Current syntax was discussed in #19016.Oghc-lib-parserSee Note [Demand notation]Oghc-lib-parserSee Note [Demand notation]Oghc-lib-parser)We have to respect Poly rewrites through  and N.Oghc-lib-parser See Note [Demand type Equality].Nghc-lib-parserdepending on saturation NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNN NNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNone & Oghc-lib-parserThe arity of the wrapped O is the arity at which it is safe to unleash. See Note [Understanding DmdType and DmdSig] in GHC.Types.DemandOghc-lib-parserThe result of O.Oghc-lib-parserThe abstract domain A_t+ from the original 'CPR for Haskell' paper.Oghc-lib-parserNumber of value arguments the denoted expression eats before returning the OOghc-lib-parserO) eventually unleashed when applied to O argumentsOghc-lib-parser Unpacks a O-shaped O and returns the field Os wrapped in a O. Otherwise, it returns O with the appropriate O to assume for each field. The use of O( allows O(1) space for the common, non-O case.Oghc-lib-parserTurns a O computed for the particular ! into a O unleashable at that arity. See Note [Understanding DmdType and DmdSig] in GHC.Types.DemandOghc-lib-parserBNF: cpr ::= '' -- TopCpr | n -- FlatConCpr n | n '(' cpr1 ',' cpr2 ',' ... ')' -- ConCpr n [cpr1,cpr2,...] | 'b' -- BotCpr*Examples: * `f x = f x` has result CPR b" * `1(1,)` is a valid (nested) O denotation for `(I 42 , f 42)`.Oghc-lib-parserBNF: cpr_ty ::= cpr -- short form if arty == 0 | '\' arty '.' cpr -- if arty > 0Examples: * `f x y z = f x y z` has denotation `3.b` * `g !x = (x+1, x+2)` has denotation `1.1(1,1)`.Oghc-lib-parserOnly print the CPR resultOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONoneOghc-lib-parserStandardFormInfo tells whether this thunk has one of a small number of standard formsOghc-lib-parserInformation about an identifier, from the code generator's point of view. Every identifier is bound to a LambdaFormInfo in the environment, which gives the code generator enough info to be able to tail call or return that identifier.Oghc-lib-parser9Maps names in the current module to their LambdaFormInfosOghc-lib-parserCodegen-generated Id infos, to be passed to downstream via interfaces.This stuff is for optimization purposes only, they're not compulsory.When CafInfo of an imported Id is not known it's safe to treat it as CAFFY.When LambdaFormInfo of an imported Id is not known it's safe to treat it as `LFUnknown True` (which just says "it could be anything" and we do slow entry).See also Note [Conveying CAF-info and LFInfo between modules] above.Oghc-lib-parserExported Non-CAFFY closures in the current module. Everything else is either not exported of CAFFY.Oghc-lib-parser;LambdaFormInfos of exported closures in the current module.Oghc-lib-parser,The C stub which is used for IPE informationOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONoneOghc-lib-parserA constructor-like thingOghc-lib-parserIs this a 'vanilla' constructor-like thing (no existentials, no provided constraints)?Oghc-lib-parserNumber of argumentsOghc-lib-parser"Names of fields used for selectorsOghc-lib-parserReturns just the instantiated value argument types of a O, (excluding dictionary args)Oghc-lib-parser+ s for the type variables of the O. For pattern synonyms, this will always consist of the universally quantified variables followed by the existentially quantified type variables. For data constructors, the situation is slightly more complicated@see )Note [DataCon user type variable binders] in GHC.Core.DataCon.Oghc-lib-parser0Existentially quantified type/coercion variablesOghc-lib-parserThe "stupid theta" of the O , such as  data Eq a in: data Eq a => T a = ...It is empty for O* as they do not allow such contexts. See Note [The stupid context] in GHC.Core.DataCon.Oghc-lib-parserO returns True except for uni-directional pattern synonyms, which have no builderOghc-lib-parser7Returns the strictness information for each constructorOghc-lib-parser%Returns the type of the whole patternOghc-lib-parserThe "full signature" of the O returns, in order:,1) The universally quantified type variables72) The existentially quantified type/coercion variables3) The equality specification;4) The provided theta (the constraints provided by a match)<5) The required theta (the constraints required for a match)6) The original argument types (i.e. before any change of the representation of the type)7) The original result typeOghc-lib-parser5Extract the type for any given labelled field of the OOghc-lib-parser-The ConLikes that have *all* the given fieldsOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOONoneOghc-lib-parserA list of conlikes which represents a complete pattern match. These arise from COMPLETE signatures. See also Note [Implementation of COMPLETE pragmas].Oghc-lib-parser The set of O valuesOghc-lib-parser6The optional, concrete result TyCon the set applies toOOOOOOOOOOOOOONone ?SOghc-lib-parserAn efficient serialiser of .Oghc-lib-parserAn efficient deserialiser of .OOOONone OOOOOOOOOOOOOOOO Safe-Inferred 8:OOOOOPPPPPPPPPPPPPPOPPPPPPPPPPPPOOOOPPNone 2~Pghc-lib-parserAn HValueRef with a finalizerPghc-lib-parserA reference to a remote value. These are allocated and freed explicitly.Pghc-lib-parserMake a reference to a local value that we can send remotely. This reference will keep the value that it refers to alive until P is called.Pghc-lib-parserConvert an HValueRef to an HValue. Should only be used if the HValue originated in this process.Pghc-lib-parser4Release an HValueRef that originated in this processPghc-lib-parser Create a P from a P). The finalizer should arrange to call  freeHValueRef on the P. (since this function needs to be called in the process that created the P3, it cannot be called directly from the finalizer).Pghc-lib-parserUse a PPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPNone #$8Pghc-lib-parser+reference to the Nth BCO in the current setPghc-lib-parser%reference to a previously created BCOPghc-lib-parserreference to a static ptrPghc-lib-parser a nested BCOPghc-lib-parser3Resolves to the MutableArray# inside the BreakArrayPghc-lib-parserA P is one in which all the Name7 references have been resolved to actual addresses or  RemoteHValues.Note, all arrays are zero-indexed (we assume this when serializing/deserializing)Pghc-lib-parser%The Binary instance for ResolvedBCOs.Note, that we do encode the endianness, however there is no support for mixed endianness setups. This is primarily to ensure that ghc and iserv share the same endianness.PPPPPPPPPPPPPPPPPPPPPPPPPPPPPPNone'(-/23>? Pghc-lib-parserSee Note [NoGhcTc] in GHC.Hs.Extension. It has to be in this module because it is used like an extension point (in the data definitions of types that should be parameter-agnostic.Rghc-lib-parser*Maps the "normal" id type for a given passRghc-lib-parserThe trivial wrapper that carries no additional information See Note [XRec and SrcSpans in the AST]Rghc-lib-parser4We can map over the underlying type contained in an XRec( while preserving the annotation as is.Rghc-lib-parserWe can strip off the XRec to access the underlying data. See Note [XRec and SrcSpans in the AST]Sghc-lib-parserGHC's L prefixed variants wrap their vanilla variant in this type family, to add SrcLoc info via Located. Other passes than GhcPass= not interested in location information can define this as "type instance XRec NoLocated a = a*. See Note [XRec and SrcSpans in the AST]Sghc-lib-parserA placeholder type for TTG extension points that are not currently unused to represent any particular value.!This should not be confused with S', which are found in unused extension  constructors8 and therefore should never be inhabited. In contrast, S is used in extension points (e.g., as the field of some constructor), so it must have an inhabitant to construct AST passes that manipulate fields with that extension point as their type.Sghc-lib-parser=Used when constructing a term with an unused extension point.Sghc-lib-parser Eliminate a S&. See Note [Constructor cannot occur].PPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSRSRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPNone/23>?$Sghc-lib-parserGoverns the kind of expression that the tick gets placed on when annotating for example using mkTick. If we find that we want to put a tickish on an expression ruled out here, we try to float it inwards until we find a suitable expression.Sghc-lib-parserPlace ticks exactly on run-time expressions. We can still move the tick through pure compile-time constructs such as other ticks, casts or type lambdas. This is the most restrictive placement rule for ticks, as all tickishs have in common that they want to track runtime processes. The only legal placement rule for counting ticks. NB: We generally try to move these as close to the relevant runtime expression as possible. This means they get pushed through tyoe arguments. E.g. we create `(tick f) Bool` instead of `tick (f Bool)`.Sghc-lib-parserAs  PlaceRuntime, but we float the tick through all lambdas. This makes sense where there is little difference between annotating the lambda and annotating the lambda's code.Sghc-lib-parserIn addition to floating through lambdas, cost-centre style tickishs can also be moved from constructors, non-function variables and literals. For example: let x = scc ... C (scc ... y) (scc ... 3) in ...Neither the constructor application, the variable or the literal are likely to have any cost worth mentioning. And even if y names a thunk, the call would not care about the evaluation context. Therefore removing all annotations in the above example is safe.Sghc-lib-parserSpecifies the scoping behaviour of ticks. This governs the behaviour of ticks that care about the covered code and the cost associated with it. Important for ticks relating to profiling.Sghc-lib-parserNo scoping: The tick does not care about what code it covers. Transformations can freely move code inside as well as outside without any additional annotation obligationsSghc-lib-parserSoft scoping: We want all code that is covered to stay covered. Note that this scope type does not forbid transformations from happening, as long as all results of the transformations are still covered by this tick or a copy of it. For example let x = tick ...6 (let y = foo in bar) in baz ===> let x = tick ... bar; y = tick ... foo in bazIs a valid transformation as far as "bar" and "foo" is concerned, because both still are scoped over by the tick.Note though that one might object to the "let" not being covered by the tick any more. However, we are generally lax with this - constant costs don't matter too much, and given that the "let" was effectively merged we can view it as having lost its identity anyway.Also note that this scoping behaviour allows floating a tick "upwards" in pretty much any situation. For example:case foo of x -> tick ... bar ==> tick ... case foo of x -> barWhile this is always legal, we want to make a best effort to only make us of this where it exposes transformation opportunities.Sghc-lib-parserCost centre scoping: We don't want any costs to move to other cost-centre stacks. This means we not only want no code or cost to get moved out of their cost centres, but we also object to code getting associated with new cost-centre ticks - or changing the order in which they get applied.A rule of thumb is that we don't want any code to gain new annotations. However, there are notable exceptions, for example:let f = y -> foo in tick ... ... (f x) ... ==> tick ... ... foo[x/y] ...In-lining lambdas like this is always legal, because inlining a function does not change the cost-centre stack when the function is called.Sghc-lib-parserAn {- SCC -} profiling annotation, either automatically added by the desugarer as a result of -auto-all, or added by the user.Sghc-lib-parserA "tick" used by HPC to track the execution of each subexpression in the original source code.Sghc-lib-parserA breakpoint for the GHCi debugger. This behaves like an HPC tick, but has a list of free variables which will be available for inspection in GHCi when the program stops at the breakpoint.NB. we must take account of these Ids when (a) counting free variables, and (b) substituting (don't substitute for them)Sghc-lib-parserA source note.Source notes are pure annotations: Their presence should neither influence compilation nor execution. The semantics are given by causality: The presence of a source note means that a local change in the referenced source code span will possibly provoke the generated code to change. On the flip-side, the functionality of annotated code *must* be invariant against changes to all source code *except* the spans referenced in the source notes (see "Causality of optimized Haskell" paper for details).Therefore extending the scope of any given source note is always valid. Note that it is still undesirable though, as this reduces their usefulness for debugging and profiling. Therefore we will generally try only to make use of this property where it is necessary to enable optimizations.Sghc-lib-parserthe cost centreSghc-lib-parserbump the entry count?Sghc-lib-parser;scopes over the enclosed expression (i.e. not just a tick)Sghc-lib-parserthe order of this list is important: it matches the order of the lists in the appropriate entry in .9Careful about substitution! See Note [substTickish] in GHC.Core.Subst.Sghc-lib-parserSource coveredSghc-lib-parser4Name for source location (uses same names as CCs)Sghc-lib-parser)Tickish in Cmm context (annotations only)Sghc-lib-parserA "counting tick" (where tickishCounts is True) is one that counts evaluations in some way. We cannot discard a counting tick, and the compiler should preserve the number of counting ticks as far as possible.However, we still allow the simplifier to increase or decrease sharing, so in practice the actual number of ticks may vary, except that we never change the value from zero to non-zero or vice versa.Sghc-lib-parser/Returns the intended scoping rule for a TickishSghc-lib-parserReturns whether the tick scoping rule is at least as permissive as the given scoping rule.Sghc-lib-parserReturns True for ticks that can be floated upwards easily even where it might change execution counts, such as: Just (tick ... foo) ==> tick ... (Just foo)This is a combination of tickishSoftScope and  tickishCounts. Note that in principle splittable ticks can become floatable using mkNoTick -- even though there's currently no tickish for which that is the case.Sghc-lib-parserReturns True" for a tick that is both counting and> scoping and can be split into its (tick, scope) parts using S and mkNoTick respectively.Sghc-lib-parserReturn True if this source annotation compiles to some backend code. Without this flag, the tickish is seen as a simple annotation that does not have any associated evaluation code.What this means that we are allowed to disregard the tick if doing so means that we can skip generating any code in the first place. A typical example is top-level bindings: foo = tick ...% y -> ... ==> foo = y -> tick ... ...Here there is just no operational difference between the first and the second version. Therefore code generation should simply translate the code as if it found the latter.Sghc-lib-parser)Placement behaviour we want for the ticksSghc-lib-parserReturns whether one tick "contains" the other one, therefore making the second tick redundant.ghc-lib-parser6Keep track of the type of breakpoints in STG, for GHCi&SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSS&SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSNone %3?hSghc-lib-parserA clone of the T0 type but allowing annotation at every tree nodeSghc-lib-parserA clone of the T0 type but allowing annotation at every tree nodeSghc-lib-parserA clone of the T0 type but allowing annotation at every tree nodeSghc-lib-parser;Annotated core: allows annotation at every node in the treeSghc-lib-parser Binders are tagged with a tSghc-lib-parser$Case alternatives where binders are SsSghc-lib-parser!Binding groups where binders are SsSghc-lib-parser'Argument expressions where binders are SsSghc-lib-parserExpressions where binders are SsSghc-lib-parserThe common case for the type of binders and variables when we are manipulating the Core language within GHCSghc-lib-parserS& says when unfolding should take placeSghc-lib-parser Records the  unfolding of an identifier, which is approximately the form the identifier would have if we substituted its definition in for the identifier. This type should be treated as abstract everywhere except in GHC.Core.UnfoldSghc-lib-parser+We have no information about the unfolding.Sghc-lib-parser:We have no information about the unfolding, because this  came from an hi-boot1 file. See Note [Inlining and hs-boot files] in GHC.CoreToIface for what this is used for.Sghc-lib-parser%It ain't one of these constructors.  OtherCon xs also indicates that something has been evaluated and hence there's no point in re-evaluating it.  OtherCon [] is used even for non-data-type values to indicated evaluated-ness. Notably: 1data C = C !(Int -> Int) case x of { C f -> ... }Here, f gets an  OtherCon [] unfolding.Sghc-lib-parser;An unfolding with redundant cached information. Parameters:uf_tmpl: Template used to perform unfolding; NB: Occurrence info is guaranteed correct: see Note [OccInfo in unfoldings and rules]'uf_is_top: Is this a top level binding? uf_is_value:  exprIsHNF* template (cached); it is ok to discard a  on this variableuf_is_work_free: Does this waste only a little work if we expand it inside an inlining? Basically this is a cached version of exprIsWorkFree!uf_guidance: Tells us about the size of the unfolding templateTghc-lib-parserThe - in the T is a superset of variables that are currently in scope. See Note [The InScopeSet invariant].Tghc-lib-parser Rule optionsTghc-lib-parserTarget platformTghc-lib-parser-Enable more advanced numeric constant foldingTghc-lib-parserCut down precision of Rational values to that of Float/Double if disabledTghc-lib-parserEnable rules for bignumsTghc-lib-parserA T is:"Local" if the function it is a rule for is defined in the same module as the rule itself."Orphan" if nothing on the LHS is defined in the same module as the rule itselfTghc-lib-parserBuilt-in rules are used for constant folding and suchlike. They have no free variables. A built-in rule is always visible (there is no such thing as an orphan built-in rule.)Tghc-lib-parser1Name of the rule, for communication with the userTghc-lib-parserWhen the rule is activeTghc-lib-parser Name of the t at the head of this ruleTghc-lib-parser7Name at the head of each argument to the left hand sideTghc-lib-parserVariables quantified overTghc-lib-parserLeft hand side argumentsTghc-lib-parserRight hand side of the rule Occurrence info is guaranteed correct See Note [OccInfo in unfoldings and rules]Tghc-lib-parserTrue  = this rule is auto-generated (notably by Specialise or SpecConstr) False  = generated at the user's behest See Note [Trimming auto-rules] in GHC.Iface.Tidy% for the sole purpose of this field.Tghc-lib-parser  the rule was defined in, used to test if we should see an orphan rule.Tghc-lib-parser%Whether or not the rule is an orphan.Tghc-lib-parserTrue iff the fn at the head of the rule is defined in the same module as the rule and is not an implicit  (like a record selector, class operation, or data constructor). This is different from T, where a rule can avoid being an orphan if *any* Name in LHS of the rule was defined in the same module as the rule.Tghc-lib-parserNumber of arguments that T1 consumes, if it fires, including type argumentsTghc-lib-parserThis function does the rewrite. It given too many arguments, it simply discards them; the returned S is just the rewrite of T applied to the first T argsTghc-lib-parser?A full rule environment which we can apply rules from. Like a T, but it also includes the set of visible orphans we use to filter out orphan rules which are not visible (even though we can see them...)Tghc-lib-parserGathers a collection of Ts. Maps (the name of) an  to its rulesTghc-lib-parserIs this instance an orphan? If it is not an orphan, contains an ? witnessing the instance's non-orphanhood. See Note [Orphans]Tghc-lib-parserBinding, used for top level bindings in a module and local bindings in a let.Tghc-lib-parser3A case alternative constructor (i.e. pattern match)Tghc-lib-parser A literal: case e of { 1 -> ... } Invariant: always an *unlifted* literal See Note [Literal alternatives]Tghc-lib-parserTrivial alternative: case e of { _ -> ... }Tghc-lib-parserA case split alternative. Consists of the constructor leading to the alternative, the variables bound from the constructor, and the expression to be executed given that binding. The default alternative is (DEFAULT, [], rhs)Tghc-lib-parserType synonym for expressions that occur in function argument positions. Only T should contain a T at top level, general T should notTghc-lib-parserThis is the data type that represents GHCs core intermediate language. Currently GHC uses System FC  https://www.microsoft.com/en-us/research/publication/system-f-with-type-equality-coercions/ for this purpose, which is closely related to the simpler and better known System F  %http://en.wikipedia.org/wiki/System_F.We get from Haskell source to this Core language in a number of stages: The source code is parsed into an abstract syntax tree, which is represented by the data type  with the names being This syntax tree is renamed, which attaches a P to every  (yielding a ) to disambiguate identifiers which are lexically identical. For example, this program: 3 f x = let f x = x + 1 in f (x - 2) Would be renamed by having Unique,s attached so it looked something like this:  f_1 x_2 = let f_3 x_4 = x_4 + 1 in f_3 (x_2 - 2) But see Note [Shadowing] below. The resulting syntax tree undergoes type checking (which also deals with instantiating type class arguments) to yield a  type that has t as it's names.Finally the syntax tree is  desugared from the expressive  type into this T type, which has far fewer constructors and hence is easier to perform optimization, analysis and code generation on.The type parameter b3 is for the type of binders in the expression tree.0The language consists of the following elements:5Variables See Note [Variable occurrences in Core]Primitive literals.Applications: note that the argument may be a T. See Note [Core let/app invariant] See Note [Representation polymorphism invariants]Lambda abstraction See Note [Representation polymorphism invariants]Recursive and non recursive lets. Operationally this corresponds to allocating a thunk for the things bound and then executing the sub-expression.See Note [Core letrec invariant] See Note [Core let/app invariant] See Note [Representation polymorphism invariants] See Note [Core type and coercion invariant]Case expression. Operationally this corresponds to evaluating the scrutinee (expression examined) to weak head normal form and then examining at most one level of resulting constructor (i.e. you cannot do nested pattern matching directly with this).The binder gets bound to the value of the scrutinee, and the T* must be that of all the case alternatives0IMPORTANT: see Note [Case expression invariants]Cast an expression to a particular type. This is used to implement newtypes (a newtype. constructor or destructor just becomes a T in Core) and GADTs.Ticks. These are used to represent all the source annotation we support: profiling SCCs, HPC ticks, and GHCi breakpoints.;A type: this should only show up at the top level of an Arg A coercionTghc-lib-parserReturns true if T is orphan.Tghc-lib-parserReturns true if T is not an orphan.Tghc-lib-parserThe number of arguments the T4 must be applied to before the rule can match on itTghc-lib-parserThe  of the t' at the head of the rule left hand sideTghc-lib-parserSet the  of the t' at the head of the rule left hand sideTghc-lib-parserThere is no known STghc-lib-parser body) == (x -> f body)Ughc-lib-parserAttempt to remove the last N arguments of a function call. Strip off any ticks or coercions encountered along the way and any at the end.Ughc-lib-parserLike  collectArgs, but also collects looks through floatable ticks if it means that we can find more arguments.Ughc-lib-parser$Will this variable exist at runtime?Ughc-lib-parser/Will this argument expression exist at runtime?Ughc-lib-parserReturns True for value arguments, false for type args NB: coercions are value arguments (zero width, to be sure, like State#, but still value args).Ughc-lib-parserReturns True iff the expression is a T or T expression at its top levelUghc-lib-parserReturns True iff the expression is a T expression at its top levelUghc-lib-parserReturns True iff the expression is a T; expression at its top level. Note this does NOT include Ts.Ughc-lib-parser8The number of binders that bind values rather than typesUghc-lib-parserThe number of argument expressions that are values rather than types at their top levelUghc-lib-parserTakes a nested application expression and returns the function being applied and the arguments to which it is appliedUghc-lib-parserAs U but for S rather than TUghc-lib-parserAs U but for S rather than T!++++++++,SSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUTTTTTTTTTTTTTTTTTTTTTSSSSSSSSSSSST+TTTTTTT+T+++TTTTTTT+T++TUUUUUTTTTTTUUUUUUUUUUUUTTUUUU,TTTUUUUUUUUUUUUUUUUUUUUUUUUSSSSSSSSSSSSTTTTTSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTSSSSSSSSSSSSSSSSSUUUUUUUUTTTTTTTTTTTTTTTTTTTTTTT!TTTTTTTTTTTTTTTTTTTTTTTTT4T4T4T4T4YNone?1ghc-lib-parserIdentifier DetailsThe  of an Id7 give stable, and necessary, information about the Id.ghc-lib-parserIdentifier InformationAn  gives optional information about an Id. If present it never lies, but it may not be present, in which case there is always a conservative assumption which can be made.Two Id:s may have different info even though they have the same Unique (and are hence the same Id); for example, one might lack the properties attached to the other. Most of the ; gives information about the value, or definition, of the Id4, independent of its usage. Exceptions to this are U, U, U and U.!Performance note: when we update , we have to reallocate this entire record, so it is a good idea not to let this data structure get too big.ghc-lib-parser Check if an  says U.ghc-lib-parserJust a synonym for U. Written separately so it can be exported in the hs-boot file.ghc-lib-parserBasic . that carries no useful information whatsoeverUghc-lib-parserTick box for Hpc-style coverageUghc-lib-parser%Constant applicative form InformationRecords whether an Id+ makes Constant Applicative Form referencesUghc-lib-parserIndicates that the Id is for either: A function or static constructor that refers to one or more CAFs, orA real live CAFUghc-lib-parser9A function or static constructor that refers to no CAFs.Ughc-lib-parserRule Information$Records the specializations of this Id, that we know about in the form of rewrite Ts that target themUghc-lib-parserInline Pragma InformationTells when the inlining is active. When it is active the thing may be inlined, depending on how big it is.If there was an INLINE pragma, then as a separate matter, the RHS will have been made to look small with a Core inline Note The default U is  , so the info serves entirely as a way to inhibit inlining until we want itUghc-lib-parserArity InformationAn U of n, tells us that partial application of this Id to up to n-1* value arguments does essentially no work.7That is not necessarily the same as saying that it has n6 leading lambdas, because coerces may get in the way.The arity might increase later in the compilation process, if an extra lambda floats up to the binding site. Invariant: the ! of an Id must never exceed the number of value arguments that appear in the type of the Id'. See Note [Arity and function types].Ughc-lib-parserSpecialisations of the Ids function which exist. See Note [Specialisations and RULES in IdInfo]Ughc-lib-parserThe Id s unfoldingUghc-lib-parser"Any inline pragma attached to the IdUghc-lib-parserHow the Id occurs in the programUghc-lib-parserA strictness signature. Digests how a function uses its arguments if applied to at least U arguments.Ughc-lib-parserInformation on whether the function will ultimately return a freshly allocated constructor.Ughc-lib-parserID demand informationUghc-lib-parserRecursive Selector ParentUghc-lib-parserThe Id for a record selectorUghc-lib-parserThe Id is for a data constructor workerUghc-lib-parserThe Id is for a data constructor wrapperUghc-lib-parserThe Id9 is a superclass selector, or class operation of a classUghc-lib-parserThe Id is for a primitive operatorUghc-lib-parserThe Id is for a foreign call. Type will be simple: no type families, newtypes, etcUghc-lib-parserThe Id4 is for a HPC tick box (both traditional and binary)Ughc-lib-parser$A dictionary function. Bool = True  = the class has only one method, so may be implemented with a newtype, so it might be bad to be strict on this dictionaryUghc-lib-parser&A coercion variable This only covers  un-lifted coercions, of type (t1 ~ t2) or (t1 ~R t2), not their lifted variantsUghc-lib-parserAn Id< for a join point taking n arguments Note [Join points] in GHC.Core- Can also work as a StrictWorkerId if given   s. See Note [Strict Worker Ids]Ughc-lib-parserAn Id for a worker function, which expects some arguments to be passed both evaluated and tagged. See Note [Strict Worker Ids] See Note [Tag Inference]Ughc-lib-parserWhen applied, will this Id ever have a representation-polymorphic type?Ughc-lib-parser+Info about a lambda-bound variable, if the Id is oneUghc-lib-parserId arity, as computed by GHC.Core.Opt.Arity%. Specifies how many arguments this Id: has to be applied to before it doesn any meaningful work.Ughc-lib-parserId CAF infoUghc-lib-parserHow this is called. This is the number of arguments to which a binding can be eta-expanded without losing any sharing. n  =% all calls have at least n argumentsUghc-lib-parserEssentially returns the U field, but does not expose the unfolding of a strong loop breaker.This is the right thing to call if you plan to decide whether an unfolding will inline.Ughc-lib-parser True of a non-loop-breaker Id that has a stable; unfolding that is (a) always inlined; that is, with an S guidance, or (b) a DFunUnfolding which never needs to be inlinedUghc-lib-parserMore informative  we can use when we know the Id has no CAF referencesUghc-lib-parser$It is always safe to assume that an Id has an arity of 0Ughc-lib-parser1Assume that no specializations exist: always safeVghc-lib-parserRetrieve the locally-defined free variables of both the left and right hand sides of the specialization rulesVghc-lib-parserChange the name of the function the rule is keyed on all of the TsVghc-lib-parserThis is used to remove information on lambda binders that we have setup as part of a lambda group, assuming they will be applied all at once, but turn out to be part of an unsaturated lambda as in e.g: (\x1. \x2. e) arg1Vghc-lib-parserRemove all demand info on the Vghc-lib-parser.Remove usage (but not strictness) info on the Vghc-lib-parserRemove usage environment info from the strictness signature on the Vghc-lib-parser'Zap info that depends on free variablesVghc-lib-parserMarks an IdInfo describing an Id that is never representation-polymorphic (even when applied). The Type is only there for checking that it's really never representation-polymorphic.UUUUUUUUUUUUUUUUUUUUUUU !!!!!!!!!!!OUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUVVVVVVVVVVVVVVVVVVUUUUUUUUUUUUUU!UUUUU!!!U!!UVVVVVVVVVUUUUUUUUUUUUUUUUUUUUU !!!UU !!UUUVVVVUUUUUUVVUUOUUUUUUUUUVVV U1U1U1U1U1U1U1U1U1U1V1V1tNoneYVghc-lib-parserLike V, but skips non-Ids. Useful for scaling a mixed list of ids and tyvars.Vghc-lib-parserNot only does this set the  ;, it also evaluates the type to try and reduce space usageVghc-lib-parser'For an explanation of global vs. local s, see GHC.Types.Var.Var#globalvslocalVghc-lib-parserMake a global % without any extra information at allVghc-lib-parserMake a global - with no global information but some generic Vghc-lib-parser'For an explanation of global vs. local s, see GHC.Types.Var#globalvslocalVghc-lib-parserMake a local CoVarVghc-lib-parserLike V6, but checks the type to see if it should make a covarVghc-lib-parserCreate a local  that is marked as exported. This prevents things attached to it from being removed as dead code. See Note [Exported LocalIds]Vghc-lib-parserCreate a system local . These are local s (see Var#globalvslocal3) that are created by the compiler out of thin airVghc-lib-parserLike V+, but checks to see if we have a covar typeVghc-lib-parserCreate a user local . These are local s (see GHC.Types.Var#globalvslocal8) with a name and location that the user might recognizeVghc-lib-parserLike V', but checks if we have a coercion typeVghc-lib-parserWorkers get local names. CoreTidy$ will externalise these if necessaryVghc-lib-parser Create a template local: a family of system local s in bijection with Ints, typically used in unfoldingsVghc-lib-parser-Create a template local for a series of typesVghc-lib-parserCreate a template local for a series of type, but start from a specified template localVghc-lib-parserIf the , is that for a record selector, extract the U. Panic otherwise.Vghc-lib-parserDoesn't return strictness marksVghc-lib-parser*Get from either the worker or the wrapper  to the )'. Currently used only in the desugarer. INVARIANT: idDataCon (dataConWrapId d) = d : remember, ), can return either the wrapper or the workerVghc-lib-parserReturns True of an  which may not have a binding, even though it is defined in this module.Vghc-lib-parserV tells whether an s info is implied by other declarations, so we don't need to put its signature in an interface file, even if it's mentioned in some other interface unfolding.Vghc-lib-parserReturns true if an application to n args diverges or throws an exception See Note [Dead ends] in GHC.Types.Demand.Vghc-lib-parser Accesses the Id's U.Vghc-lib-parser This predicate says whether the  has a strict demand placed on it or has a type such that it can always be evaluated strictly (i.e an unlifted type, as of GHC 7.6). We need to check separately whether the  has a so-called "strict type" because if the demand for the given id hasn't been computed yet but id# has a strict type, we still want  isStrictId id to be True.Vghc-lib-parser Returns the s unfolding, but does not expose the unfolding of a strong loop breaker. See U.?If you really want the unfolding of a strong loopbreaker, call V.Vghc-lib-parserExpose the unfolding if there is one, including for loop breakersVghc-lib-parser5If all marks are NotMarkedStrict we just set nothing.Wghc-lib-parserLike W, but taking the Horrible State Hack in to account See Note [The state-transformer hack] in GHC.Core.Opt.ArityWghc-lib-parser/Returns whether the lambda associated with the  is certainly applied at most once This one is the "business end", called externally. It works on type variables as well as Ids, returning True Its main purpose is to encapsulate the Horrible State Hack See Note [The state-transformer hack] in GHC.Core.Opt.ArityWghc-lib-parser1Should we apply the state hack to values of this ?+++++,,,,,,,,,,,VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVWWWWWWWWWWWWWWWWWWWWWWWWWW,++++VVVVVVVVVVVVVVVVVVVVVVVV,,VVVVV,,,,VV,VVVVVWWWWWWWVWWVVVVV,,,VVVVVVVVVVVVVVVVVWVVV+VVVVVVVVWWWWWWWWWWWWWVVVVVVVVVVWWVWVVVVVVVVVVVVVVVVVVVVV1V1V1V1V1V1V1V1V1V1V1V1V1W1W1vNonea ghc-lib-parserA global typecheckable-thing, essentially anything that has a name. Not to be confused with a  TcTyThing, which is also a typecheckable thing but in the *local* context. See GHC.Tc.Utils.Env for how to retrieve a  given a .Wghc-lib-parserClass that abstracts out the common ability of the monads in GHC to lookup a  in the monadic environment by . Provides a number of related convenience functions for accessing particular kinds of Wghc-lib-parserDetermine the  s brought into scope by another  other than itself. For example, Id's don't have any implicit TyThings as they just bring themselves into scope, but classes bring their dictionary datatype, type constructor and some selector functions into scope, just for a start!Wghc-lib-parserReturns True if there should be no interface-file declaration for this thing on its own: either it is built-in, or it is part of some other declaration, or it is generated implicitly by some other declaration.Wghc-lib-parsertyThingParent_maybe x returns (Just p) when pprTyThingInContext should print a declaration for p (albeit with some "..." in it) when asked to show x It returns the *immediate* parent. So a datacon returns its tycon but the tycon could be the associated type of a class, so it in turn might have a parent.Wghc-lib-parserThe Names that a TyThing should bring into scope. Used to build the GlobalRdrEnv for the InteractiveContext.Wghc-lib-parserGet the  from a 4 if it is a type constructor thing. Panics otherwiseWghc-lib-parserGet the 4 from a 2 if it is a coercion axiom thing. Panics otherwiseWghc-lib-parserGet the ) from a 4 if it is a data constructor thing. Panics otherwiseWghc-lib-parserGet the O from a 5 if it is a data constructor thing. Panics otherwiseWghc-lib-parserGet the  from a < if it is a id *or* data constructor thing. Panics otherwiseWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWNonexWghc-lib-parser A map from s to s, constructed by typechecking local declarations or interface filesWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWNone S)ghc-lib-parser'Type constructor for n-ary unboxed sum.)ghc-lib-parser=Data constructor for i-th alternative of a n-ary unboxed sum.)ghc-lib-parserSpecialization of  for tuples)ghc-lib-parser "type LiftedRep = 'BoxedRep 'Lifted)ghc-lib-parser &type UnliftedRep = 'BoxedRep 'Unlifted)ghc-lib-parser .type UnliftedType = TYPE ('BoxedRep 'Unlifted))ghc-lib-parserBuild the type of a small tuple that holds the specified type of thing Flattens 1-tuples. See Note [One-tuples].Wghc-lib-parserMake a fake, recovery  from an existing one. Used when recovering from errors in type declarationsWghc-lib-parserBuilt-in syntax isn't "in scope" so these OccNames map to wired-in Names with BuiltInSyntax. However, this should only be necessary while resolving names produced by Template Haskell splices since we take care to encode built-in syntax names specially in interface files. See Note [Symbol table representation of names].Moreover, there is no need to include names of things that the user can't write (e.g. type representation bindings like $tc(,,,)).Wghc-lib-parserIf the given name is that of a constraint tuple, return its arity.Xghc-lib-parserSpecialization of  for sumsXghc-lib-parser,Make a tuple type. The list of types should not include any RuntimeRep specifications. Boxed 1-tuples are flattened. See Note [One-tuples]Xghc-lib-parser,Make a tuple type. The list of types should not include any RuntimeRep specifications. Boxed 1-tuples are *not* flattened. See Note [One-tuples] and Note [Don't flatten tuples from HsSyn] in  GHC.Core.MakeXghc-lib-parserMake a *promoted* list.Xghc-lib-parser>Replaces constraint tuple names with corresponding boxed ones.Xghc-lib-parserof the elements of the listghc-lib-parserelements))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))));<@WWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXWWWWXXWWXXWXXWXXXXXXXXXXXXXXXW)XWWXXXWXXXWXXWWWXXXWXXXX)WW;XW(ghc-lib-parser(< is an abstract type that supports the following operations:Pretty printingIn a C file, does it need to be declared before use? (i.e. is it guaranteed to be already in scope in the places we need to refer to it?)If it needs to be declared, what type (code or data) should it be declared to have?.Is it visible outside this object file or not?#Is it "dynamic" (see details below)Eq and Ord, so that we can make sets of CLabels (currently only used in outputting C as far as I can tell, to avoid generating more than one declaration for any given label).3Converting an info table label into an entry label.CLabel usage is a bit messy in GHC as they are used in a number of different contexts:!By the C-- AST to identify labelsBy the unregisterised C code generator ("PprC") for naming functions (hence the name ()9By the native and LLVM code generators to identify labelsFor extra fun, each of these uses a slightly different subset of constructors (e.g.  and / are used only in the NCG and LLVM backends).In general, we use  to represent Haskell things early in the pipeline. However, later optimization passes will often represent blocks they create with  where there is no obvious  to hang off the label.aghc-lib-parserInfo Table Provenance Entry See Note [Mapping Info Tables to Source Positions]aghc-lib-parser=Which module is the info table from, and which number was it.bghc-lib-parser'Record where a foreign label is stored.bghc-lib-parserLabel is in a named packagebghc-lib-parserLabel is in some external, system package that doesn't also contain compiled Haskell code, and is not associated with any .hi files. We don't have to worry about Haskell code being inlined from external packages. It is safe to treat the RTS package as "external".bghc-lib-parserLabel is in the package currently being compiled. This is only used for creating hacky tmp labels during code generation. Don't use it in any code that might be inlined across a package boundary (ie, core code) else the information will be wrong relative to the destination module.bghc-lib-parser Indicate if  GHC.CmmToC has to generate an extern declaration for the label (e.g. "extern StgWordArray(foo)"). The type is fixed to StgWordArray.Symbols from the RTS don't need "extern" declarations because they are exposed via "rtsinclude&Stg.h" with the appropriate type. See b.The fixed StgWordArray type led to "conflicting types" issues with user provided Cmm files (not in the RTS) that declare data of another type (#15467 and test for #17920). Hence the Cmm parser considers that labels in data sections don't need the "extern" declaration (just add one explicitly if you need it).See  https://gitlab.haskell.org/ghc/ghc/-/wikis/commentary/compiler/backends/ppr-c#prototypes/ for why extern declaration are needed at all.bghc-lib-parserFor debugging problems with the CLabel representation. We can't make a Show instance for CLabel because lots of its components don't have instances. The regular Outputable instance only shows the label name, and not its other info.bghc-lib-parserDecicdes between external and local labels based on the names externality.bghc-lib-parserMake a foreign labelbghc-lib-parser-Update the label size field in a ForeignLabelbghc-lib-parser+Whether label is a top-level string literalbghc-lib-parser8Whether label is a non-haskell label (defined in C code)bghc-lib-parserWhether label is a static closure label (can come from haskell or cmm)bghc-lib-parser Whether label is a .rodata labelbghc-lib-parser2Whether label is points to some kind of info tablebghc-lib-parser1Whether label is points to constructor info tablebghc-lib-parser,Get the label size field from a ForeignLabelbghc-lib-parser*A label indicating the end of a procedure.bghc-lib-parserConstruct a label for a DWARF Debug Information Entity (DIE) describing another symbol.bghc-lib-parser7If a label is a local block label then return just its G , otherwise H.bghc-lib-parserCheck whether a label corresponds to a C function that has a prototype in a system header somewhere, or is built-in to the C compiler. For these labels we avoid generating our own C prototypes.bghc-lib-parserIs a CLabel visible outside this object file or not? From the point of view of the code generator, a name is externally visible if it has to be declared as exported in the .o file's symbol table; that is, made non-static.bghc-lib-parserIs a (. defined in the current module being compiled?Sometimes we can optimise references within a compilation unit in ways that we couldn't for inter-module references. This provides a conservative estimate of whether a ( lives in the current module.bghc-lib-parserDoes a ( need dynamic linkage?When referring to data in code, we need to know whether that data resides in a DLL or not. [Win32 only.]  labelDynamic returns True if the label is located in a DLL, be it a data reference or not.bghc-lib-parser;Generate a label for a procedure internal to a module (if Opt_ExposeAllSymbols/ is enabled). See Note [Internal proc labels].bghc-lib-parserDon't depend on this if you need determinism. No determinism in the ncg backend, so we use the unique for Ord. Even if it pains me slightly.bghc-lib-parserthe current moduleghc-lib-parserthe internal proc label((aaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbb(bbbbbbaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbb(bbbbNonelcghc-lib-parserA map storing all the different uses of a specific data constructor and the approximate source position that usage arose from. The ? is an incrementing identifier which distinguishes each usage of a constructor in a module. It is paired with the source position the constructor was used at, if possible and a string which names the source location. This is the same information as is the payload for the  constructor.cghc-lib-parser A map from a ? to the best approximate source position that name arose from.cghc-lib-parserPosition and information about an info table. For return frames these are the contents of a . ccccccccc cccccccccNone>GGcccGGcccNone >?cghc-lib-parserSets of registerscghc-lib-parser'Parameters: 1. Identifier 2. Typecghc-lib-parserA stack area is either the stack slot where a variable is spilled or the stack space where function arguments and results are passed.cghc-lib-parserReturns an alignment in bytes of a CmmExpr when it's a statically known integer constant, otherwise returns an alignment of 1 byte. The caller is responsible for using with a sensible CmmExpr argument.%%%%%%%&&&&&%&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&''''''''''''''''''''''''''''''''''''''''''''''''''''&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''((((((((((((((((((((((((((((((((((((((((ccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccNoneddddddddddddNoneddddddddddddNonePddddddddddNoneddddddddddNoneddddddddddNoneddddddddddNone@ddddddddddNone|ddddddddddNonedghc-lib-parserReturns J if this global register is stored in a caller-saves machine register.dghc-lib-parserHere is where the STG register map is defined for each target arch. The order matters (for the llvm backend anyway)! We must make sure to maintain the order here with the order used in the LLVM calling conventions. Note that also, this isn't all registers, just the ones that are currently possibly mapped to real registers.ddddddddddNone #$  dghc-lib-parser6All the information about the breakpoints for a moduledghc-lib-parserThe array of flags, one per breakpoint, indicating which breakpoints are enabled.dghc-lib-parser3An array giving the source span of each breakpoint.dghc-lib-parserAn array giving the names of the free variables at each breakpoint.dghc-lib-parserAn array giving the names of the declarations enclosing each breakpoint. See Note [Field modBreaks_decls]dghc-lib-parser1Array pointing to cost centre for each breakpointdghc-lib-parser6info about each breakpoint from the bytecode generatordghc-lib-parserC CostCentre typedghc-lib-parserBreakpoint indexdghc-lib-parserInformation about a breakpoint that we know at code-generation timedghc-lib-parserConstruct an empty ModBreaks;ddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd;dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddNone >? eghc-lib-parser CoreMap a is a map from S to a3. If you are a client, this is the type you want.GGGGGGGGGGGGGKKKKeeeeeeeeeeeeeeGGGGGGGGGGKKKKGGGNone ueghc-lib-parserEvery node in an expression annotated with its (non-global) free variables, both Ids and TyVars, and type.eghc-lib-parserEvery node in an expression annotated with its (non-global) free variables, both Ids and TyVars, and type. NB: see Note [The FVAnn invariant]eghc-lib-parserEvery node in a binding group annotated with its (non-global) free variables, both Ids and TyVars, and type.eghc-lib-parserFind all locally-defined free Ids or type variables in an expression returning a non-deterministic set.eghc-lib-parserFind all locally-defined free Ids or type variables in an expression returning a deterministic set.eghc-lib-parserFind all locally-defined free Ids or type variables in an expression returning a deterministically ordered list.eghc-lib-parser2Find all locally-defined free Ids in an expressioneghc-lib-parserFind all locally-defined free Ids in an expression returning a deterministic set.eghc-lib-parserFind all locally-defined free Ids in an expression returning a deterministically ordered list.eghc-lib-parserFind all locally-defined free Ids in several expressions returning a deterministic set.eghc-lib-parserFind all locally-defined free Ids in several expressions returning a deterministically ordered list.eghc-lib-parserFind all locally-defined free Ids or type variables in several expressions returning a non-deterministic set.eghc-lib-parserFind all locally-defined free Ids or type variables in several expressions returning a deterministically ordered list.eghc-lib-parser4Find all locally defined free Ids in a binding groupeghc-lib-parser=Finds free variables in an expression selected by a predicateeghc-lib-parserFinds free variables in an expression selected by a predicate returning a deterministically ordered list.eghc-lib-parserFinds free variables in several expressions selected by a predicateeghc-lib-parserFinds free variables in several expressions selected by a predicate returning a deterministically ordered list.eghc-lib-parserFinds the free external# names of several expressions: see « for detailseghc-lib-parserorphNamesOfAxiom collects the names of the concrete types and type constructors that make up the LHS of a type family instance, including the family name itself.For instance, given `type family Foo a b`: `type instance Foo (F (G (H a))) b = ...` would yield [Foo,F,G,H].Used in the implementation of ":info" in GHCi.eghc-lib-parserThose variables free in the right hand side of a rule returned as a non-deterministic seteghc-lib-parserThose locally-defined free s in the right hand side of several rules returned as a non-deterministic seteghc-lib-parserThis finds all locally-defined free Ids on the left hand side of a rule and returns them as a non-deterministic seteghc-lib-parserThis finds all locally-defined free Ids on the left hand side of a rule and returns them as a deterministically ordered listeghc-lib-parserThose variables free in the both the left right hand sides of a rule returned as a non-deterministic seteghc-lib-parserThose variables free in the both the left right hand sides of rules returned as a deterministic seteghc-lib-parserThose variables free in both the left right hand sides of several ruleseghc-lib-parserMake a U containing a number of T!s, suitable for putting into an eghc-lib-parserInverse function to eeghc-lib-parser$Extract the vars reported in a FVAnneghc-lib-parser Annotate a S with its (non-global) free type and value variables at every tree node.eghc-lib-parser Says which s are interestingeghc-lib-parser Says which s are interesting4-eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee4eeeeeeeeeeee-eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeNone :b$eghc-lib-parserRecover the type of a well-typed Core expression. Fails when applied to the actual T7 expression as it cannot really be said to have a typeeghc-lib-parser4Returns the type of the alternatives right hand sideeghc-lib-parserReturns the type of the first alternative, which should be the same as for all alternativeseghc-lib-parserMakes a (->) type or an implicit forall type, depending on whether it is given a type variable or a term variable. This is used, for example, when producing the type of a lambda. Always uses Inferred binders.eghc-lib-parsere% for multiple type or value argumentseghc-lib-parserA more efficient version of U when we have several arguments. The first argument is just for debugging, and gives some contexteghc-lib-parserWrap the given expression in the coercion safely, dropping identity coercions and coalescing nested coercionseghc-lib-parserWraps the given expression in the source annotation, dropping the annotation if possible.eghc-lib-parser b }&depending on whether we have to use a case or let" binding for the expression (see e). It's used by the desugarer to avoid building bindings that give Core Lint a heart attack, although actually the simplifier deals with them perfectly well. See also eghc-lib-parserTests whether we have to use a case rather than let7 binding for this expression as per the invariants of S: see GHC.Core#let_app_invarianteghc-lib-parserThis guy constructs the value that the scrutinee must have given that you are in one particular branch of a caseeghc-lib-parser$Extract the default case alternativeeghc-lib-parserFind the case alternative corresponding to a particular constructor: panics if no such constructor existseghc-lib-parserMerge alternatives preserving order; alternatives in the first argument shadow ones in the secondeghc-lib-parserGiven: )case (C a b x y) of C b x y -> ...We want to drop the leading type argument of the scrutinee leaving the arguments to match against the patterneghc-lib-parser$Refine the default alternative to a T, if there is a unique way to do so. See Note [Refine DEFAULT case alternatives]fghc-lib-parserf' returns True of an expression that is:Safe to evaluate even if normal order eval might not evaluate the expression at all, orSafe not- to evaluate even if normal order would do soIt is usually called on arguments of unlifted type, but not always In particular, Simplify.rebuildCase calls it on lifted types when a 'case' is a plain . See the example in Note [exprOkForSpeculation: case expressions] belowPrecisely, it returns True iff: a) The expression guarantees to terminate, b) soon, c) without causing a write side effect (e.g. writing a mutable variable) d) without throwing a Haskell exception e) without risking an unchecked runtime exception (array out of bounds, divide by zero)For exprOkForSideEffects( the list is the same, but omitting (e).Note that exprIsHNF implies exprOkForSpeculation exprOkForSpeculation implies exprOkForSideEffects3See Note [PrimOp can_fail and has_side_effects] in GHC.Builtin.PrimOps and Note [Transformations affected by can_fail and has_side_effects];As an example of the considerations in this test, consider: -let x = case y# +# 1# of { r# -> I# r# } in Ebeing translated to: 3case y# +# 1# of { r# -> let x = I# r# in E }We can only do this if the y + 1 is ok for speculation: it has no side effects, and can't diverge or raise an exception.fghc-lib-parserf' returns True of an expression that is:Safe to evaluate even if normal order eval might not evaluate the expression at all, orSafe not- to evaluate even if normal order would do soIt is usually called on arguments of unlifted type, but not always In particular, Simplify.rebuildCase calls it on lifted types when a 'case' is a plain . See the example in Note [exprOkForSpeculation: case expressions] belowPrecisely, it returns True iff: a) The expression guarantees to terminate, b) soon, c) without causing a write side effect (e.g. writing a mutable variable) d) without throwing a Haskell exception e) without risking an unchecked runtime exception (array out of bounds, divide by zero)For exprOkForSideEffects( the list is the same, but omitting (e).Note that exprIsHNF implies exprOkForSpeculation exprOkForSpeculation implies exprOkForSideEffects3See Note [PrimOp can_fail and has_side_effects] in GHC.Builtin.PrimOps and Note [Transformations affected by can_fail and has_side_effects];As an example of the considerations in this test, consider: -let x = case y# +# 1# of { r# -> I# r# } in Ebeing translated to: 3case y# +# 1# of { r# -> let x = I# r# in E }We can only do this if the y + 1 is ok for speculation: it has no side effects, and can't diverge or raise an exception.fghc-lib-parser:exprIsHNF returns true for expressions that are certainly already evaluated to head normal form. This is used to decide whether it's ok to change: case x of _ -> einto: e-and to decide whether it's safe to discard a . So, it does not treat variables as evaluated, unless they say they are. However, it does treat partial applications and constructor applications as values, even if their arguments are non-trivial, provided the argument type is lifted. For example, both of these are values: &(:) (f x) (map f xs) map (...redex...)because & on such things completes immediately.3For unlifted argument types, we have to be careful: C (f x :: Int#)Suppose f x diverges; then C (f x)1 is not a value. However this can't happen: see GHC.Core#let_app_invariant. This invariant states that arguments of unboxed type must be ok-for-speculation (or trivial).fghc-lib-parser Similar to f but includes CONLIKE functions as well as data constructors. Conlike arguments are considered interesting by the inliner.fghc-lib-parserCan we bind this S at the top level?fghc-lib-parserCheck if the expression is zero or more Ticks wrapped around a literal string.fghc-lib-parserExtract a literal string from an expression that is zero or more Ticks wrapped around a literal string. Returns Nothing if the expression has a different shape. Used to "look through" Ticks in places that need to handle literal strings.fghc-lib-parserA cheap equality test which bales out fast! If it returns True the arguments are definitely equal, otherwise, they may or may not be equal.fghc-lib-parser9Cheap expression equality test, can ignore ticks by type.fghc-lib-parser-Finds differences between core bindings, see diffExpr.The main problem here is that while we expect the binds to have the same order in both lists, this is not guaranteed. To do this properly we'd either have to do some sort of unification or check all possible mappings, which would be seriously expensive. So instead we simply match single bindings as far as we can. This leaves us just with mutually recursive and/or mismatching bindings, which we then speculatively match by ordering them. It's by no means perfect, but gets the job done well enough.%Only used in GHC.Core.Lint.lintAnnotsfghc-lib-parserCan we eta-reduce the given function to the specified arity? See Note [Eta reduction conditions].fghc-lib-parserTrue if the type has no non-bottom elements, e.g. when it is an empty datatype, or a GADT with non-satisfiable type parameters, e.g. Int :~: Bool. See Note [Bottoming expressions]See Note [No alternatives lint check] for another use of this function.fghc-lib-parserIf 1normSplitTyConApp_maybe _ ty = Just (tc, tys, co) then ty |> co = tc tys. It's #, but looks through coercions via L. Hence the "norm" prefix.fghc-lib-parser-collectMakeStaticArgs (makeStatic t srcLoc e) yields Just (makeStatic, t, srcLoc, e).Returns Nothing for every other expression.fghc-lib-parserDoes this binding bind a join point (or a recursive group of join points)?fghc-lib-parserFor a binding we: * Look at the args * Mark any with Unf=OtherCon[] as call-by-value, unless it's an unlifted type already. * Potentially combine it with existing call-by-value marks (from ww) * Update the id See Note [Attaching CBV Marks to ids].eghc-lib-parserCase alternative constructorghc-lib-parser!Things bound by the pattern matchghc-lib-parser*The type arguments to the case alternativeeghc-lib-parserType constructor of scrutinee's type (used to prune possibilities)ghc-lib-parserAnd its type argumentsghc-lib-parser imposs_cons: constructors known to be impossible due to the form of the scrutineeghc-lib-parser Alternativeseghc-lib-parser$Uniques for constructing new bindersghc-lib-parser.Multiplicity annotation of the case expressionghc-lib-parser$Type constructor of scrutinee's typeghc-lib-parser"Type arguments of scrutinee's typeghc-lib-parser3Constructors that cannot match the DEFAULT (if any)ghc-lib-parserJ', if a default alt was replaced with a TIUUUeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeffffffffffffffffffffffffffffffffffffeeeeeeeeeeeeeeeeeeefefeeeeeIffffffffefffffffeffffffffffUUeUffffeeeeefffffNone ;ffffffffNone P fghc-lib-parser$An environment for substituting for sfghc-lib-parser'A substitution environment, containing , , and , substitutions.6Some invariants apply to how you use the substitution: %Note [The substitution invariant] in GHC.Core.TyCo.Subst(Note [Substitutions apply only once] in GHC.Core.TyCo.Substfghc-lib-parserFind the in-scope set: see GHC.Core.TyCo.Subst" Note [The substitution invariant]fghc-lib-parserRemove all substitutions for s and s that might have been built up while preserving the in-scope setfghc-lib-parserAdd a substitution for an  to the f: you must ensure that the in-scope set is such that TyCoSubst Note [The substitution invariant] holds after extending the substitution like thisfghc-lib-parserAdds multiple  substitutions to the f : see also ffghc-lib-parserAdd a substitution for a  to the f The  *must* be a real TyVar, and not a CoVar You must ensure that the in-scope set is such that GHC.Core.TyCo.Subst Note [The substitution invariant] holds after extending the substitution like this.fghc-lib-parserAdds multiple  substitutions to the f : see also ffghc-lib-parserAdd a substitution from a , to a  to the f4: you must ensure that the in-scope set satisfies GHC.Core.TyCo.Subst Note [The substitution invariant] after extending the substitution like thisfghc-lib-parserAdd a substitution appropriate to the thing being substituted (whether an expression, type, or coercion). See also f, f, ffghc-lib-parserAdd a substitution as appropriate to each of the terms being substituted (whether expressions, types, or coercions). See also f.fghc-lib-parserFind the substitution for an  in the ffghc-lib-parserSimultaneously substitute for a bunch of variables No left-right shadowing ie the substitution for (x y. e) a1 a2 so neither x nor y scope over a1 a2fghc-lib-parserAdd the  to the in-scope set: as a side effect, and remove any existing substitutions for itfghc-lib-parserAdd the  s to the in-scope set: see also ffghc-lib-parserOptimized version of f that can be used if you are certain all the things being added are s and hence none are s or ,sfghc-lib-parser.substExpr applies a substitution to an entire S1. Remember, you may only apply the substitution once/: See Note [Substitutions apply only once] in GHC.Core.TyCo.SubstDo *not* attempt to short-cut in the case of an empty substitution! See Note [Extending the Subst]fghc-lib-parser"Apply a substitution to an entire S$, additionally returning an updated f2 that should be used by subsequent substitutions.fghc-lib-parser"Apply a substitution to an entire S$, additionally returning an updated f2 that should be used by subsequent substitutions.fghc-lib-parserDe-shadowing the program is sometimes a useful pre-pass. It can be done simply by running over the bindings with an empty substitution, because substitution returns a result that has no-shadowing guaranteed.(Actually, within a single type* there might still be shadowing, because f is a no-op for the empty substitution, but that's probably OK.) Aug 09This function is not used in GHC at the moment, but seems so short and simple that I'm going to leave it herefghc-lib-parserSubstitutes a " for another one according to the f- given, returning the result and an updated f3 that should be used by subsequent substitutions.  is preserved by this process, although it is substituted into appropriately.fghc-lib-parserApplies f to a number of s, accumulating a new f left-to-rightfghc-lib-parser,Substitute in a mutually recursive group of sfghc-lib-parserVery similar to f , but it always allocates a new  for each variable in its output. It substitutes the IdInfo though.fghc-lib-parserApplies f to a number of 8s, accumulating a final substitution from left to rightfghc-lib-parser$Clone a mutually recursive group of sfghc-lib-parserSee x.fghc-lib-parserSee Cfghc-lib-parserSubstitute into some ! with regard to the supplied new .fghc-lib-parserSubstitutes for the *s within an unfolding NB: substUnfolding discards any unfolding without without a Stable source. This is usually what we want, but it may be a bit unexpectedfghc-lib-parserSubstitutes for the *s within an unfolding NB: substUnfolding discards any unfolding without without a Stable source. This is usually what we want, but it may be a bit unexpectedfghc-lib-parserSubstitutes for the  s within the U given the new function 8-BBfffffffffffffffffffffffffffffffffffffffffffffffffffff8ffBf-fffffffffffffffffffffffffBfffffffffffffffffffffffffNone Qfghc-lib-parserGet primop id.Retrieve it from ë cache.fghc-lib-parserAll the primop ids, as a listffffNone'(2>? _ fghc-lib-parserTick scope identifier, allowing us to reason about what annotations in a Cmm block should scope over. We especially take care to allow optimisations to reorganise blocks without losing tick association in the process.fghc-lib-parserThe global scope is the "root" of the scope graph. Every scope is a sub-scope of the global scope. It doesn't make sense to add ticks to this scope. On the other hand, this means that setting this scope on a block means no ticks apply to it.fghc-lib-parserConstructs a new sub-scope to an existing scope. This allows us to translate Core-style scoping rules (see  tickishScoped2) into the Cmm world. Suppose the following code:tick 1# case ... of A -> tick 2 ... B -> tick 3 ...We want the top-level tick annotation to apply to blocks generated for the A and B alternatives. We can achieve that by generating tick 1 into a block with scope a, while the code for alternatives A and B gets generated into sub-scopes a/b and a/c respectively.fghc-lib-parserA combined scope scopes over everything that the two given scopes cover. It is therefore a sub-scope of either scope. This is required for optimisations. Consider common block elimination: A -> tick 2, case ... of C -> [common] B -> tick 3 case ... of D -> [common]We will generate code for the C and D alternatives, and figure out afterwards that it's actually common code. Scoping rules dictate that the resulting common block needs to be covered by both tick 2 and tick 3, therefore we need to construct a scope that is a child to *both* scope. Now we can do that - if we assign the scopes ac and bd to the common-ed up blocks, the new block could have a combined tick scope ac+bd, which both tick 2 and tick 3 apply to.fghc-lib-parserA convention maps a list of values (function arguments or return values) to registers or stack locations.fghc-lib-parser top-level Haskell functions use NativeDirectCall, which maps arguments to registers starting with R2, according to how many registers are available on the platform. This convention ignores R1, because for a top-level function call the function closure is implicit, and doesn't need to be passed.fghc-lib-parsernon-top-level Haskell functions, which pass the address of the function closure in R1 (regardless of whether R1 is a real register or not), and the rest of the arguments in registers or on the stack.fghc-lib-parsera native return. The convention for returns depends on how many values are returned: for just one value returned, the appropriate register is used (R1, F1, etc.). regardless of whether it is a real register or not. For multiple values returned, they are mapped to registers or the stack.fghc-lib-parser/Slow entry points: all args pushed on the stackfghc-lib-parserEntry to the garbage collector: uses the node reg! (TODO: I don't think we need this --SDM)gghc-lib-parserChecks whether two tick scopes are sub-scopes of each other. True if the two scopes are equal.gghc-lib-parserCombine two tick scopes. The new scope should be sub-scope of both parameters. We simplify automatically if one tick scope is a sub-scope of the other already.SffffffffffffffffffffffffffffffffgggggggggggggggggggggggggggggggggfffffffffffgggggggggggggggggggffSffffffffffffgfffgggggggggggffffggNone'(/5> d gghc-lib-parser%Static data, after SRTs are generatedgghc-lib-parser8a literal value, size given by cmmLitRep of the literal.gghc-lib-parser uninitialised data, N bytes longgghc-lib-parser1string of 8-bit values only, not zero terminated.gghc-lib-parseran embedded binary filegghc-lib-parser!Info table as a haskell data typegghc-lib-parserCmmTopInfo is attached to each CmmDecl (see defn of CmmGroup), and contains the extra info (beyond the executable code) that belongs to that CmmDecl.gghc-lib-parserA top-level chunk, abstracted over the type of the contents of the basic blocks (Cmm or instructions are the likely instantiations).gghc-lib-parserRaw1 cmm group (TODO (osa): not sure what that means)gghc-lib-parserCmm group with SRTsgghc-lib-parserCmm group before SRT generationgghc-lib-parser?Should a data in this section be considered constant at runtimegghc-lib-parserThe branch block id is that of the first block in the branch, which is that branch's entry point$$$$$$$$%%%%%%%&&&&&%&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&''''''''''''''''''''''''''''''''''''''''''''''''''''&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''((((((((((((((((((((((((((((((((((((((((Sccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccffffffffffffffffffffffggffffffffffgggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggg$$$$$$$ggg$None'(-/3>? mhghc-lib-parser1Constraint type to bundle up the requirement for  on both the id and the P of it. See Note [NoGhcTc].hghc-lib-parser.Maps the "normal" id type for a given GHC passhghc-lib-parserAllows us to check what phase we're in at GHC's runtime. For example, this class allows us to write > f :: forall p. IsPass p => HsExpr (GhcPass p) -> blah > f e = case ghcPass @p of > GhcPs -> ... in this RHS we have HsExpr GhcPs... > GhcRn -> ... in this RHS we have HsExpr GhcRn... > GhcTc -> ... in this RHS we have HsExpr GhcTc... which is very useful, for example, when pretty-printing. See Note [IsPass].hghc-lib-parserUsed as a data type index for the hsSyn AST; also serves as a singleton type for Passīghc-lib-parserMarks that a field uses the GhcRn variant even when the pass parameter is GhcTc. Useful for storing HsTypes in GHC.Hs.Exprs, say, because HsType GhcTc should never occur. See Note [NoGhcTc]hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhNone 7hghc-lib-parserWhether  is a synonym for .hghc-lib-parser"Explain how something is in scope.hghc-lib-parser8It was locally bound at this particular source location.hghc-lib-parser6It was imported by this particular import declaration.hghc-lib-parserSuggest how to fix an import.hghc-lib-parserSome module exports what we want, but we aren't explicitly importing it.hghc-lib-parserSome module exports what we want, but we are explicitly hiding it.hghc-lib-parserAn h< for a '.hsig' file. This is generated by GHC in case of a DriverUnexpectedSignature and suggests a way to instantiate a particular signature, where the first argument is the signature name and the second is the module where the signature was defined. Example:src/MyStr.hsig:2:11: error: Unexpected signature: @MyStr@ (Try passing -instantiated-with="MyStr= MyStr" replacing  MyStr as necessary.)hghc-lib-parser$A type for hints emitted by GHC. A hint suggests a possible way to deal with a particular warning or error.hghc-lib-parserAn "unknown" hint. This type constructor allows arbitrary -- hints to be embedded. The typical use case would be GHC plugins -- willing to emit hints alongside their custom diagnostics.hghc-lib-parserSuggests adding a particular language extension. GHC will do its best trying to guess when the user is using the syntax of a particular language extension without having the relevant extension enabled.Example: If the user uses the keyword "mdo" (and we are in a monadic block), but the relevant extension is not enabled, GHC will emit a 'SuggestExtension RecursiveDo'.Test case(s): parser should_failT12429, parser should_fail$T8501c, parser should_failT18251e, ... (and many more)hghc-lib-parserSuggests that a monadic code block is probably missing a "do" keyword.Example: main = putStrLn "hello" putStrLn "world"Test case(s): parser should_failT8501a, parser should_fail)readFail007, parser should_failInfixAppPatErr, parser should_failT984hghc-lib-parser;Suggests that a "let" expression is needed in a "do" block.Test cases: None (that explicitly test this particular hint is emitted).hghc-lib-parserSuggests to add an ".hsig" signature file to the Cabal manifest.Triggered by: -, if Cabal is being used.Example: See comment of DriverUnexpectedSignature.Test case(s): driver/T12955hghc-lib-parserSuggests to explicitly list the instantiations for the signatures in the GHC invocation command.Triggered by: ", if Cabal is not being used.Example: See comment of DriverUnexpectedSignature.Test case(s): driver/T12955hghc-lib-parser'Suggests to use spaces instead of tabs.Triggered by: .)Examples: None Test Case(s): Nonehghc-lib-parser4Suggests adding a whitespace after the given symbol.+Examples: None Test Case(s): parsershould_compile T18834a.hshghc-lib-parserSuggests adding a whitespace around the given operator symbol, as it might be repurposed as special syntax by a future language extension. The second parameter is how such operator occurred, if in a prefix, suffix or tight infix position.Triggered by: .;Example: h a b = a+b -- not OK, no spaces around .Test Case(s): parsershould_compile T18834b.hshghc-lib-parser.Suggests wrapping an expression in parentheses)Examples: None Test Case(s): Nonehghc-lib-parserSuggests to increase the -fmax-pmcheck-models limit for the pattern match checker.Triggered by: Test case(s): pmcheckshould_compile)TooManyDeltas pmcheckshould_compile)TooManyDeltas pmcheckshould_compileT11822hghc-lib-parserSuggests adding a type signature, typically to resolve ambiguity or help GHC inferring types.hghc-lib-parserSuggests to explicitly discard the result of a monadic action by binding the result to the '_' wilcard.>Example: main = do _ <- getCurrentTimehghc-lib-parserSuggests adding an identifier to the export list of a signature.hghc-lib-parserSuggests increasing the limit for the number of iterations in the simplifier.hghc-lib-parserSuggests to explicitly import Type from the + module, because using "*" to mean  relies on the StarIsType extension, which will become deprecated in the future.Triggered by:  Example: None Test case(s): wcompat-warnings/WCompatWarningsOn.hshghc-lib-parserSuggests placing the  qualified keyword after the module name.Triggered by: = Example: None Test case(s): module/mod184.hshghc-lib-parser0Suggests using TemplateHaskell quotation syntax.Triggered by:  only if TemplateHaskell is enabled. Example: None Test case(s): parser should_fail T13450TH.hshghc-lib-parser;Suggests alternative roles in case we found an illegal one.Triggered by: 2 Example: None Test case(s): roles should_fail Roles7.hshghc-lib-parserSuggests qualifying the 1 operator in modules where StarIsType is enabled.Triggered by:  Test case(s): warningsshould_compile StarBinder.hshghc-lib-parser0Suggests that a type signature should have form  variable ::  type( in order to be accepted by GHC.Triggered by:  Test case(s): parser should_failT3811hghc-lib-parser:Suggests to move an orphan instance or to newtype-wrap it.Triggered by:  Test cases(s): warningsshould_compile&T9178 typecheckshould_compileT4912hghc-lib-parserSuggests to use a standalone deriving declaration when GHC can't derive a typeclass instance in a trivial way.Triggered by: ! Test cases(s): typecheck should_fail tcfail086hghc-lib-parserSuggests the user to fill in the wildcard constraint to disambiguate which constraint that is.6Example: deriving instance _ => Eq (Foo f a)Triggered by: $ Test cases(s): partial-sigs should_fail T13324_fail2hghc-lib-parser)Suggests to use an identifier other than forall Triggered by: hghc-lib-parserSuggests to use the appropriate Template Haskell tick: a single tick for a term-level *,, or a double tick for a type-level *.Triggered by: .hghc-lib-parserSuggests enabling -ddump-splices to help debug an issue when a  is not in scope or is used in multiple different namespaces (e.g. both as a data constructor and a type constructor).Concomitant with  NoExactName or SameName errors, see e.g. "GHC.Rename.Env.lookupExactOcc_either". Test cases: T5971, T7241, T13937.hghc-lib-parserSuggests adding a tick to refer to a data constructor at the type level.Test case: T9778.hghc-lib-parserSomething is split off from its corresponding declaration. For example, a datatype is given a role declaration in a different module.&Test cases: T495, T8485, T2713, T5533.hghc-lib-parserSuggest a similar name that the user might have meant, e.g. suggest ` when the user has written travrese.Test case: mod73.hghc-lib-parserRemind the user that the field selector has been suppressed because of -XNoFieldSelectors.4Test cases: NFSSuppressed, records-nofieldselectors.hghc-lib-parser,Suggest importing from a module, removing a hiding clause, or explain to the user that we couldn't find a module with the given  .,Test cases: mod28, mod36, mod87, mod114, ...hghc-lib-parserSuggest importing a data constructor to bring it into scope Triggered by: Test cases: ccfail004hghc-lib-parserSuggest to enable the input extension. This is the hint that GHC emits if this is not a "known" fix, i.e. this is GHC giving its best guess on what extension might be necessary to make a certain program compile. For example, GHC might suggests to enable BlockArguments when the user simply formatted incorrectly the input program, so GHC here is trying to be as helpful as possible. If the input   is not empty, it will contain some extra information about the why the extension is required, but it's totally irrelevant/redundant for IDEs and other tools.hghc-lib-parserSuggest to enable the input extensions. The list is to be intended as  disjuctive' i.e. the user is suggested to enable any) of the extensions listed. If the input   is not empty, it will contain some extra information about the why the extensions are required, but it's totally irrelevant/redundant for IDEs and other tools.hghc-lib-parserSuggest to enable the input extensions. The list is to be intended as  conjunctive' i.e. the user is suggested to enable all& the extensions listed. If the input   is not empty, it will contain some extra information about the why the extensions are required, but it's totally irrelevant/redundant for IDEs and other tools.hghc-lib-parserSuggest to enable the input extension in order to fix a certain problem. This is the suggestion that GHC emits when is more-or-less clear "what's going on". For example, if both DeriveAnyClass and GeneralizedNewtypeDeriving5 are turned on, the right thing to do is to enabled DerivingStrategies, so in contrast to h GHC will be a bit more "imperative" (i.e. "Use X Y Z in order to ... "). If the input   is not empty, it will contain some extra information about the why the extensions are required, but it's totally irrelevant/redundant for IDEs and other tools.hghc-lib-parserThe bindings we have available in scope when suggesting an explicit type signature.hghc-lib-parser8An unknown binding (i.e. too complicated to turn into a )hghc-lib-parser4Suggests a single extension without extra user info.hghc-lib-parserLike h. but allows supplying extra info for the user.hghc-lib-parserSuggests to enable every extension in the list.hghc-lib-parserLike h. but allows supplying extra info for the user.hghc-lib-parserSuggests to enable any extension in the list.hghc-lib-parserLike h. but allows supplying extra info for the user.hghc-lib-parser$Display info about the treatment of  under NoStarIsType.%With StarIsType, three properties of  hold:(a) it is not an infix operator (b) it is always in scope (c) it is a synonym for Data.Kind.TypeHowever, the user might not know that they are working on a module with NoStarIsType and write code that still assumes (a), (b), and (c), which actually do not hold in that module.Violation of (a) shows up in the parser. For instance, in the following examples, we have ! not applied to enough arguments:data A :: * data F :: * -> *Violation of (b) or (c) show up in the renamer and the typechecker respectively. For instance:type K = Either * BoolThis will parse differently depending on whether StarIsType is enabled, but it will parse nonetheless. With NoStarIsType it is parsed as a type operator, thus we have ((*) Either Bool). Now there are two cases to consider: There is no definition of (*) in scope. In this case the renamer will fail to look it up. This is a violation of assumption (b).There is a definition of the (*) type operator in scope (for example coming from GHC.TypeNats). In this case the user will get a kind mismatch error. This is a violation of assumption (c).The user might unknowingly be working on a module with NoStarIsType or use  as  out of habit. So it is important to give a hint whenever an assumption about  is violated. Unfortunately, it is somewhat difficult to deal with (c), so we limit ourselves to (a) and (b).h returns appropriate hints to the user depending on the extensions enabled in the module and the name that triggered the error. That is, if we have NoStarIsType and the error is related to 0 or its Unicode variant, we will suggest using '; otherwise we won't suggest anything.hghc-lib-parser8fixity declaration, role annotation, type signature, ...ghc-lib-parserthe 0 for the declaration sitehhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhNone'(567<> #hghc-lib-parserUsed to describe warnings and errors o The message has a file/line/column heading, plus "warning:" or "error:", added by mkLocMessage o With h the message is suppressed o Output is intended for end usershghc-lib-parserIgnore this message, for example in case of suppression of warnings users don't want to see. See Note [Suppressing Messages]hghc-lib-parserThe class for a diagnostic message. The main purpose is to classify a message within GHC, to distinguish it from a debug/dump message vs a proper diagnostic, for which we include a h.hghc-lib-parserLog message intended for compiler developers No file/line/column stuffhghc-lib-parserLog messages intended for end users. No file/line/column stuff.hghc-lib-parserDiagnostics from the compiler. This constructor is very powerful as it allows the construction of a h- with a completely arbitrary permutation of h and h,. As such, users are encouraged to use the mkMCDiagnostic smart constructor instead. Use this constructor directly only if you need to construct and manipulate diagnostic messages directly, for example inside ". In all the other circumstances,  especially when emitting compiler diagnostics, use the smart constructor.hghc-lib-parserAn envelope for GHC's facts about a running program, parameterised over the domain-specific5 (i.e. parsing, typecheck-renaming, etc) diagnostics.%To say things differently, GHC emits  diagnostics= about the running program, each of which is wrapped into a h that carries specific information like where the error happened, etc. Finally, multiple hs are aggregated into i that are returned to the user.hghc-lib-parser=The SrcSpan is used for sorting errors into line-number orderhghc-lib-parser The reason why a h was emitted in the first place. Diagnostic messages are born within GHC with a very precise reason, which can be completely statically-computed (i.e. this is an error or a warning no matter what), or influenced by the specific state of the DynFlags) at the moment of the creation of a new h#. For example, a parsing error is always going to be an error, whereas a 'WarningWithoutFlag Opt_WarnUnusedImports' might turn into an error due to '-Werror' or '-Werror=warn-unused-imports'. Interpreting a h together with its associated h gives us the full picture.hghc-lib-parserBorn as a warning.hghc-lib-parser"Warning was enabled with the flag.hghc-lib-parserBorn as an error.hghc-lib-parser A generic h message, without any further classification or provenance: By looking at a h we don't know neither where it was generated nor how to intepret its payload (as it's just a structured document). All we can do is to print it out and look at its h.hghc-lib-parser A generic Hint message, to be used with h.hghc-lib-parserA class identifying a diagnostic. Dictionary.com defines a diagnostic as:"a message output by a computer diagnosing an error in a computer program, computer system, or component device".A h carries the actual description of the message (which, in GHC's case, it can be an error or a warning) and the reason why such message was generated in the first place. See also Note [Rendering Messages].ighc-lib-parserA i is isomorphic to a '[SDoc]' but it carries the invariant that the input '[SDoc]' needs to be rendered  decorated into its final form, where the typical case would be adding bullets between each elements of the list. The type of decoration depends on the formatting function used, but in practice GHC uses the formatBulleted.ighc-lib-parserA collection of messages emitted by GHC during error reporting. A diagnostic message is typically a warning or an error. See Note [Messages]. INVARIANT: All the messages in this collection must be relevant, i.e. their h should not be h. The smart constructor i# will filter out any message which h is h.ighc-lib-parserAdds a Message to the input collection of messages. See Note [Discarding Messages].ighc-lib-parserJoins two collections of messages together. See Note [Discarding Messages].ighc-lib-parser Joins many i s togetherighc-lib-parserCreates a new i out of a list of  .ighc-lib-parserCreates a new i out of a single  ighc-lib-parser Joins two i together. The resulting i will have a number of entries which is the sum of the lengths of the input.ighc-lib-parser5Apply a transformation function to all elements of a i.ighc-lib-parserHelper function to use when no hints can be provided. Currently this function can be used to construct plain h and add hints to them, but once #18516 will be fully executed, the main usage of this function would be in the implementation of the i9 typeclass method, to report the fact that a particular h has no hints.ighc-lib-parserCreate an error h holding just a single  ighc-lib-parser Create a h% from a list of bulleted SDocs and a highc-lib-parserCreate an error h from a list of bulleted SDocsighc-lib-parser5Make an unannotated error message with location info.ighc-lib-parser;Make a possibly annotated error message with location info.ighc-lib-parserReturns J if this is, intrinsically, a failure. See Note [Intrinsic And Extrinsic Failures].ighc-lib-parser5Are there any hard errors here? -Werror warnings are not; detected. If you want to check for -Werror warnings, use i.ighc-lib-parserReturns J if the envelope contains a message that will stop compilation: either an intrinsic error or a fatal (-Werror) warningighc-lib-parser.Are there any errors or -Werror warnings here?ighc-lib-parserPartitions the i and returns a tuple which first element are the warnings, and the second the errors.ighc-lib-parseroptional annotationghc-lib-parserWhat kind of message?ghc-lib-parserlocationghc-lib-parsermessage hhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiihhhhhhhhhhhhhhhhhhhiihhhhhhhhhhhiiiihhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhi iiiiiiiiiiiiiiiiiiNone 5ighc-lib-parser Logger flagsighc-lib-parserFormat of a dumpDump formats are loosely defined: dumps may contain various additional headers and annotations and they may be partial. i2 is mainly a hint (e.g. for syntax highlighters).ighc-lib-parserHaskellighc-lib-parserCoreighc-lib-parserSTGighc-lib-parserByteCodeighc-lib-parserCmmighc-lib-parser Assembly codeighc-lib-parser C code/headerighc-lib-parser LLVM bytecodeighc-lib-parserUnstructured dumpighc-lib-parser Logger flagsighc-lib-parser Dump flagsighc-lib-parserShow caret in diagnosticsighc-lib-parserShow warning flag groupsighc-lib-parserEnable timestampsighc-lib-parserEnable dump to fileighc-lib-parserDump directoryighc-lib-parserNormal dump path ("basename.")ighc-lib-parserOverriden dump pathighc-lib-parserEnable debug outputighc-lib-parserVerbosity levelighc-lib-parserDefault LogFlagsighc-lib-parserTest if a DumpFlag is enabledighc-lib-parserEnable a DumpFlagighc-lib-parserTest if a DumpFlag is setighc-lib-parser*Test if verbosity is >= to the given valueighc-lib-parserUpdate LogFlagsighc-lib-parser Set LogFlagsighc-lib-parserSet the trace flushing functionThe currently set trace flushing function is passed to the updating functionighc-lib-parser!Calls the trace flushing functionighc-lib-parser Log somethingighc-lib-parserDump somethingighc-lib-parserTrace somethingighc-lib-parserPush a log hookighc-lib-parserPop a log hookighc-lib-parserPush a dump hookighc-lib-parserPop a dump hookighc-lib-parserPush a trace hookighc-lib-parserPop a trace hookighc-lib-parserMake the logger thread-safeighc-lib-parserLike i but appends an extra newline.ighc-lib-parserThe boolean arguments let's the pretty printer know if it can optimize indent by writing ascii ' ' characters without going through decoding.ighc-lib-parserDefault action for  dumpAction hookighc-lib-parser#Run an action with the handle of a , if we are outputting to a file, otherwise H.ighc-lib-parserDefault action for  traceAction hookighc-lib-parser Log somethingighc-lib-parserDump somethingighc-lib-parserLog a trace messageighc-lib-parser$Log a dump message (not a dump file)ighc-lib-parser!Dump if the given DumpFlag is setighc-lib-parser!Dump if the given DumpFlag is setUnlike i!, has a PrintUnqualified argumentighc-lib-parser9Ensure that a dump file is created even if it stays emptyiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiii,None  ghc-lib-parserUnfolding optionsjghc-lib-parser2Threshold above which unfoldings are not *created*jghc-lib-parser2Threshold above which unfoldings are not *inlined*jghc-lib-parser,Discount for lambdas that are used (applied)jghc-lib-parserDiscount for dictionariesjghc-lib-parser!Force inlining in many more casesjghc-lib-parserDon't consider depth up to xjghc-lib-parserPenalize depth with 1/xjghc-lib-parser9Only report inlining decisions for names with this prefix% jjjjjjjjj SSiiijjjjjjjjjjjjjj%SS jjjjjjjjj jjjjjjjjjiiijjjjjNone &5 vjghc-lib-parserMonomorphic version of  Validity' specialised for  s.jghc-lib-parserEverything is finejghc-lib-parser%A problem, and some indication of whyjghc-lib-parserEnabled warningsjghc-lib-parserFatal warningsjghc-lib-parserTreat warnings as errorsjghc-lib-parserReverse error reporting orderjghc-lib-parserMax reported error countjghc-lib-parserError printing contextjghc-lib-parser Computes the right h for the input h& out of the 'DiagOpts. This function has to be called when a diagnostic is constructed, i.e. with a 'DiagOpts "snapshot" taken as close as possible to where a particular diagnostic message is built, otherwise the computed h9 might not be correct, due to the mutable nature of the DynFlags in GHC.jghc-lib-parserMake a h for a given h, consulting the 'DiagOpts.jghc-lib-parser Varation of j which can be used when we are sure the input h is h.jghc-lib-parserWrap a h in a h,, recording its location. If you know your h is an error, consider using j), which does not require looking at the jjghc-lib-parserWrap a h in a h, recording its location. Precondition: the diagnostic is, in fact, an error. That is, (diagnosticReason msg == ErrorWithoutFlag.jghc-lib-parser= 2 or -ddump-timings).See Note [withTiming] for more.jghc-lib-parserLike j but with  SevOutput rather then SevInfojghc-lib-parser+Trace a command (when verbosity level >= 3)jghc-lib-parserThe name of the phaseghc-lib-parser.A function to force the result (often either const () or rnf)ghc-lib-parser!The body of the phase to be timedjghc-lib-parserThe name of the phaseghc-lib-parser.A function to force the result (often either const () or rnf)ghc-lib-parser!The body of the phase to be timed hhhhhhhhhhhhhhhhhhhiiiiiiiiiiiiiiiiiiiijjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjhhhhhhiihhhhhhhhhhhhh iiiiiiiijjjjjjjjjjjjjjiiiijjjjjjjiiiiiijjjjjjjjjjjjjjjjNone jghc-lib-parserUsed when a temp file is created. This determines which component Set of FilesToClean will get the temp filejghc-lib-parserA file with lifetime TFL_CurrentModule will be cleaned up at the end of upweep_modjghc-lib-parserA file with lifetime TFL_GhcSession will be cleaned up at the end of runGhc(T)jghc-lib-parser do ...The tmpDir: will be a new subdirectory of the given directory, e.g.  src/sdist.342.jghc-lib-parserDirectory name template. See  openTempFile.ghc-lib-parser#Callback that can use the directoryjghc-lib-parser)Temp directory to create the directory inghc-lib-parserDirectory name template. See  openTempFile.ghc-lib-parser#Callback that can use the directoryjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjNone %jghc-lib-parserCurrent profilejghc-lib-parserThe module being compiled. This field kept lazy for Cmm/Parser.y which preloads it with a panicjghc-lib-parser&Temp Dir for files used in compilationjghc-lib-parserContext for StgToCmm phasejghc-lib-parserThe verbosity of debug messagesjghc-lib-parserThreshold at which Binary literals (e.g. strings) are either dumped to a file and a CmmFileEmbed literal is emitted (over threshold), or become a CmmString Literal (under or at threshold). CmmFileEmbed is only supported with the NCG, thus a Just means two things: We have a threshold, and will be using the NCG. Conversely, a Nothing implies we are not using NCG and disables CmmFileEmbed. See Note [Embedding large binary blobs] in GHC.CmmToAsm.Ppr, and  cgTopBinding in GHC.StgToCmm.jghc-lib-parser0Max size, in bytes, of inline array allocations.jghc-lib-parserTicky profiling enabled (cf -ticky)jghc-lib-parserTrue indicates ticky prof traces allocs of each named thing in addition to allocs _by_ that thingjghc-lib-parserTrue indicates ticky uses name-specific counters for join-points (let-no-escape)jghc-lib-parserTrue indicates ticky uses name-specific counters for dynamic thunksjghc-lib-parserTrue indicates ticky will count number of avoided tag checks by tag inference.jghc-lib-parserLoopification enabled (cf -floopification)jghc-lib-parserInsert alignment check (cf -falignment-sanitisation)jghc-lib-parser)perform code generation for code coveragejghc-lib-parserjghc-lib-parser)Check if cost-centre profiling is enabledjghc-lib-parserjghc-lib-parsertrue means generate C Stub for IPE map, See note [Mapping Info Tables to Source Positions]jghc-lib-parser;true means omit heap checks when no allocation is performedjghc-lib-parser=true means don't generate interface programs (implied by -O0)jghc-lib-parsertrue if -fPICjghc-lib-parsertrue if -fPIEjghc-lib-parsertrue if -fexternal-dynamic-refs>, meaning generate code for linking against dynamic librariesjghc-lib-parser>decides whether to check array bounds in StgToCmm.Prim or notjghc-lib-parser!Verify tag inference predictions.jghc-lib-parserAllowed to emit larger than native size arithmetic (only LLVM and C backends)kghc-lib-parser(Allowed to generate QuotRem instructionskghc-lib-parserAllowed to generate QuotRemkghc-lib-parser2Allowed to generate AddWordC, SubWordC, Add2, etc.kghc-lib-parser'Allowed to generate IntMul2 instructionkghc-lib-parser%Allowed to generate Fabs instructionskghc-lib-parser+Disable use of precomputed standard thunks.kghc-lib-parserError (if any) to raise when vector instructions are used, see #StgToCmm.Prim.checkVecCompatibilitykghc-lib-parser$check for Advanced Vector Extensionskghc-lib-parser&check for Advanced Vector Extensions 2kghc-lib-parser,check for Advanced Vector 512-bit Extensions(jjjjjjjjjjjjjjjjjjjjjjjjjjjjjkkkkkkkkkkk(jjjjjjjjjjjjjjjjjjjjjjjjjjjjjkkkkkkkkkkkNone - kghc-lib-parserOutput should be to a temporary file: we're going to run more compilation steps on this output later.kghc-lib-parserWe want a persistent file, i.e. a file in the current directory derived from the input filename, but with the appropriate extension. eg. in "ghc -c Foo.hs" the output goes into ./Foo.o.kghc-lib-parserThe output must go into the specific outputFile in DynFlags. We don't store the filename in the constructor as it changes when doing -dynamic-too.kghc-lib-parser>No output should be created, like in Interpreter or NoBackend.kghc-lib-parserStop just after this phasekghc-lib-parser!basename of original input sourcekghc-lib-parser!basename of original input sourcekghc-lib-parser its extensionkghc-lib-parser%says where to put the pipeline outputkghc-lib-parserLift a f action into an m action.kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkNone5 ykghc-lib-parser6A command-line warning message and the reason it arosekghc-lib-parserA command-line error messagekghc-lib-parserUsed when filtering warnings: if a reason is given it can be filtered out when displaying.kghc-lib-parser4GHC flag modes describing when a flag has an effect.kghc-lib-parser-The flag only affects the non-interactive GHCkghc-lib-parser)The flag only affects the interactive GHCkghc-lib-parser#The flag affects multiple ghc modeskghc-lib-parser.This flag should not be seen in cli completion4kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk4kkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkNone > >kghc-lib-parserFlag in string formkghc-lib-parserFlag in internal formkghc-lib-parserExtra action to run when the flag is found Typically, emit a warning or errorkghc-lib-parser%In which ghc mode the flag has effectkghc-lib-parser&Don't try to build dynamic objects tookghc-lib-parser*Will still try to generate dynamic objectskghc-lib-parser5Currently generating dynamic objects (in the backend)lghc-lib-parser+Flags for manipulating packages visibility.lghc-lib-parser-package,  -package-idlghc-lib-parser  -hide-packagelghc-lib-parser%Flags for manipulating package trust.lghc-lib-parser -trustlghc-lib-parser  -distrustlghc-lib-parser6Flags for manipulating the set of non-broken packages.lghc-lib-parser -ignore-packagelghc-lib-parserRepresents the renaming that may be associated with an exposed package, e.g. the rns part of -package "foo (rns)".Here are some example parsings of the package flags (where a string literal is punned to be a  : -package foo is ModRenaming True []-package foo () is ModRenaming False []-package foo (A) is ModRenaming False [(A, A)]-package foo (A as B) is ModRenaming False [(A, B)]-package foo with (A as B) is ModRenaming True [(A, B)]lghc-lib-parser%Bring all exposed modules into scope?lghc-lib-parser Bring module m into scope under name n.lghc-lib-parserWe accept flags which make packages visible, but how they select the package varies; this data type reflects what selection criterion is used.lghc-lib-parser-package, by  PackageNamelghc-lib-parser -package-id, by  lghc-lib-parser-What to do in the link step, if there is one.lghc-lib-parserDon't link at alllghc-lib-parserLink object code into a binarylghc-lib-parserUse the in-memory dynamic linker (works for both bytecode and object code).lghc-lib-parserLink objects into a dynamic lib (DLL on Windows, DSO on ELF platforms)lghc-lib-parserLink objects into a static liblghc-lib-parser(Link objects into a merged "GHCi object"lghc-lib-parserThe l tells us whether we're doing multi-module compilation (controlled via the GHC API) or one-shot (single-module) compilation. This makes a difference primarily to the GHC.Unit.Finder: in one-shot mode we look for interface files for imported modules, but in multi-module mode we look for source files in order to check whether they need to be recompiled.lghc-lib-parser--make , GHCi, etc.lghc-lib-parser  ghc -c Foo.hslghc-lib-parserghc -M, see GHC.Unit.Finder for why we need thislghc-lib-parser!See Note [LLVM configuration] in  GHC.SysTools.lghc-lib-parserno SCC annotations addedlghc-lib-parser,top-level and nested functions are annotatedlghc-lib-parser"top-level functions annotated onlylghc-lib-parser!exported functions annotated onlylghc-lib-parserannotate call-siteslghc-lib-parser"Contains not only a collection of s but also a plethora of information relating to the compilation of a single file or GHC sessionlghc-lib-parserThe backend to use (if any).7Whenever you change the backend, also make sure to set l to something sensible.% can be used to avoid generating any output, however, note that:If a program uses Template Haskell the typechecker may need to run code from an imported module. To facilitate this, code generation is enabled for modules imported by modules that use template haskell, using the default backend for the platform. See Note [-fno-code mode].lghc-lib-parserN.B. It's important that this field is lazy since we load the LLVM configuration lazily. See Note [LLVM configuration] in  GHC.SysTools.lghc-lib-parserLLVM optimisation levellghc-lib-parser,Verbosity level: see Note [Verbosity levels]lghc-lib-parser%How much debug information to producelghc-lib-parserNumber of simplifier phaseslghc-lib-parserMax simplifier iterationslghc-lib-parserAdditional demand analysislghc-lib-parserThe number of modules to compile in parallel in --make mode, where Nothing ==> compile as many in parallel as there are CPUs.lghc-lib-parserEnable RTS timing statistics?lghc-lib-parserThe heap size to set.lghc-lib-parserMaximum number of bindings from the type envt to show in type error messageslghc-lib-parserMaximum number of hole fits to show in typed hole error messageslghc-lib-parserMaximum number of refinement hole fits to show in typed hole error messageslghc-lib-parserMaximum level of refinement for refinement hole fits in typed hole error messageslghc-lib-parserMaximum number of unmatched patterns to show in non-exhaustiveness warningslghc-lib-parserSoft limit on the number of models the pattern match checker checks a pattern against. A safe guard against exponential blow-up.lghc-lib-parserMultiplier for simplifier tickslghc-lib-parserWhether DmdAnal should optimistically put an Unboxed demand on returned products with at most this number of fieldslghc-lib-parserThreshold for SpecConstrlghc-lib-parser2Max number of specialisations for any one functionlghc-lib-parserMax number of specialisations for recursive types Not optional; otherwise ForceSpecConstr can diverge.lghc-lib-parserBinary literals (e.g. strings) whose size is above this threshold will be dumped in a binary file by the assembler code generator. 0 and Nothing disables this feature. See .lghc-lib-parserThreshold for LiberateCaselghc-lib-parser%Arg count for lambda floating See lghc-lib-parserMaximum number of arguments after lambda lifting a recursive function.lghc-lib-parserMaximum number of arguments after lambda lifting a non-recursive function.lghc-lib-parserLambda lift even when this turns a known call into an unknown call.lghc-lib-parser4Align Cmm functions at this boundary or use default.lghc-lib-parserSimplification history sizelghc-lib-parserTypechecker maximum stack depthlghc-lib-parserNumber of iterations in the constraints solver Typically only 1 is neededlghc-lib-parserTarget home unit-idlghc-lib-parserId of the unit to instantiatelghc-lib-parserModule instantiationslghc-lib-parser8What the package is called, use with multiple home unitslghc-lib-parser&Target way flags from the command linelghc-lib-parserIndicate if we are now generating dynamic output because of -dynamic-too. This predicate is used to query the appropriate fields (outputFile/dynOutputFile, ways, etc.)lghc-lib-parser1This defaults to 'non-module'. It can be set by  or 'ghc.GHCi.UI.runStmt'% based on where its output is going.lghc-lib-parser Override the l set by  or 'ghc.GHCi.UI.runStmt' . Set by -ddump-file-prefixmghc-lib-parserPath to store the .mix filesmghc-lib-parserthe -fplugin flags given on the command line, in *reverse* order that they're specified on the command line.mghc-lib-parserthe -ffrontend-opt flags given on the command line, in *reverse* order that they're specified on the command line.mghc-lib-parserThe  -package-db flags given on the command line, In *reverse* order that they're specified on the command line. This is intended to be applied with the list of "initial" package databases derived from GHC_PACKAGE_PATH; see  getUnitDbRefs.mghc-lib-parserThe -ignore-package flags from the command line. In *reverse* order that they're specified on the command line.mghc-lib-parserThe -package and  -hide-package flags from the command-line. In *reverse* order that they're specified on the command line.mghc-lib-parserThe -plugin-package-id flags from command line. In *reverse* order that they're specified on the command line.mghc-lib-parserThe -trust and  -distrust flags. In *reverse* order that they're specified on the command line.mghc-lib-parserFilepath to the package environment file (if overriding default)mghc-lib-parserSafe Haskell modemghc-lib-parserUnfolding control See Note [Discounts and thresholds] in GHC.Core.Unfoldmghc-lib-parser8GHCi scripts specified by -ghci-script, in reverse ordermghc-lib-parserwhat kind of {- SCC -} to add automaticallymghc-lib-parser(Machine dependent flags (-m stuff)mghc-lib-parser8Run-time linker information (what options we need, etc.)mghc-lib-parserRun-time C compiler informationmghc-lib-parserRun-time assembler informationmghc-lib-parser0Max size, in bytes, of inline array allocations.mghc-lib-parserOnly inline memcpy if it generates no more than this many pseudo (roughly: Cmm) instructions.mghc-lib-parserOnly inline memset if it generates no more than this many pseudo (roughly: Cmm) instructions.mghc-lib-parser/Reverse the order of error messages in GHC/GHCimghc-lib-parser*Limit the maximum number of errors to showmghc-lib-parser9Unique supply configuration for testing build determinismmghc-lib-parser/Temporary: CFG Edge weights for fast iterationsmghc-lib-parserUsed to differentiate the scope an include needs to apply to. We have to split the include paths to avoid accidentally forcing recursive includes since -I overrides the system search paths. See #14312.mghc-lib-parser!See Note [Implicit include paths]mghc-lib-parserAppend to the list of includes a path that shall be included using `-I` when the C compiler is called. These paths override system search paths.mghc-lib-parserAppend to the list of includes a path that shall be included using `-iquote` when the C compiler is called. These paths only apply when quoted includes are used. e.g. #include "foo.h"mghc-lib-parserThese includes are not considered while fingerprinting the flags for iface | See Note [Implicit include paths]mghc-lib-parserConcatenate and flatten the list of global and quoted includes returning just a flat list of paths.mghc-lib-parser "unbuild" a # from a l. This shouldn't be needed in the vast majority of code. But GHCi questionably uses this to produce a default l1 from which to compute a flags diff for printing.mghc-lib-parserThe directory for this version of ghc in the user's app directory The appdir used to be in ~/.ghc but to respect the XDG specification we want to move it under $XDG_DATA_HOME/ However, old tooling (like cabal) might still write package environments to the old directory, so we prefer that if a subdirectory of ~/.ghc with the correct target and GHC version suffix exists. i.e. if ~.ghc$UNIQUE_SUBDIR exists we use that otherwise we use $XDG_DATA_HOME/$UNIQUE_SUBDIRUNIQUE_SUBDIR is typically a combination of the target platform and GHC versionnghc-lib-parserAre we building with -fPIE or -fPIC enabled?nghc-lib-parserUsed by  to partially initialize a new l valuenghc-lib-parser The normal l. Note that they are not suitable for use in this form and must be fully initialized by  first.nghc-lib-parserThe language extensions implied by the various language variants. When updating this be sure to update the flag documentation in docs users_guideexts.nghc-lib-parserTest whether a  is setnghc-lib-parserSet a nghc-lib-parserUnset a nghc-lib-parserTest whether a  is set Note that l (i.e., dynamic objects built with `-dynamic-too`) always implicitly enables Opt_PIC, Opt_ExternalDynamicRefs, and disables Opt_SplitSections.nghc-lib-parserSet a nghc-lib-parserUnset a nghc-lib-parserTest whether a  is setnghc-lib-parserSet a nghc-lib-parserUnset a nghc-lib-parserTest whether a  is set as fatalnghc-lib-parserMark a  as fatal (do not set the flag)nghc-lib-parserMark a  as not fatalnghc-lib-parserTest whether a  is setnghc-lib-parserSet a nghc-lib-parserUnset a nghc-lib-parserSet or unset a 7, unless it has been explicitly set or unset before.nghc-lib-parserIs the -fpackage-trust mode onnghc-lib-parser9Is Safe Haskell on in some way (including inference mode)nghc-lib-parser(Is the Safe Haskell safe language in usenghc-lib-parser.Is the Safe Haskell safe inference mode activenghc-lib-parser(Test if Safe Imports are on in some formnghc-lib-parserAre all direct imports required to be safe for this Safe Haskell mode? Direct imports are when the code explicitly imports a modulenghc-lib-parserAre all implicit imports required to be safe for this Safe Haskell mode? Implicit imports are things in the prelude. e.g System.IO when print is used.nghc-lib-parserA list of unsafe flags under Safe Haskell. Tuple elements are: * name of the flag * function to get srcspan that enabled the flag * function to test if the flag is on * function to turn the flag offnghc-lib-parserA list of unsafe flags under Safe Haskell. Tuple elements are: * name of the flag * function to get srcspan that enabled the flag * function to test if the flag is on * function to turn the flag offnghc-lib-parser3Retrieve the options corresponding to a particular opt_* field in the correct ordernghc-lib-parserGets the verbosity flag for the current verbosity level. This is fed to other tools, so GHC-specific verbosity flags like  -ddump-most are not includednghc-lib-parser Sets the l, to be appropriate to the optimisation levelnghc-lib-parserParse dynamic flags from a list of command line arguments. Returns the parsed l=, the left-over arguments, and a list of warnings. Throws a  if errors occurred during parsing (such as unknown flags or missing arguments).nghc-lib-parserLike n but does not allow the package flags (-package, -hide-package, -ignore-package, -hide-all-packages, -package-db). Used to parse flags set in a modules pragma.nghc-lib-parserParses the dynamically set flags for GHC. This is the most general form of the dynamic flag parser that the other methods simply wrap. It allows saying which flags are valid flags and indicating if we are parsing arguments from the command line or from a file pragma.nghc-lib-parserAll dynamic flags option strings without the deprecated ones. These are the user facing strings for enabling and disabling options.nghc-lib-parserMake a list of flags for shell completion. Filter all available flags into two groups, for interactive GHC vs all other.nghc-lib-parser Find the k for a .nghc-lib-parserThese -W flags can all be reversed with  -Wno-nghc-lib-parserThese -f flags can all be reversed with  -fno-nghc-lib-parserThese -f flags can all be reversed with  -fno-nghc-lib-parserThese -X blah$ flags can all be reversed with -XNo blahnghc-lib-parserGet target profilenghc-lib-parser1Resolve any internal inconsistencies in a set of l. Returns the consistent l6 as well as a list of warnings to report to the user.nghc-lib-parser,Indicate if cost-centre profiling is enablednghc-lib-parser1Indicate whether we need to generate source notesnghc-lib-parserShould we use `-XLinker -rpath` when linking or not? See Note [-fno-use-rpaths]nghc-lib-parser&Initialize the pretty-printing optionsnghc-lib-parserInitialize the pretty-printing options using the default user stylenghc-lib-parser/Pretty-print the difference between 2 DynFlags.For now only their general flags but it could be extended. Useful mostly for debugging.nghc-lib-parserl to retrieve the options fromghc-lib-parser%Relevant record accessor: one of the opt_* accessorsghc-lib-parser#Correctly ordered extracted optionsnghc-lib-parserUpdated l-, left-over arguments, and list of warnings.nghc-lib-parserUpdated l-, left-over arguments, and list of warnings.nghc-lib-parservalid flags to match againstghc-lib-parser(are the arguments from the command line?ghc-lib-parsercurrent dynamic flagsghc-lib-parserarguments to parse """"""############################################$$$$$$$$$$$$$$$$$$$$$$$hhhhkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkklllllllllllllllllllllllllllllllllllllllllllllllllllllllllmlllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnhhhhkkkllllllnnnnnnnnnnnnnnnnnnnnnnnnnnkkkknnnnlllllmlllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmnnnkkkkkkllllkkkkkkllllnlllllllnllllllllllnllllllllllkkkk kllnnnnnnnnnnnnnnnnnnnnlllllllll################################$$$$$$$$$$$$$$$$$$$$$$$###########""""""mmmmmmmnmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmnnnnnnnnnnnnnnnnknnnnnnnnnnnnnnnnnnn#nnnnnnnnnnkkkkkkkkkkkkkknmmmmmmmmmnnNone %? thoghc-lib-parserSubstitution on module variables, mapping module names to module identifiers.oghc-lib-parser!The result of performing a lookupoghc-lib-parser-Found the module uniquely, nothing else to dooghc-lib-parser,Multiple modules with the same name in scopeoghc-lib-parserNo modules found, but there were some hidden ones with an exact name match. First is due to package hidden, second is due to module being hiddenoghc-lib-parserNo modules found, but there were some unusable ones with an exact name matchoghc-lib-parser6Nothing found, here are some suggested different namesoghc-lib-parser"The reason why a unit is unusable.oghc-lib-parserWe ignored it explicitly using -ignore-package.oghc-lib-parserThis unit transitively depends on a unit that was never present in any of the provided databases.oghc-lib-parserThis unit transitively depends on a unit involved in a cycle. Note that the list of   reports the direct dependencies of this unit that (transitively) depended on the cycle, and not the actual cycle itself (which we report separately at high verbosity.)oghc-lib-parser;This unit transitively depends on a unit which was ignored.oghc-lib-parserThis unit transitively depends on a unit which was shadowed by an ABI-incompatible unit.oghc-lib-parser Unit databaseoghc-lib-parser A mapping of   to $>. This list is adjusted so that only valid units are here. $5 reflects what was stored *on disk*, except for the trusted flag, which is adjusted at runtime. (In particular, some units in this map may have the exposed flag be G.)oghc-lib-parserThe set of transitively reachable units according to the explicitly provided command line arguments. A fully instantiated VirtUnit may only be replaced by a RealUnit from this set. See Note [VirtUnit to RealUnit improvement]oghc-lib-parser A mapping of $ to  . If several units have the same package name (e.g. different instantiations), then we return one of them... This is used when users refer to packages in Backpack includes. And also to resolve package qualifiers with the PackageImports extension.oghc-lib-parser7A mapping from database unit keys to wired in unit ids.oghc-lib-parserA mapping from wired in unit ids to unit keys from the database.oghc-lib-parserThe units we're going to link in eagerly. This list should be in reverse dependency order; that is, a unit is always mentioned before the units it depends on.oghc-lib-parserUnits which we explicitly depend on (from a command line flag). We'll use this to generate version macros.oghc-lib-parserThis is a full map from   to all modules which may possibly be providing it. These providers may be hidden (but we'll still want to report them in error messages), or it may be an ambiguous import.oghc-lib-parser A map, like o$, but controlling plugin visibility.oghc-lib-parserA map saying, for each requirement, what interfaces must be merged together when we use them. For example, if our dependencies are p[A=] and q[A=,B=r[C=]:B]*, then the interfaces to merge for A are  p[A=]:A, q[A=,B=r[C=]:B]:A and  r[C=]:C.?There's an entry in this map for each hole in our home library.oghc-lib-parser0Indicate if we can instantiate units on-the-fly.This should only be true when we are type-checking an indefinite unit. See Note [About units] in GHC.Unit.oghc-lib-parserGiven a module name, there may be multiple ways it came into scope, possibly simultaneously. This data type tracks all the possible ways it could have come into scope. Warning: don't use the record functions, they're partial!oghc-lib-parserModule is hidden, and thus never will be available for import. (But maybe the user didn't realize), so we'll still keep track of these modules.)oghc-lib-parser6Module is unavailable because the package is unusable.oghc-lib-parser7Module is public, and could have come from some places.oghc-lib-parser Just False) means that this module is in someone's exported-modules$ list, but that package is hidden;  Just True means that it is available; Nothing means neither applies.oghc-lib-parserIs the module available from a reexport of an exposed package? There could be multiple.oghc-lib-parser]:B maps to  p[A=q():A]:B with A=q():A; similarly,  maps to q():A.oghc-lib-parserSubstitutes holes in a  , suitable for renaming when an include occurs; see Note [Representation of module/name variables].p[A=] maps to p[A=] with A=.oghc-lib-parserLike o, but requires only ClosureUnitInfoMap so it can be used by GHC.Unit.State.oghc-lib-parser(Like 'renameHoleUnit, but requires only ClosureUnitInfoMap so it can be used by GHC.Unit.State.oghc-lib-parser Injects an  to   (see also o.oghc-lib-parser9Print unit-ids with UnitInfo found in the given UnitStateoghc-lib-parser8Add package dependencies on the wired-in packages we use\[ZY $$$$$$$$$$$$$$$$$$$$$ooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooNone X%oghc-lib-parsero summarises what was imported from where, irrespective of whether the imported things are actually used or not. It is used: when processing the export list,4when constructing usage info for the interface file,to identify the list of directly imported modules for initialisation purposes and for optimised overlap checking of family instances,/when figuring out what things are really unusedoghc-lib-parser'Domain is all directly-imported modules-See the documentation on ImportedModsVal in GHC.Unit.Module.Imported for the meaning of the fields.We need a full ModuleEnv rather than a ModuleNameEnv here, because we might be importing modules of the same name from different packages. (currently not the case, but might be in the future).oghc-lib-parserHome-package modules directly imported by the module being compiled.oghc-lib-parser5Packages directly needed by the module being compiledoghc-lib-parserDo we require that our own package is trusted? This is to handle efficiently the case where a Safe module imports a Trustworthy module that resides in the same package as it. See Note [Trust Own Package] in GHC.Rename.Namesoghc-lib-parserThis records the packages the current module needs to trust for Safe Haskell compilation to succeed. A package is required to be trusted if we are dependent on a trustworthy module in that package. See Note [Tracking Trust Transitively] in GHC.Rename.Namesoghc-lib-parserDomain is all modules which have hs-boot files, and whether we should import the boot version of interface file. Only used in one-shot mode to populate eps_is_boot.oghc-lib-parser Signature modules below this oneoghc-lib-parserOrphan modules below us in the import tree (and maybe including us for imported modules)oghc-lib-parserFamily instance modules below us in the import tree (and maybe including us for imported modules)oghc-lib-parserRecords modules for which changes may force recompilation of this module See wiki: https://gitlab.haskell.org/ghc/ghc/wikis/commentary/compiler/recompilation-avoidanceThis differs from Dependencies. A module X may be in the dep_mods of this module (via an import chain) but if we don't use anything from X it won't appear in our Usageoghc-lib-parserModule from another packageoghc-lib-parserModule from the current packageoghc-lib-parserA file upon which the module depends, e.g. a CPP #include, or using TH's addDependentFileoghc-lib-parser-A requirement which was merged into this one.oghc-lib-parser#External package module depended onpghc-lib-parser:Cached module ABI fingerprint (corresponds to mi_mod_hash)pghc-lib-parser)Was this module imported as a safe importpghc-lib-parserName of the modulepghc-lib-parserEntities we depend on, sorted by occurrence name and fingerprinted. NB: usages are for parent names only, e.g. type constructors but not the associated data constructors.pghc-lib-parserFingerprint for the export list of this module, if we directly imported it (and hence we depend on its export list)pghc-lib-parserExternal file dependency. From a CPP #include or TH addDependentFile. Should be absolute.pghc-lib-parser of the file contents.pghc-lib-parserAn optional string which is used in recompilation messages if file in question has changed.pghc-lib-parserThe *interface* hash of the module, not the ABI hash. This changes when anything about the interface (and hence the module) has changed.pghc-lib-parserDependency information about ALL modules and packages below this one in the import hierarchy. This is the serialisable version of o.(Invariant: the dependencies of a module M never includes M.0Invariant: none of the lists contain duplicates.Invariant: lists are ordered canonically (e.g. using stableModuleCmp)1See Note [Transitive Information in Dependencies]pghc-lib-parserAll home-package modules which are directly imported by this one. This may include modules from other units when using multiple home unitspghc-lib-parserAll packages directly imported by this module I.e. packages to which this module's direct imports belong. Does not include other home units when using multiple home units. Modules from these units will go in ppghc-lib-parserAll units needed for pluginspghc-lib-parser4Transitive closure of hsig files in the home packagepghc-lib-parserAll modules which have boot files below this one, and whether we should use the boot file or not. This information is only used to populate the eps_is_boot field. See Note [Structure of dep_boot_mods]pghc-lib-parserTransitive closure of orphan modules (whether home or external pkg).(Possible optimization: don't include family instance orphans as they are anyway included in p. But then be careful about code which relies on dep_orphs having the complete list!) This does NOT include us, unlike o.pghc-lib-parserTransitive closure of depended upon modules which contain family instances (whether home or external). This is used by checkFamInstConsistency%. This does NOT include us, unlike o9. See Note [The type family instance consistency story].pghc-lib-parserExtract information from the rename and typecheck phases to produce a dependencies information for the module being compiled.0The fourth argument is a list of plugin modules.pghc-lib-parserUpdate module dependencies containing orphans (used by Backpack)pghc-lib-parserUpdate module dependencies containing family instances (used by Backpack)pghc-lib-parserPretty-print unit dependencies)ooooooooooooooooooppppppppppppppppppppppp)ppppppppppppppooooooopppppppppoooooooooooNone> &\[ZY    $$$$$$$$$$$$$$$$$$$$$ooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooNone !pghc-lib-parser1Locations and information the finder cares about.Should be taken from DynFlags via initFinderOpts.pghc-lib-parser9Where are we allowed to look for Modules and Source filespghc-lib-parserWhen looking up a home module:J-: search interface files (e.g. in '-c' mode)G-: search source files (e.g. in '--make' mode)pghc-lib-parserDon't check that an imported interface file actually exists if it can only be at one location. The interface will be reported as p even if the file doesn't exist, so this is only useful in specific cases (e.g. to generate dependencies with `ghc -M`)pghc-lib-parserIf we encounter unknown modules, should we suggest modules that have a similar name.pghc-lib-parser/The result of searching for an imported module.NB: FindResult manages both user source-import lookups (which can result in  ) as well as direct imports for interfaces (which always result in ).pghc-lib-parserThe module was foundpghc-lib-parser The requested unit was not foundpghc-lib-parser"_Error_: both in multiple packagespghc-lib-parser Not foundpghc-lib-parserPlaces where I lookedpghc-lib-parserJust p => module is in this unit's manifest, but couldn't find the .hi filepghc-lib-parser7Module is in these units, but the *module* is hiddenpghc-lib-parser5Module is in these units, but the *unit* is hiddenpghc-lib-parser,Module is in these units, but it is unusablepghc-lib-parserPossible mis-spelled modulespghc-lib-parserThe p maps modules to the result of searching for that module. It records the results of searching for modules along the search path. On :load., we flush the entire contents of this cache.(pppppppppppppppppppppppppppppppppppppppp(ppppppppppppppppppppppppppppppppppppppppNone pghc-lib-parser"A module name: search for the filepghc-lib-parserA filename: preprocess & parse it to find the module name. If specified, the Phase indicates how to compile this file (which phase to start from). Nothing indicates the starting phase should be determined from the suffix of the filename.pghc-lib-parserA compilation target.A target may be supplied with the actual text of the module. If so, use this instead of the file contents (this is for use in an IDE where the file hasn't been saved by the user yet).7These fields are strict because Targets are long lived.pghc-lib-parsermodule or filenamepghc-lib-parserobject code allowed?pghc-lib-parser%id of the unit this target is part ofpghc-lib-parserOptional in-memory buffer containing the source code GHC should use for this target instead of reading it from disk.Since GHC version 8.10 modules which require preprocessors such as Literate Haskell or CPP to run are also supported.If a corresponding source file does not exist on disk this will result in a  SourceError exception if targetId = TargetModule _! is used. However together with targetId = TargetFile _/ GHC will not complain about the file missing. pppppppppppp ppppppppppppNone pghc-lib-parserAn entry to be inserted into a module's static pointer table. See Note [Grand plan for static forms] in GHC.Iface.Tidy.StaticPtrTable.pghc-lib-parser3Objects which have yet to be linked by the compilerpghc-lib-parserAn object file (.o)pghc-lib-parserStatic archive file (.a)pghc-lib-parser3Dynamically linked library file (.so, .dll, .dylib)pghc-lib-parserA byte-code object, lives only in memory. Also carries some static pointer table entries which should be loaded along with the BCOs. See Note [Grand plan for static forms] in GHC.Iface.Tidy.StaticPtrTable.pghc-lib-parserInformation we can use to dynamically link modules into the compilerpghc-lib-parserTime at which this linkable was built (i.e. when the bytecodes were produced, or the mod date on the files)pghc-lib-parserThe linkable module itselfpghc-lib-parser3Those files and chunks of code we have yet to link.4INVARIANT: A valid linkable always has at least one p item.pghc-lib-parser6Current global mapping from Names to their true valuespghc-lib-parserThe current global mapping from RdrNames of DataCons to info table addresses. When a new Unlinked is linked into the running image, or an existing module in the image is replaced, the itbl_env must be updated appropriately.pghc-lib-parser7The currently loaded interpreted modules (home package)pghc-lib-parser8And the currently-loaded compiled modules (home package)pghc-lib-parserThe currently-loaded packages; always object code haskell libraries, system libraries, transitive dependenciespghc-lib-parserWe need to remember the name of previous temporary DLL/.so libraries so we can link them (see #10322)pghc-lib-parser6Is this an actual file on disk we can link in somehow?pghc-lib-parser1Is this a bytecode linkable with no file on disk?qghc-lib-parserRetrieve the filename of the linkable if possible. Panic if it is a byte-code objectqghc-lib-parserRetrieve the compiled byte-code if possible. Panic if it is a file-based linkable/pppppppppppppppppppppppppppppppppppppppppppppqq/ppppppppppppppppppppppppppppppqppqpppppppppppppzNone? {5ghc-lib-parser;tcEqType implements typechecker equality, as described in 4Note [Typechecker equality vs definitional equality].ghc-lib-parserIs this type variable a concrete type variable, i.e. it is a metavariable with q q?Works with both  and .qghc-lib-parser7Reason why a type cannot be marshalled through the FFI.qghc-lib-parser0Reason why a type in an FFI signature is invalidqghc-lib-parserThis MetaTv is an ordinary unification variable A TauTv is always filled in with a tau-type, which never contains any ForAlls.qghc-lib-parserA variant of TauTv, except that it should not be unified with a type, only with a type variable See Note [TyVarTv] in GHC.Tc.Utils.TcMTypeqghc-lib-parser6A unification variable used in the GHCi debugger. It is/ allowed to unify with a polytype, unlike TauTvqghc-lib-parserA unification variable that can only be unified with a concrete type, in the sense of Note [Concrete types] in GHC.Tc.Utils.Concrete. See Note [ConcreteTv] in GHC.Tc.Utils.Concrete.qghc-lib-parserWhat to expect for an argument to a rebindable-syntax operator. Quite like , but allows for holes to be filled in by tcSyntaxOp. The callback called from tcSyntaxOp gets a list of types; the meaning of these types is determined by a left-to-right depth-first traversal of the q tree. So if you pass in >SynAny `SynFun` (SynList `SynFun` SynType Int) `SynFun` SynAny/you'll get three types back: one for the first q, the element) type of the list, and one for the last q". You don't get anything for the q, because you've said positively that it should be an Int, and so it shall be.You'll also get three multiplicities back: one for each function arrow. See also Note [Linear types] in Multiplicity.-This is defined here to avoid defining it in GHC.Tc.Gen.Expr boot file.qghc-lib-parserAny typeqghc-lib-parser5A rho type, skolemised or instantiated as appropriateqghc-lib-parser6A list type. You get back the element type of the listqghc-lib-parser A function.qghc-lib-parser A known type.qghc-lib-parserLike q, but for an expected type.qghc-lib-parserAn expected type to check against during type-checking. See Note [ExpType] in GHC.Tc.Utils.TcMType&, where you'll also find manipulators.qghc-lib-parserA q is a q which has a fixed ? in the sense of Note [Fixed RuntimeRep] in GHC.Tc.Utils.Concrete.In particular, this means that:M does not panic, does not return H.0This property is important in functions such as matchExpectedFunTys, where we want to provide argument types which have a known runtime representation. See Note [Return arguments with a fixed RuntimeRep.qghc-lib-parserMake an q suitable for checking.qghc-lib-parserLike q but accepts a regular TcTypeqghc-lib-parserLike mkFunTys but for qqghc-lib-parserFinds outermost type-family applications occurring in a type, after expanding synonyms. In the list (F, tys) that is returned we guarantee that tys matches F's arity. For example, given type family F a :: * -> * (arity 1) calling tcTyFamInsts on (Maybe (F Int Bool) will return (F, [Int]), not (F, [Int,Bool])This is important for its use in deciding termination of type instances (see #11581). E.g. type instance G [Int] = ...(F Int )... we don't need to take into account when asking if the calls on the RHS are smaller than the LHSqghc-lib-parserLike q, except that the output records whether the type family and its arguments occur as an  invisible argument in some type application. This information is useful because it helps GHC know when to turn on -fprint-explicit-kinds during error reporting so that users can actually see the type family being mentioned.As an example, consider: class C a data T (a :: k) type family F a :: k instance C (T @(F Int) (F Bool)) -There are two occurrences of the type family F in that C instance, so q (C (T @(F Int) (F Bool))) will return: [ (J, F, [Int]) , (G, F, [Bool]) ] F Int is paired with J since it appears as an  invisible argument to C , whereas F Bool is paired with G since it appears an a visible argument to C. See also 'Note [Kind arguments in error messages] in  GHC.Tc.Errors.qghc-lib-parserIn an application of a  to some arguments, find the outermost occurrences of type family applications within the arguments. This function will not consider the 4 itself when checking for type family applications.See q for more details on how this works (as this function is called inside of q).qghc-lib-parserCheck that a type does not contain any type family applications.qghc-lib-parserReturns the (kind, type) variables in a type that are as-yet-unknown: metavariables and RuntimeUnksqghc-lib-parser-Make a sigma ty where all type variables are ,>. That is, they cannot be used with visible type application.qghc-lib-parserMake a sigma ty where all type variables are "specified". That is, they can be used with visible type applicationrghc-lib-parser$Splits a forall type into a list of As and the inner type. Always succeeds, even if it returns an empty list.rghc-lib-parserSplits a type into a TyBinder and a body, if possible. Panics otherwiserghc-lib-parserLike r, but splits off only named binders, returning just the tyvars.rghc-lib-parserLike r, but only splits As with + type variable binders.rghc-lib-parserLike r, but only splits a A if argf_pred argf is J, where argf is the visibility of the ForAllTy's binder and  argf_pred is a predicate over visibilities provided as an argument to this function.rghc-lib-parserLike r, but only splits As with += type variable binders. All split tyvars are annotated with ().rghc-lib-parserLike r, but only splits As with + type variable binders. All split tyvars are annotated with their .rghc-lib-parserLike r$, but splits off only named binders.rghc-lib-parser'Is this a ForAllTy with a named binder?rghc-lib-parser4Split a sigma type into its parts. This only splits  invisible type variable binders, as these are the only forms of binder that the typechecker will implicitly instantiate.rghc-lib-parser (a -> f b) -> s -> f t if you called tcSplitSigmaTy on this type: 2forall s t a b. Each s t a b => Traversal s t a b then it would return .([s,t,a,b], [Each s t a b], Traversal s t a b). But if you instead called tcSplitNestedSigmaTys on the type, it would return ([s,t,a,b,f], [Each s t a b, Applicative f], (a -> f b) -> s -> f t).rghc-lib-parserLike E, but only returns the .rghc-lib-parserSplit off exactly the specified number argument types Returns (Left m) if there are m missing arrows in the type (Right (tys,res)) if the type looks like t1 -> ... -> tn -> resrghc-lib-parser?Strips off n *visible* arguments and returns the resulting typerghc-lib-parserReturns the number of arguments in the given type, without looking through synonyms. This is used only for error reporting. We don't look through synonyms because of #11313.rghc-lib-parserIf the type is a tyvar, possibly under a cast, returns it, along with the coercion. Thus, the co is :: kind tv ~N kind typerghc-lib-parser Just like , but will return True for types of different kinds as long as their non-coercion structure is identical.rghc-lib-parserCheck whether two TyConApps are the same; if the number of arguments are different, just checks the common prefix of arguments.rghc-lib-parserLike , but returns True if the visible part of the types are equal, even if they are really unequal (in the invisible bits)rghc-lib-parserLike pickyEqTypeVis$, but returns a Bool for conveniencerghc-lib-parserLike r, but also says J for q typesrghc-lib-parser8Is the type inhabited by machine floating-point numbers?Used to check that we don't use floating-point literal patterns in Core.See #9238 and Note [Rules for floating-point comparisons] in GHC.Core.Opt.ConstantFold.rghc-lib-parser Is a type ?rghc-lib-parserFor every arg a tycon can take, the returned list says True if the argument is taken visibly, and False otherwise. Ends with an infinite tail of Trues to allow for oversaturation.rghc-lib-parserIf the tycon is applied to the types, is the next argument visible?rghc-lib-parser2Should this type be applied to a visible argument?qghc-lib-parser Expected typeghc-lib-parser Actual type++++,,qqqqqqqq))?AAAAAAAAAAAAAAAAAABBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBCCCDDEEEEEEEEEEEEEEEEEEEEFFIIIIIIIIIIKKKKKKeeeeqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrqqqqqqqqqqqqqqqqqqqqqAqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqEqqqqqqqqqqqqqqqqqqqqqqqqErrrrrrrrrrrrrrrrrrErrrrrrErrrrrrEEEEErrrrrrrrrrrrrrrrrrrrE?rrrrrrreeeeqrqrrrrrrqqqqqqqqqqqqqqqqqqqqqqqqrrrrrrrrrrE))DF++,,,,++AAEEEEEAAAAAAAEAAAAKKKKKKrrrDFAABBBBBBBBBBBBBBBBCBCBBBBBBBBBBBBBBBBBCBBEEEAABBBBBBBBBIIIIIIIIIIqrrBrrrq0None3 rghc-lib-parserWhere to store evidence for expression holes See Note [Holes] in GHC.Tc.Types.Constraintrghc-lib-parser Evidence for  CallStack implicit parameters.rghc-lib-parserEvCsPushCall origin loc stk represents a call from origin, occurring at loc, in a calling context stk.rghc-lib-parserInstructions on how to make a Typeable0 dictionary. See Note [Typeable evidence terms]rghc-lib-parserDictionary for  Typeable T where T is a type constructor with all of its kind variables saturated. The [EvTerm] is Typeable" evidence for the applied kinds..rghc-lib-parserDictionary for Typeable (s t), given a dictionaries for s and t.rghc-lib-parserDictionary for Typeable (s % w -> t), given a dictionaries for w, s, and t.rghc-lib-parser%Dictionary for a type literal, e.g. Typeable "foo" or  Typeable 3 The r is evidence of, e.g.,  KnownNat 3 (see #10348)sghc-lib-parserThis version does a slow check, calculating the related types and seeing if they are equal.sghc-lib-parserIf the EqRel is ReprEq, makes a SubCo; otherwise, does nothing. Note that the input coercion should always be nominal.sghc-lib-parserIf a ! is !$, flip the orientation of a coercionsghc-lib-parserSmart constructor to create a s s.PRECONDITION: the "from" type of the first wrapper must have a fixed RuntimeRep (see Note [Fixed RuntimeRep] in GHC.Tc.Utils.Concrete).sghc-lib-parserIdentifies the  lambda-bound dictionaries of an s. This is used (only) to allow the pattern-match overlap checker to know what Given dictionaries are in scope.7We specifically do not collect dictionaries bound in a s. These are either superclasses of lambda-bound ones, or (extremely numerous) results of binding Wanted dictionaries. We definitely don't want all those cluttering up the Given dictionaries for pattern-match overlap checking!sghc-lib-parser,Any sort of evidence Id, including coercionssghc-lib-parserd |> cosghc-lib-parser Create a  that unwraps an implicit-parameter dictionary to expose the underlying value. We expect the - to have the form `IP sym ty`, and return a  `co :: IP sym ty ~ ty`sghc-lib-parser Create a > that wraps a value in an implicit-parameter dictionary. See s.sghc-lib-parserConvert the QuoteWrapper into a normal HsWrapper which can be used to apply its contents.sghc-lib-parser-The Semigroup instance is a bit fishy, since  WpCompose, as a data constructor, is "syntactic" and not associative. Concretely, if a, b, and c aren't WpHole: (a <> b) <> c ?= a <> (b <> c)> (a `WpCompose` b) `WpCompose` c /= @ a `WpCompose` (b `WpCompose` c)However these two associations are are "semantically equal" in the sense that they produce equal functions when passed to GHC.HsToCore.Binds.dsHsWrapper.rghc-lib-parser&where to write the erroring expressionghc-lib-parser expected type of that expressionghc-lib-parserfor debug output onlysghc-lib-parserthe "from" type of the first wrapper MUST have a fixed RuntimeRepghc-lib-parsereither type of the second wrapper (used only when the second wrapper is the identity)!!!!4444ArrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssrrrrrrrrrrrrssssssssssrrrrrssssssrrrrrrrrrsssssssssssssrrrrrrrrrrssssAsss4444!!!!ssssssssssssssssssssssssssssssssssssrrssNone3 tghc-lib-parserSet of visible orphan modules, according to what modules have been directly imported. This is based off of the dep_orphs field, which records transitively reachable orphan modules (modules that define orphan instances).tghc-lib-parsert represents the combination of the global type class instance environment, the local type class instance environment, and the set of transitively reachable orphan modules (according to what modules have been directly imported) used to test orphan instance visibility.tghc-lib-parserA type-class instance. Note that there is some tricky laziness at work here. See Note [ClsInst laziness and the rough-match fields] for more details.tghc-lib-parser Class nametghc-lib-parserTop of type args The class itself is always the first element of this listtghc-lib-parseris_dfun_name = idName . is_dfun.We use t for the visibility check, t, which needs to know the   which the dictionary is defined in. However, we cannot use the   attached to t since doing so would mean we would potentially pull in an entire interface file unnecessarily. This was the cause of #12367.tghc-lib-parserA fuzzy comparison function for class instances, intended for sorting instances before displaying them to the user.tghc-lib-parserCollects the names of concrete types and type constructors that make up the head of a class instance. For instance, given `class Foo a b`:`instance Foo (Either (Maybe Int) a) Bool` would yield [Either, Maybe, Int, Bool].Used in the implementation of ":info" in GHCi.The r is because of instance Foo a => Baz T where ... The decl is an orphan if Baz and T are both not locally defined, even if Foo *is* locally definedtghc-lib-parserTest if an instance is visible, by checking that its origin module is in t2. See Note [Instance lookup and orphan instances]tghc-lib-parserChecks for an exact match of ClsInst in the instance environment. We use this when we do signature checking in  GHC.Tc.Moduletghc-lib-parser/Makes no particular effort to detect conflicts.tghc-lib-parserTrue when when the instance heads are the same e.g. both are Eq [(a,b)] Used for overriding in GHCi Obviously should be insensitive to alpha-renamingtghc-lib-parserLook up an instance in the given instance environment. The given class application must match exactly one instance and the match may not contain any flexi type variables. If the lookup is unsuccessful, yield 'Left errorMessage'.tghc-lib-parserSee Note [Rules for instance lookup] ^ See Note [Safe Haskell Overlapping Instances] in  GHC.Tc.Solver ^ See Note [Safe Haskell Overlapping Instances Implementation] in  GHC.Tc.Solvertghc-lib-parserthe name of the classghc-lib-parser)the rough match signature of the instanceghc-lib-parserthe  of the dictionary bindingghc-lib-parserthe  of the dictionary.ghc-lib-parsermay this instance overlap?ghc-lib-parseris this instance an orphan? !+LLssttttttttttttttttttttttttttttttttttttttttttttttttttttttttttt+ttssttt !tttttttttttttttttttttttttttttttttttttttttttttttttttLLtttNone tghc-lib-parserThe t/ is essentially a cache for information in the ModIface for home modules only. Information relating to packages will be loaded into global environments in ExternalPackageState.tghc-lib-parserLocal type environment for this particular module Includes Ids, TyCons, PatSynstghc-lib-parserDFunId"s for the instances in this moduletghc-lib-parserDomain may include Ids from other modulestghc-lib-parserAnnotations present in this module: currently they only annotate things also declared in this moduletghc-lib-parser&Complete match pragmas for this moduletghc-lib-parserConstructs an empty ModDetails tttttttttt ttttttttttNone tghc-lib-parserCoercion optimisation optionstghc-lib-parser.Enable coercion optimisation (reduce its size)tghc-lib-parseroptCoercion applies a substitution to a coercion, *and* optimises it to reduce its sizetghc-lib-parserCheck to make sure that an AxInstCo is internally consistent. Returns the conflicting branch, if it exists See Note [Conflict checking with AxiomInstCo]ttttttttttNone stghc-lib-parser3Show a SDoc as a String with the default user styletghc-lib-parser4Allows caller to specify the PrintUnqualified to usettttttttNone tghc-lib-parser!Initialize LogFlags from DynFlagsttNone tt None <= tghc-lib-parserAtomically update the reference. Does not force the evaluation of the new variable contents. For strict update, use t.tghc-lib-parserStrict variant of t.tghc-lib-parser2Perform a computation with a different environmenttghc-lib-parser1Perform a computation with an altered environment<46$#"TSX ttttttttttttttttttttttttttttttttttttttttttttNone Y tghc-lib-parser;The analysis lattice of arity analysis. It is isomorphic to  data ArityType' = AEnd Divergence | ALam OneShotInfo ArityType' 1Which is easier to display the Hasse diagram for:  ALam OneShotLam at | AEnd topDiv | ALam NoOneShotInfo at | AEnd exnDiv | AEnd botDiv  where the at fields of ALam6 are inductively subject to the same order. That is, ALam os at1 < ALam os at2 iff  at1 < at2.Why the strange Top element? See Note [Combining case branches].We rely on this lattice structure for fixed-point iteration in u. For the semantics of t, see Note [ArityType].ughc-lib-parser AT oss div- means this value can safely be eta-expanded  length oss( times, provided use sites respect the !s in oss. A ! annotation can come from two sources: * The user annotated a lambda as one-shot with  * It's from a lambda binder of a type affected by `-fstate-hack`. See W. In both cases, ! should win over !&, see Note [Combining case branches].If div is dead-ending (N), then application to  length os? arguments will surely diverge, similar to the situation with N.ughc-lib-parsermanifestArity sees how many leading value lambdas there are, after looking through castsughc-lib-parser!An approximate, fast, version of uughc-lib-parser+The number of value args for the arity typeughc-lib-parserTrue  =+ eta-expansion will add at least one lambdaughc-lib-parserExpand a non-bottoming arity type so that it has at least the given arity.ughc-lib-parserThe Arity returned is the number of value args the expression can be applied to without doing much workughc-lib-parser etaExpand n e1 returns an expression with the same meaning as e, but with arity n.Given: e' = etaExpand n eWe should have that: ty = exprType e = exprType e'ughc-lib-parserSplit an expression into the given number of binders and a body, eta-expanding if necessary. Counts value *and* type binders.ughc-lib-parser(This is the BNF of the generated output:  @ We format AT [o1,..,on] topDiv as o1..on.T and AT [o1,..,on] botDiv as o1..on.E", respectively. More concretely, AT [NOI,OS,OS] topDiv is formatted as ?11.T6. If the one-shot info is empty, we omit the leading .@.tuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuutuuuuuuuuuuuuuuuuNone& ;ughc-lib-parser? ughc-lib-parser4Maps of docs that were added via Template Haskell's putDoc.ughc-lib-parser4The added module header documentation, if it exists.ughc-lib-parser(The documentation added to declarations.ughc-lib-parser.The documentation added to function arguments.ughc-lib-parser6The documentation added to class and family instances.ughc-lib-parserModule header.ughc-lib-parserDocs for declarations: functions, data types, instances, methods etc. A list because sometimes subsequent haddock comments can be combined into oneughc-lib-parser>Docs for arguments. E.g. function arguments, method arguments.ughc-lib-parserMap from chunk name to content.This map will be empty unless we have an explicit export list from which we can reference the chunks.ughc-lib-parserHaddock options from OPTIONS_HADDOCK or from  -haddock-opts.ughc-lib-parserThe ! used in the module, for example .ughc-lib-parser7The full set of language extensions used in the module.ughc-lib-parserA simplified version of .ughc-lib-parserAnnotate a value with the probable identifiers found in it These will be used by haddock to generate links.The identifiers are bundled along with their location in the source file. This is useful for tooling to know exactly where they originate.This type is currently used in two places - for regular documentation comments, with a set to <, and for adding identifier information to warnings, where a is  StringLiteralughc-lib-parser8A docstring with the (probable) identifiers found in it.ughc-lib-parserExtract a mapping from the lexed identifiers to the names they may correspond to.ughc-lib-parserPretty print a thing with its doc The docstring will include the comment decorators '-- |', '{-|' etc and will come either before or after depending on how it was written i.e it will come after the thing if it is a '-- ^' or '{-^' and before otherwise.ughc-lib-parserSee  pprWithHsDocughc-lib-parser6Print a doc with its identifiers, useful for debuggingughc-lib-parserFor compatibility with the existing @-ddump-parsed' output, we only show the docstring.Use pprHsDoc to show u 's internals.ughc-lib-parserWe might re-export avails from multiple modules with a single export declaration. E.g. when we have 7module M (module X) where import R0 as X import R1 as X;uuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuu"uuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuNone 23>? ughc-lib-parser Warning information for a moduleughc-lib-parserNothing deprecatedughc-lib-parserWhole module deprecatedughc-lib-parserSome specific things deprecatedughc-lib-parser Warning Text6reason/explanation from a WARNING or DEPRECATED pragmaughc-lib-parserConstructs the cache for the  mi_warn_fn field of a ModIface uuuuuuuuuuu uuuuuuuuuuuNone/3>? @!ughc-lib-parserImported or Exported Wildcardughc-lib-parserImported or exported entity.ughc-lib-parserImported or Exported Variableughc-lib-parser+Imported or exported Thing with Absent list+The thing is a Class/Type (can't tell) - 2s : 2, 2,2vghc-lib-parser8Imported or exported Thing with All imported or exportedThe thing is a Class"Type and the All refers to methods constructors2s : 2 , 2,2#, 2vghc-lib-parser:Imported or exported Thing With given imported or exportedThe thing is a Class/Type and the imported or exported things are methods/constructors and record fields; see Note [IEThingWith] - 2s : 2%, 2%, 2%, 2vghc-lib-parser$Imported or exported module contents (Export Only)2s : 2vghc-lib-parserDoc section headingvghc-lib-parserSome documentationvghc-lib-parserReference to named docvghc-lib-parserLocated Import or Exportvghc-lib-parser(Located name with possible adornment - 2s : 2 , 2vghc-lib-parserA name in an import or export specification which may have adornments. Used primarily for accurate pretty printing of ParsedSource, and API Annotation placement. The : is the location of the adornment in the original source.vghc-lib-parserno extravghc-lib-parser pattern Xvghc-lib-parser type (:+:)vghc-lib-parserImport DeclarationA single Haskell import declaration.vghc-lib-parser2s22, 2 for ideclSource2,2, 2,2, 22,2, 2) attached to location in ideclHidingvghc-lib-parser Module name.vghc-lib-parserPackage qualifier.vghc-lib-parserIsBoot  = {-# SOURCE #-} importvghc-lib-parserTrue => safe importvghc-lib-parserIf/how the import is qualified.vghc-lib-parser$True => implicit import (of Prelude)vghc-lib-parser as Modulevghc-lib-parser(True => hiding, names)vghc-lib-parserIf/how an import is  qualified.vghc-lib-parser qualified! appears in prepositive position.vghc-lib-parser qualified" appears in postpositive position.vghc-lib-parserNot qualified.vghc-lib-parserLocated Import Declarationvghc-lib-parserGiven two possible located  qualified tokens, compute a style (in a conforming Haskell program only one of the two can be not H). This is called from  GHC.Parser.vghc-lib-parserConvenience function to answer the question if an import decl. is qualified.vghc-lib-parserWhen in a list this may have2 : 2vghc-lib-parserWhen in a list this may have2 : 2:uuuuvvvvvvuvuvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv:vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvuvvvvvvuvuuuuvvvvvvvvvNone-3>? %0vghc-lib-parserOverloaded Literal Valuevghc-lib-parserInteger-looking literals;vghc-lib-parserFrac-looking literalsvghc-lib-parserString-looking literalsvghc-lib-parserHaskell Overloaded Literalvghc-lib-parserHaskell Literalvghc-lib-parser Charactervghc-lib-parserUnboxed charactervghc-lib-parserStringvghc-lib-parser Packed bytesvghc-lib-parserGenuinely an Int; arises from GHC.Tc.Deriv.Generate, and from TRANSLATIONvghc-lib-parserliteral Int#vghc-lib-parserliteral Word#vghc-lib-parserliteral Int64#vghc-lib-parserliteral Word64#vghc-lib-parserGenuinely an integer; arises only from TRANSLATION (overloaded literals are done with HsOverLit)vghc-lib-parserGenuinely a rational; arises only from TRANSLATION (overloaded literals are done with HsOverLit)vghc-lib-parser Unboxed Floatvghc-lib-parserUnboxed Doublevghc-lib-parserv p l returns J if a literal l- needs to be parenthesized under precedence p.vghc-lib-parserv p ol returns J if an overloaded literal ol, needs to be parenthesized under precedence p.vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvNone-/23>? Gvghc-lib-parserAmbiguous Field OccurrenceRepresents an *occurrence* of a field that is potentially ambiguous after the renamer, with the ambiguity resolved by the typechecker. We always store the 0 that the user originally wrote, and store the selector function after the renamer (for unambiguous occurrences) or the typechecker (for ambiguous occurrences).+See Note [HsRecField and HsRecUpdField] in  GHC.Hs.Pat". See Note [Located RdrNames] in  GHC.Hs.Expr.vghc-lib-parser!Located Ambiguous Field Occurencevghc-lib-parserField OccurrenceRepresents an *occurrence* of a field. This may or may not be a binding occurrence (e.g. this type is used in v and RecordPatSynField' which bind their fields, but also in  HsRecField5 for record construction and patterns, which do not).We store both the 0 the user originally wrote, and after the renamer we use the extension field to store the selector function.vghc-lib-parserLocated Field Occurrencevghc-lib-parserDescribes the arguments to a data constructor. This is a common representation for several constructor-related concepts, including:The arguments in a Haskell98-style constructor declaration (see HsConDeclH98Details in  GHC.Hs.Decls).)The arguments in constructor patterns in case/function definitions (see HsConPatDetails in  GHC.Hs.Pat).The left-hand side arguments in a pattern synonym binding (see HsPatSynDetails in  GHC.Hs.Binds).One notable exception is the arguments in a GADT constructor, which uses a separate data type entirely (see HsConDeclGADTDetails in  GHC.Hs.Decls). This is because GADT constructors cannot be declared with infix syntax, unlike the concepts above (#18844).vghc-lib-parserConstructor Declaration Fieldvghc-lib-parser2 : 2vghc-lib-parserSee Note [ConDeclField passs]vghc-lib-parser%Located Constructor Declaration Fieldwghc-lib-parserHaskell Tuple Sortwghc-lib-parserThis is used in the syntax. In constructor declaration. It must keep the arrow representation.wghc-lib-parser2Denotes the type of arrows in the surface languagewghc-lib-parsera -> b or a C bwghc-lib-parsera %1 -> b or a %1 C b, or a E bwghc-lib-parsera %m -> b or a %m C b (very much including `a %Many -> b`! This is how the programmer wrote it). It is stored as an w9 so as to preserve the syntax as written in the program.wghc-lib-parserHaskell Type Literalwghc-lib-parser Haskell Typewghc-lib-parser2 : 2 , 2,2= For details on above see Note [exact print annotations] in GHC.Parser.Annotationwghc-lib-parser2 : Nonewghc-lib-parser2 : Nonewghc-lib-parser2 : 2,wghc-lib-parser2 : 2 '[' , 2 ']'wghc-lib-parser2 : 2  '(' or '(#' , 2  ')' or '#)'wghc-lib-parser2 : 2 '(#' , 2 '#)'@wghc-lib-parser2 : Nonewghc-lib-parser2 : 2 '(' , 2 ')'wghc-lib-parser  (?x :: ty)2 : 2wghc-lib-parser2 : Nonewghc-lib-parser  (ty :: kind)2 : 2 '(' , 2,2 ')'wghc-lib-parser2 : 2 '$(' , 2 ')'wghc-lib-parser2 : Nonewghc-lib-parser2 : 2 '{-# UNPACK' or '{-# NOUNPACK' , 2 '#-}' 2 '!'wghc-lib-parser2 : 2 '{' , 2 '}'wghc-lib-parser2 : 2 "'[" , 2 ']'wghc-lib-parser2 : 2 "'(" , 2 ')'wghc-lib-parser2 : Nonewghc-lib-parser2 : Nonewghc-lib-parserHaskell Type Variable Binder The flag annotates the binder. It is  in places where explicit specificity is allowed (e.g. x :: forall {a} b. ...) or () in other places.wghc-lib-parser2 : 2 , 2, 2wghc-lib-parserThese names are used early on to store the names of implicit parameters. They completely disappear after type-checking.wghc-lib-parser A type signature that obeys the forall&-or-nothing rule. In other words, an w that uses an w to represent its outermost type variable quantification. See #Note [Representing type signatures].wghc-lib-parser'Located Haskell Signature Wildcard Typewghc-lib-parserLocated Haskell Wildcard Typewghc-lib-parserLocated Haskell Signature Typewghc-lib-parserThe extension field for w2, which is only used in the renamer onwards. See ,Note [Pattern signature binders and scoping].wghc-lib-parserWildcard nameswghc-lib-parserImplicitly bound variable nameswghc-lib-parserTypes that can appear in pattern signatures, as well as the signatures for term-level binders in RULES. See ,Note [Pattern signature binders and scoping].This is very similar to  HsSigWcType., but with slightly different semantics: see Note [HsType binders] . See also #Note [The wildcard story for types].wghc-lib-parserAfter renamer: wwghc-lib-parserMain payload (the type itself)wghc-lib-parserHaskell Wildcard Binderswghc-lib-parser.Used for type-family instance equations, e.g., 'type instance forall a. F [a] = Tree a The notion of specificity is irrelevant in type family equations, so we use () for the w flag.wghc-lib-parserUsed for signatures, e.g., f :: forall a {b}. blah We use  for the w flag to allow distinguishing between specified and inferred type variables.wghc-lib-parser6The outermost type variables in a type that obeys the forall-or-nothing rule. See Note [forall-or-nothing rule].wghc-lib-parserImplicit forall, e.g., f :: a -> b -> bwghc-lib-parserExplicit forall, e.g., f :: forall a b. a -> b -> bwghc-lib-parser)Located Haskell Quantified Type Variableswghc-lib-parser$Located Haskell Type Variable Binderwghc-lib-parser The type variable binders in an w . See also 1Note [Variable Specificity and Forall Visibility] in GHC.Tc.Gen.HsType.wghc-lib-parser A visible forall (e.g., forall a -> {...}). These do not have any notion of specificity, so we use () as a placeholder value.wghc-lib-parser An invisible forall (e.g., forall a {b} c. {...}), where each binder has a .wghc-lib-parserLocated Haskell Kindwghc-lib-parser Haskell Kindwghc-lib-parserLocated Haskell Typewghc-lib-parserHaskell Contextwghc-lib-parserLocated Haskell Contextwghc-lib-parser Bang TypeIn the parser, strictness and packedness annotations bind more tightly than docstrings. This means that when consuming a w (and looking for w8) we must be ready to peer behind a potential layer of w . See #15206 for motivation and  getBangType for an example.wghc-lib-parserLocated Bang Typewghc-lib-parser Does this w' come with an explicit kind annotation?wghc-lib-parserAn empty list that can be used to indicate that there are no type arguments allowed in cases where HsConDetails is applied to Void.wghc-lib-parserw id fixity args! pretty-prints an application of id to args , using the fixity to tell whether id. should be printed prefix or infix. Examples: pprHsArgsApp T Prefix [HsTypeArg Bool, HsValArg Int] = T @Bool Int pprHsArgsApp T Prefix [HsTypeArg Bool, HsArgPar, HsValArg Int] = (T @Bool) Int pprHsArgsApp (++) Infix [HsValArg Char, HsValArg Double] = Char ++ Double pprHsArgsApp (++) Infix [HsValArg Char, HsValArg Double, HsVarArg Ordering] = (Char ++ Double) Ordering wghc-lib-parserThis instance is meant for debug-printing purposes. If you wish to pretty-print an application of vs, use w instead.vghc-lib-parser May have 2 : 2 when in a listwghc-lib-parser2 : 2wghc-lib-parser May have 2 : 2 when in a listwghc-lib-parser2 : 2 For details on above see Note [exact print annotations] in GHC.Parser.AnnotationLMMMMMMMMMMMMMvvvvvvvvvvvvvvvvvvvvvvvvvvvvwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwvvvvwwvwwMMMMMMMMMMLMMMvvvvvvvvvvvvwvvvvvvvvvvvwwwwNone&-/567>? Rvghc-lib-parserPattern : xghc-lib-parserHaskell Field Binding : ,For details on above see Note [exact print annotations] in GHC.Parser.Annotationxghc-lib-parser!Filled in by renamer when punningxghc-lib-parserNote [Punning]xghc-lib-parserHaskell Record Update Fieldxghc-lib-parserHaskell Record Fieldxghc-lib-parser#Located Haskell Record Update Fieldxghc-lib-parserLocated Haskell Record Fieldxghc-lib-parserLocated Haskell Record Fieldxghc-lib-parserHaskell Record FieldsHsRecFields is used only for patterns and expressions (not data type declarations)xghc-lib-parser#Haskell Constructor Pattern Detailsxghc-lib-parserWildcard Pattern The sole reason for a type on a WildPat is to support hsPatType :: Pat Id -> Typexghc-lib-parserVariable Patternxghc-lib-parserLazy Pattern ^ -  : xghc-lib-parserAs pattern ^ -  : xghc-lib-parserBang pattern ^ -  : xghc-lib-parserSyntactic List :  '['&,  ']'xghc-lib-parserTuple sub-patterns :  '(' or '(#',  ')' or '#)'xghc-lib-parserAnonymous sum pattern :  '(#',  '#)'xghc-lib-parserConstructor Patternxghc-lib-parser View Patternxghc-lib-parser&Splice Pattern (Includes quasi-quotes)xghc-lib-parserLiteral Pattern Used for *non-overloaded* literal patterns: Int, Char, Int, Char, String, etc.xghc-lib-parserNatural Pattern :  xghc-lib-parser n+k patternxghc-lib-parserPattern with a type signaturexghc-lib-parserParenthesised patternghc-lib-parser :  '('&,  ')'+vvxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxx+vxxxxxxxxxxxxxxxxxxxxvxxxxxxxxxxxxxxxxxxxxxNone&->? o5xghc-lib-parser!Haskell Pattern Synonym Directionxghc-lib-parserRecord Pattern Synonym Fieldxghc-lib-parser'Field label visible in rest of the filexghc-lib-parser=Filled in by renamer, the name used internally by the patternxghc-lib-parserHaskell Pattern Synonym Detailsxghc-lib-parserFixity Signaturexghc-lib-parserLocated Fixity Signaturexghc-lib-parserSignatures and pragmasxghc-lib-parserAn ordinary type signature f :: Num a => a -> aAfter renaming, this list of Names contains the named wildcards brought into scope by this signature. For a signature _ -> _a -> Bool., the renamer will leave the unnamed wildcard _$ untouched, and the named wildcard _a is then replaced with fresh meta vars in the type. Their names are stored in the type signature that brought them into scope, in this third field to be more specific. :  , xghc-lib-parser A pattern synonym type signature ,pattern Single :: () => (Show a) => a -> [a] :  , , ,xghc-lib-parserA signature for a class method False: ordinary class-method signature True: generic-default class method signature e.g. class C a where op :: a -> a -- Ordinary default op :: Eq a => a -> a -- Generic default No wildcards allowed here :  , xghc-lib-parserA type signature in generated code, notably the code generated for record selectors. We simply record the desired Id itself, replete with its name, type and IdDetails. Otherwise it's just like a type signature: there should be an accompanying bindingxghc-lib-parserAn ordinary fixity declaration  infixl 8 *** :  , xghc-lib-parserAn inline pragma {#- INLINE f #-} :   '{-# INLINE' and '[' , , , , , xghc-lib-parserA specialisation pragma "{-# SPECIALISE f :: Int -> Int #-} : ,  '{-# SPECIALISE' and '[', , ,  ']' and '#-}', xghc-lib-parser6A specialisation pragma for instance declarations only ${-# SPECIALISE instance Eq [Int] #-}(Class tys); should be a specialisation of the current instance declaration : , ,xghc-lib-parser$A minimal complete definition pragma ${-# MINIMAL a | (b, c | (d | e)) #-} : , ,, xghc-lib-parser+A "set cost centre" pragma for declarations {-# SCC funName #-}or &{-# SCC funName "cost_centre_name" #-}xghc-lib-parserA complete match pragma {-# COMPLETE C, D [:: T] #-}Used to inform the pattern match checker about additional complete matchings which, for example, arise from pattern synonym definitions.xghc-lib-parserLocated Signaturexghc-lib-parserImplicit parameter bindings. : xghc-lib-parser"Located Implicit Parameter Binding May have  :  when in a listxghc-lib-parser#Haskell Implicit Parameter Bindingsxghc-lib-parser : , ,, , '{',  '}',Pattern Synonym bindingxghc-lib-parserName of the pattern synonymxghc-lib-parserFormal parameter namesxghc-lib-parserRight-hand sidexghc-lib-parserDirectionalityxghc-lib-parser1Haskell Binding with separate Left and Right id'sxghc-lib-parserFunction-like Binding'FunBind is used for both functions f x = e) and variables  f = x -> e) and strict variables  !x = x + 1/Reason 1: Special case for type inference: see .Reason 2: Instance decls can only have FunBinds, which is convenient. If you change this, you'll need to change e.g. rnMethodBinds'But note that the form f :: a->a = ... parses as a pattern binding, just like (f :: a -> a) = ... 6Strict bindings have their strictness recorded in the M of their  MatchContext. See Note [FunBind vs PatBind] for details about the relationship between FunBind and PatBind.s), attached to each element of fun_matches,, ,,xghc-lib-parserPattern BindingThe pattern is never a simple variable; That case is done by FunBind. See Note [FunBind vs PatBind] for details about the relationship between FunBind and PatBind.xghc-lib-parserVariable BindingDictionary binding and suchlike. All VarBinds are introduced by the type checkerxghc-lib-parser :  , , ,   '{', '}'xghc-lib-parser The payloadxghc-lib-parserTicks to put on the rhs, if anyxghc-lib-parserTicks to put on the rhs, if any, and ticks to put on the bound variables.xghc-lib-parserLocated only for consistencyxghc-lib-parserLocated Haskell Binding with separate Left and Right identifier typesxghc-lib-parserLocated Haskell Bindings with separate Left and Right identifier typesxghc-lib-parserHaskell Bindingxghc-lib-parserLocated Haskell Bindingsxghc-lib-parserLocated Haskell Bindingxghc-lib-parserHaskell Value bindings with separate Left and Right identifier types (not implicit parameters) Used for both top level and nested bindings May contain pattern synonym bindingsxghc-lib-parserValue Bindings InBefore renaming RHS; idR is always RdrName Not dependency analysed Recursive by defaultxghc-lib-parserValue Bindings OutAfter renaming RHS; idR can be Name or Id Dependency analysed, later bindings in the list may depend on earlier ones.xghc-lib-parserHaskell Value Bindingsxghc-lib-parserHaskell Local Bindings with separate Left and Right identifier typesBindings in a 'let' expression or a 'where' clausexghc-lib-parserHaskell Value Bindingsxghc-lib-parser#Haskell Implicit Parameter Bindingsxghc-lib-parserEmpty Local Bindingsxghc-lib-parserLocated Haskell local bindingsxghc-lib-parserHaskell Local Bindingsyghc-lib-parser7Extracts the name for a SPECIALIZE instance pragma. In y, the src field of x signature contains the SourceText for a SPECIALIZE instance pragma of the form: "SourceText {-# SPECIALIZE"Extraction ensures that all variants of the pragma name (with a Z or an S+) are output exactly as used in the pragma.xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxyyyyyyyyxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxyyyyyyyyxxxxxxxxxNone&-/23>? dyghc-lib-parserRole Annotation Declarationyghc-lib-parser :  , yghc-lib-parser#Located Role Annotation Declarationyghc-lib-parserAnnotation Provenanceyghc-lib-parserAnnotation Declarationyghc-lib-parser :  ,   yghc-lib-parserLocated Annotation Declarationyghc-lib-parserWarning pragma Declarationyghc-lib-parser"Located Warning pragma Declarationyghc-lib-parserWarning pragma Declarationsyghc-lib-parserLocated Warning Declarationsyghc-lib-parser!Documentation comment Declarationyghc-lib-parser)Located Documentation comment Declarationyghc-lib-parser Rule Binderyghc-lib-parser : , ,yghc-lib-parserLocated Rule Binderyghc-lib-parserRule Declarationyghc-lib-parser : , ,  ,  , , , ,yghc-lib-parser-After renamer, free-vars from the LHS and RHSyghc-lib-parserNote [Pragma source text] in GHC.Types.Basicyghc-lib-parserForall'd type varsyghc-lib-parserForall'd term vars, before typechecking; after typechecking this includes all forall'd varsyghc-lib-parserLocated Rule Declarationyghc-lib-parserRule Declarationsyghc-lib-parserLocated Rule Declarationsyghc-lib-parserForeign Declarationyghc-lib-parser :  , , , yghc-lib-parserLocated Foreign Declarationyghc-lib-parserDefault Declarationyghc-lib-parsers :  , ,yghc-lib-parserLocated Default Declarationyghc-lib-parserWhich technique the user explicitly requested when deriving an instance.yghc-lib-parserGHC's "standard" strategy, which is to implement a custom instance for the data type. This only works for certain types that GHC knows about (e.g., ', 3, , when -XDeriveFunctor is enabled, etc.)yghc-lib-parser -XDeriveAnyClassyghc-lib-parser -XGeneralizedNewtypeDerivingyghc-lib-parser  -XDerivingViayghc-lib-parserA  y.yghc-lib-parser+Stand-alone 'deriving instance' declarationyghc-lib-parserThe instance type to derive. It uses an w9 because the context is allowed to be a single wildcard: !deriving instance _ => Eq (Foo a)4Which signifies that the context should be inferred.yghc-lib-parser :  , ,  , ,  , ,yghc-lib-parser3Located stand-alone 'deriving instance' declarationyghc-lib-parserInstance Declarationyghc-lib-parserLocated Instance Declarationyghc-lib-parserClass Instance Declaration -  :  ,  , ,, For details on above see Note [exact print annotations] in GHC.Parser.Annotationyghc-lib-parser : &, ,yghc-lib-parser"Located Class Instance Declarationyghc-lib-parserFamily EquationOne equation in a type family instance declaration, data family instance declaration, or type family default. See Note [Type family instance declarations in HsSyn] See Note [Family instance declaration binders]yghc-lib-parser : zghc-lib-parserOptional quantified type varszghc-lib-parserFixity used in the declarationzghc-lib-parser Data Family Instance Declarationzghc-lib-parser :  , , ,  , , zghc-lib-parser(Located Data Family Instance Declarationzghc-lib-parser Type Family Instance Declarationzghc-lib-parser :  , ,zghc-lib-parser(Located Type Family Instance Declarationzghc-lib-parser)Located type family default declarations.zghc-lib-parser MkT a b MkT :: forall b a. Eq a => MkT a b data T b where MkT1 :: Int -> T Int data T = Int MkT, Int | MkT2 data T a where Int MkT Int :: T Int s : , ,, ,, ,, ,data Constructor Declarationzghc-lib-parserThe outermost type variable binders, be they explicit or implicit. The S is used to anchor exact print annotations, AnnForall and AnnDot.zghc-lib-parserUser-written context (if any)zghc-lib-parserArguments; never infixzghc-lib-parser Result typezghc-lib-parserA possible Haddock comment.zghc-lib-parserTrue  = explicit user-written forall e.g. data T a = forall b. MkT b (b->a) con_ex_tvs = {b} False => con_ex_tvs is emptyzghc-lib-parserExistentials onlyzghc-lib-parserArguments; can be infixzghc-lib-parser$Located data Constructor Declarationzghc-lib-parser newtype Blah ...zghc-lib-parser  data Blah ...zghc-lib-parser!Located Standalone Kind Signaturezghc-lib-parser The types mentioned in a single deriving& clause. This can come in two forms, z or z, depending on whether the types are surrounded by enclosing parentheses or not. These parentheses are semantically different than w. For example,  deriving () means "derive zero classes" rather than "derive an instance of the 0-tuple".z use w because deriving clauses can mention type variables that aren't bound by the datatype, e.g. data T b = ... deriving (C [a])&should produce a derived instance for  C [a] (T b).zghc-lib-parserA deriving clause with a single type. Moreover, that type can only be a type constructor without any arguments. Example:  deriving Eqzghc-lib-parserA deriving clause with a comma-separated list of types, surrounded by enclosing parentheses. Example: deriving (Eq, C a)zghc-lib-parser A single deriving clause of a data declaration. : ,  , ,  , ,zghc-lib-parser;The user-specified strategy (if any) to use when deriving z.zghc-lib-parserThe types to derive.zghc-lib-parserHaskell Deriving clausezghc-lib-parserHaskell Data type Definitionzghc-lib-parser:Declares a data type or newtype, giving its constructors  data/newtype T a =  constrs! data/newtype instance T [a] =  constrs zghc-lib-parserContextzghc-lib-parserOptional kind signature.(Just k) for a GADT-style data, or  data instance decl, with explicit kind sigAlways Nothing for H98-syntax declszghc-lib-parserData constructorsFor data T a = T1 | T2 a the z s all have z. For data T a where { T1 :: T a } the  LConDecls all have z.zghc-lib-parser Optional  'deriving' clausezghc-lib-parserH if we're in an hs-boot file and the user said "type family Foo x where .."zghc-lib-parserIf the user supplied an injectivity annotation it is represented using InjectivityAnn. At the moment this is a single injectivity condition - see Note [Injectivity annotation]. `Located name` stores the LHS of injectivity condition. `[Located name]` stores the RHS of injectivity condition. Example:.type family Foo a b c = r | r -> a c where ...,This will be represented as "InjectivityAnn r [a, c]"zghc-lib-parser : , zghc-lib-parserLocated Injectivity Annotationzghc-lib-parsertype Family Declarationzghc-lib-parser : , , , , , , , , , zghc-lib-parserLocated type Family Declarationzghc-lib-parsertype Family Result Signaturezghc-lib-parser :zghc-lib-parser : ,, zghc-lib-parser : ,, , zghc-lib-parser$Located type Family Result Signaturezghc-lib-parserType or Class Groupzghc-lib-parserdoes this have a CUSK? See Note [CUSKs: complete user-supplied kind signatures]zghc-lib-parserA type or class declaration.zghc-lib-parser type/data family T :: *->* : , , ,, ,, ,, ,, zghc-lib-parsertype declaration : , ,zghc-lib-parserdata declaration : , , , , ,zghc-lib-parser :  , , , The tcdFDs will have ,   For details on above see Note [exact print annotations] in GHC.Parser.Annotationzghc-lib-parserPost renameer, FVszghc-lib-parserType constructorzghc-lib-parserType variables; for an associated type these include outer binderszghc-lib-parserFixity used in the declarationzghc-lib-parserPost renamer, CUSK flag, FVszghc-lib-parserPost renamer, FVs{ghc-lib-parser Context...{ghc-lib-parserFunctional deps{ghc-lib-parserMethods' signatures{ghc-lib-parserDefault methods{ghc-lib-parserAssociated types;{ghc-lib-parserAssociated type defaults{ghc-lib-parser Haddock docs{ghc-lib-parser&Located Declaration of a Type or Class{ghc-lib-parserSplice Declaration{ghc-lib-parserLocated Splice Declaration{ghc-lib-parser Haskell GroupA { is categorised into a {" before being fed to the renamer.{ghc-lib-parserA Haskell Declaration{ghc-lib-parserType or Class Declaration{ghc-lib-parserInstance declaration{ghc-lib-parserDeriving declaration{ghc-lib-parserValue declaration{ghc-lib-parserSignature declaration{ghc-lib-parserStandalone kind signature{ghc-lib-parser 'default' declaration{ghc-lib-parserForeign declaration{ghc-lib-parserWarning declaration{ghc-lib-parserAnnotation declaration{ghc-lib-parserRule declaration{ghc-lib-parser+Splice declaration (Includes quasi-quotes){ghc-lib-parser"Documentation comment declaration{ghc-lib-parserRole annotation declaration{ghc-lib-parserTrue  = argument is a data/newtype declaration.{ghc-lib-parser!type or type instance declaration{ghc-lib-parser type class{ghc-lib-parsertype/data family declaration{ghc-lib-parsertype family declaration{ghc-lib-parseropen type family info{ghc-lib-parserclosed type family info{ghc-lib-parserdata family declaration{ghc-lib-parser Convert a z to a >{ghc-lib-parserA short description of a DerivStrategy'.zghc-lib-parser May have  :  when in a listzghc-lib-parser May have  : # when in a GADT constructor listzghc-lib-parser The optional deriving clauses of a data declaration. Clauses is plural because one can specify multiple deriving clauses using the -XDerivingStrategies language extension. The list of zs corresponds to exactly what the user requested to derive, in order. If no deriving clauses were specified, the list is empty.{ghc-lib-parserWhen in a list this may have :  yyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{zzzzzzzzzzzzzzzzzzzzzzzzzzzzzz{zzzzzzzzzzzzzzzzzzzz{{{{{{{{zzzzzzzzzzzz{{{{{{{{{{{{{{zzzzzzzzzzzzyyyyyyyyyyyyzzzz{zzzzzzzzzzzzyyyyyzzzzzzzyyyyyyyyyyyyyyyyyyyyyyyyy{yyyyyyyyyyyyyyyyyyyyyyyyy{{yyyy {{{{yyyyyyyyyyyyyyyyyyyzzzzzzzzzzzzzzzzzzzzzyyyyyy{yyyyyyyyyyyyyyyyyyy{yyyyzzzzzzzzzz{{{{{{{{{{{{{{{{"(c) The University of Glasgow 2015/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportableSafe Safe {{{{{{{{"(c) The University of Glasgow 2003/BSD-style (see the file libraries/base/LICENSE)libraries@haskell.org experimentalportable Trustworthy#$'(./3589> M{ghc-lib-parserA location at which to attach Haddock documentation. Note that adding documentation to a ~< defined oustide of the current module will cause an error.{ghc-lib-parserAt the current module's header.{ghc-lib-parser,At a declaration, not necessarily top level.{ghc-lib-parser?At a specific argument of a function, indexed by its position.{ghc-lib-parserAt a class or family instance.{ghc-lib-parserTo avoid duplication between kinds and types, they are defined to be the same. Naturally, you would never have a type be |% and you would never have a kind be {, but many of the other constructors are shared. Note that the kind Bool is denoted with {, not {'. Similarly, tuple kinds are made with {, not |.{ghc-lib-parser&Annotation target for reifyAnnotations{ghc-lib-parserRole annotations{ghc-lib-parser nominal{ghc-lib-parser representational{ghc-lib-parser phantom{ghc-lib-parser _{ghc-lib-parser 2{ghc-lib-parser "Hello"{ghc-lib-parser'C', @since 4.16.0.0{ghc-lib-parserInjectivity annotation{ghc-lib-parserType family result signature{ghc-lib-parser no signature{ghc-lib-parser k{ghc-lib-parser = r, = (r :: k){ghc-lib-parser a{ghc-lib-parser (a :: k){ghc-lib-parser a{ghc-lib-parser {a}{ghc-lib-parser forall . => {ghc-lib-parser forall -> {ghc-lib-parser T a b{ghc-lib-parser T @k t{ghc-lib-parser t :: k{ghc-lib-parser a{ghc-lib-parser T{ghc-lib-parser 'T{ghc-lib-parser T + T{ghc-lib-parser T + TSee  Language.Haskell.TH.Syntax#infix{ghc-lib-parser T :+: T{ghc-lib-parser T :+: TSee  Language.Haskell.TH.Syntax#infix{ghc-lib-parser (T){ghc-lib-parser (,), (,,), etc.|ghc-lib-parser (#,#), (#,,#), etc.|ghc-lib-parser (#|#), (#||#), etc.|ghc-lib-parser ->|ghc-lib-parser %n ->1Generalised arrow type with multiplicity argument|ghc-lib-parser ~|ghc-lib-parser []|ghc-lib-parser '(), '(,), '(,,), etc.|ghc-lib-parser '[]|ghc-lib-parser (':)|ghc-lib-parser *|ghc-lib-parser  Constraint|ghc-lib-parser  0,1,2, etc.|ghc-lib-parser _|ghc-lib-parser ?x :: t|ghc-lib-parser"A pattern synonym's argument type.|ghc-lib-parser pattern P {x y z} = p|ghc-lib-parser pattern {x P y} = p|ghc-lib-parser pattern P { {x,y,z} } = p|ghc-lib-parser#A pattern synonym's directionality.|ghc-lib-parser pattern P x {<-} p|ghc-lib-parser pattern P x {=} p|ghc-lib-parser  pattern P x {<-} p where P x = e|ghc-lib-parserAs of template-haskell-2.11.0.0, | has been replaced by |.|ghc-lib-parserAs of template-haskell-2.11.0.0, | has been replaced by |.|ghc-lib-parserAs of template-haskell-2.11.0.0, | has been replaced by |.|ghc-lib-parser C { {-# UNPACK #-} !}a|ghc-lib-parserA single data constructor.The constructors for | can roughly be divided up into two categories: those for constructors with "vanilla" syntax (|, |, and |0), and those for constructors with GADT syntax (| and |). The | constructor, which quantifies additional type variables and class contexts, can surround either variety of constructor. However, the type variables that it quantifies are different depending on what constructor syntax is used:If a |: surrounds a constructor with vanilla syntax, then the | will only quantify  existential type variables. For example: % data Foo a = forall b. MkFoo a b In MkFoo, | will quantify b , but not a.If a |7 surrounds a constructor with GADT syntax, then the | will quantify all8 type variables used in the constructor. For example: > data Bar a b where MkBar :: (a ~ b) => c -> MkBar a b In MkBar, | will quantify a, b, and c.Multiplicity annotations for data types are currently not supported in Template Haskell (i.e. all fields represented by Template Haskell will be linear).|ghc-lib-parser C Int a|ghc-lib-parser C { v :: Int, w :: a }|ghc-lib-parser Int :+ a|ghc-lib-parser forall a. Eq a => C [a]|ghc-lib-parser C :: a -> b -> T b Int|ghc-lib-parser C :: { v :: Int } -> T b Int|ghc-lib-parserUnlike | and |, | refers to the strictness that the compiler chooses for a data constructor field, which may be different from what is written in source code. See ~ for more information.|ghc-lib-parser C a|ghc-lib-parser C {~}a|ghc-lib-parser C {!}a|ghc-lib-parser C a|ghc-lib-parser C { {-# NOUNPACK #-} } a|ghc-lib-parser C { {-# UNPACK #-} } a|ghc-lib-parserSince the advent of ConstraintKinds, constraints are really just types. Equality constraints use the | constructor. Constraints may also be tuples of other constraints.|ghc-lib-parser +{ {-# COMPLETE C_1, ..., C_i [ :: T ] #-} }|ghc-lib-parserOne equation of a type family instance or closed type family. The arguments are the left-hand-side type and the right-hand-side result.3For instance, if you had the following type family: type family Foo (a :: k) :: k where forall k (a :: k). Foo @k a = a The  Foo @k a = a* equation would be represented as follows: | (I [{ k, { a ({ k)]) ({ ({ ({ ''Foo) ({ k)) ({ a)) ({ a) |ghc-lib-parserCommon elements of | and }. By analogy with "head" for type classes and type class instances as defined in 0Type classes: an exploration of the design space, the TypeFamilyHead; is defined to be the elements of the declaration between  type family and where.|ghc-lib-parser8A pattern synonym's type. Note that a pattern synonym's fully specified type has a peculiar shape coming with two forall quantifiers and two constraint contexts. For example, consider the pattern synonym 'pattern P x1 x2 ... xn = *P's complete type is of the following form pattern P :: forall universals. required constraints => forall existentials. provided constraints => t1 -> t2 -> ... -> tn -> tconsisting of four parts: the (possibly empty lists of) universally quantified type variables and required constraints on them.the (possibly empty lists of) existentially quantified type variables and the provided constraints on them. the types t1, t2, .., tn of x1, x2, .., xn, respectively the type t of , mentioning only universals.Pattern synonym types interact with TH when (a) reifying a pattern synonym, (b) pretty printing, or (c) specifying a pattern synonym's type signature explicitly:/Reification always returns a pattern synonym's fully( specified type in abstract syntax.Pretty printing via  abbreviates a pattern synonym's type unambiguously in concrete syntax: The rule of thumb is to print initial empty universals and the required context as () =>, if existentials and a provided context follow. If only universals and their required context, but no existentials are specified, only the universals and their required context are printed. If both or none are specified, so both (or none) are printed.>When specifying a pattern synonym's type explicitly with } either one of the universals, the existentials, or their contexts may be left empty.See the GHC user's guide for more information on pattern synonyms and their types:  https://downloads.haskell.org/~ghc/latest/docs/html/users_guide/glasgow_exts.html#pattern-synonyms.|ghc-lib-parser T x = A x | B (T x) deriving (Z,W) deriving stock Eq }|ghc-lib-parser { newtype Cxt x => T x = A (B x) deriving (Z,W Q) deriving stock Eq }|ghc-lib-parser { type T x = (x,x) }|ghc-lib-parser  { class Eq a => Ord a where ds }|ghc-lib-parser { instance {-# OVERLAPS #-} Show w => Show [w] where ds }|ghc-lib-parser { length :: [a] -> Int }|ghc-lib-parser { type TypeRep :: k -> Type }|ghc-lib-parser -{ foreign import ... } { foreign export ... }|ghc-lib-parser { infix 3 foo }|ghc-lib-parser { default (Integer, Double) }|ghc-lib-parser { {-# INLINE [1] foo #-} }|ghc-lib-parser { data family T a b c :: * }|ghc-lib-parser { data instance Cxt x => T [x] = A x | B (T x) deriving (Z,W) deriving stock Eq }|ghc-lib-parser { newtype instance Cxt x => T [x] = A (B x) deriving (Z,W) deriving stock Eq }|ghc-lib-parser { type instance ... }|ghc-lib-parser -{ type family T a b c = (r :: *) | r -> a b }}ghc-lib-parser 3{ type family F a b = (r :: *) | r -> a where ... }}ghc-lib-parser ({ type role T nominal representational }}ghc-lib-parser 0{ deriving stock instance Ord a => Ord (Foo a) }}ghc-lib-parser &{ default size :: Data a => a -> Int }}ghc-lib-parser{ pattern P v1 v2 .. vn <- p }! unidirectional or { pattern P v1 v2 .. vn = p }! implicit bidirectional or ?{ pattern P v1 v2 .. vn <- p where P v1 v2 .. vn = e } explicit bidirectionalalso, besides prefix pattern synonyms, both infix and record pattern synonyms are supported. See | for details}ghc-lib-parser#A pattern synonym's type signature.}ghc-lib-parser  { ?x = expr }Implicit parameter binding declaration. Can only be used in let and where clauses which consist entirely of implicit bindings.}ghc-lib-parser p <- e}ghc-lib-parser { let { x=e1; y=e2 } }}ghc-lib-parser e}ghc-lib-parserx <- e1 | s2, s3 | s4 (in })}ghc-lib-parser rec { s1; s2 }}ghc-lib-parser f x { | odd x } = x}ghc-lib-parser &f x { | Just y <- x, Just z <- y } = z}ghc-lib-parser +f p { | e1 = e2 | e3 = e4 } where ds}ghc-lib-parser f p { = e } where ds}ghc-lib-parser { x }}ghc-lib-parser "data T1 = C1 t1 t2; p = {C1} e1 e2}ghc-lib-parser  { 5 or 'c'}}ghc-lib-parser { f x }}ghc-lib-parser  { f @Int }}ghc-lib-parser %{x + y} or {(x+)} or {(+ x)} or {(+)}}ghc-lib-parser {x + y}See  Language.Haskell.TH.Syntax#infix}ghc-lib-parser { (e) }See  Language.Haskell.TH.Syntax#infix}ghc-lib-parser { \ p1 p2 -> e }}ghc-lib-parser { \case m1; m2 }}ghc-lib-parser  { (e1,e2) }The A+ is necessary for handling tuple sections. (1,) translates to 'TupE [Just (LitE (IntegerL 1)),Nothing]}ghc-lib-parser { (# e1,e2 #) }The A+ is necessary for handling tuple sections.  (# 'c', #) translates to -UnboxedTupE [Just (LitE (CharL 'c')),Nothing]}ghc-lib-parser  { (#|e|#) }}ghc-lib-parser { if e1 then e2 else e3 }}ghc-lib-parser { if | g1 -> e1 | g2 -> e2 }}ghc-lib-parser { let { x=e1; y=e2 } in e3 }}ghc-lib-parser { case e of m1; m2 }}ghc-lib-parser{ do { p <- e1; e2 } }1 or a qualified do if the module name is present}ghc-lib-parser!{ mdo { x <- e1 y; y <- e2 x; } }2 or a qualified mdo if the module name is present}ghc-lib-parser  { [ (x,y) | x <- xs, y <- ys ] }3The result expression of the comprehension is the last of the }s, and should be a }.E.g. translation: [ f x | x <- xs ] CompE [BindS (VarP x) (VarE xs), NoBindS (AppE (VarE f) (VarE x))]}ghc-lib-parser { [ 1 ,2 .. 10 ] }}ghc-lib-parser  { [1,2,3] }}ghc-lib-parser  { e :: t }}ghc-lib-parser { T { x = y, z = w } }}ghc-lib-parser { (f x) { z = w } }}ghc-lib-parser  { static e }}ghc-lib-parser { _x }This is used for holes or unresolved identifiers in AST quotes. Note that it could either have a variable name or constructor name.}ghc-lib-parser{ #x } ( Overloaded label )}ghc-lib-parser{ ?x } ( Implicit parameter )}ghc-lib-parser { exp.field } ( Overloaded Record Dot )}ghc-lib-parser(.x) or (.x.y) (Record projections)}ghc-lib-parser f { p1 p2 = body where decs }}ghc-lib-parser $case e of { pat -> body where decs }}ghc-lib-parserPattern in Haskell given in {}}ghc-lib-parser  { 5 or 'c' }}ghc-lib-parser { x }}ghc-lib-parser  { (p1,p2) }}ghc-lib-parser { (# p1,p2 #) }}ghc-lib-parser  { (#|p|#) }}ghc-lib-parser 'data T1 = C1 t1 t2; {C1 @ty1 p1 p2} = e}ghc-lib-parser foo ({x :+ y}) = e}ghc-lib-parser foo ({x :+ y}) = eSee  Language.Haskell.TH.Syntax#infix}ghc-lib-parser {(p)}See  Language.Haskell.TH.Syntax#infix}ghc-lib-parser { ~p }}ghc-lib-parser { !p }}ghc-lib-parser  { x @ p }}ghc-lib-parser { _ }}ghc-lib-parser f (Pt { pointx = x }) = g x}ghc-lib-parser  { [1,2,3] }}ghc-lib-parser  { p :: t }}ghc-lib-parser  { e -> p }}ghc-lib-parser#Raw bytes embedded into the binary.Avoid using Bytes constructor directly as it is likely to change in the future. Use helpers such as mkBytes$ in Language.Haskell.TH.Lib instead.}ghc-lib-parserPointer to the data}ghc-lib-parserOffset from the pointer}ghc-lib-parserNumber of bytes}ghc-lib-parserUsed for overloaded and non-overloaded literals. We don't have a good way to represent non-overloaded literals at the moment. Maybe that doesn't matter?}ghc-lib-parser!A primitive C-style string, type ƫ}ghc-lib-parserSome raw bytes, type ƫ:}ghc-lib-parser} describes a single instance of a class or type function. It is just a |,, but guaranteed to be one of the following:| (with empty [|])| or | (with empty derived [~])|}ghc-lib-parserIn }#, is the type constructor unlifted?}ghc-lib-parserIn }, arity of the type constructor}ghc-lib-parserIn }, |, and }, the total number of }s. For example, (#|#) has a } of 2.}ghc-lib-parserIn } and }=, the number associated with a particular data constructor. }s are one-indexed and should never exceed the value of its corresponding }. For example:(#_|#) has } 1 (out of a total } of 2)(#|_#) has } 2 (out of a total } of 2)}ghc-lib-parserIn } and }", name of the parent class or type}ghc-lib-parserObtained from ~ in the ~ Monad.}ghc-lib-parser'Contains the import list of the module.}ghc-lib-parserObtained from ~ in the ~ Monad.}ghc-lib-parser-A class, with a list of its visible instances}ghc-lib-parserA class method}ghc-lib-parserA "plain" type constructor. "Fancier" type constructors are returned using } or } as appropriate. At present, this reified declaration will never have derived instances attached to it (if you wish to check for an instance, see ~).}ghc-lib-parserA type or data family, with a list of its visible instances. A closed type family is returned with 0 instances.}ghc-lib-parserA "primitive" type constructor, which can't be expressed with a | . Examples: (->), Int#.}ghc-lib-parserA data constructor}ghc-lib-parserA pattern synonym}ghc-lib-parser7A "value" variable (as opposed to a type variable, see }).The  Maybe Dec field contains Just the declaration which defined the variable - including the RHS of the declaration - or else Nothing, in the case where the RHS is unavailable to the compiler. At present, this value is always Nothing: returning the RHS has not yet been implemented because of lack of interest.}ghc-lib-parserA type variable.The Type field contains the type which underlies the variable. At present, this is always { theName5, but future changes may permit refinement of this.~ghc-lib-parserUniq5 is used by GHC to distinguish names from each other.~ghc-lib-parser Variables~ghc-lib-parserData constructors~ghc-lib-parserType constructors and classes; Haskell has them in the same name space for now.~ghc-lib-parser&An unqualified name; dynamically bound~ghc-lib-parser#A qualified name; dynamically bound~ghc-lib-parserA unique local name~ghc-lib-parser&Local name bound outside of the TH AST~ghc-lib-parserGlobal name bound outside of the TH AST: An original name (occurrences only, not binders) Need the namespace too to be sure which thing we are naming~ghc-lib-parser7An abstract type representing names in the syntax tree.~s can be constructed in several ways, which come with different name-capture guarantees (see &Language.Haskell.TH.Syntax#namecapture% for an explanation of name capture):the built-in syntax 'f and ''T4 can be used to construct names, The expression 'f gives a Name which refers to the value f currently in scope, and ''T gives a Name which refers to the type T7 currently in scope. These names can never be captured.~ and ~ are similar to 'f and ''T respectively, but the Names are looked up at the point where the current splice is being run. These names can never be captured.~ monadically generates a new name, which can never be captured. generates a capturable name.Names constructed using newName and mkName" may be used in bindings (such as  let x = ... or x -> ...), but names constructed using lookupValueName, lookupTypeName, 'f, ''T may not.~ghc-lib-parserObtained from ~ and .~ghc-lib-parserA ~ instance can have any of its values turned into a Template Haskell expression. This is needed when a value used within a Template Haskell quotation is bound outside the Oxford brackets ( [| ... |] or  [|| ... ||]*) but not at the top level. As an example: 2add1 :: Int -> Q (TExp Int) add1 x = [|| x + 1 ||]2Template Haskell has no way of knowing what value x: will take on at splice-time, so it requires the type of x to be an instance of ~.A ~ instance must satisfy  $(lift x) D x and $$(liftTyped x) D x for all x, where $(...) and $$(...) are Template Haskell splices. It is additionally expected that ~ x D ~ (~ x).~6 instances can be derived automatically by use of the  -XDeriveLift GHC language extension: {-# LANGUAGE DeriveLift #-} module Foo where import Language.Haskell.TH.Syntax data Bar a = Bar1 a (Bar a) | Bar2 String deriving Lift!Representation-polymorphic since template-haskell-2.16.0.0.~ghc-lib-parserTurn a value into a Template Haskell expression, suitable for use in a splice.~ghc-lib-parserTurn a value into a Template Haskell typed expression, suitable for use in a typed splice.~ghc-lib-parserUnderlying monadic value~ghc-lib-parser(Represents an expression which has type a. Built on top of }6, typed expressions allow for type-safe splicing via:typed quotes, written as  [|| ... ||] where ...4 is an expression; if that expression has type a#, then the quotation has type ~ (~ a)1typed splices inside of typed quotes, written as $$(...) where ...) is an arbitrary expression of type ~ (~ a)Traditional expression quotes and splices let us construct ill-typed expressions:.fmap ppr $ runQ [| True == $( [| "foo" |] ) |]#GHC.Types.True GHC.Classes.== "foo"#GHC.Types.True GHC.Classes.== "foo" error: @ Couldn't match expected type @Bool@ with actual type @[Char]@6 @ In the second argument of @(==)@, namely @"foo"@& In the expression: True == "foo"1 In an equation for @it@: it = True == "foo"3With typed expressions, the type error occurs when  constructing" the Template Haskell expression:3fmap ppr $ runQ [|| True == $$( [|| "foo" ||] ) ||] error:. @ Couldn't match type @[Char]@ with @Bool@" Expected type: Q (TExp Bool)$ Actual type: Q (TExp [Char])5 @ In the Template Haskell quotation [|| "foo" ||]& In the expression: [|| "foo" ||]6 In the Template Haskell splice $$([|| "foo" ||])!Representation-polymorphic since template-haskell-2.16.0.0.~ghc-lib-parser.Underlying untyped Template Haskell expression~ghc-lib-parserThe ~ class implements the minimal interface which is necessary for desugaring quotations.The Monad m superclass is needed to stitch together the different AST fragments.~ is used when desugaring binding structures such as lambdas to generate fresh names.Therefore the type of an untyped quotation in GHC is `Quote m => m Exp`For many years the type of a quotation was fixed to be `Q Exp` but by more precisely specifying the minimal interface it enables the } to be extracted purely from the quotation without interacting with ~.~ghc-lib-parser0Generate a fresh name, which cannot be captured.For example, this: .f = $(do nm1 <- newName "x" let nm2 =  "x" return (} [} nm1] (LamE [VarP nm2] (} nm1))) )will produce the splice f = \x0 -> \x -> x0In particular, the occurrence VarE nm1 refers to the binding VarP nm1', and is not captured by the binding VarP nm2.Although names generated by newName cannot  be captured , they can capture other names. For example, this: g = $(do nm1 <- newName "x" let nm2 = mkName "x" return (LamE [VarP nm2] (LamE [VarP nm1] (VarE nm2))) )will produce the splice g = \x -> \x0 -> x0since the occurrence VarE nm2+ is captured by the innermost binding of x , namely VarP nm1.~ghc-lib-parserDiscard the type annotation and produce a plain Template Haskell expression!Representation-polymorphic since template-haskell-2.16.0.0.~ghc-lib-parser4Annotate the Template Haskell expression with a typeThis is unsafe because GHC cannot check for you that the expression really does have the type you claim it has.!Representation-polymorphic since template-haskell-2.16.0.0.~ghc-lib-parserUnsafely convert an untyped code representation into a typed code representation.~ghc-lib-parser4Lift a monadic action producing code into the typed ~ representation~ghc-lib-parserExtract the untyped representation from the typed representation~ghc-lib-parserModify the ambient monad used during code generation. For example, you can use ~ to handle a state effect:  handleState :: Code (StateT Int Q) a -> Code Q a handleState = hoistCode (flip runState 0) ~ghc-lib-parserVariant of (>>=) which allows effectful computations to be injected into code generation.~ghc-lib-parserVariant of (>>) which allows effectful computations to be injected into code generation.~ghc-lib-parser7A useful combinator for embedding monadic actions into ~  myCode :: ... => Code m a myCode = joinCode $ do x <- someSideEffect return (makeCodeWith x) ~ghc-lib-parser>Report an error (True) or warning (False), but carry on; use  to stop.~ghc-lib-parserReport an error to the user, but allow the current splice's computation to carry on. To abort the computation, use .~ghc-lib-parser+Report a warning to the user, and carry on.~ghc-lib-parserRecover from errors raised by ~ or .~ghc-lib-parserLook up the given name in the (type namespace of the) current splice's scope. See %Language.Haskell.TH.Syntax#namelookup for more details.~ghc-lib-parserLook up the given name in the (value namespace of the) current splice's scope. See %Language.Haskell.TH.Syntax#namelookup for more details.~ghc-lib-parser~ looks up information about the ~+. It will fail with a compile error if the ~ is not visible. A ~ is visible if it is imported or defined in a prior top-level declaration group. See the documentation for ~ for more details. Bool, and reifyType ''Bool returns Type. This works even if there's no explicit signature and the type or kind is inferred.~ghc-lib-parserTemplate Haskell is capable of reifying information about types and terms defined in previous declaration groups. Top-level declaration splices break up declaration groups.For an example, consider this code block. We define a datatype X and then try to call ~ on the datatype. module Check where data X = X deriving Eq $(do info <- reify ''X runIO $ print info ) (This code fails to compile, noting that X1 is not available for reification at the site of ~. We can fix this by creating a new declaration group using an empty top-level splice: data X = X deriving Eq $(pure []) $(do info <- reify ''X runIO $ print info )  We provide ~ as a means of documenting this behavior and providing a name for the pattern.2Since top level splices infer the presence of the $( ... ) brackets, we can also write: data X = X deriving Eq newDeclarationGroup $(do info <- reify ''X runIO $ print info ) ~ghc-lib-parserreifyInstances nm tys( returns a list of visible instances of nm tys. That is, if nm is the name of a type class, then all instances of this class at the types tys! are returned. Alternatively, if nm is the name of a data family or type family, all instances of this family at the types tys are returned.Note that this is a "shallow" test; the declarations returned merely have instance heads which unify with nm tys(, they need not actually be satisfiable.reifyInstances ''Eq [ { 2 `{` { ''A `{` { ''B ] contains the "instance (Eq a, Eq b) => Eq (a, b) regardless of whether A and B themselves implement 'reifyInstances ''Show [ { ( "a") ]* produces every available instance of 'There is one edge case: reifyInstances ''Typeable tys9 currently always produces an empty list (no matter what tys are given).An instance is visible if it is imported or defined in a prior top-level declaration group. See the documentation for ~ for more details.~ghc-lib-parser reifyRoles nm returns the list of roles associated with the parameters (both visible and invisible) of the tycon nm . Fails if nm cannot be found or is not a tycon. The returned list should never contain {.An invisible parameter to a tycon is often a kind parameter. For example, if we have 9type Proxy :: forall k. k -> Type data Proxy a = MkProxy and reifyRoles Proxy, we will get [{, {]. The { is the role of the invisible k/ parameter. Kind parameters are always nominal.~ghc-lib-parserreifyAnnotations target2 returns the list of annotations associated with target. Only the annotations that are appropriately typed is returned. So if you have Int and String annotations for the same target, you have to call this function twice.~ghc-lib-parserreifyModule mod# looks up information about module mod. To look up the current module, call this function with the return value of .~ghc-lib-parserreifyConStrictness nm looks up the strictness information for the fields of the constructor with the name nm-. Note that the strictness information that ~ returns may not correspond to what is written in the source code. For example, in the following data declaration: data Pair a = Pair a a ~ would return [|, DecidedLazy]0 under most circumstances, but it would return [|, DecidedStrict] if the  -XStrictData language extension was enabled.~ghc-lib-parser%Is the list of instances returned by ~ nonempty?If you're confused by an instance not being visible despite being defined in the same module and above the splice in question, see the docs for ~ for a possible explanation.~ghc-lib-parser2The location at which this computation is spliced.~ghc-lib-parserThe ~1 function lets you run an I/O computation in the ~ monad. Take care: you are guaranteed the ordering of calls to ~ within a single ~? computation, but not about the order in which splices are run.Note: for various murky reasons, stdout and stderr handles are not necessarily flushed when the compiler finishes running, so you should flush them yourself.~ghc-lib-parserGet the package root for the current package which is being compiled. This can be set explicitly with the -package-root flag but is normally just the current working directory.The motivation for this flag is to provide a principled means to remove the assumption from splices that they will be executed in the directory where the cabal file resides. Projects such as haskell-language-server can't and don't change directory when compiling files but instead set the -package-root flag appropiately.~ghc-lib-parserThe input is a filepath, which if relative is offset by the package root.~ghc-lib-parserRecord external files that runIO is using (dependent upon). The compiler can then recognize that it should re-compile the Haskell file when an external file changes.Expects an absolute file path.Notes:ghc -M does not know about these dependencies - it does not execute TH.The dependency is based on file content, not a modification time~ghc-lib-parserObtain a temporary file path with the given suffix. The compiler will delete this file after compilation.~ghc-lib-parserAdd additional top-level declarations. The added declarations will be type checked along with the current declaration group.~ghc-lib-parser~ghc-lib-parserEmit a foreign file which will be compiled and linked to the object for the current module. Currently only languages that can be compiled with the C compiler are supported, and the flags passed as part of -optc will be also applied to the C compiler invocation that will compile them.0Note that for non-C languages (for example C++) extern C directives must be used to get symbols that we can access from Haskell.To get better errors, it is recommended to use #line pragmas when emitting C files, e.g. {-# LANGUAGE CPP #-} ... addForeignSource LangC $ unlines [ "#line " ++ show (803 + 1) ++ " " ++ show "libraries/template-haskell/Language/Haskell/TH/Syntax.hs" , ... ]~ghc-lib-parserSame as ~, but expects to receive a path pointing to the foreign file instead of a ; of its contents. Consider using this in conjunction with ~.This is a good alternative to ~9 when you are trying to directly link in an object file.~ghc-lib-parserAdd a finalizer that will run in the Q monad after the current module has been type checked. This only makes sense when run within a top-level splice.The finalizer is given the local type environment at the splice point. Thus ~ is able to find the local definitions when executed inside the finalizer.~ghc-lib-parser/Adds a core plugin to the compilation pipeline.addCorePlugin m' has almost the same effect as passing  -fplugin=m to ghc in the command line. The major difference is that the plugin module m must not belong to the current package. When TH executes, it is too late to tell the compiler that we needed to compile first a plugin module in the current package.~ghc-lib-parserGet state from the ~ monad. Note that the state is local to the Haskell module in which the Template Haskell expression is executed.~ghc-lib-parserReplace the state in the ~ monad. Note that the state is local to the Haskell module in which the Template Haskell expression is executed.~ghc-lib-parserDetermine whether the given language extension is enabled in the ~ monad.~ghc-lib-parser%List all enabled language extensions.~ghc-lib-parserAdd Haddock documentation to the specified location. This will overwrite any documentation at the location if it already exists. This will reify the specified name, so it must be in scope when you call it. If you want to add documentation to something that you are currently splicing, you can use ~ e.g. do let nm = mkName "x" addModFinalizer $ putDoc (DeclDoc nm) "Hello" [d| $(varP nm) = 42 |]The helper functions  withDecDoc and  withDecsDoc$ will do this for you, as will the funD_doc and other _doc0 combinators. You most likely want to have the -haddock flag turned on when using this. Adding documentation to anything outside of the current module will cause an error.~ghc-lib-parserRetreives the Haddock documentation at the specified location, if one exists. It can be used to read documentation on things defined outside of the current module, provided that those modules were compiled with the -haddock flag.ghc-lib-parser is an internal utility function for constructing generic conversion functions from types with  instances to various quasi-quoting representations. See the source of  and  for two example usages: mkCon, mkLit and appQ are overloadable to account for different syntax for expressions and patterns; antiQ allows you to override type-specific cases, a common usage is just  const Nothing#, which results in no overloading.ghc-lib-parser converts a value to a } representation of the same value, in the SYB style. It is generalized to take a function override type-specific cases; see # for a more commonly used variant.ghc-lib-parser is a variant of ~ in the ~- type class which works for any type with a  instance.ghc-lib-parser converts a value to a } representation of the same value, in the SYB style. It takes a function to handle type-specific cases, alternatively, pass  const Nothing to get default behavior.ghc-lib-parser#The name without its module prefix.ExamplesnameBase ''Data.Either.Either"Either"nameBase (mkName "foo")"foo"nameBase (mkName "Module.foo")"foo"ghc-lib-parser&Module prefix of a name, if it exists.ExamplesnameModule ''Data.Either.EitherJust "Data.Either"nameModule (mkName "foo")Nothing nameModule (mkName "Module.foo") Just "Module"ghc-lib-parserA name's package, if it exists.Examples namePackage ''Data.Either.Either Just "base"namePackage (mkName "foo")Nothing!namePackage (mkName "Module.foo")Nothingghc-lib-parserReturns whether a name represents an occurrence of a top-level variable (~), data constructor (~%), type constructor, or type class (~#). If we can't be sure, it returns H.ExamplesnameSpace 'Prelude.id Just VarNamenameSpace (mkName "id")2Nothing -- only works for top-level variable namesnameSpace 'Data.Maybe.Just Just DataNamenameSpace ''Data.Maybe.MaybeJust TcClsNamenameSpace ''Data.Ord.OrdJust TcClsNameghc-lib-parserGenerate a capturable name. Occurrences of such names will be resolved according to the Haskell scoping rules at the occurrence site. For example: =f = [| pi + $(varE (mkName "pi")) |] ... g = let pi = 3 in $fIn this case, g is desugared to g = Prelude.pi + 3 Note that mkName" may be used with qualified names: mkName "Prelude.pi" See also  for a useful combinator. The above example could be rewritten using  as f = [| pi + $(dyn "pi") |]ghc-lib-parserOnly used internallyghc-lib-parserOnly used internallyghc-lib-parser4Used for 'x etc, but not available to the programmerghc-lib-parserTuple data constructorghc-lib-parserTuple type constructorghc-lib-parserUnboxed tuple data constructorghc-lib-parserUnboxed tuple type constructorghc-lib-parserUnboxed sum data constructorghc-lib-parserUnboxed sum type constructorghc-lib-parser(Highest allowed operator precedence for } constructor (answer: 9)ghc-lib-parserDefault fixity: infixl 9ghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parser Produces an ƫ literal from the NUL-terminated C-string starting at the given memory address.ghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserghc-lib-parserIf the function passed to ; inspects its argument, the resulting action will throw a ǫ.ghc-lib-parserghc-lib-parser|ghc-lib-parser  (Eq a, Ord b)}ghc-lib-parserLine and character position~ghc-lib-parser Fresh names~ghc-lib-parserReport an error (True) or warning (False) ...but carry on; use  to stop~ghc-lib-parserthe error handlerghc-lib-parseraction which may failghc-lib-parserRecover from the monadic ~ghc-lib-parserhandler to invoke on failureghc-lib-parsercomputation to run{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{|{{||||||||||||{{{{{{{{{{{|{|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||}}}}}}}|||||||||||||||||}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}~}}}}~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{|{{||||||||||||{{{{{{{{{{{|{|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||}}}}}}}|||||||||||||||||}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}~}}}}~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~Safe> \!ghc-lib-parserReturns J if the document is emptyghc-lib-parserAn empty documentghc-lib-parserA ';' characterghc-lib-parserA ',' characterghc-lib-parserA : characterghc-lib-parser A "::" stringghc-lib-parserA space characterghc-lib-parserA '=' characterghc-lib-parser A "->" stringghc-lib-parserA '(' characterghc-lib-parserA ')' characterghc-lib-parserA '[' characterghc-lib-parserA ']' characterghc-lib-parserA '{' characterghc-lib-parserA '}' characterghc-lib-parserWrap document in (...)ghc-lib-parserWrap document in [...]ghc-lib-parserWrap document in {...}ghc-lib-parserWrap document in '...'ghc-lib-parserWrap document in "..."ghc-lib-parserBesideghc-lib-parserList version of ghc-lib-parserBeside, separated by spaceghc-lib-parserList version of ghc-lib-parser5Above; if there is no overlap it "dovetails" the twoghc-lib-parserAbove, without dovetailing.ghc-lib-parserList version of ghc-lib-parserEither hcat or vcatghc-lib-parserEither hsep or vcatghc-lib-parser"Paragraph fill" version of catghc-lib-parser"Paragraph fill" version of sepghc-lib-parserNestedghc-lib-parser "hang d1 n d2 = sep [d1, nest n d2]ghc-lib-parser punctuate p [d1, ... dn] = [d1 <> p, d2 <> p, ... dn-1 <> p, dn]//6655Safe _>ghc-lib-parser.Pretty prints a pattern synonym type signatureghc-lib-parserPretty prints a pattern synonym's type; follows the usual conventions to print a pattern synonym type compactly, yet unambiguously. See the note on | and the section on pattern synonyms in the GHC user's guide for more information.‚ÂĂłƂǂȂɂʂ˂̂͂΂ςЂт҂ӂԂՂւׂ؂قڂۂ܂݂ނ߂‚ÂĂłƂǂȂɂʂ˂̂͂΂ςЂт҂ӂԂՂւׂ؂قڂۂ܂݂ނ߂ Trustworthy . l6ghc-lib-parser!Representation-polymorphic since template-haskell-2.17.0.0.ghc-lib-parser Use with ghc-lib-parser Use with ghc-lib-parser*Dynamically binding a variable (unhygenic)ghc-lib-parserSingle-arg lambdaghc-lib-parser staticE x = [| static x |]ghc-lib-parserPattern synonym declarationghc-lib-parserPattern synonym type signatureghc-lib-parserImplicit parameter binding declaration. Can only be used in let and where clauses which consist entirely of implicit bindings.ghc-lib-parserpure the Module at the place of splicing. Can be used as an input for ~.ghc-lib-parserAttaches Haddock documentation to the declaration provided. Unlike ~, the names do not need to be in scope when calling this function so it can be used for quoted declarations and anything else currently being spliced. Not all declarations can have documentation attached to them. For those that can't, 3 will return it unchanged without any side effects.ghc-lib-parser Variant of  that applies the same documentation to multiple declarations. Useful for documenting quoted declarations.ghc-lib-parser Variant of % that attaches Haddock documentation.ghc-lib-parser Variant of % that attaches Haddock documentation.ghc-lib-parser Variant of % that attaches Haddock documentation.ghc-lib-parser Variant of % that attaches Haddock documentation.ghc-lib-parser Variant of % that attaches Haddock documentation.ghc-lib-parser Variant of % that attaches Haddock documentation.ghc-lib-parser7Document a data/newtype constructor with its arguments.ghc-lib-parser#Documentation to attach to functionghc-lib-parser$Documentation to attach to argumentsghc-lib-parserList of constructors, documentation for the constructor, and documentation for the argumentsghc-lib-parser/Documentation to attach to the data declarationghc-lib-parserThe constructor, documentation for the constructor, and documentation for the argumentsghc-lib-parser2Documentation to attach to the newtype declarationghc-lib-parserList of constructors, documentation for the constructor, and documentation for the argumentsghc-lib-parser3Documentation to attach to the instance declarationghc-lib-parserThe constructor, documentation for the constructor, and documentation for the argumentsghc-lib-parser3Documentation to attach to the instance declarationghc-lib-parser.Documentation to attach to the pattern synonymghc-lib-parser0Documentation to attach to the pattern argumentsƒÃăŃƃǃȃɃʃ˃̃̓΃σЃу҃ӃԃՃփ׃؃كڃۃ܃݃ރ߃„ÄĄńƄDŽȄɄʄ˄̄̈́΄τЄф҄ӄԄՄքׄ؄لڄۄ܄݄ބ߄ƒÃăŃƃǃȃɃʃ˃̃̓΃σЃу҃ӃԃՃփ׃؃كڃۃ܃݃ރ߃„ÄĄńƄDŽȄɄʄ˄̄̈́΄τЄф҄ӄԄՄքׄ؄لڄۄ܄݄ބ߄Safe sąghc-lib-parserCreate a Bytes datatype representing raw bytes to be embedded into the program/library binary.ąghc-lib-parserPointer to the dataghc-lib-parserOffset from the pointerghc-lib-parserNumber of bytes||||||||||||ƒÃăŃƃǃȃɃʃ˃̃̓΃σЃ҃ӃԃՃփ׃؃كڃۃ܃݃ރ߃„ÄĄńƄDŽɄʄ̄̈́΄τЄф҄ӄԄՄքׄ؄لڄۄ܄ބ߄…ÅąŅƅDžȅɅƒÃăŃ˃ƃȃɃǃʃą̃̓΃σЃɅӃԃ҃Ճփ׃؃كڃۃ܃݃ŅƅDžȅރ߃̄̈́΄ԄՄքׄτЄф҄ӄބ؄ڄۄ܄ل߄ńƄDŽɄʄ…||„ÄĄ||||||||||ÅSafe z{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{|{{{{{{{{{{{{||||||||||||{{||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||}}}}}}}|}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~łȂ݂ƒÃăŃƃǃȃɃʃ˃̃̓΃σЃ҃ӃԃՃփ׃؃كڃۃ܃݃ރ߃„ÄĄńƄDŽɄʄ̄̈́΄τЄф҄ӄԄՄքׄ؄لڄۄ܄ބ߄…ÅąŅƅDžȅɅ~~~~~~~~~}}}}}}~~~~~}}}}}}}}}}}}}}}}}}~~~~~~~~~~{{{~~~~~~~~~~~~~~~||||||||||||||||||}}}}}}}||||||||}}|||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||}}}}}}||||||||}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}{|{{{{{{{{{{{{||||||||||||{{|{{{{{{{{||{{{{{{{{{{{{{{|||~~{{{{{łȂ݂None-/3>? Sghc-lib-parserLocated Haskell ExpressionSghc-lib-parserSyntax ExpressionSyntaxExpr is represents the function used in interpreting rebindable syntax. In the parser, we have no information to supply; in the renamer, we have the name of the function (but see Note [Monad fail : Rebindable syntax, overloaded strings] for a wrinkle) and in the type-checker we have a more elaborate structure  SyntaxExprTc.In some contexts, rebindable syntax is not implemented, and so we have constructors to represent that possibility in both the renamer and typechecker instantiations.E.g. (>>=)4 is filled in before the renamer by the appropriate  for (>>=), and then instantiated by the type checker with its type args etcSghc-lib-parserGuarded Right-Hand Sides8GRHSs are used both for pattern bindings and for Matches :  , , , , ,Sghc-lib-parserHaskell SpliceSghc-lib-parserA Haskell expression.˅ghc-lib-parser  ModuleName. do { ... }̅ghc-lib-parser  ModuleName.'mdo { ... } ie recursive do-expressionͅghc-lib-parser&A command-line Stmt in GHCi pat <- rhsЅghc-lib-parserHaskell arrow match context.хghc-lib-parserA proc expression҅ghc-lib-parser(A case alternative inside arrow notationӅghc-lib-parserAn arrow kappa abstractionԅghc-lib-parserHaskell Statement Context.Յghc-lib-parser1Context for HsDo (do-notation and comprehensions)օghc-lib-parser!Pattern guard for specified thingׅghc-lib-parserA branch of a parallel stmt؅ghc-lib-parserA branch of a transform stmtمghc-lib-parser'do-notation in an arrow-command contextڅghc-lib-parserHaskell Match ContextContext of a pattern match. This is more subtle than it would seem. See Note [FunBind vs PatBind].ۅghc-lib-parser8A pattern matching on an argument of a function binding܅ghc-lib-parserPatterns of a lambda݅ghc-lib-parser)Patterns and guards on a case alternativeޅghc-lib-parser$Guards of a multi-way if alternative߅ghc-lib-parser%A pattern match inside arrow notationghc-lib-parser"A pattern binding eg [y] <- e = eghc-lib-parserGuards of pattern bindings, e.g., (Just b) | Just _ <- x = e | otherwise = e'ghc-lib-parserRecord update [used only in GHC.HsToCore.Expr to tell matchWrapper what sort of runtime error message to generate]ghc-lib-parser=Pattern of a do-stmt, list comprehension, pattern guard, etcghc-lib-parser!A Template Haskell pattern spliceghc-lib-parser1A Template Haskell pattern quotation [p| (a,b) |]ghc-lib-parserA pattern synonym declarationghc-lib-parserfunction binder of fghc-lib-parser fixing of fghc-lib-parserwas f' banged? See Note [FunBind vs PatBind]ghc-lib-parserArithmetic Sequence Informationghc-lib-parser1Haskell (Untyped) Quote = Expr + Pat + Type + Varghc-lib-parserHaskell Spliced Thing-Values that can result from running a splice.ghc-lib-parserHaskell Spliced Expressionghc-lib-parserHaskell Spliced Typeghc-lib-parserHaskell Spliced Patternghc-lib-parser&Finalizers produced by a splice with See Note [Delaying modFinalizers in untyped splices] in GHC.Rename.Splice. For how this is used.ghc-lib-parserA splice can appear with various decorations wrapped around it. This data type captures explicitly how it was originally written, for use in the pretty printer.ghc-lib-parser$splice or $$spliceghc-lib-parser bare spliceghc-lib-parserApplicative Argumentghc-lib-parser!The fail operator, after renamingThe fail operator is needed if this is a BindStmt where the pattern can fail. E.g.: (Just a) <- stmt The fail operator will be invoked if the pattern match fails. It is also used for guards in MonadComprehensions. The fail operator is Nothing if the pattern match can't failghc-lib-parserTrue  = was a BodyStmt, False  =1 was a BindStmt. See Note [Applicative BodyStmt]ghc-lib-parser,context of the do expression, used in pprArgghc-lib-parserThe fail operatorThis is used for `.. <-` "bind statements" in do notation, including non-monadic "binds" in applicative.The fail operator is 'Just expr' if it potentially fail monadically. if the pattern match cannot fail, or shouldn't fail monadically (regular incomplete pattern exception), it is H.See Note [Monad fail : Rebindable syntax, overloaded strings] for the type of expression in the I case, and why it is so.See Note [Failing pattern matches in Stmts] for which contexts for 'BindStmt3's should use the monadic fail and which shouldn't.ghc-lib-parserParenthesised Statement Blockghc-lib-parser>Exact print annotations when in qualifier lists or guards -  :  , , , , , ,ghc-lib-parser2 represents an applicative expression built with  and ". It is generated by the renamer, and is desugared into the appropriate applicative expression by the desugarer, but it is intended to be invisible in error messages..For full details, see Note [ApplicativeDo] in GHC.Rename.Exprghc-lib-parser :   '{', '}',ghc-lib-parser : ghc-lib-parserGhci Statementghc-lib-parserGhci Located Statementghc-lib-parserGuard Statementghc-lib-parserGuard Located Statementghc-lib-parserExpression Statementghc-lib-parserExpression Located Statementghc-lib-parserCommand Statementghc-lib-parserCommand Located Statementghc-lib-parserdo block Statementghc-lib-parser3Located Statement with separate Left and Right id's†ghc-lib-parserLocated do block StatementÆghc-lib-parserGuarded Right Hand Side.Ɔghc-lib-parserLocated Guarded Right-Hand Sideʆghc-lib-parser Guarded RHSsˆghc-lib-parserThe where clauseӆghc-lib-parser Located Match May have  :  when in a list݆ghc-lib-parserHaskell Record Bindingsކghc-lib-parserHaskell Top-level Commandghc-lib-parserTop-level command, introducing a new arrow. This may occur inside a proc (where the stack is empty) or as an argument of a command-forming operator.!Located Haskell Top-level Commandghc-lib-parserHaskell arrow application type.ghc-lib-parserFirst order arrow application -<ghc-lib-parserHigher order arrow application -<<ghc-lib-parser;Haskell Command (e.g. a "statement" in an Arrow proc block)ghc-lib-parser :  , , , ghc-lib-parser :  '(|' ,  '|)'ghc-lib-parser :  , ,ghc-lib-parser :  '(',  ')'ghc-lib-parser :  , , '{' ,  '}'ghc-lib-parser :  , , '{' ,  '}'ghc-lib-parser :  ,  , , , ,ghc-lib-parser :  ,  '{' ,  '}',ghc-lib-parser : , , , , ghc-lib-parser*Located Haskell Command (for arrow syntax)ghc-lib-parser : Haskell Tuple Argumentghc-lib-parser The argumentghc-lib-parser-The argument is missing, but this is its typeghc-lib-parserExtension point; see Note [Trees That Grow] in Language.Haskell.Syntax.Extensionghc-lib-parserLocated Haskell Tuple Argument is used for tuple sections (,a,) is represented by 3ExplicitTuple [Missing ty1, Present a, Missing ty3] Which in turn stands for (x:ty1 y:ty2. (x,a,y))ghc-lib-parserA pragma, written as {- ... )-}, that may appear within an expression.ghc-lib-parser :  ,  '{-# GENERATED' , , , , ,  , , ,  ,  '#-}'ghc-lib-parser%Variable See Note [Located RdrNames]ghc-lib-parserUnbound variable; also used for "holes" (_ or _x). Turned from HsVar to HsUnboundVar by the renamer, when it finds an out-of-scope variable or hole. The (XUnboundVar p) field becomes an HoleExprRef after typechecking; this is where the erroring expression will be written after solving. See Note [Holes] in GHC.Tc.Types.Constraint.ghc-lib-parserVariable pointing to record selector See Note [Non-overloaded record field selectors] and Note [Record selectors in the AST]ghc-lib-parserOverloaded label (Note [Overloaded labels] in GHC.OverloadedLabels)ghc-lib-parser2Implicit parameter (not in use after typechecking)ghc-lib-parserOverloaded literalsghc-lib-parser Simple (non-overloaded) literalsghc-lib-parser3Lambda abstraction. Currently always a single match :  , ,ghc-lib-parser Lambda-case :  , , , ghc-lib-parser Applicationghc-lib-parserVisible type applicationExplicit type argument; e.g f @Int x y NB: Has wildcards, but no implicit quantification : ,ghc-lib-parserOperator applications: NB Bracketed ops such as (+) come out as Vars.ghc-lib-parserNegation operator. Contains the negated expression and the name of  : ghc-lib-parser :  '(',  ')'ghc-lib-parser-Used for explicit tuples and sections thereof :  , ghc-lib-parserUsed for unboxed sum types :  '(#' , ,  '#)',There will be multiple , (1 - alternative) before the expression, (arity - alternative) after itghc-lib-parser :  , , '{' ,  '}'ghc-lib-parser :  ,  , , , ,ghc-lib-parser Multi-way if :  ,,ghc-lib-parserlet(rec) :  ,  '{' ,  '}',ghc-lib-parser : , , , , ghc-lib-parserSyntactic list: [a,b,c,...] :  '[',  ']'ghc-lib-parserRecord construction :  '{' , , '}'ghc-lib-parser Record update :  '{' , , '}'+ 'GHC.Parser.Annotation.AnnComma,  ,  '}'ghc-lib-parserRecord field selection e.g z.x. : ghc-lib-parserRecord field selector. e.g. (.x) or (.x.y)This case only arises when the OverloadedRecordDot langauge extensions is enabled. See Note [Record selectors in the AST].ghc-lib-parser,Expression with an explicit type signature.  e :: type : ghc-lib-parserArithmetic sequence :  '[', ,,  ']'ghc-lib-parser :  , , , ,ghc-lib-parser :  , ghc-lib-parserproc notation for Arrows :  , ghc-lib-parser : ,ghc-lib-parser'Command Syntax Table (for Arrow syntax)ghc-lib-parserRecordDotSyntax field updatesghc-lib-parserIs this a monadic context?Sghc-lib-parser May have  :  when in a listghc-lib-parserPost renaming has optional fail and bind / (>>=) operator. Post typechecking, also has multiplicity of the argument and the result type of the function passed to bind; that is, (P, S) in (>>=) :: Q -> (R % P -> S) -> T See Note [The type of bind in Stmts]ghc-lib-parser.Parenthesised expr; see Note [Parens in HsSyn]SSSȆdžˆʆɆSن؆܆ۆچSSʅυ΅̅ͅ˅ЅӅ҅хԅم؅ׅօՅڅ߅ޅ݅܅ۅ†ÆņĆƆ̆Ά͆҆цІφӆԆՆ׆ֆ݆ކ߆‡ÇćŇƇLJȇɇʇˇ̇SSSކ߆݆Sن؆܆ۆچԆՆ׆ֆӆ̆Ά͆҆цІφSȆdžˆʆɆƆÆņƆSڅ߅ޅ݅܅ۅԅم؅ׅօՅЅӅ҅хʅυ΅̅ͅ˅‡ÇćŇƇLJȇɇʇˇ̇None ->? `  LMMMMMMMMMMMMMPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSdžȆˆɆʆS؆ن܆چۆSSvvvvvvvvvvvvvvvvvvvvvvvvvvvvvxxxxxxxxxxxxxxxxxxxxvvvvvvvvvvvvvvvvvvvvvvvvvvvvwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyzzzzyyzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz{{{{{{{zzzzzzzzzz{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{ʅυ΅ͅ˅̅ЅӅх҅ԅم؅ׅՅօڅ߅ޅ݅܅ۅ†ÆĆņƆ̆͆Ά҆цφІӆԆՆֆ׆݆ކ߆‡ÇćŇƇLJȇɇʇˇ̇None&->? Sghc-lib-parserReturn the attached flagghc-lib-parserSet the attached flagghc-lib-parserDo all type variables in this w come with kind annotations?ghc-lib-parserConvert an arrow into its corresponding multiplicity. In essence this erases the information of whether the programmer wrote an explicit multiplicity or a shorthand.ghc-lib-parser7Get the kind signature of a type, ignoring parentheses:hsTyKindSig `Maybe ` = Nothing hsTyKindSig `Maybe :: Type -> Type ` = Just `Type -> Type` hsTyKindSig `Maybe :: ((Type -> Type))` = Just `Type -> Type`This is used to extract the result kind of type synonyms with a CUSK:2type S = (F :: res_kind) ^^^^^^^^ghc-lib-parserRetrieve the name of the "head" of a nested type application. This is somewhat like GHC.Tc.Gen.HsType.splitHsAppTys, but a little more thorough. The purpose of this function is to examine instance heads, so it doesn't handle *all* cases (like lists, tuples, (~), etc.).ghc-lib-parser Compute the  associated with an v.ghc-lib-parserDecompose a pattern synonym type signature into its constituent parts.Note that this function looks through parentheses, so it will work on types such as  (forall a.  ...). The downside to this is that it is not generally possible to take the returned types and reconstruct the original type (parentheses and all) from them.ghc-lib-parser$Decompose a sigma type (of the form forall  tvs. context => body) into its constituent parts. Only splits type variable binders that were quantified invisibly (e.g.,  forall a., with a dot).This function is used to split apart certain types, such as instance declaration types, which disallow visible forall)s. For instance, if GHC split apart the forall in "instance forall a -> Show (Blah a)6, then that declaration would mistakenly be accepted!Note that this function looks through parentheses, so it will work on types such as  (forall a.  ...). The downside to this is that it is not generally possible to take the returned types and reconstruct the original type (parentheses and all) from them.ghc-lib-parser;Decompose a GADT type into its constituent parts. Returns (outer_bndrs, mb_ctxt, body), where: outer_bndrs are w if the type has explicit, outermost type variable binders. Otherwise, they are w.mb_ctxt is Just5 the context, if it is provided. Otherwise, it is Nothing.body, is the body of the type after the optional foralls and context.?This function is careful not to look through parentheses. See Note [GADT abstract syntax] (Wrinkle: No nested foralls or contexts)  GHC.Hs.Decls for why this is important.ghc-lib-parserDecompose a type of the form forall  tvs. body into its constituent parts. Only splits type variable binders that were quantified invisibly (e.g.,  forall a., with a dot).This function is used to split apart certain types, such as instance declaration types, which disallow visible forall)s. For instance, if GHC split apart the forall in "instance forall a -> Show (Blah a)6, then that declaration would mistakenly be accepted!Note that this function looks through parentheses, so it will work on types such as  (forall a.  ...). The downside to this is that it is not generally possible to take the returned types and reconstruct the original type (parentheses and all) from them. Unlike , this function does not look through parentheses, hence the suffix _KP (short for "Keep Parentheses").ghc-lib-parserDecompose a type of the form forall  tvs. body into its constituent parts. Only splits type variable binders that were quantified invisibly (e.g.,  forall a., with a dot).This function is used to split apart certain types, such as instance declaration types, which disallow visible forall)s. For instance, if GHC split apart the forall in "instance forall a -> Show (Blah a)6, then that declaration would mistakenly be accepted!Unlike , this function does not look through parentheses, hence the suffix _KP (short for "Keep Parentheses").ghc-lib-parserDecompose a type of the form context => body into its constituent parts.Note that this function looks through parentheses, so it will work on types such as  (context =>  ...). The downside to this is that it is not generally possible to take the returned types and reconstruct the original type (parentheses and all) from them.ghc-lib-parser3Decompose a type class instance type (of the form forall  tvs. context => instance_head-) into its constituent parts. Note that the [Name] s returned correspond to either:The implicitly bound type variables (if the type lacks an outermost forall), orThe explicitly bound type variables (if the type has an outermost forall).?This function is careful not to look through parentheses. See 6Note [No nested foralls or contexts in instance types] for why this is important.ghc-lib-parser3Decompose a type class instance type (of the form forall  tvs. context => instance_head ) into the  instance_head.ghc-lib-parser3Decompose a type class instance type (of the form forall  tvs. context => instance_head ) into the  instance_head and retrieve the underlying class type constructor (if it exists).ghc-lib-parserPrints the explicit forall in a type family equation if one is written. If there is no explicit forall, nothing is printed.ghc-lib-parserPrints the outermost forall in a type signature if one is written. If there is no outermost forall, nothing is printed.ghc-lib-parser3Prints a forall; When passed an empty list, prints forall ./ forall -> only when  -dppr-debug is enabled.ghc-lib-parser p t returns J if the type t% needs parentheses under precedence p.ghc-lib-parser p ty checks if  p ty is true, and if so, surrounds ty with an w . Otherwise, it simply returns ty.ghc-lib-parser p ctxt checks if ctxt is a single constraint c such that  p c is true, and if so, surrounds c with an w to form a parenthesized ctxt . Otherwise, it simply returns ctxt unchanged.ghc-lib-parser Location of forall and -> for HsForAllVis Location of forall and  for HsForAllInvisLMMMMMMMMMMMMMvvvvvvvvvvvvvvvvvvvvvvvvvvvvwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwvvvvwwvwwMMMMMMMMMMLMMMvvvvvvvvvvvvwvvvvvvvvvvvwwwwNone#->? iÈghc-lib-parser0Convert a literal from one index type to anotherňghc-lib-parserpmPprHsLit pretty prints literals and is used when pretty printing pattern match warnings. All are printed the same (i.e., without hashes if they are primitive and not wrapped in constructors if they are boxed). This happens mainly for too reasons: * We do not want to expose their internal representation * The warnings become too messy)vvvvvvvvvvvvvvvvvvvvvvvvvvvˆÈĈňˆÈĈňNone-3>? 8Ȉghc-lib-parser!Type checker Specification PragmaɈghc-lib-parserThe Id to be specialised, a wrapper that specialises the polymorphic function, and inlining spec for the specialised functionʈghc-lib-parser*Located Type checker Specification Pragmasˈghc-lib-parser#Type checker Specialisation Pragmasˈ conveys  SPECIALISE/ pragmas from the type checker to the desugarer̈ghc-lib-parserSuper-specialised: a default method should be macro-expanded at every call site҈ghc-lib-parserAbstraction Bindings ExportԈghc-lib-parser(Any INLINE pragma is attached to this Idֈghc-lib-parserSee Note [ABExport wrapper] Shape: (forall abs_tvs. abs_ev_vars => abe_mono) ~ abe_poly׈ghc-lib-parserSPECIALISE pragmas؈ghc-lib-parserTypechecked, generalised bindings, used in the output to the type checker. See Note [AbsBinds].ۈghc-lib-parserIncludes equality constraints܈ghc-lib-parserAbsBinds only gets used when idL = idR after renaming, but these need to be idL's for the collect... code in HsUtil to have the right type݈ghc-lib-parser#Evidence bindings Why a list? See GHC.Tc.TyCl.Instance4 Note [Typechecking plan for instance declarations]ވghc-lib-parserTypechecked user bindingsghc-lib-parserUsing SourceText in case the pragma was spelled differently or used mixed caseȫghc-lib-parserAfter the type-checker, the FunBind extension field contains a coercion from the type of the MatchGroup to the type of the Id. Example: 1 f :: Int -> forall a. a -> a f x y = y Then the MatchGroup will have type (Int -> a' -> a') (with a free type variable a'). The coercion will take a CoreExpr of this type and convert it to a CoreExpr of type Int -> forall a'. a' -> a' Notice that the coercion captures the free a'.ɫghc-lib-parserAfter the renamer (but before the type-checker), the FunBind extension field contains the locally-bound free variables of this defn. See Note [Bind free vars]xxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxyyyyyyyyȈɈʈˈ͈̈ΈψЈш҈ӈ׈ֈԈՈ؈و߈ވ݈܈ڈۈ3ȈɈʈˈ͈̈ΈψЈш҈ӈ׈ֈԈՈ؈و߈ވ݈܈ڈۈNone-3>? ghc-lib-parserThis is the extension field for ConPat, added after typechecking It adds quite a few extra fields, to support elaboration of pattern matching.ghc-lib-parserThe universal arg types 1-1 with the universal tyvars of the constructor/pattern synonym Use (conLikeResTy pat_con cpt_arg_tys) to get the type of the patternghc-lib-parserExistentially bound type variables in correctly-scoped order e.g. [k:* x:k]ghc-lib-parserDitto *coercion variables* and *dictionaries* One reason for putting coercion variable here I think is to ensure their kinds are zonkedghc-lib-parser%Bindings involving those dictionariesghc-lib-parserExtra wrapper to pass to the matcher Only relevant for pattern-synonyms; ignored for data consghc-lib-parser8Extension constructor for Pat, added after typechecking.ghc-lib-parser#Coercion Pattern (translation only):During desugaring a (CoPat co pat) turns into a cast with co+ on the scrutinee, followed by a match on pat.ghc-lib-parserPattern expansion: original pattern, and desugared pattern, for RebindableSyntax and other overloaded syntax such as OverloadedLists. See Note [Rebindable syntax and HsExpansion].ghc-lib-parserCoercion Pattern If co :: t1 ~ t2, p :: t2, then (CoPat co p) :: t1ghc-lib-parser)Why not LPat? Ans: existing locn will doghc-lib-parserType of whole pattern, t1ghc-lib-parser%Is the pattern any of combination of:(pat) pat :: Type~pat!pat x (variable)ghc-lib-parser p pat returns J if the pattern pat% needs parentheses under precedence p.ghc-lib-parser0Parenthesize a pattern without token informationghc-lib-parser p pat checks if  p pat is true, and if so, surrounds pat with a x. Otherwise, it simply returns pat.vvxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxvxxxxxxxxxxxxxxxxxxxxvxxxxxxxxxxxxxxxxxxxxxxNone /> ghc-lib-parserAn accumulator to build a prefix data constructor, e.g. when parsing  MkT A B C), the accumulator will evolve as follows:  1. PrefixDataConBuilder [] MkT 2. PrefixDataConBuilder [A] MkT 3. PrefixDataConBuilder [A, B] MkT 4. PrefixDataConBuilder [A, B, C] MkT There are two reasons we have a separate builder type instead of using HsConDeclDetails GhcPs directly: It's faster, because  gives us constant-time snoc.Having a separate type helps ensure that we don't forget to finalize a RecTy into a v (we do that in dataConBuilderDetails).See Note [PatBuilder] for another builder type used in the parser. Here the technique is similar, but the motivation is different.ghc-lib-parser?See Note [Ambiguous syntactic categories] and Note [PatBuilder]ghc-lib-parser"Last two are the locations of the '|' before and after the payloadNone-3>? U ʼnghc-lib-parserThe locations of forall and  for forall'd type vars Using AddEpAnn to capture possible unicode variantsƉghc-lib-parserThe locations of forall and  for forall'd term vars Using AddEpAnn to capture possible unicode variantsʉghc-lib-parserPartition a list of HsDecls into function/pattern bindings, signatures, type family declarations, type family instances, and documentation comments.Panics when given a declaration that cannot be put into any of the output groups.2The primary use of this function is to implement .͉ghc-lib-parserThe fixity signatures for each top-level declaration and class method in an {7. See Note [Top-level fixity signatures in an HsGroup]Ӊghc-lib-parserDoes this declaration have a complete, user-supplied kind signature? See Note [CUSKs: complete user-supplied kind signatures]؉ghc-lib-parser-Maybe return name of the result type variableۉghc-lib-parserReturn I fields> if a data constructor declaration uses record syntax (i.e., v ), where fields- are the field selectors. Otherwise, return H.ghc-lib-parser Eliminate a y.ghc-lib-parser Map over the via type if dealing with y. Otherwise, return the y unchanged. yyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{ÉĉʼnƉljȉɉʉˉ͉̉ΉωЉщ҉ӉԉՉ։׉؉ىډۉ܉݉މ߉{{{{{{{{{{{{{{{{{zzzzzzzzzzzzzzzzzzzzzzzzzzz{zzzzىzzzzzzzzzzzzzzzz{{{{{{{{zzzzzzzzzzzz{{{{{{{҉{{{{{ωЉ{ԉщ{Ӊ׉zzzzzzzzzzzzzzzyyyyyyyyyyyyzzzzzzzzzzzzzzzzމ݉߉yyyyyzzzzzzzyyyyyyyyyyyyyyyyyyyyyyyyy{ȉɉyyyyyyyyyyyyyyyyyyyyÉĉʼnƉljyyyyy{{yyyy {{{{yyyyyyyyyyyyyyyyyyyzzzzzzzzzzzzzzzzzzzzz܉ډۉyyyyyy{yyyyyyyyyyyyyyyyyyy{yyyyzzzzzzzzzz؉Չ։{{{{{{{{{{{{{{{ˉ̉Ή{͉ʉNone-/23>? ghc-lib-parserPending Type-checker Spliceghc-lib-parserPending Renamer Spliceghc-lib-parserMatch separator locationghc-lib-parser'('ghc-lib-parser')'͊ghc-lib-parser)HsWrap appears only in typechecker outputϊghc-lib-parserExtra data fields for a , added by the type checkerՊghc-lib-parser7An expression with wrappers, used for rebindable syntaxThis should desugar to syn_res_wrap $ syn_expr (syn_arg_wraps[0] arg0) (syn_arg_wraps[1] arg1) ...:where the actual arguments come from elsewhere in the AST.ۊghc-lib-parserThe function to use in rebindable syntax. See Note [NoSyntaxExpr].ߊghc-lib-parserPost-Type checking TableWe use a PostTcTable where there are a bunch of pieces of evidence, more than is convenient to keep individually.ghc-lib-parserPost-Type checking ExpressionPostTcExpr is an evidence expression attached to the syntax tree by the type checker (c.f. postTcType).ghc-lib-parserThis is used for rebindable-syntax pieces that are too polymorphic for tcSyntaxOp (trS_fmap and the mzip in ParStmt)ghc-lib-parserMake a 'SyntaxExpr GhcRn' from an expression Used only in getMonadFailOp. See Note [Monad fail : Rebindable syntax, overloaded strings] in GHC.Rename.Exprghc-lib-parserMake a S from a 4 (the "rn" is because this is used in the renamer).ghc-lib-parser p e returns J if the expression e% needs parentheses under precedence p.ghc-lib-parser4Parenthesize an expression without token informationghc-lib-parser p e checks if  p e is true, and if so, surrounds e with an . Otherwise, it simply returns e.ghc-lib-parser.Is there only one RHS in this list of matches?ghc-lib-parser(Just print the original expression (the a).SSSdžȆˆɆʆS؆ن܆چۆSSʅυ΅ͅ˅̅ЅӅх҅ԅم؅ׅՅօڅ߅ޅ݅܅ۅ†ÆĆņƆ̆͆Ά҆цφІӆԆՆֆ׆݆ކ߆‡ÇćŇƇLJȇɇʇˇ̇ڇۇ܇݇އ߇ŠÊƊĊŊNJȊ̊ˊɊʊ͊ΊϊЊԊӊъҊՊ֊׊ڊ؊يۊ܊݊ފߊڇۇ܇݇އ߇ŠÊƊĊŊNJȊ̊ˊɊʊ͊ΊϊЊԊӊъҊՊ֊׊ڊ؊يۊ܊݊ފߊNone #Generic helpers for the HsSyn type.((c) The University of Glasgow, 1992-2006None&'(-/>? 0"Ëghc-lib-parserThis class specifies how to collect variable identifiers from extension patterns in the given pass. Consumers of the GHC API that define their own passes should feel free to implement instances in order to make use of functions which depend on it.In particular, Haddock already makes use of this, with an instance for its DocNameI pass so that it can reuse the code in GHC for collecting binders.Ƌghc-lib-parser2Indicate if evidence binders have to be collected.This type is used as a boolean (should we collect evidence binders or not?) but also to pass an evidence that the AST has been typechecked when we do want to collect evidence binders, otherwise these binders are not available.*See Note [Dictionary binders in ConPatOut]Njghc-lib-parserDon't collect evidence bindersȋghc-lib-parserCollect evidence bindersɋghc-lib-parser e => (e)׋ghc-lib-parserA simple case alternative with a single pattern, no binds, no guards; pre-typecheckingڋghc-lib-parserWrap in parens if  appPrec says it needs them So f x becomes (f x), but 3 stays as 3.ghc-lib-parserA useful function for building OpApps. The operator is always a variable, and we don't know the fixity yet.ghc-lib-parser NB: Only for S .ghc-lib-parser Wildcard pattern - after parsingghc-lib-parser!Wildcard pattern - after renamingghc-lib-parser4The Big equivalents for the source tuple expressionsghc-lib-parser1The Big equivalents for the source tuple patternsghc-lib-parserLifts a "small" constructor into a "big" constructor by recursive decompositionghc-lib-parserSplit a list into lists that are small enough to have a corresponding tuple arity. The sub-lists of the result all have length <= > But there may be more than > sub-listsghc-lib-parser Convert an w to an w.ghc-lib-parser Convert an w to an w.ghc-lib-parserConvert x to x. The former is what is parsed, but the latter is what we need in class/instance declarationsghc-lib-parser8Not infix, with place holders for coercion and free varsghc-lib-parser!In Name-land, with empty bind_fvsghc-lib-parserIf any of the matches in the x are infix, the x is considered infix.ghc-lib-parser Return the 0 encompassing the contents of any enclosed bindsghc-lib-parserConvenience function using . This is for generated bindings only, do not use for user-written code.ghc-lib-parser#Make a prefix, non-strict function څÌghc-lib-parserShould we treat this as an unlifted bind? This will be true for any bind that binds an unlifted variable, but we must be careful around AbsBinds. See Note [Unlifted id check in isUnliftedHsBind]. For usage information, see Note [Strict binds checks] is GHC.HsToCore.Binds.Čghc-lib-parser5Is a binding a strict variable or pattern bind (e.g. !x = ...)?ƌghc-lib-parserCollect  binders only, or "s + pattern synonyms, respectivelyȌghc-lib-parser Collect both s and pattern-synonym bindersʌghc-lib-parserSame as Ɍ#, but works over a list of bindingsˌghc-lib-parserUsed exclusively for the bindings of an instance decl which are all FunBindsԌghc-lib-parserReturns all the binding names of the decl. The first one is guaranteed to be the name of the decl. The first component represents all binding names except record fields; the second represents field occurrences. For record fields mentioned in multiple constructors, the SrcLoc will be from the first occurrence.3Each returned (Located name) has a SrcSpan for the whole- declaration. See Note [SrcSpan for binders]Ռghc-lib-parserSee Note [SrcSpan for binders]֌ghc-lib-parserCollects record pattern-synonym selectors only; the pattern synonym names are collected by nj.،ghc-lib-parserthe < returned are for the whole declarations, not just the namesghc-lib-parser5"Small" constructor function, of maximum input arity >ghc-lib-parser/Possible "big" list of things to construct fromghc-lib-parser:Constructed thing made possible by recursive decompositionËŋċƋNjȋɋʋˋ̋͋΋ϋЋыҋӋԋՋ֋׋؋ًڋۋ܋݋ދߋŒÌČŌƌnjȌɌʌˌ̌͌ΌόЌьҌӌԌՌ֌׌،ٌڌیɋϋЋыҋӋԋ׋ʋˋ̋͋ŒՋ֋ڋ؋ً΋݋ދߋۋ܋ÌČŌnjʌƌɌȌˌЌь̌͌ΌόËŋċƋNjȋԌӌ֌׌ՌҌ،ٌڌیNone W8+ghc-lib-parserSort the variables, putting type and covars first, in scoped order, and then other IdsIt is a deterministic sort, meaining it doesn't look at the values of Uniques. For explanation why it's important See Note [Unique Determinism] in GHC.Types.Unique.ghc-lib-parser1Bind a binding group over an expression, using a let or case as appropriate (see GHC.Core#let_app_invariant)ghc-lib-parserCreate a lambda where the given expression has a number of variables bound over it. The leftmost binder is that bound by the outermost lambda in the resultghc-lib-parserBind a list of binding groups over an expression. The leftmost binding group becomes the outermost group in the resulting expressionghc-lib-parserConstruct an expression which represents the application of a number of expressions to that of a data constructor expression. The leftmost expression in the list is applied firstghc-lib-parserConstruct an expression which represents the application of a number of expressions to another. The leftmost expression in the list is applied firstRespects the let/app invariant by building a case expression where necessary See Note [Core let/app invariant] in GHC.Coreghc-lib-parserConstruct an expression which represents the application of one expression to the otherRespects the let/app invariant by building a case expression where necessary See Note [Core let/app invariant] in GHC.Coreghc-lib-parserMake a wildcard binder. This is typically used when you need a binder that you expect to use only at a *binding* site. Do not use it at occurrence sites because it has a single, fixed unique, and it's very easy to get into difficulties with shadowing. That's why it is used so little.See Note [WildCard binders] in GHC.Core.Opt.Simplify.Envghc-lib-parserMake a case expression whose case binder is unused The alts and res_ty should not have any occurrences of WildIdghc-lib-parser Create a S" which will evaluate to the given Intghc-lib-parser Create a S" which will evaluate to the given Int. Don't check that the number is in the range of the target platform Intghc-lib-parser Create a S" which will evaluate to the given Intghc-lib-parser Create a S which will evaluate to the a Word with the given valueghc-lib-parser Create a S" which will evaluate to the given Integerghc-lib-parser Create a S" which will evaluate to the given Naturalghc-lib-parser Create a S" which will evaluate to the given Floatghc-lib-parser Create a S" which will evaluate to the given Doubleghc-lib-parser Create a S" which will evaluate to the given Charghc-lib-parser Create a S" which will evaluate to the given Stringghc-lib-parser Create a S which will evaluate to a string morally equivalent to the given  FastStringghc-lib-parserBuild the type of a small tuple that holds the specified variables One-tuples are flattened; see Note [Flattening one-tuples]ghc-lib-parserBuild a small tuple holding the specified expressions One-tuples are flattened; see Note [Flattening one-tuples]ghc-lib-parserBuild a small unboxed tuple holding the specified expressions, with the given types. The types must be the types of the expressions. Do not include the RuntimeRep specifiers; this function calculates them for you. Does not5 flatten one-tuples; see Note [Flattening one-tuples]ghc-lib-parser=Make a core tuple of the given boxity; don't flatten 1-tuplesghc-lib-parserBuild an unboxed sum.)Alternative number ("alt") starts from 1.ghc-lib-parserBuild a big tuple holding the specified variables One-tuples are flattened; see Note [Flattening one-tuples]ghc-lib-parserBuild the type of a big tuple that holds the specified variables One-tuples are flattened; see Note [Flattening one-tuples]ghc-lib-parserBuild a big tuple holding the specified expressions One-tuples are flattened; see Note [Flattening one-tuples]ghc-lib-parserBuild the type of a big tuple that holds the specified type of thing One-tuples are flattened; see Note [Flattening one-tuples]ghc-lib-parserThe unit expressionghc-lib-parser is like  but one-tuples are NOT flattened (see Note [Flattening one-tuples])Builds a selector which scrutises the given expression and extracts the one name from the list given. If you want the no-shadowing rule to apply, the caller is responsible for making sure that none of these names are in scope.If there is just one 7 in the tuple, then the selector is just the identity.0If necessary, we pattern match on a "big" tuple.A tuple selector is not linear in its argument. Consequently, the case expression built by  must consume its scrutinee D? times. And all the argument variables must have multiplicity D.ghc-lib-parserBuilds a selector which scrutises the given expression and extracts the one name from the list given. If you want the no-shadowing rule to apply, the caller is responsible for making sure that none of these names are in scope.If there is just one 7 in the tuple, then the selector is just the identity.0If necessary, we pattern match on a "big" tuple.A tuple selector is not linear in its argument. Consequently, the case expression built by  must consume its scrutinee D? times. And all the argument variables must have multiplicity D.ghc-lib-parserʫ is like  but one-tuples are NOT flattened (see Note [Flattening one-tuples])Like 7 but for tuples that are guaranteed never to be "big". mkSmallTupleSelector [x] x v e = [| e |] mkSmallTupleSelector [x,y,z] x v e = [| case e of v { (x,y,z) -> x } |]ghc-lib-parserA generalization of ?, allowing the body of the case to be an arbitrary expression.;To avoid shadowing, we use uniques to invent new variables./If necessary we pattern match on a "big" tuple.ghc-lib-parserAs , but for a tuple that is small enough to be guaranteed not to need nesting.ghc-lib-parser/Applies the floats from right to left. That is wrapFloats [b1, b2, @, bn] u = let b1 in let b2 in @ in let bn in ughc-lib-parser Makes a list [] for lists of the specified typeghc-lib-parser Makes a list (:) for lists of the specified typeghc-lib-parserMake a list containing the given expressions, where the list has the given typeghc-lib-parserMake a fully applied  expressionghc-lib-parserMake a build6 expression applied to a locally-bound worker functionghc-lib-parser&Makes a Nothing for the specified typeghc-lib-parser/Makes a Just from a value of the specified type ghc-lib-parserfunctionghc-lib-parser argumentsghc-lib-parserfunctionghc-lib-parserargumentghc-lib-parser scrutineeghc-lib-parserres_tyghc-lib-parseraltsghc-lib-parserguardghc-lib-parserthenghc-lib-parserelseghc-lib-parserThe $s to pattern match the tuple againstghc-lib-parserThe  to selectghc-lib-parser,A variable of the same type as the scrutineeghc-lib-parser Scrutineeghc-lib-parserSelector expressionghc-lib-parserThe $s to pattern match the tuple againstghc-lib-parserThe  to selectghc-lib-parser,A variable of the same type as the scrutineeghc-lib-parser Scrutineeghc-lib-parserSelector expressionghc-lib-parser-For inventing names of intermediate variablesghc-lib-parser)The tuple identifiers to pattern match onghc-lib-parserBody of the caseghc-lib-parser,A variable of the same type as the scrutineeghc-lib-parser Scrutineeghc-lib-parserThe tuple argsghc-lib-parserBody of the caseghc-lib-parser,A variable of the same type as the scrutineeghc-lib-parser Scrutineeghc-lib-parserElement type of the listghc-lib-parserFold result typeghc-lib-parserCons! function expression for the foldghc-lib-parserNil expression for the foldghc-lib-parser#List expression being folded acressghc-lib-parser!Type of list elements to be builtghc-lib-parser+Function that, given information about the s of the binders for the build worker function, returns the body of that workere݌ތߌe݌ތߌ44None _]`ghc-lib-parserSimple optimiser options`ghc-lib-parserUnfolding optionsghc-lib-parserCoercion optimiser optionsghc-lib-parser)Default options for the Simple optimiser.ghc-lib-parserReturns Just (bndr,rhs) if the binding is a join point: If it's a JoinId, just return it If it's not yet a JoinId but is always tail-called, make it into a JoinId and return it. In the latter case, eta-expand the RHS if necessary, to make the lambdas explicit, as is required for join pointsPrecondition: the InBndr has been occurrence-analysed, so its OccInfo is validghc-lib-parserReturns 'Just ([b1..bp], dc, [t1..tk], [x1..xn]) if the argument expression is a *saturated* constructor application of the form *let b1 in .. let bp in dc t1..tk x1 .. xn>, where t1..tk are the *universally-quantified* type args of dc. Floats can also be (and most likely are) single-alternative case expressions. Why does  return floats? We may have to look through lets and cases to detect that we are in the presence of a data constructor wrapper. In this case, we need to return the lets and cases that we traversed. See Note [exprIsConApp_maybe on data constructors with wrappers]. Data constructor wrappers are unfolded late, but we really want to trigger case-of-known-constructor as early as possible. See also Note [Activation for data constructor wrappers] in GHC.Types.Id.Make.We also return the incoming InScopeSet, augmented with the binders from any [FloatBind] that we return ``` ```None aB5ghc-lib-parserData Constructor Boxerghc-lib-parserStrict fields by defaultghc-lib-parser?Disable automatic field unboxing (e.g. if we aren't optimising)ghc-lib-parserUnbox strict fieldsghc-lib-parserUnbox small strict fieldsghc-lib-parserUsed for imported data constructors See Note [Bangs on imported data constructors]&555=ÍčōƍǍȍɍʍˍ͍̍΍ύЍэҍӍ&čō5͍55Ѝэҍˍ͍̍=Ӎύʍ΍ɍƍǍȍNone bI"@@@@@@@ԍՍ֍׍؍ٍڍۍ܍ݍލߍ"ԍՍ֍׍@؍ۍڍ@ٍ@@܍@ލߍ@ݍ@None hghc-lib-parser Used to make T for an 1 defined in the module being compiled. See also Tghc-lib-parserFind the "top" free names of several expressions. Such names are either: The function finally being applied to in an application chain (if that name is a GlobalId: see GHC.Types.Var#globalvslocal), orThe TyCon if the expression is a This is used for the fast-match-check for rules; if the top names don't match, the rest can'tghc-lib-parserGather all the rules for locally bound identifiers from the supplied bindingsghc-lib-parserThe main rule matching function. Attempts to apply all (active) supplied rules to this instance of an application in a given context, returning the rule applied and the resulting expression if successful.ghc-lib-parser!Initialize RuleOpts from DynFlagsghc-lib-parserReport partial matches for rules beginning with the specified string for the purposes of error reportingghc-lib-parser Rule optionsghc-lib-parserRule activation testghc-lib-parser Rule patternghc-lib-parserRules for an Idghc-lib-parserBindings to check inghc-lib-parserResulting check messageNone&5 i<ghc-lib-parserMatch the scrutinee of a case and potentially return a new scrutinee and a function to apply to each literal alternative.eeNone23>? i}None-23>? o ghc-lib-parserextra source files (e.g. from #includes). The lexer collects these from '#  file  line' pragmas, which the C preprocessor leaves behind. These files and their timestamps are stored in the .hi file, so that we can force recompilation if any of them change (#3589)ghc-lib-parserHaskell ModuleAll we actually declare here is the top-level structure for a module.ghc-lib-parser2s2,22,2, 2 for explicit braces and semi around hsmodImports,hsmodDecls if this style is used.ghc-lib-parserLayout info for the module. For incomplete modules (e.g. the output of parseHeader), it is NoLayoutInfo.ghc-lib-parserNothing: "module X where" is omitted (in which case the next field is Nothing too)ghc-lib-parser Export listNothing+: export list omitted, so export everythingJust [] : export nothing Just [...]: as you would expect...2s : 2% ,2ghc-lib-parserWe snaffle interesting stuff out of the imported interfaces early on, adding that info to TyDecls/etc; so this list is often empty, downstream.ghc-lib-parser1Type, class, value, and interface signature declsghc-lib-parser9reason/explanation for warning/deprecation of this module2s : 2% ,2Ðghc-lib-parser-Haddock module info and description, unparsed2s : 2% ,2 1111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222223333333333333333333333333333333333333333333333333333333333333333LMMMMMMMMMMMMMPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSdžȆˆɆʆS؆ن܆چۆSShhhhhhhhhhhhhhhhhhhhhhuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuvvvvvvuuvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvxxxxxxxxxxxxxxxxxxxxvvvvvvvvvvvvvvvvvvvvvvvvvvvvwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyzzzzyyzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz{{{{{{{zzzzzzzzzz{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{ʅυ΅ͅ˅̅ЅӅх҅ԅم؅ׅՅօڅ߅ޅ݅܅ۅ†ÆĆņƆ̆͆Ά҆цφІӆԆՆֆ׆݆ކ߆‡ÇćŇƇLJȇɇʇˇ̇ڇۇ܇݇އ߇ˆÈĈňȈɈʈˈ͈̈ΈψЈш҈ӈ׈ֈԈՈ؈و߈ވ݈܈ڈۈÉĉljʼnƉȉɉʉˉ͉̉ΉωЉщ҉ӉԉՉ։׉؉ىډۉ܉݉މ߉ŠÊƊĊŊNJȊ̊ˊɊʊ͊ΊϊЊԊӊъҊՊ֊׊ڊ؊يۊ܊݊ފߊËŋċƋNjȋɋʋˋ̋͋΋ϋЋыҋӋԋՋ֋׋؋ًڋۋ܋݋ދߋŒÌČŌƌnjȌɌʌˌ̌͌ΌόЌьҌӌԌՌ֌׌،ٌڌیÐÐNone Ȑghc-lib-parserData for a module node in a  ModuleGraph/. Module nodes of the module graph are one of:A regular Haskell source moduleA hi-boot source moduleʐghc-lib-parserIdentity of the moduleːghc-lib-parser8The module source either plain Haskell, hs-boot, or hsig̐ghc-lib-parser5Location of the various files belonging to the module͐ghc-lib-parserContent hash of source fileΐghc-lib-parser#Timestamp of object, if we have oneϐghc-lib-parser+Timestamp of dynamic object, if we have oneАghc-lib-parserTimestamp of hi file, if we have one See Note [When source is considered modified] and #9243ѐghc-lib-parser%Timestamp of hie file, if we have oneҐghc-lib-parserSource imports of the moduleӐghc-lib-parser7Non-source imports of the module from the module *text*Ԑghc-lib-parser? /ghc-lib-parser)Does this module define family instances?ghc-lib-parser summarises everything we know about a compiled module. The ő is the stuff *before* linking, and can be written out to an interface file. The 'ModDetails is after linking and can be completely recovered from just the ő.4When we read an interface file, we also construct a ő. from it, except that we explicitly make the  and a few other fields empty; as when reading we consolidate the declarations etc. into a number of indexed maps and environments in the ExternalPackageState.See Note [Strictness in ModIface] to learn about why some fields are strict and others are not.ghc-lib-parserName of the module we are forghc-lib-parserAre we a sig of another mod?ghc-lib-parserBoot? Signature?ghc-lib-parserThe dependencies of the module. This is consulted for directly-imported modules, but not for anything else (hence lazy)ghc-lib-parserUsages; kept sorted so that it's easy to decide whether to write a new iface file (changing usages doesn't affect the hash of this module) NOT STRICT! we read this field lazily from the interface file It is *only* consulted by the recompilation checkerghc-lib-parserExports Kept sorted by (mod,occ), to make version comparisons easier Records the modules that are the declaration points for things exported by this module, and the s of those thingsghc-lib-parserModule required TH splices when it was compiled. This disables recompilation avoidance (see #481).ghc-lib-parserFixities NOT STRICT! we read this field lazily from the interface fileghc-lib-parserWarnings NOT STRICT! we read this field lazily from the interface fileghc-lib-parserAnnotations NOT STRICT! we read this field lazily from the interface fileghc-lib-parserType, class and variable declarations The hash of an Id changes if its fixity or deprecations change (as well as its type of course) Ditto data constructors, class operations, except that the hash of the parent class/tycon changesghc-lib-parser6Binds all the things defined at the top level in the original source code for this module. which is NOT the same as mi_exports, nor mi_decls (which may contains declarations for things not actually defined by the user). Used for GHCi and for inspecting the contents of modules via the GHC API only.(We need the source file to figure out the top-level environment, if we didn't compile this module from source then this field contains Nothing).1Strictly speaking this field should live in the  HomeModInfo", but that leads to more plumbing.ghc-lib-parserSorted class instanceghc-lib-parserSorted family instancesghc-lib-parser Sorted rulesghc-lib-parser:True if this program uses Hpc at any point in the program.ghc-lib-parser/Safe Haskell Trust information for this module.ghc-lib-parserDo we require the package this module resides in be trusted to trust this module? This is used for the situation where a module is Safe (so doesn't require the package be trusted itself) but imports some trustworthy modules from its own package (which does require its own package be trusted). See Note [Trust Own Package] in GHC.Rename.Namesghc-lib-parser:Docstrings and related data for use by haddock, the ghci :doc command, and other tools.Just _  = the module was built with -haddock.ghc-lib-parserEither () or % for a fully instantiated interface.ghc-lib-parserAdditional optional fields, where the Map key represents the field name, resulting in a (size, serialized data) pair. Because the data is intended to be serialized through the internal 3 class (increasing compatibility with types using  and  FastString,, such as HIE), this format is chosen over  ByteStrings.ghc-lib-parser8Hash of the .hs source, used for recompilation checking.ghc-lib-parserSelects a IfaceDecl representation. For fully instantiated interfaces we also maintain a fingerprint, which is used for recompilation checks.ghc-lib-parserExtends a PartialModIface with information which is either: * Computed after codegen * Or computed just before writing the iface to disk. (Hashes) In order to fully instantiate it.ghc-lib-parserHash of the whole interfaceghc-lib-parserHash of the ABI onlyghc-lib-parserHash of the important flags used when compiling the module, excluding optimisation flagsghc-lib-parserHash of optimisation flagsghc-lib-parserHash of hpc flagsghc-lib-parserHash of pluginsghc-lib-parserWhether this module has orphansghc-lib-parserWhether this module has family instances. See Note [The type family instance consistency story].ghc-lib-parserHash of export listghc-lib-parser:Hash for orphan rules, class and family instances combined‘ghc-lib-parserCached lookup for Ñghc-lib-parserCached lookup for đghc-lib-parserCached lookup for . The Nothing in đ means that the thing isn't in decls. It's useful to know that when seeing if we are up to date wrt. the old interface. The + is the parent of the name, if it has one.Ǒghc-lib-parserOld-style accessor for whether or not the ModIface came from an hs-boot file.ɑghc-lib-parser-Lookups up a (possibly cached) fixity from a ő. If one cannot be found,  is returned instead.ʑghc-lib-parserThe semantic module for this interface; e.g., if it's a interface for a signature, if  is p[A= A]:A, ʑ will be  A.ˑghc-lib-parser:The "precise" free holes, e.g., the signatures that this ő depends on.̑ghc-lib-parserGiven a set of free holes, and a unit identifier, rename the free holes according to the instantiation of the unit identifier. For example, if we have A and B free, and our unit identity is p[A= C ,B=impl:B]%, the renamed free holes are just C.ϑghc-lib-parserConstructs cache for the đ field of a ő:Ñ‘đőƑǑȑɑʑˑ̑͑ΑϑБё:őƑÑ‘đǑɑʑˑȑ̑͑ΑϑБёNone Ցghc-lib-parser;Helps us find information about modules in the home package֑ghc-lib-parser7Information about modules in the package being compiledؑghc-lib-parserThe basic loaded interface file: every loaded module has one of these, even if it is imported from another packageّghc-lib-parser1Extra information that has been created from the ő/ for the module, typically during typecheckingڑghc-lib-parserThe actual artifact we would like to link to access things in this module.ڑ might be Nothing: If this is an .hs-boot moduleTemporarily during compilation if we pruned away the old linkable because it was out of date.After a complete compilation (), all ڑ fields in the Ց will be Just.When re-linking a module (), we construct the ֑ by building a new t from the old ő (only).ۑghc-lib-parser$Constructs an empty HomePackageTableՑ֑בّؑڑۑܑݑޑߑ֑בّؑڑՑۑܑޑߑݑNone ghc-lib-parser:Accumulated statistics about what we are putting into the !. "In" means stuff that is just read from interface files, "Out" means actually sucked in and type-checkedghc-lib-parserInformation about other packages that we have slurped in by reading their interface filesghc-lib-parserIn OneShot mode (only), home-package modules accumulate in the external package state, and are sucked in lazily. For these home-pkg modules (only) we need to record which are boot modules. We set this field after loading all the explicitly-imported interfaces, but before doing anything elseThe   part is not necessary, but it's useful for debug prints, and it's convenient because this field comes direct from ghc-lib-parserThe ős for modules in external packages whose interfaces we have opened. The declarations in these interface files are held in the  eps_decls, ,  and  eps_rules$ fields of this record, not in the , fields of the interface we have sucked in.What is in the PIT is: The ModuleFingerprint info Its exportsFixitiesDeprecations and warningsghc-lib-parser Cache for ˑ#. Ordinarily, we can rely on the  for this information, EXCEPT that when we do dependency analysis, we need to look at the  Dependencies of our imports to determine what their precise free holes are (moduleFreeHolesPrecise). We don't want to repeatedly reread in the interface for every import, so cache it here. When the PIT gets filled in we can drop these entries.ghc-lib-parserResult of typechecking all the external package interface files we have sucked in. The domain of the mapping is external-package modulesghc-lib-parser The total t3 accumulated from all the external-package modulesghc-lib-parser The total L3 accumulated from all the external-package modulesghc-lib-parser The total RuleEnv3 accumulated from all the external-package modulesghc-lib-parser The total 13 accumulated from all the external-package modulesghc-lib-parser The total O3 accumulated from all the external-package modulesghc-lib-parserThe family instances accumulated from external packages, keyed off the module that declared themghc-lib-parser5Stastics about what was loaded from external packagesghc-lib-parserInformation about the currently loaded external packages. This is mutable because packages will be demand-loaded during a compilation run as required.ghc-lib-parserHelps us find information about modules in the imported packagesghc-lib-parser%Constructs an empty PackageIfaceTableghc-lib-parser&Add stats for one newly-read interface##None 567> Ϋ ghc-lib-parserExternal unitsghc-lib-parser0Stack of unit databases for the target platform.+This field is populated with the result of o.H4 means the databases have never been read from disk.Usually we don't reload the databases from disk if they are cached, even if the database flags changed!ghc-lib-parserThe dynamic flag settingsghc-lib-parserThe home package table describes already-compiled home-package modules,  excluding the module we are compiling right now. (In one-shot mode the current module is the only home-package module, so homeUnitEnv_hpt is empty. All other modules count as "external-package" modules. However, even in GHCi mode, hi-boot interfaces are demand-loaded into the external-package table.) is not mutable because we only demand-load external packages; the home package is eagerly loaded, module by module, by the compilation manager.0The HPT may contain modules compiled earlier by --make but not actually below the current module in the dependency graph.4(This changes a previous invariant: changed Jan 05.)ghc-lib-parser Home-unitghc-lib-parserInformation about the currently loaded external packages. This is mutable because packages will be demand-loaded during a compilation run as required.ghc-lib-parserPlatformghc-lib-parser2GHC name/version (used for dynamic library suffix)ghc-lib-parser Get home-unit+Unsafe because the home-unit may not be setghc-lib-parserLookup $ for every preload unit from the UnitState, for every unit used to instantiate the home unit, and for every unit explicitly passed in the given list of UnitId.ghc-lib-parserLookup $ for every preload unit from the UnitState and for every unit used to instantiate the home unit.ghc-lib-parser+Test if the module comes from the home unit˒ghc-lib-parser*Rename a unit id in the internal unit env.˒ oldUnit newUnit UnitEnv, it is assumed that the oldUnit. exists in the map, otherwise we panic. The l3 associated with the home unit will have its field  set to newUnit.?’ÒĒŒƒǒȒɒʒ˒̒?ƒÒĒǒȒɒʒŒ’˒̒None Ғghc-lib-parserCreates some functions that work out the best ways to format names for the user according to a set of heuristics.Ӓghc-lib-parserCreates a function for formatting modules based on two heuristics: (1) if the module is the current module, don't qualify, and (2) if there is only one exposed package which exports this module, don't qualify.Ԓghc-lib-parserCreates a function for formatting packages based on two heuristics: (1) don't qualify if the package in question is "main", and (2) only qualify with a unit id if the package ID would be ambiguous.Ւghc-lib-parserA function which only qualifies package names if necessary; but qualifies all other identifiers.ҒӒԒՒҒӒԒՒNone O%֒ghc-lib-parserA restricted form of  for code generation purposesؒghc-lib-parserModule being compiledْghc-lib-parserAlgebraic data types (including ones that started life as classes); generate constructors and info tables. Includes newtypes, just for the benefit of External Coreڒghc-lib-parserThe tidied main bindings, including previously-implicit bindings for record and class selectors, and data constructor wrappers. But *not* data constructor workers; reason: we regard them as part of the code-gen of tyconsܒghc-lib-parserForeign export stubsޒghc-lib-parser>Dependent packages, used to generate #includes for C code genߒghc-lib-parser%Program coverage tick box informationghc-lib-parserModule breakpointsghc-lib-parserStatic pointer table entries for static forms defined in the module. See Note [Grand plan for static forms] in GHC.Iface.Tidy.StaticPtrTableghc-lib-parserA ModGuts is carried through the compiler, accumulating stuff as it goes There is only one ModGuts at any time, the one for the module being compiled right now. Once it is compiled, a ModIface and  ModDetails, are extracted and the ModGuts is discarded.ghc-lib-parserModule being compiledghc-lib-parserWhether it's an hs-boot moduleghc-lib-parser$For error messages from inner passesghc-lib-parserWhat it exportsghc-lib-parser*What it depends on, directly or otherwiseghc-lib-parser$What was used? Used for interfaces.ghc-lib-parserDid we run a TH splice?ghc-lib-parserTop-level lexical environmentghc-lib-parserFixities declared in this module. Used for creating interface files.ghc-lib-parser=TyCons declared in this module (includes TyCons for classes)ghc-lib-parser'Class instances declared in this moduleghc-lib-parser(Family instances declared in this moduleghc-lib-parser(Pattern synonyms declared in this moduleghc-lib-parserBefore the core pipeline starts, contains See Note [Overall plumbing for rules] in GHC.Core.Rulesghc-lib-parserBindings for this moduleghc-lib-parser'Foreign exports declared in this moduleghc-lib-parser(Files to be compiled with the C compilerghc-lib-parserWarnings declared in the moduleghc-lib-parser#Annotations declared in this moduleghc-lib-parserComplete Matchesghc-lib-parser!Coverage tick boxes in the moduleghc-lib-parserBreakpoints for the moduleghc-lib-parser Class instance environment for  home-package% modules (including this one); c.f.  tcg_inst_envghc-lib-parser&Type-family instance environment for  home-package% modules (including this one); c.f. tcg_fam_inst_envghc-lib-parserSafe Haskell modeghc-lib-parserDo we need to trust our own package for Safe Haskell? See Note [Trust Own Package] in GHC.Rename.Namesghc-lib-parserDocumentation.+֒גْؒڒےܒݒޒߒ+֒גْؒڒےܒݒޒߒNone ghc-lib-parser(Action to perform in backend compilationghc-lib-parser+Update the boot and signature file results.ghc-lib-parserRecompile this module.ghc-lib-parser#Information for the code generator.ghc-lib-parser Module infoghc-lib-parserPartial interfaceghc-lib-parserOld interface hash for this compilation, if an old interface file exists. Pass to hscMaybeWriteIface when writing the interface to avoid updating the existing interface when the interface isn't changed.ghc-lib-parser-Status of a module in incremental compilationghc-lib-parser*Nothing to do because code already exists.ghc-lib-parserRecompilation of module, or update of interface is required. Optionally pass the old interface hash to avoid updating the existing interface when it has not changed.  None ghc-lib-parserWhether this is a lambda-case (True) or a normal case (False)ghc-lib-parser Are we in a do% expression or a monad comprehension?This datatype is only used to report this context to the user in error messages.ghc-lib-parserIn what context are we checking that a type has a fixed runtime representation?ghc-lib-parser C [a] where ... When typechecking the instance decl itself, including producing evidence for the superclasses of C, the superclasses of (Foo a) and (Bar a) will have  origin.ghc-lib-parser is used for a Given constraint obtained by superclass selection from a constraint  other than the context of an instance declaration. (For the latter we use .) E.g. f :: Foo a => blah f = e When typechecking body of f3, the superclasses of the Given (Foo a) will have . Needed for Note [Replacement vs keeping] and Note [Use only the best local instance], both in GHC.Tc.Solver.Interact.ԓghc-lib-parserԓ is used only for the Wanted constraints for the superclasses of an instance declaration. If the instance head is  C ty1 .. tyn then #TypeSize = sizeTypes [ty1, .., tyn] See Note [Solving superclass constraints] in GHC.Tc.TyCl.Instanceghc-lib-parserTesting whether the constraint associated with an instance declaration in a signature file is satisfied upon instantiation.Test cases: backpack should_failbkpfail{11,43}.bkpghc-lib-parser The thing that has type "actual"ghc-lib-parserIs at least one of the three elements above visible? (Errors from the polymorphic subsumption check are considered visible.) Only used for prioritizing error messages.ghc-lib-parser"Some kind of type variable binder.Used for reporting errors, in   and TcSolverReportMsg.ghc-lib-parserSome thing which has a type.This datatype is used when we want to report to the user that something has an unexpected type.ghc-lib-parserReport Redundant Constraints.ghc-lib-parser"Don't report redundant constraintsghc-lib-parserReport redundant constraints, and here is the SrcSpan for the constraints E.g. f :: (Eq a, Ord b) => blah The span is for the (Eq a, Ord b)ghc-lib-parserUserTypeCtxt describes the origin of the polymorphic type in the places where we need an expression to have that typeghc-lib-parser8Wrap up the origin of a skolem type variable with a new 8, so that we can common up skolem type variables whose   shares a certain .ghc-lib-parserDid a constraint arise from expanding a Wanted constraint to look at superclasses?ghc-lib-parser)Extract a suitable CtOrigin from a HsExprghc-lib-parser-Extract a suitable CtOrigin from a MatchGroup”ghc-lib-parser-Extract a suitable CtOrigin from guarded RHSsƔghc-lib-parserPrint the context for a FixedRuntimeRep# representation-polymorphism check.6Note that this function does not include the specific ?3 which is not fixed. That information is added by .ghc-lib-parserfunctionghc-lib-parserargumentghc-lib-parserThe number of superclass selections necessary to get this constraint; see Note [Replacement vs keeping] and Note [Use only the best local instance], both in GHC.Tc.Solver.Interactghc-lib-parserIf (C ty1 .. tyn) is the largest class from which we made a superclass selection in the chain, then #TypeSize = sizeTypes [ty1, .., tyn] See Note [Solving superclass constraints] in GHC.Tc.TyCl.Instanceghc-lib-parserThe number of superclass selections necessary to get this constraintghc-lib-parserWhere the sub-class constraint arose from (used only for printing)ghc-lib-parser)Module in which the instance was declaredghc-lib-parserThe declared typeclass instanceghc-lib-parserThe type being checked for representation polymorphism. We record it here for access in .ghc-lib-parserused to common up skolem variables bound at the same location (only used in pprSkols)ghc-lib-parser ... Differentiated from TypeHole because a ConstraintHole is simplified differently. See Note [Do not simplify ConstraintHoles] in GHC.Tc.Solver.ghc-lib-parserA hole stores the information needed to report diagnostics about holes in terms (unbound identifiers or underscores) or in types (also called wildcards, as used in partial type signatures). See Note [Holes].ghc-lib-parserWhat flavour of hole is this?ghc-lib-parserThe name of this holeghc-lib-parserType to be printed to the user For expression holes: type of expr For type holes: the missing typeghc-lib-parserWhere hole was writtenghc-lib-parserA  is a type that can appear on the left of a canonical equality: a type variable or exactly-saturated type family application.ghc-lib-parserA special canonical constraint: a constraint that is used internally by GHC's typechecker. See #20000.ghc-lib-parserA -type is one that has been fully rewritten with respect to the inert set; that is, it has been rewritten by the algorithm in GHC.Tc.Solver.Rewrite. (Historical note: , for years and years, meant that a type was type-family-free. It does *not* mean this any more.)ghc-lib-parser?Are we sure that more solving will never solve this constraint?ghc-lib-parser8No problems in checking the validity of a type equality.ghc-lib-parserCheck whether a  is marked successful.•ghc-lib-parserCheck whether a  has a Õghc-lib-parserCheck whether a  has one  and no otherǕghc-lib-parserMark a  as not having an insoluble occurs-check: any occurs check under a type family or in a representation equality is soluble.ȕghc-lib-parserRetain only information about occurs-check failures, because only that matters after recurring into a kind.ӕghc-lib-parserReturns the evidence  for the argument  when this  is a ߔ- which can hold evidence (i.e. doesn't have  ).Returns H otherwise.ԕghc-lib-parserMakes a new equality predicate with the same role as the given evidence.Օghc-lib-parserGet the flavour of the given ֕ghc-lib-parser(Get the equality relation for the given וghc-lib-parserIs a type a canonical LHS? That is, is it a tyvar or an exactly-saturated type family application? Does not look through type synonyms.ؕghc-lib-parser Convert a  back into a ٕghc-lib-parserRetrieve the kind of a ڕghc-lib-parserAre two s equal?ەghc-lib-parserReturns free variables of constraints as a non-deterministic setܕghc-lib-parserReturns free variables of constraints as a non-deterministic setݕghc-lib-parserReturns free variables of constraints as a deterministically ordered list. See Note [Deterministic FV] in GHC.Utils.FV.ޕghc-lib-parserReturns free variables of constraints as a deterministically ordered list. See Note [Deterministic FV] in GHC.Utils.FV.ߕghc-lib-parserReturns free variables of a bag of constraints as a non-deterministic set. See Note [Deterministic FV] in  GHC.Utils.FV.ghc-lib-parserReturns free variables of a bag of constraints as a deterministically ordered list. See Note [Deterministic FV] in  GHC.Utils.FV.ghc-lib-parserReturns free variables of a bag of constraints as a deterministically ordered list. See Note [Deterministic FV] in GHC.Utils.FV.ghc-lib-parserReturns free variables of WantedConstraints as a non-deterministic set. See Note [Deterministic FV] in  GHC.Utils.FV.ghc-lib-parserReturns free variables of WantedConstraints as a deterministically ordered list. See Note [Deterministic FV] in  GHC.Utils.FV.ghc-lib-parserA constraint is considered to be a custom type error, if it contains custom type errors anywhere in it. See Note [Custom type errors in constraints]ghc-lib-parserTrue if taking superclasses of givens, or of wanteds (to perhaps expose more equalities or functional dependencies) might help to solve this constraint. See Note [When superclasses help]ghc-lib-parserChecks whether a the given wanted constraints are solved, i.e. that there are no simple constraints left and all the implications are solved.ghc-lib-parserReturns True of equality constraints that are definitely insoluble, as well as TypeError constraints. Can return J for Given constraints, unlike .This function is critical for accurate pattern-match overlap warnings. See Note [Pattern match warnings with insoluble Givens] in GHC.Tc.SolverNote that this does not traverse through the constraint to find nested custom type errors: it only detects TypeError msg :: Constraint, and not e.g. Eq (TypeError msg).ghc-lib-parserDoes this hole represent an "out of scope" error? See Note [Insoluble holes]ghc-lib-parser)Get the equality relation relevant for a ghc-lib-parserGet the role relevant for a ghc-lib-parser$Extract the set of rewriters from a  See Note [Wanteds rewrite Wanteds] If the provided CtEvidence is not for a Wanted, just return an empty set.ghc-lib-parserSet the type of CtEvidence.-This function ensures that the invariants on  hold, by updating the evidence and the ctev_pred in sync with each other. See Note [CtEvidence invariants].ghc-lib-parserMakes a ? from all the coercion holes that occur in the given coercion.ghc-lib-parserMakes a ; from all the coercion holes that occur in the given type.ghc-lib-parserMakes a < from all the coercion holes that occur in the given types.ghc-lib-parser-Extract the flavour, role, and boxity from a ghc-lib-parser$Extract the flavour and role from a ghc-lib-parser+Take a CtLoc and moves it to the kind levelghc-lib-parser of the familyghc-lib-parserexactly saturating the familyՔ֔ڔהؔٔ۔ܔݔޔߔ•ÕĕŕƕǕȕɕʕ˕͕̕ΕϕЕѕҕӕԕՕ֕וٕؕڕەܕݕޕߕ–͕ΕЕՕ֕ϕѕҕӕԕɕʕ̕˕ەߕݕƕǕ•Õĕŕȕוٕؕڕ۔Ք֔ڔהؔٔ–ޕܕݔޔߔܔNone '(<6ݖޖߖߖޖݖNone <<;ghc-lib-parserSee Note [Safe Haskell Overlapping Instances Implementation] in GHC.Tc.Solverghc-lib-parserReturns Given constraints that might, potentially, match the given pred. This is used when checking to see if a Given might overlap with an instance. See Note [Instance and Given overlap] in GHC.Tc.Solver.Interactghc-lib-parserPush a fresh environment onto the cycle-breaker var stack. Useful when entering a nested implication.ghc-lib-parserAdd a new cycle-breaker binding to the top environment on the stack.ghc-lib-parserPerform a monadic operation on all pairs in the top environment in the stack.ghc-lib-parsera stack of (CycleBreakerTv, original family applications) lists first element in the stack corresponds to current implication; later elements correspond to outer implications used to undo the cycle-breaking needed to handle Note [Type variable cycles] in GHC.Tc.Solver.Canonical Why store the outer implications? For the use in mightEqualLater (only)ghc-lib-parsercbv, must be a CycleBreakerTvghc-lib-parsercbv's expansion//None &1X!ghc-lib-parser)Represents the head of a match against a O or literal. Really similar to T.ghc-lib-parserUndecidable semantic equality result. See Note [Undecidable Equality for PmAltCons]ghc-lib-parserLiterals (simple and overloaded ones) for pattern match checking.-See Note [Undecidable Equality for PmAltCons]ghc-lib-parser A data type that caches for the ̗ of x the results of querying dsGetCompleteMatches* and then striking out all occurrences of K for which we already know x D K from these sets.For motivation, see Section 5.3 in Lower Your Guards. See also Note [Implementation of COMPLETE pragmas]ghc-lib-parserThe residual set for the vanilla COMPLETE set from the data defn. Tracked separately from —, because it might only be known much later (when we have enough type information to see the ? of the match), or not at all even. Until that happens, it is H.—ghc-lib-parserThe residual sets for all COMPLETE sets from pragmas that are visible when compiling this module. Querying that set with dsGetCompleteMatches requires DsM, so we initialise it with H until first needed in a DsM context.×ghc-lib-parserSee ї.̗ghc-lib-parserInformation about an . Stores positive (ϗ) facts, like  x ~ Just 42, and negative (З5) facts, like "x is not (:)". Also caches the type (vi_ty), the  of a COMPLETE set (җ).+Subject to Note [The Pos/Neg invariant] in GHC.HsToCore.Pmc.Solver.Ηghc-lib-parserThe  in question. Important for adding new constraints relative to this ̗ when we don't easily have the  available.ϗghc-lib-parserPositive info:  apps it is (i.e. x ~ [Just y, PatSyn z]), all at the same time (i.e. conjunctive). We need a list because of nested pattern matches involving pattern synonym case x of { Just y -> case x of PatSyn z -> ... } However, no more than one RealDataCon in the list, otherwise contradiction because of generativity.Зghc-lib-parserNegative info: A list of *s that it cannot match. Example, assuming 0 data T = Leaf Int | Branch T T | Node Int T then x D [Leaf, Node] means that x cannot match a Leaf or Node, and hence can only match Branch!. Is orthogonal to anything from ϗ, in the sense that  returns PossiblyOverlap for any pairing between ϗ and З.їghc-lib-parser8Can this variable be E? Models (mutually contradicting) x ~ E and x D E constraints. E.g. * Ɨ: Don't know; Neither x ~ E nor x D E. * ė: x ~ E * ŗ: x D Eҗghc-lib-parserA cache of the associated COMPLETE sets. At any time a superset of possible constructors of each COMPLETE set. So, if it's not in here, we can't possibly match on it. Complementary to З. We still need it to recognise completion of a COMPLETE set efficiently for large enums.ӗghc-lib-parserThe term oracle state. Stores ̗ for encountered s. These entries are possibly shared when we figure out that two variables must be equal, thus represent the same set of values.!See Note [TmState invariants] in GHC.HsToCore.Pmc.Solver.՗ghc-lib-parserFacts about term variables. Deterministic env, so that we generate deterministic error messages.֗ghc-lib-parserAn environment for looking up whether we already encountered semantically equivalent expressions that we want to represent by the same  representative.חghc-lib-parserWhich ̗ needs to be checked for inhabitants because of new negative constraints (e.g. x D E or x D K).ؗghc-lib-parserThe type oracle state. An  that we incrementally add local type constraints to, together with a sequence number that counts the number of times we extended it with new facts.ܗghc-lib-parserA disjunctive bag of ޗ"s, representing a refinement type.ޗghc-lib-parserA normalised refinement type D ("nabla"), comprised of an inert set of canonical (i.e. mutually compatible) term and type constraints that form the refinement type's predicate.ghc-lib-parserType oracle; things like a~Intghc-lib-parser"Term oracle; things like x~Nothingghc-lib-parserLike lookupVarInfo ts x, but lookupVarInfo ts x = (y, vi)3 also looks through newtype constructors. We have x ~ N1 (... (Nk y)) such that the returned y doesn't have a positive newtype constructor constraint associated with it (yet). The ̗ returned is that of y's representative.Careful, this means that idType x might be different to idType y", even modulo type normalisation!See also Note [Coverage checking Newtype matches] in GHC.HsToCore.Pmc.Solver.ghc-lib-parser Type of a ghc-lib-parserWhether there is a  in the  that compares  to the given  according to .ghc-lib-parser'We can't in general decide whether two ?s match the same set of values. In addition to the reasons in ˫ and ̫, a 2 might or might not represent the same value as a 1. See Note [Undecidable Equality for PmAltCons]. Just True ==> Surely equal Just False. ==> Surely different (non-overlapping, even!)Nothing" ==> Equality relation undecidable.Examples (omitting some constructor wrapping):/eqPmAltCon (LitInt 42) (LitInt 1) == Just False: Lit equality is decidable0eqPmAltCon (DataCon A) (DataCon B) == Just False": DataCon equality is decidable4eqPmAltCon (LitOverInt 42) (LitOverInt 1) == Nothing$: OverLit equality is undecidable-eqPmAltCon (PatSyn PA) (PatSyn PB) == Nothing#: PatSyn equality is undecidable-eqPmAltCon (DataCon I#) (LitInt 1) == Nothing: DataCon to Lit comparisons are undecidable without reasoning about the wrapped Int#5eqPmAltCon (LitOverInt 1) (LitOverInt 1) == Just True2: We assume reflexivity for overloaded literals/eqPmAltCon (PatSyn PA) (PatSyn PA) == Just True/: We assume reflexivity for Pattern Synonymsghc-lib-parser Type of a ghc-lib-parserIs a match on this constructor forcing the match variable? True of data constructors, literals and pattern synonyms (#17357), but not of newtypes. See Note [Coverage checking Newtype matches] in GHC.HsToCore.Pmc.Solver.ghc-lib-parserNot user-facing.ghc-lib-parserSyntactic equality.ghc-lib-parserSyntactic equality.ghc-lib-parserNot user-facing.ghc-lib-parserNot user-facing.O—×ėŗƗǗȗɗʗ˗̗͗ΗϗЗїҗӗԗ՗֗חؗٗڗۗܗݗޗߗ×ėŗƗǗȗɗʗ˗̗͗ΗϗЗїҗӗԗ՗֗חؗٗڗۗޗߗܗݗO—None&5fghc-lib-parserUsed as tree payload post-checking. The redundancy info we elaborated.ghc-lib-parser;Used as tree payload pre-checking. The LYG guards to check.ghc-lib-parser#Pattern-match coverage check resultghc-lib-parser,A hole for redundancy info and covered sets.ghc-lib-parserThe set of uncovered values falling out at the bottom. (for -Wincomplete-patterns, but also important state for the algorithm)ghc-lib-parser&A flag saying whether we ran into the maxPmCheckModels limit for the purpose of suggesting to crank it up in the warning message. Writer state.ghc-lib-parserRedundancy sets, used to determine redundancy of RHSs and bang patterns (later digested into a CIRB).ghc-lib-parserThe Covered= set; the set of values reaching a particular program point.ghc-lib-parserThe  Diverging set; empty if no match can lead to divergence. If it wasn't empty, we have to turn redundancy warnings into inaccessibility warnings for any subclauses.ghc-lib-parserIf any of the ܗ is empty, the corresponding  pin-points a bang pattern in source that is redundant. See Note [Dead bang patterns].ghc-lib-parser(A guard tree denoting a pattern binding.ghc-lib-parser%A guard tree denoting an -XEmptyCase.ghc-lib-parserA guard tree denoting GRHS&: A payload describing the grds and a / useful for printing out in warnings messages.ghc-lib-parserA guard tree denoting GRHSs : A bunch of % guards for local bindings from the GRHSss where clauses and the actual list of GRHS=. See Note [Long-distance information for HsLocalBinds] in GHC.HsToCore.Pmc.Desugar.ghc-lib-parserA guard tree denoting Match5: A payload describing the pats and a bunch of GRHS.ghc-lib-parserA guard tree denoting  MatchGroup.ghc-lib-parserA sequence of s.ghc-lib-parserMeans by which we identify a source construct for later pretty-printing in a warning message.   for the equation to show,  for the location.ghc-lib-parserA very simple language for pattern guards. Let bindings, bang patterns, and matching variables against flat constructor patterns. The LYG guard language.ghc-lib-parserPmCon x K dicts args corresponds to a K dicts args <- x guard. The args" are bound in this construct, the x0 is just a use. For the arguments' meaning see .ghc-lib-parserPmBang x corresponds to a  seq x True guard. If the extra  is present, the bang guard came from a source bang pattern, in which case we might want to report it as redundant. See Note [Dead bang patterns] in GHC.HsToCore.Pmc.Check.ghc-lib-parser PmLet x expr corresponds to a  let x = expr guard. This actually binds x.ghc-lib-parserShould not be user-facing.ghc-lib-parserFormat LYG guards as | True <- x, let x = 42, !zO—×ƗėŗǗȗ˗ɗʗ̗͗җїЗΗϗӗԗח՗֗ؗٗڗۗܗݗޗߗ1NonejϘghc-lib-parserPretty-print the guts of an uncovered value vector abstraction, i.e., its components and refutable shapes associated to any mentioned variables. Example for )([Just p, q], [p :-> [3,4], q :-> [0,5]]): (Just p) q where p is not one of {3, 4} q is not one of {0, 5} When the set of refutable shapes contains more than 3 elements, the additional elements are indicated by "...".ϘϘNone'(_ghc-lib-parser3Whether we ran out of fuel generating the bindings.ghc-lib-parser.A collection of hole fits and refinement fits.ghc-lib-parserA collection of valid hole fits or refinement fits, in which some fits might have been suppressed.ghc-lib-parserWhether we have suppressed any fits because there were too many.ghc-lib-parserThis datatype collates instances that match or unifier, in order to report an error message for an unsolved typeclass constraint.ghc-lib-parser!Explain a problem with an import.ghc-lib-parser/Couldn't find a module with the requested name.ghc-lib-parser9The imported modules don't export what we're looking for.ghc-lib-parserA message that aims to explain why two types couldn't be seen to be representationally equal.ghc-lib-parserNot knowing the role of a type constructor prevents us from concluding that two types are representationally equal.Example:foo :: Applicative m => m (Sum Int) foo = coerce (pure $ 1 :: Int)We don't know what role m2 has, so we can't coerce `m Int` to `m (Sum Int)`.#Test cases: T8984, TcCoercibleFail.ghc-lib-parserThe fact that a - is abstract prevents us from decomposing a TyConApp: and deducing that two types are representationally equal.Test cases: none.ghc-lib-parser Down Int foo = coerceTest cases: TcCoercibleFail.ghc-lib-parserReport an error involving a .This could be an out of scope data constructor or variable, a typed hole, or a wildcard in a type.ghc-lib-parserReport an out-of-scope data constructor or variable masquerading as an expression hole.Report a typed hole, or wildcard, with additional information.ghc-lib-parser2Configuration for pretty-printing valid hole fits.ghc-lib-parser Some form of "not in scope" error. See also the  constructor of .ghc-lib-parserA run-of-the-mill "not in scope" error.ghc-lib-parser An exact  was not in scope.This usually indicates a problem with a Template Haskell splice.Test cases: T5971, T18263.ghc-lib-parseralways at least 2 elementsghc-lib-parser"Couldn't find a top-level binding.Happens when specifying an annotation for something that is not in scope.,Test cases: annfail01, annfail02, annfail11.ghc-lib-parserA class doesnt have a method with this name, or, a class doesn't have an associated type with this name, or, a record doesn't have a record field with this name.ghc-lib-parser;Additional information that can be appended to an existing .ghc-lib-parser?Some type variables remained ambiguous: print them to the user.ghc-lib-parser:Specify some information about a type variable, e.g. its  SkolemInfo.ghc-lib-parser?Remind the user that a particular type family is not injective.ghc-lib-parser6Explain why we couldn't coerce between two types. See .ghc-lib-parser&Display the expected and actual types.ghc-lib-parserDisplay the expected and actual types, after expanding type synonyms.ghc-lib-parser'Explain how a kind equality originated.ghc-lib-parser:Add some information to disambiguate errors in which two Names( would otherwise appear to be identical.)See Note [Disambiguating (X ~ X) errors].ghc-lib-parserReport some type variables that might be participating in an occurs-check failure.ghc-lib-parserTrue  => start the message with "Ambiguous type variable ..." False  =? create a message of the form "The type variable is ambiguous."ghc-lib-parserAmbiguous kind and type variables, respectively. Guaranteed to not both be empty.ghc-lib-parserWhether the two "s also came from the same package.ghc-lib-parser(Additional information to be given in a & message, which is then passed on to mk_supplementary_ea_msg.ghc-lib-parserStores the information we have when performing a representation-polymorphism check.ghc-lib-parserWas this check due to  'IsRefl#', i.e. it's a PHASE 1 check?;See Note [The Concrete mechanism] in GHC.Tc.Utils.Concrete.ghc-lib-parser2Context for the representation-polymorphism check.ghc-lib-parserThe type which we are insisting must have a fixed runtime representation.ghc-lib-parserAn error reported after constraint solving. This is usually, some sort of unsolved constraint error, but we try to be specific about the precise problem we encountered.ghc-lib-parser+Wrap a message with additional information.Prefer using the  smart constructorghc-lib-parser4Quantified variables appear out of dependency order.Example:forall (a :: k) k. ...:Test cases: BadTelescope2, T16418, T16247, T16726, T18451.ghc-lib-parserWe came across a custom type error and we have decided to report it.Example:9type family F a where F a = TypeError (Text "error")err :: F () err = ()1Test cases: CustomTypeErrors0{1,2,3,4,5}, T12104.ghc-lib-parserWe want to report an out of scope variable or a typed hole. See .ghc-lib-parser7A type equality between a type variable and a polytype.(Test cases: T12427a, T2846b, T10194, ...ghc-lib-parser"Couldn't unify two types or kinds.Example:93 + 3# -- can't match a lifted type with an unlifted typeTest cases: T1396, T8263, ...ghc-lib-parserA type has an unexpected kind.Test cases: T2994, T7609, ...ghc-lib-parser?A mismatch between two types, which arose from a type equality.Test cases: T1470, tcfail212.ghc-lib-parserA violation of the representation-polymorphism invariants, i.e. an unsolved `Concrete# ty` constraint.See  for more information.ghc-lib-parser)A skolem type variable escapes its scope.Example:7data Ex where { MkEx :: a -> MkEx } foo (MkEx x) = x#Test cases: TypeSkolEscape, T11142.ghc-lib-parserTrying to unify an untouchable variable, e.g. a variable from an outer scope.Test case: Simple14ghc-lib-parserAn equality between two types is blocked on a kind equality beteen their kinds.Test cases: none.ghc-lib-parser9Something was not applied to sufficiently many arguments.Example:instance Eq Maybe where {..}Test case: T11563.ghc-lib-parser,Trying to use an unbound implicit parameter.Example:foo :: Int foo = ?paramTest case: tcfail130.ghc-lib-parserCouldn't solve some Wanted constraints using the Givens. This is the most commonly used constructor, used for generic "No instance for ..." and "Could not deduce ... from" messages.ghc-lib-parserA constraint couldn't be solved because it contains ambiguous type variables.Example:!class C a b where f :: (a,b) x = fst fTest case: T4921.ghc-lib-parserCould not solve a constraint; there were several unifying candidate instances but no matching instances. This is used to report as much useful information as possible about why we couldn't choose any instance, e.g. because of ambiguous type variables.ghc-lib-parserCould not solve a constraint using available instances because the instances overlap.,Test cases: tcfail118, tcfail121, tcfail218.ghc-lib-parserCould not solve a constraint from instances because instances declared in a Safe module cannot overlap instances from other modules (with -XSafeHaskell).%Test cases: SH_Overlap{1,2,5,6,7,11}.ghc-lib-parser6Should this be phrased in terms of expected vs actual?ghc-lib-parser0The constraint in which the mismatch originated.ghc-lib-parser8First type (the expected type if if mismatch_ea is True)ghc-lib-parser4Second type (the actual type if mismatch_ea is True)ghc-lib-parserWhat thing is Ù the kind of?șghc-lib-parserThe overall expected typeəghc-lib-parserThe overall actual typeʙghc-lib-parserWhat thing is ə the kind of?̙ghc-lib-parser)The Wanted constraints we couldn't solve. N.B.: the ڙ at the head of the list has been tidied, perhaps not the others.͙ghc-lib-parser!Some additional info consumed by mk_supplementary_ea_msg.ڙghc-lib-parserA predicate with its arising location; used to encapsulate a constraint that will give rise to a diagnostic.ghc-lib-parser Context needed when reporting a , such as the enclosing implication constraints or whether we are deferring type errors.ghc-lib-parserEnclosing implications (innermost first) ic_skols and givens are tidied, rest are notghc-lib-parserWe make some errors (depending on cec_defer) into warnings, and emit evidence bindings into  for unsolved constraintsghc-lib-parser*Whether to defer type errors until runtimeghc-lib-parser*Reason for reporting holes in expressions.ghc-lib-parser$Reason for reporting holes in types.ghc-lib-parser(Reason for reporting out of scope holes.ghc-lib-parserTrue  = -Wredundant-constraintsghc-lib-parserTrue  = -fprint-expanded-synonymsghc-lib-parserTrue  = More important errors have occurred, so create bindings if need be, but don't issue any more errors/warnings See Note [Suppressing error messages]ghc-lib-parserA , together with context (e.g. enclosing implication constraints) that are needed in order to report it.ghc-lib-parserContext for what we wish to report. This can change as we enter implications, so is stored alongside the content.ghc-lib-parser%The content of the message to report.ghc-lib-parser%Additional information to print in a <, after the important messages and after the error context.See Note [Error report].ghc-lib-parserA collection of main error messages and supplementary information.In practice, we will: - display the important messages first, - then the error context (e.g. by way of a call to ), - then the supplementary information (e.g. relevant bindings, valid hole fits), - then the hints ("Possible fix: ...").So this is mostly just a way of making sure that the error context appears early on rather than at the end of the message.$See Note [Error report] for details.ghc-lib-parser2Is the object we are dealing with exported or not?Used for reporting "missing signature" warnings, see .ghc-lib-parser/What kind of thing is missing a type signature?Used for reporting "missing signature" warnings, see tcRnMissingSignature.ghc-lib-parserwhether -XCUSKs is enabledghc-lib-parserIf , the associated type of a typeclass is not parameterized over the last type variable of the classghc-lib-parser'The associated type family of the classghc-lib-parserIf , the associated type of a typeclass contains the last type variable of the class in a kind, which is not (yet) allowed by GHC.ghc-lib-parser'The associated type family of the classghc-lib-parserA type representing whether or not the input type has associated data family instances.ghc-lib-parser;Whether a sole extra-constraint wildcard is allowed, e.g. _ => .. as opposed to ( .., _ ) => ...ghc-lib-parser6A context in which we don't allow anonymous wildcards.ghc-lib-parser-The type must not have some datatype context.ghc-lib-parserThe data constructor must not have exotic unlifted or polymorphic arguments.ghc-lib-parser3The data constructor must be a vanilla constructor.ghc-lib-parserThe type must have some type parameters. check (d) from Note [Requirements for deriving Generic and Rep] in GHC.Tc.Deriv.Generics.ghc-lib-parser9The data constructor must not have existential arguments.ghc-lib-parserThe derivation applies a type to an argument involving the last parameter but the applied type is not of kind * -> *.ghc-lib-parser The given ) must be truly polymorphic in the last argument of the data type.ghc-lib-parser The given )7 must not use the type variable in a function argument"ghc-lib-parser The given ) must not contain function typesghc-lib-parser The given ) must use the type variable only as the last argument of a data typeghc-lib-parser The given ); is a GADT so we cannot directly derive an istance for it.ghc-lib-parser The given )( has existentials type vars in its type.ghc-lib-parser The given ) has constraints in its type.ghc-lib-parser The given ) has a higher-rank type.ghc-lib-parser8Why a particular typeclass instance couldn't be derived.ghc-lib-parser*The typeclass instance is not well-kinded.ghc-lib-parser=The instance type | We cannot derive instances in boot filesghc-lib-parser&We cannot use GND on non-newtype typesghc-lib-parser-We cannot derive instances of nullary classesghc-lib-parser,Last arg must be newtype or data applicationghc-lib-parser The given  is not a class.ghc-lib-parser"The given (representation of the)  has no data constructors.ghc-lib-parser/GHC simply doesn't how to how derive the input 5 for the given .ghc-lib-parser The given  must be an enumeration. See Note [Enumeration types] in GHC.Core.TyConghc-lib-parser The given  must have  precisely one constructor.ghc-lib-parser.The given data type must have some parameters.ghc-lib-parser2The given data type must not have a class context.ghc-lib-parserWe couldn't derive an instance for a particular data constructor for a variety of reasons.ghc-lib-parserWe couldn't derive a Generic6 instance for the given type for a variety of reasonsghc-lib-parserWe couldn't derive an instance either because the type was not an enum type or because it did have more than one constructor.ʚghc-lib-parserA data type to describe why a variable is not closed. See Note [Not-closed error messages] in GHC.Tc.Gen.ExprԚghc-lib-parserWhy the particular injectivity error arose together with more information, if any.ٚghc-lib-parserIn what context did we require a type to have a fixed runtime representation?Used by  for throwing representation polymorphism errors when validity checking.See Note [Representation polymorphism checking] in GHC.Tc.Utils.Concreteښghc-lib-parserData constructor fields must have a fixed runtime representation.Tests: T11734, T18534.ۚghc-lib-parserPattern synonym signature arguments must have a fixed runtime representation.Test: RepPolyPatSynArg.ܚghc-lib-parserPattern synonym signature scrutinee must have a fixed runtime representation.Test: RepPolyPatSynRes.ݚghc-lib-parser Where a shadowed name comes fromޚghc-lib-parser(The shadowed name is local to the moduleߚghc-lib-parser?The shadowed name is global, typically imported from elsewhere.ghc-lib-parserWhich parts of a record field are affected by a particular error or warning.ghc-lib-parser>Whether the error pertains to a function argument or a result.ghc-lib-parserSpecifies which calling convention is unsupported on the current platformghc-lib-parserSpecifies which backend code generators where expected for an FFI declarationghc-lib-parserC, Asm, or LLVMghc-lib-parserC, Asm, LLVM, or interpretedghc-lib-parser8An error which might arise during typechecking/renaming.ghc-lib-parserSimply wraps a generic h message a. It can be used by plugins to provide custom diagnostic messages originated during typechecking/renaming.ghc-lib-parserTcRnMessageWithInfo is a constructor which is used when extra information is needed to be provided in order to qualify a diagnostic and where it was originated (and why). It carries an extra o which can be used to pretty-print some names and it wraps a , which includes any extra context associated with this diagnostic.ghc-lib-parserTcRnSolverReport is the constructor used to report unsolved constraints after constraint solving, as well as other errors such as hole fit errors.See the documentation of the 8 datatype for an overview of the different errors.ghc-lib-parserTcRnRedundantConstraints is a warning that is emitted when a binding has a user-written type signature which contains superfluous constraints.Example:f :: (Eq a, Ord a) => a -> a -> a f x y = (x < y) || x == y -- `Eq a` is superfluous: the `Ord a` constraint suffices. Bool foo MkFalse = False foo MkTrue = True -- Inaccessible: requires True ~ FalseTest cases: T7293, T7294, T15558, T17646, T18572, T18610, tcfail167.ghc-lib-parserA type which was expected to have a fixed runtime representation does not have a fixed runtime representation.Example:data D (a :: TYPE r) = MkD aTest cases: T11724, T18534, RepPolyPatSynArg, RepPolyPatSynUnliftedNewtype, RepPolyPatSynRes, T20423ghc-lib-parserTcRnImplicitLift is a warning (controlled with -Wimplicit-lift) that occurs when a Template Haskell quote implicitly uses lift.Example: warning1 :: Lift t => t -> Q Exp warning1 x = [| x |]Test cases: th/T17804ghc-lib-parserTcRnUnusedPatternBinds is a warning (controlled with -Wunused-pattern-binds) that occurs if a pattern binding binds no variables at all, unless it is a lone wild-card pattern, or a banged pattern.Example: Just _ = rhs3 -- Warning: unused pattern binding (_, _) = rhs4 -- Warning: unused pattern binding _ = rhs3 -- No warning: lone wild-card pattern !() = rhs4 -- No warning: banged pattern; behaves like seq+Test cases: rename/{T13646,T17c,T17e,T7085}ghc-lib-parserTcRnDodgyImports is a warning (controlled with -Wdodgy-imports) that occurs when a datatype T is imported with all constructors, i.e. 'T(..)', but has been exported abstractly, i.e. T.Test cases: renameshould_compileT7167ghc-lib-parserTcRnDodgyExports is a warning (controlled by -Wdodgy-exports) that occurs when a datatype T is exported with all constructors, i.e. 'T(..)', but is it just a type synonym or a type/data family.Example: module Foo ( T(..) -- Warning: T is a type synonym , A(..) -- Warning: A is a type family , C(..) -- Warning: C is a data family ) wheretype T = Int type family A :: * -> * data family C :: * -> *Test cases: warningsshould_compileDodgyExports01ghc-lib-parserTcRnMissingImportList is a warning (controlled by -Wmissing-import-lists) that occurs when an import declaration does not explicitly list all the names brought into scope.Test cases: renameshould_compileT4489ghc-lib-parserWhen a module marked trustworthy or unsafe (using -XTrustworthy or -XUnsafe) is compiled with a plugin, the TcRnUnsafeDueToPlugin warning (controlled by -Wunsafe) is used as the reason the module was inferred to be unsafe. This warning is not raised if the -fplugin-trustworthy flag is passed.Test cases: plugins/T19926ghc-lib-parserTcRnModMissingRealSrcSpan is an error that occurrs when compiling a module that lacks an associated .Test cases: Noneghc-lib-parserTcRnIdNotExportedFromModuleSig is an error pertaining to backpack that occurs when an identifier required by a signature is not exported by the module or signature that is being used as a substitution for that signature.Example(s): NoneTest cases: backpack should_fail bkpfail36ghc-lib-parserTcRnIdNotExportedFromLocalSig is an error pertaining to backpack that occurs when an identifier which is necessary for implementing a module signature is not exported from that signature.Example(s): NoneTest cases: backpack should_fail#bkpfail30 backpack should_fail#bkpfail31 backpack should_fail bkpfail34ghc-lib-parserTcRnShadowedName is a warning (controlled by -Wname-shadowing) that occurs whenever an inner-scope value has the same name as an outer-scope value, i.e. the inner value shadows the outer one. This can catch typographical errors that turn into hard-to-find bugs. The warning is suppressed for names beginning with an underscore.Examples(s): f = ... let f = id in ... f ... -- NOT OK, f is shadowed f x = do { _ignore <- this; _ignore <- that; return (the other) } -- suppressed via underscoreTest cases: typecheckshould_compileT10971a renameshould_compilern039 renameshould_compilern064 renameshould_compileT1972 rename should_failT2723 renameshould_compile$T3262 driver/werrorghc-lib-parserTcRnDuplicateWarningDecls is an error that occurs whenever a warning is declared twice.Examples(s): None.Test cases: None.ghc-lib-parserTcRnDuplicateWarningDecls is an error that occurs whenever the constraint solver in the simplifier hits the iterations' limit.Examples(s): None.Test cases: None.ghc-lib-parserTcRnIllegalPatSynDecl is an error that occurs whenever there is an illegal pattern synonym declaration. Examples(s):varWithLocalPatSyn x = case x of P -> () where pattern P = () -- not valid, it can't be local, it must be defined at top-level.Test cases: patsyn should_faillocalghc-lib-parserTcRnLinearPatSyn is an error that occurs whenever a pattern synonym signature uses a field that is not unrestricted.Example(s): NoneTest cases: linear should_fail LinearPatSyn2ghc-lib-parserTcRnEmptyRecordUpdate is an error that occurs whenever a record is updated without specifying any field. Examples(s):$(deriveJSON defaultOptions{} ''Bad) -- not ok, no fields selected for update of defaultOptionsTest cases: th/T12788ghc-lib-parserTcRnIllegalFieldPunning is an error that occurs whenever field punning is used without the NamedFieldPuns extension enabled. Examples(s):data Foo = Foo { a :: Int }foo :: Foo -> Int foo Foo{a} = a -- Not ok, punning used without extension.Test cases: parser should_failRecordDotSyntaxFail12ghc-lib-parserTcRnIllegalWildcardsInRecord is an error that occurs whenever wildcards (..) are used in a record without the relevant extension being enabled. Examples(s):data Foo = Foo { a :: Int }foo :: Foo -> Int foo Foo{..} = a -- Not ok, wildcards used without extension.Test cases: parser should_failRecordWildCardsFailghc-lib-parserTcRnIllegalWildcardInType is an error that occurs when a wildcard appears in a type in a location in which wildcards aren't allowed. Examples:Type synonyms: type T = _!Class declarations and instances: class C _ instance C _Standalone kind signatures:type D :: _ data DTest cases: ExtraConstraintsWildcardInTypeSplice2 ExtraConstraintsWildcardInTypeSpliceUsed ExtraConstraintsWildcardNotLast ExtraConstraintsWildcardTwice NestedExtraConstraintsWildcard NestedNamedExtraConstraintsWildcard PartialClassMethodSignature PartialClassMethodSignature2 T12039 T13324_fail1 UnnamedConstraintWildcard1 UnnamedConstraintWildcard2 WildcardInADT1 WildcardInADT2 WildcardInADT3 WildcardInADTContext1 WildcardInDefault WildcardInDefaultSignature WildcardInDeriving WildcardInForeignExport WildcardInForeignImport WildcardInGADT1 WildcardInGADT2 WildcardInInstanceHead WildcardInInstanceSig WildcardInNewtype WildcardInPatSynSig WildcardInStandaloneDeriving WildcardInTypeFamilyInstanceRHS WildcardInTypeSynonymRHS saks_fail003 T15433aghc-lib-parserTcRnDuplicateFieldName is an error that occurs whenever there are duplicate field names in a record.Examples(s): None.Test cases: None.ghc-lib-parserTcRnIllegalViewPattern is an error that occurs whenever the ViewPatterns syntax is used but the ViewPatterns language extension is not enabled..Examples(s): data Foo = Foo { a :: Int }8foo :: Foo -> Int foo (a -> l) = l -- not OK, the  ViewPattern extension is not enabled.Test cases: parser should_failViewPatternsFailghc-lib-parserTcRnCharLiteralOutOfRange is an error that occurs whenever a character is out of range.Examples(s): NoneTest cases: Noneghc-lib-parserTcRnIllegalWildcardsInConstructor is an error that occurs whenever the record wildcards '..'6 are used inside a constructor without labeled fields.Examples(s): NoneTest cases: Noneghc-lib-parserTcRnIgnoringAnnotations is a warning that occurs when the source code contains annotation pragmas but the platform in use does not support an external interpreter such as GHCi and therefore the annotations are ignored.Example(s): NoneTest cases: Noneghc-lib-parserTcRnAnnotationInSafeHaskell is an error that occurs if annotation pragmas are used in conjunction with Safe Haskell.Example(s): NoneTest cases: annotations should_failT10826ghc-lib-parserTcRnInvalidTypeApplication is an error that occurs when a visible type application is used with an expression that does not accept "specified" type arguments.Example(s): foo :: forall {a}. a -> a foo x = x bar :: () bar = let x = foo @Int 42 in ()Test cases: overloadedrecflds should_fail1overloadedlabelsfail03 typecheck should_fail/ExplicitSpecificity1 typecheck should_fail0ExplicitSpecificity10 typecheck should_fail/ExplicitSpecificity2 typecheck should_fail!T17173 typecheck should_failVtaFailghc-lib-parser b -> _ f x y = [x, y]Test cases: partial-sigs should_failT14449ghc-lib-parserTcRnPartialTypeSigBadQuantifier is an error that occurs when a type variable being quantified over in the partial type signature of a function gets unified with a type that is free in that function's context.Example(s): foo :: Num a => a -> a foo xxx = g xxx where g :: forall b. Num b => _ -> b g y = xxx + yTest cases: partial-sig should_failT14479ghc-lib-parserTcRnMissingSignature is a warning that occurs when a top-level binding or a pattern synonym does not have a type signature.Controlled by the flags: -Wmissing-signatures -Wmissing-exported-signatures -Wmissing-pattern-synonym-signatures -Wmissing-exported-pattern-synonym-signatures -Wmissing-kind-signaturesTest cases: T11077 (top-level bindings) T12484 (pattern synonyms) T19564 (kind signatures)ghc-lib-parserTcRnPolymorphicBinderMissingSig is a warning controlled by -Wmissing-local-signatures that occurs when a local polymorphic binding lacks a type signature.Example(s): id a = aTest cases: warningsshould_compileT12574ghc-lib-parserTcRnOverloadedSig is an error that occurs when a binding group conflicts with the monomorphism restriction.Example(s): data T a = T a mono = ... where x :: Applicative f => f a T x = ...Test cases: typecheckshould_compileT11339ghc-lib-parserTcRnTupleConstraintInst is an error that occurs whenever an instance for a tuple constraint is specified.Examples(s): class C m a class D m a f :: (forall a. Eq a => (C m a, D m a)) => m a f = undefined)Test cases: quantified-constraints/T15334ghc-lib-parserTcRnAbstractClassInst is an error that occurs whenever an instance of an abstract class is specified.Examples(s): -- A.hs-boot module A where class C a- B.hs module B where import A instance C Int where- A.hs module A where import B class C a where f :: a:- Main.hs import A main = print (f :: Int)Test cases: typecheck should_failT13068ghc-lib-parserTcRnNoClassInstHead is an error that occurs whenever an instance head is not headed by a class.Examples(s): instance cTest cases: typecheckrename!T5513 typecheckrenameT16385ghc-lib-parserTcRnUserTypeError is an error that occurs due to a user's custom type error, which can be triggered by adding a  TypeError< constraint in a type signature or typeclass instance.Examples(s): f :: TypeError (Text "This is a type error") f = undefinedTest cases: typecheck should_fail.CustomTypeErrors02 typecheck should_failCustomTypeErrors03ghc-lib-parserTcRnConstraintInKind is an error that occurs whenever a constraint is specified in a kind.4Examples(s): data Q :: Eq a => Type where {}Test cases: dependent should_failT13895 polykinds/T16263 saks should_fail(saks_fail004 typecheck should_fail#T16059a typecheck should_failT18714ghc-lib-parserTcRnUnboxedTupleTypeFuncArg is an error that occurs whenever an unboxed tuple or unboxed sum type is specified as a function argument, when the appropriate extension (`-XUnboxedTuples` or `-XUnboxedSums`) isn't enabled.Examples(s): -- T15073.hs import T15073a newtype Foo a = MkFoo a deriving P:- T15073a.hs class P a where p :: a -> ( a )Test cases: deriving should_fail$T15073.hs deriving should_fail&T15073a.hs typecheck should_failT16059dghc-lib-parserTcRnLinearFuncInKind is an error that occurs whenever a linear function is specified in a kind.(Examples(s): data A :: * %1 -> *Test cases: linear should_fail#LinearKind linear should_fail$LinearKind2 linear should_fail LinearKind3ghc-lib-parserTcRnForAllEscapeError is an error that occurs whenever a quantified type's kind mentions quantified type variable.Examples(s): type T :: TYPE (BoxedRep l) data T = MkTTest cases: unlifted-datatypes should_failUnlDataNullaryPolyghc-lib-parserTcRnVDQInTermType is an error that occurs whenever a visible dependent quantification is specified in the type of a term.Examples(s): a = (undefined :: forall k -> k -> Type) @IntTest cases: dependent should_fail"T15859 dependent should_fail(T16326_Fail1 dependent should_fail(T16326_Fail2 dependent should_fail(T16326_Fail3 dependent should_fail(T16326_Fail4 dependent should_fail(T16326_Fail5 dependent should_fail(T16326_Fail6 dependent should_fail(T16326_Fail7 dependent should_fail(T16326_Fail8 dependent should_fail(T16326_Fail9 dependent should_fail)T16326_Fail10 dependent should_fail)T16326_Fail11 dependent should_fail)T16326_Fail12 dependent should_fail"T17687 dependent should_failT18271ghc-lib-parserTcRnBadQuantPredHead is an error that occurs whenever a quantified predicate lacks a class or type variable head.Examples(s): class (forall a. A t a => A t [a]) => B t where type A t a :: Constraint)Test cases: quantified-constraints/T16474ghc-lib-parserTcRnIllegalTupleConstraint is an error that occurs whenever an illegal tuple constraint is specified.Examples(s): g :: ((Show a, Num a), Eq a) => a -> a g = undefinedTest cases: typecheck should_fail tcfail209aghc-lib-parserTcRnNonTypeVarArgInConstraint is an error that occurs whenever a non type-variable argument is specified in a constraint.;Examples(s): data T instance Eq Int => Eq TTest cases: ghciscriptsT13202 ghciscriptsT13202a polykinds/T12055a typecheck should_fail"T10351 typecheck should_fail"T19187 typecheck should_fail!T6022 typecheck should_failT8883ghc-lib-parserTcRnIllegalImplicitParam is an error that occurs whenever an illegal implicit parameter is specified.Examples(s): type Bla = ?x::Int data T = T instance Bla => Eq T8Test cases: polykinds/T11466 typecheck should_fail!T8912 typecheck should_fail%tcfail041 typecheck should_fail%tcfail211 typecheck should_failtcrun045ghc-lib-parserTcRnIllegalConstraintSynonymOfKind is an error that occurs whenever an illegal constraint synonym of kind is specified.Examples(s): type Showish = Show f :: (Showish a) => a -> a f = undefinedTest cases: typecheck should_fail tcfail209ghc-lib-parserTcRnIllegalClassInst is an error that occurs whenever a class instance is specified for a non-class.Examples(s): type C1 a = (Show (a -> Bool)) instance C1 Int whereTest cases: polykinds/T13267ghc-lib-parserTcRnOversaturatedVisibleKindArg is an error that occurs whenever an illegal oversaturated visible kind argument is specified.Examples(s): type family F2 :: forall (a :: Type). Type where F2 @a = Maybe aTest cases: typecheck should_fail"T15793 typecheck should_failT16255ghc-lib-parserTcRnBadAssociatedType is an error that occurs whenever a class doesn't have an associated type.=Examples(s): $(do d <- instanceD (cxt []) (conT ''Eq appT conT ''Foo) [tySynInstD $ tySynEqn Nothing (conT ''Rep appT conT ''Foo) (conT ''Maybe)] return [d]) ======> instance Eq Foo where type Rep Foo = MaybeTest cases: th/T12387aghc-lib-parserTcRnForAllRankErr is an error that occurs whenever an illegal ranked type is specified.Examples(s): foo :: (a,b) -> (a~b => t) -> (a,b) foo p x = pTest cases: - ghci should_runT15806 - indexed-types should_fail SimpleFail15 - typecheck should_failT11355 - typecheck should_failT12083a - typecheck should_failT12083b - typecheck should_failT16059c - typecheck should_failT16059e - typecheck should_failT17213 - typecheck should_failT18939_Fail - typecheck should_failT2538 - typecheck should_failT5957 - typecheck should_failT7019 - typecheck should_failT7019a - typecheck should_failT7809 - typecheck should_failT9196 - typecheck should_failtcfail127 - typecheck should_failtcfail184 - typecheck should_failtcfail196 - typecheck should_fail tcfail197ghc-lib-parserTcRnMonomorphicBindings is a warning (controlled by -Wmonomorphism-restriction) that arise when the monomorphism restriction applies to the given bindings. Examples(s):bar = 10foo :: Int foo = bar&main :: IO () main = print foo)The example above emits the warning (for bar), because without monomorphism restriction the inferred type for bar: is 'bar :: Num p => p'. This warning tells us that if= we were to enable '-XMonomorphismRestriction' we would make bar less polymorphic, as its type would become 'bar :: Int', so GHC warns us about that.Test cases: typecheckshould_compileT13785ghc-lib-parserTcRnOrphanInstance is a warning (controlled by -Wwarn-orphans) that arises when a typeclass instance is an "orphan", i.e. if it appears in a module in which neither the class nor the type being instanced are declared in the same module.Examples(s): NoneTest cases: warningsshould_compile!T9178 typecheckshould_compileT4912ghc-lib-parserTcRnFunDepConflict is an error that occurs when there are functional dependencies conflicts between instance declarations.Examples(s): NoneTest cases: typecheck should_fail!T2307 typecheck should_fail%tcfail096 typecheck should_fail tcfail202ghc-lib-parserTcRnDupInstanceDecls is an error that occurs when there are duplicate instance declarations.Examples(s): class Foo a where foo :: a -> Int)instance Foo Int where foo = id/instance Foo Int where foo = const 42Test cases: cabalT12733"T12733 typecheck should_fail%tcfail035 typecheck should_fail$tcfail023 backpack should_fail%bkpfail18 typecheck should_fail+TcNullaryTCFail typecheck should_fail%tcfail036 typecheck should_failtcfail073 module/mod51 module/mod52 module/mod44ghc-lib-parserTcRnConflictingFamInstDecls is an error that occurs when there are conflicting family instance declarations.Examples(s): None.Test cases: indexed-types should_fail4ExplicitForAllFams4b indexed-types should_fail&NoGood indexed-types should_fail$Over indexed-types should_fail1OverDirectThisMod indexed-types should_fail3OverIndirectThisMod indexed-types should_fail-SimpleFail11a indexed-types should_fail-SimpleFail11b indexed-types should_fail-SimpleFail11c indexed-types should_fail-SimpleFail11d indexed-types should_fail,SimpleFail2a indexed-types should_fail,SimpleFail2b indexed-types should_fail-T13092/T13092 indexed-types should_fail/T13092c/T13092c indexed-types should_fail&T14179 indexed-types should_fail&T2334A indexed-types should_fail%T2677 indexed-types should_fail&T3330b indexed-types should_fail%T4246 indexed-types should_fail&T7102a indexed-types should_failT9371 polykinds/T7524 typecheck should_failUnliftedNewtypesOverlapghc-lib-parserTcRnBangOnUnliftedType is a warning (controlled by -Wredundant-strictness-flags) that occurs when a strictness annotation is applied to an unlifted type.Example(s): data T = MkT !Int# -- Strictness flag has no effect on unlifted typesTest cases: typecheckshould_compile"T20187a typecheckshould_compileT20187bghc-lib-parserTcRnMultipleDefaultDeclarations is an error that occurs when a module has more than one default declaration.Example: default (Integer, Int) default (Double, Float) -- 2nd default declaration not allowedText cases: module/mod58ghc-lib-parserTcRnBadDefaultType is an error that occurs when a type used in a default declaration does not have an instance for any of the applicable classes..Example(s): data Foo default (Foo)Test cases: typecheck should_failT11974bghc-lib-parserTcRnPatSynBundledWithNonDataCon is an error that occurs when a module's export list bundles a pattern synonym with a type that is not a proper `data` or  `newtype` construction.Example(s): module Foo (MyClass(.., P)) where pattern P = Nothing class MyClass a where foo :: a -> IntTest cases: patsyn should_fail export-classghc-lib-parserTcRnPatSynBundledWithWrongType is an error that occurs when the export list of a module has a pattern synonym bundled with a type that does not match the type of the pattern synonym.Example(s): module Foo (R(P,x)) where data Q = Q Int data R = R pattern P{x} = Q xText cases: patsyn should_fail)export-ps-rec-sel patsyn should_fail+export-type-synonym patsyn should_fail export-typeghc-lib-parser0TcRnDupeModuleExport is a warning controlled by -Wduplicate-exports that occurs when a module appears more than once in an export list.Example(s): module Foo (module Bar, module Bar) import BarText cases: Noneghc-lib-parserTcRnExportedModNotImported is an error that occurs when an export list contains a module that is not imported.Example(s): NoneText cases: module/mod135 module/mod8 rename should_fail#rnfail028 backpack should_fail bkpfail48ghc-lib-parserTcRnNullExportedModule is a warning controlled by -Wdodgy-exports that occurs when an export list contains a module that has no exports.Example(s): module Foo (module Bar) where import Bar ()Test cases: Noneghc-lib-parserTcRnMissingExportList is a warning controlled by -Wmissing-export-lists that occurs when a module does not have an explicit export list.Example(s): NoneTest cases: typecheck should_failMissingExportList03ghc-lib-parserTcRnExportHiddenComponents is an error that occurs when an export contains constructor or class methods that are not visible.Example(s): NoneTest cases: Noneghc-lib-parserTcRnDuplicateExport is a warning (controlled by -Wduplicate-exports) that occurs when an identifier appears in an export list more than once.Example(s): NoneTest cases: module/MultiExport module/mod128 module/mod14 module/mod5 overloadedrecflds should_fail(DuplicateExports patsynshould_compileT11959ghc-lib-parserTcRnExportedParentChildMismatch is an error that occurs when an export is bundled with a parent that it does not belong toExample(s): module Foo (T(a)) where data T a = TrueTest cases: module/T11970 module/T11970B module/mod17 module/mod3 overloadedrecflds should_failNoParentghc-lib-parserTcRnConflictingExports is an error that occurs when different identifiers that have the same name are being exported by a module.Example(s): module Foo (Bar.f, module Baz) where import qualified Bar (f) import Baz (f)Test cases: module/mod131 module/mod142 module/mod143 module/mod144 module/mod145 module/mod146 module/mod150 module/mod155 overloadedrecflds should_fail)T14953 overloadedrecflds should_fail/overloadedrecfldsfail10 rename should_fail!rnfail029 rename should_fail$rnfail040 typecheck should_fail#T16453E2 typecheck should_fail$tcfail025 typecheck should_fail tcfail026ghc-lib-parserTcRnAmbiguousField is a warning controlled by -Wambiguous-fields occurring when a record update's type cannot be precisely determined. This will not be supported by -XDuplicateRecordFields in future releases.Example(s): data Person = MkPerson { personId :: Int, name :: String } data Address = MkAddress { personId :: Int, address :: String } bad1 x = x { personId = 4 } :: Person -- ambiguous bad2 (x :: Person) = x { personId = 4 } -- ambiguous good x = (x :: Person) { personId = 4 } -- not ambiguousTest cases: overloadedrecflds should_failoverloadedrecfldsfail06ghc-lib-parserTcRnMissingFields is a warning controlled by -Wmissing-fields occurring when the intialisation of a record is missing one or more (lazy) fields.Example(s): data Rec = Rec { a :: Int, b :: String, c :: Bool } x = Rec { a = 1, b = "two" } -- missing field cTest cases: deSugarshould_compileT13870 deSugarshould_compileds041 patsynshould_compileT11283 renameshould_compileT5334 renameshould_compileT12229 renameshould_compile T5892a warnings should_fail WerrorFail2ghc-lib-parserTcRnFieldUpdateInvalidType is an error occurring when an updated field's type mentions something that is outside the universally quantified variables of the data constructor, such as an existentially quantified type.Example(s): data X = forall a. MkX { f :: a } x = (MkX ()) { f = False }Test cases: patsyn should_fail+records-exquant typecheck should_failT3323›ghc-lib-parserTcRnNoConstructorHasAllFields is an error that occurs when a record update has fields that no single constructor encompasses.Example(s): data Foo = A { x :: Bool } | B { y :: Int } foo = (A False) { x = True, y = 5 }Test cases: overloadedrecflds should_fail/overloadedrecfldsfail08 patsyn should_fail4mixed-pat-syn-record-sels typecheck should_failT7989țghc-lib-parserTcRnSpecialClassInst is an error that occurs when a user attempts to define an instance for a built-in typeclass such as  Coercible, , or KnownNat, outside of a signature file.Test cases: deriving should_failT9687 deriving should_failT14916 polykinds/T8132 typecheck should_fail+TcCoercibleFail2 typecheck should_fail!T12837 typecheck should_failT14390ɛghc-lib-parserTcRnUselessTypeable is a warning (controlled by -Wderiving-typeable) that occurs when trying to derive an instance of the  class. Deriving  is no longer necessary (hence the "useless") as all types automatically derive  in modern GHC versions.Example(s): None.Test cases: warningsshould_compileDerivingTypeableʛghc-lib-parserTcRnDerivingDefaults is a warning (controlled by -Wderiving-defaults) that occurs when both DeriveAnyClass and GeneralizedNewtypeDeriving2 are enabled, and therefore GHC defaults to DeriveAnyClass/, which might not be what the user wants.Example(s): None.Test cases: typecheckshould_compile!T15839a derivingshould_compileT16179˛ghc-lib-parserTcRnNonUnaryTypeclassConstraint is an error that occurs when GHC encounters a non-unary constraint when trying to derive a typeclass.Example(s): class A deriving instance A data B deriving A -- We cannot derive A, is not unary (i.e. 'class A a').Test cases: deriving should_failT7959 deriving should_fail$drvfail005 deriving should_fail$drvfail009 deriving should_fail drvfail006̛ghc-lib-parserTcRnPartialTypeSignatures is a warning (controlled by -Wpartial-type-signatures) that occurs when a wildcard '_' is found in place of a type in a signature or a type class derivation5Example(s): foo :: _ -> Int foo = ...!deriving instance _ => Eq (Foo a)Test cases: dependentshould_compile!T11241 dependentshould_compile!T15076 dependentshould_compile#T14880-2 typecheckshould_compile!T17024 typecheckshould_compile$T10072 partial-sigs should_fail(TidyClash2 partial-sigs should_fail.Defaulting1MROff partial-sigs should_fail:WildcardsInPatternAndExprSig partial-sigs should_fail$T10615 partial-sigs should_fail%T14584a partial-sigs should_fail'TidyClash partial-sigs should_fail$T11122 partial-sigs should_fail$T14584 partial-sigs should_fail$T10045 partial-sigs should_fail;PartialTypeSignaturesDisabled partial-sigs should_fail$T10999 partial-sigs should_failExtraConstraintsWildcardInExpressionSignature partial-sigs should_failExtraConstraintsWildcardInPatternSplice partial-sigs should_fail4WildcardInstantiations partial-sigs should_run$T15415 partial-sigsshould_compile$T10463 partial-sigsshould_compile%T15039a partial-sigsshould_compile%T16728b partial-sigsshould_compile%T15039c partial-sigsshould_compile$T10438 partial-sigsshould_compile)SplicesUsed partial-sigsshould_compile$T18008 partial-sigsshould_compile*ExprSigLocal partial-sigsshould_compile%T11339a partial-sigsshould_compile$T11670 partial-sigsshould_compile;WarningWildcardInstantiations partial-sigsshould_compile$T16728 partial-sigsshould_compile$T12033 partial-sigsshould_compile%T15039b partial-sigsshould_compile$T10403 partial-sigsshould_compile$T11192 partial-sigsshould_compile%T16728a partial-sigsshould_compile)TypedSplice partial-sigsshould_compile%T15039d partial-sigsshould_compile$T11016 partial-sigsshould_compile'T13324_compile2 linear should_failLinearPartialSig polykinds/T14265 polykinds/T14172͛ghc-lib-parserTcRnCannotDeriveInstance is an error that occurs every time a typeclass instance can't be derived. The 9 will contain the specific reason this error arose.Example(s): None.Test cases: genericsT10604.T10604_no_PolyKinds deriving should_fail%drvfail009 deriving should_fail+drvfail-functor2 deriving should_fail'T10598_fail3 deriving should_fail-deriving-via-fail2 deriving should_fail,deriving-via-fail deriving should_failT16181Λghc-lib-parserTcRnLazyGADTPattern is an error that occurs when a user writes a nested GADT pattern match inside a lazy (~) pattern.Test case: gadt/lazypatϛghc-lib-parserTcRnArrowProcGADTPattern is an error that occurs when a user writes a GADT pattern inside arrow proc notation.Test case: arrows should_fail arrowfail004.Лghc-lib-parserTcRnForallIdentifier is a warning (controlled with -Wforall-identifier) that occurs when a definition uses forall as an identifier.2Example: forall x = () g forall = ()2Test cases: T20609 T20609a T20609b T20609c T20609dћghc-lib-parserTcRnTypeEqualityOutOfScope is a warning (controlled by -Wtype-equality-out-of-scope) that occurs when the type equality (a ~ b) is not in scope.Test case: T18862bқghc-lib-parserTcRnTypeEqualityRequiresOperators is a warning (controlled by -Wtype-equality-requires-operators) that occurs when the type equality (a ~ b) is used without the TypeOperators extension.Example:f :: (a ~ b) => a -> bTest case: T18862aӛghc-lib-parserTcRnIllegalTypeOperator is an error that occurs when a type operator is used without the TypeOperators extension.Example:(f :: Vec a n -> Vec a m -> Vec a (n + m)Test case: T12811ԛghc-lib-parserTcRnGADTMonoLocalBinds is a warning controlled by -Wgadt-mono-local-binds that occurs when pattern matching on a GADT when -XMonoLocalBinds is off.Example(s): NoneTest cases: T20485, T20485a՛ghc-lib-parserThe TcRnNotInScope constructor is used for various not-in-scope errors. See  for more details. ֛ghc-lib-parserTcRnUntickedPromotedConstructor is a warning (controlled with -Wunticked-promoted-constructors) that is triggered by an unticked occurrence of a promoted data constructor.Example:data A = MkA type family F (a :: A) where { F MkA = Bool }Test case: T9778.כghc-lib-parserTcRnIllegalBuiltinSyntax is an error that occurs when built-in syntax appears in an unexpected location, e.g. as a data constructor or in a fixity declaration. Examples: infixl 5 : data P = (,)/Test cases: rnfail042, T14907b, T15124, T15233.؛ghc-lib-parserTcRnWarnDefaulting is a warning (controlled by -Wtype-defaults) that is triggered whenever a Wanted typeclass constraint is solving through the defaulting of a type variable.Example:one = show 1 -- We get Wanteds Show a0, Num a0, and default a0 to Integer.Test cases: none (which are really specific to defaulting), but see e.g. tcfail204.ٛghc-lib-parser6TcRnIncorrectNameSpace is an error that occurs when a  is used in the incorrect  NameSpace, e.g. a type constructor or class used in a term, or a term variable used in a type.Example: f x = IntTest cases: T18740a, T20884.ghc-lib-parser* is an "internal" type (used only inside  that wraps a  while also providing any extra info needed to correctly pretty-print this diagnostic later on.ghc-lib-parser&Extra context associated to the error.ghc-lib-parser1Extra supplementary info associated to the error.ghc-lib-parser Create a "not in scope" error message for the given 0.ghc-lib-parser#Append additional information to a .ghc-lib-parserDisplay some relevant bindings.ghc-lib-parseralways a class constraintghc-lib-parser/ambiguous kind and type variables, respectivelyghc-lib-parserThe type constructor that occurs in the typeclass instance declaration.ghc-lib-parserThe typeclass kind.ghc-lib-parserThe number of typeclass arguments that GHC kept. See Note [tc_args and tycon arity] in GHC.Tc.Deriv. | Generic instances can only be derived using the stock strategy in Safe Haskell.ghc-lib-parser5Type constructor for which the instance is requestedghc-lib-parserWhether or not -XDeriveAnyClass is enabled already. | Stock deriving won't work, but perhas DeriveAnyClass will.ghc-lib-parserThe o will allow us to pretty-print some diagnostics with more detail.ghc-lib-parser+The implication containing a contradiction.ghc-lib-parserThe contradiction(s).ghc-lib-parser The limit.ghc-lib-parserthe wildcard name, or H for an anonymous wildcardghc-lib-parserfirst type variableghc-lib-parsersecond type variableghc-lib-parser function nameghc-lib-parser3user-written name of type variable being quantifiedghc-lib-parser function nameghc-lib-parser(type the variable unified with, if knownghc-lib-parserpartial type signatureghc-lib-parserTrue: -Wmissing-signatures overrides -Wmissing-exported-signatures, or -Wmissing-pattern-synonym-signatures overrides -Wmissing-exported-pattern-synonym-signaturesghc-lib-parser2whether this is an unboxed tuple or an unboxed sumghc-lib-parser&Occurrence name shared by both exportsghc-lib-parserName of first exportghc-lib-parser.Provenance for definition site of first exportghc-lib-parserExport decl of first exportghc-lib-parserName of second exportghc-lib-parser/Provenance for definition site of second exportghc-lib-parserExport decl of second exportghc-lib-parser Field updateghc-lib-parser Record typeÛghc-lib-parserRecordghc-lib-parserRecord selectorsghc-lib-parserPattern synonymghc-lib-parserPattern selectorsțghc-lib-parser6Whether the error is due to Safe Haskell being enabled͛ghc-lib-parser6The typeclass we are trying to derive an instance forghc-lib-parser The typeclass arguments, if any.ghc-lib-parser The derivation strategy, if any.ghc-lib-parser*Is '-XGeneralizedNewtypeDeriving' enabled?ghc-lib-parserThe specific reason why we couldn't derive an instance for the class.՛ghc-lib-parserwhat the problem isghc-lib-parserthe name that is not in scopeghc-lib-parserimport errors that are relevantghc-lib-parserhints, e.g. enable DataKinds to refer to a promoted data constructorכghc-lib-parser?what kind of thing this is (a binding, fixity declaration, ...)؛ghc-lib-parser/Wanted constraints in which defaulting occurredghc-lib-parser!The type variable being defaultedghc-lib-parserThe default typeٛghc-lib-parserwhether the error is happening in a Template Haskell tick (so we should give a Template Haskell hint)ghc-lib-parser&Extra info associated with the messageИјҘӘԘ՘֘טؘ٘ژۘܘݘޘߘ™ÙęřƙǙșəʙ˙̙͙ΙϙЙљҙәԙՙ֙יؙٙڙۙܙݙޙߙšÚĚŚƚǚȚɚʚ˚͚̚ΚϚКњҚӚԚ՚֚ךؚٚښۚܚݚޚߚЛٛ›ÛěśƛǛțɛʛ˛̛͛Λϛћқӛԛ՛֛כ؛ڛۛܛݛޛߛЛٛ›ÛěśƛǛțɛʛ˛̛͛Λϛћқӛԛ՛֛כ؛ڛۛܛݛޛߛٚښۚܚݚޚߚԚ՚֚ךؚњҚӚΚϚКʚ˚͚̚ǚȚɚĚŚƚšÚИјҘӘԘ՘֘טؘ٘ژۘܘݘޘߘڙۙܙݙޙߙ™ÙęřƙǙșəʙ˙̙͙ΙϙЙљҙәԙՙ֙יؙٙNone #$%?j None[ghc-lib-parser"`where'3 clause at the same depth as implicit layout block"ghc-lib-parser"`|'- at the same depth as implicit layout block")ghc-lib-parserErrors from the Cmm parserghc-lib-parserUnknown Cmm primitiveghc-lib-parser Unknown macroghc-lib-parserUnknown calling conventionghc-lib-parserUnrecognised safetyghc-lib-parserUnrecognised hintghc-lib-parser Lexical errorghc-lib-parserUnknown pragmaghc-lib-parserLexical error in pragmaghc-lib-parser$Numeric escape sequence out of rangeghc-lib-parser)Lexical error in string/character literalghc-lib-parser2Unexpected end-of-file in string/character literalghc-lib-parserUnterminated `{-'ghc-lib-parserUnterminated OPTIONS pragmaghc-lib-parserUnterminated quasiquotationghc-lib-parser End of inputghc-lib-parserUTF-8 decoding errorghc-lib-parserError at given characterghc-lib-parserNegative application pattern?ghc-lib-parser*The list of type arguments for the patternghc-lib-parserExtra information for the expression GHC is currently inspecting/parsing. It can be used to generate more informative parser diagnostics and hints.ghc-lib-parserIf I9, this is an infix pattern with the binded operator nameghc-lib-parser9Did the parser likely fail due to an incomplete do block?ghc-lib-parser Is the parsed pattern recursive?ghc-lib-parserExtra details about a parse error, which helps us in determining which should be the hints to suggest.Ĝghc-lib-parser Is there a 'do' in the last 100 characters?Ŝghc-lib-parser Is there an mdo in the last 100 characters?Ɯghc-lib-parserIs PatternSynonyms enabled?ǜghc-lib-parser!Did we parse a "pattern" keyword?ɜghc-lib-parserAn "unknown" message from the parser. This type constructor allows arbitrary messages to be embedded. The typical use case would be GHC plugins willing to emit custom diagnostics.ʜghc-lib-parser&A group of parser messages emitted in 5. See Note [Messages from GHC.Parser.Header].˜ghc-lib-parserPsWarnBidirectionalFormatChars is a warning (controlled by the -Wwarn-bidirectional-format-characters flag) that occurs when unicode bi-directional format characters are found within in a fileThe  contains the exact position in the buffer the character occured, and the string contains a description of the character.̜ghc-lib-parser4Number of other occurrences other than the first one͜ghc-lib-parserPsWarnTransitionalLayout is a warning (controlled by the -Walternative-layout-rule-transitional flag) that occurs when pipes ('|' ) or 'where'3 are at the same depth of an implicit layout block. Example(s):f :: IO () f | True = do let x = () y = () return () | True = return ()Test case(s): layout/layout006 layout/layout003 layout/layout001Μghc-lib-parserUnrecognised pragmaϜghc-lib-parser Invalid Haddock comment positionМghc-lib-parser,Multiple Haddock comment for the same entityќghc-lib-parser;Found binding occurrence of "*" while StarIsType is enabledҜghc-lib-parserUsing "*" for Type without StarIsType enabledӜghc-lib-parserPre qualified import with WarnPrepositiveQualifiedModule enabled֜ghc-lib-parser4LambdaCase syntax used without the extension enabledלghc-lib-parser(A lambda requires at least one parameter؜ghc-lib-parser5Underscores in literals without the extension enabledٜghc-lib-parser%Invalid character in primitive stringڜghc-lib-parser Missing blockۜghc-lib-parser Lexer errorܜghc-lib-parserSuffix occurrence of `@`ݜghc-lib-parser Parse errorsޜghc-lib-parserCmm lexer errorߜghc-lib-parser#Unsupported boxed sum in expressionghc-lib-parser Unsupported boxed sum in patternghc-lib-parser Unexpected qualified constructorghc-lib-parser Tuple section in pattern contextghc-lib-parser*Bang-pattern without BangPattterns enabledghc-lib-parser%Operator applied to too few argumentsghc-lib-parser Import: multiple occurrences of  qualifiedghc-lib-parserPost qualified import without ImportQualifiedPostghc-lib-parser#Explicit namespace keyword without ExplicitNamespacesghc-lib-parser1Expecting a type constructor but found a variableghc-lib-parser.Illegal export form allowed by PatternSynonymsghc-lib-parserMalformed entity stringghc-lib-parserDots used in record updateghc-lib-parserPrecedence out of rangeghc-lib-parser!Invalid use of record dot syntax ghc-lib-parserOverloadedRecordUpdate is not enabled.ghc-lib-parserCan't use qualified fields when OverloadedRecordUpdate is enabled.ghc-lib-parser;Cannot parse data constructor in a data/newtype declarationghc-lib-parser;Cannot parse data constructor in a data/newtype declarationghc-lib-parser$UNPACK applied to a data constructorghc-lib-parser7Unexpected kind application in data/newtype declarationghc-lib-parserNot a record constructorghc-lib-parser)Illegal unboxed string literal in patternghc-lib-parser3Illegal primitive floating point literal in patternghc-lib-parserDo-notation in patternghc-lib-parserIf-then-else syntax in patternghc-lib-parserLambda-case in patternghc-lib-parsercase..of in patternghc-lib-parserlet-syntax in patternghc-lib-parserLambda-syntax in patternghc-lib-parser"Arrow expression-syntax in patternghc-lib-parserArrow command-syntax in patternghc-lib-parser"Arrow command-syntax in expressionghc-lib-parserView-pattern in expressionghc-lib-parser&Type-application without space before '@'ghc-lib-parserLazy-pattern ('~') without space after itghc-lib-parserBang-pattern (!) without space after itghc-lib-parser#Pragma not allowed in this positionghc-lib-parserQualified do block in commandghc-lib-parser.Invalid infix hole, expected an infix operatorghc-lib-parser0Unexpected semi-colons in conditional expressionghc-lib-parser-Unexpected semi-colons in conditional commandghc-lib-parser @-operator in a pattern positionghc-lib-parser1Unexpected lambda command in function applicationghc-lib-parser/Unexpected case command in function applicationghc-lib-parser-Unexpected if command in function applicationghc-lib-parser.Unexpected let command in function applicationghc-lib-parser-Unexpected do command in function applicationghc-lib-parser+Unexpected do block in function applicationghc-lib-parser,Unexpected mdo block in function applicationghc-lib-parser4Unexpected lambda expression in function applicationghc-lib-parser2Unexpected case expression in function applicationghc-lib-parser9Unexpected lambda-case expression in function applicationghc-lib-parser1Unexpected let expression in function applicationghc-lib-parser0Unexpected if expression in function applicationghc-lib-parser2Unexpected proc expression in function applicationghc-lib-parser+Malformed head of type or class declarationghc-lib-parserIllegal 'where' keyword in data declarationghc-lib-parserIllegal datatype contextghc-lib-parserParse error on inputghc-lib-parser!Malformed ... declaration for ...ghc-lib-parser,Unexpected type application in a declarationghc-lib-parserNot a data constructorghc-lib-parser1Record syntax used in pattern synonym declarationghc-lib-parserEmpty 'where'& clause in pattern-synonym declarationghc-lib-parserInvalid binding name in 'where'& clause of pattern-synonym declarationghc-lib-parserMultiple bindings in 'where'& clause of pattern-synonym declarationghc-lib-parser"Declaration splice not a top-levelghc-lib-parser(Inferred type variables not allowed hereghc-lib-parser,Multiple names in standalone kind signaturesghc-lib-parserIllegal import bundle formghc-lib-parserIllegal role nameghc-lib-parserInvalid type signatureghc-lib-parserUnexpected type in declarationghc-lib-parserExpected a hyphenghc-lib-parserFound a space in a SCCghc-lib-parser Is TH on?ghc-lib-parserInvalid package nameghc-lib-parserInvalid rule activation markerghc-lib-parser1Linear function found but LinearTypes not enabledghc-lib-parser8Multi-way if-expression found but MultiWayIf not enabledghc-lib-parseris Unicode forall?ghc-lib-parser.Found qualified-do without QualifiedDo enabledghc-lib-parserCmm parser errorghc-lib-parser!Illegal traditional record syntax+TODO: distinguish errors without using SDocghc-lib-parserParse error in command+TODO: distinguish errors without using SDocghc-lib-parserParse error in patternghc-lib-parserParse error in right operator section pattern TODO: embed the proper operator, if possibleghc-lib-parserIllegal linear arrow or multiplicity annotation in GADT record syntaxghc-lib-parserPsErrUnsupportedOptionsPragma is an error that occurs when an unknown OPTIONS_GHC pragma is supplied is found. Example(s): Test case(s):tests safeHaskellflags/SafeFlags28 tests safeHaskellflags/SafeFlags19 tests safeHaskellflags/SafeFlags29 testsparser!should_fail/T19923c testsparser!should_fail/T19923b testsparser%should_fail/readFail044 testsdriverT2499ghc-lib-parser Builds a & with the information provided by the .ghc-lib-parserThe pattern argumentsghc-lib-parser Is the parsed pattern recursive?ghc-lib-parserconditional exprghc-lib-parser"then" semi-colon?ghc-lib-parser "then" exprghc-lib-parser"else" semi-colon?ghc-lib-parser "else" exprghc-lib-parserconditional exprghc-lib-parser"then" semi-colon?ghc-lib-parser "then" exprghc-lib-parser"else" semi-colon?ghc-lib-parser "else" exprœǜƜŜĜÜȜߜޜݜܜۜڜٜ؜ל֜ԜМϜΜ͜˜ɜќӜҜ՜̜ʜȜߜޜݜܜۜڜٜ؜ל֜ԜМϜΜ͜˜ɜќӜҜ՜̜ʜœǜƜŜĜܝNone #$'(?˝̝͝ΝϝНѝ˝̝͝ΝϝНѝNone&ӝghc-lib-parserAn mtl-style class for monads that support parsing-related operations. For example, sometimes we make a second pass over the parsing results to validate, disambiguate, or rearrange them, and we do so in the PV monad which cannot consume input but can report parsing errors, check for extension bits, and accumulate parsing annotations. Both P and PV are instances of MonadP.MonadP grants us convenient overloading. The other option is to have separate operations for each monad: addErrorP vs addErrorPV, getBitP vs getBitPV, and so on.ԝghc-lib-parserAdd a non-fatal error. Use this when the parser can produce a result despite the error.#For example, when GHC encounters a forall in a type, but -XExplicitForAll$ is disabled, the parser constructs ForAllTy as if -XExplicitForAll= was enabled, adding a non-fatal error to the accumulator.Control flow wise, non-fatal errors act like warnings: they are added to the accumulator and parsing continues. This allows GHC to report more than one parse error per file.՝ghc-lib-parser)Add a warning to the accumulator. Use ! to get the accumulated warnings.֝ghc-lib-parserAdd a fatal error. This will be the last error reported by the parser, and the parser will not produce any result, ending in a ڟ state.םghc-lib-parser5Check if a given flag is currently set in the bitmap.؝ghc-lib-parserGo through the  comment_q in PState; and remove all comments that belong within the given spanٝghc-lib-parserGo through the  comment_q in PState and remove all comments that come before or within the given spanڝghc-lib-parserGo through the  comment_q in PState8 and remove all comments that come after the given span۝ghc-lib-parserVarious boolean flags, mostly language extensions, that impact lexing and parsing. Note that a handful of these can change during lexing/parsing.ghc-lib-parserIf this is enabled, '{- LINE ... - }' and '{- COLUMN ... -}' update the internal position. Otherwise, those pragmas are lexed as tokens of their own.ghc-lib-parser!The parsing monad, isomorphic to StateT PState Maybe.ghc-lib-parserHaddock comment as produced by the lexer. These are accumulated in  and then processed in GHC.Parser.PostProcess.Haddock. The location of the s spans over the contents of the docstring - i.e. it does not include the decorator ("-- |", "{-|" etc.)ghc-lib-parserParser options.See  to construct this.ghc-lib-parserbitmap of permitted extensionsghc-lib-parser)Options to construct diagnostic messages.ghc-lib-parsersupported extensions (only used for suggestions in error messages)ghc-lib-parserThe result of running a parser.Οghc-lib-parser (|ϟghc-lib-parser |)Пghc-lib-parser -<џghc-lib-parser >-ҟghc-lib-parser -<<ӟghc-lib-parser >>-ԟghc-lib-parser*Used when the lexer can't make sense of it՟ghc-lib-parserend of file token֟ghc-lib-parserThe HsDocString contains more details about what this is and how to pretty print itןghc-lib-parser(doc options (prune, ignore-exports, etc)؟ghc-lib-parsercomment starting by "--"ٟghc-lib-parsercomment in {- -}ڟghc-lib-parserThe parser has consumed a (possibly empty) prefix of the input and failed.The carried parsing state can be used to resume parsing. It is the state right before failure, including the fatal parse error.  and ' must return a non-empty bag of errors.۟ghc-lib-parserThe parser has consumed a (possibly empty) prefix of the input and produced a result. Use 9 to check for accumulated warnings and non-fatal errors.8The carried parsing state can be used to resume parsing.ܟghc-lib-parserTest whether a  is setghc-lib-parser1Given exactly the information needed, set up the ghc-lib-parser.Set parser options for parsing OPTIONS pragmasghc-lib-parserCreates a parse state from a  valueghc-lib-parserGet a bag of the errors that have been accumulated so far. Does not take -Werror into account.ghc-lib-parserGet the warnings and errors accumulated so far. Does not take -Werror into account.ghc-lib-parserGiven a  that surrounds a HsPar or HsParTy , generate 2 values for the opening and closing bordering on the start and end of the spanghc-lib-parser%permitted language extensions enabledghc-lib-parserdiagnostic optionsghc-lib-parser"Supported Languages and Extensionsghc-lib-parserare safe imports on?ghc-lib-parserkeeping Haddock comment tokensghc-lib-parserkeep regular comment tokensghc-lib-parserIf this is enabled, '{- LINE ... - }' and '{- COLUMN ... -}' update the internal position kept by the parser. Otherwise, those pragmas are lexed as  and  tokens.ӝ֝םԝ՝؝ٝڝ۝ߝܝݝޝ۟ڟžÞĞŞƞǞȞɞʞ˞̞͞ΞϞОўҞӞԞ՞֞מ؞ٞڞ۞ܞݞޞߞŸßğşƟǟȟɟʟ˟̟͟ΟϟПџҟӟԟ՟֟ן؟ٟܟݟޟߟžÞĞŞƞǞȞɞʞ˞̞͞ΞϞОўҞӞԞ՞֞מ؞ٞڞ۞ܞݞޞߞŸßğşƟǟȟɟʟ˟̟͟ΟϟПџҟӟԟ՟֟ן؟ٟ۟ڟ۟ڟӝ֝םԝ՝؝ٝڝߟݟޟ۝ߝܝݝޝܟNone&'(-/>?ͽ8ghc-lib-parserDisambiguate constructs that may appear when we do not know ahead of time whether we are parsing a type or a newtype/data constructor.?See Note [Ambiguous syntactic categories] for the general idea.See Note [Parsing data constructors is hard] for the specific issue this particular class is solving.ghc-lib-parserProcess the head of a type-level function/constructor application, i.e. the H in H a b c.ghc-lib-parser Disambiguate f x3 (function application or prefix data constructor).ghc-lib-parser Disambiguate f @t (visible kind application)ghc-lib-parser Disambiguate f # x (infix operator)ghc-lib-parser Disambiguate {-# UNPACK #-} t (unpack/nounpack pragma)ghc-lib-parserDisambiguate constructs that may appear when we do not know ahead of time whether we are parsing an expression, a command, or a pattern. See Note [Ambiguous syntactic categories]ghc-lib-parserSee Note [Body in DisambECP]ghc-lib-parserInfix operator representationghc-lib-parser Function argument representationghc-lib-parserReturn a command without ambiguity, or fail in a non-command context.ghc-lib-parserReturn an expression without ambiguity, or fail in a non-expression context.ghc-lib-parser"Disambiguate "... -> ..." (lambda)ghc-lib-parserDisambiguate "let ... in ..."ghc-lib-parserBring superclass constraints on InfixOp into scope. See Note [UndecidableSuperClasses for associated types]ghc-lib-parser%Disambiguate "f # x" (infix operator)ghc-lib-parserDisambiguate "case ... of ..."ghc-lib-parserBring superclass constraints on FunArg into scope. See Note [UndecidableSuperClasses for associated types]ghc-lib-parser)Disambiguate "f x" (function application)ghc-lib-parser.Disambiguate "f @t" (visible type application)ghc-lib-parser'Disambiguate "if ... then ... else ..."ghc-lib-parser'Disambiguate "do { ... }" (do notation)ghc-lib-parser$Disambiguate "( ... )" (parentheses)ghc-lib-parser2Disambiguate a variable "f" or a data constructor MkF.ghc-lib-parser"Disambiguate a monomorphic literalghc-lib-parser"Disambiguate an overloaded literalghc-lib-parserDisambiguate a wildcardghc-lib-parser'Disambiguate "a :: t" (type annotation)ghc-lib-parser$Disambiguate "[a,b,c]" (list syntax)ghc-lib-parser5Disambiguate "$(...)" and "[quasi|...|]" (TH splices)ghc-lib-parserDisambiguate "f { a = b, ... }" syntax (record construction and record updates)ghc-lib-parserDisambiguate "-a" (negation)ghc-lib-parser-Disambiguate "(# a)" (right operator section)ghc-lib-parser&Disambiguate "(a -> b)" (view pattern)ghc-lib-parserDisambiguate "a@b" (as-pattern)ghc-lib-parser Disambiguate "~a" (lazy pattern)ghc-lib-parser Disambiguate "!a" (bang pattern)ghc-lib-parser,Disambiguate tuple sections and unboxed sumsghc-lib-parser+Validate infixexp LHS to reject unwanted {- SCC ...  -} pragmasghc-lib-parserDisambiguate infix operators. See Note [Ambiguous syntactic categories]Ơghc-lib-parserResult of parsing {-# UNPACK #-} or {-# NOUNPACK #-}.Ƞghc-lib-parserEssentially a wrapper for a RuleBndr GhcPsˠghc-lib-parsermkClassDecl builds a RdrClassDecl, filling in the names for tycon and datacon by deriving them from the name of the class. We fill in the names for the tycon and datacon corresponding to the class, by deriving them from the name of the class itself. This saves recording the names in the interface file (which would be equally good).נghc-lib-parserConverts a list of ws annotated with their  to binders without annotations. Only accepts specified variables, and errors if any of the provided binders has an + annotation.ؠghc-lib-parser Converts w annotated with its  to one without annotations. Only accepts specified variables, and errors if the provided binder has an + annotation.٠ghc-lib-parserAdd the annotation for a 'where' keyword to existing  HsLocalBinds۠ghc-lib-parserFunction definitions are restructured here. Each is assumed to be recursive initially, and non recursive definitions are discovered by the dependency analyser.ghc-lib-parserConstruct a GADT-style data constructor from the constructor names and their type. Some interesting aspects of this function:This splits up the constructor type into its quantified type variables (if provided), context (if provided), argument types, and result type, and records whether this is a prefix or record GADT constructor. See Note [GADT abstract syntax] in  GHC.Hs.Decls for more details.ghc-lib-parserThis rather gruesome function is used mainly by the parser. When parsing: data T a = T | T1 Int"we parse the data constructors as types? because of parser ambiguities, so then we need to change the  type constr to a  data constrThe exact-name case can occur when parsing: data [] a = [] | a : [a]3For the exact-name case we return an original name.ghc-lib-parserCheck if the gadt_constrlist is empty. Only raise parse error for `data T where` to avoid affecting existing error message, see #8258.ghc-lib-parserYield a parse error if we have a function applied directly to a do block etc. and BlockArguments is not enabled.ghc-lib-parserValidate the context constraints and break up a context into a list of predicates.  (Eq a, Ord b) --> [Eq a, Ord b] Eq a --> [Eq a] (Eq a) --> [Eq a] (((Eq a))) --> [Eq a] ghc-lib-parserAnnotate a type with either an {-# UNPACK #-} or a {-# NOUNPACK #-} pragma.ghc-lib-parserCheck for monad comprehensions1If the flag MonadComprehensions is set, return a υ# context, otherwise use the usual ΅ contextghc-lib-parserCheck if a fixity is valid. We support bypassing the usual bound checks for some special operators.ghc-lib-parser#Hint about bang patterns, assuming  BangPatterns is off.ghc-lib-parser precedenceghc-lib-parser operators݋ދߋ֝ àĠŠƠǠȠɠʠˠ̠͠ΠϠРѠҠӠԠՠ֠נؠ٠ڠ۠ܠݠޠߠ ݋ދߋՠ֠͠ΠҠϠѠРӠԠޠˠ̠ؠנ٠ڠܠݠ۠ߠʠȠɠ֝ƠǠàĠŠNone Aghc-lib-parserLex  for warning messagesghc-lib-parser!Lex identifiers from a docstring.ghc-lib-parserA precise identifier parserghc-lib-parserA precise identifier parserNone%15<=>4ghc-lib-parserAdd Haddock documentation accumulated in the parser state to a parsed HsModule.Reports badly positioned comments when -Winvalid-haddock is enabled.Noneӝghc-lib-parser%Extracts the flags needed for parsingNoneʡghc-lib-parser5Why TemplateHaskell rejected the splice. Used in the  constructor of a .ghc-lib-parser/Diagnostics messages emitted during desugaring.ghc-lib-parserSimply wraps a generic h message.ghc-lib-parserDsEmptyEnumeration is a warning (controlled by the -Wempty-enumerations flag) that is emitted if an enumeration is empty. Example(s):main :: IO () main = do let enum = [5 .. 3] print enumHere enum8 would yield an empty list, because 5 is greater than 3. Test case(s): warningsshould_compileT10930 warningsshould_compileT18402 warningsshould_compileT10930b numericshould_compileT10929 numericshould_compileT7881 deSugar should_runT18172ghc-lib-parserDsIdentitiesFound is a warning (controlled by the -Widentities flag) that is emitted on uses of Prelude numeric conversions that are probably the identity (and hence could be omitted). Example(s):main :: IO () main = do let x = 10 print $ conv 10where conv :: Int -> Int conv x = fromIntegral x Here calling conv is essentially the identity function, and therefore can be omitted.Test case(s): deSugarshould_compileT4488ghc-lib-parserThe list of unbound bindersghc-lib-parserThe original bindersghc-lib-parserThe original LHSghc-lib-parserThe optimised LHS¡ġášơǡɡȡʡߡޡݡܡۡڡ١ءס֡աԡӡҡѡСϡΡ̡͡ˡʡߡޡݡܡۡڡ١ءס֡աԡӡҡѡСϡΡ̡͡ˡǡɡȡšơ¡ġáNone'((ghc-lib-parser Pass to a  the information whether or not the '-fbuilding-cabal-package' flag is set.ghc-lib-parserA message from the driver.ghc-lib-parserSimply wraps a generic h message a.ghc-lib-parserA parse error in parsing a Haskell file header during dependency analysisghc-lib-parserDriverMissingHomeModules is a warning (controlled with -Wmissing-home-modules) that arises when running GHC in --make mode when some modules needed for compilation are not included on the command line. For example, if A imports B, `ghc --make A.hs` will cause this warning, while `ghc --make A.hs B.hs` will not.Useful for cabal to ensure GHC won't pick up modules listed neither in 'exposed-modules' nor in 'other-modules'.Test case: warningsshould_compile MissingModghc-lib-parserDriverUnknown is a warning that arises when a user tries to reexport a module which isn't part of that unit.ghc-lib-parserDriverUnknownHiddenModules is a warning that arises when a user tries to hide a module which isn't part of that unit.ghc-lib-parserDriverUnusedPackages occurs when when package is requested on command line, but was never needed during compilation. Activated by -Wunused-packages.Test cases: warningsshould_compileUnusedPackagesghc-lib-parserDriverUnnecessarySourceImports (controlled with -Wunused-imports) occurs if there are imports which are not necessary. See warnUnnecessarySourceImports in .Test cases: warningsshould_compileT10637ghc-lib-parser5DriverDuplicatedModuleDeclaration occurs if a module A& is declared in multiple files.Test cases: None.ghc-lib-parser(DriverModuleNotFound occurs if a module A can't be found.Test cases: None.ghc-lib-parser0DriverFileModuleNameMismatch occurs if a module A is defined in a file with a different name. The first field is the name written in the source code; the second argument is the name extracted from the filename.Test cases: modulemod178, driver/bug1677ghc-lib-parser>DriverUnexpectedSignature occurs when GHC encounters a module A= that imports a signature file which is neither in the  signatures section of a '.cabal' file nor in any package in the home modules.Example:*- MyStr.hsig is defined, but not added to  signatures in the '.cabal' file. signature MyStr where data Str- A.hs, which tries to import the signature. module A where import MyStrTest cases: driver/T12955ghc-lib-parserDriverFileNotFound occurs when the input file (e.g. given on the command line) can't be found.Test cases: None.ghc-lib-parser1DriverStaticPointersNotSupported occurs when the StaticPointers9 extension is used in an interactive GHCi context.Test cases: ghciscripts StaticPtrghc-lib-parserDriverBackpackModuleNotFound occurs when Backpack can't find a particular module during its dependency analysis. Test cases: -ghc-lib-parserDriverUserDefinedRuleIgnored is a warning that occurs when user-defined rules are ignored. This typically happens when Safe Haskell. Test cases:tests safeHaskell%safeInfered/UnsafeWarn05 tests safeHaskell%safeInfered/UnsafeWarn06 tests safeHaskell%safeInfered/UnsafeWarn07 tests safeHaskell(safeInfered/UnsafeInfered11 tests safeHaskellsafeLanguage/SafeLang03ghc-lib-parserDriverMixedSafetyImport is an error that occurs when a module is imported both as safe and unsafe. Test cases:tests safeHaskellsafeInfered/Mixed03 tests safeHaskellsafeInfered/Mixed02ghc-lib-parserDriverCannotLoadInterfaceFile is an error that occurs when we cannot load the interface file for a particular module. This can happen for example in the context of Safe Haskell, when we have to load a module to check if it can be safely imported.Test cases: None.ghc-lib-parserDriverInferredSafeImport is a warning (controlled by the Opt_WarnSafe flag) that occurs when a module is inferred safe.Test cases: None.ghc-lib-parserDriverMarkedTrustworthyButInferredSafe is a warning (controlled by the Opt_WarnTrustworthySafe flag) that occurs when a module is marked trustworthy in SafeHaskell but it has been inferred safe.Test cases: tests safeHaskell)safeInfered/TrustworthySafe02 tests safeHaskellsafeInfered/TrustworthySafe03ghc-lib-parserDriverInferredSafeImport is a warning (controlled by the Opt_WarnInferredSafeImports flag) that occurs when a safe-inferred module is imported from a safe module.Test cases: None.ghc-lib-parserDriverCannotImportUnsafeModule is an error that occurs when an usafe module is being imported from a safe one.Test cases: None.ghc-lib-parserDriverMissingSafeHaskellMode is a warning (controlled by the Opt_WarnMissingSafeHaskellMode flag) that occurs when a module is using SafeHaskell features but SafeHaskell mode is not enabled.Test cases: None.ghc-lib-parserDriverPackageNotTrusted is an error that occurs when a package is required to be trusted but it isn't.Test cases: tests safeHaskellcheck/Check01 tests safeHaskellcheck/Check08 tests safeHaskellcheck/Check06 tests safeHaskellcheckpkg01ImpSafeOnly09 tests safeHaskellcheckpkg01ImpSafe03 tests safeHaskellcheckpkg01ImpSafeOnly07 tests safeHaskellcheckpkg01 ImpSafeOnly08ghc-lib-parserDriverCannotImportFromUntrustedPackage is an error that occurs in the context of Safe Haskell when trying to import a module coming from an untrusted package.Test cases: tests safeHaskellcheck/Check09 tests safeHaskellcheckpkg01ImpSafe01 tests safeHaskellcheckpkg01ImpSafe04 tests safeHaskellcheckpkg01ImpSafeOnly03 tests safeHaskellcheckpkg01ImpSafeOnly05 tests safeHaskellflags/SafeFlags17 tests safeHaskellflags/SafeFlags22 tests safeHaskellflags/SafeFlags23 tests safeHaskellghci/p11 tests safeHaskellghci/p12 tests safeHaskellghci/p17 tests safeHaskellghci/p3 tests safeHaskell'safeInfered/UnsafeInfered01 tests safeHaskell'safeInfered/UnsafeInfered02 tests safeHaskell'safeInfered/UnsafeInfered02 tests safeHaskell'safeInfered/UnsafeInfered03 tests safeHaskell'safeInfered/UnsafeInfered05 tests safeHaskell'safeInfered/UnsafeInfered06 tests safeHaskell'safeInfered/UnsafeInfered09 tests safeHaskell'safeInfered/UnsafeInfered10 tests safeHaskell'safeInfered/UnsafeInfered11 tests safeHaskell$safeInfered/UnsafeWarn01 tests safeHaskell$safeInfered/UnsafeWarn03 tests safeHaskell$safeInfered/UnsafeWarn04 tests safeHaskell$safeInfered/UnsafeWarn05 tests safeHaskell"unsafeLibs/BadImport01 tests safeHaskell"unsafeLibs/BadImport06 tests safeHaskell"unsafeLibs/BadImport07 tests safeHaskell"unsafeLibs/BadImport08 tests safeHaskell"unsafeLibs/BadImport09 tests safeHaskellunsafeLibs/Dep05 tests safeHaskellunsafeLibs/Dep06 tests safeHaskellunsafeLibs/Dep07 tests safeHaskellunsafeLibs/Dep08 tests safeHaskellunsafeLibs/Dep09 tests safeHaskellunsafeLibs/Dep10ghc-lib-parserA collection of driver messagesghc-lib-parserThe umbrella type that encompasses all the different messages that GHC might output during the different compilation stages. See Note [GhcMessage].ghc-lib-parser!A message from the parsing phase.ghc-lib-parser(A message from typecheck/renaming phase.ghc-lib-parser/A message from the desugaring (HsToCore) phase.ghc-lib-parserA message from the driver.ghc-lib-parserAn "escape" hatch which can be used when we don't know the source of the message or if the message is not one of the typed ones. The h and  constraints ensure that if we know, at pattern-matching time, the originating type, we can attempt a cast and access the fully-structured error. This would be the case for a GHC plugin that offers a domain-specific error type but that doesn't want to place the burden on IDEs/application code to "know" it. The h constraint ensures that worst case scenario we can still render this into something which can be eventually converted into a i.ghc-lib-parserA single warning message.  INVARIANT: It must have h severity.ghc-lib-parser!A collection of error messages.  INVARIANT: Each  in the collection should have h severity.ghc-lib-parser#A collection of warning messages.  INVARIANT: Each  in the collection should have h severity.ghc-lib-parserCreates a new  out of any diagnostic. This function is also provided to ease the integration of #18516 by allowing diagnostics to be wrapped into the general (but structured)  type, so that the conversion can happen gradually. This function should not be needed within GHC, as it would typically be used by plugin or library authors (see comment for the  type constructor)ghc-lib-parser9Abstracts away the frequent pattern where we are calling  ioMsgMaybe2 on the result of 'IO (Messages TcRnMessage, a)'.ghc-lib-parser9Abstracts away the frequent pattern where we are calling  ioMsgMaybe0 on the result of 'IO (Messages DsMessage, a)'.ghc-lib-parserghc-lib-parserParse a Haskell module with Haddock comments. This is done in two steps: to build the AST# to insert Haddock comments into itThis is the only parser entry point that deals with Haddock comments. The other entry points (, (, etc) do not insert them into the AST.ͫ9 Ϋ9 Nonemghc-lib-parser#Parse the imports of a source file. Throws a  if parsing fails.ghc-lib-parser6Parse OPTIONS and LANGUAGE pragmas of the source file. Throws a 5 if flag parsing fails (including unsupported flags.)ghc-lib-parser6Parse OPTIONS and LANGUAGE pragmas of the source file. Throws a 5 if flag parsing fails (including unsupported flags.)ghc-lib-parser4Complain about non-dynamic flags in OPTIONS pragmas. Throws a  if the input list is non-empty claiming that the input flags are unknown.ghc-lib-parserParser optionsghc-lib-parserImplicit Prelude?ghc-lib-parser Parse this.ghc-lib-parserFilename the buffer came from. Used for reporting parse error locations.ghc-lib-parserThe original source filename (used for locations in the function result)ghc-lib-parserThe source imports and normal imports (with optional package names from -XPackageImports), and the module name.ghc-lib-parser Input fileghc-lib-parserParsed options, if any.ghc-lib-parser Input Bufferghc-lib-parser)Source filename. Used for location info.ghc-lib-parserParsed options.None '(.>None#$'(28&,&ȣghc-lib-parserThe server-side Template Haskell state. This is created by the StartTH message. A new one is created per module that GHC typechecks.ʣghc-lib-parser+persistent data between splices in a moduleˣghc-lib-parser#location for current splice, if anỵghc-lib-parserpipe to communicate with GHCghc-lib-parserWe can pass simple expressions to EvalStmt, consisting of values and application. This allows us to wrap the statement to be executed in another function, which is used by GHCi to implement :set args and :set prog. It might be worthwhile to extend this little language in the future.ghc-lib-parserMessages sent back to GHC from GHCi.TH, to implement the methods of Quasi. For an overview of how TH works with Remote GHCi, see Note [Remote Template Haskell] in GHCi.TH.ghc-lib-parserIndicates that this RunTH is finished, and the next message will be the result of RunTH (a QResult).ghc-lib-parserTemplate Haskell return valuesghc-lib-parser1RunTH finished successfully; return value followsghc-lib-parserRunTH threw an exceptionghc-lib-parser RunTH called ghc-lib-parserA  Message a+ is a message that returns a value of type a2. These are requests sent from GHC to the server.ghc-lib-parserExit the iserv processghc-lib-parserCreate a set of BCO objects, and return HValueRefs to them Note: Each ByteString contains a Binary-encoded [ResolvedBCO], not a ResolvedBCO. The list is to allow us to serialise the ResolvedBCOs in parallel. See  createBCOs in compilerGHCRuntime/Interpreter.hs.ghc-lib-parserRelease Psghc-lib-parser'Add entries to the Static Pointer Tableghc-lib-parserMalloc some data and return a P to itghc-lib-parserCalls ghc-lib-parser Free data previously created by ghc-lib-parser&Create an info table for a constructorghc-lib-parserEvaluate a statementghc-lib-parser3Resume evaluation of a statement after a breakpointghc-lib-parser4Abandon evaluation of a statement after a breakpointghc-lib-parserEvaluate something of type  IO Stringghc-lib-parserEvaluate something of type String -> IO Stringghc-lib-parserEvaluate something of type IO ()ghc-lib-parser5Create a set of CostCentres with the same module nameghc-lib-parserShow a ϫ as a [String]ghc-lib-parser&Create a new array of breakpoint flagsghc-lib-parserSet how many times a breakpoint should be ignored also used for enable/disableghc-lib-parser'Query the status of a breakpoint (True  = enabled)ghc-lib-parser2Get a reference to a free variable at a breakpointghc-lib-parser:Start a new TH module, return a state token that should beghc-lib-parserEvaluate a TH computation.Returns a ByteString, because we have to force the result before returning it to ensure there are no errors lurking in it. The TH types don't have NFData instances, and even if they did, we have to serialize the value anyway, so we might as well serialize it to force it.ghc-lib-parserRun the given mod finalizers.ghc-lib-parserRemote interface to GHC.Exts.Heap.getClosureData. This is used by the GHCi debugger to inspect values in the heap for :print and type reconstruction.ghc-lib-parser;Evaluate something. This is used to support :force in GHCi.ghc-lib-parser6Resume forcing a free variable in a breakpoint (#2950)£ãģţƣǣȣɣʣˣ̣ͣΣϣУѣңӣԣգ֣ףأ٣ڣۣܣݣޣߣƣǣݣޣߣڣۣܣ֣ףأ٣ӣԣգͣΣϣУѣңȣɣʣˣ̣£ãģţNone-ghc-lib-parserExternal interpreter instanceghc-lib-parserValues that need to be freed before the next command is sent. Threads can append values to this list asynchronously (by modifying the IServ state MVar).ghc-lib-parser5Configuration needed to spawn an external interpreterghc-lib-parserExternal program to runghc-lib-parserCommand-line optionsghc-lib-parserUse Profiling wayghc-lib-parserUse Dynamic wayghc-lib-parserHookghc-lib-parser!Trace action executed after spawnghc-lib-parser State of an external interpreterghc-lib-parserNot spawned yetghc-lib-parserRunningghc-lib-parserExternal interpreterThe external interpreter is spawned lazily (on first use) to avoid slowing down sessions that don't require it. The contents of the MVar reflects the state of the interpreter (running or not).ghc-lib-parserExternal interpreterghc-lib-parser Interpreterghc-lib-parser)Interpreter instance (internal, external)ghc-lib-parserInterpreter loaderNone #$7ghc-lib-parser/Number of parallel jobs doing BCO serializationghc-lib-parser3Run a command in the interpreter's context. With -fexternal-interpreter, the command is serialized and sent to an external iserv process, and the response is deserialized (hence the Binary constraint). With -fno-external-interpreter' we execute the command directly here.ghc-lib-parserGrab a lock on the  and do something with it. Overloaded because this is used from TcM as well as IO.ghc-lib-parserExecute an action of type IO [a] , returning Ps for each of the results.ghc-lib-parserExecute an action of type IO ()ghc-lib-parserExecute an action of type  IO Stringghc-lib-parserExecute an action of type String -> IO Stringghc-lib-parserAllocate and store the given bytes in memory, returning a pointer to the memory in the remote process.ghc-lib-parser4Create a set of BCOs that may be mutually recursive.ghc-lib-parserSend a Seq message to the iserv process to force a value #2950ghc-lib-parserloadDLL loads a dynamic library using the OS's native linker (i.e. dlopen() on Unix, LoadLibrary() on Windows). It takes either an absolute pathname to the file, or a relative filename (e.g. "libfoo.so" or "foo.dll"). In the latter case, loadDLL searches the standard locations for the appropriate library.Returns:0Nothing => success Just err_msg => failureghc-lib-parserSend a 0 and receive the response from the iserv processghc-lib-parser#Read a value from the iserv processghc-lib-parser!Send a value to the iserv processghc-lib-parserStop the interpreterghc-lib-parser Creates a P& that will automatically release the P! when it is no longer referenced.ghc-lib-parser Convert a P to the value it references directly. This only works when the interpreter is running in the same process as the compiler, so it fails when -fexternal-interpreter is on.ghc-lib-parser Convert an P to the value it references directly. This only works when the interpreter is running in the same process as the compiler, so it fails when -fexternal-interpreter is on.ghc-lib-parserInterpreter uses Profiling wayghc-lib-parserInterpreter uses Dynamic wayڣۣܣݣޣߣݣޣߣڣۣܣNone<ǥghc-lib-parserEssentially a GlobalRdrEnv, but with additional cached values to allow efficient re-calculation when the imports change. Fields are strict to avoid space leaks (see T4029) All operations are in GHC.Runtime.Context. See Note [icReaderEnv recalculation]ɥghc-lib-parserThe final environmentʥghc-lib-parser:Just the things defined at the prompt (excluding imports!)إghc-lib-parser stepping mode٥ghc-lib-parserfilename (for errors)ڥghc-lib-parserline number (for errors))¥åĥťƥǥȥɥʥ˥̥ͥΥϥХѥҥԥӥե֥ץإ٥ڥۥܥ)¥åĥťƥǥȥɥʥ˥̥ͥΥϥХѥҥԥӥեܥ֥ץإ٥ڥۥNoneK4ޥghc-lib-parserBring the exports of a particular module (filtered by an import decl) into scopeߥghc-lib-parserBring into scope the entire top-level envt of of this module, including the things imported into it.ghc-lib-parserInteractive context, recording information about the state of the context in which statements are executed in a GHCi session.ghc-lib-parserThe l: used to evaluate interactive expressions and statements.ghc-lib-parserEach GHCi stmt or declaration brings some new things into scope. We give them names like interactive:Ghci9.T, where the ic_index is the '9'. The ic_mod_index is incremented whenever we add something to ic_tythings See Note [The interactive package]ghc-lib-parserThe GHCi top-level scope (icReaderEnv) is extended with these importsThis field is only stored here so that the client can retrieve it with GHC.getContext. GHC itself doesn't use it, but does reset it to empty sometimes (such as before a GHC.load). The context is set with GHC.setContext.ghc-lib-parserTyThings defined by the user, in reverse order of definition (ie most recent at the front). Also used in GHC.Tc.Module.runTcInteractive to fill the type checker environment. See Note [ic_tythings]ghc-lib-parserEssentially the cached 0.The GlobalRdrEnv contains everything in scope at the command line, both imported and everything in ic_tythings, with the correct shadowing.The IcGlobalRdrEnv contains extra data to allow efficient recalculation when the set of imports change. See Note [icReaderEnv recalculation]ghc-lib-parserAll instances and family instances created during this session. These are grabbed en masse after each update to be sure that proper overlapping is retained. That is, rather than re-check the overlapping each time we update the context, we just take the results from the instance code that already does that.ghc-lib-parser#Fixities declared in let statementsghc-lib-parser$The current default types, set by a  'default' declarationghc-lib-parser The stack of breakpoint contextsghc-lib-parser#The monad that GHCi is executing inghc-lib-parserThe function that is used for printing results of expressions in ghci and -e mode.ghc-lib-parservirtual CWD of the programghc-lib-parserCache of loaded plugins. We store them here to avoid having to load them everytime we switch to the interctive context.ghc-lib-parser'Constructs an empty InteractiveContext.ghc-lib-parserThis function returns the list of visible TyThings (useful for e.g. showBindings).It picks only those TyThings that are not shadowed by later definitions on the interpreter, to not clutter :showBindings with shadowed ids, which would show up as Ghci9.foo.Some TyThings define many names; we include them if _any_ name is still available unqualified.ghc-lib-parserGet the PrintUnqualified function based on the flags and this InteractiveContextghc-lib-parserextendInteractiveContext is called with new TyThings recently defined to update the InteractiveContext to include them. By putting new things first, unqualified use will pick the most recently defined thing with a given name, while still keeping the old names in scope in their qualified form (Ghci1.foo).ݥޥߥݥޥߥNone<=Sghc-lib-parserHscEnv is like , except that some of the fields are immutable. An HscEnv is used to compile a single module from plain Haskell source code (after preprocessing) to either C, assembly or C--. It's also used to store the dynamic linker state to allow for multiple linkers in the same address space. Things like the module graph don't change during a single compilation.Historical note: "hsc" used to be the name of the compiler binary, when there was a separate driver and compiler. To compile a single module, the driver would invoke hsc on the source code... so nowadays we think of hsc as the layer of the compiler that deals with compiling a single module.ghc-lib-parserThe dynamic flag settingsghc-lib-parser-The targets (or roots) of the current sessionghc-lib-parser'The module graph of the current sessionghc-lib-parser1The context for evaluating interactive statementsghc-lib-parserGlobal Name cache so that each Name gets a single Unique. Also track the origin of the Names.ghc-lib-parser:The cached result of performing finding in the file systemghc-lib-parser7Used for one-shot compilation only, to initialise the IfGblEnv. See  for (. See also Note [hsc_type_env_var hack]ghc-lib-parsertarget code interpreter (if any) to use for TH and GHCi. See Note [Target code interpreter]ghc-lib-parserPluginsghc-lib-parser/Unit environment (unit state, home unit, etc.).)Initialized from the databases cached in  hsc_unit_dbs and from the DynFlags.ghc-lib-parserLogger with its flags.Don't forget to update the logger flags if the logging related DynFlags change. Or better, use hscSetFlags setter which does it.ghc-lib-parserHooksghc-lib-parserTemporary filesghc-lib-parser:The Hsc monad: Passing an environment and diagnostic stateNone\hghc-lib-parserSwitches in the DynFlags and Plugins from the InteractiveContextghc-lib-parserA variant of runHsc that switches in the DynFlags and Plugins from the InteractiveContext before running the Hsc computation.ghc-lib-parser(Retrieve the ExternalPackageState cache.ghc-lib-parserFind all the instance declarations (of classes and families) from the Home Package Table filtered by the provided predicate function. Used in  tcRnImports, to select the instances that are in the transitive closure of imports from the currently compiled module.ghc-lib-parser4Find instances visible from the given set of importsghc-lib-parserGet rules from modules "below" this one (in the dependency sense)ghc-lib-parserGet annotations from modules "below" this one (in the dependency sense)ghc-lib-parserGet things from modules "below" this one (in the dependency sense) C.f Inst.hptInstancesghc-lib-parserDeal with gathering annotations in from all possible places and combining them into a single 1ghc-lib-parser Find the  for the given  by using all the resources at our disposal: the compiled modules in the Ց: and the compiled modules in other packages that live in '. Note that this does NOT look up the  in the module being compiled: you have to do that yourself, if desiredghc-lib-parser Find the ő for a  , searching in both the loaded home and external package module informationghc-lib-parser$Retrieve the target code interpreter0Fails if no target code interpreter is availableghc-lib-parserUpdate the LogFlags of the Log in hsc_logger from the DynFlags in hsc_dflags. You need to call this when DynFlags are modified.ghc-lib-parser Update Flagsghc-lib-parser Set Flagsghc-lib-parserDiscard the contents of the InteractiveContext, but keep the DynFlags and the loaded plugins. It will also keep ic_int_print and ic_monad if their names are from external packages.22None 5<=gghc-lib-parser-A function called to log warnings and errors.ghc-lib-parserA monad transformer to add GHC specific features to another monad.Note that the wrapped monad must support IO and handling of exceptions.ghc-lib-parserThe Session is a handle to the complete state of a compilation session. A compilation session consists of a set of modules constituting the current program or library, the context for interactive evaluation, and various caches.ghc-lib-parserA minimal implementation of a . If you need a custom monad, e.g., to maintain additional state consider wrapping this monad or using .ghc-lib-parser:A monad that has all the features needed by GHC API calls.In short, a GHC monadallows embedding of IO actions,can log warnings,/allows handling of (extensible) exceptions, andmaintains a current session.If you do not use  or , make sure to call 5 before any call to the GHC API functions can occur.ghc-lib-parser+Call the argument with the current session.ghc-lib-parser#Grabs the DynFlags from the Sessionghc-lib-parserSet the current session to the result of applying the current session to the argument.¦ghc-lib-parserSet the current session to the result of applying the current session to the argument.æghc-lib-parser3Call an action with a temporarily modified Session.Ħghc-lib-parserModify the loggerŦghc-lib-parserPush a log hook on the stackƦghc-lib-parserPop a log hook from the stackǦghc-lib-parserPut a log messageȦghc-lib-parserPut a log messageɦghc-lib-parserTime an actionʦghc-lib-parser+A monad that allows logging of diagnostics.˦ghc-lib-parserReflect a computation in the  monad into the D monad.>You can use this to call functions returning an action in the  monad inside an D action. This is needed for some (too restrictive) callback arguments of some library functions: libFunc :: String -> (Int -> IO a) -> IO a ghcFunc :: Int -> Ghc a ghcFuncUsingLibFunc :: String -> Ghc a -> Ghc a ghcFuncUsingLibFunc str = reifyGhc $ \s -> libFunc $ \i -> do reflectGhc (ghcFunc i) sΦghc-lib-parserPrint the all diagnostics in a '. Useful inside exception handlers.S¦æĦŦƦǦȦɦʦ˦̦ͦΦϦͦ˦̦S¦æĦŦƦȦǦɦʦΦϦNone5qghc-lib-parserThe monad used by Core-to-Core passes to register simplification statistics. Also used to have common state (in the form of UniqueSupply) for generating Uniques.ghc-lib-parser'A description of the plugin pass itselfghc-lib-parserJust n  = float lambdas to top level, if doing so will abstract over n or fewer value variables Nothing  = float all lambdas to top level, regardless of how many free variables Just 0 is the vanilla case: float a lambda iff it has no free varsghc-lib-parserTrue  = float constants to top level, even if they do not escape a lambdaghc-lib-parserTrue  = float out over-saturated applications based on arity information. See Note [Floating over-saturated applications] in GHC.Core.Opt.SetLevelsghc-lib-parser%Allow floating to the top level only.ghc-lib-parserName(s) of the phaseghc-lib-parserUnfolding optionsghc-lib-parserWhether RULES are enabledghc-lib-parserWhether inlining is enabledghc-lib-parserWhether case-of-case is enabledghc-lib-parser Whether eta-expansion is enabledghc-lib-parser!Do we swizzle casts past lambdas?ghc-lib-parserWhether pre-inlining is enabledghc-lib-parserLift an D operation into  while consuming its ghc-lib-parserGet all annotations of a given type. This happens lazily, that is no deserialization will take place until the [a] is actually demanded and the [a] can also be empty (the UniqFM is not filtered).This should be done once at the start of a Core-to-Core pass that uses annotations.See Note [Annotations]ghc-lib-parserGet at most one annotation of a given type per annotatable item.ghc-lib-parser%Output a String message to the screenghc-lib-parserOutput a message to the screenghc-lib-parserOutput an error to the screen. Does not cause the compiler to die.§ghc-lib-parserOutput an error to the screen. Does not cause the compiler to die.çghc-lib-parserOutput a fatal error to the screen. Does not cause the compiler to die.ħghc-lib-parserOutput a fatal error to the screen. Does not cause the compiler to die.ŧghc-lib-parser8Output a string debugging message at verbosity level of -v or higherƧghc-lib-parser2Outputs a debugging message at verbosity level of -v or higherghc-lib-parserMaskSl§çħŧƧlS§ħçƧŧ-None %38:<t` קا٧ ڧۧܧݧާ ާ קا٧ڧۧܧݧ None5wghc-lib-parser Type-check a S!. See Note [Core Lint guarantee].ghc-lib-parserThis checks whether a pass correctly looks through debug annotations ( SourceNote). This works a bit different from other consistency checks: We check this by running the given task twice, noting all differences between the results.ghc-lib-parserIf J!, display linter warnings. If G, ignore linter warnings.ghc-lib-parser The source of the linted programghc-lib-parser"The linted program, pretty-printedghc-lib-parser#The source of the linted expressionghc-lib-parserTrue  = is a compulsory unfoldingghc-lib-parserTreat these as in scopeghc-lib-parserThe source of the linted axioms  None '(<8ghc-lib-parserThe current collection of docs that Template Haskell has built up via putDoc.ghc-lib-parserThis is a mirror of Template Haskell's DocLoc, but the TH names are resolved to GHC names.ghc-lib-parser$A plugin for controlling defaulting.ghc-lib-parser.Initialize plugin, when entering type-checker.ghc-lib-parserDefault some typesghc-lib-parser9Clean up after the plugin, when exiting the type-checker.ghc-lib-parser pure $ TcPluginOK [] [] 5 if your plugin does not provide this functionality.ghc-lib-parser+Rewrite saturated type family applications.The plugin is expected to supply a mapping from type family names to rewriting functions. For each type family , the plugin should provide a function which takes in the given constraints and arguments of a saturated type family application, and return a possible rewriting. See + for the expected shape of such a function.Use  \ _ -> emptyUFM 4 if your plugin does not provide this functionality.ghc-lib-parser9Clean up after the plugin, when exiting the type-checker.ghc-lib-parser5 is the monad in which type-checking plugins operate.ghc-lib-parserFor rewriting type family applications, a type-checking plugin provides a function of this type for each type family .The function is provided with the current set of Given constraints, together with the arguments to the type family. The type family application will always be fully saturated.ghc-lib-parserThe solve function of a type-checking plugin takes in Given and Wanted constraints, and should return a  indicating which Wanted constraints it could solve, or whether any are insoluble.ghc-lib-parser>IsGroupClosed describes a group of mutually-recursive bindingsghc-lib-parser+IdBindingInfo describes how an Id is bound.?It is used for the following purposes: a) for static forms in  and b) to figure out when a nested binding can be generalised, in .̨ghc-lib-parser?A typecheckable thing available in a local context. Could be ͨ 1, but also lexically scoped variables, etc. See GHC.Tc.Utils.Env for how to retrieve a  given a .ghc-lib-parserType alias for ; the convention is we'll use this for mutable bits of data in  which are updated during typechecking and returned at the end.ghc-lib-parser describes the top-level of the module at the point at which the typechecker is finished work. It is this structure that is handed on to the desugarer For state that needs to be updated during the typechecking phase and returned at end, use a  (= ).ghc-lib-parserModule being compiledghc-lib-parserIf a signature, the backing module See also Note [Identity versus semantic module]ghc-lib-parser4What kind of module (regular Haskell, hs-boot, hsig)ghc-lib-parser$Top level envt; used during renamingghc-lib-parserTypes used for defaulting. Nothing => no default declghc-lib-parserJust for things in this moduleghc-lib-parserJust for things in this module See Note [The interactive package] in GHC.Runtime.Contextghc-lib-parserGlobal type env for the module we are compiling now. All TyCons and Classes (for this module) end up in here right away, along with their derived constructors, selectors.(Ids defined in this module start in the local envt, though they move to the global envt during zonking)NB: for what "things in this module" means, see Note [The interactive package] in GHC.Runtime.Contextghc-lib-parserInstance envt for all  home-package modules; Includes the dfuns in tcg_insts NB. BangPattern is to fix a leak, see #15111ghc-lib-parserDitto for family instances NB. BangPattern is to fix a leak, see #15111ghc-lib-parserAnd for annotationsghc-lib-parserWhat is exportedghc-lib-parserInformation about what was imported from where, including things bound in this module. Also store Safe Haskell info here about transitive trusted package requirements.There are not many uses of this field, so you can grep for all them.The ImportAvails records information about the following things: 6All of the modules you directly imported (tcRnImports)The orphans (only!) of all imported modules in a GHCi session (runTcInteractive)(The module that instantiated a signature%Each of the signatures that merged inIt is used in the following ways: - imp_orphs is used to determine what orphan modules should be visible in the context (tcVisibleOrphanMods) - imp_finsts is used to determine what family instances should be visible (tcExtendLocalFamInstEnv) - To resolve the meaning of the export list of a module (tcRnExports) - imp_mods is used to compute usage info (mkIfaceTc, deSugar) - imp_trust_own_pkg is used for Safe Haskell in interfaces (mkIfaceTc, as well as in GHC.Driver.Main) - To create the Dependencies field in interface (mkDependencies)ghc-lib-parserTrue" <=> Template Haskell syntax used.We need this so that we can generate a dependency on the Template Haskell package, because the desugarer is going to emit loads of references to TH symbols. The reference is implicit rather than explicit, so we have to zap a mutable variable.ghc-lib-parserTrue( <=> A Template Haskell splice was used.2Splices disable recompilation avoidance (see #481)ghc-lib-parserThe set of runtime dependencies required by this module See Note [Object File Dependencies]ghc-lib-parser&Allows us to choose unique DFun names.ghc-lib-parserThe requirements we merged with; we always have to recompile if any of these changed.ghc-lib-parserRenamed decls, maybe. Nothing! <=> Don't retain renamed decls.ghc-lib-parser"dependencies from addDependentFileghc-lib-parser'Top-level declarations from addTopDeclsghc-lib-parserForeign files emitted from TH.ghc-lib-parser>Exact names bound in top-level declarations in tcg_th_topdeclsghc-lib-parser#Template Haskell module finalizers.+They can use particular local environments.ghc-lib-parser,Core plugins added by Template Haskell code.ghc-lib-parserTemplate Haskell stateghc-lib-parser#Docs added in Template Haskell via putDoc.ghc-lib-parserMaybe Haddock header docsghc-lib-parserTrue if any part of the prog uses hpc instrumentation. NB. BangPattern is to fix a leak, see #15111ghc-lib-parser5Whether this module has a corresponding hi-boot fileghc-lib-parserThe Name of the main function, if this module is the main module.ghc-lib-parserHas the typechecker inferred this module as -XSafe (Safe Haskell)? See Note [Safe Haskell Overlapping Instances Implementation], although this is used for more than just that failure case.ghc-lib-parserUnreported reasons why tcg_safe_infer is False. INVARIANT: If this Messages is non-empty, then tcg_safe_infer is False. It may be that tcg_safe_infer is False but this is empty, if no reasons are supplied (#19714), or if those reasons have already been reported by GHC.Driver.Main.markUnsafeInferghc-lib-parserA list of user-defined type-checking plugins for constraint solving.ghc-lib-parserA collection of all the user-defined type-checking plugins for rewriting type family applications, collated by their type family s.ghc-lib-parser;A list of user-defined plugins for type defaulting plugins.ghc-lib-parser8A list of user-defined plugins for hole fit suggestions.ghc-lib-parser%The RealSrcSpan this module came fromghc-lib-parserWanted constraints of static forms. See Note [Constraints in static forms].ghc-lib-parser,Tracking indices for cost centre annotations©ghc-lib-parser2See Note [Generating fresh names for FFI wrappers]éghc-lib-parseré describes the result of running the frontend of a Haskell module. Currently one always gets a ĩ, since running the frontend involves typechecking a program. hs-sig merges are not handled here.This data type really should be in GHC.Driver.Env, but it needs to have a TcGblEnv which is only defined here.ҩghc-lib-parserA ҩ carries the necessary context for performing rewrites (i.e. type family reductions and following filled-in metavariables) in the solver.ԩghc-lib-parser"In which context are we rewriting?Type-checking plugins might want to use this location information when emitting new Wanted constraints when rewriting type family applications. This ensures that such Wanted constraints will, when unsolved, give rise to error messages with the correct source location.֩ghc-lib-parserAt what role are we rewriting?3See Note [Rewriter EqRels] in GHC.Tc.Solver.Rewriteשghc-lib-parser"See Note [Wanteds rewrite Wanteds]ީghc-lib-parser0Historical "type-checking monad" (now it's just ).ߩghc-lib-parser+Historical "renaming monad" (now it's just ).ghc-lib-parserA  is a substitution on s that can be used to refine the identities of a hole while we are renaming interfaces (see GHC.Iface.Rename). Specifically, a  for ns_module_name A, defines a mapping from {A.T} (for some  T) to some arbitrary other ."The most intruiging thing about a (, however, is how it's constructed. A  is *implied* by the exported /s of the implementor of an interface: if an implementor of signature  exports M.T-, you implicitly define a substitution from {H.T} to M.T. So a  is computed from the list of /s that are exported by the implementation of a module, or successively merged together by the export lists of signatures which are joining together.It's not the most obvious way to go about doing this, but it does seem to work!NB: Can't boot this and put it in NameShape because then we start pulling in too many DynFlags things.ghc-lib-parser,The plugin has not found any contradictions,The first field is for constraints that were solved. The second field contains new work, that should be processed by the constraint solver.ghc-lib-parserThe plugin found a contradiction. The returned constraints are removed from the inert set, and recorded as insoluble.7The returned list of constraints should never be empty.ghc-lib-parserGet target platformghc-lib-parserMatches on either a global  or a q.ghc-lib-parserUnion two ImportAvailsThis function is a key part of Import handling, basically for each import we create a separate ImportAvails structure and then union them all together with this function.ghc-lib-parser#No signature or a partial signatureghc-lib-parser;This function provides an escape for direct access to the ީ: monad. It should not be used lightly, and the provided  API should be favoured instead.ghc-lib-parser Check the  for consistency. Currently, only checks axioms, but should check other aspects, too.ghc-lib-parserRewriter environmentghc-lib-parserGivensghc-lib-parsertype family argumentsghc-lib-parserGivensghc-lib-parserWantedsOOooooooooooosssssss¨èĨŨƨǨȨɨʨ˨̨ͨΨϨШѨҨӨԨ֨ըרب٨ڨۨܨݨިߨ©éĩũƩǩȩɩʩ˩̩ͩΩϩЩѩҩөԩթ֩שة٩ک۩ܩݩީߩީߩة٩ک۩ܩݩ©sssssΩϩЩѩũƩǩȩɩʩ˩̩ͩҩөԩթ֩שéĩooooooooooǫͨΨϨШѨҨӨĨŨƨǨȨɨʨ˨¨èsOOܨݨިߨب٨ڨۨרԨ֨ըsNoneughc-lib-parserHoleFit is the type we use for valid hole fits. It contains the element that was checked, the Id of that element as found by tcLookup, and the refinement level of the fit, which is the number of extra argument holes that this fit uses (e.g. if hfRefLvl is 2, the fit is for `Id _ _`).ughc-lib-parserA fit that is just displayed as is. Here so thatHoleFitPlugins can inject any fit they want.ughc-lib-parserThe elements id in the TcMughc-lib-parserThe candidate that was checked.ughc-lib-parser$The type of the id, possibly zonked.ughc-lib-parser The number of holes in this fit.ughc-lib-parserThe wrapper for the match.ughc-lib-parser;What the refinement variables got matched with, if anythingughc-lib-parser,Documentation of this HoleFit, if available.ughc-lib-parser7A HoleFitPlugin is a pair of candidate and fit plugins.ughc-lib-parserHoleFitCandidates are passed to hole fit plugins and then checked whether they fit a given typed-hole.ghc-lib-parserHoleFitPluginR adds a TcRef to hole fit plugins so that plugins can track internal state. Note the existential quantification, ensuring that the state cannot be modified from outside the plugin.ghc-lib-parser0Initializes the TcRef to be passed to the pluginghc-lib-parser'The function defining the plugin itselfghc-lib-parser7Cleanup of state, guaranteed to be called even on errorghc-lib-parser=A plugin for modifying hole fits *after* they've been found.ghc-lib-parserA plugin for modifying the candidate hole fits *before* they're checked.ghc-lib-parserAny relevant Cts to the holeghc-lib-parserThe nested implications of the hole with the innermost implication first.ghc-lib-parserThe hole itself, if available. uuuuuuuuuuuuuuu uuuuuuuuuuuuuuu%None ghc-lib-parserA static plugin with its arguments. For registering compiled-in plugins through the GHC API. ghc-lib-parser>A plugin with its arguments. The result of loading the plugin. ghc-lib-parser  is the compiler plugin data type. Try to avoid constructing one of these directly, and just modify some fields of  instead: this is to try and preserve source-code compatibility when we add fields to this.Nonetheless, this API is preliminary and highly likely to change in the future.ghc-lib-parserStatic plugins which do not need dynamic loading. These plugins are intended to be added by GHC API users directly to this list.;To add dynamically loaded plugins through the GHC API see addPluginModuleName instead.ghc-lib-parserPlugins dynamically loaded after processing arguments. What will be loaded here is directed by DynFlags.pluginModNames. Arguments are loaded from DynFlags.pluginModNameOpts.The purpose of this field is to cache the plugins so they don't have to be loaded each time they are needed. See .ghc-lib-parserThe object files required by the loaded plugins See Note [Plugin dependencies]ɪghc-lib-parser9the actual plugin together with its commandline arguments˪ghc-lib-parser9the actual plugin together with its commandline arguments̪ghc-lib-parser the module containing the pluginϪghc-lib-parserthe actual callable pluginЪghc-lib-parser%command line arguments for the pluginҪghc-lib-parserModify the Core pipeline that will be used for compilation. This is called as the Core pipeline is built for every module being compiled, and plugins get the opportunity to modify the pipeline in a nondeterministic order.Ӫghc-lib-parserAn optional typechecker plugin, which may modify the behaviour of the constraint solver.Ԫghc-lib-parserAn optional defaulting plugin, which may specify the additional type-defaulting rules.ժghc-lib-parserAn optional plugin to handle hole fits, which may re-order or change the list of valid hole fits and refinement hole fits.֪ ghc-lib-parserAn optional plugin to update , right after plugin loading. This can be used to register hooks or tweak any field of DynFlags' before doing actual work on a module.תghc-lib-parser3Specify how the plugin should affect recompilation.تghc-lib-parser8Modify the module when it is parsed. This is called by GHC.Driver.Main when the parser has produced no or only non-fatal errors. Compilation will fail if the messages produced by this function contain any errors.٪ghc-lib-parserModify each group after it is renamed. This is called after each { has been renamed.ڪghc-lib-parserModify the module when it is type checked. This is called at the very end of typechecking.۪ghc-lib-parser4Modify the TH splice or quasiqoute before it is run.ܪghc-lib-parser>Modify an interface that have been loaded. This is called by GHC.Iface.Load when an interface is successfully loaded. Not applied to the loading of the plugin interface. Tools that rely on information from modules other than the currently compiled one should implement this function.ݪghc-lib-parserCommand line options gathered from the -PModule.Name:stuff syntax are given to you as this typeghc-lib-parserDefault plugin: does nothing at all, except for marking that safe inference has failed unless -fplugin-trustworthy is passed. For compatibility reason you should base all your plugin definitions on this default value.ghc-lib-parserA renamer plugin which mades the renamed source available in a typechecker plugin.ghc-lib-parser9Perform an operation by using all of the plugins in turn.ghc-lib-parserPerform a constant operation by using all of the plugins in turn.7 Ȫɪ ʪ˪̪  ѪҪӪԪժ֪תت٪ڪ۪ܪ ªêĪŪƪǪͪΪϪЪݪުߪ7  ѪҪӪԪժ֪תت٪ڪ۪ܪݪĪŪƪǪêªͪΪϪЪߪ ʪ˪̪ު ȪɪNone '(͑ghc-lib-parser8A wrapper around the interpretation function for phases.&None R ghc-lib-parserHooks can be used by GHC API clients to replace parts of the compiler pipeline. If a hook is not installed, GHC uses the default built-in behaviourghc-lib-parserActual type: Maybe ([LForeignDecl GhcTc] -> DsM (ForeignStubs, OrdList (Id, CoreExpr)))   Noneghc-lib-parser9Initialise coercion optimiser configuration from DynFlagsghc-lib-parser7Initialise Simple optimiser configuration from DynFlagsghc-lib-parser!Extract BCO options from DynFlagsghc-lib-parser+Extract GHCi options from DynFlags and stepЫ                                                                                                                                                                                                                                                                                                                           ! " " " " " " " # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # # $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $ $   % % % % % & & & & & & ' ' '''' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' ' '                     ( ( ( ( ( ( ( ( ( ( ) ) ) ) ) * * * * * + + + + + + + + + + + , , , , , , , , , - - . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ......................................//////////////////////////////////////////01111112333444444444566666777788888888888888888889999999999999999999:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::    ;;;;;;;;;;;<=============>>>>????????@@@@@@@@@@@@@@@@@@@@@@@@@@@AAAAAABCCCCCDDDDDDDDDDDDDDDDDDDD                 EEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEEFFFFFFFFFFFFFFFGGGGGGGGGGHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHIIIIII>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJKKKKLLLLLLLLLLLLLLMMMMMMMMMMMMNNNNNNNNNNNNNOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUVVVVVVVVWWWWWWWWWWWWWWWWWWWWWWWWWWWWXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXYYYYYYZZZZZZZZZ[[[[[[[[[\ \ \\\\\\\\\\\ \ \\ ]]]]]]]]]]]]]]]]]]]]]]]]]]]]]^^^^^^^^^^^^^^^^                                        ____________________________________________````````aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbb55555555555555555?????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????ccccccccccccccccddddeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeffffffffffffgggggggggggggghhhhiiiiiiiiiiiiiiiiiiiiiiiiiiijjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjkkkkkkkkkkkkkllllllllllllmmmmmmmmmmmmmmmmmnnnnnnnnnnnnnnnnnnnnnnnnnnooooooooooooppppppppppppppppppppppppppppppppppppppppppqqqqqq qqqqqrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrrr r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r!r"r"r"r"r"r"r"r"r"r"r"r"r"r"r"r"r"r"r"r"r"s"s"s"ss"s"s"s"s"s"t"u"u"u"u"u"u"u"u"v"v"v"y"y"y"yy"y"y"y"y"y"y"y"yy"y"y"z"z"z"z"z"z"z"z"x"x"x"x"x"x"x"x"x"x"x"x"x"xx"x"x"x"|"|"|"|"|"}"}"}}}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}"}#}#}#}#}#}#}#}#}#}#}#}#}#}#}#}#}#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~~~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~#~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~$~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%~%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&&'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''(((((((((((((((((((((((((((((((((((((((#( (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((())))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))********************************************************************************************************************************+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++  +  +++++++++++++++++++++++++++++++++,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,----I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I-I.I.I.I.I.I.I.I.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.`.s.s.s.s.s.s.s.s.s.s.s-s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s.s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s/s///////////////////////////////////////////////////////////00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000111111111111111111111111111111111111111111111111111111111101000111111111111111111111111111111111111111111111111111111111111111111111111222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222222333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333344444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444444 444444444444444444444444444444444444444444555555555555555555555555555555555555555555555555555555555555555555555555555555555.55555555555555555555555555555555555555555555555666666666666666666666666666666666666" 6666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666666667777777777777777w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7w7777777777777777777777777777777777777777777777777777777777777777777777777777778888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888888899999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999999::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<<================================================================================================================================>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????????@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@u@uAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuAuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBu/uBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBuBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBBy"yCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyCyC C C C C C C C C C C C C C C C C C C D D D D D D D D D D D D D D D D D D D D D D D D D D D D DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDEE{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{E{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{F{FxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxFxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxGxHxHxHxHxHxHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIIJJJJJJJJJJ JJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJJ|J|J|K|K|K|K|K|K|K|K|K|K|K|K|K|K|K|K|K|K|K|KKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKKwKwKwKwKwKwKwKwKwKwKwKwKwKwKwKwKwKwKwKwKwKwKwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLwLLLLLLLLLLLLLLLLLLLLLLLLLLMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMIMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMMNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNNOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPPQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQ#QQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQQRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRRSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSSTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTTUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUUVV"VVVVVVV"VVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVVYVYVYVYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWY.YWY.YWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWYWtWtWtWtWtWtWtWtWtWt/t/tWt/tWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtWtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXtXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXvXXXXXXXXXXXXXXXXXXXYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYYZZZZZZZZZZZZZZZZZZZZZZZZZZZZZZ0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0Z0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0[0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0\0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0]0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0^0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0_0___________________________````` ```````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````````aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaabbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbSbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccccdddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeee''''eeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeeffffffffffffMMffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffgggggggggggggggggggggggDDDgggggggDgggggggggggggggggDDgDggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggggghhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhdhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhhh h hhhhh3hhhhhhhhhhhhhhhhhiiiiiiiiiiiiiiiiiiiiiihiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiiijjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjj,j,j,j,j,j,j,j,j,j,j,j, ,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,j,jjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjjkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkklllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllllmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmmnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooooppppppppppppppppppppppppppppppppppppppKppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppppqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzqzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrzrrrrrsssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssssstttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttttt t t t t t t t t t t t t t t t t t u u u u u u u u u u u u u u u u u u u u u uuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvRvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvwwwwwwRwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwwww5wwxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxTxxxxxxxxxxxxxxxxxxxxxTxxTxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxxyyyyyyyyyyyyyyyyyyyuyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyy+yyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyyzzzzzzzzzzzzzzzzzzzzzzzzzTzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz77zzzzzzzzzzzzzzzzzzzzzzzzzzzTzzzzzzzzzzzzzzzzzzzzzz{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{6{{{{"CCCzzzzzz{{{"..{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{{ {w{{{{{{{{{{{{{{{{{{{{{L{3{{{y{{{||||######|||||||||"||||"|||||||77|||||yyyyy|||####||z|||||z|||||||||||{|||||||||||||||||||I||||||||||||||||||||||||||||||||||||||||v||||||||||||||||||||||V|||}}}}}}}}}#$}}}}}}}}}}}}}}}}}}}}}}}}}}}-}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}}~~~~~~~~~~~~~~~~~~~~~~~-~~.~~~~~~~~~~~~~~~~~~~~~~~.~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~C777CC///###€ÀĀŀƀǀȀ..ɀʀˀ̀̀΀..πЀрҀ...ӀԀՀր׀؀ـڀۀ܀݀ހ߀$$$-J"ÁāŁƁǁȁɁʁˁ́́΁ρЁсҁӁԁՁցׁz6؁فځہ܁݁ށ߁‚ÂĂłƂǂȂɂʂ˂̂͂΂ςЂт҂ӂԂՂւׂ؂قڂۂ܂݂ނ߂OƒÃăŃƃǃȃɃʃ˃̃̓΃σЃу҃ӃԃՃփ׃؃كڃۃ܃݃ރ߃Ղւׂ؂KR„ÄĄńƄDŽȄɄʄ˄̄̈́΄τЄф҄ӄԄՄք|ׄ؄للڄۄT܄݄ބ߄||Svv…ÅąŅƅDžȅɅʅ˅̅ͅ΅υЅх҅ӅԅՅօׅ5؅مڅۅ܅݅ޅ߅5†ÆĆĆņƆdžȆɆʆˆ̆͆ΆφІц҆ӆԆԆՆֆ׆؆نچۆ܆݆݆ކ߆‡ÇććŇƇLJȇȇɇʇˇ͇̇·χЇч҇ӇԇՇևׇ؇هڇۇ܇݇އ߇ˆˆÈĈňƈLjLjȈɈʈˈ͈̈ΈψЈш҈ӈԈՈֈ׈؈وڈbۈ܈݈ވ߈‰ÉĉʼnƉljȉɉʉˉ͉̉ΉωЉщ҉ӉԉՉ։׉؉ىډۉ܉݉މ߉ŠÊĊŊƊNJȊɊʊʊˊ̊͊ΊϊЊъҊӊԊՊ֊׊؊يڊۊ܊݊ފߊb‹ËċŋƋNjȋɋʋˋ̋͋΋ϋЋыҋӋԋՋ֋׋؋ًڋۋ܋݋ދߋŒÌČŌƌnjȌɌʌˌ̌͌ΌόЌьҌӌԌՌ֌׌،ٌڌی܌݌ތߌÍčōƍǍȍɍʍˍ͍̍΍ύЍэҍӍԍՍ֍׍؍ٍڍۍ܍ݍލߍŽÎĎŎƎǎȎɎʎˎ͎̎ΎώЎюҎӎԎՎ֎׎؎َڎێ܎ݎގߎÏďŏƏǏȏɏʏˏ̏͏͏ΏϏЏяҏӏԏՏ֏׏؏ُُڏۏ܏܏ݏޏߏÐĐŐƐǐȐɐʐː̐͐ΐϐАѐҐӐԐՐ֐אِؐڐېܐݐސ3ߐ333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333333‘3Ñ3đ3ő3Ƒ3Ǒ3ȑ3ɑ3ʑ3ˑ3̑3͑3Α3ϑ3Б3ё3ґ3ӑ3ԑ3Ց3֑3ב3ؑ33ّ3ڑ3ۑ3ܑ3ݑ3ޑ3ߑ3333333333333333333333333333333333333333333333333333333333’ÒĒŒƒǒȒɒʒ˒̒͒ΒϒВђҒӒԒՒ֒גْؒڒےےܒݒޒߒ“ÓēœƓǓȓɓʓ˓͓̓ΓϓГѓғӓԓՓ֓דؓٓړۓܓݓޓߓ”ÔĔŔƔǔȔɔʔ˔͔̔ΔϔДєҔӔԔՔ֔הؔٔڔ۔ܔݔޔߔ•ÕĕŕƕǕȕɕʕ˕͕̕ΕϕϕЕѕҕӕӕԕՕ֕וٕؕڕڕەەܕݕݕޕߕ–ÖĖŖƖǖȖɖʖ˖̖͖ΖϖЖіҖӖԖԖՖՖ֖זٖؖږۖܖݖޖߖ —×ėŗƗǗȗɗʗ˗̗͗ΗϗЗїҗӗԗ՗֗חؗٗڗۗܗݗޗߗV˜ØĘŘƘǘȘɘʘ˘̘͘ΘϘИјҘӘԘ՘֘טؘ٘ژۘܘݘޘߘ™ÙęřƙǙșəʙ˙̙͙ΙϙЙљҙәԙՙ֙יؙٙڙۙܙݙݙޙߙšÚĚŚƚǚȚɚʚ˚͚̚ΚϚКњҚӚԚ՚֚ךؚٚښۚܚݚޚߚ›ÛěśƛǛțɛɛʛ˛̛͛ΛϛЛћқӛԛ՛֛כ؛ٛڛۛܛݛޛߛœÜĜŜƜǜȜɜʜ˜̜͜ΜϜМќҜӜԜ՜֜ל؜ٜڜۜܜݜޜߜIÝĝŝƝǝȝɝʝ˝̝͝ΝϝНѝҝӝԝ՝֝ם؝ٝڝڝ۝ܝܝݝݝޝߝžÞĞŞƞǞȞɞʞ˞̞͞ΞϞОўҞӞԞ՞֞מ؞؞ٞڞ۞ܞݞޞߞŸßğşƟǟȟɟɟʟ˟̟͟ΟϟПџҟӟԟ՟՟֟ןן؟ٟڟ۟ܟݟޟߟ-"36/-. àĠŠƠǠȠɠʠˠ̠͠ΠϠРѠҠӠԠՠ֠נؠ٠ڠ۠۠ܠݠޠߠߠ2¡áġšơǡȡɡʡˡ̡͡ΡϡСѡҡӡԡա֡סء١ڡۡܡݡޡߡߡQ¢âĢŢƢǢǢȢɢʢˢ̢͢΢ϢТѢҢӢԢբ֢עآ٢ڢۢܢݢޢߢ((£ãģVţƣǣȣɣʣˣ̣ͣΣϣУѣңӣԣգ֣ףأ٣ڣۣۣܣݣޣߣkjjk- -----------¤äĤŤƤǤȤɤʤˤ{{{{{̤ͤͤΤϤФѤҤӤӤԤդ֤פؤ٤ڤۤܤܤݤޤߤt¥åĥťƥǥȥɥʥ˥̥ͥΥϥХѥҥӥԥե֥ץإ٥ڥۥܥݥޥߥ¦æĦŦƦǦȦɦʦ˦̦ͦΦϦЦѦҦӦԦզ֦צئ٦ڦۦܦݦަߦ~~v%%%%% %%%%ͤ%%%%%%% %% %%%%%%% %%%%%%%%%%%%%%%%%%%%%%%%%%%&&&&&&&&&&&&&&§&çħŧƧǧȧɧʧ˧̧ͧΧ ϧЧѧҧӧԧҧէ֧קاQ٧VqVڧ~ۧܧuݧxާߧwM0ghc-lib-parser-0.20220401-3F1kDYVQ1aUCvl7HWBPMHd GHC.PreludeGHC.Utils.TraceGHC.Utils.MonadGHC.Utils.FingerprintGHC.Utils.MiscGHC.Data.Stream GHC.Platform GHC.Unit.InfoGHC.Utils.ExceptionGHC.Data.IOEnvGHC.Core.TyCo.FVsGHC.Data.Graph.DirectedGHC.Data.Maybe GHC.BaseDirGHC.Data.SizedSeqGHC.Exts.Heap.ClosureTypesGHC.Exts.Heap.ConstantsGHC.Exts.Heap.InfoTable.TypesGHC.Exts.Heap.InfoTableGHC.Exts.Heap.InfoTableProfGHC.Exts.Heap.ProfInfo.Types4GHC.Exts.Heap.ProfInfo.PeekProfInfo_ProfilingEnabled5GHC.Exts.Heap.ProfInfo.PeekProfInfo_ProfilingDisabledGHC.Exts.Heap.Closures*GHC.Exts.Heap.FFIClosures_ProfilingEnabled+GHC.Exts.Heap.FFIClosures_ProfilingDisabledGHC.Exts.Heap.Utils GHC.Exts.HeapGHC.ForeignSrcLang.TypeGHC.ForeignSrcLangGHC.Iface.TypeGHC.LanguageExtensions.TypeGHC.LanguageExtensions GHC.LexemeGHC.Platform.ArchOSGHC.Platform.ConstantsGHC.Driver.PluginsGHC.Driver.HooksGHC.Data.StrictGHC.Data.SmallArrayGHC.Data.FiniteMapGHC.Data.FastMutInt GHC.Data.BoolGHC.Core.UnfoldGHC.Core.Opt.CallerCCGHC.Cmm.Dataflow.CollectionsGHC.Cmm.Dataflow.BlockGHC.Builtin.PrimOpsGHC.SerializedGHC.SysTools.TerminalGHC.Tc.Types.OriginGHC.Types.HpcInfoGHC.Unit.Module.NameGHC.Utils.CliOptionGHC.Utils.ConstantsGHC.Utils.EncodingGHC.Data.ShortTextGHC.Unit.DatabaseGHC.Utils.GlobalVarsGHC.Utils.IO.UnsafeGHC.Utils.Monad.State.StrictGHC.Utils.OutputableGHC.Unit.TypesGHC.Utils.Ppr.Colour GHC.VersionGHC.UniqueSubdirGHC.Settings.ConfigGHC.Utils.Panic.PlainGHC.Data.FastStringGHC.Utils.LexemeGHC.Utils.BufHandle GHC.Utils.PprGHC.Types.Name.OccurrenceGHC.Utils.PanicGHC.SysTools.BaseDirGHC.Parser.CharClassGHC.CmmToAsm.CFG.WeightGHC.Utils.Json GHC.Unit.PprGHC.Types.UniqueGHC.Types.Unique.SupplyGHC.Types.Unique.FMGHC.Types.Unique.MapGHC.Types.Unique.DFMGHC.Types.Unique.SetGHC.Types.Unique.SDFMGHC.Types.Unique.DSetGHC.Types.SrcLocGHC.Types.Id.InfoGHC.Tc.Types.RankGHC.Parser.Errors.Basic GHC.Data.PairGHC.Data.OrdListGHC.Data.List.SetOps GHC.Data.BagGHC.Types.NameGHC.Utils.BinaryGHC.Utils.Binary.TypeableGHC.Unit.Module.LocationGHC.Unit.ParserGHC.Unit.Module.EnvGHC.Driver.Env.KnotVarsGHC.Unit.ModuleGHC.Types.BreakInfo GHC.Unit.HomeGHC.Types.SourceTextGHC.Types.PkgQualGHC.Types.SourceFileGHC.Types.SafeHaskellGHC.Types.FixityGHC.Iface.Ext.FieldsGHC.Hs.DocStringGHC.Data.EnumSetGHC.Driver.Flags GHC.Types.Var GHC.Types.IdGHC.Core.TyConGHC.Types.TyThingGHC.Core.Coercion GHC.Core.TypeGHC.Core.TyCo.RepGHC.Tc.Utils.TcTypeGHC.Builtin.Types.PrimGHC.Core.TyCo.PprGHC.Types.ForeignCallGHC.Types.Basic GHC.SettingsGHC.Platform.WaysGHC.Platform.ProfileGHC.Runtime.Heap.LayoutGHC.Linker.Static.UtilsGHC.Driver.PhasesGHC.Driver.Backend GHC.Cmm.TypeGHC.Cmm.MachOpGHC.Cmm.CLabelGHC.Types.ForeignStubsGHC.Data.StringBufferGHC.Data.FastString.EnvGHC.Types.FieldLabelGHC.Core.DataConGHC.Builtin.TypesGHC.Types.CostCentre.StateGHC.Builtin.UniquesGHC.Types.Var.Set GHC.Utils.FVGHC.Types.Var.EnvGHC.Stg.InferTags.TagSigGHC.Types.Name.SetGHC.Types.Name.EnvGHC.Types.Fixity.EnvGHC.Types.CostCentreGHC.Types.AvailGHC.Types.Name.ReaderGHC.Unit.Module.ImportedGHC.Types.AnnotationsGHC.Parser.AnnotationGHC.Data.BooleanFormulaGHC.Iface.Recomp.BinaryGHC.Core.Coercion.AxiomGHC.Core.ClassGHC.Types.Id.MakeGHC.Platform.Reg.ClassGHC.Platform.RegGHC.Builtin.NamesGHC.Settings.ConstantsGHC.CoreToIfaceGHC.Core.TyCon.EnvGHC.Core.TyCon.RecWalkGHC.Core.MultiplicityGHC.Core.TyCo.TidyGHC.Core.TyCo.SubstGHC.Types.LiteralGHC.Data.TrieMapGHC.Cmm.Dataflow.LabelGHC.Cmm.SwitchGHC.Cmm.Dataflow.GraphGHC.Cmm.BlockIdGHC.Core.RoughMapGHC.Core.PatSynGHC.Core.UtilsGHC.Core.UsageEnvGHC.Core.PredicateGHC.Core.ReductionGHC.Core.Map.TypeGHC.Core.UnifyGHC.Core.FamInstEnvGHC.Types.RepTypeGHC.Types.Demand GHC.Types.CprGHC.StgToCmm.TypesGHC.Core.ConLikeGHC.Types.CompleteMatchGHCi.BinaryArrayGHCi.BreakArrayGHCi.FFIGHCi.RemoteTypesGHCi.ResolvedBCO!Language.Haskell.Syntax.ExtensionLanguage.Haskell.Syntax.ExprGHC.Types.TickishGHC.CoreGHC.Types.TypeEnvGHC.Types.Name.CacheGHC.Iface.SyntaxGHC.Core.StatsGHC.Core.SimpleOpt GHC.Core.Seq GHC.Core.PprGHC.Stg.Syntax GHC.Types.IPE GHC.Cmm.ExprGHC.Platform.X86_64GHC.Platform.X86GHC.Platform.S390XGHC.Platform.RISCV64GHC.Platform.PPCGHC.Platform.NoRegsGHC.Platform.ARMGHC.Platform.AArch64GHC.Platform.RegsGHC.ByteCode.TypesGHC.Core.Opt.ConstantFoldGHC.Core.Map.Expr GHC.Core.FVs GHC.Core.TidyGHC.Core.SubstGHC.Builtin.PrimOps.Ids GHC.Cmm.NodeGHC.CmmGHC.Hs.ExtensionGHC.Types.HintGHC.Types.ErrorGHC.Utils.LoggerGHC.Utils.ErrorGHC.Utils.TmpFsGHC.StgToCmm.ConfigGHC.Driver.Pipeline.MonadGHC.Driver.CmdLineGHC.Driver.SessionGHC.Unit.StateGHC.Unit.Module.DepsGHC.Unit.Finder.TypesGHC.Types.TargetGHC.Linker.TypesGHC.Tc.Types.Evidence GHC.Tc.TypesGHC.Core.InstEnvGHC.Unit.Module.ModDetailsGHC.Core.Coercion.OptGHC.Driver.PprGHC.Driver.Config.LoggerGHC.Driver.Config.DiagnosticGHC.Core.Opt.ArityGHC.Core.Opt.OccurAnalGHC.Core.Unfold.Make GHC.Hs.DocGHC.Unit.Module.WarningsGHC.Tc.Errors.Hole.FitTypes GHC.Hs.ImpExpLanguage.Haskell.Syntax.LitLanguage.Haskell.Syntax.PatLanguage.Haskell.Syntax.Type GHC.Hs.PatLanguage.Haskell.Syntax.BindsLanguage.Haskell.Syntax.DeclsLanguage.Haskell.TH.Lib.MapLanguage.Haskell.TH.SyntaxLanguage.Haskell.TH.PprLibLanguage.Haskell.TH.Ppr Language.Haskell.TH.Lib.InternalLanguage.Haskell.TH.Lib GHC.Hs.Expr GHC.Hs.Type GHC.Hs.Lit GHC.Hs.BindsGHC.Parser.Types GHC.Hs.DeclsGHC.Types.Hint.Ppr GHC.Hs.Utils GHC.Core.MakeGHC.Core.RulesGHC.Hs.InstancesGHC.HsGHC.Unit.Module.ModSummaryGHC.Unit.Module.GraphGHC.Unit.Module.ModIfaceGHC.Unit.Home.ModInfoGHC.Unit.External GHC.Unit.EnvGHC.Types.Name.PprGHC.Unit.Module.ModGutsGHC.Unit.Module.StatusGHC.Types.MetaGHC.Tc.Types.ConstraintGHC.Tc.Solver.TypesGHC.Tc.Solver.InertSetGHC.HsToCore.Pmc.Solver.TypesGHC.HsToCore.Pmc.TypesGHC.HsToCore.Pmc.PprGHC.Tc.Errors.TypesGHC.Tc.Errors.PprGHC.Parser.Errors.TypesGHC.Parser.Errors.PprGHC.Parser.LexerGHC.Parser.PostProcessGHC.Parser.HaddockLex GHC.ParserGHC.Parser.PostProcess.HaddockGHC.Driver.Config.ParserGHC.HsToCore.Errors.TypesGHC.Driver.Errors.TypesGHC.HsToCore.Errors.PprGHC.Driver.Errors.PprGHC.Types.SourceErrorGHC.Driver.Errors GHC.Hs.DumpGHC.Driver.Backpack.SyntaxGHC.Parser.HeaderGHCi.TH.Binary GHCi.MessageGHC.Runtime.Interpreter.TypesGHC.Runtime.InterpreterGHC.Runtime.Eval.TypesGHC.Runtime.ContextGHC.Driver.Env.TypesGHC.Driver.EnvGHC.Driver.MonadGHC.Core.Opt.Monad GHC.Core.LintGHC.Driver.Pipeline.PhasesGHC.Driver.Config#GHC.Exts.Heap.ProfInfo.PeekProfInfoGHC.Exts.Heap.FFIClosuresHeapc GhcExceptionSDocpprWithUnitState AnnKeywordIdAnnOpen AnnHeaderAnnValAnnClose Data.Listunconsheadtailnull cc_flavourputIfaceTopBndrgetIfaceTopBndrAnnType AnnBackquoteAnnTildeMxGHC.Tc.Gen.Exportexports_from_availAnnDeclfunTyCon mkTyConTyCoreMapAnnComma ModBreaksIdHsExprRdrNamesUniqueRdrName mkCoreApps mkCoreConApps mkIntExpr mkWordExpr mkCharExpr mkStringExpr mkFloatExpr mkDoubleExpr mkCoreLams mkCoreLets NoExtField SourceNoteCoreSyn mkCoreLetsubstTy Data.KindTypeDriverUnexpectedSignature PsWarnTabPsWarnOperatorWhitespaceDsMaxPmCheckModelsReachedDataKindPsWarnStarIsTypePsWarnImportPreQualifiedPsErrEmptyDoubleQuotesPsErrIllegalRoleNamePsWarnStarBinderPsErrInvalidTypeSignatureTcRnOrphanInstanceDerivBadErrConstructorTcRnForallIdentifierTcRnIncorrectNameSpaceTcRnTypeCannotBeMarshaled GHC.UtilsError GHC.StgToCmmConfigFloatOutSwitchesGHC.Driver.Pipeline setDumpPrefixGHCrunGhcGHC.UnittypeLevity_maybeGHC.ExtsoneShotHsImpExpIE AnnotationAnnBangAnnEqualAnnAt AnnDcolon AnnPattern AnnForallAnnDot AnnDarrow AnnDefaultAnnInfix AnnInstanceAnnVbarAnnSemi AnnLarrowAnnWhereGHC.Tc.Gen.Bind tcMonoBindsAnnFunIdAnnRole AnnModule AnnForeign AnnImport AnnExport AnnDerivingAnnStock AnnAnyClass AnnNewtypeAnnData AnnNewType AnnDotdotAnnCLose AnnRarrow AnnFamilyAnnOpenP AnnClosePAnnClass&Language.Haskell.TH.LanguageExtensions pprPatSynType thisModuledynLanguage.Haskell.THaddModFinalizerAnnThenAnnByAnnGroupAnnUsingAnnLetAnnRec Annlarrowtail Annrarrowtail AnnLarrowtail AnnRarrowtailAnnOpenB AnnCloseBAnnLamAnnCaseAnnOfAnnIfAnnElseAnnInAnnDoAnnColonAnnMinusAnnOpenE AnnOpenEQ AnnCloseQAnnProc AnnStaticLanguage.Haskell.SyntaxcvBindsAndSigstopSortModuleGraphloadGHC.Driver.Main HscNoRecomp GHC.Tc.Utils imp_dep_mods GHC.Tc.ErrorsmkFRRErrGHC.Tc.Solver.MonadInertSet ConPatOut mkErrorReportGHC.Tc.Utils.TcMTypecheckTypeHasFixedRuntimeRepMonadHeader GHC.DriverMakeprepareForeignCallSessiontcg_type_env_varTcGblEnv initGhcMonadGHC.Tc.Gen.ExprcheckClosedInStaticFormdecideGeneralisationPlanGHC.Runtime.LoaderinitializePluginsbaseGHC.Base++ghc-primGHC.PrimseqGHC.Listfilterzip System.IOprint Data.Tuplefstsnd otherwise Debug.Tracetracemap$GHC.Num fromInteger-GHC.Real fromRationalGHC.EnumenumFrom enumFromThen enumFromToenumFromThenTo GHC.Classes==>=negate>>=>>fmapreturnControl.Monad.FixmfixControl.Monad.Failfail fromIntegral realToFrac toInteger toRationalmemptymappendmconcat<*>pure*>BoundedEnumEq GHC.FloatFloating FractionalIntegralFunctorNumOrdGHC.ReadReadReal RealFloatRealFracGHC.ShowShowMonadFix MonadFail Applicative Data.FoldableFoldableData.Traversable Traversable SemigroupMonoid GHC.TypesBoolCharDoubleFloatIntinteger-wired-inGHC.Integer.TypeInteger GHC.MaybeMaybeOrderingRationalIOWord Data.EitherEitherFalseNothingJustTrueLeftRightLTEQGTGHC.Fingerprint.Type FingerprintsortWith Data.Data mkNoRepTypeControl.Monad.IO.ClassliftIOMonadIO GHC.ByteOrder LittleEndian BigEndian ByteOrder Control.Monad mapAndUnzipM Data.Version versionTags versionBranchVersionsequencemapM sequenceAtraverseGHC.Fingerprint getFileHashfingerprintData fingerprint0readIOreadLn appendFile writeFilereadFileinteract getContentsgetLinegetCharputStrLnputStrputCharControl.ExceptionallowInterruptcatchesHandlerControl.Exception.BasebracketOnErrorbracket_finallybracket onExceptiontryJusttry mapException handleJusthandle catchJustPatternMatchFail RecSelError RecConError RecUpdError NoMethodError TypeErrorNonTerminationNestedAtomically GHC.Conc.SyncthrowToGHC.IO.ExceptionioErrorasyncExceptionFromExceptionasyncExceptionToExceptionBlockedIndefinitelyOnMVarBlockedIndefinitelyOnSTMDeadlockAllocationLimitExceededCompactionFailedAssertionFailedSomeAsyncException UserInterrupt ThreadKilled HeapOverflow StackOverflowAsyncExceptionUndefinedElementIndexOutOfBoundsArrayException GHC.IORefIORefGHC.IOevaluateuninterruptibleMaskuninterruptibleMask_maskmask_getMaskingState interruptiblethrowIOcatchFilePathMaskedUninterruptibleMaskedInterruptibleUnmasked MaskingState userError IOExceptionIOError GHC.Exceptionthrow ErrorCallErrorCallWithLocationGHC.Exception.Type SomeExceptiondisplayException fromException toException ExceptionRatioZeroDenominatorDenormal DivideByZeroLossOfPrecision UnderflowOverflowArithExceptionnotElemallanyorand concatMapconcat sequence_mapM_foldlMfoldrMproductsumminimummaximumelemlengthfoldl1foldr1foldl'foldlfoldrfoldMapData.Semigroup.InternalappEndoEndo Data.OldListunwordswordsunlineslines Text.ReadreadreadseitherfingerprintFingerprintsfingerprintStringlex readParenreadList readsPrecText.ParserCombinators.ReadPReadSatanhacoshasinhtanhcoshsinhatanacosasintancossinlogBase**sqrtlogexppiatan2isIEEEisNegativeZeroisDenormalized isInfiniteisNaN scaleFloat significandexponent encodeFloat decodeFloat floatRange floatDigits floatRadix Data.BitstoIntegralSizedpopCountDefaulttestBitDefault bitDefaultpopCountrotateRrotateL unsafeShiftR unsafeShiftLisSignedbitSize bitSizeMaybetestBit complementBitclearBitsetBitbitzeroBitsrotateshift complementxor.|..&.BitscountTrailingZeroscountLeadingZeros finiteBitSize FiniteBitslcmgcd^^^oddevendivModquotRemmoddivremquotrecip/floorceilingroundtruncateproperFractionmaxBoundminBoundfromEnumtoEnumpredsucc showParen showStringshowCharshowsShowSshowListshow showsPrecunzip3unzipzipWith3zipWithzip3!!lookupreversebreakspansplitAtdroptake dropWhile takeWhilecycle replicaterepeatiteratescanr1scanrscanl1scanlfoldl1'initlast Data.Maybemaybe Data.Functor<$>uncurrycurrysubtractsignumabs*+asTypeOfuntil$!flip.constid=<<<$<*liftA2StringGHC.Err undefinederrorWithoutStackTraceerrorGHC.Stack.Types HasCallStackcompare<<=>maxmin/=&&||notcontainers-0.6.2.1 Data.Graph flattenSCC flattenSCCs CyclicSCC AcyclicSCCSCCtransformers-0.5.6.2Control.Monad.Trans.MaybeMaybeT runMaybeT expandTopDir expandPathVar getBaseDirSizedSeqemptySSaddToSS addListToSSssEltssizeSS$fNFDataSizedSeq$fBinarySizedSeq$fTraversableSizedSeq$fFoldableSizedSeq$fFunctorSizedSeq$fGenericSizedSeq$fShowSizedSeq ClosureTypeINVALID_OBJECTCONSTR CONSTR_1_0 CONSTR_0_1 CONSTR_2_0 CONSTR_1_1 CONSTR_0_2 CONSTR_NOCAFFUNFUN_1_0FUN_0_1FUN_2_0FUN_1_1FUN_0_2 FUN_STATICTHUNK THUNK_1_0 THUNK_0_1 THUNK_2_0 THUNK_1_1 THUNK_0_2 THUNK_STATICTHUNK_SELECTORBCOAPPAPAP_STACKIND IND_STATICRET_BCO RET_SMALLRET_BIGRET_FUN UPDATE_FRAME CATCH_FRAMEUNDERFLOW_FRAME STOP_FRAMEBLOCKING_QUEUE BLACKHOLE MVAR_CLEAN MVAR_DIRTYTVAR ARR_WORDSMUT_ARR_PTRS_CLEANMUT_ARR_PTRS_DIRTYMUT_ARR_PTRS_FROZEN_DIRTYMUT_ARR_PTRS_FROZEN_CLEAN MUT_VAR_CLEAN MUT_VAR_DIRTYWEAKPRIMMUT_PRIMTSOSTACK TREC_CHUNKATOMICALLY_FRAMECATCH_RETRY_FRAMECATCH_STM_FRAME WHITEHOLESMALL_MUT_ARR_PTRS_CLEANSMALL_MUT_ARR_PTRS_DIRTYSMALL_MUT_ARR_PTRS_FROZEN_DIRTYSMALL_MUT_ARR_PTRS_FROZEN_CLEANCOMPACT_NFDATAN_CLOSURE_TYPESclosureTypeHeaderSize$fEnumClosureType$fEqClosureType$fOrdClosureType$fShowClosureType$fGenericClosureType wORD_SIZEwORD_SIZE_IN_BITStAG_MASK StgInfoTableentryptrsnptrstipesrtlencode EntryFunPtrHalfWord ItblCodes$fShowStgInfoTable$fGenericStgInfoTablepeekItblpokeItblitblSize IndexTableit_ccit_ccsit_next it_back_edge CostCentrecc_ccIDcc_label cc_module cc_srcloc cc_mem_alloc cc_time_ticks cc_is_cafcc_linkCostCentreStack ccs_ccsIDccs_cc ccs_prevStackccs_indexTableccs_root ccs_depth ccs_scc_count ccs_selectedccs_time_ticks ccs_mem_allocccs_inherited_allocccs_inherited_ticksStgTSOProfInfocccs$fShowStgTSOProfInfo$fGenericStgTSOProfInfo$fEqStgTSOProfInfo$fOrdStgTSOProfInfo$fShowIndexTable$fGenericIndexTable$fEqIndexTable$fOrdIndexTable$fShowCostCentreStack$fGenericCostCentreStack$fEqCostCentreStack$fOrdCostCentreStack$fShowCostCentre$fGenericCostCentre$fEqCostCentre$fOrdCostCentrepeekStgTSOProfInfo peekTopCCSTsoFlags TsoLocked TsoBlockxTsoInterruptibleTsoStoppedOnBreakpoint TsoMarked TsoSqueezed TsoAllocLimitTsoFlagsUnknownValue WhyBlocked NotBlocked BlockedOnMVarBlockedOnMVarReadBlockedOnBlackHole BlockedOnReadBlockedOnWriteBlockedOnDelay BlockedOnSTMBlockedOnDoProcBlockedOnCCallBlockedOnCCall_InterruptibleBlockedOnMsgThrowToThreadMigratingWhyBlockedUnknownValueWhatNext ThreadRunGHCThreadInterpretThreadCompleteWhatNextUnknownValuePrimTypePIntPWordPInt64PWord64PAddrPFloatPDouble GenClosure ConstrClosure FunClosure ThunkClosureSelectorClosure PAPClosure APClosureAPStackClosure IndClosure BCOClosureBlackholeClosureArrWordsClosure MutArrClosureSmallMutArrClosure MVarClosure IOPortClosure MutVarClosureBlockingQueueClosure WeakClosure TSOClosure StackClosure IntClosure WordClosure Int64Closure Word64Closure AddrClosure FloatClosure DoubleClosure OtherClosureUnsupportedClosureinfoptrArgsdataArgspkgmodlnameselecteearityn_argsfunpayload indirecteeinstrsliteralsbcoptrssizebitmapbytesarrWordsmccPtrsmccSize mccPayload queueHead queueTailvaluevarlink blackHoleownerqueue cfinalizerskey finalizer global_linktsoStacktrecblocked_exceptionsbq what_next why_blockedflagsthreadId saved_errno tso_dirty alloc_limittot_stack_sizeprof stack_size stack_dirtyptipeintValwordValint64Val word64ValaddrValfloatVal doubleValhvaluesrawWordsClosureBoxasBox areBoxesEqual allClosures closureSize $fShowBox$fShowGenClosure$fGenericGenClosure$fFunctorGenClosure$fFoldableGenClosure$fTraversableGenClosure $fEqTsoFlags$fShowTsoFlags$fGenericTsoFlags $fOrdTsoFlags$fEqWhyBlocked$fShowWhyBlocked$fGenericWhyBlocked$fOrdWhyBlocked $fEqWhatNext$fShowWhatNext$fGenericWhatNext $fOrdWhatNext $fEqPrimType$fShowPrimType$fGenericPrimType $fOrdPrimType StackFieldsstack_sp TSOFields tso_what_nexttso_why_blocked tso_flags tso_threadIdtso_saved_errnotso_alloc_limittso_tot_stack_sizetso_prof peekTSOFields parseWhatNextparseWhyBlocked parseTsoFlagsisSetunsetpeekStackFields dataConNames HasHeapRepgetClosureDatagetClosureDataFromHeapRepgetClosureDataFromHeapRepPrimgetBoxedClosureData$fHasHeapRepDoubleRepa$fHasHeapRepFloatRepa$fHasHeapRepAddrRepa$fHasHeapRepWord64Repa$fHasHeapRepInt64Repa$fHasHeapRepWordRepa$fHasHeapRepIntRepa$fHasHeapRepUnliftedRepa$fHasHeapRepLiftedRepaForeignSrcLangLangCLangCxxLangObjc LangObjcxxLangAsm RawObject$fEqForeignSrcLang$fShowForeignSrcLang$fGenericForeignSrcLang$fBinaryForeignSrcLang IfaceBndr IfaceCoercion IfaceTyLit IfaceTyCon IfaceType IfaceAppArgs ExtensionCppOverlappingInstancesUndecidableInstancesIncoherentInstancesUndecidableSuperClassesMonomorphismRestrictionMonoLocalBindsRelaxedPolyRecExtendedDefaultRulesForeignFunctionInterfaceUnliftedFFITypesInterruptibleFFICApiFFIGHCForeignImportPrim JavaScriptFFIParallelArraysArrowsTemplateHaskellTemplateHaskellQuotes QualifiedDo QuasiQuotesImplicitParamsImplicitPreludeScopedTypeVariablesAllowAmbiguousTypes UnboxedTuples UnboxedSumsUnliftedNewtypesUnliftedDatatypes BangPatterns TypeFamiliesTypeFamilyDependencies TypeInTypeOverloadedStringsOverloadedLists NumDecimalsDisambiguateRecordFieldsRecordWildCardsNamedFieldPuns ViewPatternsGADTs GADTSyntaxNPlusKPatternsDoAndIfThenElseBlockArgumentsRebindableSyntaxConstraintKinds PolyKinds DataKinds InstanceSigs ApplicativeDo LinearTypesStandaloneDerivingDeriveDataTypeableAutoDeriveTypeable DeriveFunctorDeriveTraversableDeriveFoldable DeriveGenericDefaultSignaturesDeriveAnyClass DeriveLiftDerivingStrategies DerivingViaTypeSynonymInstancesFlexibleContextsFlexibleInstancesConstrainedClassMethodsMultiParamTypeClassesNullaryTypeClassesFunctionalDependencies UnicodeSyntaxExistentialQuantification MagicHashEmptyDataDeclsKindSignaturesRoleAnnotationsParallelListCompTransformListCompMonadComprehensionsGeneralizedNewtypeDeriving RecursiveDoPostfixOperators TupleSections PatternGuardsLiberalTypeSynonyms RankNTypesImpredicativeTypes TypeOperatorsExplicitNamespacesPackageImportsExplicitForAllAlternativeLayoutRule!AlternativeLayoutRuleTransitionalDatatypeContextsNondecreasingIndentation RelaxedLayoutTraditionalRecordSyntax LambdaCase MultiWayIfBinaryLiteralsNegativeLiteralsHexFloatLiteralsDuplicateRecordFieldsOverloadedLabels EmptyCasePatternSynonymsPartialTypeSignaturesNamedWildCardsStaticPointersTypeApplicationsStrict StrictDataEmptyDataDerivingNumericUnderscoresQuantifiedConstraints StarIsTypeImportQualifiedPostCUSKsStandaloneKindSignaturesLexicalNegationFieldSelectorsOverloadedRecordDotOverloadedRecordUpdate$fOrdExtension $fEqExtension$fEnumExtension$fShowExtension$fGenericExtension$fBoundedExtension$fBinaryExtension okSymChar startsVarSym startsConSym startsVarId startsConIdstartsVarSymASCII isVarSymCharOS OSUnknownOSLinuxOSDarwin OSSolaris2 OSMinGW32 OSFreeBSD OSDragonFly OSOpenBSDOSNetBSD OSKFreeBSDOSHaikuOSQNXNTOOSAIXOSHurd PPC_64ABIELF_V1ELF_V2ArmABISOFTSOFTFPHARD ArmISAExtVFPv2VFPv3VFPv3D16NEONIWMMX2ArmISAARMv5ARMv6ARMv7Arch ArchUnknownArchX86 ArchX86_64ArchPPC ArchPPC_64 ArchS390XArchARM ArchAArch64 ArchAlpha ArchMipseb ArchMipsel ArchRISCV64ArchJavaScriptArchOS archOS_arch archOS_OSstringEncodeArchstringEncodeOS $fReadArchOS $fShowArchOS $fEqArchOS $fOrdArchOS$fReadOS$fShowOS$fEqOS$fOrdOS $fReadArch $fShowArch$fEqArch $fOrdArch$fReadPPC_64ABI$fShowPPC_64ABI $fEqPPC_64ABI$fOrdPPC_64ABI $fReadArmABI $fShowArmABI $fEqArmABI $fOrdArmABI$fReadArmISAExt$fShowArmISAExt $fEqArmISAExt$fOrdArmISAExt $fReadArmISA $fShowArmISA $fEqArmISA $fOrdArmISAPlatformConstantspc_CONTROL_GROUP_CONST_291pc_STD_HDR_SIZEpc_PROF_HDR_SIZE pc_BLOCK_SIZEpc_BLOCKS_PER_MBLOCKpc_TICKY_BIN_COUNTpc_OFFSET_StgRegTable_rR1pc_OFFSET_StgRegTable_rR2pc_OFFSET_StgRegTable_rR3pc_OFFSET_StgRegTable_rR4pc_OFFSET_StgRegTable_rR5pc_OFFSET_StgRegTable_rR6pc_OFFSET_StgRegTable_rR7pc_OFFSET_StgRegTable_rR8pc_OFFSET_StgRegTable_rR9pc_OFFSET_StgRegTable_rR10pc_OFFSET_StgRegTable_rF1pc_OFFSET_StgRegTable_rF2pc_OFFSET_StgRegTable_rF3pc_OFFSET_StgRegTable_rF4pc_OFFSET_StgRegTable_rF5pc_OFFSET_StgRegTable_rF6pc_OFFSET_StgRegTable_rD1pc_OFFSET_StgRegTable_rD2pc_OFFSET_StgRegTable_rD3pc_OFFSET_StgRegTable_rD4pc_OFFSET_StgRegTable_rD5pc_OFFSET_StgRegTable_rD6pc_OFFSET_StgRegTable_rXMM1pc_OFFSET_StgRegTable_rXMM2pc_OFFSET_StgRegTable_rXMM3pc_OFFSET_StgRegTable_rXMM4pc_OFFSET_StgRegTable_rXMM5pc_OFFSET_StgRegTable_rXMM6pc_OFFSET_StgRegTable_rYMM1pc_OFFSET_StgRegTable_rYMM2pc_OFFSET_StgRegTable_rYMM3pc_OFFSET_StgRegTable_rYMM4pc_OFFSET_StgRegTable_rYMM5pc_OFFSET_StgRegTable_rYMM6pc_OFFSET_StgRegTable_rZMM1pc_OFFSET_StgRegTable_rZMM2pc_OFFSET_StgRegTable_rZMM3pc_OFFSET_StgRegTable_rZMM4pc_OFFSET_StgRegTable_rZMM5pc_OFFSET_StgRegTable_rZMM6pc_OFFSET_StgRegTable_rL1pc_OFFSET_StgRegTable_rSppc_OFFSET_StgRegTable_rSpLimpc_OFFSET_StgRegTable_rHppc_OFFSET_StgRegTable_rHpLimpc_OFFSET_StgRegTable_rCCCS!pc_OFFSET_StgRegTable_rCurrentTSO%pc_OFFSET_StgRegTable_rCurrentNurserypc_OFFSET_StgRegTable_rHpAllocpc_OFFSET_stgEagerBlackholeInfopc_OFFSET_stgGCEnter1pc_OFFSET_stgGCFunpc_OFFSET_Capability_rpc_OFFSET_bdescr_startpc_OFFSET_bdescr_freepc_OFFSET_bdescr_blockspc_OFFSET_bdescr_flagspc_SIZEOF_CostCentreStack#pc_OFFSET_CostCentreStack_mem_alloc pc_REP_CostCentreStack_mem_alloc#pc_OFFSET_CostCentreStack_scc_count pc_REP_CostCentreStack_scc_countpc_OFFSET_StgHeader_ccspc_OFFSET_StgHeader_ldvwpc_SIZEOF_StgSMPThunkHeaderpc_OFFSET_StgEntCounter_allocspc_REP_StgEntCounter_allocspc_OFFSET_StgEntCounter_allocdpc_REP_StgEntCounter_allocd#pc_OFFSET_StgEntCounter_registeredppc_OFFSET_StgEntCounter_link#pc_OFFSET_StgEntCounter_entry_countpc_SIZEOF_StgUpdateFrame_NoHdrpc_SIZEOF_StgMutArrPtrs_NoHdrpc_OFFSET_StgMutArrPtrs_ptrspc_OFFSET_StgMutArrPtrs_size"pc_SIZEOF_StgSmallMutArrPtrs_NoHdr!pc_OFFSET_StgSmallMutArrPtrs_ptrspc_SIZEOF_StgArrBytes_NoHdrpc_OFFSET_StgArrBytes_bytespc_OFFSET_StgTSO_alloc_limitpc_OFFSET_StgTSO_cccspc_OFFSET_StgTSO_stackobjpc_OFFSET_StgStack_sppc_OFFSET_StgStack_stack pc_OFFSET_StgUpdateFrame_updatee"pc_OFFSET_StgFunInfoExtraFwd_aritypc_REP_StgFunInfoExtraFwd_aritypc_SIZEOF_StgFunInfoExtraRev"pc_OFFSET_StgFunInfoExtraRev_aritypc_REP_StgFunInfoExtraRev_aritypc_MAX_SPEC_SELECTEE_SIZEpc_MAX_SPEC_AP_SIZEpc_MIN_PAYLOAD_SIZEpc_MIN_INTLIKEpc_MAX_INTLIKEpc_MIN_CHARLIKEpc_MAX_CHARLIKEpc_MUT_ARR_PTRS_CARD_BITSpc_MAX_Vanilla_REGpc_MAX_Float_REGpc_MAX_Double_REGpc_MAX_Long_REGpc_MAX_XMM_REGpc_MAX_Real_Vanilla_REGpc_MAX_Real_Float_REGpc_MAX_Real_Double_REGpc_MAX_Real_XMM_REGpc_MAX_Real_Long_REGpc_RESERVED_C_STACK_BYTESpc_RESERVED_STACK_WORDSpc_AP_STACK_SPLIM pc_WORD_SIZE pc_CINT_SIZE pc_CLONG_SIZEpc_CLONG_LONG_SIZEpc_BITMAP_BITS_SHIFT pc_TAG_BITS pc_LDV_SHIFTpc_ILDV_CREATE_MASKpc_ILDV_STATE_CREATEpc_ILDV_STATE_USEpc_USE_INLINE_SRT_FIELDparseConstantsHeader$fShowPlatformConstants$fReadPlatformConstants$fEqPlatformConstants$fOrdPlatformConstantsshiftLshiftR StaticPlugin LoadedPluginPluginsPlugin emptyPlugins ContainsHooks extractHooksHasHooksgetHooksHooks emptyHooksPairAnd fromMaybe$fAlternativeMaybe$fApplicativeMaybe $fMonoidMaybe$fSemigroupMaybe$fEqPair $fOrdPair $fShowPair $fFunctorPair$fFoldablePair$fTraversablePair $fDataPair $fEqMaybe $fOrdMaybe $fShowMaybe$fFunctorMaybe$fFoldableMaybe$fTraversableMaybe $fDataMaybeStreamSYieldDoneEffectStreamrunStreamInternal runStreamyieldcollectconsumefromList mapAccumL_$fMonadStreamS$fApplicativeStreamS$fFunctorStreamS$fMonadIOStream $fMonadStream$fApplicativeStream$fFunctorStreamSmallMutableArray SmallArray newSmallArraywriteSmallArrayfreezeSmallArrayunsafeFreezeSmallArrayindexSmallArray listToArray insertListinsertListWith deleteList foldRightfoldRightWithKey FastMutInt newFastMutIntreadFastMutIntwriteFastMutIntatomicFetchAddFastMutOverridingBoolAutoNeverAlways overrideWith$fShowOverridingBool$fReadOverridingBool$fEqOverridingBool$fOrdOverridingBool$fEnumOverridingBool$fBoundedOverridingBool UnfoldingOptsupdateCaseScalingupdateCaseThresholdupdateVeryAggressiveupdateDictDiscountupdateFunAppDiscountupdateUseThresholdupdateCreationThresholddefaultUnfoldingOptsCallerCcFilterparseCallerCcFilter UniqueMap UniqueSetIsMapKeyOfmapNullmapSize mapMember mapLookupmapFindWithDefaultmapEmpty mapSingleton mapInsert mapInsertWith mapDeletemapAlter mapAdjustmapUnionmapUnionWithKey mapDifferencemapIntersection mapIsSubmapOfmapMap mapMapWithKeymapFoldlmapFoldrmapFoldlWithKeymapFoldMapWithKey mapFiltermapFilterWithKeymapElemsmapKeys mapToList mapFromListmapFromListWithIsSetElemOfsetNullsetSize setMembersetEmpty setSingleton setInsert setDeletesetUnion setDifferencesetIntersection setIsSubsetOf setFiltersetFoldlsetFoldrsetElems setFromList setInsertList setDeleteList setUnions mapInsertList mapDeleteList mapUnions$fIsSetUniqueSet$fIsMapUniqueMap $fEqUniqueMap$fOrdUniqueMap$fShowUniqueMap$fFunctorUniqueMap$fFoldableUniqueMap$fTraversableUniqueMap $fEqUniqueSet$fOrdUniqueSet$fShowUniqueSet$fSemigroupUniqueSet$fMonoidUniqueSetBlockBlockCOBlockCCBlockOCBNilBMiddleBCatBSnocBConsMaybeOJustONothingO IndexedCOCO ExtensibilityOpenClosed isEmptyBlock emptyBlock blockCons blockSnoc blockJoinHead blockJoinTail blockJoin blockAppend firstNodelastNodeblockSplitHeadblockSplitTail blockSplit blockToList blockFromListreplaceFirstNodereplaceLastNodemapBlock mapBlock' mapBlock3'foldBlockNodesFfoldBlockNodesB3foldBlockNodesB$fFunctorMaybeOPrimOp Serialized toSerializedfromSerializedserializeWithDatadeserializeWithDatastderrSupportsAnsiColors SkolemInfoSkolemInfoAnonunkSkol AnyHpcUsageHpcInfo NoHpcInfohpcInfoTickCount hpcInfoHashhpcUsed emptyHpcInfo isHpcUsed ModuleNameOption FileOptionshowOpt $fEqOption ghciSupported debugIsOn isWindowsHost isDarwinHostutf8DecodeCharAddr#utf8DecodeChar utf8PrevChar utf8CharStartutf8DecodeByteStringutf8UnconsByteStringutf8DecodeStringLazyutf8CompareShortByteStringutf8DecodeShortByteStringcountUTF8Charsutf8EncodeCharutf8EncodeStringutf8EncodeStringPtrutf8EncodeShortByteStringutf8EncodedLength zEncodeString zDecodeStringtoBase62PaddedtoBase62 ShortTextcontentscodepointLength byteLengthpackunpack splitFilePath stripPrefix$fIsStringShortText$fShowShortText $fEqShortText$fOrdShortText$fBinaryShortText$fSemigroupShortText$fMonoidShortText$fNFDataShortText DbOpenModeDbOpenReadOnlyDbOpenReadWriteDbMode DbReadOnly DbReadWrite PackageDbLock DbInstUnitIdDbUnitIdDbModule DbModuleVardbModuleUnitId dbModuleNamedbModuleVarNameGenericUnitInfounitIdunitInstanceOfunitInstantiations unitPackageIdunitPackageNameunitPackageVersionunitComponentName unitAbiHash unitDependsunitAbiDependsunitImportDirs unitLibrariesunitExtDepLibsSysunitExtDepLibsGhcunitLibraryDirsunitLibraryDynDirsunitExtDepFrameworksunitExtDepFrameworkDirsunitLinkerOptions unitCcOptions unitIncludesunitIncludeDirsunitHaddockInterfacesunitHaddockHTMLsunitExposedModulesunitHiddenModulesunitIsIndefinite unitIsExposed unitIsTrusted DbUnitInfomapGenericUnitInfo lockPackageDbunlockPackageDbisDbOpenReadModereadPackageDbForGhcreadPackageDbForGhcPkgwritePackageDbmkMungePathUrlmungeUnitInfoPaths$fBinaryDbInstUnitId$fBinaryDbModule$fBinaryGenericUnitInfo$fEqDbInstUnitId$fShowDbInstUnitId $fEqDbModule$fShowDbModule$fEqGenericUnitInfo$fShowGenericUnitInfo$fTraversableDbOpenMode$fFoldableDbOpenMode$fFunctorDbOpenModeExceptionMonadcatchIOhandleIOtryIOreadHexFingerprintfingerprintByteStringv_unsafeHasPprDebugv_unsafeHasNoDebugOutputv_unsafeHasNoStateHackunsafeHasPprDebugunsafeHasNoDebugOutputunsafeHasNoStateHackglobal consIORefglobalM sharedGlobal sharedGlobalMinlinePerformIO zipWith3M zipWith3M_ zipWith4MzipWithAndUnzipM mapAndUnzip3M mapAndUnzip4M mapAndUnzip5M mapAccumLMmapSndMliftFstMliftSndM concatMapM mapMaybeM fmapMaybeM fmapEitherManyMallMorMfoldlM_ maybeMapMwhenMunlessM filterOutMStatestategetgetsputmodify evalState execStaterunState $fMonadState$fApplicativeState$fFunctorState SDocContextPprStyletextUnitModuleGenUnit GenModuleUnitId pprModule moduleUnit moduleNameSchemesHeadersMessagesWarningsErrorsFatalsMargin PprColour renderColourrenderColourAfresh colCustomcolResetcolBold colBlackFgcolRedFg colGreenFg colYellowFg colBlueFg colMagentaFg colCyanFg colWhiteFg defaultScheme parseScheme$fMonoidPprColour$fSemigroupPprColourcProjectGitCommitIdcProjectVersioncProjectVersionIntcProjectPatchLevelcProjectPatchLevel1cProjectPatchLevel2 uniqueSubdircBuildPlatformStringcHostPlatformString cProjectNamecBooterVersioncStagePlainGhcException PlainSignalPlainUsageErrorPlainCmdLineError PlainPanic PlainSorryPlainInstallationErrorPlainProgramErrorshowPlainGhcExceptionpanicsorrypgmError cmdLineErrorcmdLineErrorIO assertPanicassertmassertassertM$fShowPlainGhcException$fExceptionPlainGhcExceptionHasDebugCallStack DirectionForwards BackwardsSuffix applyWhennTimesconst2fstOf3sndOf3thdOf3fst3snd3third3uncurry3liftFstliftSndfirstMfirst3MsecondM filterOut partitionWith chkAppendzipEqual zipWithEqual zipWith3Equal zipWith4EqualzipLazy zipWithLazy zipWith3Lazy filterByList filterByListspartitionByListstretchZipWithmapFstmapSnd mapAndUnzip mapAndUnzip3zipWithAndUnzip zipAndUnzipatLength lengthExceeds lengthAtLeastlengthIs lengthIsNot lengthAtMostlengthLessThan listLengthCmp equalLength compareLengthleLengthltLength singleton isSingletonnotNullonly expectOnly chunkList changeLastmapLastM mapAccumM whenNonEmpty mergeListsBy isSortedByminWithnubSortordNubordNubOntransitiveClosurefoldl2all2count countWhiletakeListdropList splitAtListdropTaildropWhileEndLEspanEndlast2 lastMaybeonJustsnocViewsplit capitaliseisEqualthenCmpeqListBy eqMaybeBycmpList removeSpaces<&&><||> fuzzyMatch fuzzyLookup unzipWithseqList strictMap strictZipWithstrictZipWith3looksLikeModuleNamelooksLikePackageName exactLog2 readRationalreadSignificandExponentPairreadHexRationalreadHexSignificandExponentPairdoesDirNameExistgetModificationUTCTimemodificationTimeIfExistsfileHashIfExistswithAtomicRenamesplitLongestPrefix escapeSpacesreslashmakeRelativeToabstractConstrabstractDataTypecharToC hashString mapMaybe'MaybeErr SucceededFailed firstJust firstJusts firstJustsM expectJust whenIsJustorElse rightToMaybe liftMaybeT tryMaybeT isSuccessfailME$fMonadMaybeErr$fApplicativeMaybeErr$fFunctorMaybeErr PtrStringLexicalFastStringNonDetFastString FastStringuniqn_charsfs_sbsfs_zenc FastZStringbytesFSfastStringToByteStringfastStringToShortByteStringfastZStringToByteStringunsafeMkByteStringhPutFZSzString lengthFZSlexicalCompareFS uniqCompareFS mkFastString#mkFastStringBytesmkFastStringByteStringmkFastStringShortByteString mkFastStringmkFastStringByteListlengthFSnullFSunpackFS zEncodeFSappendFSconcatFSheadFSconsFSunconsFS uniqueOfFSnilFSisUnderscoreFSgetFastStringTablegetFastStringZEncCounterhPutFS mkPtrString# mkPtrStringunpackPtrStringlengthPSfsLit$fNFDataFastString$fDataFastString$fShowFastString$fMonoidFastString$fSemigroupFastString$fIsStringFastString$fEqFastString$fOrdNonDetFastString$fOrdLexicalFastString$fEqLexicalFastString$fShowLexicalFastString$fDataLexicalFastString$fEqNonDetFastString$fShowNonDetFastString$fDataNonDetFastString$fNFDataFastZStringisLexConisLexVarisLexIdisLexSym isLexConId isLexVarId isLexConSym isLexVarSymokVarOccokConOccokTcOcc okVarIdOcc okVarSymOcc okConIdOcc okConSymOcc BufHandle newBufHandlebPutCharbPutStrbPutFSbPutFZS bPutPtrString bPutReplicatebFlushModePageMode ZigZagModeLeftMode OneLineMode asciiSpaceStylemode lineLengthribbonsPerLine TextDetailsChrStrPStrZStrLStrRStrDoccharftextptextztext sizedText zeroWidthText emptyTextemptyisEmptysemicommacolonspaceequalslparenrparenlbrackrbracklbracerbraceintintegerfloatdoublerationalhexquotesquote doubleQuotesparensbracketsbraces maybeParenshcathsepvcatnesthang hangNotEmpty punctuate$$$+$<><+>sepcatfcatfsepstyle renderStyle txtPrinter fullRenderprintDoc printDoc_ bufLeftRender $fShowDoc HasOccNameoccNameOccName mkVarOccFSmkRecFldSelOcc occNameStringOutputableBndrpprBndr pprPrefixOcc pprInfixOccbndrIsJoin_maybe BindingSite LambdaBindCaseBind CasePatBindLetBindPDoc OutputablePpdoc OutputablepprSDC sdocStyle sdocColSchemesdocLastColoursdocShouldUseColorsdocDefaultDepthsdocLineLengthsdocCanUseUnicodesdocHexWordLiterals sdocPprDebugsdocPrintUnicodeSyntaxsdocPrintCaseAsLetsdocPrintTypecheckerElaborationsdocPrintAxiomIncompssdocPrintExplicitKindssdocPrintExplicitCoercionssdocPrintExplicitRuntimeRepssdocPrintExplicitForallssdocPrintPotentialInstancessdocPrintEqualityRelationssdocSuppressTickssdocSuppressTypeSignaturessdocSuppressTypeApplicationssdocSuppressIdInfosdocSuppressCoercionssdocSuppressUnfoldingssdocSuppressVarKindssdocSuppressUniquessdocSuppressModulePrefixessdocSuppressStgExtssdocErrorSpanssdocStarIsTypesdocLinearTypessdocImpredicativeTypessdocPrintTypeAbbreviationssdocUnitIdForUser QualifyName NameUnqualNameQualNameNotInScope1NameNotInScope2QueryQualifyPackageQueryQualifyModuleQueryQualifyNamePrintUnqualified QueryQualifyqueryQualifyNamequeryQualifyModulequeryQualifyPackageDepth AllTheWayPartWay DefaultDepth LabelStyleCStyleAsmStylePprUserPprDumpPprCodereallyAlwaysQualifyNamesalwaysQualifyNamesneverQualifyNamesalwaysQualifyModulesneverQualifyModulesalwaysQualifyPackagesneverQualifyPackagesreallyAlwaysQualify alwaysQualify neverQualifydefaultUserStyledefaultDumpStyle mkDumpStyledefaultErrStyle mkErrStylecmdlineParserStyle mkUserStyle withUserStyle withErrStylesetStyleColouredrunSDocdefaultSDocContext withPprStyle pprDeeper pprDeeperList pprSetDepth getPprStylesdocWithContext sdocOptionupdSDocContextqualName qualModule qualPackage queryQual codeStyleasmStyle dumpStyle userStyle getPprDebug ifPprDebug whenPprDebug printSDoc printSDocLnbufLeftRenderSDocpprCoderenderWithContextshowSDocOneLineshowSDocUnsafe showPprUnsafepprDebugAndThen docToSDocword doublePrec angleBracketscparen blankLinedcolonarrowlollipoplarrowdarrowarrowtlarrowtarrowttlarrowttlambda underscoredotvbarmulArrow forAllLitbullet unicodeSyntaxppWhenppUnless ppWhenOptionppUnlessOptioncolouredkeyword pprHsChar pprHsString pprHsBytesprimCharSuffixprimFloatSuffix primIntSuffixprimDoubleSuffixprimWordSuffixprimInt8SuffixprimWord8SuffixprimInt16SuffixprimWord16SuffixprimInt32SuffixprimWord32SuffixprimInt64SuffixprimWord64Suffix pprPrimChar pprPrimInt pprPrimWord pprPrimInt8 pprPrimInt16 pprPrimInt32 pprPrimInt64 pprPrimWord8 pprPrimWord16 pprPrimWord32 pprPrimWord64 pprPrefixVar pprInfixVarpprFastFilePathpprFilePathString pprWithCommas pprWithBars interppSP interpp'SP interpp'SP' pprQuotedListquotedListWithOrquotedListWithNor intWithCommasspeakNthspeakNspeakNOfpluralsingularisOrAredoOrDoes itsOrTheir thisOrThese hasOrHave$fIsStringSDoc$fOutputableExtension$fOutputableSerialized$fOutputableSCC$fOutputableFingerprint$fOutputableIntMap$fOutputableMap$fOutputableFastString$fOutputable(,,,,,,)$fOutputable(,,,,,)$fOutputable(,,,,)$fOutputable(,,,)$fOutputable(,,)$fOutputableEither$fOutputableMaybe$fOutputable(,)$fOutputableIntSet$fOutputableSet$fOutputableNonEmpty$fOutputable[]$fOutputableUTCTime$fOutputable()$fOutputableDouble$fOutputableFloat$fOutputableWord$fOutputableWord64$fOutputableWord32$fOutputableWord16$fOutputableInteger$fOutputableInt$fOutputableInt64$fOutputableInt32$fOutputableOrdering$fOutputableBool$fOutputableChar$fOutputableSDoc$fOutputablePprStyle$fOutputableQualifyName$fOutputablePenvSet$fOutputablePenvSDoc$fOutputablePenvSCC$fOutputablePenvMap$fOutputablePenv(,,)$fOutputablePenv(,)$fOutputablePenvMaybe$fOutputablePenv[]$fOutputablePenvPDoc$fEqLabelStyle$fOrdLabelStyle$fShowLabelStyle$fOutputableLexicalFastString$fOutputableNonDetFastStringSignal UsageError CmdLineErrorPanicPprPanicSorryPprSorryInstallationError ProgramErrorPprProgramError showExceptionsafeShowExceptionshowGhcExceptionUnsafeshowGhcExceptionthrowGhcExceptionthrowGhcExceptionIOhandleGhcExceptionpprPanicpanicDocsorryDoc pgmErrorDoctryMostwithSignalHandlers callStackDocprettyCallStackDocassertPprPanic assertPpr massertPpr assertPprM$fShowGhcException$fExceptionGhcExceptionpprTrace pprTraceM pprTraceDebug pprTraceWith pprTraceItpprTraceException pprSTrace warnPprTracepprTraceUserWarning expandToolDir findTopDir tryFindTopDir findToolDiris_ident is_symbolis_anyis_spaceis_loweris_upperis_digit is_alphanumhexDigit octDecDigit is_decdigit is_hexdigit is_octdigit is_bindigitWeights uncondWeightcondBranchWeight switchWeight callWeightlikelyCondWeightunlikelyCondWeightinfoTablePenalty backEdgeBonusdefaultWeights parseWeightsToJsonjsonJsonDocJSNullJSBoolJSIntJSStringJSArrayJSObject renderJSONescapeJsonString $fToJsonInt $fToJson[] UnitPprInfo unitPprIdunitPprPackageNameunitPprPackageVersionunitPprComponentName$fOutputableUnitPprInfo Uniquable getUnique uNIQUE_BITSmkUniqueGrimilygetKey incrUnique stepUnique mkLocalUniqueminLocalUniquemaxLocalUnique newTagUniquemkUnique unpkUniqueisValidKnownKeyUniquehasKeyeqUniqueltUniquenonDetCmpUniquepprUniqueAlways $fShowUnique$fOutputableUnique $fEqUnique$fUniquableUnique$fUniquableInt$fUniquableFastString MonadUniquegetUniqueSupplyM getUniqueM getUniquesMUniqSM UniqSupplymkSplitUniqSupplyinitUniqSupply uniqFromMasksplitUniqSupplylistSplitUniqSupplyuniqFromSupplyuniqsFromSupplytakeUniqFromSupplyinitUsinitUs_$fMonadFixUniqSM$fMonadFailUniqSM$fApplicativeUniqSM $fMonadUniqSM$fFunctorUniqSM$fMonadUniqueUniqSM NonDetUniqFM getNonDetUniqFMemptyUFM isNullUFMunitUFMunitDirectlyUFMzipToUFM listToUFMlistToUFM_DirectlylistToIdentityUFM listToUFM_CaddToUFM addListToUFMaddListToUFM_DirectlyaddToUFM_Directly addToUFM_C addToUFM_AccalterUFMaddListToUFM_C adjustUFMadjustUFM_Directly delFromUFMdelListFromUFMdelListFromUFM_DirectlydelFromUFM_DirectlyplusUFM plusUFM_C plusUFM_CD plusUFM_CD2mergeUFMplusMaybeUFM_C plusUFMListsequenceUFMListminusUFM minusUFM_C intersectUFMintersectUFM_C disjointUFMfoldUFMmapUFM mapMaybeUFMmapUFM_Directly filterUFMfilterUFM_Directly partitionUFMsizeUFMelemUFMelemUFM_Directly lookupUFMlookupUFM_DirectlylookupWithDefaultUFMlookupWithDefaultUFM_DirectlyufmToSet_DirectlyanyUFMallUFM seqEltsUFM nonDetEltsUFM nonDetKeysUFMnonDetStrictFoldUFMnonDetStrictFoldUFM_DirectlyMnonDetStrictFoldUFM_DirectlynonDetUFMToList ufmToIntMapunsafeIntMapToUFMunsafeCastUFMKey equalKeysUFM pprUniqFMpprUFMpprUFMWithKeys pluralUFM$fOutputableUniqFM$fMonoidUniqFM$fSemigroupUniqFM$fTraversableNonDetUniqFM$fFoldableNonDetUniqFM$fFunctorNonDetUniqFM $fDataUniqFM $fEqUniqFM$fFunctorUniqFMUniqMap emptyUniqMap isNullUniqMap unitUniqMap listToUniqMaplistToUniqMap_C addToUniqMapaddListToUniqMapaddToUniqMap_CaddToUniqMap_Acc alterUniqMapaddListToUniqMap_C adjustUniqMapdelFromUniqMapdelListFromUniqMap plusUniqMap plusUniqMap_CplusMaybeUniqMap_CplusUniqMapList minusUniqMapintersectUniqMapdisjointUniqMap mapUniqMap filterUniqMappartitionUniqMap sizeUniqMap elemUniqMap lookupUniqMaplookupWithDefaultUniqMap anyUniqMap allUniqMapnonDetEltsUniqMapnonDetFoldUniqMap$fOutputableUniqMap$fMonoidUniqMap$fSemigroupUniqMap $fDataUniqMap $fEqUniqMap$fFunctorUniqMapUniqDFM emptyUDFMunitUDFM addToUDFMaddToUDFM_DirectlyaddToUDFM_C_Directly addToUDFM_C addListToUDFM delFromUDFM plusUDFM_CplusUDFM lookupUDFMlookupUDFM_DirectlyelemUDFMfoldUDFMnonDetStrictFoldUDFMeltsUDFM filterUDFMfilterUDFM_DirectlyudfmRestrictKeys udfmToList equalKeysUDFM isNullUDFMsizeUDFM intersectUDFMudfmIntersectUFM disjointUDFMdisjointUdfmUfm minusUDFM udfmMinusUFM ufmMinusUDFM partitionUDFMdelListFromUDFM udfmToUfm listToUDFMlistToUDFM_Directly adjustUDFMadjustUDFM_Directly alterUDFMmapUDFM mapMaybeUDFManyUDFMallUDFMalwaysUnsafeUfmToUdfmunsafeCastUDFMKey pprUniqDFMpprUDFM $fEqTaggedVal$fOutputableUniqDFM$fTraversableUniqDFM$fFoldableUniqDFM $fDataUniqDFM$fFunctorUniqDFM$fDataTaggedVal$fFunctorTaggedVal$fFoldableTaggedVal$fTraversableTaggedValUniqSet emptyUniqSet unitUniqSet mkUniqSetaddOneToUniqSetaddListToUniqSetdelOneFromUniqSetdelOneFromUniqSet_DirectlydelListFromUniqSetdelListFromUniqSet_Directly unionUniqSetsunionManyUniqSets minusUniqSetintersectUniqSetsdisjointUniqSetsrestrictUniqSetToUFMuniqSetMinusUFMuniqSetMinusUDFMelementOfUniqSetelemUniqSet_Directly filterUniqSetfilterUniqSet_DirectlypartitionUniqSet uniqSetAny uniqSetAll sizeUniqSetisEmptyUniqSet lookupUniqSetlookupUniqSet_DirectlynonDetEltsUniqSetnonDetKeysUniqSetnonDetStrictFoldUniqSet mapUniqSet getUniqSetunsafeUFMToUniqSet pprUniqSet$fOutputableUniqSet $fEqUniqSet $fDataUniqSet$fSemigroupUniqSet$fMonoidUniqSetUniqSDFM emptyUSDFM lookupUSDFM equateUSDFM addToUSDFM traverseUSDFM$fOutputableShared$fOutputableUniqSDFMUniqDSet emptyUniqDSet unitUniqDSet mkUniqDSetaddOneToUniqDSetaddListToUniqDSetdelOneFromUniqDSetdelListFromUniqDSetunionUniqDSetsunionManyUniqDSets minusUniqDSetuniqDSetMinusUniqSetintersectUniqDSetsuniqDSetIntersectUniqSetnonDetStrictFoldUniqDSetelementOfUniqDSetfilterUniqDSet sizeUniqDSetisEmptyUniqDSetlookupUniqDSetuniqDSetToListpartitionUniqDSet mapUniqDSet getUniqDSet pprUniqDSet$fOutputableUniqDSet $fEqUniqDSet$fDataUniqDSet LayoutInfoExplicitBraces VirtualBraces NoLayoutInfo PsLocatedPsSpan psRealSpan psBufSpanPsLoc psRealLocpsBufPos RealLocatedLocated GenLocatedLUnhelpfulSpanReasonUnhelpfulNoLocationInfoUnhelpfulWiredInUnhelpfulInteractiveUnhelpfulGeneratedUnhelpfulOtherSrcSpan RealSrcSpan UnhelpfulSpanBufSpan bufSpanStart bufSpanEnd srcSpanFileSrcLoc RealSrcLoc UnhelpfulLocBufPosbufPosmkSrcLoc mkRealSrcLoc getBufPosnoSrcLocgeneratedSrcLocinteractiveSrcLocmkGeneralSrcLoc srcLocFile srcLocLine srcLocCol advanceSrcLoc advanceBufPos sortLocatedsortRealLocated lookupSrcLoc lookupSrcSpan getBufSpan noSrcSpanwiredInSrcSpaninteractiveSrcSpangeneratedSrcSpanisGeneratedSrcSpanmkGeneralSrcSpan srcLocSpanrealSrcLocSpan mkRealSrcSpan mkSrcSpancombineSrcSpanscombineRealSrcSpanssrcSpanFirstCharacter isGoodSrcSpan isOneLineSpanisZeroWidthSpan containsSpansrcSpanStartLinesrcSpanEndLinesrcSpanStartCol srcSpanEndCol srcSpanStart srcSpanEndrealSrcSpanStartrealSrcSpanEndsrcSpanFileName_maybesrcSpanToRealSrcSpanunhelpfulSpanFSpprUnhelpfulSpanReason pprUserSpanpprUserRealSpanmapLocunLocgetLocnoLocmkGeneralLocated combineLocsaddCLoc eqLocated cmpLocated cmpBufSpan pprLocatedpprLocatedAlwaysrightmost_smallestleftmost_smallestleftmost_largestspans isSubspanOfisRealSubspanOfliftLgetRealSrcSpan unRealSrcSpanpsLocatedToLocated advancePsLocmkPsSpan psSpanStart psSpanEnd mkSrcSpanPsleftmostColumn$fShowRealSrcLoc$fOutputableRealSrcLoc$fOutputableSrcLoc$fOutputableRealSrcSpan$fShowRealSrcSpan$fOrdRealSrcSpan$fToJsonRealSrcSpan$fDataRealSrcSpan$fSemigroupBufSpan$fOutputableUnhelpfulSpanReason$fOutputableSrcSpan$fNFDataSrcSpan$fToJsonSrcSpan $fDataSrcSpan$fOutputableGenLocated$fOutputableGenLocated0$fEqLayoutInfo$fOrdLayoutInfo$fShowLayoutInfo$fDataLayoutInfo $fEqPsSpan $fOrdPsSpan $fShowPsSpan $fDataPsSpan $fEqPsLoc $fOrdPsLoc $fShowPsLoc$fEqGenLocated$fOrdGenLocated$fShowGenLocated$fDataGenLocated$fFunctorGenLocated$fFoldableGenLocated$fTraversableGenLocated $fEqSrcSpan $fShowSrcSpan$fEqUnhelpfulSpanReason$fShowUnhelpfulSpanReason $fEqBufSpan $fOrdBufSpan $fShowBufSpan $fDataBufSpan$fEqRealSrcSpan $fEqSrcLoc $fShowSrcLoc $fEqBufPos $fOrdBufPos $fShowBufPos $fDataBufPos$fEqRealSrcLoc$fOrdRealSrcLoc IdDetailsIdInfo pprIdDetailsisCoVarDetails coVarDetails vanillaIdInfoRank ArbitraryRank LimitedRankMonoTypeRankZeroMonoTypeTyConArgMonoTypeSynArgMonoTypeConstraintMustBeMonoType$fOutputableRankOperatorWhitespaceOccurrence#OperatorWhitespaceOccurrence_Prefix#OperatorWhitespaceOccurrence_Suffix'OperatorWhitespaceOccurrence_TightInfixOperatorWhitespaceSymbol&OperatorWhitespaceSymbol_PrefixPercent%OperatorWhitespaceSymbol_PrefixDollar+OperatorWhitespaceSymbol_PrefixDollarDollarpprOperatorWhitespaceSymbolpFstpSndunPairtoPairswappLiftFstpLiftSnd$fOutputablePair $fMonoidPair$fSemigroupPair$fApplicativePairOrdListSnocOLConsOLNilOLnilOLunitOLsnocOLconsOLconcatOLheadOLlastOLisNilOLappOLfromOL fromOLReversemapOLmapOL'foldrOLfoldlOLtoOL reverseOL strictlyEqOL strictlyOrdOL$fTraversableOrdList$fFoldableOrdList$fMonoidOrdList$fSemigroupOrdList$fOutputableOrdList$fFunctorOrdListAssocgetNth unionLists minusListassocDefaultUsingassoc assocDefault assocUsing assocMaybe hasNoDups equivClasses removeDupsnubOrdBy findDupsEqisInisn'tInEdgeTypeForwardCrossBackwardSelfLoopNode DigraphNode node_payloadnode_keynode_dependenciesGraphgraphFromEdgedVerticesOrdgraphFromEdgedVerticesUniq findCyclestronglyConnCompG$stronglyConnCompFromEdgedVerticesOrd%stronglyConnCompFromEdgedVerticesUniq%stronglyConnCompFromEdgedVerticesOrdR&stronglyConnCompFromEdgedVerticesUniqRtopologicalSortG reachableG outgoingG reachablesG allReachable hasVertexG verticesGedgesG transposeGemptyG classifyEdges$fOutputableEdge$fOutputableNode$fOutputableGraph$fOutputableEdgeType$fEqTime $fOrdTime $fNumTime$fOutputableTime $fEqEdgeType $fOrdEdgeTypeBagemptyBagunitBag lengthBagelemBag unionManyBags unionBagsconsBagsnocBag isEmptyBagisSingletonBag filterBag filterBagMallBaganyBaganyBagM concatBag catBagMaybes partitionBagpartitionBagWithfoldBagmapBag concatMapBagconcatMapBagPair mapMaybeBagmapBagMmapBagM_ flatMapBagMflatMapBagPairMmapAndUnzipBagM mapAccumBagL mapAccumBagLM listToBag nonEmptyToBag bagToList headMaybe $fMonoidBag$fSemigroupBag $fIsListBag$fTraversableBag $fFoldableBag $fDataBag$fOutputableBag $fFunctorBag NamedThing getOccNamegetNameName tidyNameOcc nameOccName setNameUnique nameUnique SymbolTable DictionaryUserData ud_get_name ud_get_fsud_put_nonbinding_nameud_put_binding_name ud_put_fsFixedLengthEncoding unFixedLengthBinaryput_Bin BinHandleBinData dataHandle handleData getUserData setUserData withBinBuffercastBinputAtgetAt openBinMemtellBinseekBin writeBinMem readBinMemfoldGetputBytegetByte putULEB128 getULEB128 putSLEB128 getSLEB128lazyPutlazyGet lazyPutMaybe lazyGetMaybe newReadState newWriteState putDictionary getDictionaryputFS$fNFDataBinData$fBinaryIntMap$fBinarySrcSpan$fBinaryUnhelpfulSpanReason$fBinaryBufSpan$fBinaryBufPos$fBinaryRealSrcSpan$fBinaryGenLocated$fBinaryFingerprint$fBinaryFastString$fBinaryByteString $fBinaryBin $fBinaryRatio$fBinaryInteger$fBinaryDiffTime $fBinaryDay$fBinaryUTCTime$fBinaryEither $fBinaryMaybe$fBinaryMaybe0$fBinary(,,,,,,)$fBinary(,,,,,)$fBinary(,,,,) $fBinary(,,,) $fBinary(,,) $fBinary(,) $fBinaryArray$fBinaryNonEmpty $fBinarySet $fBinary[] $fBinaryInt $fBinaryChar $fBinaryBool $fBinary() $fBinaryInt64 $fBinaryInt32 $fBinaryInt16 $fBinaryInt8$fBinaryWord64$fBinaryWord32$fBinaryWord16 $fBinaryWord8$fBinaryFixedLengthEncoding$fBinaryFixedLengthEncoding0$fBinaryFixedLengthEncoding1$fBinaryFixedLengthEncoding2$fBinaryBinData$fEqBin$fOrdBin $fShowBin $fBoundedBin$fBinaryLexicalFastString$fBinaryNonDetFastStringgetSomeTypeRep$fBinarySerialized$fBinaryTypeLitSort$fBinaryKindRep$fBinaryRuntimeRep$fBinaryVecElem$fBinaryVecCount$fBinaryTypeRep$fBinarySomeTypeRep $fBinaryTyConstableModuleNameCmp pprModuleName moduleNameFSmoduleNameString mkModuleNamemkModuleNameFSmoduleNameSlashesmoduleNameColonsparseModuleName$fNFDataModuleName$fDataModuleName$fBinaryModuleName$fOutputableModuleName$fOrdModuleName$fEqModuleName$fUniquableModuleName$fShowModuleNameModuleWithIsBootModuleNameWithIsBoot GenWithIsBootGWIBgwib_mod gwib_isBootIsBootInterfaceNotBootIsBootDefinite unDefinite DefUnitIdunitIdFSInstantiationsGenInstantiationsInstantiatedUnitGenInstantiatedUnit instUnitFS instUnitKeyinstUnitInstanceOf instUnitInsts instUnitHolesRealUnitVirtUnitHoleUnitUnitKeyIsUnitIdunitFSInstantiatedModuleHomeUnitModuleInstalledModule moduleUnitIdmkModulepprInstantiatedModule isHoleUnit stableUnitCmpunitFreeModuleHolesmoduleFreeHolesmkInstantiatedUnit mkVirtUnitmkInstantiatedUnitHashfsToUnit unitString stringToUnit mapGenUnitmapInstantiationstoUnitId virtualUnitIdunitIsDefinite unitIdStringstringToUnitId primUnitId bignumUnitId baseUnitId rtsUnitId thisGhcUnitIdinteractiveUnitIdthUnitIdthUnitprimUnit bignumUnitbaseUnitrtsUnit thisGhcUnitinteractiveUnit mainUnitIdmainUnitisInteractiveModulewiredInUnitIds$fNFDataGenModule$fBinaryGenModule$fIsUnitIdUnitKey$fOutputableUnitId$fUniquableUnitId $fOrdUnitId $fEqUnitId$fBinaryUnitId$fIsUnitIdUnitId$fOutputableGenModule$fUniquableGenUnit $fEqGenUnit$fOrdGenInstantiatedUnit$fEqGenInstantiatedUnit$fIsUnitIdGenUnit$fBinaryGenInstantiatedUnit$fOutputableGenInstantiatedUnit$fOutputableGenModule0$fBinaryGenUnit $fShowGenUnit$fOutputableGenUnit$fNFDataGenUnit $fDataGenUnit $fOrdGenUnit$fOutputableGenModule1$fUniquableGenModule$fBinaryIsBootInterface$fOutputableGenWithIsBoot$fBinaryGenWithIsBoot$fEqGenWithIsBoot$fOrdGenWithIsBoot$fShowGenWithIsBoot$fFunctorGenWithIsBoot$fFoldableGenWithIsBoot$fTraversableGenWithIsBoot$fEqIsBootInterface$fOrdIsBootInterface$fShowIsBootInterface$fDataIsBootInterface$fFunctorDefinite $fEqDefinite $fOrdDefinite$fOutputableDefinite$fBinaryDefinite$fUniquableDefinite$fIsUnitIdDefinite $fDataUnitId $fEqGenModule$fOrdGenModule$fDataGenModule$fFunctorGenModule ModLocation ml_hs_file ml_hi_fileml_dyn_hi_file ml_obj_fileml_dyn_obj_file ml_hie_file addBootSuffixremoveBootSuffixaddBootSuffix_maybeaddBootSuffixLocn_maybeaddBootSuffixLocnaddBootSuffixLocnOut$fOutputableModLocation$fShowModLocation parseUnit parseUnitIdparseHoleyModule parseModSubstInstalledModuleEnvDModuleNameEnv ModuleNameEnv ModuleSet ModuleEnvfilterModuleEnv elemModuleEnvextendModuleEnvextendModuleEnvWithextendModuleEnvListextendModuleEnvList_CplusModuleEnv_CdelModuleEnvList delModuleEnv plusModuleEnvlookupModuleEnvlookupWithDefaultModuleEnv mapModuleEnvpartitionModuleEnv mkModuleEnvemptyModuleEnv moduleEnvKeys moduleEnvEltsmoduleEnvToList unitModuleEnvisEmptyModuleEnv mkModuleSetextendModuleSetextendModuleSetListemptyModuleSetisEmptyModuleSet moduleSetElts elemModuleSetintersectModuleSetminusModuleSet delModuleSetunionModuleSetunionManyModuleSets unitModuleSetemptyInstalledModuleEnvlookupInstalledModuleEnvextendInstalledModuleEnvfilterInstalledModuleEnvdelInstalledModuleEnvinstalledModuleEnvEltsmergeInstalledModuleEnvplusInstalledModuleEnv $fOrdNDModule$fOutputableNDModule$fOutputableModuleEnv$fOutputableInstalledModuleEnv $fEqNDModuleKnotVars NoKnotVars kv_domain kv_lookup emptyKnotVarsknotVarsFromModuleEnv knotVarElemslookupKnotVarsknotVarsWithout$fOutputableKnotVars$fFunctorKnotVars HasModule getModuleContainsModule extractModulemoduleIsDefinitemoduleStableStringstableModuleCmpinstalledModuleEqgetModuleInstantiationgetUnitInstantiationsuninstantiateInstantiatedUnituninstantiateInstantiatedModule isHoleModule mkHoleModule BreakInfobreakInfo_modulebreakInfo_numberHomeUnit GenHomeUnitDefiniteHomeUnitIndefiniteHomeUnit homeUnitIdhomeUnitInstantiationshomeUnitInstanceOfhomeUnitInstanceOfMaybehomeUnitAsUnit homeUnitMapisHomeUnitIndefiniteisHomeUnitDefiniteisHomeUnitInstantiating isHomeUnit isHomeUnitId notHomeUnitIdisHomeUnitInstanceOf isHomeModuleisHomeInstalledModulenotHomeInstalledModulenotHomeInstalledModuleMaybe notHomeModulenotHomeModuleMaybe mkHomeModulemkHomeInstalledModulehomeModuleNameInstantiationhomeModuleInstantiation StringLiteralsl_stsl_fssl_tcFractionalExponentBaseBase2Base10 FractionalLitFLfl_textfl_negfl_signifl_exp fl_exp_base IntegralLitILil_textil_negil_value SourceText NoSourceTextpprWithSourceText mkIntegralLitnegateIntegralLitmkFractionalLitfractionalLitFromRationalrationalFromFractionalLitmkTHFractionalLitnegateFractionalLitintegralFractionalLitmkSourceFractionalLit$fBinarySourceText$fOutputableSourceText$fOutputableIntegralLit$fOrdIntegralLit$fEqIntegralLit$fOutputableFractionalLit$fOrdFractionalLit$fEqFractionalLit$fBinaryStringLiteral$fOutputableStringLiteral$fEqStringLiteral$fDataStringLiteral$fDataFractionalLit$fShowFractionalLit$fEqFractionalExponentBase$fOrdFractionalExponentBase$fDataFractionalExponentBase$fShowFractionalExponentBase$fDataIntegralLit$fShowIntegralLit$fDataSourceText$fShowSourceText$fEqSourceTextPkgQual NoPkgQualThisPkgOtherPkg RawPkgQual NoRawPkgQual$fOutputableRawPkgQual$fOutputablePkgQual $fDataPkgQual $fOrdPkgQual $fEqPkgQual$fDataRawPkgQual HscSource HsSrcFile HsBootFileHsigFilehscSourceToIsBoothscSourceString isHsBootOrSig isHsigFile$fBinaryHscSource $fEqHscSource$fOrdHscSource$fShowHscSourceIfaceTrustInfoSafeHaskellModeSf_None Sf_UnsafeSf_TrustworthySf_SafeSf_SafeInferred Sf_Ignore IsSafeImport getSafeMode setSafeModenoIfaceTrustInfo$fOutputableSafeHaskellMode$fShowSafeHaskellMode$fBinaryIfaceTrustInfo$fOutputableIfaceTrustInfo$fEqSafeHaskellMode LexicalFixityPrefixInfixFixityDirectionInfixLInfixRInfixNFixity maxPrecedence minPrecedence defaultFixity negateFixity funTyFixity compareFixity$fBinaryFixityDirection$fOutputableFixityDirection$fBinaryFixity $fEqFixity$fOutputableFixity$fOutputableLexicalFixity$fDataLexicalFixity$fEqLexicalFixity $fDataFixity$fEqFixityDirection$fDataFixityDirectionExtensibleFieldsgetExtensibleFields FieldNameemptyExtensibleFields readField readFieldWith writeFieldwriteFieldWith deleteField$fNFDataExtensibleFields$fBinaryExtensibleFieldsHsDocStringChunkLHsDocStringChunkHsDocStringDecoratorHsDocStringNextHsDocStringPreviousHsDocStringNamedHsDocStringGroup HsDocStringMultiLineDocStringNestedDocStringGeneratedDocString LHsDocStringpprWithDocStringmkHsDocStringChunk mkHsDocStringChunkUtf8ByteString unpackHDSCmkGeneratedHsDocStringisEmptyDocStringdocStringChunkspprHsDocStringpprHsDocStringsexactPrintHsDocStringrenderHsDocStringrenderHsDocStrings$fBinaryHsDocStringDecorator $fOutputableHsDocStringDecorator$fOutputableHsDocStringChunk$fBinaryHsDocStringChunk$fBinaryHsDocString$fOutputableHsDocString$fEqHsDocString$fDataHsDocString$fShowHsDocString$fEqHsDocStringChunk$fOrdHsDocStringChunk$fDataHsDocStringChunk$fShowHsDocStringChunk$fEqHsDocStringDecorator$fOrdHsDocStringDecorator$fShowHsDocStringDecorator$fDataHsDocStringDecoratorEnumSetmemberinsertdeletetoList difference$fBinaryEnumSet$fSemigroupEnumSet$fMonoidEnumSet WarningFlagOpt_WarnDuplicateExportsOpt_WarnDuplicateConstraintsOpt_WarnRedundantConstraintsOpt_WarnHiShadowsOpt_WarnImplicitPreludeOpt_WarnIncompletePatternsOpt_WarnIncompleteUniPatterns Opt_WarnIncompletePatternsRecUpdOpt_WarnOverflowedLiteralsOpt_WarnEmptyEnumerationsOpt_WarnMissingFieldsOpt_WarnMissingImportListOpt_WarnMissingMethodsOpt_WarnMissingSignaturesOpt_WarnMissingLocalSignaturesOpt_WarnNameShadowingOpt_WarnOverlappingPatternsOpt_WarnTypeDefaultsOpt_WarnMonomorphismOpt_WarnUnusedTopBindsOpt_WarnUnusedLocalBindsOpt_WarnUnusedPatternBindsOpt_WarnUnusedImportsOpt_WarnUnusedMatchesOpt_WarnUnusedTypePatternsOpt_WarnUnusedForallsOpt_WarnUnusedRecordWildcardsOpt_WarnRedundantBangPatterns Opt_WarnRedundantRecordWildcardsOpt_WarnWarningsDeprecationsOpt_WarnDeprecatedFlags!Opt_WarnMissingMonadFailInstancesOpt_WarnSemigroupOpt_WarnDodgyExportsOpt_WarnDodgyImportsOpt_WarnOrphansOpt_WarnAutoOrphansOpt_WarnIdentities Opt_WarnTabsOpt_WarnUnrecognisedPragmasOpt_WarnDodgyForeignImportsOpt_WarnUnusedDoBindOpt_WarnWrongDoBind)Opt_WarnAlternativeLayoutRuleTransitionalOpt_WarnUnsafe Opt_WarnSafeOpt_WarnTrustworthySafeOpt_WarnMissedSpecsOpt_WarnAllMissedSpecs%Opt_WarnUnsupportedCallingConventionsOpt_WarnUnsupportedLlvmVersionOpt_WarnMissedExtraSharedLibOpt_WarnInlineRuleShadowingOpt_WarnTypedHolesOpt_WarnPartialTypeSignatures!Opt_WarnMissingExportedSignatures$Opt_WarnUntickedPromotedConstructorsOpt_WarnDerivingTypeableOpt_WarnDeferredTypeErrors#Opt_WarnDeferredOutOfScopeVariables"Opt_WarnNonCanonicalMonadInstances&Opt_WarnNonCanonicalMonadFailInstances#Opt_WarnNonCanonicalMonoidInstances'Opt_WarnMissingPatternSynonymSignatures Opt_WarnUnrecognisedWarningFlags$Opt_WarnSimplifiableClassConstraintsOpt_WarnCPPUndefOpt_WarnUnbangedStrictPatternsOpt_WarnMissingHomeModulesOpt_WarnPartialFieldsOpt_WarnMissingExportListOpt_WarnInaccessibleCodeOpt_WarnStarIsTypeOpt_WarnStarBinderOpt_WarnImplicitKindVarsOpt_WarnSpaceAfterBang!Opt_WarnMissingDerivingStrategies"Opt_WarnPrepositiveQualifiedModuleOpt_WarnUnusedPackagesOpt_WarnInferredSafeImportsOpt_WarnMissingSafeHaskellMode Opt_WarnCompatUnqualifiedImportsOpt_WarnDerivingDefaultsOpt_WarnInvalidHaddock%Opt_WarnOperatorWhitespaceExtConflictOpt_WarnOperatorWhitespaceOpt_WarnAmbiguousFieldsOpt_WarnImplicitLiftOpt_WarnMissingKindSignatures/Opt_WarnMissingExportedPatternSynonymSignatures Opt_WarnRedundantStrictnessFlagsOpt_WarnForallIdentifier,Opt_WarnUnicodeBidirectionalFormatCharactersOpt_WarnGADTMonoLocalBindsOpt_WarnTypeEqualityOutOfScope%Opt_WarnTypeEqualityRequiresOperators GeneralFlagOpt_DumpToFileOpt_D_dump_minimal_importsOpt_DoCoreLintingOpt_DoLinearCoreLintingOpt_DoStgLintingOpt_DoCmmLintingOpt_DoAsmLintingOpt_DoAnnotationLintingOpt_DoBoundsCheckingOpt_NoLlvmMangler Opt_FastLlvmOpt_NoTypeableBindsOpt_DistinctConstructorTablesOpt_InfoTableMapOpt_WarnIsErrorOpt_ShowWarnGroupsOpt_HideSourcePathsOpt_PrintExplicitForallsOpt_PrintExplicitKindsOpt_PrintExplicitCoercionsOpt_PrintExplicitRuntimeRepsOpt_PrintEqualityRelationsOpt_PrintAxiomIncompsOpt_PrintUnicodeSyntaxOpt_PrintExpandedSynonymsOpt_PrintPotentialInstancesOpt_PrintTypecheckerElaboration Opt_CallArityOpt_ExitificationOpt_StrictnessOpt_LateDmdAnalOpt_KillAbsenceOpt_KillOneShotOpt_FullLaziness Opt_FloatInOpt_LateSpecialiseOpt_SpecialiseOpt_SpecialiseAggressivelyOpt_CrossModuleSpecialiseOpt_InlineGenericsOpt_InlineGenericsAggressively Opt_StaticArgumentTransformationOpt_CSE Opt_StgCSEOpt_StgLiftLamsOpt_LiberateCaseOpt_SpecConstrOpt_SpecConstrKeenOpt_DoLambdaEtaExpansionOpt_IgnoreAssertsOpt_DoEtaReduction Opt_CaseMergeOpt_CaseFoldingOpt_UnboxStrictFieldsOpt_UnboxSmallStrictFieldsOpt_DictsCheapOpt_EnableRewriteRulesOpt_EnableThSpliceWarnings Opt_RegsGraphOpt_RegsIterativeOpt_PedanticBottoms Opt_LlvmTBAAOpt_LlvmFillUndefWithGarbageOpt_IrrefutableTuples Opt_CmmSinkOpt_CmmStaticPredOpt_CmmElimCommonBlocksOpt_CmmControlFlowOpt_AsmShortcuttingOpt_OmitYieldsOpt_FunToThunkOpt_DictsStrictOpt_DmdTxDictSelOpt_LoopificationOpt_CfgBlocklayoutOpt_WeightlessBlocklayout Opt_CprAnalOpt_WorkerWrapperOpt_WorkerWrapperUnliftOpt_SolveConstantDictsOpt_AlignmentSanitisationOpt_CatchNonexhaustiveCasesOpt_NumConstantFoldingOpt_CoreConstantFoldingOpt_FastPAPCallsOpt_DoTagInferenceChecksOpt_SimplPreInliningOpt_IgnoreInterfacePragmasOpt_OmitInterfacePragmasOpt_ExposeAllUnfoldingsOpt_WriteInterface Opt_WriteHieOpt_AutoSccsOnIndividualCafsOpt_ProfCountEntriesOpt_ProfLateCcsOpt_PpOpt_ForceRecompOpt_IgnoreOptimChangesOpt_IgnoreHpcChangesOpt_ExcessPrecisionOpt_EagerBlackHoling Opt_NoHsMainOpt_SplitSections Opt_StgStatsOpt_HideAllPackagesOpt_HideAllPluginPackagesOpt_PrintBindResult Opt_HaddockOpt_HaddockOptionsOpt_BreakOnExceptionOpt_BreakOnErrorOpt_PrintEvldWithShowOpt_PrintBindContentsOpt_GenManifestOpt_EmbedManifestOpt_SharedImplibOpt_BuildingCabalPackageOpt_IgnoreDotGhciOpt_GhciSandboxOpt_GhciHistoryOpt_GhciLeakCheckOpt_ValidateHieOpt_LocalGhciHistoryOpt_NoItOpt_HelpfulErrorsOpt_DeferTypeErrorsOpt_DeferTypedHolesOpt_DeferOutOfScopeVariablesOpt_PICOpt_PIEOpt_PICExecutableOpt_ExternalDynamicRefs Opt_TickyOpt_Ticky_Allocd Opt_Ticky_LNEOpt_Ticky_Dyn_Thunk Opt_Ticky_Tag Opt_Ticky_AP Opt_RPathOpt_RelativeDynlibPathsOpt_CompactUnwindOpt_HpcOpt_FamAppCacheOpt_ExternalInterpreterOpt_OptimalApplicativeDoOpt_VersionMacrosOpt_WholeArchiveHsLibsOpt_SingleLibFolderOpt_ExposeInternalSymbols Opt_KeepCAFs Opt_KeepGoing Opt_ByteCode Opt_LinkRtsOpt_ErrorSpansOpt_DeferDiagnosticsOpt_DiagnosticsShowCaretOpt_PprCaseAsLetOpt_PprShowTicksOpt_ShowHoleConstraintsOpt_ShowValidHoleFitsOpt_SortValidHoleFitsOpt_SortBySizeHoleFitsOpt_SortBySubsumHoleFitsOpt_AbstractRefHoleFitsOpt_UnclutterValidHoleFitsOpt_ShowTypeAppOfHoleFitsOpt_ShowTypeAppVarsOfHoleFitsOpt_ShowDocsOfHoleFitsOpt_ShowTypeOfHoleFitsOpt_ShowProvOfHoleFitsOpt_ShowMatchesOfHoleFitsOpt_ShowLoadedModulesOpt_HexWordLiteralsOpt_SuppressCoercionsOpt_SuppressVarKindsOpt_SuppressModulePrefixesOpt_SuppressTypeApplicationsOpt_SuppressIdInfoOpt_SuppressUnfoldingsOpt_SuppressTypeSignaturesOpt_SuppressUniquesOpt_SuppressStgExtsOpt_SuppressTicksOpt_SuppressTimestampsOpt_SuppressCoreSizesOpt_AutoLinkPackagesOpt_ImplicitImportQualifiedOpt_KeepHscppFilesOpt_KeepHiDiffsOpt_KeepHcFilesOpt_KeepSFilesOpt_KeepTmpFilesOpt_KeepRawTokenStreamOpt_KeepLlvmFilesOpt_KeepHiFilesOpt_KeepOFilesOpt_BuildDynamicTooOpt_DistrustAllPackagesOpt_PackageTrustOpt_PluginTrustworthyOpt_G_NoStateHackOpt_G_NoOptCoercionDumpFlagOpt_D_dump_cmmOpt_D_dump_cmm_from_stgOpt_D_dump_cmm_rawOpt_D_dump_cmm_verbose_by_procOpt_D_dump_cmm_verboseOpt_D_dump_cmm_cfgOpt_D_dump_cmm_cbeOpt_D_dump_cmm_switchOpt_D_dump_cmm_procOpt_D_dump_cmm_spOpt_D_dump_cmm_sinkOpt_D_dump_cmm_cafOpt_D_dump_cmm_procmapOpt_D_dump_cmm_splitOpt_D_dump_cmm_infoOpt_D_dump_cmm_cpsOpt_D_dump_cfg_weightsOpt_D_dump_asmOpt_D_dump_asm_nativeOpt_D_dump_asm_livenessOpt_D_dump_asm_regallocOpt_D_dump_asm_regalloc_stagesOpt_D_dump_asm_conflictsOpt_D_dump_asm_statsOpt_D_dump_c_backendOpt_D_dump_llvmOpt_D_dump_core_statsOpt_D_dump_deriv Opt_D_dump_dsOpt_D_dump_ds_preoptOpt_D_dump_foreignOpt_D_dump_inliningsOpt_D_dump_verbose_inliningsOpt_D_dump_rule_firingsOpt_D_dump_rule_rewritesOpt_D_dump_simpl_traceOpt_D_dump_occur_analOpt_D_dump_parsedOpt_D_dump_parsed_ast Opt_D_dump_rnOpt_D_dump_rn_astOpt_D_dump_simplOpt_D_dump_simpl_iterationsOpt_D_dump_specOpt_D_dump_prepOpt_D_dump_stg_from_coreOpt_D_dump_stg_unarisedOpt_D_dump_stg_cgOpt_D_dump_stg_tagsOpt_D_dump_stg_finalOpt_D_dump_call_arityOpt_D_dump_exitifyOpt_D_dump_stranalOpt_D_dump_str_signaturesOpt_D_dump_cpranalOpt_D_dump_cpr_signatures Opt_D_dump_tcOpt_D_dump_tc_astOpt_D_dump_hieOpt_D_dump_typesOpt_D_dump_rulesOpt_D_dump_cseOpt_D_dump_worker_wrapperOpt_D_dump_rn_traceOpt_D_dump_rn_statsOpt_D_dump_opt_cmmOpt_D_dump_simpl_statsOpt_D_dump_cs_traceOpt_D_dump_tc_traceOpt_D_dump_ec_traceOpt_D_dump_if_traceOpt_D_dump_splicesOpt_D_th_dec_fileOpt_D_dump_BCOsOpt_D_dump_tickedOpt_D_dump_rttiOpt_D_source_statsOpt_D_verbose_stg2stg Opt_D_dump_hiOpt_D_dump_hi_diffsOpt_D_dump_mod_cyclesOpt_D_dump_mod_mapOpt_D_dump_timings!Opt_D_dump_view_pattern_commoningOpt_D_verbose_core2coreOpt_D_dump_debugOpt_D_dump_jsonOpt_D_ppr_debugOpt_D_no_debug_outputOpt_D_dump_faststringsOpt_D_faststring_statsLanguage Haskell98 Haskell2010GHC2021optimisationFlags warnFlagNames warningGroupswarningHierarchiessmallestWarningGroupsstandardWarnings minusWOpts minusWallOptsminusWeverythingOptsminusWcompatOptsunusedBindsFlags$fBinaryLanguage$fOutputableLanguage$fEqWarningFlag$fOrdWarningFlag$fShowWarningFlag$fEnumWarningFlag$fEqGeneralFlag$fShowGeneralFlag$fEnumGeneralFlag $fEqDumpFlag$fShowDumpFlag$fEnumDumpFlag $fEqLanguage$fEnumLanguage$fShowLanguage$fBoundedLanguage InvisTVBinderTcTyVarTyCoVarTyVar SpecificityVarBndrVar AnonArgFlagArgFlagidName TyConRepNameTyCon tyConNamemkPrelTyConRepNametyConRepName_maybe isFunTyConisUnboxedTupleTyCon isTupleTyConTyThingmkAnIdmkATyCon MCoercionN CoercionN ThetaTypePredTypeMultScaled MCoercion TyCoBinderTyLitUnivCoProvenanceCoercionmkNakedTyConTy mkForAllTy mkFunTyManyTcTyVarDetails MetaDetailstcEqTypeisConcreteTyVarisTyConableTyVar isMetaTyVarvanillaSkolemTvUnkpprTcTyVarDetailspartitionInvisibleTypes getLevitytyConAppTyCon_maybesplitTyConApp_maybe mkTYPEappisLiftedTypeKindisMultiplicityTy isLevityTyisRuntimeRepTytcViewcoreView piResultTy mkTyConAppmkCastTymkAppTy isCoercionTyisPredTypprTyVarpprTyLitpprCopprKindpprTypeCType CLabelString CCallConvCApiConv StdCallConv PrimCallConvJavaScriptCallConv CCallTarget StaticTarget DynamicTarget CCallSpec CExportSpec CExportStaticSafetyPlaySafePlayInterruptible PlayRisky ForeignCallCCallisSafeForeignCallplaySafeplayInterruptibleisDynamicTargetdefaultCCallConvccallConvToIntccallConvAttributepprCLabelStringisCLabelString$fBinarySafety$fOutputableSafety$fBinaryCCallConv$fOutputableCCallConv$fBinaryCCallTarget$fBinaryCCallSpec$fOutputableCCallSpec$fBinaryForeignCall$fOutputableForeignCall$fBinaryCExportSpec$fOutputableCExportSpec$fBinaryHeader$fOutputableHeader $fBinaryCType$fOutputableCType $fEqCType $fDataCType $fEqHeader $fDataHeader$fDataCExportSpec$fEqForeignCall $fEqCCallSpec$fEqCCallTarget$fDataCCallTarget $fEqCCallConv$fDataCCallConv$fEnumCCallConv $fEqSafety $fShowSafety $fDataSafety $fEnumSafetyDefaultingStrategyDefaultKindVarsNonStandardDefaultingNonStandardDefaultingStrategyDefaultNonStandardTyVars TryNotToDefaultNonStandardTyVars ExprOrPat ExpressionPatternLevityLiftedUnlifted TypeOrKind TypeLevel KindLevelSpliceExplicitFlagExplicitSpliceImplicitSplice IntWithInf InlineSpecInline InlinableNoInlineOpaqueNoUserInlinePrag RuleMatchInfoConLikeFunLike InlinePragmainl_src inl_inlineinl_satinl_actinl_rule Activation AlwaysActive ActiveBefore ActiveAfter FinalActive NeverActive CompilerPhase InitialPhasePhase FinalPhasePhaseNum SuccessFlag DefMethSpec VanillaDM GenericDM TailCallInfoAlwaysTailCalledNoTailCallInfo InsideLam IsInsideLam NotInsideLamInterestingCxt IsInterestingNotInteresting BranchCountOccInfoManyOccsIAmDeadOneOccIAmALoopBreakerocc_tail occ_in_lamocc_n_br occ_int_cxtocc_rules_onlyEPfromEPtoEPUnboxedTupleOrSumUnboxedTupleTypeUnboxedSumType TupleSort BoxedTuple UnboxedTupleConstraintTuplePprPrec OverlapMode NoOverlap Overlappable OverlappingOverlaps Incoherent OverlapFlag overlapMode isSafeOverlapOrigin FromSource GeneratedRecFlag Recursive NonRecursiveCbvMark MarkedCbv NotMarkedCbvBoxityBoxedUnboxed TopLevelFlagTopLevel NotTopLevelRuleNameFunctionOrData IsFunctionIsData PromotionFlag NotPromoted IsPromotedSwapFlag NotSwapped IsSwapped OneShotInfo NoOneShotInfo OneShotLam AlignmentalignmentBytesConTagZConTag FullArgCount JoinArityRepArityArity LeftOrRightCLeftCRightpickLR fIRST_TAG mkAlignment alignmentOf noOneShotInfo isOneShotInfohasNoOneShotInfo worstOneShot bestOneShotflipSwap isSwappedunSwap isPromoted pprRuleName isNotTopLevel isTopLevelisBoxed isMarkedCbvisRecisNonRec boolToRecFlag isGeneratedsetOverlapModeMaybehasIncoherentFlaghasOverlappableFlaghasOverlappingFlagtopPrecsigPrecfunPrecopPrecstarPrecappPrec maybeParentupleSortBoxityboxityTupleSort tupleParens sumParenspprAlternativeunboxedTupleOrSumExtension oneBranch noOccInfo isNoOccInfo isManyOccs seqOccInfo tailCallInfozapOccTailCallInfoisAlwaysTailCalledstrongLoopBreakerweakLoopBreakerisWeakLoopBreakerisStrongLoopBreaker isDeadOccisOneOcc zapFragileOcc successIf succeededfailed beginPhase activeAfter nextPhase laterPhaseactivateAfterInitialactivateDuringFinalisActiveactiveInFinalPhase isNeverActiveisAlwaysActive competesWith isConLike isFunLikenoUserInlineSpecdefaultInlinePragmaalwaysInlinePragmaneverInlinePragmaalwaysInlineConLikePragmainlinePragmaSpecinlinePragmaSourceinlineSpecSourcedfunInlinePragmaisDefaultInlinePragmaisInlinePragmaisInlinablePragmaisNoInlinePragmaisAnyInlinePragmaisOpaquePragmainlinePragmaSatinlinePragmaActivationinlinePragmaRuleMatchInfosetInlinePragmaActivationsetInlinePragmaRuleMatchInfoinlinePragmaName pprInlinepprInlineDebuginfinity intGtLimit subWithInftreatZeroAsInf mkIntWithInf isTypeLevel isKindLevel mightBeLiftedmightBeUnlifteddefaultNonStandardTyVars$fBinaryLeftOrRight$fOutputableLeftOrRight$fOutputablePenvAlignment$fOutputableAlignment$fOutputableOneShotInfo$fOutputableSwapFlag$fBinaryPromotionFlag$fOutputablePromotionFlag$fBinaryFunctionOrData$fOutputableFunctionOrData$fOutputableTopLevelFlag$fBinaryBoxity$fOutputableBoxity$fBinaryCbvMark$fOutputableCbvMark$fBinaryRecFlag$fOutputableRecFlag$fOutputableOrigin$fBinaryOverlapMode$fOutputableOverlapMode$fBinaryOverlapFlag$fOutputableOverlapFlag$fBinaryTupleSort$fOutputableTupleSort$fOutputableUnboxedTupleOrSum$fMonoidInterestingCxt$fSemigroupInterestingCxt$fMonoidInsideLam$fSemigroupInsideLam$fOutputableTailCallInfo$fOutputableOccInfo$fOutputableDefMethSpec$fOutputableSuccessFlag$fSemigroupSuccessFlag$fOutputableCompilerPhase$fBinaryActivation$fOutputableActivation$fBinaryRuleMatchInfo$fOutputableRuleMatchInfo$fBinaryInlineSpec$fOutputableInlineSpec$fBinaryInlinePragma$fOutputableInlinePragma$fNumIntWithInf$fOutputableIntWithInf$fOrdIntWithInf$fOutputableTypeOrKind$fOutputableLevity$fOutputableExprOrPat)$fOutputableNonStandardDefaultingStrategy$fOutputableDefaultingStrategy $fEqExprOrPat $fEqLevity$fEqTypeOrKind$fDataSpliceExplicitFlag$fEqIntWithInf$fEqInlinePragma$fDataInlinePragma$fEqInlineSpec$fDataInlineSpec$fShowInlineSpec$fEqRuleMatchInfo$fDataRuleMatchInfo$fShowRuleMatchInfo$fEqActivation$fDataActivation$fEqCompilerPhase $fEqOccInfo$fEqTailCallInfo $fEqInsideLam$fEqInterestingCxt$fEqUnboxedTupleOrSum $fEqTupleSort$fDataTupleSort $fEqPprPrec $fOrdPprPrec $fShowPprPrec$fEqOverlapFlag$fDataOverlapFlag$fEqOverlapMode$fDataOverlapMode $fEqOrigin $fDataOrigin $fEqRecFlag $fDataRecFlag $fEqCbvMark $fEqBoxity $fDataBoxity$fDataTopLevelFlag$fEqFunctionOrData$fOrdFunctionOrData$fDataFunctionOrData$fEqPromotionFlag$fDataPromotionFlag$fEqOneShotInfo $fEqAlignment$fOrdAlignment$fEqLeftOrRight$fDataLeftOrRight PlatformMisc!platformMisc_targetPlatformStringplatformMisc_ghcWithInterpreterplatformMisc_libFFIplatformMisc_llvmTarget BmiVersionBMI1BMI2 SseVersionSSE1SSE2SSE3SSE4SSE42PlatformWordSizePW4PW8PlatformplatformArchOSplatformWordSizeplatformByteOrderplatformUnregisterisedplatformHasGnuNonexecStackplatformHasIdentDirective platformHasSubsectionsViaSymbolsplatformIsCrossCompilingplatformLeadingUnderscoreplatformTablesNextToCodeplatformHasLibmplatform_constants wordAlignment isSseEnabled isSse2EnabledplatformConstantsgenericPlatformplatformWordSizeInBytesplatformWordSizeInBits platformArch platformOSisARM target32Bit osElfTarget osMachOTargetplatformUsesFrameworksosSubsectionsViaSymbolsplatformMinIntplatformMaxIntplatformMaxWordplatformInIntRangeplatformInWordRangeplatformCConvNeedsExtensionplatformSONameplatformHsSOName platformSOExtlookupPlatformConstants$fReadPlatformWordSize$fShowPlatformWordSize$fEqBmiVersion$fOrdBmiVersion$fEqSseVersion$fOrdSseVersion$fReadPlatform$fShowPlatform $fEqPlatform $fOrdPlatform$fEqPlatformWordSize$fOrdPlatformWordSizeGhcNameVersionghcNameVersion_programNameghcNameVersion_projectVersion FileSettingsfileSettings_ghcUsagePathfileSettings_ghciUsagePathfileSettings_toolDirfileSettings_topDir"fileSettings_globalPackageDatabase ToolSettings$toolSettings_ldSupportsCompactUnwindtoolSettings_ldSupportsBuildIdtoolSettings_ldSupportsFilelisttoolSettings_ldIsGnuLdtoolSettings_ccSupportsNoPietoolSettings_useInplaceMinGWtoolSettings_pgm_LtoolSettings_pgm_PtoolSettings_pgm_FtoolSettings_pgm_ctoolSettings_pgm_atoolSettings_pgm_ltoolSettings_pgm_lmtoolSettings_pgm_dlltoolSettings_pgm_TtoolSettings_pgm_windrestoolSettings_pgm_libtooltoolSettings_pgm_artoolSettings_pgm_otool"toolSettings_pgm_install_name_tooltoolSettings_pgm_ranlibtoolSettings_pgm_lotoolSettings_pgm_lctoolSettings_pgm_lcctoolSettings_pgm_itoolSettings_opt_LtoolSettings_opt_PtoolSettings_opt_P_fingerprinttoolSettings_opt_FtoolSettings_opt_ctoolSettings_opt_cxxtoolSettings_opt_atoolSettings_opt_ltoolSettings_opt_lmtoolSettings_opt_windrestoolSettings_opt_lotoolSettings_opt_lctoolSettings_opt_lcctoolSettings_opt_itoolSettings_extraGccViaCFlagsSettingssGhcNameVersion sFileSettingssTargetPlatform sToolSettings sPlatformMisc sRawSettings dynLibSuffix sProgramNamesProjectVersion sGhcUsagePathsGhciUsagePathsToolDirsTopDirsGlobalPackageDatabasePathsLdSupportsCompactUnwindsLdSupportsBuildIdsLdSupportsFilelist sLdIsGnuLdsGccSupportsNoPiesUseInplaceMinGWsPgm_LsPgm_PsPgm_FsPgm_csPgm_asPgm_lsPgm_lmsPgm_dllsPgm_T sPgm_windres sPgm_libtoolsPgm_ar sPgm_otoolsPgm_install_name_tool sPgm_ranlibsPgm_losPgm_lcsPgm_lccsPgm_isOpt_LsOpt_PsOpt_P_fingerprintsOpt_FsOpt_csOpt_cxxsOpt_asOpt_lsOpt_lm sOpt_windressOpt_losOpt_lcsOpt_lccsOpt_isExtraGccViaCFlagssTargetPlatformStringsGhcWithInterpretersLibFFIWaysWay WayCustom WayThreadedWayDebugWayProf WayTracingWayDynhasWay hasNotWayaddWay removeWayallowed_combinationwaysTag waysBuildTagwayTag wayRTSOnlyfullWaysrtsWayswayDescwayGeneralFlagswayUnsetGeneralFlagswayOptcwayOptlwayOptPhostIsProfiled hostIsDynamichostIsThreadedhostIsDebugged hostIsTracinghostWays hostFullWays$fEqWay$fOrdWay $fShowWay $fReadWay PackageName unPackageName PackageIdUnitInfo UnitKeyInfo GenUnitInfo mkUnitKeyInfo mapUnitInfounitPackageIdStringunitPackageNameString pprUnitInfomkUnit mkUnitPprInfocollectIncludeDirscollectExtraCcOptscollectLibraryDirscollectFrameworkscollectFrameworksDirs unitHsLibs$fOutputablePackageId$fUniquablePackageId$fOutputablePackageName$fUniquablePackageName$fEqPackageName $fEqPackageIdProfileprofilePlatform profileWaysprofileConstantsprofileIsProfilingprofileWordSizeInBytesprofileBuildTag $fEqProfile $fOrdProfile $fShowProfile $fReadProfileArgDescrArgSpecArgGen ArgUnknownLivenessConstrDescriptionClosureTypeInfoConstrFunThunk ThunkSelector BlackHole IndStaticIsStaticSMRepHeapRep ArrayPtrsRepSmallArrayPtrsRep ArrayWordsRepStackRepRTSRep StgHalfWordStgWordWordOffByteOffroundUpToWords roundUpTo wordsToBytesbytesToWordsRoundUp fromStgWord toStgWordfromStgHalfWord toStgHalfWord halfWordSizehalfWordSizeInBits mkHeapRepmkRTSRep mkStackRep blackHoleRep indStaticRep arrPtrsRepsmallArrPtrsRep arrWordsRep isStaticRep isStackRepisConRep isThunkRepisFunRepisStaticNoCafCon fixedHdrSize fixedHdrSizeW profHdrSizearrWordsHdrSizearrWordsHdrSizeWarrPtrsHdrSizearrPtrsHdrSizeWsmallArrPtrsHdrSizesmallArrPtrsHdrSizeW thunkHdrSizehdrSizehdrSizeW nonHdrSize nonHdrSizeWheapClosureSizeWcard cardRoundUpcardTableSizeBcardTableSizeWrtsClosureType rET_SMALLrET_BIGaRG_GEN aRG_GEN_BIG$fOutputableStgWord$fOutputableStgHalfWord$fOutputableArgDescr$fOutputableClosureTypeInfo$fOutputableSMRep $fEqSMRep$fEqClosureTypeInfo $fEqArgDescr$fEqStgHalfWord $fEqStgWord $fBitsStgWord exeFileNameUnlitHsPpHscCcxxCcCobjcCobjcxxHCcAsLlvmOptLlvmLlc LlvmMangleCmmCppCmm MergeForeignStopLn StopPhaseStopPreprocessStopCStopAsNoStopstopPhaseToPhaseisStopLneqPhase happensBefore startPhase phaseInputExtisHaskellishSuffixisBackpackishSuffixisHaskellSigSuffixisHaskellSrcSuffix isCishSuffixisHaskellUserSrcSuffixisObjectSuffixisDynLibSuffixisSourceSuffixisHaskellishTargetisHaskellishFilenameisHaskellSrcFilenameisCishFilenameisHaskellUserSrcFilenameisSourceFilenameisHaskellSigFilenameisObjectFilenameisDynLibFilenamephaseForeignLanguage$fOutputablePhase $fEqPhase $fShowPhaseBackendNCGLLVMViaC Interpreter NoBackendplatformDefaultBackendplatformNcgSupportedbackendProducesObjectbackendRetainsAllBindings $fEqBackend $fOrdBackend $fShowBackend $fReadBackendDoAlignSanitisation ForeignHintNoHintAddrHint SignedHintLengthWidthW8W16W32W64W128W256W512CmmType cmmEqTypecmmEqType_ignoring_ptrhood typeWidthcmmBitscmmFloatb8b16b32b64b128b256b512f32f64bWord bHalfWordgcWordcInt isFloatType isGcPtrType isBitsType isWordAnyisWord64isWord32 isFloat32 isFloat64 wordWidth halfWordWidth halfWordMask cIntWidth widthInBits widthInByteswidthFromBytes widthInLognarrowUnarrowSvecvec2vec4vec8vec16vec2f64vec2b64vec4f32vec4b32vec8b16vec16b8cmmVec vecLength vecElemType isVecTyperEP_CostCentreStack_mem_allocrEP_CostCentreStack_scc_countrEP_StgEntCounter_allocsrEP_StgEntCounter_allocd$fOutputableWidth$fOutputableCmmCat$fOutputableCmmType$fEqForeignHint $fShowCmmType $fEqCmmCat $fShowCmmCat $fEqWidth $fOrdWidth $fShowWidth AtomicMachOpAMO_AddAMO_SubAMO_AndAMO_NandAMO_OrAMO_Xor CallishMachOp MO_F64_Pwr MO_F64_Sin MO_F64_Cos MO_F64_Tan MO_F64_Sinh MO_F64_Cosh MO_F64_Tanh MO_F64_Asin MO_F64_Acos MO_F64_Atan MO_F64_Asinh MO_F64_Acosh MO_F64_Atanh MO_F64_Log MO_F64_Log1P MO_F64_Exp MO_F64_ExpM1 MO_F64_Fabs MO_F64_Sqrt MO_F32_Pwr MO_F32_Sin MO_F32_Cos MO_F32_Tan MO_F32_Sinh MO_F32_Cosh MO_F32_Tanh MO_F32_Asin MO_F32_Acos MO_F32_Atan MO_F32_Asinh MO_F32_Acosh MO_F32_Atanh MO_F32_Log MO_F32_Log1P MO_F32_Exp MO_F32_ExpM1 MO_F32_Fabs MO_F32_Sqrt MO_I64_ToI MO_I64_FromI MO_W64_ToW MO_W64_FromW MO_x64_Neg MO_x64_Add MO_x64_Sub MO_x64_Mul MO_I64_Quot MO_I64_Rem MO_W64_Quot MO_W64_Rem MO_x64_And MO_x64_Or MO_x64_Xor MO_x64_Not MO_x64_Shl MO_I64_Shr MO_W64_Shr MO_x64_Eq MO_x64_Ne MO_I64_Ge MO_I64_Gt MO_I64_Le MO_I64_Lt MO_W64_Ge MO_W64_Gt MO_W64_Le MO_W64_Lt MO_UF_Conv MO_S_Mul2 MO_S_QuotRem MO_U_QuotRem MO_U_QuotRem2MO_Add2 MO_AddWordC MO_SubWordC MO_AddIntC MO_SubIntC MO_U_Mul2MO_ReadBarrierMO_WriteBarrierMO_TouchMO_Prefetch_Data MO_Memcpy MO_Memset MO_Memmove MO_Memcmp MO_PopCntMO_PdepMO_PextMO_ClzMO_CtzMO_BSwapMO_BRev MO_AtomicRMW MO_AtomicReadMO_AtomicWrite MO_CmpxchgMO_XchgMO_SuspendThreadMO_ResumeThreadMachOpMO_AddMO_SubMO_EqMO_NeMO_MulMO_S_MulMayOflo MO_S_QuotMO_S_RemMO_S_NegMO_U_MulMayOflo MO_U_QuotMO_U_RemMO_S_GeMO_S_LeMO_S_GtMO_S_LtMO_U_GeMO_U_LeMO_U_GtMO_U_LtMO_F_AddMO_F_SubMO_F_NegMO_F_Mul MO_F_QuotMO_F_EqMO_F_NeMO_F_GeMO_F_LeMO_F_GtMO_F_LtMO_AndMO_OrMO_XorMO_NotMO_ShlMO_U_ShrMO_S_Shr MO_SF_Conv MO_FS_Conv MO_SS_Conv MO_UU_Conv MO_XX_Conv MO_FF_Conv MO_V_Insert MO_V_ExtractMO_V_AddMO_V_SubMO_V_Mul MO_VS_Quot MO_VS_Rem MO_VS_Neg MO_VU_Quot MO_VU_Rem MO_VF_Insert MO_VF_Extract MO_VF_Add MO_VF_Sub MO_VF_Neg MO_VF_Mul MO_VF_QuotMO_AlignmentCheck pprMachOp mo_wordAdd mo_wordSub mo_wordEq mo_wordNe mo_wordMul mo_wordSQuot mo_wordSRem mo_wordSNeg mo_wordUQuot mo_wordURem mo_wordSGe mo_wordSLe mo_wordSGt mo_wordSLt mo_wordUGe mo_wordULe mo_wordUGt mo_wordULt mo_wordAnd mo_wordOr mo_wordXor mo_wordNot mo_wordShl mo_wordSShr mo_wordUShr mo_u_8To32 mo_s_8To32 mo_u_16To32 mo_s_16To32 mo_u_8ToWord mo_s_8ToWord mo_u_16ToWord mo_s_16ToWord mo_s_32ToWord mo_u_32ToWord mo_WordTo8 mo_WordTo16 mo_WordTo32 mo_WordTo64mo_32To8 mo_32To16isCommutableMachOpisAssociativeMachOpisComparisonMachOpmaybeIntComparisonisFloatComparisonmaybeInvertComparisonmachOpResultType machOpArgRepspprCallishMachOpcallishMachOpHintsmachOpMemcpyishAlign$fEqCallishMachOp$fShowCallishMachOp$fEqAtomicMachOp$fShowAtomicMachOp $fEqMachOp $fShowMachOpCLabel pprCLabel ForeignStubsNoStubsCHeader getCHeaderCStubgetCStubgetInitializers getFinalizersinitializerCStubfinalizerCStub appendStubC$fSemigroupCStub $fMonoidCStub$fSemigroupCHeader$fMonoidCHeader StringBufferbuflencurhGetStringBufferhGetStringBufferBlockhPutStringBufferappendStringBuffersstringToStringBufferstringBufferFromByteStringnextCharbidirectionalFormatCharscontainsBidirectionalFormatChar currentCharprevCharstepOn offsetBytesbyteDiffatEndfingerprintStringBufferatLinelexemeToStringlexemeToFastStringdecodePrevNCharsparseUnsignedInteger$fShowStringBufferDFastStringEnv FastStringEnv emptyFsEnv unitFsEnv extendFsEnvextendFsEnvList lookupFsEnv alterFsEnvmkFsEnv elemFsEnv plusFsEnv plusFsEnv_C extendFsEnv_CmapFsEnvextendFsEnv_AccextendFsEnvList_C delFromFsEnvdelListFromFsEnv filterFsEnvlookupFsEnv_NF emptyDFsEnv dFsEnvEltsmkDFsEnv lookupDFsEnvNoFieldSelectorsNoDuplicateRecordFields FieldLabelflLabelflHasDuplicateRecordFieldsflHasFieldSelector flSelector FieldLabelEnvFieldLabelStringfieldSelectorOccNamefieldLabelPrintableNameflIsOverloaded!$fOutputableDuplicateRecordFields$fBinaryDuplicateRecordFields$fOutputableFieldSelectors$fBinaryFieldSelectors$fBinaryFieldLabel$fOutputableFieldLabel$fHasOccNameFieldLabel$fDataFieldLabel$fEqFieldLabel$fShowFieldSelectors$fEqFieldSelectors$fDataFieldSelectors$fShowDuplicateRecordFields$fEqDuplicateRecordFields$fDataDuplicateRecordFieldsEqSpec DataConRepDataConpromoteDataCon dataConWrapIdisUnboxedSumDataCondataConFullSigdataConStupidThetadataConInstOrigArgTysdataConFieldLabelsdataConSourceAritydataConUserTyVarBindersdataConUserTyVarsdataConExTyCoVars dataConTyCon dataConWorkId dataConNamesumTyCon sumDataConcTupleSelIdNamecTupleTyConNamecTupleDataConName cTupleDataCon tupleTyCon tupleDataConpromotedTupleDataCon integerTy naturalTytupleTyConName multMulTyConunrestrictedFunTyConmanyDataConTyCon manyDataConTyoneDataConTyCon oneDataConTymultiplicityTymultiplicityTyConunboxedTupleKind anyTypeOfKindint8ElemRepDataConTyint16ElemRepDataConTyint32ElemRepDataConTyint64ElemRepDataConTyword8ElemRepDataConTyword16ElemRepDataConTyword32ElemRepDataConTyword64ElemRepDataConTyfloatElemRepDataConTydoubleElemRepDataConTy vec2DataConTy vec4DataConTy vec8DataConTyvec16DataConTyvec32DataConTyvec64DataConTyintRepDataConTyint8RepDataConTyint16RepDataConTyint32RepDataConTyint64RepDataConTywordRepDataConTyword8RepDataConTyword16RepDataConTyword32RepDataConTyword64RepDataConTyaddrRepDataConTyfloatRepDataConTydoubleRepDataConTyliftedDataConTyunliftedDataConTy liftedRepTy unliftedRepTy zeroBitRepTyvecRepDataConTyContupleRepDataConTyConboxedRepDataConTyConliftedDataConTyCon runtimeRepTylevityTyruntimeRepTyCon levityTyCon vecCountTyCon vecElemTyConconstraintKindliftedRepTyConunliftedRepTyConliftedTypeKindTyConunliftedTypeKindTyConliftedTypeKindunliftedTypeKindzeroBitTypeKindliftedTypeKindTyConNameunitTycoercibleTyConheqTyConmkBoxedTupleTycharTytypeSymbolKind listTyConCostCentreIndexunCostCentreIndexCostCentreStatenewCostCentreState getCCIndex$fEqCostCentreIndex$fOrdCostCentreIndex$fDataCostCentreIndex$fBinaryCostCentreIndexknownUniqueNamemkSumTyConUniquemkSumDataConUniquemkCTupleTyConUniquemkCTupleDataConUniquemkCTupleSelIdUniquemkTupleDataConUniquemkTupleTyConUniquemkAlphaTyVarUniquemkPreludeClassUniquemkPrimOpIdUniquemkPrimOpWrapperUniquemkPreludeMiscIdUniquemkBuiltinUniquemkPseudoUniqueEmkRegSingleUniquemkRegSubUniquemkRegPairUniquemkRegClassUniquemkCostCentreUniquemkVarOccUniquemkDataOccUnique mkTvOccUnique mkTcOccUniqueinitExitJoinUniquemkPreludeTyConUniquetyConRepNameUniquemkPreludeDataConUniquedataConWorkerUniquedataConTyRepNameUnique TidyOccEnvOccSetOccEnv occNameSpace occNameFS NameSpacetcNameclsName tcClsNamedataName srcDataNametvNamevarNameisDataConNameSpaceisTcClsNameSpace isTvNameSpaceisVarNameSpaceisValNameSpace pprNameSpacepprNonVarNameSpacepprNameSpaceBrief pprOccName mkOccName mkOccNameFSmkVarOcc mkDataOcc mkDataOccFS mkTyVarOcc mkTyVarOccFSmkTcOcc mkTcOccFSmkClsOcc mkClsOccFS demoteOccNamepromoteOccName emptyOccEnv unitOccEnv extendOccEnvextendOccEnvList lookupOccEnvmkOccEnv elemOccEnv foldOccEnvnonDetOccEnvElts plusOccEnv plusOccEnv_CextendOccEnv_CextendOccEnv_Acc mapOccEnv mkOccEnv_C delFromOccEnvdelListFromOccEnv filterOccEnv alterOccEnv minusOccEnv minusOccEnv_C pprOccEnv emptyOccSet unitOccSetmkOccSet extendOccSetextendOccSetList unionOccSetsunionManyOccSets minusOccSet elemOccSet isEmptyOccSetintersectOccSet filterOccSet occSetToEnvsetOccNameSpaceisVarOccisTvOccisTcOccisValOcc isDataOcc isDataSymOccisSymOcc parenSymOccstartsWithUnderscoreisDerivedOccNameisDefaultMethodOccisTypeableBindOccmkDataConWrapperOcc mkWorkerOcc mkMatcherOcc mkBuilderOccmkDefaultMethodOccmkClassOpAuxOcc mkDictOccmkIPOcc mkSpecOccmkForeignExportOcc mkRepEqOccmkClassDataConOcc mkNewTyCoOcc mkInstTyCoOcc mkEqPredCoOcc mkCon2TagOcc mkTag2ConOcc mkMaxTagOcc mkDataTOcc mkDataCOcc mkTyConRepOccmkGenRmkGen1RmkDataConWorkerOccmkSuperDictAuxOccmkSuperDictSelOcc mkLocalOcc mkInstTyTcOcc mkDFunOcc mkMethodOccemptyTidyOccEnvinitTidyOccEnvdelTidyOccEnvListavoidClashesOccEnv tidyOccName$fBinaryNameSpace$fBinaryOccName$fUniquableOccName$fOutputableBndrOccName$fOutputableOccName$fNFDataOccName $fDataOccName $fOrdOccName $fEqOccName$fHasOccNameOccName$fOutputableOccEnv $fDataOccEnv $fEqNameSpace$fOrdNameSpace BuiltInSyntax UserSyntax nameNameSpace nameSrcLoc nameSrcSpan isWiredInName isWiredInwiredInNameTyThing_maybeisBuiltInSyntaxisExternalNameisInternalName isHoleName isDynLinkName nameModulenameModule_maybenameIsLocalOrFromnameIsExternalOrFromnameIsHomePackagenameIsHomePackageImportnameIsFromExternalPackage isTyVarName isTyConName isDataConName isValName isVarName isSystemNamemkInternalNamemkClonedInternalNamemkDerivedInternalNamemkExternalName mkWiredInName mkSystemNamemkSystemNameAtmkSystemVarName mkSysTvName mkFCallName setNameLoc localiseName stableNameCmp pprFullName pprTickyNamepprNameUnqualifiedpprModulePrefix pprDefinedAtpprNameDefnLocnameStableString getSrcLoc getSrcSpan getOccStringgetOccFS pprInfixName pprPrefixName$fNFDataNameSort$fOutputableNameSort$fOutputableBndrName$fOutputableName $fBinaryName $fDataName$fUniquableName $fOrdName$fEqName$fHasOccNameName $fNFDataName$fNamedThingGenLocated$fNamedThingName ReqTVBinder TyVarBinder TyCoVarBinderBndrVisArgInvisArg InferredSpec SpecifiedSpec InvisibleRequiredvarTypevarMultOutIdOutCoVarOutTyVarOutVarInIdInCoVarInTyVarInVarJoinIdEqVarIpIdDictIdDFunIdEvVarEvIdKindVarTypeVarTKVarNcIdCoVar SpecifiedInferred nonDetCmpVar varUnique varMultMaybe setVarUnique setVarName setVarType updateVarTypeupdateVarTypeMisVisibleArgFlagisInvisibleArgFlagisInferredArgFlagsameVistyVarSpecToBinderstyVarSpecToBindertyVarReqToBinderstyVarReqToBinder binderVar binderVars binderArgFlag binderTypemkTyCoVarBinder mkTyVarBindermkTyCoVarBindersmkTyVarBinders isTyVarBinder mapVarBndr mapVarBndrs lookupVarBndr tyVarName tyVarKindsetTyVarUnique setTyVarName setTyVarKindupdateTyVarKindupdateTyVarKindMmkTyVar mkTcTyVartcTyVarDetailssetTcTyVarDetailsidInfo idDetails mkGlobalVar mkLocalVarmkCoVarmkExportedLocalVar lazySetIdInfo setIdDetails globaliseId setIdExportedsetIdNotExportedupdateIdTypeButNotMultupdateIdTypeAndMultupdateIdTypeAndMultM setIdMultisTyVar isTcTyVar isTyCoVarisIdisCoVar isNonCoVarId isLocalId isLocalVar isGlobalIdmustHaveLocalBinding isExportedId$fHasOccNameVar $fDataVar$fOrdVar$fEqVar$fUniquableVar$fNamedThingVar$fOutputableVar$fBinarySpecificity$fBinaryArgFlag$fOutputableArgFlag$fBinaryAnonArgFlag$fOutputableAnonArgFlag$fNamedThingVarBndr$fBinaryVarBndr$fOutputableVarBndr$fOutputableVarBndr0 $fDataVarBndr$fEqAnonArgFlag$fOrdAnonArgFlag$fDataAnonArgFlag $fEqArgFlag $fOrdArgFlag $fDataArgFlag$fEqSpecificity$fOrdSpecificity$fDataSpecificity DTyCoVarSet DTyVarSetDIdSetDVarSet TyCoVarSetCoVarSetTyVarSetIdSetVarSet emptyVarSet unitVarSet extendVarSetextendVarSetListintersectVarSet unionVarSet unionVarSets elemVarSet minusVarSet delVarSet delVarSetList isEmptyVarSetmkVarSetlookupVarSet_Directly lookupVarSetlookupVarSetByName sizeVarSet filterVarSetdelVarSetByKeyelemVarSetByKeypartitionVarSetmapUnionVarSetintersectsVarSetdisjointVarSet subVarSet anyVarSet allVarSet mapVarSetnonDetStrictFoldVarSet fixVarSettransCloVarSet seqVarSet pluralVarSet pprVarSet emptyDVarSet unitDVarSet mkDVarSet extendDVarSet elemDVarSet dVarSetElems subDVarSet unionDVarSet unionDVarSetsmapUnionDVarSetintersectDVarSetdVarSetIntersectVarSetdisjointDVarSetintersectsDVarSetisEmptyDVarSet delDVarSet minusDVarSetdVarSetMinusVarSetnonDetStrictFoldDVarSet anyDVarSet allDVarSet mapDVarSet filterDVarSet sizeDVarSetpartitionDVarSetdelDVarSetList seqDVarSetextendDVarSetListdVarSetToVarSettransCloDVarSetFVInterestingVarFun fvVarList fvDVarSetfvVarSetunitFVemptyFVunionFVdelFVdelFVsfilterFV mapUnionFVunionsFVmkFVs DTyVarEnvDIdEnvDVarEnvCoVarEnv TyCoVarEnvTyVarEnvIdEnvVarEnvTidyEnvRnEnv2 InScopeSetemptyInScopeSetgetInScopeVars mkInScopeSetextendInScopeSetextendInScopeSetListextendInScopeSetSet delInScopeSetelemInScopeSet lookupInScopelookupInScope_Directly unionInScope varSetInScopeuniqAwayunsafeGetFreshLocalUniquemkRnEnv2extendRnInScopeSetList rnInScope rnInScopeSetrnEnvLrnEnvRrnBndrs2rnBndr2 rnBndr2_varrnBndrLrnBndrRrnEtaLrnEtaRdelBndrLdelBndrR delBndrsL delBndrsRrnOccLrnOccR rnOccL_maybe rnOccR_maybeinRnEnvLinRnEnvRlookupRnInScope nukeRnEnvL nukeRnEnvRrnSwap emptyTidyEnvmkEmptyTidyEnvdelTidyEnvList elemVarEnvelemVarEnvByKeydisjointVarEnv alterVarEnv extendVarEnvextendVarEnv_CextendVarEnv_AccextendVarEnvList plusVarEnv_C plusVarEnv_CDplusMaybeVarEnv_C delVarEnvList delVarEnv minusVarEnv plusVarEnvplusVarEnvList lookupVarEnvlookupVarEnv_Directly filterVarEnvlookupWithDefaultVarEnv mapVarEnvmkVarEnvmkVarEnv_Directly emptyVarEnv unitVarEnv isEmptyVarEnvpartitionVarEnvrestrictVarEnv zipVarEnvlookupVarEnv_NF modifyVarEnvmodifyVarEnv_Directly emptyDVarEnv dVarEnvElts mkDVarEnv extendDVarEnv minusDVarEnv lookupDVarEnv foldDVarEnvnonDetStrictFoldDVarEnv mapDVarEnv filterDVarEnv alterDVarEnv plusDVarEnv plusDVarEnv_C unitDVarEnv delDVarEnvdelDVarEnvListisEmptyDVarEnv elemDVarEnvextendDVarEnv_C modifyDVarEnvpartitionDVarEnvextendDVarEnvList anyDVarEnv$fOutputableInScopeSetTagSigTagInfoTagDunnoTagTuple TagProper TagTagged isTaggedSig$fBinaryTagInfo$fOutputableTagInfo$fBinaryTagSig$fOutputableBndr(,)$fOutputableTagSig $fEqTagSig $fEqTagInfo NonCaffySetDefUsesDefUseUsesDefsFreeVarsNameSetisEmptyNameSet emptyNameSet unitNameSet mkNameSetextendNameSetList extendNameSet unionNameSet unionNameSets minusNameSet elemNameSetdelFromNameSet filterNameSetintersectNameSetdisjointNameSetdelListFromNameSetintersectsNameSet nameSetAny nameSetAllnameSetElemsStable isEmptyFVsemptyFVsplusFVsplusFVaddOneFV intersectFVsemptyDUsusesOnlymkDUsplusDUduDefsallUsesduUsesfindUses$fSemigroupNonCaffySet$fMonoidNonCaffySetDNameEnvNameEnvdepAnalnonDetNameEnvElts emptyNameEnvisEmptyNameEnv unitNameEnv extendNameEnvextendNameEnvList lookupNameEnv alterNameEnv mkNameEnv mkNameEnvWith elemNameEnv plusNameEnv plusNameEnv_CplusNameEnv_CDplusNameEnv_CD2extendNameEnv_C mapNameEnvextendNameEnv_AccextendNameEnvList_CdelFromNameEnvdelListFromNameEnv filterNameEnv anyNameEnvdisjointNameEnvseqEltsNameEnvlookupNameEnv_NF emptyDNameEnvisEmptyDNameEnvlookupDNameEnvdelFromDNameEnvfilterDNameEnv mapDNameEnvadjustDNameEnv alterDNameEnvextendDNameEnvextendDNameEnv_C eltsDNameEnv foldDNameEnvplusDNameEnv_CnonDetStrictFoldDNameEnvFixItem FixityEnvemptyFixityEnv lookupFixitymkIfaceFixCacheemptyIfaceFixCache$fOutputableFixItem CollectedCCs CCFlavourCafCCExprCCDeclCCHpcCCCcNameNormalCC AllCafsCCcc_namecc_modcc_loc cmpCostCentreisCafCC isSccCountCC sccAbleCCccFromThisModulemkUserCCmkAutoCC mkAllCafsCCemptyCollectedCCs collectCC currentCCS dontCareCCS isCurrentCCSisCafCCSmaybeSingletonCCSmkSingletonCCSpprCostCentreCorecostCentreUserNamecostCentreUserNameFScostCentreSrcSpan$fBinaryCCFlavour$fBinaryCostCentre$fOutputableCostCentre$fOutputableCostCentreStack$fDataCostCentre $fEqCCFlavour$fOrdCCFlavour$fDataCCFlavourGreName NormalGreName FieldGreNameAvails AvailInfoAvailAvailTCstableAvailCmpstableGreNameCmpavail availFieldavailTCavailsToNameSetavailsToNameSetWithSelectorsavailsToNameEnvavailExportsDecl availName availGreName availNamesavailNamesWithSelectorsavailNonFldNames availFlds availGreNamesavailSubordinateGreNamesgreNameMangledNamegreNamePrintableNamegreNameSrcSpangreNameFieldLabelpartitionGreNames plusAvail trimAvail filterAvails filterAvail nubAvails$fBinaryGreName$fHasOccNameGreName$fOutputableGreName$fBinaryAvailInfo$fOutputableAvailInfo $fEqAvailInfo$fDataAvailInfo $fDataGreName $fEqGreName ImpItemSpecImpAllImpSome is_explicitis_iloc ImpDeclSpecis_modis_asis_qualis_dloc ImportSpecImpSpecis_declis_itemParentNoParentParentIspar_is GlobalRdrEltGREgre_namegre_pargre_lclgre_imp GlobalRdrEnv LocalRdrEnvUnqualQualOrigExact rdrNameOcc rdrNameSpace demoteRdrNamepromoteRdrName mkRdrUnqual mkRdrQualmkOrigmkUnqual mkVarUnqualmkQual getRdrName nameRdrName isRdrDataCon isRdrTyVarisRdrTc isSrcRdrNameisUnqualisQual isQual_maybeisOrig isOrig_maybeisExact isExact_maybeemptyLocalRdrEnvextendLocalRdrEnvextendLocalRdrEnvListlookupLocalRdrEnvlookupLocalRdrOccelemLocalRdrEnvlocalRdrEnvEltsinLocalRdrEnvScopeminusLocalRdrEnvgresFromAvailslocalGREsFromAvail gresFromAvail greOccNamegreMangledNamegrePrintableNamegreDefinitionSrcSpangreDefinitionModulegreQualModName greRdrNames greSrcSpangreParent_maybegresToAvailInfo availFromGREemptyGlobalRdrEnvglobalRdrEnvEltspprGlobalRdrEnvlookupGlobalRdrEnvlookupGRE_RdrNamelookupGRE_RdrName'lookupGRE_NamelookupGRE_GreNamelookupGRE_FieldLabellookupGRE_Name_OccNamegetGRE_NameQualifier_maybes isLocalGRE isRecFldGREisDuplicateRecFldGREisNoFieldSelectorGREisFieldSelectorGRE greFieldLabelunQualOKpickGREspickGREsModExpplusGlobalRdrEnvmkGlobalRdrEnv transformGREsextendGlobalRdrEnv shadowNames bestImport unQualSpecOK qualSpecOK importSpecLocimportSpecModuleisExplicitItempprNameProvenanceopIsAt $fOrdRdrName $fEqRdrName$fOutputableBndrRdrName$fOutputableRdrName$fHasOccNameRdrName$fOutputableLocalRdrEnv$fOutputableParent$fOutputableImportSpec$fOutputableGlobalRdrElt$fHasOccNameGlobalRdrElt$fDataGlobalRdrElt$fEqImportSpec$fDataImportSpec$fEqImpItemSpec$fDataImpItemSpec$fEqImpDeclSpec$fDataImpDeclSpec $fEqParent $fDataParent $fDataRdrNameImportedModsValimv_nameimv_span imv_is_safe imv_is_hidingimv_all_exports imv_qualified ImportedByImportedByUserImportedBySystem ImportedModsimportedByUserAnnEnv CoreAnnTarget AnnTarget NamedTarget ModuleTarget AnnPayload ann_target ann_value emptyAnnEnvmkAnnEnvextendAnnEnvList plusAnnEnvfindAnnsfindAnnsByTypeRepdeserializeAnns$fBinaryAnnTarget$fOutputableAnnTarget$fOutputableAnnotation$fFunctorAnnTargetNoEpAnnsEpAnnCO AnnSortKey NoAnnSortKey AnnPragmaapr_open apr_closeapr_rest NameAdornment NameParensNameParensHashNameBackquotes NameSquareNameAnn NameAnnCommas NameAnnBars NameAnnOnly NameAnnRArrow NameAnnQuoteNameAnnTrailingnann_adornment nann_open nann_name nann_close nann_trailing nann_commas nann_bars nann_quote nann_quoted AnnContext ac_darrowac_openac_close ParenType AnnParens AnnParensHashAnnParensSquareAnnParen ap_adornmentap_openap_closeAnnList al_anchoral_openal_closeal_rest al_trailing AnnListItem lann_trailing TrailingAnn AddSemiAnn AddCommaAnn AddVbarAnn LocatedAn SrcSpanAnnC SrcSpanAnnP SrcSpanAnnL SrcSpanAnnN SrcSpanAnnALocatedCLocatedPLocatedLLocatedNLocatedASrcAnn SrcSpanAnn' SrcSpanAnnannlocA LEpaComment EpAnnComments EpaCommentsEpaCommentsBalanced priorCommentsfollowingCommentsAnchorOperationUnchangedAnchor MovedAnchorAnchoranchor anchor_opEpAnn EpAnnNotUsedannscommentsDeltaPosSameLine DifferentLine deltaColumn deltaLine TokenLocation NoTokenLocTokenLoc EpaLocationEpaSpanEpaDeltaAddEpAnn EpaCommentTok EpaDocComment EpaDocOptionsEpaLineCommentEpaBlockComment EpaEofComment EpaCommentac_tok ac_prior_tokHasENoEIsUnicodeSyntax NormalSyntax AnnAnyclassAnnAs AnnCloseBU AnnCloseC AnnCloseQU AnnClosePH AnnCloseS AnnCommaTuple AnnDarrowU AnnDcolonU AnnForallU AnnHiding AnnLarrowU AnnLollyUAnnMdoAnnName AnnOpenBUAnnOpenC AnnOpenEQUAnnOpenS AnnOpenPH AnnDollarAnnDollarDollarAnnPackageName AnnPercent AnnPercentOne AnnQualified AnnRarrowUAnnSafeAnnSimpleQuote AnnSignature AnnThTyQuoteAnnUnit AnnValStrAnnViaAnnlarrowtailUAnnrarrowtailUAnnLarrowtailUAnnRarrowtailU unicodeAnndeltaPos getDeltaLineepaLocationRealSrcSpanepaLocationFromSrcAnn spanAsAnchorrealSpanAsAnchor emptyComments parenTypeKwstrailingAnnToAddEpAnnaddTrailingAnnToLaddTrailingAnnToAaddTrailingCommaToNl2nn2lla2nala2lal2lna2lareLocreLocAreLocLreLocCreLocN realSrcSpanla2rextraToAnnListreAnnreAnnCreAnnL getLocAnngetLocAnoLocA noAnnSrcSpan noSrcSpanAnoAnnaddAnnsaddAnnsA widenSpan widenAnchor widenAnchorRwidenLocatedAn epAnnAnnsL epAnnAnnsannParen2AddEpAnn epAnnComments sortLocatedAmapLocA combineLocsAcombineSrcSpansAaddCLocA addCLocAAgetFollowingCommentssetFollowingCommentssetPriorComments noCommentsplaceholderRealSpancommentaddCommentsToSrcAnnsetCommentsSrcAnnaddCommentsToEpAnnsetCommentsEpAnn transferAnnsA commentsOnlyAremoveCommentsA$fOutputableAnnKeywordId$fOutputableIsUnicodeSyntax$fOutputableEpaComment$fOutputableDeltaPos$fOutputableAnchorOperation$fOutputableAnchor$fSemigroupAnchor $fOrdAnchor$fOutputableEpAnnComments$fSemigroupEpAnnComments$fOutputableEpAnn $fMonoidEpAnn$fSemigroupEpAnn$fOutputableEpaLocation$fOutputableAddEpAnn$fOutputableBndrGenLocated$fOutputableSrcSpanAnn'$fSemigroupSrcSpanAnn'$fOutputableTrailingAnn$fOutputableAnnListItem$fMonoidAnnListItem$fSemigroupAnnListItem$fOutputableAnnList$fMonoidAnnList$fSemigroupAnnList$fOutputableAnnContext$fOutputableNameAdornment$fOutputableNameAnn$fMonoidNameAnn$fSemigroupNameAnn$fOutputableAnnPragma$fOutputableAnnSortKey$fMonoidAnnSortKey$fSemigroupAnnSortKey$fOutputableNoEpAnns$fSemigroupNoEpAnns$fDataNoEpAnns $fEqNoEpAnns $fOrdNoEpAnns$fDataAnnSortKey$fEqAnnSortKey$fDataAnnPragma $fEqAnnPragma $fDataNameAnn $fEqNameAnn$fEqNameAdornment$fOrdNameAdornment$fDataNameAdornment$fDataAnnContext$fDataAnnParen $fEqParenType$fOrdParenType$fDataParenType $fDataAnnList $fEqAnnList$fDataAnnListItem$fEqAnnListItem$fDataTrailingAnn$fEqTrailingAnn$fDataSrcSpanAnn'$fEqSrcSpanAnn'$fDataAddEpAnn $fEqAddEpAnn$fDataTokenLocation$fEqTokenLocation$fDataEpaLocation$fEqEpaLocation $fDataEpAnn $fEqEpAnn$fFunctorEpAnn$fDataEpAnnComments$fEqEpAnnComments $fDataAnchor $fEqAnchor $fShowAnchor$fDataAnchorOperation$fEqAnchorOperation$fShowAnchorOperation$fShowDeltaPos $fEqDeltaPos $fOrdDeltaPos$fDataDeltaPos$fEqEpaComment$fDataEpaComment$fShowEpaComment$fEqEpaCommentTok$fDataEpaCommentTok$fShowEpaCommentTok$fEqHasE $fOrdHasE $fDataHasE $fShowHasE$fEqIsUnicodeSyntax$fOrdIsUnicodeSyntax$fDataIsUnicodeSyntax$fShowIsUnicodeSyntax$fEqAnnKeywordId$fOrdAnnKeywordId$fDataAnnKeywordId$fShowAnnKeywordIdBooleanFormulaOrParensLBooleanFormulamkVarmkFalsemkTruemkAndmkOrisFalseisTrueevalsimplify isUnsatisfied impliesAtomimpliespprBooleanFormulapprBooleanFormulaNice$fBinaryBooleanFormula$fOutputableBooleanFormula$fEqBooleanFormula$fDataBooleanFormula$fFunctorBooleanFormula$fFoldableBooleanFormula$fTraversableBooleanFormulafingerprintBinMemcomputeFingerprintputNameLiterallyBuiltInSynFamily sfMatchFam sfInteractTopsfInteractInert CoAxiomRule coaxrNamecoaxrAsmpRoles coaxrRole coaxrProvesTypeEqnRoleNominalRepresentationalPhantom CoAxBranchcab_loccab_tvs cab_eta_tvscab_cvs cab_rolescab_lhscab_rhs cab_incompsCoAxiom co_ax_unique co_ax_name co_ax_roleco_ax_tcco_ax_branchesco_ax_implicitBranches MkBranches unMkBranches UnbranchedBranched BranchFlag BranchIndex manyBranches unbranched fromBranches numBranchesmapAccumBranchestoBranchedAxiomtoUnbranchedAxiomcoAxiomNumPatscoAxiomNthBranch coAxiomArity coAxiomName coAxiomRolecoAxiomBranchescoAxiomSingleBranch_maybecoAxiomSingleBranch coAxiomTyConcoAxBranchTyVarscoAxBranchCoVars coAxBranchLHS coAxBranchRHScoAxBranchRolescoAxBranchSpanisImplicitCoAxiomcoAxBranchIncompsplaceHolderIncomps fsFromRoletrivialBuiltInFamily $fBinaryRole$fOutputableRole$fOutputableCoAxBranch $fDataCoAxiom$fNamedThingCoAxiom$fOutputableCoAxiom$fUniquableCoAxiom $fEqCoAxiom$fOutputableCoAxiomRule$fOrdCoAxiomRule$fEqCoAxiomRule$fUniquableCoAxiomRule$fDataCoAxiomRule$fDataCoAxBranch$fEqRole $fOrdRole $fDataRoleLiftingContexttopNormaliseNewType_maybe coercionType coercionRKind coercionLKind coercionKindseqCo liftCoSubstmkCoercionType coVarRolecoVarKindsTypesRoledecomposePiCos isReflexiveCoisReflCo isGReflCo mkAxiomRuleComkProofIrrelComkSubComkKindCo mkNomReflCo mkGReflComkInstComkLRComkNthCo mkTransComkSymComkUnivCo mkPhantomCo mkAxiomInstCo mkCoVarComkFunCo mkForAllComkAppCo mkTyConAppComkReflCoClassMinimalDefATValidityInfoNoATVIATVI ClassATItemATI DefMethInfo ClassOpItemFunDepClass classTyCon classNameclassKey classTyVarsclassMinimalDefmkClassmkAbstractClass classArityclassAllSelIds classSCSelIds classSCSelId classMethods classOpItemsclassATs classATItems classSCTheta classTvsFds classHasFds classBigSigclassExtraBigSigisAbstractClasspprDefMethInfo pprFundeps pprFunDep $fDataClass$fOutputableClass$fNamedThingClass$fUniquableClass $fEqClass DataConBoxer mkDictSelIdmkDataConWorkIdRegClass RcIntegerRcFloatRcDouble$fOutputableRegClass$fUniquableRegClass $fEqRegClassReg RegVirtualRegRealRealReg RealRegSingle VirtualReg VirtualRegI VirtualRegHi VirtualRegF VirtualRegDRegNorenameVirtualRegclassOfVirtualReggetHiVirtualRegFromLogetHiVRegFromLoregNosOfRealReg realRegsAlias regSingle realRegSingle isRealReg takeRealReg isVirtualRegtakeVirtualRegliftPatchFnToRegReg$fOutputableVirtualReg$fUniquableVirtualReg$fOrdVirtualReg$fOutputableRealReg$fUniquableRealReg$fOutputableReg$fUniquableReg$fEqReg$fOrdReg $fShowReg $fEqRealReg $fShowRealReg $fOrdRealReg$fEqVirtualReg$fShowVirtualRegallNameStringsitName mkUnboundName isUnboundNamebasicKnownKeyNamesgenericTyConNamespRELUDEgHC_PRIMgHC_PRIM_PANICgHC_PRIM_EXCEPTION gHC_TYPES gHC_MAGICgHC_MAGIC_DICT gHC_CSTRING gHC_CLASSESgHC_PRIMOPWRAPPERSgHC_BASEgHC_ENUMgHC_GHCIgHC_GHCI_HELPERSgHC_SHOWgHC_READgHC_NUM gHC_MAYBEgHC_NUM_INTEGERgHC_NUM_NATURALgHC_NUM_BIGNATgHC_LIST gHC_TUPLE dATA_EITHER dATA_LIST dATA_STRING dATA_FOLDABLEdATA_TRAVERSABLEgHC_CONCgHC_IOgHC_IO_ExceptiongHC_STgHC_IX gHC_STABLEgHC_PTRgHC_ERRgHC_REAL gHC_FLOATgHC_TOP_HANDLER sYSTEM_IOdYNAMICtYPEABLEtYPEABLE_INTERNALgENERICS rEAD_PREClEXgHC_INTgHC_WORDmONAD mONAD_FIX mONAD_ZIP mONAD_FAILaRROW gHC_DESUGARrANDOMgHC_EXTScONTROL_EXCEPTION_BASE gHC_GENERICS gHC_TYPEERROR gHC_TYPELITSgHC_TYPELITS_INTERNAL gHC_TYPENATSgHC_TYPENATS_INTERNAL dATA_COERCE dEBUG_TRACE uNSAFE_COERCE gHC_SRCLOC gHC_STACKgHC_STACK_TYPES gHC_STATICPTRgHC_STATICPTR_INTERNALgHC_FINGERPRINT_TYPEgHC_OVER_LABELS gHC_RECORDS rOOT_MAINmkInteractiveModule pRELUDE_NAME mAIN_NAME mkPrimModulemkBignumModule mkBaseModule mkBaseModule_mkThisGhcModulemkThisGhcModule_ mkMainModule mkMainModule_main_RDR_Unqualeq_RDRge_RDRle_RDRlt_RDRgt_RDR compare_RDR ltTag_RDR eqTag_RDR gtTag_RDR eqClass_RDR numClass_RDR ordClass_RDR enumClass_RDRmonadClass_RDRmap_RDR append_RDR foldr_RDR build_RDR returnM_RDR bindM_RDR failM_RDRleft_RDR right_RDR fromEnum_RDR toEnum_RDR enumFrom_RDRenumFromTo_RDRenumFromThen_RDRenumFromThenTo_RDRratioDataCon_RDRintegerAdd_RDRintegerMul_RDR ioDataCon_RDRnewStablePtr_RDR bindIO_RDR returnIO_RDRfromInteger_RDRfromRational_RDR minus_RDR times_RDRplus_RDR toInteger_RDRtoRational_RDRfromIntegral_RDRfromString_RDR fromList_RDR fromListN_RDR toList_RDR compose_RDRand_RDRnot_RDR dataToTag_RDRsucc_RDRpred_RDR minBound_RDR maxBound_RDR range_RDR inRange_RDR index_RDRunsafeIndex_RDRunsafeRangeSize_RDR readList_RDRreadListDefault_RDRreadListPrec_RDRreadListPrecDefault_RDR readPrec_RDR parens_RDR choose_RDRlexP_RDR expectP_RDR readField_RDRreadFieldHash_RDRreadSymField_RDRpunc_RDR ident_RDR symbol_RDRstep_RDRalt_RDR reset_RDRprec_RDR pfail_RDR showsPrec_RDR shows_RDRshowString_RDR showSpace_RDRshowCommaSpace_RDR showParen_RDR error_RDR u1DataCon_RDRpar1DataCon_RDRrec1DataCon_RDR k1DataCon_RDR m1DataCon_RDR l1DataCon_RDR r1DataCon_RDRprodDataCon_RDRcomp1DataCon_RDR unPar1_RDR unRec1_RDRunK1_RDR unComp1_RDRfrom_RDR from1_RDRto_RDRto1_RDRdatatypeName_RDRmoduleName_RDRpackageName_RDRisNewtypeName_RDR selName_RDR conName_RDR conFixity_RDRconIsRecord_RDRprefixDataCon_RDRinfixDataCon_RDRleftAssocDataCon_RDRrightAssocDataCon_RDRnotAssocDataCon_RDRuAddrDataCon_RDRuCharDataCon_RDRuDoubleDataCon_RDRuFloatDataCon_RDRuIntDataCon_RDRuWordDataCon_RDR uAddrHash_RDR uCharHash_RDRuDoubleHash_RDRuFloatHash_RDR uIntHash_RDR uWordHash_RDRfmap_RDR replace_RDRpure_RDRap_RDR liftA2_RDRfoldable_foldr_RDR foldMap_RDRnull_RDRall_RDR traverse_RDR mempty_RDR mappend_RDR varQual_RDR tcQual_RDR clsQual_RDR dataQual_RDR wildCardName runMainIOName runRWName withDictNameorderingTyConNameordLTDataConNameordEQDataConNameordGTDataConName specTyConNameeitherTyConNameleftDataConNamerightDataConName v1TyConName u1TyConName par1TyConName rec1TyConName k1TyConName m1TyConName sumTyConName prodTyConName compTyConName rTyConName dTyConName cTyConName sTyConName rec0TyConName d1TyConName c1TyConName s1TyConName repTyConName rep1TyConName uRecTyConNameuAddrTyConNameuCharTyConNameuDoubleTyConNameuFloatTyConName uIntTyConNameuWordTyConNameprefixIDataConNameinfixIDataConNameleftAssociativeDataConNamerightAssociativeDataConNamenotAssociativeDataConNamesourceUnpackDataConNamesourceNoUnpackDataConNamenoSourceUnpackednessDataConNamesourceLazyDataConNamesourceStrictDataConNamenoSourceStrictnessDataConNamedecidedLazyDataConNamedecidedStrictDataConNamedecidedUnpackDataConNamemetaDataDataConNamemetaConsDataConNamemetaSelDataConName divIntName modIntNamecstringLengthName eqStringNameunpackCStringNameunpackCStringAppendNameunpackCStringFoldrNameunpackCStringUtf8NameunpackCStringAppendUtf8NameunpackCStringFoldrUtf8Name inlineIdName eqClassNameeqName ordClassNamegeNamefunctorClassNamefmapNamemonadClassName thenMName bindMName returnMNamemonadFailClassName failMNameapplicativeClassNameapAName pureAName thenANamefoldableClassNametraversableClassNamesemigroupClassName sappendNamemonoidClassName memptyName mappendName mconcatName joinMNamealternativeClassName joinMIdKey apAClassOpKeypureAClassOpKeythenAClassOpKeyalternativeClassKey groupWithNameconsiderAccessibleName dollarNameotherwiseIdName foldrName buildName augmentNamemapName appendName assertNamefromStringName numClassNamefromIntegerName minusName negateName bnbVarQual bnnVarQual bniVarQualbignatFromWordListName bignatEqNamebignatCompareNamebignatCompareWordNamenaturalToWordNamenaturalPopCountNamenaturalShiftRNamenaturalShiftLNamenaturalAddNamenaturalSubNamenaturalSubThrowNamenaturalSubUnsafeNamenaturalMulNamenaturalQuotRemNamenaturalQuotNamenaturalRemNamenaturalAndNamenaturalAndNotName naturalOrNamenaturalXorNamenaturalTestBitNamenaturalBitNamenaturalGcdNamenaturalLcmNamenaturalLog2NamenaturalLogBaseWordNamenaturalLogBaseNamenaturalPowModNamenaturalSizeInBaseNameintegerFromNaturalNameintegerToNaturalClampNameintegerToNaturalThrowNameintegerToNaturalNameintegerToWordNameintegerToIntNameintegerToWord64NameintegerToInt64NameintegerFromWordNameintegerFromWord64NameintegerFromInt64NameintegerAddNameintegerMulNameintegerSubNameintegerNegateNameintegerAbsNameintegerPopCountNameintegerQuotNameintegerRemNameintegerDivNameintegerModNameintegerDivModNameintegerQuotRemNameintegerEncodeFloatNameintegerEncodeDoubleNameintegerGcdNameintegerLcmNameintegerAndName integerOrNameintegerXorNameintegerComplementNameintegerBitNameintegerTestBitNameintegerShiftLNameintegerShiftRNamerationalTyConNameratioTyConNameratioDataConName realClassNameintegralClassNamerealFracClassNamefractionalClassNamefromRationalName toIntegerNametoRationalNamefromIntegralNamerealToFracNamemkRationalBase2NamemkRationalBase10NamefloatingClassNamerealFloatClassNameintegerToFloatNameintegerToDoubleNamenaturalToFloatNamenaturalToDoubleNamerationalToFloatNamerationalToDoubleName ixClassNametrModuleTyConNametrModuleDataConNametrNameTyConNametrNameSDataConNametrNameDDataConNametrTyConTyConNametrTyConDataConNamekindRepTyConNamekindRepTyConAppDataConNamekindRepVarDataConNamekindRepAppDataConNamekindRepFunDataConNamekindRepTYPEDataConNamekindRepTypeLitSDataConNamekindRepTypeLitDDataConNametypeLitSortTyConNametypeLitSymbolDataConNametypeLitNatDataConNametypeLitCharDataConNametypeableClassNametypeRepTyConNamesomeTypeRepTyConNamesomeTypeRepDataConName typeRepIdName mkTrTypeName mkTrConName mkTrAppName mkTrFunNametypeNatTypeRepNametypeSymbolTypeRepNametypeCharTypeRepNametrGhcPrimModuleNamestarKindRepNamestarArrStarKindRepNamestarArrStarArrStarKindRepNameerrorMessageTypeErrorFamNametypeErrorTextDataConNametypeErrorAppendDataConNametypeErrorVAppendDataConNametypeErrorShowTypeDataConNameunsafeEqualityProofNameunsafeEqualityTyConNameunsafeReflDataConNameunsafeCoercePrimName toDynName dataClassNameassertErrorName traceName enumClassName enumFromNameenumFromToNameenumFromThenNameenumFromThenToNameboundedClassName concatName filterNamezipNameisListClassName fromListName fromListNName toListName getFieldName setFieldName showClassName readClassName genClassName gen1ClassNamedatatypeClassNameconstructorClassNameselectorClassNamegenericClassNamesghciIoClassNameghciStepIoMName ioTyConName ioDataConName thenIOName bindIOName returnIOName failIOName printName int8TyConNameint16TyConNameint32TyConNameint64TyConNameword8TyConNameword16TyConNameword32TyConNameword64TyConName ptrTyConNamefunPtrTyConNamestablePtrTyConNamenewStablePtrNamemonadFixClassNamemfixNamearrAName composeAName firstANameappAName choiceAName loopAName guardMName liftMNamemzipNametoAnnotationWrapperNamemonadPlusClassNamerandomClassNamerandomGenClassNameisStringClassNameknownNatClassNameknownSymbolClassNameknownCharClassNamefromLabelClassOpName ipClassNamehasFieldClassNamecallStackTyConNameemptyCallStackNamepushCallStackNamesrcLocDataConNamepLUGINSpluginTyConNamefrontendPluginTyConNamemakeStaticNamestaticPtrInfoTyConNamestaticPtrInfoDataConNamestaticPtrTyConNamestaticPtrDataConNamefromStaticPtrNamefingerprintDataConNamevarQualtcQualclsQualdcQualmk_known_key_nameboundedClassKey enumClassKey eqClassKeyfloatingClassKeyfractionalClassKeyintegralClassKey monadClassKey dataClassKeyfunctorClassKey numClassKey ordClassKey readClassKey realClassKeyrealFloatClassKeyrealFracClassKey showClassKey ixClassKeytypeableClassKeymonadFixClassKeymonadFailClassKeymonadPlusClassKeyrandomClassKeyrandomGenClassKeyisStringClassKeyapplicativeClassKeyfoldableClassKeytraversableClassKey genClassKey gen1ClassKeydatatypeClassKeyconstructorClassKeyselectorClassKeyknownNatClassNameKeyknownSymbolClassNameKeyknownCharClassNameKeyghciIoClassKeysemigroupClassKeymonoidClassKey ipClassKeyhasFieldClassNameKeyaddrPrimTyConKeyarrayPrimTyConKey boolTyConKeybyteArrayPrimTyConKeystringTyConKeycharPrimTyConKey charTyConKeydoublePrimTyConKeydoubleTyConKeyfloatPrimTyConKey floatTyConKey funTyConKeyintPrimTyConKey intTyConKeyint8PrimTyConKey int8TyConKeyint16PrimTyConKey int16TyConKeyint32PrimTyConKey int32TyConKeyint64PrimTyConKey int64TyConKeyintegerTyConKeynaturalTyConKey listTyConKeyforeignObjPrimTyConKey maybeTyConKeyweakPrimTyConKeymutableArrayPrimTyConKeymutableByteArrayPrimTyConKeyorderingTyConKeymVarPrimTyConKeyioPortPrimTyConKey ratioTyConKeyrationalTyConKeyrealWorldTyConKeystablePtrPrimTyConKeystablePtrTyConKey eqTyConKey heqTyConKeystatePrimTyConKeystableNamePrimTyConKeystableNameTyConKeyeqPrimTyConKeyeqReprPrimTyConKeyeqPhantPrimTyConKeymutVarPrimTyConKey ioTyConKeywordPrimTyConKey wordTyConKeyword8PrimTyConKey word8TyConKeyword16PrimTyConKeyword16TyConKeyword32PrimTyConKeyword32TyConKeyword64PrimTyConKeyword64TyConKey kindConKey boxityConKey typeConKeythreadIdPrimTyConKeybcoPrimTyConKey ptrTyConKeyfunPtrTyConKeytVarPrimTyConKeycompactPrimTyConKeystackSnapshotPrimTyConKeyisReflPrimTyConKeyeitherTyConKeynonEmptyTyConKeyliftedTypeKindTyConKeyunliftedTypeKindTyConKey tYPETyConKeyconstraintKindTyConKeylevityTyConKeyruntimeRepTyConKeyvecCountTyConKeyvecElemTyConKeyliftedRepTyConKeyunliftedRepTyConKeyzeroBitRepTyConKeyzeroBitTypeTyConKeypluginTyConKeyfrontendPluginTyConKeytrTyConTyConKeytrModuleTyConKeytrNameTyConKeykindRepTyConKeytypeLitSortTyConKey v1TyConKey u1TyConKey par1TyConKey rec1TyConKey k1TyConKey m1TyConKey sumTyConKey prodTyConKey compTyConKey rTyConKey dTyConKey cTyConKey sTyConKey rec0TyConKey d1TyConKey c1TyConKey s1TyConKey repTyConKey rep1TyConKey uRecTyConKey uAddrTyConKey uCharTyConKeyuDoubleTyConKeyuFloatTyConKey uIntTyConKey uWordTyConKeyerrorMessageTypeErrorFamKeycoercibleTyConKeyproxyPrimTyConKey specTyConKey anyTyConKeysmallArrayPrimTyConKeysmallMutableArrayPrimTyConKeystaticPtrTyConKeystaticPtrInfoTyConKeycallStackTyConKeytypeRepTyConKeysomeTypeRepTyConKeysomeTypeRepDataConKeytypeSymbolAppendFamNameKeyunsafeEqualityTyConKeymultiplicityTyConKeyunrestrictedFunTyConKeymultMulTyConKeyint8X16PrimTyConKeyint16X8PrimTyConKeyint32X4PrimTyConKeyint64X2PrimTyConKeyint8X32PrimTyConKeyint16X16PrimTyConKeyint32X8PrimTyConKeyint64X4PrimTyConKeyint8X64PrimTyConKeyint16X32PrimTyConKeyint32X16PrimTyConKeyint64X8PrimTyConKeyword8X16PrimTyConKeyword16X8PrimTyConKeyword32X4PrimTyConKeyword64X2PrimTyConKeyword8X32PrimTyConKeyword16X16PrimTyConKeyword32X8PrimTyConKeyword64X4PrimTyConKeyword8X64PrimTyConKeyword16X32PrimTyConKeyword32X16PrimTyConKeyword64X8PrimTyConKeyfloatX4PrimTyConKeydoubleX2PrimTyConKeyfloatX8PrimTyConKeydoubleX4PrimTyConKeyfloatX16PrimTyConKeydoubleX8PrimTyConKeytypeSymbolKindConNameKeytypeCharKindConNameKeytypeNatAddTyFamNameKeytypeNatMulTyFamNameKeytypeNatExpTyFamNameKeytypeNatSubTyFamNameKeytypeSymbolCmpTyFamNameKeytypeNatCmpTyFamNameKeytypeCharCmpTyFamNameKeytypeLeqCharTyFamNameKeytypeNatDivTyFamNameKeytypeNatModTyFamNameKeytypeNatLogTyFamNameKeytypeConsSymbolTyFamNameKeytypeUnconsSymbolTyFamNameKeytypeCharToNatTyFamNameKeytypeNatToCharTyFamNameKeycharDataConKeyconsDataConKeydoubleDataConKeyfalseDataConKeyfloatDataConKey intDataConKeynothingDataConKeyjustDataConKey eqDataConKey nilDataConKeyratioDataConKeyword8DataConKeystableNameDataConKeytrueDataConKeywordDataConKey ioDataConKey heqDataConKeynonEmptyDataConKeycrossDataConKey inlDataConKey inrDataConKeygenUnitDataConKeyleftDataConKeyrightDataConKeyordLTDataConKeyordEQDataConKeyordGTDataConKeycoercibleDataConKeystaticPtrDataConKeystaticPtrInfoDataConKeyfingerprintDataConKeysrcLocDataConKeytrTyConDataConKeytrModuleDataConKeytrNameSDataConKeytrNameDDataConKeytrGhcPrimModuleKeytypeErrorTextDataConKeytypeErrorAppendDataConKeytypeErrorVAppendDataConKeytypeErrorShowTypeDataConKeyprefixIDataConKeyinfixIDataConKeyleftAssociativeDataConKeyrightAssociativeDataConKeynotAssociativeDataConKeysourceUnpackDataConKeysourceNoUnpackDataConKeynoSourceUnpackednessDataConKeysourceLazyDataConKeysourceStrictDataConKeynoSourceStrictnessDataConKeydecidedLazyDataConKeydecidedStrictDataConKeydecidedUnpackDataConKeymetaDataDataConKeymetaConsDataConKeymetaSelDataConKeyvecRepDataConKeytupleRepDataConKeysumRepDataConKeyboxedRepDataConKeyboxedRepDataConTyConKeytupleRepDataConTyConKeyruntimeRepSimpleDataConKeysliftedDataConKeyunliftedDataConKeyvecCountDataConKeysvecElemDataConKeyskindRepTyConAppDataConKeykindRepVarDataConKeykindRepAppDataConKeykindRepFunDataConKeykindRepTYPEDataConKeykindRepTypeLitSDataConKeykindRepTypeLitDDataConKeytypeLitSymbolDataConKeytypeLitNatDataConKeytypeLitCharDataConKeyunsafeReflDataConKey oneDataConKeymanyDataConKeyintegerISDataConKeyintegerINDataConKeyintegerIPDataConKeynaturalNSDataConKeynaturalNBDataConKey wildCardKeyabsentErrorIdKey augmentIdKey appendIdKey buildIdKey foldrIdKeyrecSelErrorIdKeyseqIdKeyabsentSumFieldErrorIdKey eqStringIdKeynoMethodBindingErrorIdKeynonExhaustiveGuardsErrorIdKeyruntimeErrorIdKey patErrorIdKeyrealWorldPrimIdKeyrecConErrorIdKeyunpackCStringUtf8IdKeyunpackCStringAppendUtf8IdKeyunpackCStringFoldrUtf8IdKeyunpackCStringIdKeyunpackCStringAppendIdKeyunpackCStringFoldrIdKey voidPrimIdKeytypeErrorIdKey divIntIdKey modIntIdKeycstringLengthIdKeyraiseOverflowIdKeyraiseUnderflowIdKeyraiseDivZeroIdKey concatIdKey filterIdKeyzipIdKey bindIOIdKey returnIOIdKeynewStablePtrIdKey printIdKey failIOIdKey nullAddrIdKey voidArgIdKeyotherwiseIdKey assertIdKeyleftSectionKeyrightSectionKey rootMainKey runMainKey thenIOIdKey lazyIdKeyassertErrorIdKey oneShotKeyrunRWKeytraceKey inlineIdKeymapIdKeygroupWithIdKey dollarIdKeycoercionTokenIdKey noinlineIdKeyconsiderAccessibleIdKeyintegerToFloatIdKeyintegerToDoubleIdKeynaturalToFloatIdKeynaturalToDoubleIdKeyrationalToFloatIdKeyrationalToDoubleIdKey withDictKey coerceKey unboundKeyfromIntegerClassOpKeyminusClassOpKeyfromRationalClassOpKeyenumFromClassOpKeyenumFromThenClassOpKeyenumFromToClassOpKeyenumFromThenToClassOpKey eqClassOpKey geClassOpKeynegateClassOpKeybindMClassOpKeythenMClassOpKeyfmapClassOpKeyreturnMClassOpKey mfixIdKeyfailMClassOpKeyfromLabelClassOpKey arrAIdKey composeAIdKey firstAIdKey appAIdKey choiceAIdKey loopAIdKeyfromStringClassOpKeytoAnnotationWrapperIdKeyfromIntegralIdKeyrealToFracIdKeytoIntegerClassOpKeytoRationalClassOpKey guardMIdKey liftMIdKey mzipIdKeyghciStepIoMClassOpKeyisListClassKeyfromListClassOpKeyfromListNClassOpKeytoListClassOpKey proxyHashKey mkTyConKey mkTrTypeKey mkTrConKey mkTrAppKeytypeNatTypeRepKeytypeSymbolTypeRepKeytypeCharTypeRepKey typeRepIdKey mkTrFunKey trTYPEKeytrTYPE'PtrRepLiftedKeytrRuntimeRepKeytr'PtrRepLiftedKeytrLiftedRepKeystarKindRepKeystarArrStarKindRepKeystarArrStarArrStarKindRepKey toDynIdKeybitIntegerIdKey eqSCSelIdKey heqSCSelIdKeycoercibleSCSelIdKeysappendClassOpKeymemptyClassOpKeymappendClassOpKeymconcatClassOpKeyemptyCallStackKeypushCallStackKeyfromStaticPtrClassOpKey makeStaticKeyunsafeEqualityProofIdKeyunsafeCoercePrimIdKeygetFieldClassOpKeysetFieldClassOpKeyintegerFromNaturalIdKeyintegerToNaturalClampIdKeyintegerToNaturalThrowIdKeyintegerToNaturalIdKeyintegerToWordIdKeyintegerToIntIdKeyintegerToWord64IdKeyintegerToInt64IdKeyintegerAddIdKeyintegerMulIdKeyintegerSubIdKeyintegerNegateIdKeyintegerAbsIdKeyintegerPopCountIdKeyintegerQuotIdKeyintegerRemIdKeyintegerDivIdKeyintegerModIdKeyintegerDivModIdKeyintegerQuotRemIdKeyintegerEncodeFloatIdKeyintegerEncodeDoubleIdKeyintegerGcdIdKeyintegerLcmIdKeyintegerAndIdKeyintegerOrIdKeyintegerXorIdKeyintegerComplementIdKeyintegerBitIdKeyintegerTestBitIdKeyintegerShiftLIdKeyintegerShiftRIdKeyintegerFromWordIdKeyintegerFromWord64IdKeyintegerFromInt64IdKeynaturalToWordIdKeynaturalPopCountIdKeynaturalShiftRIdKeynaturalShiftLIdKeynaturalAddIdKeynaturalSubIdKeynaturalSubThrowIdKeynaturalSubUnsafeIdKeynaturalMulIdKeynaturalQuotRemIdKeynaturalQuotIdKeynaturalRemIdKeynaturalAndIdKeynaturalAndNotIdKeynaturalOrIdKeynaturalXorIdKeynaturalTestBitIdKeynaturalBitIdKeynaturalGcdIdKeynaturalLcmIdKeynaturalLog2IdKeynaturalLogBaseWordIdKeynaturalLogBaseIdKeynaturalPowModIdKeynaturalSizeInBaseIdKeybignatFromWordListIdKey bignatEqIdKeybignatCompareIdKeybignatCompareWordIdKeymkRationalBase2IdKeymkRationalBase10IdKeynumericClassKeysfractionalClassKeysstandardClassKeysderivableClassKeysinteractiveClassNamesinteractiveClassKeyspretendNameIsInScope hiVersionmAX_TUPLE_SIZEmAX_CTUPLE_SIZE mAX_SUM_SIZEmAX_REDUCTION_DEPTHmAX_SOLVER_ITERATIONS wORD64_SIZE fLOAT_SIZE dOUBLE_SIZEtARGET_MAX_CHAR TyConFlavour ClassFlavour TupleFlavour SumFlavourDataTypeFlavourNewtypeFlavourAbstractTypeFlavourDataFamilyFlavourOpenTypeFamilyFlavourClosedTypeFamilyFlavourTypeSynonymFlavourBuiltInTypeFlavourPromotedDataConFlavour PrimElemRep Int8ElemRep Int16ElemRep Int32ElemRep Int64ElemRep Word8ElemRep Word16ElemRep Word32ElemRep Word64ElemRep FloatElemRep DoubleElemRepPrimRepVoidRep LiftedRep UnliftedRepInt8RepInt16RepInt32RepInt64RepIntRepWord8Rep Word16Rep Word32Rep Word64RepWordRepAddrRepFloatRep DoubleRepVecRep FamTyConFlavDataFamilyTyConOpenSynFamilyTyConClosedSynFamilyTyConAbstractClosedSynFamilyTyConBuiltInSynFamTyCon Injectivity NotInjective Injective AlgTyConFlavVanillaAlgTyConUnboxedSumTyCon ClassTyConDataFamInstTyConRuntimeRepInfoNoRRI RuntimeRepVecCountVecElem LiftedInfo UnliftedInfo AlgTyConRhs AbstractTyCon DataTyCon TupleTyConSumTyConNewTyCon data_consdata_cons_sizeis_enumdata_fixed_levdata_contup_sortnt_rhs nt_etad_rhsnt_co nt_fixed_rep tyConUnique tyConBinders tyConResKind tyConKind tyConAritytyConNullaryTy tyConTyVars tyConCType algTcFields famTcResVartcTyConScopedTyVars tcTyConIsPoly TyConBndrVisNamedTCBAnonTCBTyConTyCoBinder TyConBindermkAnonTyConBindermkAnonTyConBindersmkNamedTyConBindermkNamedTyConBindersmkRequiredTyConBindertyConBinderArgFlagtyConBndrVisArgFlagisNamedTyConBinderisVisibleTyConBinderisVisibleTcbVisisInvisibleTyConBinder mkTyConKindtyConInvisTVBinderstyConVisibleTyVarsmkLevPolyDataTyConRhsmkDataTyConRhsvisibleDataCons isNoParenttyConRepModOcc isVoidRep isGcPtrRepprimRepCompatibleprimRepsCompatible primRepSizeBprimElemRepSizeBprimElemRepToPrimRepprimRepIsFloattyConFieldLabelslookupTyConFieldLabel mkFunTyCon mkAlgTyCon mkClassTyCon mkTupleTyCon mkSumTyCon mkTcTyConnoTcTyConScopedTyVars mkPrimTyConmkSynonymTyCon mkFamilyTyConmkPromotedDataConisAbstractTyCon isPrimTyCon isAlgTyConisVanillaAlgTyConisConstraintKindCon isDataTyConisInjectiveTyConisGenerativeTyConisGenInjAlgRhs isNewTyConunwrapNewTyCon_maybeunwrapNewTyConEtad_maybeisTypeSynonymTyCon isTauTyConisFamFreeTyConisForgetfulSynTyConmustBeSaturatedisGadtSyntaxTyConisEnumerationTyCon isFamilyTyConisOpenFamilyTyConisTypeFamilyTyConisDataFamilyTyConisOpenTypeFamilyTyCon%isClosedSynFamilyTyConWithAxiom_maybetyConInjectivityInfoisBuiltInSynFamTyCon_maybe isTyConAssoctyConAssoc_maybetyConFlavourAssoc_maybetyConTuple_maybeisBoxedTupleTyConisUnboxedSumTyConisPromotedTupleTyConisPromotedDataConisPromotedDataCon_maybe isKindTyConisLiftedTypeKindTyConNameisImplicitTyContyConCType_maybe isTcTyConsetTcTyConKindtcHasFixedRuntimeRepisConcreteTyConexpandSynTyCon_maybeisTyConWithSrcDataCons tyConDataConstyConDataCons_maybetyConSingleDataCon_maybetyConSingleDataContyConSingleAlgDataCon_maybetyConAlgDataCons_maybetyConFamilySize algTyConRhstyConFamilyResVar_maybe tyConRoles newTyConRhsnewTyConEtadAritynewTyConEtadRhsnewTyConCo_maybe newTyConConewTyConDataCon_maybetyConStupidThetasynTyConDefn_maybesynTyConRhs_maybefamTyConFlav_maybe isClassTyContyConClass_maybetyConATsisFamInstTyContyConFamInstSig_maybetyConFamInst_maybetyConFamilyCoercion_maybetyConRuntimeRepInfo mkTyConTagMap tyConFlavourtcFlavourIsOpenpprPromotionQuote tyConSkolem$fBinaryTyConBndrVis$fOutputableTyConBndrVis$fBinaryInjectivity$fOutputableFamTyConFlav$fBinaryPrimElemRep$fOutputablePrimElemRep$fBinaryPrimRep$fOutputablePrimRep $fDataTyCon$fNamedThingTyCon$fOutputableTyConFlavour$fOutputableTyCon$fUniquableTyCon $fEqTyCon$fOutputableAlgTyConFlav$fEqTyConFlavour $fDataPrimRep $fEqPrimRep $fOrdPrimRep $fShowPrimRep$fDataPrimElemRep$fEqPrimElemRep$fOrdPrimElemRep$fShowPrimElemRep$fEnumPrimElemRep$fEqInjectivitytidyToIfaceTcArgstoIfaceCoercionX toIfaceTcArgs toIfaceTyContoIfaceForAllBndr toIfaceTyLit toIfaceTypeX DTyConEnvTyConEnvnonDetTyConEnvElts emptyTyConEnvisEmptyTyConEnv unitTyConEnvextendTyConEnvextendTyConEnvListlookupTyConEnv alterTyConEnv mkTyConEnvmkTyConEnvWith elemTyConEnv plusTyConEnvplusTyConEnv_CplusTyConEnv_CDplusTyConEnv_CD2extendTyConEnv_C mapTyConEnvextendTyConEnv_AccextendTyConEnvList_CdelFromTyConEnvdelListFromTyConEnvfilterTyConEnv anyTyConEnvdisjointTyConEnvlookupTyConEnv_NFemptyDTyConEnvisEmptyDTyConEnvlookupDTyConEnvdelFromDTyConEnvfilterDTyConEnv mapDTyConEnvmapMaybeDTyConEnvadjustDTyConEnvalterDTyConEnvextendDTyConEnv foldDTyConEnv RecTcChecker initRecTcdefaultRecTcMaxBoundsetRecTcMaxBound checkRecTc$fOutputableRecTcChecker TyCoFoldertcf_view tcf_tyvar tcf_covartcf_holetcf_tycobinder CoercionHole ch_co_varch_ref PhantomProvProofIrrelProv PluginProv CorePrepProv MCoercionRMReflMCo KindCoercion CoercionP CoercionRReflGRefl TyConAppCoAppCoForAllCoFunCoCoVarCo AxiomInstCo AxiomRuleCoUnivCoSymCoTransCoNthCoLRCoInstCoKindCoSubCoHoleCoTyBinderNamedAnonKnotTiedNumTyLitStrTyLit CharTyLitTyVarTyAppTyTyConAppForAllTyFunTyLitTyCastTy CoercionTyft_afft_multft_argft_resRuntimeRepType KindOrTypenonDetCmpTyLitcmpTyLit delBinderVarisInvisibleBinderisVisibleBinder isNamedBinder isTyBinder mkTyVarTy mkTyVarTys mkTyCoVarTy mkTyCoVarTysmkFunTy mkScaledFunTy mkVisFunTy mkInvisFunTymkVisFunTyManymkInvisFunTyMany mkVisFunTysmkVisFunTysManymkInvisFunTysMany mkForAllTysmkInvisForAllTysmkPiTymkPiTys coHoleCoVarsetCoHoleCoVarfoldTyConoViewtypeSize coercionSizeprovSize scaledMult scaledThing mapScaledType$fOutputableTyLit$fUniquableCoercionHole$fOutputableCoercionHole$fDataCoercionHole$fOutputableUnivCoProvenance$fOutputableMCoercion$fOutputableCoercion$fOutputableType$fOutputableScaled$fOutputableTyCoBinder$fDataTyCoBinder $fDataScaled $fDataType$fDataCoercion$fDataUnivCoProvenance$fDataMCoercion $fEqTyLit $fDataTyLit runTyCoVarstyCoVarsOfTypetyCoVarsOfTypes tyCoVarsOfCo tyCoVarsOfMCo tyCoVarsOfCos deepTcvFoldershallowTyCoVarsOfTypeshallowTyCoVarsOfTypesshallowTyCoVarsOfCoshallowTyCoVarsOfCosshallowTyCoVarsOfTyVarEnvshallowTyCoVarsOfCoVarEnv coVarsOfType coVarsOfTypes coVarsOfCo coVarsOfCoscloseOverKindscloseOverKindsListcloseOverKindsDSettyCoVarsOfTypeDSettyCoVarsOfTypeListtyCoVarsOfTypesDSettyCoVarsOfTypesList tyCoFVsOfType tyCoFVsBndrtyCoFVsVarBndrstyCoFVsVarBndrtyCoFVsOfTypestyCoVarsOfCoDSettyCoVarsOfCoList tyCoFVsOfCo tyCoFVsOfCosalmostDevoidCoVarOfCoinjectiveVarsOfTypeinjectiveVarsOfTypesinvisibleVarsOfTypeinvisibleVarsOfTypesanyFreeVarsOfTypeanyFreeVarsOfTypesanyFreeVarsOfConoFreeVarsOfTypenoFreeVarsOfTypesnoFreeVarsOfCo scopedSorttyCoVarsOfTypeWellScopedtyCoVarsOfTypesWellScoped tidyVarBndrs tidyVarBndravoidNameClashestidyTyCoVarBindertidyTyCoVarBinderstidyFreeTyCoVarstidyOpenTyCoVarstidyOpenTyCoVartidyTyCoVarOcc tidyTypestidyType tidyOpenTypes tidyOpenType tidyTopTypetidyCotidyCos CvSubstEnv TvSubstEnvTCvSubstemptyTvSubstEnvemptyCvSubstEnvcomposeTCvSubstEnvcomposeTCvSubst emptyTCvSubstmkEmptyTCvSubstisEmptyTCvSubst mkTCvSubst mkTvSubst mkCvSubst getTvSubstEnv getCvSubstEnv getTCvInScopegetTCvSubstRangeFVs isInScope elemTCvSubstnotElemTCvSubst setTvSubstEnv setCvSubstEnv zapTCvSubstextendTCvInScopeextendTCvInScopeListextendTCvInScopeSetextendTCvSubstextendTCvSubstWithClone extendTvSubstextendTvSubstBinderAndInScopeextendTvSubstWithClone extendCvSubstextendCvSubstWithCloneextendTvSubstAndInScopeextendTvSubstListextendTCvSubstList unionTCvSubst zipTvSubst zipCvSubst zipTCvSubst mkTvSubstPrszipTyEnvzipCoEnv substTyWithsubstTyWithUncheckedsubstTyWithInScope substCoWithsubstCoWithUncheckedsubstTyWithCoVars substTysWithsubstTysWithCoVarssubstTyAddInScopeisValidTCvSubstcheckValidSubstsubstTyUnchecked substScaledTysubstScaledTyUncheckedsubstTyssubstScaledTyssubstTysUncheckedsubstScaledTysUnchecked substThetasubstThetaUnchecked substTyVar substTyVars substTyCoVars lookupTyVarsubstCosubstCoUncheckedsubstCossubstForAllCoBndrsubstForAllCoBndrUsing substCoVar substCoVars lookupCoVarsubstTyVarBndrsubstTyVarBndrs substVarBndr substVarBndrssubstCoVarBndrsubstVarBndrUsingcloneTyVarBndrcloneTyVarBndrs substTyCoBndr$fOutputableTCvSubst primTyConsunexposedPrimTyConsexposedPrimTyConscharPrimTyConNameintPrimTyConNameint8PrimTyConNameint16PrimTyConNameint32PrimTyConNameint64PrimTyConNamewordPrimTyConNameword8PrimTyConNameword16PrimTyConNameword32PrimTyConNameword64PrimTyConNameaddrPrimTyConNamefloatPrimTyConNamedoublePrimTyConNamemkTemplateKindVarmkTemplateKindVarsmkTemplateTyVarsFrommkTemplateTyVarsmkTemplateTyConBindersmkTemplateKiTyVarsmkTemplateKiTyVarmkTemplateKindTyConBindersmkTemplateAnonTyConBinders alphaTyVars alphaTyVar betaTyVar gammaTyVar deltaTyVaralphaTyVarSpec betaTyVarSpecgammaTyVarSpecdeltaTyVarSpecalphaTysalphaTybetaTygammaTydeltaTyalphaTyVarsUnliftedRepalphaTyVarUnliftedRepalphaTysUnliftedRepalphaTyUnliftedRepruntimeRep1TyVarruntimeRep2TyVarruntimeRep3TyVarruntimeRep1TyVarInfruntimeRep2TyVarInf runtimeRep1Ty runtimeRep2Ty runtimeRep3TyopenAlphaTyVar openBetaTyVaropenGammaTyVaropenAlphaTyVarSpecopenBetaTyVarSpecopenGammaTyVarSpec openAlphaTy openBetaTy openGammaTy levity2TyVar levity1TyVarlevity1TyVarInflevity2TyVarInf levity1Ty levity2TylevPolyAlphaTyVarlevPolyBetaTyVarlevPolyAlphaTyVarSpeclevPolyBetaTyVarSpeclevPolyAlphaTy levPolyBetaTymultiplicityTyVar1multiplicityTyVar2 funTyConName tYPETyCon tYPETyConNamemkPrimTyConNamefunctionWithMultiplicity charPrimTy charPrimTyCon intPrimTy intPrimTyCon int8PrimTy int8PrimTyCon int16PrimTyint16PrimTyCon int32PrimTyint32PrimTyCon int64PrimTyint64PrimTyCon wordPrimTy wordPrimTyCon word8PrimTyword8PrimTyCon word16PrimTyword16PrimTyCon word32PrimTyword32PrimTyCon word64PrimTyword64PrimTyCon addrPrimTy addrPrimTyCon floatPrimTyfloatPrimTyCon doublePrimTydoublePrimTyCon mkStatePrimTystatePrimTyConrealWorldTyCon realWorldTyrealWorldStatePrimTy mkProxyPrimTyproxyPrimTyCon eqPrimTyConeqReprPrimTyConeqPhantPrimTyCon equalityTyConisReflPrimTyConarrayPrimTyConmutableArrayPrimTyConmutableByteArrayPrimTyConbyteArrayPrimTyConsmallArrayPrimTyConsmallMutableArrayPrimTyCon mkArrayPrimTybyteArrayPrimTymkSmallArrayPrimTymkMutableArrayPrimTymkMutableByteArrayPrimTymkSmallMutableArrayPrimTymutVarPrimTyConmkMutVarPrimTyioPortPrimTyConmkIOPortPrimTy mVarPrimTyCon mkMVarPrimTy tVarPrimTyCon mkTVarPrimTystablePtrPrimTyConmkStablePtrPrimTystableNamePrimTyConmkStableNamePrimTycompactPrimTyCon compactPrimTystackSnapshotPrimTyConstackSnapshotPrimTy bcoPrimTy bcoPrimTyCon weakPrimTyCon mkWeakPrimTythreadIdPrimTythreadIdPrimTyCon int8X16PrimTyint8X16PrimTyCon int16X8PrimTyint16X8PrimTyCon int32X4PrimTyint32X4PrimTyCon int64X2PrimTyint64X2PrimTyCon int8X32PrimTyint8X32PrimTyConint16X16PrimTyint16X16PrimTyCon int32X8PrimTyint32X8PrimTyCon int64X4PrimTyint64X4PrimTyCon int8X64PrimTyint8X64PrimTyConint16X32PrimTyint16X32PrimTyConint32X16PrimTyint32X16PrimTyCon int64X8PrimTyint64X8PrimTyConword8X16PrimTyword8X16PrimTyConword16X8PrimTyword16X8PrimTyConword32X4PrimTyword32X4PrimTyConword64X2PrimTyword64X2PrimTyConword8X32PrimTyword8X32PrimTyConword16X16PrimTyword16X16PrimTyConword32X8PrimTyword32X8PrimTyConword64X4PrimTyword64X4PrimTyConword8X64PrimTyword8X64PrimTyConword16X32PrimTyword16X32PrimTyConword32X16PrimTyword32X16PrimTyConword64X8PrimTyword64X8PrimTyCon floatX4PrimTyfloatX4PrimTyCondoubleX2PrimTydoubleX2PrimTyCon floatX8PrimTyfloatX8PrimTyCondoubleX4PrimTydoubleX4PrimTyConfloatX16PrimTyfloatX16PrimTyCondoubleX8PrimTydoubleX8PrimTyCon TyCoMapper tcm_tyvar tcm_covartcm_holetcm_tycobinder tcm_tyconManyOneexpandTypeSynonymskindRep kindRep_maybeisBoxedTypeKindpickyIsLiftedTypeKindisUnliftedTypeKindisBoxedRuntimeRepruntimeRepLevity_maybeisLiftedRuntimeRepisUnliftedRuntimeRepisLiftedLevityisUnliftedLevityisRuntimeRepVar isLevityVarisMultiplicityVarmapTyComapTyCoXgetTyVar isTyVarTygetTyVar_maybegetCastedTyVar_mayberepGetTyVar_maybemkAppTyssplitAppTy_mayberepSplitAppTy_maybetcRepSplitAppTy_maybe splitAppTy splitAppTysrepSplitAppTys mkNumLitTy isNumLitTy mkStrLitTy isStrLitTy mkCharLitTy isCharLitTyisLitTyuserTypeError_maybepprUserTypeErrorTy splitFunTysplitFunTy_maybe splitFunTys funResultTyfunArgTy piResultTys applyTysXtyConAppTyConPicky_maybe tyConAppTyContyConAppArgs_maybe tyConAppArgs tyConAppArgN splitTyConApptcSplitTyConApp_mayberepSplitTyConApp_maybetcRepSplitTyConApp_maybesplitListTyConApp_maybenewTyConInstRhssplitCastTy_maybetyConBindersTyCoBinders mkCoercionTyisCoercionTy_maybestripCoercionTymkTyCoInvForAllTy mkInfForAllTymkTyCoInvForAllTysmkInfForAllTysmkSpecForAllTymkSpecForAllTysmkVisForAllTysmkTyConBindersPreferAnonsplitForAllTyCoVarssplitForAllReqTVBinderssplitForAllInvisTVBinders isForAllTy isForAllTy_ty isForAllTy_coisPiTyisFunTysplitForAllTyCoVar dropForAllssplitForAllTyCoVar_maybesplitForAllTyVar_maybesplitForAllCoVar_maybesplitPiTy_maybe splitPiTy splitPiTysgetRuntimeArgTyssplitForAllTyCoVarBindersinvisibleTyBndrCountsplitInvisPiTyssplitInvisPiTysNfilterOutInvisibleTypesfilterOutInferredTypespartitionInvisibles tyConArgFlags appTyArgFlagsisTauTy isAtomicTy mkAnonBinderisAnonTyCoBindertyCoBinderVar_maybetyCoBinderType tyBinderTypebinderRelevantType_maybemkFamilyTyConApp coAxNthLHS isFamFreeTy isCoVarType buildSynTyConisUnliftedType isStateTypemightBeLiftedTypemightBeUnliftedType isBoxedTypeisRuntimeRepKindedTydropRuntimeRepArgsgetRuntimeRep_maybe getRuntimeRepgetLevity_maybeisUnboxedTupleTypeisUnboxedSumType isAlgTypeisDataFamilyAppType isStrictTypeisPrimitiveTypeisValidJoinPointTypeseqTypeseqTypeseqTypeeqTypeXeqTypes eqVarBndrs nonDetCmpTypenonDetCmpTypesnonDetCmpTypeXnonDetCmpTypesX nonDetCmpTctypeKind tcTypeKindtcIsConstraintKindtcIsLiftedTypeKindtcIsBoxedTypeKindtcIsRuntimeTypeKindtcReturnsConstraintKindtypeHasFixedRuntimeRepresultHasFixedRuntimeRepoccCheckExpand tyConsOfTypesplitVisVarsOfTypesplitVisVarsOfTypesisFixedRuntimeRepKind isConcreteclassifiesTypeWithValuestyConAppNeedsKindSig unrestrictedlineartymultirrelevantMultmkScaled scaledSetisManyDataConTyisOneDataConTy isLinearType$fEqTypeOrdering$fOrdTypeOrdering$fEnumTypeOrdering$fBoundedTypeOrdering LitNumType LitNumBigNat LitNumInt LitNumInt8 LitNumInt16 LitNumInt32 LitNumInt64 LitNumWord LitNumWord8 LitNumWord16 LitNumWord32 LitNumWord64LiteralLitChar LitNumber LitString LitNullAddr LitRubbishLitFloat LitDoubleLitLabellitNumIsSigned litNumBitSizemkLitNumberWrap litNumWrap litNumCoerce litNumNarrowlitNumCheckRange litNumRange mkLitNumbermkLitInt mkLitIntWrapmkLitIntUnchecked mkLitIntWrapC mkLitWord mkLitWordWrapmkLitWordUncheckedmkLitWordWrapC mkLitInt8 mkLitInt8WrapmkLitInt8Unchecked mkLitWord8mkLitWord8WrapmkLitWord8Unchecked mkLitInt16mkLitInt16WrapmkLitInt16Unchecked mkLitWord16mkLitWord16WrapmkLitWord16Unchecked mkLitInt32mkLitInt32WrapmkLitInt32Unchecked mkLitWord32mkLitWord32WrapmkLitWord32Unchecked mkLitInt64mkLitInt64WrapmkLitInt64Unchecked mkLitWord64mkLitWord64WrapmkLitWord64Unchecked mkLitFloat mkLitDouble mkLitChar mkLitString mkLitBigNat isLitRubbish isMinBound isMaxBound inCharRange isZeroLitisOneLitlitValueisLitValue_maybe mapLitValue narrowInt8LitnarrowInt16LitnarrowInt32LitnarrowInt64LitnarrowWord8LitnarrowWord16LitnarrowWord32LitnarrowWord64LitconvertToWordLitconvertToIntLit charToIntLit intToCharLit floatToIntLit intToFloatLitdoubleToIntLitintToDoubleLitfloatToDoubleLitdoubleToFloatLit nullAddrLit litIsTrivial litIsDupable litFitsInChar litIsLifted literalType pprLiteral$fBinaryLitNumType $fOrdLiteral $fEqLiteral$fOutputableLiteral$fBinaryLiteral $fDataLiteral$fDataLitNumType$fEnumLitNumType$fEqLitNumType$fOrdLitNumTypeGenMap LiteralMapListMapMaybeMapTrieMapKeyemptyTMlookupTMalterTMmapTMfilterTMfoldTMXTinsertTMdeleteTM foldMapTM isEmptyTM>.>|>|>> foldMaybe filterMaybelkListxtListlkGxtGmapGfdG$fTrieMapUniqDFM $fTrieMapMap$fTrieMapIntMap$fFoldableMaybeMap$fTrieMapMaybeMap$fOutputableListMap$fFoldableListMap$fTrieMapListMap$fFoldableGenMap$fTrieMapGenMap$fOutputableGenMapFactBaseLabelMapLabelSetLabel mkHooplLabel lookupFact$fOutputablePenvLabel$fOutputableLabel$fUniquableLabel $fShowLabel$fOutputableLabelSet$fIsSetLabelSet$fTrieMapLabelMap$fOutputablePenvLabelMap$fOutputableLabelMap$fIsMapLabelMap $fEqLabelMap $fOrdLabelMap$fShowLabelMap$fFunctorLabelMap$fFoldableLabelMap$fTraversableLabelMap $fEqLabelSet $fOrdLabelSet$fShowLabelSet$fMonoidLabelSet$fSemigroupLabelSet $fEqLabel $fOrdLabel SwitchPlanUnconditionallyIfEqualIfLT JumpTable SwitchTargetsmkSwitchTargetsmapSwitchTargetsswitchTargetsCasesswitchTargetsDefaultswitchTargetsRangeswitchTargetsSignedswitchTargetsToTableswitchTargetsToListswitchTargetsFallThrougheqSwitchTargetWithbackendSupportsSwitchcreateSwitchPlan$fShowSwitchPlan$fShowSwitchTargets$fEqSwitchTargetsGraph'GNilGUnitGManyNonLocal entryLabel successorsBody emptyBodybodyListaddBlockmapGraphmapGraphBlocks labelsDefinedrevPostorderFrom$fNonLocalBlockBlockId mkBlockIdShowForAllFlagShowForAllMustShowForAllWhenPrintExplicitKinds UseBndrParensSuppressBndrSigIfaceUnivCoProvIfacePhantomProvIfaceProofIrrelProvIfacePluginProvIfaceCorePrepProv IfaceReflCo IfaceGReflCo IfaceFunCoIfaceTyConAppCo IfaceAppCo IfaceForAllCo IfaceCoVarCoIfaceAxiomInstCoIfaceAxiomRuleCo IfaceUnivCo IfaceSymCo IfaceTransCo IfaceNthCo IfaceLRCo IfaceInstCo IfaceKindCo IfaceSubCoIfaceFreeCoVar IfaceHoleCoIfaceMCoercion IfaceMReflIfaceMCoIfaceTyConInfoifaceTyConIsPromotedifaceTyConSortIfaceTyConSortIfaceNormalTyConIfaceTupleTyCon IfaceSumTyConIfaceEqualityTyConifaceTyConNameifaceTyConInfoIA_NilIA_ArgIfaceForAllSpecBndrIfaceForAllBndrIfaceTyConBinder IfaceNumTyLit IfaceStrTyLitIfaceCharTyLit IfaceContext IfacePredType IfaceMultIfaceFreeTyVar IfaceTyVar IfaceLitTy IfaceAppTy IfaceFunTy IfaceForAllTy IfaceTyConApp IfaceCastTyIfaceCoercionTy IfaceTupleTy IfaceKind IfaceOneShotIfaceNoOneShot IfaceLamBndr IfaceTvBndr IfaceIdBndr IfExtName IfLclName ifaceBndrNamemkIfaceForAllTvBndrmkIfaceTyConKindifaceForAllSpecToBndrsifaceForAllSpecToBndrmkIfaceTyConInfoisIfaceLiftedTypeKindsplitIfaceSigmaTysuppressIfaceInvisiblesstripIfaceInvisVarsifForAllBndrVarifForAllBndrNameifTyConBinderVarifTyConBinderNamemkIfaceTySubstinDomIfaceTySubstsubstIfaceAppArgssubstIfaceTyVarstripInvisArgsappArgsIfaceTypesappArgsIfaceTypesArgFlagspprIfacePrefixAppisIfaceTauType pprIfaceBndrspprIfaceLamBndrpprIfaceIdBndrpprIfaceTvBndrpprIfaceTyConBinders pprIfaceTypepprParendIfaceTypepprPrecIfaceType ppr_fun_arrowmany_typprIfaceAppArgspprParendIfaceAppArgspprIfaceForAllPartpprIfaceForAllPartMustpprIfaceForAllpprIfaceSigmaTypepprUserIfaceForAllpprIfaceTypeApp pprTyTcApppprIfaceCoTcApp pprIfaceTyLitpprIfaceCoercionpprParendIfaceCoercionpprIfaceContextArrpprIfaceContext$fNFDataIfaceOneShot$fBinaryIfaceOneShot$fOutputableIfaceOneShot$fNFDataIfaceTyLit$fBinaryIfaceTyLit$fOutputableIfaceTyLit$fNFDataIfaceTyConSort$fBinaryIfaceTyConSort$fOutputableIfaceTyConSort$fNFDataIfaceTyConInfo$fBinaryIfaceTyConInfo$fOutputableIfaceTyConInfo$fNFDataIfaceTyCon$fBinaryIfaceTyCon$fOutputableIfaceTyCon$fNFDataIfaceAppArgs$fNFDataIfaceBndr$fNFDataIfaceMCoercion$fNFDataIfaceUnivCoProv$fNFDataIfaceCoercion$fNFDataIfaceType$fBinaryDefMethSpec$fBinaryIfaceUnivCoProv$fBinaryIfaceCoercion$fBinaryIfaceMCoercion$fBinaryIfaceType$fBinaryIfaceAppArgs$fOutputableIfaceCoercion$fOutputableIfaceAppArgs$fOutputableIfaceType$fBinaryIfaceBndr$fMonoidIfaceAppArgs$fSemigroupIfaceAppArgs$fOutputableIfaceBndr$fEqIfaceTyCon$fEqIfaceTyConInfo$fEqIfaceTyConSort$fEqIfaceTyLit pprParendType pprTidiedType pprPrecType pprPrecTypeX pprParendKind pprParendCo pprClassPredpprThetapprParendThetapprThetaArrowTy pprSigmaType pprForAll pprUserForAll pprTCvBndrs pprTCvBndr pprTyVars debugPprType pprDataCons pprTypeApppprWithExplicitKindsWhen pprWithTYPEpprSourceTyConRoughMapRoughMatchLookupTc RML_KnownTc RML_NoKnownTc RML_WildCard RoughMatchTc RM_KnownTc RM_WildCardroughMatchTcToLookupisRoughWildcardtypeToRoughMatchLookupTctypeToRoughMatchTcemptyRMlookupRM lookupRM'unionRMinsertRMfilterRMfilterMatchingRMelemsRMfoldRMsizeRM$fOutputableRoughMatchTc$fOutputableRoughMatchLookupTc$fOutputableRoughMap$fFunctorRoughMap$fDataRoughMatchLookupTc$fDataRoughMatchTc PatSynBuilder PatSynMatcherPatSynmkPatSyn patSynName patSynIsInfix patSynArityisVanillaPatSyn patSynArgspatSynFieldLabelspatSynFieldTypepatSynUnivTyVarBinderspatSynExTyVarspatSynExTyVarBinders patSynSigBndr patSynSig patSynMatcher patSynBuilderpatSynResultTypepatSynInstArgTyspatSynInstResTy $fDataPatSyn$fOutputableBndrPatSyn$fOutputablePatSyn$fNamedThingPatSyn$fUniquablePatSyn $fEqPatSyn IsSubmultSubmultUnknown isMultMul mkMultAdd mkMultMul scaleScaled mkMultSupsubmult$fOutputableIsSubmult$fShowIsSubmult $fEqIsSubmultmkFunctionTypeUsageEnvUsageZeroBottomMUsageaddUsage scaleUsageunitUEzeroUEbottomUEaddUEscaleUEsupUEsupUEsdeleteUElookupUE$fOutputableUsage$fOutputableUsageEnv LiftCoEnvLCNormaliseStepResultNS_DoneNS_AbortNS_StepNormaliseStepper coVarNamesetCoVarUnique setCoVarNameetaExpandCoAxBranch pprCoAxiompprCoAxBranchUserpprCoAxBranchLHS pprCoAxBranchtidyCoAxBndrsForUsercoToMCocheckReflexiveMCo isGReflMCo mkTransMCo mkTransMCoL mkTransMCoRmkSymMCo mkCastTyMComkHomoForAllMComkPiMCos mkFunResMComkGReflLeftMComkGReflRightMComkCoherenceRightMCo isReflMCo decomposeCodecomposeFunCogetCoVar_maybesplitTyConAppCo_maybemultToCosplitAppCo_maybesplitFunCo_maybesplitForAllCo_maybesplitForAllCo_ty_maybesplitForAllCo_co_maybe coVarLType coVarRType coVarTypes coVarKindisReflCoVar_maybeisGReflCo_maybeisReflCo_maybeisReflexiveCo_maybe mkRepReflComkAppCos mkForAllCosmkHomoForAllCos mkCoVarCos isCoVar_maybe mkAxInstComkUnbranchedAxInstCo mkAxInstRHSmkUnbranchedAxInstRHS mkAxInstLHSmkUnbranchedAxInstLHSmkHoleCo mkNthCoFunCo nthCoRolemkGReflRightCo mkGReflLeftComkCoherenceLeftComkCoherenceRightCo downgradeRolesetNominalRole_maybe tyConRolesXtyConRolesRepresentationalnthRoleltRolepromoteCoercioncastCoercionKind2castCoercionKind1castCoercionKindmkFamilyTyConAppComkPiCosmkPiCo mkFunResComkCoCastinstNewTyCon_maybe mapStepResultcomposeSteppersunwrapNewTypeSteppertopNormaliseTypeX eqCoercion eqCoercionXliftCoSubstWithExliftCoSubstWithemptyLiftingContextmkSubstLiftingContextextendLiftingContextextendLiftingContextAndInScopezapLiftingContextsubstForAllCoBndrUsingLCliftCoSubstTyVarliftCoSubstVarBndrUsing isMappedByLC substLeftCo substRightCo swapLiftCoEnv lcSubstLeft lcSubstRightliftEnvSubstLeftliftEnvSubstRight lcTCvSubst lcInScopeSet coercionKindscoercionKindRole coercionRolemkHeteroCoercionType mkPrimEqPredmkPrimEqPredRolemkHeteroPrimEqPredmkHeteroReprPrimEqPredmkReprPrimEqPred buildCoercionhasCoercionHoleTyhasCoercionHoleCohasThisCoercionHoleTy setCoHoleType$fOutputableNormaliseStepResult$fOutputableLiftingContext SpecialPredIsReflPrimPredEqRelNomEqReprEqPred ClassPredEqPred IrredPred ForAllPredclassifyPredType mkClassPredisDictTygetClassPredTysgetClassPredTys_maybe classMethodTyclassMethodInstTy eqRelRole getEqPredTysgetEqPredTys_maybe getEqPredRole predTypeEqRelmkIsReflPrimPredisIsReflPrimPred isEvVarType isEqPredClass isClassPredisEqPred isEqPrimPred isCTupleClass isIPTyCon isIPClass isIPLikePredhasIPSuperClassesisCallStackPredTyisCallStackPred isCallStackTyisIPPred_maybeisEvVarisDictId$fOutputableEqRel$fOutputableSpecialPred $fEqEqRel $fOrdEqRelArgsReductions Reductions ReductionR ReductionN HetReduction ReductionreductionCoercionreductionReducedTypemkHetReductionhomogeniseHetRedn mkReductionreductionOriginalType coercionRedn downgradeRedn mkSubRedn mkTransRedn mkReflRednmkGReflRightRednmkGReflRightMRednmkGReflLeftRednmkGReflLeftMRednmkCoherenceRightRednmkCoherenceRightMRedn mkCastRedn1 mkCastRedn2 mkAppRedn mkFunRedn mkForAllRednmkHomoForAllRednmkProofIrrelRedn mkReflCoRedn mkReductions mkAppRednsmkTyConAppRednmkClassPredRedn unzipRednssimplifyArgsWorker$fOutputableReductionVarMapBndrMapDeBruijnDCmEnv LooseTypeMapTypeMapTypeMapG CoercionMapGeqDeBruijnType eqDeBruijnVar foldTypeMap emptyTypeMap lookupTypeMap extendTypeMaplookupTypeMapWithScopeextendTypeMapWithScopemkDeBruijnContextemptyCME extendCME extendCMEs lookupCME deBruijnizelkBndrxtBndrlkVarxtVar lkDFreeVar xtDFreeVarlkDNamedxtDNamed$fTrieMapTyLitMap $fEqDeBruijn $fEqDeBruijn0 $fEqDeBruijn1 $fEqDeBruijn2 $fEqDeBruijn3$fTrieMapVarMap$fTrieMapBndrMap$fTrieMapTypeMapX$fTrieMapLooseTypeMap$fTrieMapTypeMap$fTrieMapCoercionMapX$fTrieMapCoercionMapBindFlagBindMeApartMaybeApartReason MARTypeFamily MARInfiniteMARTypeVsConstraint UnifyResultM Unifiable MaybeApart SurelyApart UnifyResultBindFun tcMatchTy tcMatchTyX_BM tcMatchTyKi tcMatchTyX tcMatchTys tcMatchTyKis tcMatchTysX tcMatchTyKisXruleMatchTyKiX matchBindFun alwaysBindFun roughMatchTcsroughMatchTcsLookupinstanceCantMatchtypesCantMatch tcUnifyTy tcUnifyTyKitcUnifyTyWithTFs tcUnifyTys tcUnifyTyKis tcUnifyTysFG liftCoMatch flattenTys flattenTysX$fSemigroupMaybeApartReason$fOutputableMaybeApartReason$fOutputableUnifyResultM$fMonadUnifyResultM$fApplicativeUnifyResultM $fMonadFailUM $fMonadUM$fApplicativeUM $fFunctorUM $fEqBindFlag$fFunctorUnifyResultM FamInstMatch fim_instancefim_tysfim_cosInjectivityCheckResultInjectivityAcceptedInjectivityUnified FamInstEnv FamInstEnvs FamFlavor SynFamilyInstDataFamilyInstFamInstfi_axiom fi_flavorfi_famfi_tcsfi_tvsfi_cvsfi_tysfi_rhs famInstAxiom famInstRHS famInstTyConfamInstsRepTyConsfamInstRepTyCon_maybedataFamInstRepTyCon pprFamInst pprFamInstsmkImportedFamInstfamInstEnvSizeemptyFamInstEnvsemptyFamInstEnvfamInstEnvEltsfamilyInstancesfamilyNameInstancesunionFamInstEnvextendFamInstEnvListextendFamInstEnvinjectiveBranches mkCoAxBranchmkBranchedCoAxiommkUnbranchedCoAxiommkSingleCoAxiommkNewTypeCoAxiomlookupFamInstEnvByTyConlookupFamInstEnvlookupFamInstEnvConflicts$lookupFamInstEnvInjectivityConflicts isDominatedByreduceTyFamApp_maybeapartnessChecktopNormaliseTypetopNormaliseType_maybenormaliseTcApptopReduceTyFamApp_maybe normaliseType$fOutputableFamInst$fNamedThingFamInst$fOutputableFamInstEnv$fOutputableFamInstMatch$fApplicativeNormM $fMonadNormM$fFunctorNormMStrictnessMark MarkedStrictNotMarkedStrictSrcUnpackedness SrcUnpack SrcNoUnpack NoSrcUnpack SrcStrictnessSrcLazy SrcStrict NoSrcStrict HsImplBangHsLazyHsStrictHsUnpack HsSrcBang DataConEnv NoDataConRepDCR dcr_wrap_id dcr_boxer dcr_arg_tys dcr_stricts dcr_bangsmkEqSpec eqSpecTyVar eqSpecType eqSpecPair eqSpecPreds substEqSpec filterEqSpeceqHsBangisBanged isSrcStrict isSrcUnpackedisMarkedStrictcbvFromStrictMark mkDataCon dataConTag dataConTagZdataConOrigTyCondataConRepTypedataConIsInfixdataConUnivTyVarsdataConUnivAndExTyCoVars dataConEqSpec dataConThetadataConWrapId_maybedataConImplicitTyThingsdataConFieldTypedataConFieldType_maybedataConSrcBangsdataConRepArityisNullarySrcDataConisNullaryRepDataCondataConRepStrictnessdataConImplBangs dataConBoxerdataConInstSigdataConOrigResTydataConWrapperTypedataConNonlinearTypedataConDisplayTypedataConInstArgTysdataConInstUnivsdataConOrigArgTysdataConOtherThetadataConRepArgTysdataConIdentityisTupleDataConisBoxedTupleDataConisUnboxedTupleDataConisVanillaDataCon isNewDataConspecialPromotedDc classDataCondataConCannotMatchdataConUserTyVarsArePermutedsplitDataProductType_maybe$fOutputableHsImplBang$fBinarySrcStrictness$fOutputableSrcStrictness$fBinarySrcUnpackedness$fOutputableSrcUnpackedness$fOutputableHsSrcBang$fBinaryStrictnessMark$fOutputableStrictnessMark$fOutputableEqSpec $fDataDataCon$fOutputableBndrDataCon$fOutputableDataCon$fNamedThingDataCon$fUniquableDataCon $fEqDataCon$fEqStrictnessMark$fDataHsSrcBang$fEqSrcUnpackedness$fDataSrcUnpackedness$fEqSrcStrictness$fDataSrcStrictness$fDataHsImplBangSlotTy PtrLiftedSlotPtrUnliftedSlotWordSlot Word64Slot FloatSlot DoubleSlot UnaryType NvUnaryType isNvUnaryTypetypePrimRepArgs unwrapTypecountFunRepArgscountConRepArgsdataConRuntimeRepStrictness isZeroBitTy ubxSumRepType layoutUbxSum typeSlotTy primRepSlot slotPrimRep typePrimRep typePrimRep1typeMonoPrimRep_maybe tyConPrimRep tyConPrimRep1runtimeRepPrimRep primRepToType$fOutputableSlotTy $fEqSlotTy $fOrdSlotTy TypeShapeTsFunTsProdTsUnkDmdTransformerDmdSig PlusDmdArgDmdTypedt_envdt_argsdt_divDmdEnv DivergenceDivergesExnOrDivDunno SubDemandPolyProdDemandBotDmdAbsDmd CardNonOnce CardNonAbsCard:*C_0NC_1NC_01C_11C_10C_00isStrictisAbs isUsedOnce oneifyCardlubCardplusCardmultCard topSubDmdmkProdviewProdtopDmdabsDmdbotDmdseqDmdunboxDeeplyDmd lubSubDmdlubDmd multSubDmdmultDmd plusSubDmdplusDmdisTopDmdisAbsDmd isStrictDmd isStrUsedDmd isUsedOnceDmd isWeakDmdevalDmdstrictOnceApply1DmdstrictManyApply1Dmd lazyApply1Dmd lazyApply2Dmd oneifyDmd strictifyDmdstrictifyDictDmd lazifyDmdmkCalledOnceDmdmkCalledOnceDmds peelCallDmd peelManyCallsmkWorkerDemand argsOneShots argOneShotssaturatedByOneShots lubDivergencetopDivexnDivbotDiv isDeadEndDiv emptyDmdEnvreuseEnvkeepAliveDmdEnv lubDmdType mkPlusDmdArg toPlusDmdArg plusDmdType botDmdType nopDmdType dmdTypeDepth splitDmdTy multDmdTypepeelFV addDemand findIdDemanddeferAfterPreciseExceptionkeepAliveDmdTypemkDmdSigForAritymkClosedDmdSig splitDmdSig dmdSigDmdEnvhasDemandEnvSigbotSignopSigisTopSig isDeadEndSigonlyBoxedArguments appIsDeadEndtrimBoxityDmdSigprependArgsDmdSigetaConvertDmdSigdmdTransformSigdmdTransformDataConSigdmdTransformDictSelSig zapDmdEnvSigzapUsageDemandzapUsedOnceDemandzapUsedOnceSig trimToType trimBoxity seqDemand seqDemandList seqDmdType seqDmdSig $fBinaryCard$fOutputableCard $fShowCard$fBinarySubDemand$fBinaryDemand$fOutputableSubDemand$fOutputableDemand $fEqSubDemand$fBinaryDivergence$fOutputableDivergence$fBinaryDmdType$fOutputableDmdType $fEqDmdType$fBinaryDmdSig$fOutputableDmdSig$fOutputableTypeShape $fEqDmdSig$fEqDivergence $fEqDemand$fEqCardCprSig getCprSigUnpackConFieldsResult AllFieldsSame ForeachFieldCprTypect_artyct_cprCprConCprtopCprbotCpr flatConCprasConCpr topCprType botCprTypeflatConCprType lubCprType applyCprTy abstractCprTy trimCprTyunpackConFieldsCprmkCprSigForArity topCprSig isTopCprSigmkCprSig seqCprSig $fBinaryCpr$fOutputableCpr$fBinaryCprType$fOutputableCprType $fEqCprType$fOutputableCprSig $fEqCprSig$fBinaryCprSig$fEqCpr DoExtDynRefsDoSCCProfilingStandardFormInfoNonStandardThunk SelectorThunkApThunkLambdaFormInfo LFReEntrantLFThunkLFCon LFUnknown LFUnlifted LFLetNoEscape ModuleLFInfosCgInfos cgNonCafs cgLFInfos cgIPEStub cgTagSigs$fOutputableStandardFormInfo$fOutputableLambdaFormInfo$fEqStandardFormInfo RealDataCon PatSynConisVanillaConLike conLikeArityconLikeFieldLabelsconLikeInstOrigArgTysconLikeUserTyVarBindersconLikeExTyCoVars conLikeNameconLikeStupidThetaconLikeHasBuilderconLikeImplBangs conLikeResTyconLikeFullSigconLikeFieldTypeconLikesWithFieldsconLikeIsInfix $fDataConLike$fOutputableBndrConLike$fOutputableConLike$fNamedThingConLike$fUniquableConLike $fEqConLikeCompleteMatches CompleteMatch cmConLikes cmResultTyConvanillaCompleteMatchcompleteMatchAppliesAtType$fOutputableCompleteMatchputArraygetArray BreakArrayBAbreakOnbreakOffshowBreakArraysetupBreakpointgetBreak newBreakArray C_ffi_cifFFIConvFFICCall FFIStdCallFFITypeFFIVoid FFIPointerFFIFloat FFIDoubleFFISInt8 FFISInt16 FFISInt32 FFISInt64FFIUInt8 FFIUInt16 FFIUInt32 FFIUInt64prepForeignCallfreeForeignCallInfo $fShowFFIConv$fGenericFFIConv$fBinaryFFIConv $fShowFFIType$fGenericFFIType$fBinaryFFIType ForeignHValue ForeignRef HValueRef RemoteRefHValue RemotePtr toRemotePtr fromRemotePtr castRemotePtr toHValueRef mkRemoteReflocalRef freeRemoteRef mkForeignRefwithForeignRefunsafeForeignRefToRemoteReffinalizeForeignRef $fShowHValue$fNFDataForeignRef$fShowRemoteRef$fBinaryRemoteRef$fNFDataRemotePtr$fBinaryRemotePtr$fShowRemotePtrResolvedBCOPtrResolvedBCORefResolvedBCOStaticPtrResolvedBCOPtrBCOResolvedBCOPtrBreakArray ResolvedBCOresolvedBCOIsLEresolvedBCOArityresolvedBCOInstrsresolvedBCOBitmapresolvedBCOLitsresolvedBCOPtrsisLittleEndian$fBinaryResolvedBCOPtr$fBinaryResolvedBCO$fGenericResolvedBCOPtr$fShowResolvedBCOPtr$fGenericResolvedBCO$fShowResolvedBCO HsUniToken HsNormalTok HsUnicodeTok LHsUniTokenHsTokenHsTokLHsTokenNoGhcTcXXIE XIEDocNamedXIEDocXIEGroupXIEModuleContents XIEThingWith XIEThingAll XIEThingAbsXIEVar XXImportDecl XCImportDecl XXFieldOcc XCFieldOccXXConDeclField XConDeclField XXTyVarBndr XKindedTyVar XUserTyVarXXHsForAllTelescopeXHsForAllInvis XHsForAllVisXXType XWildCardTyXTyLitXExplicitTupleTyXExplicitListTyXRecTyXBangTyXDocTy XSpliceTyXKindSigXStarTy XIParamTyXParTyXOpTyXSumTyXTupleTyXListTyXFunTy XAppKindTyXAppTyXTyVarXQualTy XForAllTyXXHsPatSigTypeXHsPSXXHsWildCardBndrsXHsWC XXHsSigTypeXHsSigXXHsOuterTyVarBndrsXHsOuterExplicitXHsOuterImplicit XXLHsQTyVarsXHsQTvs XHsFieldBindXXPatXCoPatXSigPat XNPlusKPatXNPatXLitPat XSplicePatXViewPatXConPatXSumPat XTuplePatXListPatXBangPatXParPatXAsPatXLazyPatXVarPatXWildPat XXOverLitXOverLitXXLit XHsDoublePrim XHsFloatPrimXHsRat XHsInteger XHsWord64Prim XHsInt64Prim XHsWordPrim XHsIntPrimXHsInt XHsStringPrim XHsString XHsCharPrimXHsCharXXApplicativeArgXApplicativeArgManyXApplicativeArgOneXXParStmtBlock XParStmtBlockXXCmdXCmdWrapXCmdDoXCmdLetXCmdIf XCmdLamCaseXCmdCaseXCmdParXCmdLamXCmdApp XCmdArrForm XCmdArrAppXXStmtLRXRecStmt XTransStmtXParStmtXLetStmt XBodyStmtXApplicativeStmt XBindStmt XLastStmtXXGRHSXCGRHSXXGRHSsXCGRHSsXXMatchXCMatch XXMatchGroupXMGXXCmdTopXCmdTopXXQuoteXVarBrXTypBrXDecBrGXDecBrLXPatBrXExpBrXXSpliceXSpliced XQuasiQuoteXUntypedSplice XTypedSpliceXXTupArgXMissingXPresentXXAmbiguousFieldOcc XAmbiguous XUnambiguousXXPragEXSCC XXDotFieldOcc XCDotFieldOccXXExprXPragEXBinTickXTickXStaticXProcXSpliceEXUntypedBracket XTypedBracket XArithSeqXExprWithTySig XProjection XGetField XRecordUpd XRecordCon XExplicitListXDoXLetXMultiIfXIfXCase XExplicitSumXExplicitTuple XSectionR XSectionLXParXNegAppXOpApp XAppTypeEXAppXLamCaseXLamXLitE XOverLitEXIPVar XOverLabelXRecSel XUnboundVarXVarXXInjectivityAnnXCInjectivityAnnXXRoleAnnotDeclXCRoleAnnotDecl XXAnnDecl XHsAnnotation XXWarnDeclXWarning XXWarnDecls XWarnings XXRuleBndr XRuleBndrSig XCRuleBndr XXRuleDeclXHsRule XXRuleDecls XCRuleDecls XXForeignDeclXForeignExportXForeignImport XXDefaultDecl XCDefaultDecl XViaStrategyXNewtypeStrategyXAnyClassStrategyXStockStrategy XXDerivDecl XCDerivDecl XXInstDecl XTyFamInstD XDataFamInstD XClsInstD XXClsInstDecl XCClsInstDeclXXTyFamInstDeclXCTyFamInstDeclXXFamEqnXCFamEqn XXConDecl XConDeclH98 XConDeclGADTXXDerivClauseTys XDctMulti XDctSingleXXHsDerivingClauseXCHsDerivingClause XXHsDataDefn XCHsDataDefn XXFamilyDecl XCFamilyDeclXXFamilyResultSig XTyVarSig XCKindSigXNoSig XXTyClGroup XCTyClGroupXXFunDepXCFunDep XXTyClDecl XClassDecl XDataDeclXSynDeclXFamDecl XXSpliceDecl XSpliceDecl XXHsGroup XCHsGroupXXHsDecl XRoleAnnotDXDocDXSpliceDXRuleDXAnnD XWarningDXForDXDefD XKindSigDXSigDXValDXDerivDXInstDXTyClDXXStandaloneKindSigXStandaloneKindSig XXFixitySig XFixitySigXXSigXCompleteMatchSig XSCCFunSig XMinimalSig XSpecInstSigXSpecSig XInlineSigXFixSigXIdSig XClassOpSig XPatSynSigXTypeSigXXIPBindXCIPBind XXHsIPBindsXIPBinds XXPatSynBindXPSB XXHsBindsLR XPatSynBindXVarBindXPatBindXFunBind XXValBindsLR XValBindsXXHsLocalBindsLRXEmptyLocalBinds XHsIPBinds XHsValBindsLIdPIdPWrapXRecwrapXRecMapXRecmapXRecUnXRecunXRecAnnoXRecDataConCantHappen noExtFielddataConCantHappen$fOutputableNoExtField$fOutputableDataConCantHappen$fDataDataConCantHappen$fEqDataConCantHappen$fOrdDataConCantHappen$fDataNoExtField$fEqNoExtField$fOrdNoExtField$fDataHsUniToken $fDataHsTokenLHsExpr SyntaxExprGRHSs MatchGroupHsSpliceTickishPlacement PlaceRuntime PlaceNonLamPlaceCostCentreTickishScopingNoScope SoftScopeCostCentreScope GenTickishProfNoteHpcTick Breakpoint profNoteCC profNoteCount profNoteScope tickModuletickId breakpointExt breakpointId breakpointFVs sourceSpan sourceName CmmTickish StgTickish CoreTickish XTickishId tickishCounts tickishScopedtickishScopesLiketickishFloatabletickishCanSplit mkNoCount mkNoScope tickishIsCode isProfTick tickishPlacetickishContains$fOutputableTickishPlacement$fEqTickishPlacement$fShowTickishPlacement$fEqTickishScoping$fDataGenTickish$fOrdGenTickish$fEqGenTickish$fDataGenTickish0$fDataGenTickish1$fOrdGenTickish0$fEqGenTickish0AnnBind AnnNonRecAnnAltAnnExpr'AnnVarAnnLitAnnAppAnnCastAnnTick AnnCoercionAnnExpr TaggedAlt TaggedArg TaggedExpr TaggedBind TaggedBndrTBCoreAltCoreBindCoreArgCoreExprCoreBndr CoreProgramUnfoldingGuidanceUnfWhen UnfIfGoodArgsUnfNeverug_arity ug_unsat_ok ug_boring_okug_argsug_sizeug_resUnfoldingSource InlineRhs InlineStableInlineCompulsory Unfolding NoUnfolding BootUnfoldingOtherCon DFunUnfolding CoreUnfoldingdf_bndrsdf_condf_argsuf_tmpluf_src uf_is_top uf_is_value uf_is_conlikeuf_is_work_free uf_expandable uf_guidanceIdUnfoldingFun InScopeEnvRuleFunRuleOpts roPlatformroNumConstantFoldingroExcessRationalPrecision roBignumRulesCoreRuleRule BuiltinRuleru_nameru_actru_fnru_roughru_bndrsru_argsru_rhsru_auto ru_origin ru_orphanru_localru_nargsru_tryRuleEnvre_basere_visible_orphsRuleBaseIsOrphan NotOrphan MOutCoercionOutArgOutAltOutExprOutBind OutCoercionOutKindOutTypeOutBndr InCoercionInArgInAltInExprInBindInKindInTypeInBndrBindNonRecRecAltConDataAltLitAltDEFAULTAltArgExprLitAppLamLetCaseCastTickisOrphan notOrphanchooseOrphanAnchor mkRuleEnv emptyRuleEnv isBuiltinRule isAutoRule ruleArityruleName ruleModuleruleActivation ruleIdName isLocalRule setRuleIdName needSaturated unSaturatedOk boringCxtOkboringCxtNotOk noUnfoldingevaldUnfolding bootUnfolding mkOtherConisStableSourceunfoldingTemplatemaybeUnfoldingTemplate otherConsisValueUnfoldingisEvaldUnfoldingisConLikeUnfoldingisCheapUnfoldingisExpandableUnfoldingexpandUnfolding_maybeisCompulsoryUnfoldingisStableUnfoldingisInlineUnfoldinghasSomeUnfoldingisBootUnfoldingneverUnfoldGuidancehasCoreUnfolding canUnfoldcmpAltltAlt cmpAltCon deTagExprmkAppsmkCoApps mkVarAppsmkConAppmkTyApps mkConApp2mkTyArgmkIntLit mkIntLitWrap mkWordLit mkWordLitWrap mkWord8LitmkWord64LitWord64mkInt64LitInt64 mkCharLit mkStringLit mkFloatLitmkFloatLitFloat mkDoubleLitmkDoubleLitDoublemkLamsmkLetsmkLet mkLetNonRecmkLetRecmkTyBindmkCoBind varToCoreExprvarsToCoreExprsapplyTypeToArg exprToTypeexprToCoercion_maybe bindersOfbindersOfBinds rhssOfBind rhssOfAlts flattenBindscollectBinderscollectTyBinderscollectTyAndValBinderscollectNBinders collectArgs wrapLamBody stripNArgscollectArgsTicks isRuntimeVar isRuntimeArgisValArg isTyCoArgisCoArg isTypeArg valBndrCount valArgCountcollectAnnArgscollectAnnArgsTicks deAnnotate deAnnotate'deAnnAlt deAnnBindcollectAnnBndrscollectNAnnBndrs$fOutputableAltCon $fOrdAltCon$fBinaryIsOrphan$fOutputableTaggedBndr$fEqUnfoldingGuidance$fDataIsOrphan $fDataBind $fDataExpr $fDataAlt $fEqAltCon $fDataAltCon LevityInfo TickBoxOpTickBox TickBoxIdCafInfoMayHaveCafRefs NoCafRefsRuleInfoInlinePragInfo ArityInforuleInforealUnfoldingInfoinlinePragInfooccInfo dmdSigInfo cprSigInfo demandInfolfInfotagSig RecSelParent RecSelData RecSelPatSyn VanillaIdRecSelId DataConWorkId DataConWrapId ClassOpIdPrimOpIdFCallId TickBoxOpIdCoVarIdStrictWorkerId sel_tycon sel_naughtyisJoinIdDetails_maybe levityInfo oneShotInfo arityInfocafInfo callArityInfo tagSigInfo setRuleInfosetInlinePragInfo setOccInfo unfoldingInfosetUnfoldingInfohasInlineUnfolding setArityInfosetCallArityInfo setCafInfo setLFInfo setTagSigsetOneShotInfo setDemandInfo setDmdSigInfo setCprSigInfo noCafIdInfo unknownArity ppArityInfo pprStrictness emptyRuleInfoisEmptyRuleInforuleInfoFreeVars ruleInfoRulessetRuleInfoHeadmayHaveCafRefs ppCafInfo zapLamInfo zapDemandInfo zapUsageInfozapUsageEnvInfozapUsedOnceInfozapFragileInfo zapUnfoldingzapTailCallInfozapCallArityInfosetNeverRepPolysetLevityInfoWithTypeisNeverRepPolyIdInfo$fOutputableRecSelParent$fOutputableCafInfo$fOutputableTickBoxOp$fOutputableIdDetails$fOutputableLevityInfo$fEqLevityInfo $fEqCafInfo $fOrdCafInfo$fEqRecSelParentidUniqueidTypeidMult idScaledType scaleIdBy scaleVarBy setIdName setIdUnique setIdType localiseId setIdInfo modifyIdInfomaybeModifyIdInfo mkGlobalIdmkVanillaGlobalmkVanillaGlobalWithInfo mkLocalId mkLocalCoVarmkLocalIdOrCoVarmkLocalIdWithInfomkExportedLocalIdmkExportedVanillaId mkSysLocalmkSysLocalOrCoVar mkSysLocalMmkSysLocalOrCoVarM mkUserLocalmkUserLocalOrCoVar mkWorkerIdmkTemplateLocalmkScaledTemplateLocalmkTemplateLocalsmkTemplateLocalsNumrecordSelectorTyConrecordSelectorTyCon_maybeisRecordSelectorisDataConRecordSelectorisPatSynRecordSelectorisNaughtyRecordSelector isClassOpIdisClassOpId_maybe isPrimOpIdisDFunIdisPrimOpId_maybe isFCallIdisFCallId_maybeisDataConWorkIdisDataConWorkId_maybeisDataConWrapIdisDataConWrapId_maybeisDataConId_maybeisJoinIdisJoinId_maybe idDataCon hasNoBinding isImplicitIdidIsFrom isDeadBinder idJoinArityasJoinId zapJoinIdasJoinId_maybeidArity setIdArity idCallAritysetIdCallArity idFunRepArity isDeadEndIdidDmdSig setIdDmdSigidCprSig setIdCprSig zapIdDmdSig isStrictIdidTagSig_maybe idUnfoldingrealIdUnfoldingsetIdUnfolding idDemandInfosetIdDemandInfo setIdTagSig setIdCbvMarksidCbvMarks_maybeidCbvMarkAritysetCaseBndrEvaldidSpecialisation idCoreRules idHasRulessetIdSpecialisation idCafInfo setIdCafInfoidLFInfo_maybe setIdLFInfo idOccInfo setIdOccInfo zapIdOccInfoidInlinePragmasetInlinePragmamodifyInlinePragmaidInlineActivationsetInlineActivationidRuleMatchInfo isConLikeId idOneShotInfoidStateHackOneShotInfo isOneShotBndrstateHackOneShot typeOneShotisStateHackTypeisProbablyOneShotLambdasetOneShotLambdaclearOneShotLambdasetIdOneShotInfoupdOneShotInfo zapLamIdInfozapFragileIdInfozapIdDemandInfozapIdUsageInfozapIdUsageEnvInfozapIdUsedOnceInfozapIdTailCallInfozapStableUnfoldingtransferPolyIdInfoisNeverRepPolyId MonadThings lookupThinglookupId lookupDataCon lookupTyConAnIdAConLikeATyConACoAxiompprShortTyThingpprTyThingCategorytyThingCategoryimplicitTyThingsimplicitConLikeThingsimplicitClassThingsimplicitTyConThingsimplicitCoTyConisImplicitTyThingtyThingParent_maybetyThingsTyCoVarstyThingAvailInfo tyThingTyContyThingCoAxiomtyThingDataContyThingConLike tyThingId$fNamedThingTyThing$fOutputableTyThing$fMonadThingsReaderTTypeEnv emptyTypeEnv typeEnvElts typeEnvTyConstypeEnvCoAxioms typeEnvIdstypeEnvPatSynstypeEnvDataConstypeEnvClasses mkTypeEnvmkTypeEnvWithImplicitstypeEnvFromEntities lookupTypeEnv extendTypeEnvextendTypeEnvListextendTypeEnvWithIds plusTypeEnv wiredInTyConsmkWiredInTyConNamemkWiredInIdName eqTyConName eqTyCon_RDR heqTyConNamecoercibleTyConName charTyConName intTyConName boolTyConName listTyConNamenilDataConNameconsDataConNamenonEmptyTyConNamenonEmptyDataConNamemaybeTyConNamenothingDataConNamejustDataConName wordTyConNamefloatTyConNamedoubleTyConNameanyTyConanyTymakeRecoveryTyConconstraintKindTyConNameunliftedTypeKindTyConNameliftedRepTyConNameunliftedRepTyConNamemultiplicityTyConNameoneDataConNamemanyDataConName boolTyCon_RDR false_RDRtrue_RDR intTyCon_RDR charTyCon_RDRstringTyCon_RDRintDataCon_RDR listTyCon_RDRconsDataCon_RDRtypeSymbolKindConconstraintKindTyContypeToTypeKindisBuiltInOcc_maybe mkTupleStr cTupleTyConcTupleTyConNamesisCTupleTyConNamecTupleTyConNameArity_maybecTupleDataConNames cTupleSelIdtupleDataConNamemkPromotedPairTyisPromotedPairType unitTyCon unitTyConKey unitDataCon unitDataConId soloTyCon pairTyCon unboxedUnitTyunboxedUnitTyConunboxedUnitDataConunboxedSumKindeqTyConeqClass eqDataConheqClass heqDataConcoercibleClasscoercibleDataCon oneDataCon manyDataConunrestrictedFunTyConNameunliftedDataConTyConsumRepDataConTyConboxingDataCon_maybe charTyCon charDataConstringTyintTyintTyCon intDataConwordTy wordTyCon wordDataConword8Ty word8TyCon word8DataConfloatTy floatTyCon floatDataCondoubleTy doubleTyCon doubleDataConboolTy boolTyCon falseDataCon trueDataConfalseDataConId trueDataConId orderingTyCon ordLTDataCon ordEQDataCon ordGTDataConordLTDataConIdordEQDataConIdordGTDataConIdmkListTy nilDataCon consDataCon nonEmptyTyConnonEmptyDataCon maybeTyConnothingDataCon justDataConmkPromotedMaybeTy mkMaybeTyisPromotedMaybeTy mkTupleTy mkTupleTy1mkSumTypromotedTrueDataConpromotedFalseDataConpromotedNothingDataConpromotedJustDataConpromotedLTDataConpromotedEQDataConpromotedGTDataConpromotedConsDataConpromotedNilDataConmkPromotedListTyintegerTyConNameintegerISDataConNameintegerIPDataConNameintegerINDataConName integerTyConintegerISDataConintegerIPDataConintegerINDataConnaturalTyConNamenaturalNSDataConNamenaturalNBDataConName naturalTyConnaturalNSDataConnaturalNBDataCon filterCTuple OrigNameCache NameCache nsUniqCharnsNamestakeUniqFromNameCachelookupOrigNameCacheextendOrigNameCache'extendOrigNameCache initNameCacheupdateNameCache'updateNameCachePrimCallPrimOpResultInfo ReturnsPrim ReturnsAlg PrimOpVecCatIntVecWordVecFloatVecCharGtOpCharGeOpCharEqOpCharNeOpCharLtOpCharLeOpOrdOp Int8ToIntOp IntToInt8Op Int8NegOp Int8AddOp Int8SubOp Int8MulOp Int8QuotOp Int8RemOp Int8QuotRemOp Int8SllOp Int8SraOp Int8SrlOp Int8ToWord8OpInt8EqOpInt8GeOpInt8GtOpInt8LeOpInt8LtOpInt8NeOp Word8ToWordOp WordToWord8Op Word8AddOp Word8SubOp Word8MulOp Word8QuotOp Word8RemOpWord8QuotRemOp Word8AndOp Word8OrOp Word8XorOp Word8NotOp Word8SllOp Word8SrlOp Word8ToInt8Op Word8EqOp Word8GeOp Word8GtOp Word8LeOp Word8LtOp Word8NeOp Int16ToIntOp IntToInt16Op Int16NegOp Int16AddOp Int16SubOp Int16MulOp Int16QuotOp Int16RemOpInt16QuotRemOp Int16SllOp Int16SraOp Int16SrlOpInt16ToWord16Op Int16EqOp Int16GeOp Int16GtOp Int16LeOp Int16LtOp Int16NeOpWord16ToWordOpWordToWord16Op Word16AddOp Word16SubOp Word16MulOp Word16QuotOp Word16RemOpWord16QuotRemOp Word16AndOp Word16OrOp Word16XorOp Word16NotOp Word16SllOp Word16SrlOpWord16ToInt16Op Word16EqOp Word16GeOp Word16GtOp Word16LeOp Word16LtOp Word16NeOp Int32ToIntOp IntToInt32Op Int32NegOp Int32AddOp Int32SubOp Int32MulOp Int32QuotOp Int32RemOpInt32QuotRemOp Int32SllOp Int32SraOp Int32SrlOpInt32ToWord32Op Int32EqOp Int32GeOp Int32GtOp Int32LeOp Int32LtOp Int32NeOpWord32ToWordOpWordToWord32Op Word32AddOp Word32SubOp Word32MulOp Word32QuotOp Word32RemOpWord32QuotRemOp Word32AndOp Word32OrOp Word32XorOp Word32NotOp Word32SllOp Word32SrlOpWord32ToInt32Op Word32EqOp Word32GeOp Word32GtOp Word32LeOp Word32LtOp Word32NeOp Int64ToIntOp IntToInt64Op Int64NegOp Int64AddOp Int64SubOp Int64MulOp Int64QuotOp Int64RemOp Int64SllOp Int64SraOp Int64SrlOpInt64ToWord64Op Int64EqOp Int64GeOp Int64GtOp Int64LeOp Int64LtOp Int64NeOpWord64ToWordOpWordToWord64Op Word64AddOp Word64SubOp Word64MulOp Word64QuotOp Word64RemOp Word64AndOp Word64OrOp Word64XorOp Word64NotOp Word64SllOp Word64SrlOpWord64ToInt64Op Word64EqOp Word64GeOp Word64GtOp Word64LeOp Word64LtOp Word64NeOpIntAddOpIntSubOpIntMulOp IntMul2OpIntMulMayOfloOp IntQuotOpIntRemOp IntQuotRemOpIntAndOpIntOrOpIntXorOpIntNotOpIntNegOp IntAddCOp IntSubCOpIntGtOpIntGeOpIntEqOpIntNeOpIntLtOpIntLeOpChrOp IntToWordOp IntToFloatOp IntToDoubleOp WordToFloatOpWordToDoubleOpIntSllOpIntSraOpIntSrlOp WordAddOp WordAddCOp WordSubCOp WordAdd2Op WordSubOp WordMulOp WordMul2Op WordQuotOp WordRemOp WordQuotRemOpWordQuotRem2Op WordAndOpWordOrOp WordXorOp WordNotOp WordSllOp WordSrlOp WordToIntOpWordGtOpWordGeOpWordEqOpWordNeOpWordLtOpWordLeOp PopCnt8Op PopCnt16Op PopCnt32Op PopCnt64OpPopCntOpPdep8OpPdep16OpPdep32OpPdep64OpPdepOpPext8OpPext16OpPext32OpPext64OpPextOpClz8OpClz16OpClz32OpClz64OpClzOpCtz8OpCtz16OpCtz32OpCtz64OpCtzOp BSwap16Op BSwap32Op BSwap64OpBSwapOpBRev8OpBRev16OpBRev32OpBRev64OpBRevOp Narrow8IntOp Narrow16IntOp Narrow32IntOp Narrow8WordOpNarrow16WordOpNarrow32WordOp DoubleGtOp DoubleGeOp DoubleEqOp DoubleNeOp DoubleLtOp DoubleLeOp DoubleAddOp DoubleSubOp DoubleMulOp DoubleDivOp DoubleNegOp DoubleFabsOp DoubleToIntOpDoubleToFloatOp DoubleExpOp DoubleExpM1Op DoubleLogOp DoubleLog1POp DoubleSqrtOp DoubleSinOp DoubleCosOp DoubleTanOp DoubleAsinOp DoubleAcosOp DoubleAtanOp DoubleSinhOp DoubleCoshOp DoubleTanhOp DoubleAsinhOp DoubleAcoshOp DoubleAtanhOp DoublePowerOpDoubleDecode_2IntOpDoubleDecode_Int64Op FloatGtOp FloatGeOp FloatEqOp FloatNeOp FloatLtOp FloatLeOp FloatAddOp FloatSubOp FloatMulOp FloatDivOp FloatNegOp FloatFabsOp FloatToIntOp FloatExpOp FloatExpM1Op FloatLogOp FloatLog1POp FloatSqrtOp FloatSinOp FloatCosOp FloatTanOp FloatAsinOp FloatAcosOp FloatAtanOp FloatSinhOp FloatCoshOp FloatTanhOp FloatAsinhOp FloatAcoshOp FloatAtanhOp FloatPowerOpFloatToDoubleOpFloatDecode_IntOp NewArrayOp ReadArrayOp WriteArrayOp SizeofArrayOpSizeofMutableArrayOp IndexArrayOpUnsafeFreezeArrayOpUnsafeThawArrayOp CopyArrayOpCopyMutableArrayOp CloneArrayOpCloneMutableArrayOp FreezeArrayOp ThawArrayOp CasArrayOpNewSmallArrayOpShrinkSmallMutableArrayOp_CharReadSmallArrayOpWriteSmallArrayOpSizeofSmallArrayOpSizeofSmallMutableArrayOpGetSizeofSmallMutableArrayOpIndexSmallArrayOpUnsafeFreezeSmallArrayOpUnsafeThawSmallArrayOpCopySmallArrayOpCopySmallMutableArrayOpCloneSmallArrayOpCloneSmallMutableArrayOpFreezeSmallArrayOpThawSmallArrayOpCasSmallArrayOpNewByteArrayOp_CharNewPinnedByteArrayOp_Char NewAlignedPinnedByteArrayOp_CharMutableByteArrayIsPinnedOpByteArrayIsPinnedOpByteArrayContents_CharMutableByteArrayContents_CharShrinkMutableByteArrayOp_CharResizeMutableByteArrayOp_CharUnsafeFreezeByteArrayOpSizeofByteArrayOpSizeofMutableByteArrayOpGetSizeofMutableByteArrayOpIndexByteArrayOp_CharIndexByteArrayOp_WideCharIndexByteArrayOp_IntIndexByteArrayOp_WordIndexByteArrayOp_AddrIndexByteArrayOp_FloatIndexByteArrayOp_DoubleIndexByteArrayOp_StablePtrIndexByteArrayOp_Int8IndexByteArrayOp_Int16IndexByteArrayOp_Int32IndexByteArrayOp_Int64IndexByteArrayOp_Word8IndexByteArrayOp_Word16IndexByteArrayOp_Word32IndexByteArrayOp_Word64IndexByteArrayOp_Word8AsChar IndexByteArrayOp_Word8AsWideCharIndexByteArrayOp_Word8AsIntIndexByteArrayOp_Word8AsWordIndexByteArrayOp_Word8AsAddrIndexByteArrayOp_Word8AsFloatIndexByteArrayOp_Word8AsDouble!IndexByteArrayOp_Word8AsStablePtrIndexByteArrayOp_Word8AsInt16IndexByteArrayOp_Word8AsInt32IndexByteArrayOp_Word8AsInt64IndexByteArrayOp_Word8AsWord16IndexByteArrayOp_Word8AsWord32IndexByteArrayOp_Word8AsWord64ReadByteArrayOp_CharReadByteArrayOp_WideCharReadByteArrayOp_IntReadByteArrayOp_WordReadByteArrayOp_AddrReadByteArrayOp_FloatReadByteArrayOp_DoubleReadByteArrayOp_StablePtrReadByteArrayOp_Int8ReadByteArrayOp_Int16ReadByteArrayOp_Int32ReadByteArrayOp_Int64ReadByteArrayOp_Word8ReadByteArrayOp_Word16ReadByteArrayOp_Word32ReadByteArrayOp_Word64ReadByteArrayOp_Word8AsCharReadByteArrayOp_Word8AsWideCharReadByteArrayOp_Word8AsIntReadByteArrayOp_Word8AsWordReadByteArrayOp_Word8AsAddrReadByteArrayOp_Word8AsFloatReadByteArrayOp_Word8AsDouble ReadByteArrayOp_Word8AsStablePtrReadByteArrayOp_Word8AsInt16ReadByteArrayOp_Word8AsInt32ReadByteArrayOp_Word8AsInt64ReadByteArrayOp_Word8AsWord16ReadByteArrayOp_Word8AsWord32ReadByteArrayOp_Word8AsWord64WriteByteArrayOp_CharWriteByteArrayOp_WideCharWriteByteArrayOp_IntWriteByteArrayOp_WordWriteByteArrayOp_AddrWriteByteArrayOp_FloatWriteByteArrayOp_DoubleWriteByteArrayOp_StablePtrWriteByteArrayOp_Int8WriteByteArrayOp_Int16WriteByteArrayOp_Int32WriteByteArrayOp_Int64WriteByteArrayOp_Word8WriteByteArrayOp_Word16WriteByteArrayOp_Word32WriteByteArrayOp_Word64WriteByteArrayOp_Word8AsChar WriteByteArrayOp_Word8AsWideCharWriteByteArrayOp_Word8AsIntWriteByteArrayOp_Word8AsWordWriteByteArrayOp_Word8AsAddrWriteByteArrayOp_Word8AsFloatWriteByteArrayOp_Word8AsDouble!WriteByteArrayOp_Word8AsStablePtrWriteByteArrayOp_Word8AsInt16WriteByteArrayOp_Word8AsInt32WriteByteArrayOp_Word8AsInt64WriteByteArrayOp_Word8AsWord16WriteByteArrayOp_Word8AsWord32WriteByteArrayOp_Word8AsWord64CompareByteArraysOpCopyByteArrayOpCopyMutableByteArrayOpCopyByteArrayToAddrOpCopyMutableByteArrayToAddrOpCopyAddrToByteArrayOpSetByteArrayOpAtomicReadByteArrayOp_IntAtomicWriteByteArrayOp_IntCasByteArrayOp_IntCasByteArrayOp_Int8CasByteArrayOp_Int16CasByteArrayOp_Int32CasByteArrayOp_Int64FetchAddByteArrayOp_IntFetchSubByteArrayOp_IntFetchAndByteArrayOp_IntFetchNandByteArrayOp_IntFetchOrByteArrayOp_IntFetchXorByteArrayOp_Int AddrAddOp AddrSubOp AddrRemOp AddrToIntOp IntToAddrOpAddrGtOpAddrGeOpAddrEqOpAddrNeOpAddrLtOpAddrLeOpIndexOffAddrOp_CharIndexOffAddrOp_WideCharIndexOffAddrOp_IntIndexOffAddrOp_WordIndexOffAddrOp_AddrIndexOffAddrOp_FloatIndexOffAddrOp_DoubleIndexOffAddrOp_StablePtrIndexOffAddrOp_Int8IndexOffAddrOp_Int16IndexOffAddrOp_Int32IndexOffAddrOp_Int64IndexOffAddrOp_Word8IndexOffAddrOp_Word16IndexOffAddrOp_Word32IndexOffAddrOp_Word64ReadOffAddrOp_CharReadOffAddrOp_WideCharReadOffAddrOp_IntReadOffAddrOp_WordReadOffAddrOp_AddrReadOffAddrOp_FloatReadOffAddrOp_DoubleReadOffAddrOp_StablePtrReadOffAddrOp_Int8ReadOffAddrOp_Int16ReadOffAddrOp_Int32ReadOffAddrOp_Int64ReadOffAddrOp_Word8ReadOffAddrOp_Word16ReadOffAddrOp_Word32ReadOffAddrOp_Word64WriteOffAddrOp_CharWriteOffAddrOp_WideCharWriteOffAddrOp_IntWriteOffAddrOp_WordWriteOffAddrOp_AddrWriteOffAddrOp_FloatWriteOffAddrOp_DoubleWriteOffAddrOp_StablePtrWriteOffAddrOp_Int8WriteOffAddrOp_Int16WriteOffAddrOp_Int32WriteOffAddrOp_Int64WriteOffAddrOp_Word8WriteOffAddrOp_Word16WriteOffAddrOp_Word32WriteOffAddrOp_Word64InterlockedExchange_AddrInterlockedExchange_WordCasAddrOp_AddrCasAddrOp_WordCasAddrOp_Word8CasAddrOp_Word16CasAddrOp_Word32CasAddrOp_Word64FetchAddAddrOp_WordFetchSubAddrOp_WordFetchAndAddrOp_WordFetchNandAddrOp_WordFetchOrAddrOp_WordFetchXorAddrOp_WordAtomicReadAddrOp_WordAtomicWriteAddrOp_Word NewMutVarOp ReadMutVarOp WriteMutVarOpAtomicModifyMutVar2OpAtomicModifyMutVar_Op CasMutVarOpCatchOpRaiseOp RaiseIOOpMaskAsyncExceptionsOpMaskUninterruptibleOpUnmaskAsyncExceptionsOp MaskStatus AtomicallyOpRetryOp CatchRetryOp CatchSTMOp NewTVarOp ReadTVarOp ReadTVarIOOp WriteTVarOp NewMVarOp TakeMVarOp TryTakeMVarOp PutMVarOp TryPutMVarOp ReadMVarOp TryReadMVarOp IsEmptyMVarOp NewIOPortOp ReadIOPortOp WriteIOPortOpDelayOp WaitReadOp WaitWriteOpForkOpForkOnOp KillThreadOpYieldOp MyThreadIdOp LabelThreadOpIsCurrentThreadBoundOp NoDuplicateOpThreadStatusOpMkWeakOpMkWeakNoFinalizerOpAddCFinalizerToWeakOp DeRefWeakOpFinalizeWeakOpTouchOpMakeStablePtrOpDeRefStablePtrOp EqStablePtrOpMakeStableNameOpStableNameToIntOp CompactNewOpCompactResizeOpCompactContainsOpCompactContainsAnyOpCompactGetFirstBlockOpCompactGetNextBlockOpCompactAllocateBlockOpCompactFixupPointersOp CompactAddCompactAddWithSharing CompactSizeReallyUnsafePtrEqualityOpParOpSparkOpSeqOp GetSparkOp NumSparks KeepAliveOp DataToTagOp TagToEnumOp AddrToAnyOp AnyToAddrOp MkApUpd0_OpNewBCOOpUnpackClosureOp ClosureSizeOpGetApStackValOp GetCCSOfOpGetCurrentCCSOp ClearCCSOp WhereFromOp TraceEventOpTraceEventBinaryOp TraceMarkerOpSetThreadAllocationCounterVecBroadcastOp VecPackOp VecUnpackOp VecInsertOpVecAddOpVecSubOpVecMulOpVecDivOp VecQuotOpVecRemOpVecNegOpVecIndexByteArrayOpVecReadByteArrayOpVecWriteByteArrayOpVecIndexOffAddrOpVecReadOffAddrOpVecWriteOffAddrOpVecIndexScalarByteArrayOpVecReadScalarByteArrayOpVecWriteScalarByteArrayOpVecIndexScalarOffAddrOpVecReadScalarOffAddrOpVecWriteScalarOffAddrOpPrefetchByteArrayOp3PrefetchMutableByteArrayOp3PrefetchAddrOp3PrefetchValueOp3PrefetchByteArrayOp2PrefetchMutableByteArrayOp2PrefetchAddrOp2PrefetchValueOp2PrefetchByteArrayOp1PrefetchMutableByteArrayOp1PrefetchAddrOp1PrefetchValueOp1PrefetchByteArrayOp0PrefetchMutableByteArrayOp0PrefetchAddrOp0PrefetchValueOp0 maxPrimOpTag primOpTag allThePrimOps tagToEnumKey primOpFixity primOpDocsprimOpOutOfLineprimOpOkForSpeculationprimOpOkForSideEffects primOpIsCheap primOpIsDivprimOpCodeSize primOpTypeprimOpResultType primOpOccprimOpWrapperIdisComparisonPrimOp primOpSiggetPrimOpResultInfo$fOutputablePrimOp $fOrdPrimOp $fEqPrimOp$fOutputablePrimCall ShowHowMuch ShowHeaderShowSome ShowIfaceAltPprShowSub ss_how_much ss_forall IfaceJoinInfoIfaceNotJoinPointIfaceJoinPoint IfaceLetBndr IfLetBndr IfaceBinding IfaceNonRecIfaceRec IfaceConAlt IfaceDefault IfaceDataAlt IfaceLitAltIfaceAlt IfaceTickish IfaceHpcTickIfaceSCC IfaceSource IfaceExprIfaceLclIfaceExtIfaceCo IfaceTupleIfaceLamIfaceApp IfaceCase IfaceECaseIfaceLet IfaceCastIfaceLitIfaceLitRubbish IfaceFCall IfaceTick IfaceLFInfo IfLFReEntrant IfLFThunkIfLFCon IfLFUnknown IfLFUnliftedIfaceIdDetails IfVanillaIdIfStrictWorkerId IfRecSelIdIfDFunIdIfaceUnfolding IfCoreUnfold IfCompulsory IfInlineRule IfDFunUnfold IfaceInfoItemHsArityHsDmdSigHsCprSigHsInlineHsUnfold HsNoCafRefsHsLevityHsLFInfoHsTagSig IfaceIdInfoIfaceCompleteMatchIfaceAnnTargetIfaceAnnotationifAnnotatedTargetifAnnotatedValue IfaceRule ifRuleName ifActivation ifRuleBndrs ifRuleHead ifRuleArgs ifRuleRhs ifRuleAuto ifRuleOrph IfaceFamInst ifFamInstFam ifFamInstTysifFamInstAxiom ifFamInstOrph IfaceClsInst ifInstCls ifInstTysifDFunifOFlag ifInstOrph IfaceSrcBang IfSrcBang IfaceBangIfNoBangIfStrictIfUnpack IfUnpackCo IfaceEqSpec IfaceConDeclIfCon ifConName ifConWrapper ifConInfix ifConExTCvsifConUserTvBinders ifConEqSpec ifConCtxt ifConArgTys ifConFields ifConStrictsifConSrcStricts IfaceConDeclsIfAbstractTyCon IfDataTyCon IfNewTyCon IfaceAxBranch ifaxbTyVarsifaxbEtaTyVars ifaxbCoVarsifaxbLHS ifaxbRolesifaxbRHS ifaxbIncompsIfaceAT IfaceClassOpIfaceFamTyConFlavIfaceDataFamilyTyConIfaceOpenSynFamilyTyConIfaceClosedSynFamilyTyCon!IfaceAbstractClosedSynFamilyTyConIfaceBuiltInSynFamTyConIfaceTyConParent IfNoParentIfDataInstanceIfaceClassBodyIfAbstractClassIfConcreteClass ifClassCtxtifATsifSigsifMinDef IfaceDeclIfaceId IfaceData IfaceSynonym IfaceFamily IfaceClass IfaceAxiom IfacePatSynifNameifType ifIdDetailsifIdInfo ifBinders ifResKindifCTypeifRolesifCtxtifCons ifGadtSyntaxifParentifSynRhsifResVar ifFamFlavifFamInjifFDsifBodyifTyConifRole ifAxBranches ifPatIsInfix ifPatMatcher ifPatBuilderifPatUnivBndrs ifPatExBndrs ifPatProvCtxt ifPatReqCtxt ifPatArgsifPatTy ifFieldLabels IfaceTopBndrvisibleIfConDeclsifaceDeclImplicitBndrsifaceDeclFingerprints showToHeader showToIface pprIfaceDecl pprIfaceExprfreeNamesIfDeclfreeNamesIfRulefreeNamesIfFamInst$fNFDataIfaceTyConParent$fBinaryIfaceTyConParent$fOutputableIfaceTyConParent$fNFDataIfaceClassOp$fBinaryIfaceClassOp$fOutputableIfaceClassOp$fHasOccNameIfaceClassOp$fNamedThingIfaceClassOp$fNFDataIfaceAxBranch$fBinaryIfaceAxBranch$fNFDataIfaceFamTyConFlav$fBinaryIfaceFamTyConFlav$fNFDataIfaceBang$fBinaryIfaceBang$fNFDataIfaceSrcBang$fBinaryIfaceSrcBang$fNFDataIfaceConDecl$fBinaryIfaceConDecl$fHasOccNameIfaceConDecl$fNamedThingIfaceConDecl$fNFDataIfaceConDecls$fBinaryIfaceConDecls$fNFDataIfaceClsInst$fBinaryIfaceClsInst$fOutputableIfaceClsInst$fNFDataIfaceFamInst$fBinaryIfaceFamInst$fOutputableIfaceFamInst$fNFDataIfaceAnnotation$fBinaryIfaceAnnotation$fOutputableIfaceAnnotation$fNFDataIfaceCompleteMatch$fBinaryIfaceCompleteMatch$fOutputableIfaceCompleteMatch$fBinaryIfaceLFInfo$fOutputableIfaceLFInfo$fNFDataIfaceTickish$fBinaryIfaceTickish$fNFDataIfaceConAlt$fBinaryIfaceConAlt$fOutputableIfaceConAlt$fNFDataIfaceJoinInfo$fBinaryIfaceJoinInfo$fOutputableIfaceJoinInfo$fNFDataIfaceLetBndr$fNFDataIfaceBinding$fNFDataIfaceAlt$fNFDataIfaceExpr$fNFDataIfaceUnfolding$fNFDataIfaceInfoItem$fBinaryIfaceLetBndr$fBinaryIfaceBinding$fBinaryIfaceExpr$fBinaryIfaceAlt$fBinaryIfaceUnfolding$fBinaryIfaceInfoItem$fOutputableIfaceUnfolding$fOutputableIfaceInfoItem$fOutputableIfaceExpr$fNFDataIfaceIdDetails$fNFDataIfaceAT$fNFDataIfaceClassBody$fNFDataIfaceDecl$fBinaryIfaceIdDetails$fBinaryIfaceAT$fBinaryIfaceDecl$fOutputableIfaceIdDetails$fOutputableIfaceAT$fOutputableIfaceDecl$fHasOccNameIfaceDecl$fNamedThingIfaceDecl$fNFDataIfaceRule$fBinaryIfaceRule$fOutputableIfaceRule$fOutputableShowHowMuch CoreStatsCScs_tmcs_tycs_cocs_vbcs_jbcoreBindsStats exprStats coreBindsSizeexprSize$fOutputableCoreStats SimpleOpts simpleOptExpr so_uf_opts megaSeqIdInfo seqRuleInfoseqRulesseqExprseqExprsseqBinds seqUnfoldingpprCoreBindingspprCoreBindingpprCoreBindingsWithSizepprCoreBindingWithSize pprParendExpr pprCoreExprpprOptCo pprCoreAlt pprCoreBinderpprCoreBinderspprRulespprRule$fOutputableGenTickish$fOutputableCoreRule$fOutputableUnfolding$fOutputableUnfoldingSource$fOutputableUnfoldingGuidance$fOutputableIdInfo$fOutputableBndrTaggedBndr$fOutputableBndrVar$fOutputableAlt$fOutputableExpr$fOutputableBind StgPprOpts stgSccEnabledOutputablePassStgOp StgPrimOp StgPrimCallOp StgFCallOp UpdateFlag ReEntrant Updatable SingleEntry XLetNoEscape XRhsClosureBinderPStgPassVanillaLiftLamsInferTaggedBinders InferTaggedCodeGenConstructorNumberNoNumberNumbered OutStgAlt OutStgRhs OutStgExpr OutStgArg OutStgBindingOutStgTopBindingInStgAltInStgRhs InStgExprInStgArg InStgBindingInStgTopBindingTgStgAltTgStgRhs TgStgExpr TgStgBindingTgStgTopBindingCgStgAltCgStgRhs CgStgExpr CgStgBindingCgStgTopBindingLlStgAltLlStgRhs LlStgExpr LlStgBindingLlStgTopBindingStgAltStgRhsStgExpr StgBinding StgTopBindingAltTypePolyAlt MultiValAltAlgAltPrimAlt GenStgAltalt_con alt_bndrsalt_rhsNoExtFieldSilent GenStgRhs StgRhsClosure StgRhsCon GenStgExprStgAppStgLit StgConAppStgOpAppStgCaseStgLetStgLetNoEscapeStgTickStgArg StgVarArg StgLitArg GenStgBinding StgNonRecStgRecGenStgTopBinding StgTopLiftedStgTopStringLit isDllConApp stgArgTypestgCaseBndrInScopenoExtFieldSilent stgRhsArity freeVarsOfRhs isUpdatablepanicStgPprOptsshortStgPprOptspprGenStgTopBindingpprGenStgTopBindings pprStgBindingpprStgTopBindingpprStgTopBindings pprStgArg pprStgExpr pprStgRhs$fOutputableStgArg$fOutputableNoExtFieldSilent$fOutputableAltType$fOutputableConstructorNumber$fOutputableUpdateFlag$fOutputableStgOp$fOutputableGenStgRhs$fOutputableGenStgExpr$fOutputableGenStgBinding$fDataNoExtFieldSilent$fEqNoExtFieldSilent$fOrdNoExtFieldSilent InfoProvEnt infoTablePtrinfoProvEntClosureType infoTableTypeinfoProvModule infoTableProvDynamicLinkerLabelInfoCodeStub SymbolPtr GotSymbolPtrGotSymbolOffsetConInfoTableLocation UsageSiteDefinitionSiteForeignLabelSourceForeignLabelInPackageForeignLabelInExternalPackageForeignLabelInThisPackageNeedExternDecl isIdLabel isTickyLabelpprDebugCLabelgetConInfoTableLocation mkSRTLabelmkRednCountsLabel mkTagHitLabelmkClosureLabelmkInfoTableLabel mkEntryLabelmkClosureTableLabelmkConInfoTableLabel mkBytesLabelmkBlockInfoTableLabelmkDirty_MUT_VAR_Label#mkNonmovingWriteBarrierEnabledLabelmkUpdInfoLabelmkBHUpdInfoLabelmkIndStaticInfoLabelmkMainCapabilityLabelmkMAP_FROZEN_CLEAN_infoLabelmkMAP_FROZEN_DIRTY_infoLabelmkMAP_DIRTY_infoLabelmkTopTickyCtrLabelmkCAFBlackHoleInfoTableLabelmkArrWords_infoLabelmkSMAP_FROZEN_CLEAN_infoLabelmkSMAP_FROZEN_DIRTY_infoLabelmkSMAP_DIRTY_infoLabelmkBadAlignmentLabelmkOutOfBoundsAccessLabelmkMUT_VAR_CLEAN_infoLabelmkSRTInfoLabelmkCmmInfoLabelmkCmmEntryLabelmkCmmRetInfoLabel mkCmmRetLabelmkCmmCodeLabelmkCmmClosureLabelmkCmmDataLabelmkRtsCmmDataLabelmkLocalBlockLabelmkRtsPrimOpLabelmkSelectorInfoLabelmkSelectorEntryLabelmkApInfoTableLabelmkApEntryLabelmkPrimCallLabelmkForeignLabel addLabelSize isBytesLabelisForeignLabelisStaticClosureLabelisSomeRODataLabelisInfoTableLabelisConInfoTableLabelforeignLabelStdcallInfo mkBitmapLabel mkCCLabel mkCCSLabel mkIPELabelmkRtsApFastLabelmkRtsSlowFastTickyCtrLabelmkHpcTicksLabelmkDynamicLinkerLabeldynamicLinkerLabelInfomkPicBaseLabelmkDeadStripPreventermkStringLitLabelmkInitializerStubLabelmkInitializerArrayLabelmkFinalizerStubLabelmkFinalizerArrayLabelmkAsmTempLabelmkAsmTempDerivedLabelmkAsmTempEndLabelmkAsmTempProcEndLabelmkAsmTempDieLabel toClosureLbltoSlowEntryLbl toEntryLbl toInfoLblhasHaskellNamehasIdLabelInfohasCAF needsCDeclmaybeLocalBlockLabel isMathFunexternallyVisibleCLabelisCFunctionLabel isGcPtrLabel isLocalCLabel labelDynamicppInternalProcLabel mayRedirectTo$fOutputableModuleLabelKind$fOutputableForeignLabelSource$fOrdTickyIdInfo$fOutputableTickyIdInfo $fOutputableConInfoTableLocation$fOutputableIdLabelInfo$fOutputablePPlatformCLabel $fOrdCLabel$fOutputableCLabel $fShowCLabel$fEqInfoProvEnt$fOrdInfoProvEnt $fEqCLabel$fEqDynamicLinkerLabelInfo$fOrdDynamicLinkerLabelInfo$fEqCmmLabelInfo$fOrdCmmLabelInfo$fEqRtsLabelInfo$fOrdRtsLabelInfo$fEqIdLabelInfo$fOrdIdLabelInfo$fEqConInfoTableLocation$fOrdConInfoTableLocation$fEqTickyIdInfo$fShowTickyIdInfo$fEqForeignLabelSource$fOrdForeignLabelSource$fOrdNeedExternDecl$fEqNeedExternDecl$fEqModuleLabelKind$fOrdModuleLabelKindInfoTableProvMapprovDC provClosureprovInfoTablesDCMap ClosureMapIpeSourceLocationemptyInfoTableProvMap newBlockIdblockLbl infoTblLbl GlobalReg VanillaRegFloatReg DoubleRegLongRegXmmRegYmmRegZmmRegSpSpLimHpHpLimCCCS CurrentTSOCurrentNurseryHpAllocEagerBlackholeInfoGCEnter1GCFunBaseRegMachSpUnwindReturnReg PicBaseRegVGcPtr VNonGcPtr DefinerOfRegs foldRegsDefd UserOfRegs foldRegsUsed GlobalRegSet LocalRegSetRegSetLocalRegCmmLitCmmIntCmmFloatCmmVecCmmLabel CmmLabelOffCmmLabelDiffOffCmmBlockCmmHighStackMarkAreaOldYoungCmmRegCmmLocal CmmGlobal AlignmentSpecNaturallyAligned UnalignedCmmExprCmmLoad CmmMachOp CmmStackSlot CmmRegOff cmmExprType cmmLitType cmmExprWidthcmmExprAlignmentmaybeInvertCmmExpr cmmRegType cmmRegWidth localRegType emptyRegSet nullRegSet elemRegSet extendRegSetdeleteFromRegSetmkRegSet minusRegSet plusRegSet timesRegSet sizeRegSet regSetToListfoldLocalRegsUsedfoldLocalRegsDefdbaseRegspReghpReghpLimRegspLimRegnodeReg currentTSORegcurrentNurseryReg hpAllocRegcccsRegnode globalRegTypeisArgReg$fOutputableCmmLit$fUniquableLocalReg $fOrdLocalReg $fEqLocalReg$fUserOfRegsr[]$fUserOfRegsrr$fDefinerOfRegsr[]$fDefinerOfRegsrr$fOrdGlobalReg $fEqGlobalReg$fDefinerOfRegsGlobalRegCmmReg$fUserOfRegsGlobalRegCmmReg$fDefinerOfRegsLocalRegCmmReg$fUserOfRegsLocalRegCmmReg$fUserOfRegsrCmmExpr $fEqCmmExpr $fShowCmmExpr $fEqCmmReg $fOrdCmmReg $fShowCmmReg$fShowGlobalReg $fEqVGcPtr $fShowVGcPtr$fShowLocalReg $fEqCmmLit $fShowCmmLit$fEqArea $fOrdArea $fShowArea$fEqAlignmentSpec$fOrdAlignmentSpec$fShowAlignmentSpec callerSaves activeStgRegs haveRegBaseglobalRegMaybefreeReg freeRegBasemodBreaks_flagsmodBreaks_locsmodBreaks_varsmodBreaks_decls modBreaks_ccsmodBreaks_breakInfo CCostCentre BreakIndex CgBreakInfocgb_vars cgb_restyBCONPtr BCONPtrWord BCONPtrLbl BCONPtrItbl BCONPtrStrBCOPtr BCOPtrName BCOPtrPrimOp BCOPtrBCOBCOPtrBreakArray UnlinkedBCOunlinkedBCONameunlinkedBCOArityunlinkedBCOInstrsunlinkedBCOBitmapunlinkedBCOLitsunlinkedBCOPtrsItblPtrItblEnv TupleInfo tupleSize tupleRegstupleNativeStackSize RegBitmap unRegBitmapFFIInfoCompiledByteCodebc_bcosbc_itblsbc_ffisbc_strs bc_breaksseqCompiledByteCode voidTupleInfoemptyModBreaks$fOutputableTupleInfo$fNFDataBCONPtr$fOutputableUnlinkedBCO$fNFDataBCOPtr$fNFDataUnlinkedBCO$fOutputableCgBreakInfo$fOutputableCompiledByteCode $fShowItblPtr$fNFDataItblPtr$fShowTupleInfo$fEnumRegBitmap $fEqRegBitmap$fShowRegBitmap$fIntegralRegBitmap$fNumRegBitmap$fOrdRegBitmap$fRealRegBitmap$fBitsRegBitmap$fFiniteBitsRegBitmap$fOutputableRegBitmap $fEnumWordOff $fEqWordOff $fShowWordOff$fIntegralWordOff $fNumWordOff $fOrdWordOff $fRealWordOff$fOutputableWordOff $fEnumByteOff $fEqByteOff $fShowByteOff$fIntegralByteOff $fNumByteOff $fOrdByteOff $fRealByteOff$fOutputableByteOff $fShowFFIInfo$fNFDataFFIInfo primOpRuleseqDeBruijnExpr eqCoreExpr lookupCoreMap extendCoreMap foldCoreMap emptyCoreMap$fTrieMapAltMap$fTrieMapCoreMapX$fOutputableCoreMap$fTrieMapCoreMapCoreAltWithFVsCoreExprWithFVs'CoreExprWithFVsCoreBindWithFVsFVAnn exprFreeVarsexprFreeVarsDSetexprFreeVarsList exprFreeIds exprsFreeIdsexprFreeIdsDSetexprFreeIdsListexprsFreeIdsDSetexprsFreeIdsList exprsFreeVarsexprsFreeVarsList bindFreeVarsexprSomeFreeVarsexprSomeFreeVarsListexprsSomeFreeVarsexprsSomeFreeVarsListexpr_fvsexprsOrphNamesorphNamesOfTypeorphNamesOfTypes orphNamesOfCoorphNamesOfCoConorphNamesOfAxiomorphNamesOfFamInstruleRhsFreeVarsrulesRhsFreeIdsruleLhsFreeIdsruleLhsFreeIdsList ruleFreeVarsrulesFreeVarsDSet rulesFreeVars mkRuleInfo freeVarsOf freeVarsOfAnnvarTypeTyCoVarsvarTypeTyCoFVs idFreeVars dIdFreeVarsidFVsbndrRuleAndUnfoldingVarsDSetbndrRuleAndUnfoldingIds idRuleVarsidUnfoldingVarsstableUnfoldingVars freeVarsBindfreeVars CheapAppFunexprType coreAltType coreAltsType mkLamType mkLamTypesapplyTypeToArgs mkCastMComkPiMComkCastmkTickmkTicksisSaturatedConApp mkTickNoHNF tickHNFArgs stripTicksTopstripTicksTopEstripTicksTopT stripTicksE stripTicksT bindNonRecneedsCaseBinding mkAltExpr mkDefaultCasemkSingleAltCase findDefault addDefault isDefaultAltfindAlt mergeAlts trimConArgs filterAltsrefineDefaultAltcombineIdenticalAlts scaleAltsBy exprIsTrivialgetIdFromTrivialExprgetIdFromTrivialExpr_maybe exprIsDeadEnd exprIsDupableexprIsWorkFree exprIsCheap exprIsCheapXexprIsExpandable isCheapAppisExpandableAppexprOkForSpeculationexprOkForSideEffectsaltsAreExhaustive exprIsHNF exprIsConLikeexprIsTopLevelBindableexprIsTickedStringexprIsTickedString_maybedataConRepInstPatdataConRepFSInstPat cheapEqExpr cheapEqExpr'eqExpr diffBinds tryEtaReducecanEtaReduceToArity isEmptyTynormSplitTyConApp_maybecollectMakeStaticArgs isJoinBinddumpIdInfoOfProgramcomputeCbvInfoisUnsafeEqualityProoftidyCbvInfoToptidyExpr tidyRules tidyUnfolding IdSubstEnvSubst isEmptySubst emptySubst mkEmptySubstmkSubst substInScope zapSubstEnv extendIdSubstextendIdSubstList extendSubstextendSubstWithVarextendSubstList lookupIdSubstdelBndrdelBndrs mkOpenSubst extendInScopeextendInScopeListextendInScopeIds setInScope substExprSC substExpr substBindSC substBind deShadowBinds substBndr substBndrs substRecBndrs cloneIdBndr cloneIdBndrs cloneBndrs cloneBndrcloneRecIdBndrs getTCvSubst substIdType substIdInfosubstUnfoldingSCsubstUnfolding substIdOcc substRuleInfosubstRulesForImportedIds substDVarSet substTickish$fOutputableSubstprimOpIdallThePrimOpIds CmmTickScope GlobalScopeSubScope CombinedScope ForeignTarget PrimTarget CmmReturnInfo CmmMayReturnCmmNeverReturnsForeignConvention ConventionNativeDirectCallNativeNodeCall NativeReturnSlowGCUpdFrameOffset CmmFormal CmmActualCmmNodeCmmEntry CmmCommentCmmTick CmmUnwind CmmAssignCmmStoreCmmUnsafeForeignCall CmmBranch CmmCondBranch CmmSwitchCmmCallCmmForeignCallcml_predcml_true cml_false cml_likely cml_targetcml_cont cml_args_regscml_args cml_ret_args cml_ret_offtgtresargsret_argsret_offintrblforeignTargetHints wrapRecExpmapExp mapExpDeep wrapRecExpMmapExpM mapExpDeepM wrapRecExpffoldExp foldExpDeep mapSuccessorsmapCollectSuccessorsisTickSubScopecombineTickScopes$fUserOfRegsrForeignTarget$fOutputableCmmTickScope$fOrdCmmTickScope$fEqCmmTickScope$fDefinerOfRegsGlobalRegCmmNode$fDefinerOfRegsLocalRegCmmNode$fUserOfRegsGlobalRegCmmNode$fUserOfRegsLocalRegCmmNode$fNonLocalCmmNode$fEqForeignTarget$fEqForeignConvention$fEqCmmReturnInfo$fEqConvention $fEqCmmNode ListGraph GenBasicBlock BasicBlock RawCmmStatics CmmStatics GenCmmStatics CmmStaticsRaw CmmStatic CmmStaticLitCmmUninitialised CmmString CmmFileEmbedSectionSectionProtectionReadWriteSectionReadOnlySectionWriteProtectedSection SectionTypeText ReadOnlyDataRelocatableReadOnlyDataUninitialisedDataReadOnlyData16 InitArray FiniArrayCString OtherSection ProfilingInfoNoProfilingInfo CmmInfoTablecit_lblcit_repcit_profcit_srtcit_clo CmmStackInfo StackInfo arg_space do_layout CmmTopInfoTopInfo info_tbls stack_info GenCmmGraphCmmGraphg_entryg_graph RawCmmDecl CmmDeclSRTsCmmDecl GenCmmDeclCmmProcCmmData RawCmmGroup CmmGroupSRTsCmmGroup GenCmmGroup CmmProgram topInfoTablesectionProtectionblockId pprBBlock$fOutputableCmmStatic$fOutputablePenvGenBasicBlock$fOutputableGenBasicBlock$fOutputablePenvListGraph$fOutputableListGraph$fFunctorListGraph$fFunctorGenBasicBlock$fFunctorGenCmmDecl$fEqSectionProtection$fShowSectionType$fEqCmmInfoTable$fEqProfilingInfoOutputableBndrId NoGhcTcPassIdGhcPIsPassghcPassGhcTcGhcRnGhcPsPassParsedRenamed TypecheckedGhcPass IsSrcSpanAnnpprIfPspprIfRnpprIfTcnoHsTok noHsUniTok $fDataGhcPass$fMapXRecGhcPass$fUnXRecGhcPass$fIsPassTypechecked$fIsPassRenamed$fIsPassParsed $fDataPass StarIsNotType SimilarNameSimilarRdrName HowInScopeLocallyBoundAtImportSuggestionCouldImportFromCouldUnhideFromInstantiationSuggestionGhcHint UnknownHintSuggestExtensionSuggestMissingDoSuggestLetInDoSuggestAddSignatureCabalFileSuggestSignatureInstantiationsSuggestUseSpacesSuggestUseWhitespaceAfterSuggestUseWhitespaceAroundSuggestParenthesesSuggestIncreaseMaxPmCheckModelsSuggestAddTypeSignaturesSuggestBindToWildcard SuggestAddInlineOrNoInlinePragmaSuggestAddPhaseToCompetingRuleSuggestAddToHSigExportList#SuggestIncreaseSimplifierIterationsSuggestUseTypeFromDataKindSuggestQualifiedAfterModuleNameSuggestThQuotationSyntax SuggestRolesSuggestQualifyStarOperatorSuggestTypeSignatureFormSuggestFixOrphanInstanceSuggestAddStandaloneDerivationSuggestFillInWildcardConstraintSuggestRenameForallSuggestAppropriateTHTickSuggestDumpSlicesSuggestAddTickSuggestMoveToDeclarationSiteSuggestSimilarNamesRemindFieldSelectorSuppressedSuggestImportingDataConsuppressed_selectorsuppressed_parentsLanguageExtensionHintSuggestSingleExtensionSuggestAnyExtensionSuggestExtensionsSuggestExtensionInOrderToAvailableBindings NamedBindingsUnnamedBindingsuggestExtensionsuggestExtensionWithInfosuggestExtensionssuggestExtensionsWithInfosuggestAnyExtensionsuggestAnyExtensionWithInfouseExtensionInOrderTonoStarIsTypeHintsSeverity SevIgnore SevWarningSevError MessageClassMCOutputMCFatal MCInteractiveMCDumpMCInfo MCDiagnostic MsgEnvelope errMsgSpan errMsgContexterrMsgDiagnosticerrMsgSeverityDiagnosticReasonWarningWithoutFlagWarningWithFlagErrorWithoutFlagDiagnosticMessage diagMessage diagReason diagHintsDiagnosticHint DiagnosticdiagnosticMessagediagnosticReasondiagnosticHints DecoratedSDoc unDecoratedMessages getMessages emptyMessages mkMessagesisEmptyMessages singleMessage addMessage unionMessagesunionManyMessages mkDecoratedmkSimpleDecoratedunionDecoratedSDocmapDecoratedSDocnoHintsmkPlainDiagnostic mkPlainErrormkDecoratedDiagnosticmkDecoratedError pprMessageBag mkLocMessagemkLocMessageAnngetCaretDiagnosticisIntrinsicErrorMessageisWarningMessage errorsFoundisExtrinsicErrorMessageerrorsOrFatalWarningsFoundgetWarningMessagesgetErrorMessagespartitionMessages$fOutputableDiagnosticHint$fOutputableDiagnosticReason$fDiagnosticDiagnosticMessage$fToJsonSeverity$fOutputableSeverity$fToJsonMessageClass$fShowMsgEnvelope$fOutputableMessages$fSemigroupMessages$fMonoidMessages$fFunctorMessages$fFoldableMessages$fTraversableMessages$fFunctorMsgEnvelope$fFoldableMsgEnvelope$fTraversableMsgEnvelope$fEqMessageClass$fShowMessageClass $fEqSeverity$fShowSeverity$fEqDiagnosticReason$fShowDiagnosticReasonContainsLogger extractLogger HasLogger getLoggerLoggerlogFlags DumpFormat FormatHaskell FormatCore FormatSTGFormatByteCode FormatCMM FormatASMFormatC FormatLLVM FormatText TraceAction DumpAction LogActionLogFlagslog_default_user_contextlog_default_dump_contextlog_dump_flagslog_show_caretlog_show_warn_groupslog_enable_timestampslog_dump_to_file log_dump_dirlog_dump_prefixlog_dump_prefix_overridelog_enable_debug log_verbositydefaultLogFlagslog_dopt log_set_doptlogHasDumpFlaglogVerbAtLeastupdateLogFlags setLogFlagsloggerTraceFlushUpdateloggerTraceFlush initLogger putLogMsg putDumpFile putTraceMsg pushLogHook popLogHook pushDumpHook popDumpHook pushTraceHook popTraceHookmakeThreadSafe jsonLogActiondefaultLogActiondefaultLogActionHPrintDocdefaultLogActionHPutStrDocdefaultDumpActionwithDumpFileHandledefaultTraceActionlogMsg logDumpFile logTraceMsg logDumpMsgputDumpFileMaybeputDumpFileMaybe' touchDumpFile$fShowDumpFormat$fEqDumpFormatCallCtxt BoringCtxtRhsCtxt DiscArgCtxt RuleArgCtxt ValAppCtxtCaseCtxt ArgSummaryTrivArg NonTrivArgValueArgunfoldingCreationThresholdunfoldingUseThresholdunfoldingFunAppDiscountunfoldingDictDiscountunfoldingVeryAggressiveunfoldingCaseThresholdunfoldingCaseScalingunfoldingReportPrefixupdateReportPrefixinlineBoringOkcalcUnfoldingGuidancecouldBeSmallEnoughToInlinesmallEnoughToInlinecallSiteInline$fOutputableExprSize$fOutputableArgSummary$fOutputableCallCtxtValidity Validity'IsValidNotValidDiagOptsdiag_warning_flagsdiag_fatal_warning_flagsdiag_warn_is_errordiag_reverse_errorsdiag_max_errors diag_ppr_ctx diag_woptdiag_fatal_woptdiagReasonSeveritymkMCDiagnosticerrorDiagnostic mkMsgEnvelopemkErrorMsgEnvelopemkPlainMsgEnvelopemkPlainErrorMsgEnvelopeandValidallValid getInvalidsorValidformatBulleted pprMessagespprMsgEnvelopeBagWithLocpprLocMsgEnvelope sortMsgBagghcExiterrorMsg fatalErrorMsgcompilationProgressMsgshowPass withTimingwithTimingSilent debugTraceMsgputMsgprintInfoForUserprintOutputForUserlogInfo logOutputprettyPrintGhcErrorstraceCmd$fEqPrintTimings$fShowPrintTimings$fFunctorValidity'TempDirTempFileLifetimeTFL_CurrentModuleTFL_GhcSession FilesToClean ftcGhcSessionftcCurrentModuleTmpFsemptyFilesToClean initTmpFs forkTmpFsFrommergeTmpFsInto cleanTempDirscleanTempFilescleanCurrentModuleTempFilesaddFilesToCleanchangeTempFilesLifetime newTempName newTempDirnewTempLibNamewithSystemTempDirectorywithTempDirectory$fShowTempFileLifetimeStgToCmmConfigstgToCmmProfilestgToCmmThisModulestgToCmmTmpDirstgToCmmContextstgToCmmDebugLevelstgToCmmBinBlobThreshstgToCmmMaxInlAllocSizestgToCmmDoTickystgToCmmTickyAllocdstgToCmmTickyLNEstgToCmmTickyDynThunkstgToCmmTickyTagstgToCmmLoopificationstgToCmmAlignCheckstgToCmmOptHpcstgToCmmFastPAPCallsstgToCmmSCCProfilingstgToCmmEagerBlackHolestgToCmmInfoTableMapstgToCmmOmitYieldsstgToCmmOmitIfPragmas stgToCmmPIC stgToCmmPIEstgToCmmExtDynRefsstgToCmmDoBoundsCheckstgToCmmDoTagCheckstgToCmmAllowBigArithstgToCmmAllowQuotRemInstrstgToCmmAllowQuotRem2!stgToCmmAllowExtendedAddSubInstrsstgToCmmAllowIntMul2InstrstgToCmmAllowFabsInstrsstgToCmmTickyAPstgToCmmVecInstrsErr stgToCmmAvx stgToCmmAvx2stgToCmmAvx512fstgToCmmPlatformPipelineOutput Temporary Persistent SpecificFile NoOutputFilePipeEnv stop_phase src_filename src_basename src_suffix output_specMonadUseuseTPipelineClass$fShowPipelineOutputCmdLineP runCmdLineEwMWarn warnReasonwarnMsgErrerrMsg WarnReasonNoReasonReasonDeprecatedFlagReasonUnrecognisedFlagOptKindNoArgHasArgSepArg OptPrefix OptIntSuffix IntSuffix WordSuffix FloatSuffixPassFlag AnySuffix GhcFlagModeOnlyGhcOnlyGhciAllModes HiddenFlagFlagflagName flagOptKind flagGhcModedefFlag defGhcFlag defGhciFlag defHiddenFlagrunEwMaddErraddWarn addFlagWarngetArg getCurLocliftEwMgetCmdLineStateputCmdLineState processArgserrorsToGhcException$fToJsonWarnReason$fOutputableWarnReason $fMonadEwM$fApplicativeEwM $fFunctorEwM$fMonadCmdLineP$fApplicativeCmdLineP$fFunctorCmdLineP$fEqWarnReason$fShowWarnReason CompilerInfoGCCClang AppleClang AppleClang51 UnknownCC LinkerInfoGnuLDGnuGoldLlvmLLDDarwinLD SolarisLDAixLD UnknownLDPkgDbRef GlobalPkgDb UserPkgDb PkgDbPathFlagSpec flagSpecName flagSpecFlagflagSpecActionflagSpecGhcMode TurnOnFlagFlushOut FatalMessagerDynamicTooStateDT_DontDT_OKDT_DynRtsOptsEnabled RtsOptsNone RtsOptsIgnoreRtsOptsIgnoreAllRtsOptsSafeOnly RtsOptsAll DynLibLoader DeployableSystemDependent PackageDBFlag PackageDBNoUserPackageDBNoGlobalPackageDBClearPackageDBs PackageFlag ExposePackage HidePackage TrustFlag TrustPackageDistrustPackageIgnorePackageFlag IgnorePackage ModRenamingmodRenamingWithImplicit modRenamings PackageArg UnitIdArgGhcLinkNoLink LinkBinary LinkInMemory LinkDynLib LinkStaticLib LinkMergedObjGhcMode CompManagerOneShotMkDepend LlvmConfig llvmTargets llvmPasses LlvmTarget lDataLayoutlCPU lAttributesProfAuto NoProfAuto ProfAutoAll ProfAutoTopProfAutoExports ProfAutoCallsContainsDynFlagsextractDynFlags HasDynFlags getDynFlagsDynFlagsghcModeghcLinkbackendghcNameVersion fileSettingstargetPlatform toolSettings platformMisc rawSettingstmpDir llvmConfig llvmOptLevel verbosity debugLevel simplPhasesmaxSimplIterations ruleCheckstrictnessBefore parMakeCountenableTimeStats ghcHeapSizemaxRelevantBindsmaxValidHoleFitsmaxRefHoleFitsrefLevelHoleFitsmaxUncoveredPatternsmaxPmCheckModelssimplTickFactor dmdUnboxWidthspecConstrThresholdspecConstrCountspecConstrRecursivebinBlobThresholdliberateCaseThreshold floatLamArgsliftLamsRecArgsliftLamsNonRecArgs liftLamsKnowncmmProcAlignment historySize importPathsmainModuleNameIs mainFunIsreductionDepthsolverIterations homeUnitId_homeUnitInstanceOf_homeUnitInstantiations_workingDirectorythisPackageName hiddenModulesreexportedModules targetWays_ splitInfo objectDirdylibInstallNamehiDirhieDirstubDirdumpDir objectSuf_hcSufhiSuf_hieSuf dynObjectSuf_ dynHiSuf_ outputFile_dynOutputFile_outputHi dynOutputHi dynLibLoader dynamicNow dumpPrefixdumpPrefixForceldInputs includePaths libraryPathsframeworkPathscmdlineFrameworksrtsOptsrtsOptsEnabledrtsOptsSuggestionshpcDirpluginModNamespluginModNameOptsfrontendPluginOpts depMakefiledepIncludePkgDepsdepIncludeCppDepsdepExcludeMods depSuffixespackageDBFlagsignorePackageFlags packageFlagspluginPackageFlags trustFlags packageEnv dumpFlags generalFlags warningFlagsfatalWarningFlagslanguage safeHaskell safeInfer safeInferredthOnLoc newDerivOnLocderiveViaOnLocoverlapInstLocincoherentOnLoc pkgTrustOnLoc warnSafeOnLocwarnUnsafeOnLoctrustworthyOnLoc extensionsextensionFlags unfoldingOpts maxWorkerArgs ghciHistSizeflushOutghcVersionFilehaddockOptions ghciScripts pprUserLengthpprCols useUnicodeuseColor canUseColor colSchemeprofAutocallerCcFiltersinteractivePrint sseVersion bmiVersionavxavx2avx512cdavx512eravx512favx512pfrtldInfortccInfo rtasmInfomaxInlineAllocSizemaxInlineMemcpyInsnsmaxInlineMemsetInsns reverseErrors maxErrors initialUniqueuniqueIncrement cfgWeights IncludeSpecsincludePathsQuoteincludePathsGlobalincludePathsQuoteImplicitaddGlobalIncludeaddQuoteIncludeaddImplicitQuoteIncludeflattenIncludessettings programNameprojectVersion ghcUsagePath ghciUsagePathtopDirextraGccViaCFlagsglobalPackageDatabasePathpgm_Lpgm_Ppgm_Fpgm_cpgm_apgm_lpgm_lmpgm_dllpgm_T pgm_windres pgm_libtoolpgm_lccpgm_ar pgm_otoolpgm_install_name_tool pgm_ranlibpgm_lopgm_lcpgm_iopt_Lopt_Popt_P_signatureopt_Fopt_copt_cxxopt_aopt_lopt_lm opt_windresopt_lccopt_loopt_lcopt_iversionedAppDirversionedFilePath isOneShotisNoLinkpackageFlagsChangedpositionIndependentdynamicTooState setDynamicNow initDynFlagsdefaultDynFlagsdefaultFatalMessagerdefaultFlushOutlanguageExtensions hasPprDebughasNoDebugOutputhasNoStateHackhasNoOptCoerciondoptdopt_set dopt_unsetgoptgopt_set gopt_unsetwoptwopt_set wopt_unset wopt_fatalwopt_set_fatalwopt_unset_fatalxoptxopt_set xopt_unsetxopt_set_unlessExplSpecxopt_DuplicateRecordFieldsxopt_FieldSelectorslang_setpackageTrustOn safeHaskellOnsafeHaskellModeEnabledsafeLanguageOn safeInferOn safeImportsOnsafeDirectImpsReqsafeImplicitImpsReq unsafeFlagsunsafeFlagsForInfergetOpts getVerbFlags setOutputFilesetDynOutputFile setOutputHisetDynOutputHiaddPluginModuleName updOptLevelparseDynamicFlagsCmdLineparseDynamicFilePragmaparseDynamicFlagsFullallNonDeprecatedFlagsflagsAll flagsDynamic flagsPackageflagsForCompletionturnOnturnOff flagSpecOf wWarningFlagsfFlags fLangFlagssupportedLanguagesAndExtensionsxFlags impliedGFlagsimpliedOffGFlags impliedXFlagsglasgowExtsFlagssetGeneralFlag'unSetGeneralFlag' setUnitIdaugmentByWorkingDirectorysetFlagsFromEnvFile setTmpDir picCCOpts pieCCLDOptspicPOpts compilerInfo targetProfilemakeDynFlagsConsistentsetUnsafeGlobalDynFlagsisSse4_2Enabled isAvxEnabled isAvx2EnabledisAvx512cdEnabledisAvx512erEnabledisAvx512fEnabledisAvx512pfEnabled isBmiEnabled isBmi2EnabledsccProfilingEnabledneedSourceNotesuseXLinkerRPathinitSDocContextinitDefaultSDocContext outputFile objectSufwayspprDynFlagsDiffupdatePlatformConstants$fOutputableGhcMode$fOutputablePackageArg$fOutputableModRenaming$fOutputablePackageFlag$fOutputableOnOff$fHasDynFlagsExceptT$fHasDynFlagsMaybeT$fHasDynFlagsReaderT$fHasDynFlagsWriterT$fEqCompilerInfo$fEqLinkerInfo$fEqPackageDBFlag $fEqPkgDbRef$fEqDeprecation$fOrdDeprecation $fEqOnOff $fShowOnOff$fEqDynamicTooState$fShowDynamicTooState$fOrdDynamicTooState$fShowRtsOptsEnabled$fEqDynLibLoader$fEqPackageFlag $fEqTrustFlag$fEqIgnorePackageFlag$fEqModRenaming$fEqPackageArg$fShowPackageArg $fEqGhcLink $fShowGhcLink $fEqGhcMode $fEqProfAuto$fEnumProfAuto$fShowIncludeSpecs ShHoleSubstUnitErr CloseUnitErrPackageFlagErr TrustFlagErrModuleSuggestionSuggestVisible SuggestHidden LookupResult LookupFoundLookupMultiple LookupHiddenLookupUnusableLookupNotFoundUnusableUnitReasonIgnoredWithFlagBrokenDependenciesCyclicDependenciesIgnoredDependenciesShadowedDependencies UnitInfoMap UnitDatabaseunitDatabasePathunitDatabaseUnits UnitState unitInfoMappreloadClosurepackageNameMapwireMap unwireMap preloadUnits explicitUnitshomeUnitDependsmoduleNameProvidersMappluginModuleNameProvidersMaprequirementContextallowVirtualUnitsPreloadUnitClosure ModuleOrigin ModHidden ModUnusable ModOrigin fromOrigUnitfromExposedReexportfromHiddenReexportfromPackageFlagemptyUnitState lookupUnit lookupUnit' lookupUnitId lookupUnitId'unsafeLookupUnitunsafeLookupUnitIdlookupPackageNamesearchPackageIdresolvePackageImport listUnitInfo initUnitsreadUnitDatabases getUnitDbRefsresolveUnitDatabasereadUnitDatabasepprFlag pprReason unwireUnitlookupModuleInAllUnitslookupModuleWithSuggestionslookupModulePackage!lookupPluginModuleWithSuggestionslistVisibleModuleNames closeUnitDepscloseUnitDeps'mayThrowUnitErrrequirementMergespprUnitIdForUserpprUnitInfoForUserpprUnitspprUnitsSimple pprModuleMap improveUnitinstUnitToUnitrenameHoleModulerenameHoleUnitrenameHoleModule'renameHoleUnit'instModuleToModuleimplicitPackageDeps$fMonoidUnitVisibility$fSemigroupUnitVisibility$fOutputableUnitVisibility$fOutputableUnitDatabase$fOutputableUnusableUnitReason$fMonoidModuleOrigin$fSemigroupModuleOrigin$fOutputableModuleOrigin$fOutputableUnitErr ImportAvailsimp_modsimp_direct_dep_modsimp_dep_direct_pkgsimp_trust_own_pkgimp_trust_pkgs imp_boot_mods imp_sig_mods imp_orphs imp_finstsUsagePackageModuleUsageHomeModule UsageFileUsageHomeModuleInterfaceUsageMergedRequirementusg_mod usg_mod_hashusg_safe usg_mod_name usg_entities usg_exports usg_file_path usg_file_hashusg_file_labelusg_iface_hash Dependenciesdep_direct_modsdep_direct_pkgsdep_plugin_pkgs dep_sig_modsdep_trusted_pkgs dep_boot_mods dep_orphs dep_finstsmkDependenciesdep_orphs_updatedep_finsts_updatenoDependenciespprDeps$fBinaryDependencies $fBinaryUsage $fEqUsage$fEqDependencies FinderOptsfinder_importPathsfinder_lookupHomeInterfacesfinder_bypassHiFileCheck finder_waysfinder_enableSuggestionsfinder_workingDirectoryfinder_thisPackageNamefinder_hiddenModulesfinder_reexportedModules finder_hieDir finder_hieSuf finder_hiDir finder_hiSuffinder_dynHiSuffinder_objectDirfinder_objectSuffinder_dynObjectSuffinder_stubDir FindResultFound NoPackage FoundMultipleNotFoundfr_pathsfr_pkgfr_mods_hiddenfr_pkgs_hidden fr_unusablesfr_suggestionsInstalledFindResultInstalledFoundInstalledNoPackageInstalledNotFound FinderCache fcModuleCache fcFileCacheFinderCacheState$fShowFinderOptsInputFileBufferTargetId TargetModule TargetFileTargettargetIdtargetAllowObjCode targetUnitIdtargetContents pprTarget pprTargetId$fOutputableTargetId$fOutputableTarget $fEqTargetId LibrarySpecObjectsArchiveDLLDLLPath FrameworkSptEntryUnlinkedDotODotADotDLLBCOs LinkableSetLinkableLM linkableTimelinkableModulelinkableUnlinked LoadedPkgInfoloaded_pkg_uidloaded_pkg_hs_objsloaded_pkg_non_hs_objsloaded_pkg_trans_deps PkgsLoaded LoaderState closure_envitbl_env bcos_loaded objs_loaded pkgs_loadedtemp_sosLoader loader_stateuninitializedLoader mkLinkableSetunionLinkableSetisObjectLinkable linkableObjsisObjectisInterpretablenameOfObject_maybe nameOfObjectbyteCodeOfObject$fOutputableSptEntry$fOutputableUnlinked$fOutputableLinkable$fOutputableLibrarySpec$fOutputableLoadedPkgInfoTypeSizeTypeCannotBeMarshaledReason NotADataTypeNewtypeDataConNotInScopeUnliftedFFITypesNeededNotABoxedMarshalableTyConForeignLabelNotAPtrNotSimpleUnliftedTypeIllegalForeignTypeReasonTypeCannotBeMarshaledForeignDynNotPtrSafeHaskellMustBeInIOIOResultExpectedUnexpectedNestedForallLinearTypesNotAllowedOneArgExpectedAtLeastOneArgExpectedTcLevelMetaInfoTauTvTyVarTv RuntimeUnkTvCycleBreakerTv ConcreteTvFlexiIndirectSkolemTv RuntimeUnkMetaTvmtv_infomtv_ref mtv_tclvl SyntaxOpTypeSynAnySynRhoSynListSynFunSynType ExpRhoTypeExpSigmaTypeFRR ExpSigmaType InferResultIRir_uniqir_lvlir_refExpTypeCheckInfer TcDTyCoVarSet TcDTyVarSet TcTyCoVarSet TcTyVarSetTcKind TcTauType TcRhoTypeTcSigmaTypeFRR TcSigmaType TcThetaType TcPredType TcTyConBinder PolyTcTyCon MonoTcTyConTcTyCon TcReqTVBinderTcInvisTVBinder TcTyVarBinder TcTyCoVarTcTypeTcCoVarmkCheckExpType synKnownType mkSynFunTys maxTcLevel topTcLevel isTopTcLevel pushTcLevelstrictlyDeeperThandeeperThanOrSame sameDepthAs tcTyVarLevel tcTypeLevel tcTyFamInststcTyFamInstsAndVistcTyConAppTyFamInstsAndVis isTyFamFreeanyRewritableTyVaranyRewritableTyFamAppexactTyCoVarsOfTypeexactTyCoVarsOfTypes tcIsTcTyVarisPromotableMetaTyVarisTouchableMetaTyVarisImmutableTyVar isSkolemTyVarskolemSkolInfoisOverlappableTyVarisAmbiguousTyVarisCycleBreakerTyVar isMetaTyVarTy metaTyVarInfometaTyVarTcLevelmetaTyVarTcLevel_maybe metaTyVarRefsetMetaTyVarTcLevel isTyVarTyVarisFlexi isIndirectisRuntimeUnkSkolmkTyVarNamePairsfindDupTyVarTvs ambigTkvsOfTy mkSigmaTy mkInfSigmaTy mkSpecSigmaTymkPhiTy getDFunTyKey mkTcAppTys mkTcAppTy mkTcCastTy tcSplitPiTystcSplitPiTy_maybetcSplitForAllTyVarBinder_maybetcSplitForAllTyVarstcSplitForAllInvisTyVarstcSplitSomeForAllTyVarstcSplitForAllReqTVBinderstcSplitForAllInvisTVBinderstcSplitForAllTyVarBinders tcIsForAllTytcSplitPredFunTy_maybe tcSplitPhiTytcSplitSigmaTytcSplitNestedSigmaTystcTyConAppTyContcTyConAppTyCon_maybetcTyConAppArgstcSplitTyConApp tcSplitFunTystcSplitFunTy_maybetcSplitFunTysN tcFunArgTy tcFunResultTytcFunResultTyNtcSplitAppTy_maybe tcSplitAppTy tcSplitAppTystcRepGetNumAppTystcGetCastedTyVar_maybetcGetTyVar_maybe tcGetTyVar tcIsTyVarTy tcSplitDFunTytcSplitDFunHeadtcSplitMethodTytcEqKindtcEqTypeNoKindCheck tcEqTyConApps tcEqTypeVis pickyEqTypeisTyVarClassPredcheckValidClsArgs hasTyVarHead evVarPred boxEqPredpickCapturedPredsmkMinimalBySCstransSuperClassesimmSuperClassesisImprovementPred isSigmaTyisRhoTy isRhoExpTyisOverloadedTy isFloatTy isDoubleTy isIntegerTy isNaturalTyisIntTyisWordTyisBoolTyisUnitTyisCharTyisFloatingPrimTy isStringTy isRigidTy deNoteTypetcSplitIOType_maybeisFFIArgumentTyisFFIExternalTyisFFIImportResultTyisFFIExportResultTy isFFIDynTy isFFILabelTyisFFIPrimArgumentTyisFFIPrimResultTy isFunPtrTysizeType sizeTypestcTyConVisibilitiesisNextTyConArgVisibleisNextArgVisible$fOutputableMetaDetails$fOutputableMetaInfo$fOutputableTcLevel$fOutputableTcTyVarDetails$fOutputableInferResult$fOutputableExpType $fEqTcLevel $fOrdTcLevel QuoteWrapper HoleExprRefHER EvCallStack EvCsEmpty EvCsPushCall EvTypeableEvTypeableTyConEvTypeableTyAppEvTypeableTrFunEvTypeableTyLitEvExprEvTermEvFunet_tvset_givenet_bindset_bodyEvBindeb_lhseb_rhs eb_is_given EvBindMapev_bind_varenv EvBindsVar CoEvBindsVarebv_uniq ebv_bindsebv_tcvs TcEvBindsEvBinds HsWrapperWpHole WpComposeWpFunWpCastWpEvLamWpEvAppWpTyLamWpTyAppWpLetWpMultCoercion TcMCoercionR TcMCoercionN TcMCoercion TcCoercionP TcCoercionR TcCoercionN TcCoercion mkTcReflCo mkTcSymCo mkTcSymMCo mkTcTransCo mkTcNomReflCo mkTcRepReflComkTcTyConAppCo mkTcAppCo mkTcFunCo mkTcAxInstComkTcUnbranchedAxInstCo mkTcForAllCo mkTcForAllCos mkTcNthComkTcLRCo mkTcSubCotcDowngradeRolemkTcAxiomRuleComkTcGReflRightComkTcGReflRightMComkTcGReflLeftComkTcGReflLeftMComkTcCoherenceLeftComkTcCoherenceRightCo mkTcPhantomCo mkTcKindCo mkTcCoVarComkTcFamilyTyConAppCotcCoercionKindtcCoercionRole isTcReflCoisTcReflexiveCo maybeTcSubCo maybeTcSymCo<.>mkWpFun mkWpCastR mkWpCastN mkWpTyApps mkWpEvApps mkWpEvVarApps mkWpTyLamsmkWpLamsmkWpLet idHsWrapper isIdHsWrapperhsWrapDictBinderscollectHsWrapBindersisCoEvBindsVaremptyEvBindMap extendEvBindsisEmptyEvBindMap lookupEvBindevBindMapBinds foldEvBindMapnonDetStrictFoldEvBindMapfilterEvBindMapevBindMapToVarSetvarSetMinusEvBindMap evBindVarmkWantedEvBind mkGivenEvBindevId evCoercionevCast evDFunApp evDataConApp evSelector evTypeablemkEvCastmkEvScSelectorsemptyTcEvBindsisEmptyTcEvBindsevTermCoercion_maybeevTermCoercionfindNeededEvVars evVarsOfTerm pprHsWrapperunwrapIPwrapIPquoteWrapperTyVarTyapplyQuoteWrapper$fOutputableEvTypeable$fOutputableEvTerm$fOutputableEvBind$fUniquableEvBindsVar$fOutputableEvBindsVar$fOutputableTcEvBinds$fOutputableEvBindMap$fDataTcEvBinds$fOutputableHsWrapper$fMonoidHsWrapper$fSemigroupHsWrapper$fOutputableEvCallStack$fDataHoleExprRef$fOutputableHoleExprRef$fDataQuoteWrapper$fDataEvCallStack$fDataHsWrapper$fDataEvTypeable $fDataEvTerm TcIdSigInfo SelfBootInfoTcLclEnv getLclEnvLoc setLclEnvLocgetLclEnvTcLevelsetLclEnvTcLevelPotentialUnifiers NoUnifiersOneOrMoreUnifiersClsInstLookupResult InstMatch DFunInstTypeVisibleOrphanModulesInstEnvs ie_globalie_local ie_visibleInstEnvClsInst is_cls_nmis_tcs is_dfun_nameis_tvsis_clsis_tysis_dfunis_flag is_orphanfuzzyClsInstCmpisOverlappable isOverlapping isIncoherentinstanceDFunIdupdateClsInstDFunupdateClsInstDFuns pprInstancepprInstanceHdr pprInstances instanceHeadorphNamesOfClsInst instanceSigmkLocalInstancemkImportedInstance emptyInstEnv mkInstEnv instEnvEltsinstEnvClasses instIsVisibleclassInstancesclassNameInstances memberInstEnv unionInstEnvextendInstEnvList extendInstEnv filterInstEnv anyInstEnv mapInstEnvdeleteFromInstEnvdeleteDFunFromInstEnvidenticalClsInstHeadlookupUniqueInstEnvgetPotentialUnifiers nullUnifiers lookupInstEnvinstanceBindFun$fOutputableClsInst$fNamedThingClsInst$fOutputableInstEnv$fMonoidPotentialUnifiers$fSemigroupPotentialUnifiers$fOutputablePotentialUnifiers$fOutputableInstMatches $fDataClsInst ModDetails md_exportsmd_typesmd_insts md_fam_instsmd_rulesmd_annsmd_complete_matchesemptyModDetailsOptCoercionOptsoptCoercionEnabled optCoercion checkAxInstCoshowSDocshowPprshowSDocForUser printForUser initLogFlags initDiagOpts IOEnvFailureIOEnvfailM failWithMrunIOEnvfixMtryMtryAllMtryMostMunsafeInterleaveMuninterruptibleMaskM_ newMutVar writeMutVar readMutVar updMutVar updMutVarMatomicUpdMutVaratomicUpdMutVar'getEnvsetEnvupdEnv$fMonadPlusIOEnv$fAlternativeIOEnv$fHasModuleIOEnv$fHasLoggerIOEnv$fHasHooksIOEnv$fHasDynFlagsIOEnv$fApplicativeIOEnv$fMonadFailIOEnv $fMonadIOEnv$fMonadIOIOEnv$fFunctorIOEnv$fExceptionIOEnvFailure$fShowIOEnvFailure$fMonadThrowIOEnv$fMonadCatchIOEnv$fMonadMaskIOEnv$fMonadFixIOEnv ArityTypeAT manifestArity joinRhsArity exprArity typeArityexprBotStrictness_maybemkBotArityTypemkTopArityTypearityTypeArityexpandableArityType maxWithArityexprEtaExpandArity findRhsArity idArityType etaExpand etaExpandAT pushCoArgs pushCoArg pushCoTyArg pushCoValArgpushCoercionIntoLambda pushCoDataConcollectBindersPushingCoetaExpandToJoinPointetaExpandToJoinPointRule$fOutputableArityType$fOutputableEtaInfo $fEqArityTypeoccurAnalyseExproccurAnalysePgmzapLambdaBndrs$fOutputableOccEncl$fOutputableUsageDetails$fOutputableDetailsmkFinalUnfoldingmkCompulsoryUnfoldingmkCompulsoryUnfolding'mkSimpleUnfoldingmkDFunUnfoldingmkWrapperUnfoldingmkWorkerUnfoldingmkInlineUnfoldingmkInlineUnfoldingWithAritymkInlinableUnfolding specUnfolding mkUnfoldingmkCoreUnfoldingcertainlyWillInlineExtractedTHDocsethd_mod_headerethd_decl_docs ethd_arg_docsethd_inst_docsDocs docs_mod_hdr docs_decls docs_argsdocs_structuredocs_named_chunksdocs_haddock_opts docs_languagedocs_extensions DocStructureDocStructureItemDsiSectionHeading DsiDocChunkDsiNamedChunkRef DsiExports DsiModExportLHsDocWithHsDocIdentifiers hsDocStringhsDocIdentifiersHsDochsDocIds pprWithDocpprMaybeWithDoc pprHsDocDebug emptyDocs$fBinaryWithHsDocIdentifiers $fOutputableWithHsDocIdentifiers$fOutputableDocStructureItem$fBinaryDocStructureItem$fOutputableDocs $fBinaryDocs$fEqWithHsDocIdentifiers$fDataWithHsDocIdentifiersWarnings NoWarningsWarnAllWarnSome WarningTxt DeprecatedTxtpprWarningTxtForMsgmkIfaceWarnCacheemptyIfaceWarnCache plusWarns$fBinaryWarningTxt$fOutputableWarningTxt$fBinaryWarnings $fEqWarnings$fDataWarningTxt$fEqWarningTxtHoleFit RawHoleFithfIdhfCandhfTypehfRefLvlhfWrap hfMatcheshfDoc HoleFitPluginHoleFitCandidateIdHFCand NameHFCand GreHFCand IEWildcard NoIEWildcardIEVar IEThingAbs IEThingAll IEThingWithIEModuleContentsIEGroupIEDoc IEDocNamedXIELIELIEWrappedName IEWrappedNameIEName IEPatternIETypeEpAnnImportDeclimportDeclAnnImportimportDeclAnnPragmaimportDeclAnnSafeimportDeclAnnQualifiedimportDeclAnnPackageimportDeclAnnAsImportDeclPkgQual ImportDecl XImportDeclideclExtideclSourceSrc ideclName ideclPkgQual ideclSource ideclSafeideclQualified ideclImplicitideclAs ideclHidingImportDeclQualifiedStyle QualifiedPre QualifiedPost NotQualified LImportDeclimportDeclQualifiedStyleisImportDeclQualifiedsimpleImportDeclieNameieNamesieWrappedLName ieWrappedNamelieWrappedNameieLWrappedNamereplaceWrappedNamereplaceLWrappedName pprImpExp$fOutputableIEWrappedName$fOutputableBndrIEWrappedName$fHasOccNameIEWrappedName$fOutputableIE$fOutputableImportDecl$fEqIEWildcard$fDataIEWildcard$fEqIEWrappedName$fDataIEWrappedName$fDataEpAnnImportDecl$fEqImportDeclQualifiedStyle$fDataImportDeclQualifiedStyle OverLitVal HsIntegral HsFractional HsIsString HsOverLitOverLitol_extol_valHsLitHsChar HsCharPrimHsString HsStringPrimHsInt HsIntPrim HsWordPrim HsInt64Prim HsWord64Prim HsIntegerHsRat HsFloatPrim HsDoublePrimXLitnegateOverLitValhsLitNeedsParenshsOverLitNeedsParens $fEqHsLit$fOutputableOverLitVal$fOrdOverLitVal$fEqOverLitVal$fOrdHsOverLit $fEqHsOverLit$fDataOverLitValLPatPatAmbiguousFieldOcc Unambiguous AmbiguousXAmbiguousFieldOccLAmbiguousFieldOccFieldOcc XFieldOccfoExtfoLabel LFieldOcc LHsTypeArgHsArgHsValArg HsTypeArgHsArgPar HsConDetails PrefixConRecConInfixCon ConDeclField cd_fld_ext cd_fld_names cd_fld_type cd_fld_doc LConDeclField HsTupleSortHsUnboxedTupleHsBoxedOrConstraintTupleHsScaledHsLinearArrowTokensHsPct1HsLollyHsArrowHsUnrestrictedArrow HsLinearArrowHsExplicitMultHsTyLitHsNumTyHsStrTyHsCharTyHsCoreTyHsType HsForAllTyHsQualTyHsTyVarHsAppTy HsAppKindTyHsFunTyHsListTy HsTupleTyHsSumTyHsOpTyHsParTy HsIParamTyHsStarTy HsKindSig HsSpliceTyHsDocTyHsBangTyHsRecTyHsExplicitListTyHsExplicitTupleTy HsWildCardTyXHsType hst_xforallhst_telehst_body hst_xqualhst_ctxt HsTyVarBndr UserTyVar KindedTyVar XTyVarBndrHsIPName HsSigTypeHsSig XHsSigTypesig_ext sig_bndrssig_body LHsSigWcType LHsWcType LHsSigTypeHsPSRn hsps_nwcs hsps_imp_tvs HsPatSigTypeHsPS XHsPatSigTypehsps_ext hsps_bodyHsWildCardBndrsHsWCXHsWildCardBndrshswc_ext hswc_bodyHsOuterFamEqnTyVarBndrsHsOuterSigTyVarBndrsHsOuterTyVarBndrsHsOuterImplicitHsOuterExplicitXHsOuterTyVarBndrs hso_ximplicit hso_xexplicit hso_bndrs LHsQTyVarsHsQTvs XLHsQTyVarshsq_ext hsq_explicit LHsTyVarBndrHsForAllTelescope HsForAllVis HsForAllInvisXHsForAllTelescopehsf_xvis hsf_vis_bndrs hsf_xinvishsf_invis_bndrsLHsKindHsKindLHsType HsContext LHsContextBangType LBangType hsQTvExplicit hsPatSigTypemapHsOuterImplicit hsIPNameFSisHsKindedTyVarhsMult hsScaledThing noTypeArgsnumVisibleArgs pprHsArgsApp$fOutputableBndrHsIPName$fOutputableHsIPName$fOutputableHsTyLit$fOutputableHsConDetails$fOutputableHsArg$fOutputableBndrFieldOcc$fOutputableFieldOcc$fDataHsConDetails$fDataHsTupleSort $fDataHsTyLit $fEqHsIPName$fDataHsIPName $fDataHsPSRn $fEqFieldOcc HsFieldBindhfbAnnhfbLHShfbRHShfbPun HsRecUpdField HsRecFieldLHsRecUpdField LHsRecField LHsFieldBind HsRecFieldsrec_flds rec_dotdotHsConPatDetailsConLikePWildPatVarPatLazyPatAsPatParPatBangPatListPatTuplePatSumPatConPatViewPat SplicePatLitPatNPat NPlusKPatSigPatXPat pat_con_extpat_conpat_args hsConPatArgs hsRecFieldshsRecFieldsArgs hsRecFieldSel$fOutputableHsFieldBind$fOutputableHsRecFields$fFunctorHsFieldBind$fFoldableHsFieldBind$fTraversableHsFieldBindpprLPat HsPatSynDirUnidirectionalImplicitBidirectionalExplicitBidirectionalRecordPatSynFieldrecordPatSynFieldrecordPatSynPatVarHsPatSynDetails FixitySig LFixitySigSigTypeSig PatSynSig ClassOpSigIdSigFixSig InlineSigSpecSig SpecInstSig MinimalSig SCCFunSigCompleteMatchSigXSigLSigIPBindXIPBindLIPBind HsIPBindsIPBinds PatSynBindPSBpsb_extpsb_idpsb_argspsb_defpsb_dirHsBindLRFunBindPatBindVarBind XHsBindsLRfun_extfun_id fun_matchesfun_tickpat_extpat_lhspat_rhs pat_ticksvar_extvar_idvar_rhs LHsBindLR LHsBindsLRHsBindLHsBindsLHsBind HsValBindsLRValBinds XValBindsLR HsValBindsLHsLocalBindsLRHsLocalBindsLREmptyLocalBindsXHsLocalBindsLR LHsLocalBinds HsLocalBinds isFixityLSig isTypeLSig isSpecLSigisSpecInstLSig isPragLSig isInlineLSig isMinimalLSig isSCCFunSigisCompleteMatchSighsSigDocextractSpecPragName$fOutputableRecordPatSynField RoleAnnotDeclXRoleAnnotDeclLRoleAnnotDecl AnnProvenanceValueAnnProvenanceTypeAnnProvenanceModuleAnnProvenance HsAnnotationXAnnDeclLAnnDeclWarnDeclWarning XWarnDecl LWarnDecl WarnDecls XWarnDeclswd_extwd_src wd_warnings LWarnDeclsDocDeclDocCommentNextDocCommentPrevDocCommentNamedDocGroupLDocDeclRuleBndr RuleBndrSig XRuleBndr LRuleBndrHsRuleRnRuleDeclHsRule XRuleDeclrd_extrd_namerd_actrd_tyvsrd_tmvsrd_lhsrd_rhs LRuleDecl RuleDeclsHsRules XRuleDeclsrds_extrds_src rds_rules LRuleDecls ForeignExportCExport CImportSpec CFunctionCWrapper ForeignImportCImport ForeignDecl XForeignDeclfd_i_extfd_name fd_sig_tyfd_fifd_e_extfd_fe LForeignDecl DefaultDecl XDefaultDecl LDefaultDecl DerivStrategy StockStrategyAnyclassStrategyNewtypeStrategy ViaStrategyLDerivStrategy DerivDecl XDerivDecl deriv_ext deriv_typederiv_strategyderiv_overlap_mode LDerivDeclInstDeclClsInstD DataFamInstD TyFamInstD XInstDecl cid_d_extcid_instdfid_ext dfid_insttfid_ext tfid_inst LInstDecl ClsInstDecl XClsInstDeclcid_ext cid_poly_ty cid_bindscid_sigscid_tyfam_instscid_datafam_instscid_overlap_mode LClsInstDeclFamEqnXFamEqnfeqn_ext feqn_tycon feqn_bndrs feqn_pats feqn_fixityfeqn_rhsDataFamInstDecldfid_eqnLDataFamInstDecl TyFamInstDeclXTyFamInstDecltfid_xtntfid_eqnLTyFamInstDeclLTyFamDefltDeclTyFamDefltDecl TyFamInstEqnHsTyPats LTyFamInstEqnHsConDeclGADTDetails PrefixConGADT RecConGADTHsConDeclH98DetailsConDecl ConDeclGADT ConDeclH98XConDecl con_g_ext con_names con_bndrs con_mb_cxt con_g_args con_res_tycon_doccon_extcon_name con_forall con_ex_tvscon_argsLConDecl NewOrDataNewTypeDataTypeStandaloneKindSigLStandaloneKindSigDerivClauseTys DctSingleDctMultiXDerivClauseTysLDerivClauseTysHsDerivingClauseXHsDerivingClausederiv_clause_extderiv_clause_strategyderiv_clause_tysLHsDerivingClause HsDeriving HsDataDefn XHsDataDefndd_extdd_NDdd_ctxtdd_cType dd_kindSigdd_cons dd_derivs FamilyInfo DataFamilyOpenTypeFamilyClosedTypeFamilyInjectivityAnnXInjectivityAnnLInjectivityAnn FamilyDecl XFamilyDeclfdExtfdInfo fdTopLevelfdLNamefdTyVarsfdFixity fdResultSigfdInjectivityAnn LFamilyDeclFamilyResultSigNoSigKindSigTyVarSigXFamilyResultSigLFamilyResultSig TyClGroup XTyClGroup group_ext group_tyclds group_roles group_kisigs group_instds DataDeclRn tcdDataCusktcdFVs LHsFunDepXFunDepTyClDeclFamDeclSynDeclDataDecl ClassDecl XTyClDecltcdFExttcdFamtcdSExttcdLName tcdTyVars tcdFixitytcdRhstcdDExt tcdDataDefntcdCExttcdCtxttcdFDstcdSigstcdMethstcdATs tcdATDefstcdDocs LTyClDecl SpliceDecl LSpliceDeclHsGroupXHsGrouphs_exths_valds hs_splcds hs_tyclds hs_derivdshs_fixdshs_defdshs_fords hs_warndshs_annds hs_ruledshs_docsHsDeclTyClDInstDDerivDValDSigDKindSigDDefDForDWarningDAnnDRuleDSpliceDDocD RoleAnnotDXHsDeclLHsDeclhsGroupInstDecls isDataDecl isSynDecl isClassDecl isFamilyDeclisTypeFamilyDeclisOpenTypeFamilyInfoisClosedTypeFamilyInfoisDataFamilyDecltyClDeclTyVarscountTyClDeclstyClGroupTyClDeclstyClGroupInstDeclstyClGroupRoleDeclstyClGroupKindSigs pprFlavournewOrDataToFlavourderivStrategyNamecollectRuleBndrSigTyspprFullRuleName docDeclDocannProvenanceName_maybe$fOutputableNewOrData$fOutputableFamilyInfo$fOutputableForeignImport$fOutputableForeignExport$fOutputableDocDecl$fDataHsRuleRn$fDataForeignExport$fDataForeignImport$fDataCImportSpec $fEqNewOrData$fDataNewOrData$fDataDataDeclRn $fDataDocDeclMapDocLoc ModuleDocDeclDocArgDocInstDoc AnnLookupAnnLookupModule AnnLookupNameNominalRRepresentationalRPhantomRInferR TyVarBndrPlainTVKindedTVForallT ForallVisTAppTAppKindTSigTVarTConT PromotedTInfixTUInfixTPromotedInfixTPromotedUInfixTParensTTupleT UnboxedTupleT UnboxedSumTArrowT MulArrowT EqualityTListTPromotedTupleT PromotedNilT PromotedConsTStarT ConstraintTLitT WildCardTImplicitParamT PatSynArgs PrefixPatSyn InfixPatSyn RecordPatSyn PatSynDirUnidir ImplBidir ExplBidir VarStrictType StrictType VarBangTypeBangConNormalCRecCInfixCForallCGadtCRecGadtCDecidedStrictness DecidedLazy DecidedStrict DecidedUnpackSourceStrictnessNoSourceStrictness SourceLazy SourceStrictSourceUnpackednessNoSourceUnpackednessSourceNoUnpack SourceUnpackCxtModuleAnnotationTypeAnnotationValueAnnotationRuleVar TypedRuleVarPhases AllPhases FromPhase BeforePhase RuleMatchPragmaInlinePOpaqueP SpecialisePSpecialiseInstPRulePAnnPLineP CompletePUnsafeSafe InterruptibleCallconvStdCallCApiPrim JavaScriptForeignImportFExportFTySynEqnTypeFamilyHead PatSynType DerivClauseOverlapDecFunDDataDNewtypeDTySynDClassD InstanceDKiSigDForeignDInfixDDefaultDPragmaD DataFamilyD DataInstD NewtypeInstD TySynInstDOpenTypeFamilyDClosedTypeFamilyDStandaloneDerivD DefaultSigDPatSynD PatSynSigDImplicitParamBindDRangeFromR FromThenRFromToR FromThenToRStmtBindSLetSNoBindSParSRecSGuardNormalGPatGGuardedBNormalBFieldExpExpVarEConELitEAppEAppTypeEInfixEUInfixEParensELamELamCaseETupE UnboxedTupE UnboxedSumECondEMultiIfELetECaseEDoEMDoECompE ArithSeqEListESigERecConERecUpdEStaticE UnboundVarELabelEImplicitParamVarE GetFieldE ProjectionEClauseMatchFieldPatLitPVarPTupP UnboxedTupP UnboxedSumPConPInfixPUInfixPParensPTildePBangPAsPWildPRecPListPSigPViewPBytesbytesPtr bytesOffset bytesSizeCharLStringLIntegerL RationalLIntPrimL WordPrimL FloatPrimL DoublePrimL StringPrimL BytesPrimL CharPrimL InstanceDecSumAritySumAlt ParentName ModuleInfoInfoClassIClassOpITyConIFamilyI PrimTyConIDataConIPatSynIVarITyVarICharPosLoc loc_filename loc_package loc_module loc_startloc_endNameIsAloneAppliedUniqVarNameDataName TcClsName NameFlavourNameSNameQNameUNameLNameGPkgNameModNameLiftlift liftTypedCode examineCodeTExpunTypeQuotenewNameQunQQuasiqNewNameqReportqRecover qLookupNameqReify qReifyFixity qReifyTypeqReifyInstances qReifyRolesqReifyAnnotations qReifyModuleqReifyConStrictness qLocationqRunIOqGetPackageRootqAddDependentFile qAddTempFile qAddTopDeclsqAddForeignFilePathqAddModFinalizerqAddCorePluginqGetQqPutQ qIsExtEnabled qExtsEnabledqPutDocqGetDocmemcmp newNameIObadIOcounterrunQunTypeQunsafeTExpCoerceunsafeCodeCoerceliftCode unTypeCode hoistCodebindCode bindCode_joinCodereport reportError reportWarningrecover lookupNamelookupTypeNamelookupValueNamereify reifyFixity reifyTypenewDeclarationGroupreifyInstances reifyRolesreifyAnnotations reifyModulereifyConStrictness isInstancelocationrunIOgetPackageRootmakeRelativeToProjectaddDependentFile addTempFile addTopDeclsaddForeignFileaddForeignSourceaddForeignFilePath addCorePlugingetQputQ isExtEnabled extsEnabledputDocgetDoc sequenceQ liftStringtrueName falseName nothingNamejustNameleftName rightName nonemptyNameoneNamemanyNamedataToQa dataToExpQliftData dataToPatQ mkModName modString mkPkgName pkgString occStringnameBase namePackage nameSpacemkNamemkNameUmkNameLmkNameGmkNameS mkNameG_v mkNameG_tc mkNameG_dshowName showName' tupleDataName tupleTypeNameunboxedTupleDataNameunboxedTupleTypeName mk_tup_nameunboxedSumDataNameunboxedSumTypeNameeqBytes compareBytescmpEq $fShowName $fQuoteIO $fOrdBytes $fEqBytes $fShowBytes$fLiftSumRep(#||||||#)$fLiftSumRep(#|||||#)$fLiftSumRep(#||||#)$fLiftSumRep(#|||#)$fLiftSumRep(#||#)$fLiftSumRep(#|#)$fLiftTupleRep(#,,,,,,#)$fLiftTupleRep(#,,,,,#)$fLiftTupleRep(#,,,,#)$fLiftTupleRep(#,,,#)$fLiftTupleRep(#,,#)$fLiftTupleRep(#,#)$fLiftTupleRepUnit#$fLiftTupleRep(##)$fLiftLiftedRep(,,,,,,)$fLiftLiftedRep(,,,,,)$fLiftLiftedRep(,,,,)$fLiftLiftedRep(,,,)$fLiftLiftedRep(,,)$fLiftLiftedRep(,)$fLiftLiftedRep()$fLiftLiftedRepVoid$fLiftLiftedRepNonEmpty$fLiftLiftedRep[]$fLiftLiftedRepEither$fLiftLiftedRepMaybe$fLiftAddrRepAddr#$fLiftLiftedRepBool$fLiftWordRepChar#$fLiftLiftedRepChar$fLiftDoubleRepDouble#$fLiftLiftedRepDouble$fLiftFloatRepFloat#$fLiftLiftedRepFloat$fLiftLiftedRepRatio$fLiftLiftedRepNatural$fLiftLiftedRepWord64$fLiftLiftedRepWord32$fLiftLiftedRepWord16$fLiftLiftedRepWord8$fLiftLiftedRepWord$fLiftWordRepWord#$fLiftLiftedRepInt64$fLiftLiftedRepInt32$fLiftLiftedRepInt16$fLiftLiftedRepInt8$fLiftIntRepInt#$fLiftLiftedRepInt$fLiftLiftedRepInteger$fQuasiQ $fMonadIOQ$fQuoteQ $fMonadFixQ $fMonoidQ $fSemigroupQ$fApplicativeQ $fFunctorQ $fMonadFailQ$fMonadQ $fQuasiIO $fShowDocLoc $fEqDocLoc $fOrdDocLoc $fDataDocLoc$fGenericDocLoc $fShowInfo$fEqInfo $fOrdInfo $fDataInfo $fGenericInfo $fShowDec$fEqDec$fOrdDec $fDataDec $fGenericDec$fShowPatSynDir $fEqPatSynDir$fOrdPatSynDir$fDataPatSynDir$fGenericPatSynDir $fShowClause $fEqClause $fOrdClause $fDataClause$fGenericClause $fShowBody$fEqBody $fOrdBody $fDataBody $fGenericBody $fShowGuard $fEqGuard $fOrdGuard $fDataGuard$fGenericGuard $fShowStmt$fEqStmt $fOrdStmt $fDataStmt $fGenericStmt $fShowExp$fEqExp$fOrdExp $fDataExp $fGenericExp $fShowRange $fEqRange $fOrdRange $fDataRange$fGenericRange $fShowMatch $fEqMatch $fOrdMatch $fDataMatch$fGenericMatch $fShowPat$fEqPat$fOrdPat $fDataPat $fGenericPat $fShowPragma $fEqPragma $fOrdPragma $fDataPragma$fGenericPragma$fShowDerivClause$fEqDerivClause$fOrdDerivClause$fDataDerivClause$fGenericDerivClause$fShowDerivStrategy$fEqDerivStrategy$fOrdDerivStrategy$fDataDerivStrategy$fGenericDerivStrategy$fShowTySynEqn $fEqTySynEqn $fOrdTySynEqn$fDataTySynEqn$fGenericTySynEqn $fShowForeign $fEqForeign $fOrdForeign $fDataForeign$fGenericForeign$fShowRuleBndr $fEqRuleBndr $fOrdRuleBndr$fDataRuleBndr$fGenericRuleBndr $fShowCon$fEqCon$fOrdCon $fDataCon $fGenericCon$fShowTypeFamilyHead$fEqTypeFamilyHead$fOrdTypeFamilyHead$fDataTypeFamilyHead$fGenericTypeFamilyHead$fShowFamilyResultSig$fEqFamilyResultSig$fOrdFamilyResultSig$fDataFamilyResultSig$fGenericFamilyResultSig $fShowType$fEqType $fOrdType $fGenericType$fShowTyVarBndr $fEqTyVarBndr$fOrdTyVarBndr$fDataTyVarBndr$fGenericTyVarBndr$fFunctorTyVarBndr$fShowAnnLookup $fEqAnnLookup$fOrdAnnLookup$fDataAnnLookup$fGenericAnnLookup $fShowRole $fGenericRole $fShowTyLit $fOrdTyLit$fGenericTyLit$fShowInjectivityAnn$fEqInjectivityAnn$fOrdInjectivityAnn$fDataInjectivityAnn$fGenericInjectivityAnn$fShowSpecificity$fGenericSpecificity$fShowPatSynArgs$fEqPatSynArgs$fOrdPatSynArgs$fDataPatSynArgs$fGenericPatSynArgs $fShowBang$fEqBang $fOrdBang $fDataBang $fGenericBang$fShowDecidedStrictness$fEqDecidedStrictness$fOrdDecidedStrictness$fDataDecidedStrictness$fGenericDecidedStrictness$fShowSourceStrictness$fEqSourceStrictness$fOrdSourceStrictness$fDataSourceStrictness$fGenericSourceStrictness$fShowSourceUnpackedness$fEqSourceUnpackedness$fOrdSourceUnpackedness$fDataSourceUnpackedness$fGenericSourceUnpackedness$fShowAnnTarget $fEqAnnTarget$fOrdAnnTarget$fDataAnnTarget$fGenericAnnTarget $fShowPhases $fEqPhases $fOrdPhases $fDataPhases$fGenericPhases$fShowRuleMatch $fEqRuleMatch$fOrdRuleMatch$fDataRuleMatch$fGenericRuleMatch $fShowInline $fEqInline $fOrdInline $fDataInline$fGenericInline $fOrdSafety$fGenericSafety$fShowCallconv $fEqCallconv $fOrdCallconv$fDataCallconv$fGenericCallconv $fShowFunDep $fEqFunDep $fOrdFunDep $fDataFunDep$fGenericFunDep $fShowOverlap $fEqOverlap $fOrdOverlap $fDataOverlap$fGenericOverlap $fShowLit$fEqLit$fOrdLit $fDataLit $fGenericLit $fDataBytes$fGenericBytes $fOrdFixity $fShowFixity$fGenericFixity$fOrdFixityDirection$fShowFixityDirection$fGenericFixityDirection$fShowModuleInfo$fEqModuleInfo$fOrdModuleInfo$fDataModuleInfo$fGenericModuleInfo $fShowLoc$fEqLoc$fOrdLoc $fDataLoc $fGenericLoc $fGenericName$fDataNameFlavour$fEqNameFlavour$fOrdNameFlavour$fShowNameFlavour$fGenericNameFlavour$fShowNameSpace$fDataNameSpace$fGenericNameSpace $fShowOccName$fGenericOccName $fShowModule $fEqModule $fOrdModule $fDataModule$fGenericModule $fShowPkgName $fEqPkgName $fOrdPkgName $fDataPkgName$fGenericPkgName $fShowModName $fEqModName $fOrdModName $fDataModName$fGenericModNamePprMpprNamepprName' to_HPJ_Doc $fMonadPprM$fApplicativePprM $fFunctorPprM $fShowPprMPprFlag pprTyVarBndrTypeArgTANormalTyArg ForallVisFlag ForallVis ForallInvisPprppr_list Precedence nestDepthunopPrecnoPrecparensIfpprintppr_sig pprFixity pprPatSynSig pprInfixExppprExp pprFields pprMaybeExp pprMatchPat pprGuardedpprBodypprLit bytesToString pprStringpprPatppr_decppr_deriv_strategy ppr_overlapppr_data ppr_newtype ppr_typedefppr_deriv_clause ppr_tySyn ppr_tf_head ppr_bndrscommaSepApplied pprForall pprForallVis pprForall' pprRecFields pprGadtRHSpprVarBangType pprBangTypepprVarStrictType pprStrictType pprInfixTpprParendTypeArgisStarTpprTyApp fromTANormal pprFunArgTypepprCxt ppr_cxt_preds where_clause showtextl hashParens quoteParenssepWithcommaSep commaSepWithsemiSep semiSepWithunboxedSumBarsbar$fPprLoc $fPprRange $fPprRole $fPprTyLit $fPprType$fPprDecidedStrictness$fPprSourceStrictness$fPprSourceUnpackedness $fPprBang$fPprPatSynArgs$fPprPatSynDir$fPprCon $fPprClause $fPprRuleBndr $fPprPhases$fPprRuleMatch $fPprInline $fPprPragma $fPprForeign$fPprInjectivityAnn$fPprFamilyResultSig $fPprFunDep$fPprDec$fPprPat$fPprLit $fPprMatch $fPprStmt$fPprExp$fPprModuleInfo $fPprModule $fPprInfo $fPprName$fPpr[] $fPprTypeArg$fPprTyVarBndr$fPprFlagSpecificity $fPprFlag()$fShowForallVisFlag TyVarBndrSpec TyVarBndrUnitDerivStrategyQFamilyResultSigQ PatSynArgsQ PatSynDirQ TySynEqnQ RuleBndrQ FieldExpQVarStrictTypeQ StrictTypeQ VarBangTypeQ BangTypeQBangQSourceUnpackednessQSourceStrictnessQRangeQStmtQGuardQBodyQClauseQMatchQ DerivClauseQPredQCxtQTyLitQKindQTypeQConQDecsDecsQDecQExpQ FieldPatQPatQInfoQCodeQTExpQintPrimL wordPrimL floatPrimL doublePrimLintegerLcharL charPrimLstringL stringPrimL bytesPrimL rationalLlitPvarPtupP unboxedTupP unboxedSumPconPinfixPuInfixPparensPtildePbangPasPwildPrecPlistPsigPviewPfieldPatbindSletSnoBindSparSrecSfromR fromThenRfromToR fromThenToRnormalBguardedBnormalGnormalGEpatGpatGEmatchclausevarEconElitEappEappTypeEparensEuInfixEinfixEinfixAppsectionLsectionRlamElam1ElamCaseEtupE unboxedTupE unboxedSumEcondEmultiIfEletEcaseEdoEmdoEcompE arithSeqElistEsigErecConErecUpdEstringEfieldExpstaticE unboundVarElabelEimplicitParamVarE getFieldE projectionEfromE fromThenEfromToE fromThenToEvalDfunDtySynDdataDnewtypeDclassD instanceDinstanceWithOverlapDsigDkiSigDforImpDinfixLDinfixRDinfixNDdefaultDpragInlD pragOpaqueD pragSpecD pragSpecInlD pragSpecInstD pragRuleDpragAnnD pragLineD pragCompleteD dataInstD newtypeInstD tySynInstD dataFamilyDopenTypeFamilyDclosedTypeFamilyD roleAnnotDstandaloneDerivDstandaloneDerivWithStrategyD defaultSigDpatSynD patSynSigDimplicitParamBindDtySynEqncxt derivClause stockStrategyanyclassStrategynewtypeStrategy viaStrategynormalCrecCinfixCforallCgadtCrecGadtCforallT forallVisTvarTconTinfixTuInfixTpromotedInfixTpromotedUInfixTparensTappTappKindTarrowT mulArrowTlistTlitTtupleT unboxedTupleT unboxedSumTsigT equalityT wildCardTimplicitParamTclassPequalP promotedTpromotedTupleT promotedNilT promotedConsTnoSourceUnpackednesssourceNoUnpack sourceUnpacknoSourceStrictness sourceLazy sourceStrict notStrictunpackedbangbangType varBangType strictType varStrictTypenumTyLitstrTyLit charTyLitplainTV plainInvisTVkindedTV kindedInvisTV specifiedSpec inferredSpecvarKconKtupleKarrowKlistKappKstarK constraintKnoSigkindSigtyVarSiginjectivityAnnnominalRrepresentationalRphantomRinferRcCallstdCallcApiprim javaScriptunsafesafefunDepruleVar typedRuleVarvalueAnnotationtypeAnnotationmoduleAnnotationunidir implBidir explBidir prefixPatSyn recordPatSyn infixPatSynappsE withDecDoc withDecsDocfunD_doc dataD_doc newtypeD_doc dataInstD_docnewtypeInstD_doc patSynD_docdocConsmkBytes HsDoFlavourDoExprMDoExpr GhciStmtCtxtListComp MonadCompHsArrowMatchContextProcExpr ArrowCaseAlt KappaExpr HsStmtContextHsDoStmtPatGuard ParStmtCtxt TransStmtCtxt ArrowExprHsMatchContextFunRhs LambdaExprCaseAltIfAltArrowMatchCtxt PatBindRhs PatBindGuardsRecUpdStmtCtxt ThPatSplice ThPatQuotemc_fun mc_fixity mc_strictness ArithSeqInfoFromFromThenFromTo FromThenToHsQuoteExpBrPatBrDecBrLDecBrGTypBrVarBrXQuoteUntypedSpliceFlavourUntypedExpSpliceUntypedPatSpliceUntypedTypeSpliceUntypedDeclSpliceHsSplicedThing HsSplicedExpr HsSplicedTy HsSplicedPatThModFinalizersSpliceDecoration DollarSplice BareSplice HsTypedSpliceHsUntypedSplice HsQuasiQuote HsSplicedXSpliceApplicativeArgApplicativeArgOneApplicativeArgManyXApplicativeArgxarg_app_arg_oneapp_arg_patternarg_expr is_body_stmtxarg_app_arg_many app_stmts final_expr bv_pattern stmt_context FailOperator ParStmtBlock TransFormThenForm GroupFormStmtLRLastStmtBindStmtApplicativeStmtBodyStmtLetStmtParStmt TransStmtRecStmtXStmtLRtrS_exttrS_form trS_stmts trS_bndrs trS_usingtrS_bytrS_rettrS_bindtrS_fmaprecS_ext recS_stmtsrecS_later_ids recS_rec_ids recS_bind_fn recS_ret_fn recS_mfix_fnGhciStmt GhciLStmt GuardStmt GuardLStmtExprStmt ExprLStmtCmdStmtCmdLStmtLStmtLRLStmtGRHSXGRHSLGRHSXGRHSsgrhssExt grhssGRHSsgrhssLocalBindsXMatchm_extm_ctxtm_patsm_grhssLMatch MatchGroupTc mg_arg_tys mg_res_tyMG XMatchGroupmg_extmg_alts mg_origin HsRecordBindsHsCmdTop LHsCmdTop HsArrAppTypeHsHigherOrderAppHsFirstOrderAppHsCmd HsCmdArrApp HsCmdArrFormHsCmdAppHsCmdLamHsCmdPar HsCmdCase HsCmdLamCaseHsCmdIfHsCmdLetHsCmdDoXCmdLHsCmdHsTupArgPresentMissingXTupArg LHsTupArgHsPragE HsPragSCCXHsPragE DotFieldOcc XDotFieldOccdfoExtdfoLabelHsVar HsUnboundVarHsRecSel HsOverLabelHsIPVarHsLam HsLamCaseHsApp HsAppTypeOpAppNegAppHsParSectionLSectionR ExplicitTuple ExplicitSumHsCaseHsIf HsMultiIfHsLetHsDo ExplicitList RecordCon RecordUpd HsGetField HsProjection ExprWithTySigArithSeqHsTypedBracketHsUntypedBracket HsSpliceEHsProcHsStaticXExprrcon_extrcon_con rcon_fldsrupd_ext rupd_expr rupd_fldsgf_extgf_exprgf_fieldproj_ext proj_fldsCmdSyntaxTable LHsRecUpdProj RecUpdProj LHsRecProjRecProjFieldLabelStringsLFieldLabelStringspprFieldLabelStringspprExternalSrcLoc pprHsArrType isInfixMatch isTypedSplice isPatSynCtxtqualifiedDoModuleName_maybeisComprehensionContextisDoComprehensionContextisMonadStmtContextisMonadDoStmtContextisMonadCompContextisMonadDoCompContextmatchSeparatorpprMatchContextpprMatchContextNounpprArrowMatchContextNounpprAStmtContextpprStmtContextpprAHsDoFlavourpprHsDoFlavourprependQualified$fOutputableDotFieldOcc!$fOutputableBndrFieldLabelStrings$fOutputableFieldLabelStrings$fOutputableSpliceDecoration$fDataThModFinalizers$fDataUntypedSpliceFlavour$fDataSpliceDecoration$fEqSpliceDecoration$fShowSpliceDecoration$fDataTransForm$fDataMatchGroupTc$fDataHsArrAppType pprFunBind pprPatBind pprSpliceDecl pprSplicepprExprpprLExprOutputableBndrFlag EpAnnForallTy getBangTypegetBangStrictnessfromMaybeContextmkHsForAllVisTelemkHsForAllInvisTelemkHsQTvs emptyLHsQTvs hsSigWcType dropWildCardshsOuterTyVarNameshsOuterExplicitBndrsmkHsOuterImplicitmkHsOuterExplicitmkHsImplicitSigTypemkHsExplicitSigTypemkHsWildCardBndrsmkHsPatSigTypemkEmptyWildCardBndrshsTyVarBndrFlagsetHsTyVarBndrFlaghsTvbAllKindedhsLinearhsUnrestrictedisUnrestricted arrowToHsType pprHsArrow hsWcScopedTvs hsScopedTvs hsTyVarName hsLTyVarName hsLTyVarNameshsExplicitLTyVarNameshsAllLTyVarNameshsLTyVarLocNamehsLTyVarLocNames hsTyKindSig ignoreParensmkAnonWildCardTymkHsOpTy mkHsAppTy mkHsAppTys mkHsAppKindTysplitHsFunTypehsTyGetAppHead_maybelhsTypeArgSrcSpansplitLHsPatSynTysplitLHsSigmaTyInvissplitLHsGadtTysplitLHsForAllTyInvissplitLHsForAllTyInvis_KPsplitLHsQualTysplitLHsInstDeclTygetLHsInstDeclHeadgetLHsInstDeclClass_maybe mkFieldOccmkAmbiguousFieldOccrdrNameAmbiguousFieldOccselectorAmbiguousFieldOccunambiguousFieldOccambiguousFieldOccpprAnonWildCardpprHsOuterFamEqnTyVarBndrspprHsOuterSigTyVarBndrs pprHsForAll pprLHsContextpprConDeclFields pprHsTypehsTypeNeedsParensparenthesizeHsTypeparenthesizeHsContext$fOutputableHsPatSigType$fOutputableHsWildCardBndrs$fOutputableHsForAllTelescope$fOutputableLHsQTyVars$fOutputableHsType$fOutputableHsSigType!$fOutputableBndrAmbiguousFieldOcc$fOutputableAmbiguousFieldOcc$fOutputableConDeclField$fOutputableHsArrow$fNamedThingHsTyVarBndr$fOutputableHsTyVarBndr$fOutputableHsOuterTyVarBndrs $fOutputableBndrFlagSpecificityp$fOutputableBndrFlag()p OverLitTc$sel:ol_rebindable:OverLitTc$sel:ol_witness:OverLitTc$sel:ol_type:OverLitTc OverLitRn$sel:ol_rebindable:OverLitRn$sel:ol_from_fun:OverLitRn pprXOverLit overLitType convertLit pp_st_suffix pmPprHsLit$fOutputableHsOverLit$fOutputableHsLit TcSpecPragSpecPrag LTcSpecPrag TcSpecPragsIsDefaultMethod SpecPragsAnnSigasDcolonasRestABExportABEabe_polyabe_monoabe_wrap abe_pragsAbsBindsabs_tvs abs_ev_vars abs_exports abs_ev_binds abs_bindsabs_sig NHsValBindsLR NValBinds pprLHsBindspprLHsBindsForUser pprDeclListemptyLocalBindseqEmptyLocalBindsisEmptyValBindsemptyValBindsInemptyValBindsOut emptyLHsBindsisEmptyLHsBindsplusHsValBinds ppr_monobindpprTicksisEmptyIPBindsPRisEmptyIPBindsTc noSpecPrags hasSpecPragsisDefaultMethod pragBracketspragSrcBrackets pprVarSigpprSpecpprTcSpecPrags pprMinimalSig$fOutputableFixitySig$fOutputableSig$fOutputableIPBind$fOutputableHsIPBinds$fOutputablePatSynBind$fOutputableHsBindLR$fOutputableHsLocalBindsLR$fOutputableHsValBindsLR$fOutputableTcSpecPrag$fOutputableABExport$fDataTcSpecPrags$fDataTcSpecPrag $fDataAnnSigConPatTc cpt_arg_tyscpt_tvs cpt_dicts cpt_bindscpt_wrapHsPatExpansion HsPatExpanded XXPatGhcTcCoPat ExpansionPat co_cpt_wrap co_pat_inner co_pat_ty EpAnnSumPat sumPatParenssumPatVbarsBeforesumPatVbarsAfter hsRecFieldIdhsRecUpdFieldRdrhsRecUpdFieldIdhsRecUpdFieldOcc pprParendLPat pprConArgsmkPrefixConPatmkNilPat mkCharLitPat isBangedLPatlooksLazyPatBindisIrrefutableHsPat isSimplePatpatNeedsParensgParPatparenthesizePatcollectEvVarsPatscollectEvVarsPat$fOutputablePat$fOutputableHsPatExpansion$fDataHsPatExpansion$fDataEpAnnSumPatDataConBuilderPrefixDataConBuilderInfixDataConBuilder PatBuilder PatBuilderPat PatBuilderPar PatBuilderAppPatBuilderAppTypePatBuilderOpApp PatBuilderVarPatBuilderOverLit SumOrTupleSumTuple pprSumOrTuple$fOutputablePatBuilder$fOutputableDataConBuilder HsRuleAnn ra_tyanns ra_tmannsra_restXViaStrategyPspartitionBindsAndSigs emptyRdrGroup emptyRnGrouphsGroupTopLevelFixitySigs appendGroupstyFamInstDeclNametyFamInstDeclLName tyClDeclLNametcdName hsDeclHasCuskpprTyClDeclFlavourfamilyDeclLNamefamilyDeclNamefamResultKindSignatureresultVariableNamestandaloneKindSigName getConNamesgetRecConArgs_maybehsConDeclThetapprTyFamInstDeclpprDataFamInstFlavourpprHsFamInstLHSinstDeclDataFamInstsfoldDerivStrategymapDerivStrategyflattenRuleDeclsroleAnnotDeclName$fOutputableRoleAnnotDecl$fOutputableAnnDecl$fOutputableWarnDecl$fOutputableWarnDecls$fOutputableRuleBndr$fOutputableRuleDecl$fOutputableRuleDecls$fOutputableForeignDecl$fOutputableDefaultDecl$fOutputableDerivStrategy$fOutputableDerivDecl$fOutputableInstDecl$fOutputableClsInstDecl$fOutputableDataFamInstDecl$fOutputableTyFamInstDecl$fOutputableConDecl$fOutputableStandaloneKindSig$fOutputableHsDataDefn$fOutputableDerivClauseTys$fOutputableHsDerivingClause$fOutputableFamilyDecl$fOutputableFunDep$fOutputableTyClGroup$fOutputableTyClDecl$fOutputableSpliceDecl$fOutputableHsGroup$fOutputableHsDecl$fOutputableXViaStrategyPs$fDataHsRuleAnn $fEqHsRuleAnnPendingTcSplicePendingRnSpliceSplicePointName DelayedSplice HsSplicedT XBindStmtTc xbstc_bindOpxbstc_boundResultTypexbstc_boundResultMult xbstc_failOp XBindStmtRn xbsrn_bindOp xbsrn_failOp RecStmtTc recS_bind_tyrecS_later_rets recS_rec_rets recS_ret_tyGrhsAnnga_vbarga_sepCmdTopTc HsExpansion HsExpanded XXExprGhcTcWrapExpr ExpansionExpr ConLikeTcHsTick HsBinTickAnnsIfaiIfaiThenaiElse aiThenSemi aiElseSemi AnnProjectionapOpenapClose AnnFieldLabelafDotAnnExplicitSumaesOpen aesBarsBefore aesBarsAfteraesCloseEpAnnUnboundVarhsUnboundBackquotes hsUnboundHole EpAnnHsCase hsCaseAnnCase hsCaseAnnOfhsCaseAnnsRest HsBracketTcbrack_renamed_quotebrack_tybrack_quote_wrapperbrack_pending_splicesHsWrap RecordUpdTc rupd_cons rupd_in_tys rupd_out_tys rupd_wrap SyntaxExprTcNoSyntaxExprTcsyn_expr syn_arg_wraps syn_res_wrap SyntaxExprRnNoSyntaxExprRn SyntaxExprGhc PostTcTable PostTcExprnoExpr noSyntaxExpr mkSyntaxExprmkRnSyntaxExpr tupArgPresent isQuietHsExprpprBinds ppr_lexprppr_exprppr_infix_exprppr_infix_expr_rnppr_infix_expr_tcppr_appspprDebugParendExprpprParendLExprhsExprNeedsParensgHsParparenthesizeHsExprstripParensLHsExprstripParensHsExprisAtomicHsExprpprLCmdpprCmd isQuietHsCmdppr_lcmdppr_cmd pprCmdArgisEmptyMatchGroupisSingletonMatchGroupmatchGroupArity hsLMatchPats pprMatchespprMatchpprGRHSspprGRHSpp_rhspprStmt pprBindStmtpprArgpprTransformStmt pprTransStmtpprBypprDo pprArrowExprppr_module_name_prefix ppr_do_stmtspprComppprQualspprPendingSpliceppr_splice_decl ppr_quasi ppr_splice thBrackets thTyBracketsppr_with_pending_tc_splices pp_dotdotmatchContextErrStringmatchArrowContextErrStringmatchDoContextErrStringpprMatchInCtxt pprStmtInCtxt$fWrapXRecGhcPassa$fOutputableHsStmtContext$fOutputableHsArrowMatchContext$fOutputableHsMatchContext$fOutputableArithSeqInfo$fOutputableHsQuote$fOutputableHsSplice$fOutputableHsSplicedThing$fOutputableApplicativeArg$fOutputableStmtLR$fOutputableParStmtBlock$fOutputableMatch$fOutputableHsCmdTop$fOutputableHsCmd$fOutputableHsPragE$fOutputableHsExpr$fOutputableSyntaxExprRn$fOutputableSyntaxExprTc$fOutputableHsExpansion$fOutputableXXExprGhcTc$fOutputableGrhsAnn$fDataDelayedSplice$fOutputablePendingRnSplice$fOutputablePendingTcSplice$fDataHsSplicedT $fDataGrhsAnn$fDataHsExpansion $fDataAnnsIf$fDataAnnProjection$fDataAnnFieldLabel$fDataAnnExplicitSum$fDataEpAnnUnboundVar$fDataEpAnnHsCase $fDataHsWrap perhapsAsPat$fOutputableGhcHint CollectPass collectXXPatcollectXXHsBindsLR CollectFlagCollNoDictBindersCollWithDictBindersmkHsPar mkSimpleMatchunguardedGRHSs unguardedRHS mkMatchGroup mkLocatedListmkHsApp mkHsAppWithmkHsApps mkHsAppsWith mkHsAppType mkHsAppTypesmkHsLammkHsLams mkHsCaseAlt nlHsTyApp nlHsTyAppsmkLHsParmkParPatnlParPat mkHsIntegralmkHsFractional mkHsIsStringmkHsDo mkHsDoAnnsmkHsComp mkHsCompAnnsmkHsIf mkHsCmdIfmkNPat mkNPlusKPatemptyTransStmtmkTransformStmtmkTransformByStmtmkGroupUsingStmtmkGroupByUsingStmt mkLastStmt mkBodyStmt mkPsBindStmt mkRnBindStmt mkTcBindStmt unitRecStmtTc emptyRecStmtemptyRecStmtNameemptyRecStmtId mkRecStmt mkLetStmt mkHsOpAppmkUntypedSplice mkTypedSplicemkHsQuasiQuote mkHsStringmkHsStringPrimLitmkHsCharPrimLit mkConLikeTcnlHsVarnl_HsVar nlHsDataConnlHsLit nlHsIntLitnlVarPatnlLitPatnlHsAppnlHsSyntaxAppsnlHsApps nlHsVarApps nlConVarPatnlConVarPatName nlInfixConPatnlConPat nlConPatNamenlNullaryConPat nlWildConPat nlWildPat nlWildPatNamenlHsDo nlHsOpAppnlHsLamnlHsParnlHsIfnlHsCasenlList nlHsAppTy nlHsTyVar nlHsFunTy nlHsParTy nlHsTyConApp nlHsAppKindTymkLHsTupleExpr mkLHsVarTuple nlTuplePat missingTupArgmkBigLHsVarTup mkBigLHsTupmkBigLHsVarPatTupmkBigLHsPatTup mkChunkifiedchunkifyhsTypeToHsSigTypehsTypeToHsSigWcType mkHsSigEnv mkClassOpSigs mkLHsWrapmkHsWrap mkHsWrapCo mkHsWrapCoR mkLHsWrapCo mkHsCmdWrap mkLHsCmdWrap mkHsWrapPat mkHsWrapPatCo mkHsDictLet mkFunBind mkTopFunBind mkHsVarBind mkVarBind mkPatSynBindisInfixFunBindspanHsLocaLBindsmkSimpleGeneratedFunBindmkPrefixFunRhsmkMatchisUnliftedHsBindisBangedHsBindcollectLocalBinderscollectHsIdBinderscollectHsValBinderscollectHsBindBinderscollectHsBindsBinderscollectHsBindListBinderscollectMethodBinderscollectLStmtsBinderscollectStmtsBinderscollectLStmtBinderscollectStmtBinderscollectPatBinderscollectPatsBindershsGroupBindershsTyClForeignBindershsLTyClDeclBindershsForeignDeclsBindershsPatSynSelectorsgetPatSynBindshsDataFamInstBinderslStmtsImplicitshsValBindsImplicits lPatImplicits$fCollectPassGhcPass FloatBindFloatLet FloatCase MkStringIdsunpackCStringIdunpackCStringUtf8Id sortQuantVars mkCoreAppmkWildEvBindermkWildValBinder mkWildCase mkIfThenElsecastBottomExpr mkLitRubbishmkUncheckedIntExpr mkIntExprInt mkIntegerExpr mkNaturalExprmkStringExprFSgetMkStringIdsmkStringExprFSWithmkCoreVarTupTy mkCoreTup mkCoreUbxTupmkCoreTupBoxity mkCoreUbxSummkBigCoreVarTupmkBigCoreVarTup1mkBigCoreVarTupTy mkBigCoreTupmkBigCoreTupTyunitExprmkTupleSelectormkTupleSelector1mkSmallTupleSelector mkTupleCasemkSmallTupleCase wrapFloat wrapFloats floatBindings mkNilExpr mkConsExpr mkListExprmkNonEmptyListExpr mkFoldrExpr mkBuildExpr mkNothingExpr mkJustExprmkRuntimeErrorAppmkImpossibleExprerrorIdsrEC_SEL_ERROR_IDrUNTIME_ERROR_IDrEC_CON_ERROR_ID pAT_ERROR_IDnO_METHOD_BINDING_ERROR_IDnON_EXHAUSTIVE_GUARDS_ERROR_ID tYPE_ERROR_IDaBSENT_SUM_FIELD_ERROR_IDaBSENT_ERROR_IDmkAbsentErrorApp$fOutputableFloatBind so_co_optsdefaultSimpleOptssimpleOptExprWith simpleOptPgmjoinPointBinding_maybejoinPointBindings_maybeexprIsConApp_maybeexprIsLiteral_maybeexprIsLambda_maybe$fOutputableSimpleOptEnvBangOptsbang_opt_strict_databang_opt_unbox_disablebang_opt_unbox_strictbang_opt_unbox_smallDataConBangOpts FixedBangOpts SrcBangOptsDCB wiredInIds ghcPrimIds mkDictSelRhsvanillaDataConBoxer mkDataConRepunwrapNewTypeBodywrapFamInstBody mkFCallId mkDictFunId mkDictFunTy coerceNameleftSectionNamerightSectionNamenoinlineIdName proxyHashId nullAddrIdseqIdlazyId noinlineIdcoerceIdrealWorldPrimId voidPrimId voidArgIdcoercionTokenId toIfaceTvBndrtoIfaceTvBndrs toIfaceIdBndr toIfaceBndrtoIfaceTyCoVarBinders toIfaceKind toIfaceType toIfaceTyVartoIfaceTyCon_nametoIfaceCoerciontidyToIfaceTypetidyToIfaceContextpatSynToIfaceDecl toIfaceBangtoIfaceSrcBangtoIfaceLetBndrtoIfaceIdDetails toIfaceIdInfo toIfUnfolding toIfaceExprtoIfaceTickish toIfaceBind toIfaceAlt toIfaceCon toIfaceApp toIfaceVar toIfaceLFInfomkRule roughTopNamespprRulesForUserextendRuleInfo addRuleInfoaddIdSpecialisations rulesOfBindsgetRules emptyRuleBase mkRuleBaseextendRuleBaseList extendRuleEnv pprRuleBase lookupRule initRuleOptsruleCheckProgram builtinRules caseRules$fMonadPlusRuleM$fAlternativeRuleM$fMonadFailRuleM $fMonadRuleM$fApplicativeRuleM$fFunctorRuleM$fDataXViaStrategyPs$fDataXXPatGhcTc$fDataXXExprGhcTc$fEqIE$fEqIE0$fEqIE1$fDataIE $fDataIE0 $fDataIE1$fDataImportDecl$fDataImportDecl0$fDataImportDecl1$fDataAmbiguousFieldOcc$fDataAmbiguousFieldOcc0$fDataAmbiguousFieldOcc1$fDataFieldOcc$fDataFieldOcc0$fDataFieldOcc1$fDataConDeclField$fDataConDeclField0$fDataConDeclField1 $fDataHsArg$fDataHsScaled$fDataHsScaled0$fDataHsScaled1 $fDataHsArrow$fDataHsArrow0$fDataHsArrow1$fDataHsLinearArrowTokens$fDataHsLinearArrowTokens0$fDataHsLinearArrowTokens1 $fDataHsType $fDataHsType0 $fDataHsType1$fDataHsTyVarBndr$fDataHsTyVarBndr0$fDataHsTyVarBndr1$fDataHsForAllTelescope$fDataHsForAllTelescope0$fDataHsForAllTelescope1$fDataHsPatSigType$fDataHsPatSigType0$fDataHsPatSigType1$fDataHsWildCardBndrs$fDataHsWildCardBndrs0$fDataHsWildCardBndrs1$fDataHsSigType$fDataHsSigType0$fDataHsSigType1$fDataHsOuterTyVarBndrs$fDataHsOuterTyVarBndrs0$fDataHsOuterTyVarBndrs1$fDataLHsQTyVars$fDataLHsQTyVars0$fDataLHsQTyVars1$fDataHsRecFields$fDataHsRecFields0$fDataHsRecFields1$fDataHsFieldBind$fDataConPatTc $fDataPat0 $fDataPat1$fDataOverLitTc$fDataOverLitRn$fDataHsOverLit$fDataHsOverLit0$fDataHsOverLit1 $fDataHsLit $fDataHsLit0 $fDataHsLit1$fDataXBindStmtTc$fDataXBindStmtRn$fDataSyntaxExprTc$fDataSyntaxExprRn$fDataPendingTcSplice$fDataPendingRnSplice$fDataCmdTopTc$fDataRecordUpdTc$fDataArithSeqInfo$fDataArithSeqInfo0$fDataArithSeqInfo1$fDataHsBracketTc $fDataHsQuote$fDataHsQuote0$fDataHsQuote1$fDataHsSplicedThing$fDataHsSplicedThing0$fDataHsSplicedThing1$fDataHsSplice$fDataHsSplice0$fDataHsSplice1$fDataHsMatchContext$fDataHsMatchContext0$fDataHsMatchContext1$fDataHsDoFlavour$fDataHsArrowMatchContext$fDataHsStmtContext$fDataHsStmtContext0$fDataHsStmtContext1$fDataApplicativeArg$fDataApplicativeArg0$fDataApplicativeArg1$fDataParStmtBlock$fDataParStmtBlock0$fDataParStmtBlock1$fDataParStmtBlock2$fDataRecStmtTc $fDataStmtLR $fDataStmtLR0 $fDataStmtLR1 $fDataStmtLR2 $fDataStmtLR3 $fDataStmtLR4 $fDataStmtLR5 $fDataStmtLR6 $fDataGRHS $fDataGRHS0 $fDataGRHS1 $fDataGRHS2 $fDataGRHS3 $fDataGRHS4 $fDataGRHSs $fDataGRHSs0 $fDataGRHSs1 $fDataGRHSs2 $fDataGRHSs3 $fDataGRHSs4 $fDataMatch0 $fDataMatch1 $fDataMatch2 $fDataMatch3 $fDataMatch4$fDataMatchGroup$fDataMatchGroup0$fDataMatchGroup1$fDataMatchGroup2$fDataMatchGroup3$fDataMatchGroup4$fDataHsCmdTop$fDataHsCmdTop0$fDataHsCmdTop1 $fDataHsCmd $fDataHsCmd0 $fDataHsCmd1$fDataHsTupArg$fDataHsTupArg0$fDataHsTupArg1 $fDataHsExpr $fDataHsExpr0 $fDataHsExpr1 $fDataHsPragE$fDataHsPragE0$fDataHsPragE1$fDataDotFieldOcc$fDataDotFieldOcc0$fDataDotFieldOcc1$fDataFieldLabelStrings$fDataFieldLabelStrings0$fDataFieldLabelStrings1$fDataRoleAnnotDecl$fDataRoleAnnotDecl0$fDataRoleAnnotDecl1 $fDataAnnDecl$fDataAnnDecl0$fDataAnnDecl1$fDataAnnProvenance$fDataAnnProvenance0$fDataAnnProvenance1$fDataWarnDecl$fDataWarnDecl0$fDataWarnDecl1$fDataWarnDecls$fDataWarnDecls0$fDataWarnDecls1$fDataRuleBndr0$fDataRuleBndr1$fDataRuleDecl$fDataRuleDecl0$fDataRuleDecl1$fDataRuleDecls$fDataRuleDecls0$fDataRuleDecls1$fDataForeignDecl$fDataForeignDecl0$fDataForeignDecl1$fDataDefaultDecl$fDataDefaultDecl0$fDataDefaultDecl1$fDataDerivStrategy0$fDataDerivStrategy1$fDataDerivDecl$fDataDerivDecl0$fDataDerivDecl1$fDataInstDecl$fDataInstDecl0$fDataInstDecl1$fDataClsInstDecl$fDataClsInstDecl0$fDataClsInstDecl1 $fDataFamEqn $fDataFamEqn0 $fDataFamEqn1$fDataDataFamInstDecl$fDataDataFamInstDecl0$fDataDataFamInstDecl1$fDataTyFamInstDecl$fDataTyFamInstDecl0$fDataTyFamInstDecl1$fDataHsConDeclGADTDetails$fDataHsConDeclGADTDetails0$fDataHsConDeclGADTDetails1 $fDataConDecl$fDataConDecl0$fDataConDecl1$fDataDerivClauseTys$fDataDerivClauseTys0$fDataDerivClauseTys1$fDataHsDerivingClause$fDataHsDerivingClause0$fDataHsDerivingClause1$fDataHsDataDefn$fDataHsDataDefn0$fDataHsDataDefn1$fDataFamilyInfo$fDataFamilyInfo0$fDataFamilyInfo1$fDataInjectivityAnn0$fDataInjectivityAnn1$fDataFamilyDecl$fDataFamilyDecl0$fDataFamilyDecl1$fDataFamilyResultSig0$fDataFamilyResultSig1$fDataTyClGroup$fDataTyClGroup0$fDataTyClGroup1 $fDataFunDep0 $fDataFunDep1$fDataTyClDecl$fDataTyClDecl0$fDataTyClDecl1$fDataSpliceDecl$fDataSpliceDecl0$fDataSpliceDecl1 $fDataHsGroup$fDataHsGroup0$fDataHsGroup1 $fDataHsDecl $fDataHsDecl0 $fDataHsDecl1$fDataHsPatSynDir$fDataHsPatSynDir0$fDataHsPatSynDir1$fDataStandaloneKindSig$fDataStandaloneKindSig0$fDataStandaloneKindSig1$fDataFixitySig$fDataFixitySig0$fDataFixitySig1 $fDataSig $fDataSig0 $fDataSig1 $fDataIPBind $fDataIPBind0 $fDataIPBind1$fDataHsIPBinds$fDataHsIPBinds0$fDataHsIPBinds1$fDataPatSynBind$fDataPatSynBind0$fDataPatSynBind1$fDataPatSynBind2$fDataRecordPatSynField$fDataRecordPatSynField0$fDataRecordPatSynField1$fDataABExport$fDataAbsBinds$fDataHsBindLR$fDataHsBindLR0$fDataHsBindLR1$fDataHsBindLR2$fDataNHsValBindsLR$fDataNHsValBindsLR0$fDataNHsValBindsLR1$fDataHsValBindsLR$fDataHsValBindsLR0$fDataHsValBindsLR1$fDataHsValBindsLR2$fDataHsLocalBindsLR$fDataHsLocalBindsLR0$fDataHsLocalBindsLR1$fDataHsLocalBindsLR2HsParsedModule hpm_module hpm_src_files AnnsModuleam_mainam_declsHsModulehsmodAnn hsmodLayout hsmodName hsmodExports hsmodImports hsmodDeclshsmodDeprecMessagehsmodHaddockModHeader$fOutputableHsModule$fDataAnnsModule$fEqAnnsModule$fDataHsModule ModSummaryms_mod ms_hsc_src ms_location ms_hs_hash ms_obj_datems_dyn_obj_date ms_iface_date ms_hie_date ms_srcimpsms_textual_impsms_ghc_prim_import ms_parsed_mod ms_hspp_file ms_hspp_opts ms_hspp_buf ms_unitidms_installed_mod ms_mod_namems_impsms_plugin_impsms_home_srcimps ms_home_imps msHsFilePath msHiFilePathmsDynHiFilePath msObjFilePathmsDynObjFilePath isBootSummaryms_mnwibmsDeps findTarget$fOutputableModSummary ModNodeKey SummaryNode ModuleGraphModNodeKeyWithUid mnkModuleName mnkUnitIdNodeKey NodeKey_UnitNodeKey_Module NodeKey_LinkModuleGraphNodeInstantiationNode ModuleNodeLinkNodemoduleGraphNodeModulemoduleGraphNodeModSummoduleGraphNodeUnitIdmapMG mgTransDepsmgModSummariesmgModSummaries'mgLookupModuleemptyMGisTemplateHaskellOrQQNonBootextendMG extendMGInst extendMG' mkModuleGraphfilterToposortToModules showModMsgsummaryNodeSummarynodeDependenciesmoduleGraphNodes mkNodeKeymsKey$fOutputableModNodeKeyWithUid$fOutputableNodeKey$fOutputableModuleGraphNode$fFunctorNodeMap$fTraversableNodeMap$fFoldableNodeMap $fEqNodeKey $fOrdNodeKey$fEqModNodeKeyWithUid$fOrdModNodeKeyWithUidWhetherHasFamInstWhetherHasOrphans IfaceExport ModIface_ModIface mi_module mi_sig_of mi_hsc_srcmi_deps mi_usages mi_exports mi_used_th mi_fixitiesmi_warnsmi_annsmi_decls mi_globalsmi_insts mi_fam_instsmi_rulesmi_hpcmi_trust mi_trust_pkgmi_complete_matchesmi_docs mi_final_exts mi_ext_fields mi_src_hashIfaceBackendExts IfaceDeclExtsModIfaceBackend mi_iface_hash mi_mod_hash mi_flag_hash mi_opt_hash mi_hpc_hashmi_plugin_hash mi_orphan mi_finsts mi_exp_hashmi_orphan_hash mi_warn_fn mi_fix_fn mi_hash_fnPartialModIfacemi_bootmi_mnwibmi_fixmi_semantic_module mi_free_holesrenameFreeHolesemptyPartialModIfaceemptyFullModIfacemkIfaceHashCacheemptyIfaceHashCache forceModIface$fNFDataModIfaceBackend$fNFDataModIface_$fBinaryModIface_HomePackageTable HomeModInfohm_iface hm_details hm_linkableemptyHomePackageTable lookupHptlookupHptDirectlyeltsHpt filterHptallHptanyHptmapHpt delFromHptaddToHptaddHomeModInfoToHpt addListToHpt listToHpt listHMIToHptlookupHptByModulepprHPTEpsStats n_ifaces_in n_decls_in n_decls_out n_rules_in n_rules_out n_insts_in n_insts_outExternalPackageStateEPS eps_is_booteps_PITeps_free_holeseps_PTE eps_inst_enveps_fam_inst_env eps_rule_base eps_ann_enveps_complete_matcheseps_mod_fam_inst_env eps_statsExternalUnitCacheeuc_epsPackageIfaceTablePackageCompleteMatchesPackageFamInstEnvPackageInstEnvPackageRuleBasePackageTypeEnvemptyPackageIfaceTableinitExternalUnitCacheinitExternalPackageState addEpsInStats UnitEnvGraph unitEnv_graph HomeUnitGraph HomeUnitEnvhomeUnitEnv_unitshomeUnitEnv_unit_dbshomeUnitEnv_dflagshomeUnitEnv_hpthomeUnitEnv_home_unitUnitEnvue_epsue_current_unitue_home_unit_graph ue_platform ue_namever initUnitEnvunsafeGetHomeUnit updateHpt updateHugue_transitiveHomeDepspreloadUnitsInfo'preloadUnitsInfo mkHomeUnitEnvisUnitEnvInstalledModulelookupHugByModulehugEltsaddHomeModInfoToHug lookupHugunitEnv_insertunitEnv_deleteunitEnv_adjustunitEnv_mapWithKey unitEnv_newunitEnv_singleton unitEnv_mapunitEnv_memberunitEnv_lookup_maybeunitEnv_lookup unitEnv_keys unitEnv_elts unitEnv_hptsunitEnv_foldWithKeyue_units ue_setUnits ue_unit_dbs ue_setUnitDbsue_hpt ue_setFlagsue_setUnitFlags ue_unitFlags ue_homeUnitue_unsafeHomeUnitue_unitHomeUnitue_currentHomeUnitEnvue_setActiveUnitue_currentUnitue_findHomeUnitEnvue_updateHomeUnitEnvue_renameUnitIdassertUnitEnvInvariant$fOutputableHomeUnitEnv$fOutputableUnitEnvGraph$fFunctorUnitEnvGraph$fFoldableUnitEnvGraph$fTraversableUnitEnvGraphmkPrintUnqualified mkQualModule mkQualPackagepkgQualCgGuts cg_module cg_tyconscg_bindscg_ccs cg_foreigncg_foreign_files cg_dep_pkgs cg_hpc_info cg_modBreakscg_spt_entriesModGuts mg_module mg_hsc_srcmg_loc mg_exportsmg_deps mg_usages mg_used_th mg_rdr_env mg_fix_envmg_tcsmg_insts mg_fam_insts mg_patsynsmg_rulesmg_binds mg_foreignmg_foreign_filesmg_warnsmg_annsmg_complete_matches mg_hpc_info mg_modBreaks mg_inst_envmg_fam_inst_envmg_boot_exportsmg_safe_haskell mg_trust_pkgmg_docsmg_mnwibHscBackendAction HscUpdate HscRecomp hscs_gutshscs_mod_locationhscs_partial_ifacehscs_old_iface_hashHscRecompStatus HscUpToDateHscRecompNeeded$fOutputableHscBackendActionMetaHook MetaResult MetaRequestMetaEMetaPMetaTMetaDMetaAW metaRequestE metaRequestP metaRequestT metaRequestD metaRequestAWExpectedFunTyOriginExpectedFunTySyntaxOpExpectedFunTyViewPatExpectedFunTyArgExpectedFunTyMatchesExpectedFunTyLamExpectedFunTyLamCaseFRRArrowOrigin ArrowCmdResTy ArrowCmdAppArrowCmdArrApp ArrowCmdLam ArrowCmdCaseArrowFun isCmdLamCase StmtOriginMonadComprehension DoNotation FRROriginFRRAppFRRRecordUpdate FRRBinderFRRCase FRRDataConArgFRRNoBindingResArg FRRTupleArgFRRTupleSection FRRUnboxedSum FRRBodyStmtFRRBodyStmtGuard FRRBindStmtFRRBindStmtGuardFRRArrowFRRExpectedFunTyCtOrigin GivenOrigin InstSCOrigin OtherSCOrigin OccurrenceOfOccurrenceOfRecSel AppOriginSpecPragOrigin TypeEqOrigin KindEqOrigin IPOccOriginOverLabelOrigin LiteralOrigin NegateOriginArithSeqOriginAssocFamPatOrigin SectionOriginHasFieldOrigin TupleOrigin ExprSigOrigin PatSigOrigin PatOriginProvCtxtOriginRecordUpdOrigin ViewPatOriginScOriginDerivClauseOrigin DerivOriginDCDerivOriginCoerceStandAloneDerivOrigin DefaultOriginDoOrigin DoPatOrigin MCompOriginMCompPatOrigin ProcOriginArrowCmdOrigin AnnOrigin FunDepOrigin1 FunDepOrigin2 InjTFOrigin1ExprHoleOriginTypeHoleOriginPatCheckOrigin ListOriginIfThenElseOrigin BracketOrigin StaticOriginShouldn'tHappenOrigin GhcBug20076InstProvidedOriginNonLinearPatternOriginUsageEnvironmentOfCycleBreakerOriginFixedRuntimeRepOriginWantedSuperclassOriginInstanceSigOriginAmbiguityCheckOrigin uo_actual uo_expecteduo_thing uo_visible TyVarBndrsHsTyVarBndrsRn TypedThing HsTypeRnThing TypeThing HsExprRnThing NameThingSigSkol SigTypeSkol ForAllSkol DerivSkolInstSkol FamInstSkolPatSkolIPSkolRuleSkol InferSkol BracketSkolUnifyForAllSkol TyConSkol DataConSkol ReifySkol QuantCtxtSkolRuntimeUnkSkolArrowReboundIfSkolUnkSkolReportRedundantConstraintsNoRRCWantRRC UserTypeCtxt FunSigCtxt InfSigCtxt ExprSigCtxt KindSigCtxtStandaloneKindSigCtxt TypeAppCtxt ConArgCtxt TySynCtxt PatSynCtxt PatSigCtxt RuleSigCtxt ForSigCtxtDefaultDeclCtxt InstDeclCtxt SpecInstCtxt GenSigCtxtGhciCtxt ClassSCCtxt SigmaCtxt DataTyCtxtDerivClauseCtxtTyVarBndrKindCtxt DataKindCtxt TySynKindCtxtTyFamResKindCtxtreportRedundantConstraintsredundantConstraintsSpanpprUserTypeCtxt isSigMaybe unkSkolAnon mkSkolemInfo getSkolemInfo pprSkolInfopprSigSkolInfoisVisibleOrigintoInvisibleOrigin isGivenOriginisWantedWantedFunDepOriginisWantedSuperclassOrigin lexprCtOrigin exprCtOriginmatchesCtOrigin grhssCtOrigin pprCtOriginisPushCallStackOrigincallStackOriginFS pprFRROriginpprFRRArrowOriginpprExpectedFunTyOriginpprExpectedFunTyHerald$fOutputableTypedThing$fOutputableTyVarBndrs$fOutputableSkolemInfoAnon$fOutputableSkolemInfo$fUniquableSkolemInfo$fOutputableStmtOrigin$fOutputableFRRArrowOrigin$fOutputableFRROrigin$fOutputableCtOrigin$fEqUserTypeCtxt$fEqReportRedundantConstraintsCtLoc ctl_originctl_env ctl_t_or_k ctl_depth SubGoalDepth CtFlavourRole CtFlavourGivenWanted RewriterSet CtEvidenceCtGivenCtWanted ctev_pred ctev_evarctev_loc ctev_destctev_rewritersTcEvDest EvVarDestHoleDestNoDest UserGiven HasGivenEqs NoGivenEqs LocalGivenEqs MaybeGivenEqs ImplicStatus IC_Solved IC_InsolubleIC_BadTelescope IC_Unsolvedics_dead ImplicationImplicic_tclvlic_infoic_skolsic_given ic_given_eqsic_warn_inaccessibleic_env ic_wantedic_binds ic_need_inner ic_need_outer ic_statusWantedConstraintsWC wc_simplewc_implwc_holesCheckTyEqProblemCheckTyEqResult CtIrredReasonIrredShapeReasonNonCanonicalReason ReprEqReasonShapeMismatchReasonAbstractTyConReasonHoleSortExprHoleTypeHoleConstraintHoleHole hole_sorthole_occhole_tyhole_locQCInstQCIqci_evqci_tvsqci_pred qci_pend_scCanEqLHSTyVarLHSTyFamLHSCtCDictCan CIrredCanCEqCan CNonCanonical CQuantCan CSpecialCancc_evcc_class cc_tyargs cc_pend_sc cc_fundeps cc_reasoncc_lhscc_rhs cc_eq_relcc_special_predCtsXiisInsolubleReasoncteOKcterHasNoProblemcteImpredicative cteTypeFamilycteInsolubleOccurscteSolubleOccurs cteProblemcterHasProblemcterHasOnlyProblemcterRemoveProblemcterHasOccursCheckcterClearOccursCheckcterSetOccursCheckSoluble cterFromKindmkNonCanonicalmkNonCanonicalCt mkIrredCtmkGivens ctEvidencectLocctOriginctPred ctRewritersctEvIdwantedEvId_maybemkTcEqPredLikeEv ctFlavourctEqRelcanEqLHS_maybe canEqLHSType canEqLHSKind eqCanEqLHS tyCoVarsOfCttyCoVarsOfCtEvtyCoVarsOfCtListtyCoVarsOfCtEvList tyCoVarsOfCtstyCoVarsOfCtsListtyCoVarsOfCtEvsList tyCoVarsOfWCtyCoVarsOfWCList isGivenLoc isWantedCt isGivenCtgetUserTypeErrorMsgisUserTypeErrorisPendingScDictisPendingScInstsuperClassesMightHelpgetPendingWantedScssingleCtandCts listToCtsctsEltsconsCtssnocCts extendCtsList andManyCtsemptyCts isEmptyCtspprCtsemptyWC mkSimpleWC mkImplicWC isEmptyWC isSolvedWCandWCunionsWC addSimples addImplics addInsolsaddHolesdropMisleadingisSolvedStatusisInsolubleStatusinsolubleImplic insolubleWCinsolubleWantedCt insolubleEqCt insolubleCtisOutOfScopeHoleimplicationPrototypegetUserGivensFromImplicscheckTelescopeSkolcheckImplicationInvariants pprEvVars pprEvVarThetapprEvVarWithTypewrapTypectEvPredctEvLoc ctEvOrigin ctEvEqRelctEvRolectEvTerm ctEvRewritersctEvExpr ctEvCoercionctEvEvId ctEvUniquetcEvDestUnique setCtEvLocarisesFromGivenssetCtEvPredTypeisWantedisGivenemptyRewriterSetisEmptyRewriterSetaddRewriterSetrewriterSetFromCorewriterSetFromTyperewriterSetFromTypes ctEvFlavourctEvFlavourRole ctFlavourRole eqCanRewriteeqCanRewriteFRinitialSubGoalDepthbumpSubGoalDepthmaxSubGoalDepthsubGoalDepthExceeded mkKindLoc toKindLoc mkGivenLocctLocEnv ctLocLevel ctLocDepth ctLocOrigin ctLocSpanctLocTypeOrKind_maybe setCtLocSpanbumpCtLocDepthsetCtLocOriginupdateCtLocOrigin setCtLocEnvpprCtLoc$fOutputableCanEqLHS$fOutputableHoleSort$fOutputableCheckTyEqResult$fMonoidCheckTyEqResult$fSemigroupCheckTyEqResult$fOutputableCtIrredReason$fOutputableImplicStatus$fMonoidHasGivenEqs$fSemigroupHasGivenEqs$fOutputableHasGivenEqs$fOutputableTcEvDest$fOutputableCtFlavour$fOutputableCtEvidence$fOutputableQCInst$fOutputableCt$fOutputableHole$fOutputableImplication$fOutputableWantedConstraints$fEqSubGoalDepth$fOrdSubGoalDepth$fOutputableSubGoalDepth $fEqCtFlavour$fOutputableRewriterSet$fSemigroupRewriterSet$fMonoidRewriterSet$fEqHasGivenEqs EqualCtListFunEqMapDictMapTcAppMapisEmptyTcAppMap emptyTcAppMap insertTcApp alterTcAppfilterTcAppMap tcAppMapToBag foldTcAppMap emptyDictMapfindDictfindDictsByClassdelDictaddDictaddDictsByClass filterDictspartitionDicts dictsToBag foldDicts emptyFunEqs findFunEqfindFunEqsByTyCon foldFunEqs insertFunEqaddToEqualCtListfilterEqualCtListInertEqs InertCansIC inert_eqs inert_funeqs inert_dicts inert_instsinert_safehask inert_irredsinert_given_eq_lvlinert_given_eqsIS inert_cansinert_cycle_breakersinert_famapp_cacheinert_solved_dictsCycleBreakerVarStackWorkListWLwl_eqswl_rest wl_implicsappendWorkList workListSizeextendWorkListEqextendWorkListNonEqextendWorkListImplicextendWorkListCtextendWorkListCtsisEmptyWorkList emptyWorkListselectWorkItem emptyInert foldTyEqsdelEqfindEqpartitionInertEqspartitionFunEqs addInertItemkickOutRewritableLHSmatchableGivensmightEqualLaterprohibitedSuperClassSolvepushCycleBreakerVarStackinsertCycleBreakerBindingforAllCycleBreakerBindings_$fOutputableWorkList$fOutputableInertCans$fOutputableInertSet PmAltConSetPmAltCon PmAltConLikePmAltLit PmEqualityEqualDisjointPossiblyOverlap PmLitValuePmLitIntPmLitRat PmLitChar PmLitString PmLitOverInt PmLitOverRatPmLitOverStringPmLit pm_lit_ty pm_lit_valResidualCompleteMatchesRCM rcm_vanilla rcm_pragmasBotInfoIsBotIsNotBotMaybeBot PmAltConAppPACApaca_conpaca_tvspaca_idsVarInfoVIvi_idvi_posvi_negvi_botvi_rcmTmStateTmStts_factsts_repsts_dirtyTyStateTyStty_st_n ty_st_inertNablasMkNablasNablaMkNabla nabla_ty_st nabla_tm_st initNablasgetRcmisRcmInitialised lookupVarInfolookupVarInfoNT trvVarInfo lookupRefutslookupSolution pmLitTypeemptyPmAltConSetisEmptyPmAltConSetelemPmAltConSetextendPmAltConSetpmAltConSetElems eqPmAltCon pmAltConTypeisPmAltConMatchStrictpmAltConImplBangsliteralToPmLit negatePmLit overloadPmLitpmLitAsStringLitcoreExprAsPmLit$fOutputableTyState$fOutputableBotInfo#$fOutputableResidualCompleteMatches$fOutputablePmLitValue$fOutputablePmLit$fOutputablePmEquality $fEqPmLit$fOutputablePmAltCon $fEqPmAltCon$fOutputablePmAltConApp$fOutputablePmAltConSet$fOutputableVarInfo$fOutputableTmState$fOutputableNabla$fMonoidNablas$fSemigroupNablas$fOutputableNablas$fEqPmEquality$fShowPmEquality $fEqBotInfoPostPre CheckResultcr_retcr_uncov cr_approxRedSetsrs_covrs_divrs_bangs Precision ApproximatePrecise PmPatBind PmEmptyCasepe_varPmGRHSpg_grdspg_rhsPmGRHSspgs_lcls pgs_grhssPmMatchpm_patspm_grhss PmMatchGroupGrdVecSrcInfoPmGrdPmConPmBangPmLetpm_id pm_con_con pm_con_tvs pm_con_dicts pm_con_args_pm_loc _pm_let_expr$fOutputableSrcInfo$fOutputablePmGrd$fOutputableGrdVec$fOutputablePmGRHS$fOutputablePmGRHSs$fOutputablePmMatch$fOutputablePmMatchGroup$fOutputablePmEmptyCase$fOutputablePmPatBind$fMonoidPrecision$fSemigroupPrecision$fOutputablePrecision$fOutputableRedSets$fOutputableCheckResult$fFunctorCheckResult $fEqPrecision$fShowPrecision pprUncovered HsDocContext TypeSigCtxStandaloneKindSigCtxPatCtxSpecInstSigCtxDefaultDeclCtxForeignDeclCtx DerivDeclCtxRuleCtx TyDataCtxTySynCtx TyFamilyCtx FamPatCtx ConDeclCtx ClassDeclCtxExprWithTySigCtxTypBrCtx HsTypeCtx HsTypePatCtxGHCiCtx SpliceTypeCtxClassInstanceCtx GenericCtxRelevantBindingsrelevantBindingNamesAndTys ranOutOfFuel ValidHoleFitsholeFitsrefinementFitsFitsMbSuppressedFitsfitsfitsSuppressedPotentialInstancesmatchesunifiers ImportError MissingModuleModulesDoNotExport CoercibleMsg UnknownRolesTyConIsAbstractOutOfScopeNewtypeConstructor HoleErrorOutOfScopeHoleHoleFitDispConfigHFDCshowWrap showWrapVarsshowTypeshowProv showMatchesNotInScopeError NotInScope NoExactNameSameNameMissingBindingNoTopLevelBindingUnknownSubordinateTcSolverReportInfo Ambiguity TyVarInfoNonInjectiveTyFamReportCoercibleMsgExpectedActual!ExpectedActualAfterTySynExpansion WhenMatchingSameOccOccursCheckInterestingTyVarslead_with_ambig_msg ambig_tyvars ea_expected ea_actualea_expanded_expectedea_expanded_actualsameOcc_same_pkg sameOcc_lhs sameOcc_rhs CND_ExtraFixedRuntimeRepErrorInfofrrInfo_origin frrInfo_typefrrInfo_isReflPrimTcSolverReportMsgTcReportWithInfo BadTelescope UserTypeErrorReportHoleErrorCannotUnifyWithPolytypeMismatch KindMismatchTypeEqMismatchFixedRuntimeRepError SkolemEscapeUntouchableVariableBlockedEqualityExpectingMoreArgumentsUnboundImplicitParamsCouldNotDeduceAmbiguityPreventsSolvingCtCannotResolveInstance UnsafeOverlap mismatch_ea mismatch_item mismatch_ty1 mismatch_ty2kmismatch_whatkmismatch_expectedkmismatch_actualteq_mismatch_ppr_explicit_kindsteq_mismatch_itemteq_mismatch_ty1teq_mismatch_ty2teq_mismatch_expectedteq_mismatch_actualteq_mismatch_whatcnd_user_givens cnd_wanted cnd_extracannotResolve_itemcannotResolve_unifierscannotResolve_candidatescannotResolve_importErrorscannotResolve_suggestionscannotResolve_relevant_bindingsoverlappingInstances_itemoverlappingInstances_matchesoverlappingInstances_unifiersunsafeOverlap_itemunsafeOverlap_matchesunsafeOverlapped ErrorItemEIei_pred ei_evdest ei_flavourei_loc ei_m_reason ei_suppressSolverReportErrCtxtCECcec_enclcec_tidy cec_bindscec_defer_type_errorscec_expr_holescec_type_holescec_out_of_scope_holescec_warn_redundantcec_expand_syns cec_suppressSolverReportWithCtxt reportContext reportContentSolverReportSupplementarySupplementaryBindingsSupplementaryHoleFitsSupplementaryCts SolverReportsr_important_msgssr_supplementarysr_hintsExported IsNotExported IsExportedMissingSignatureMissingTopLevelBindingSigMissingPatSynSigMissingTyConKindSig!AssociatedTyNotParamOverLastTyVar$YesAssociatedTyNotParamOverLastTyVar#NoAssociatedTyNotParamOverLastTyVarAssociatedTyLastVarInKindYesAssocTyLastVarInKindNoAssocTyLastVarInKindHasAssociatedDataFamInsts YesHasAdfs NoHasAdfs"SoleExtraConstraintWildcardAllowed%SoleExtraConstraintWildcardNotAllowedBadAnonWildcardContextWildcardNotLastInConstraint!ExtraConstraintWildcardNotAllowedWildcardsNotAllowedAtAll HasWildcardYesHasWildcard NoHasWildcardDeriveGenericsErrReason*DerivErrGenericsMustNotHaveDatatypeContext%DerivErrGenericsMustNotHaveExoticArgs$DerivErrGenericsMustBeVanillaDataCon&DerivErrGenericsMustHaveSomeTypeParams'DerivErrGenericsMustNotHaveExistentialsDerivErrGenericsWrongArgKindDeriveInstanceBadConstructorDerivErrBadConExistentialDerivErrBadConCovariantDerivErrBadConFunTypesDerivErrBadConWrongArgDerivErrBadConIsGADTDerivErrBadConHasExistentialsDerivErrBadConHasConstraintsDerivErrBadConHasHigherRankTypeDeriveInstanceErrReasonDerivErrNotWellKindedDerivErrSafeHaskellGenericInstDerivErrDerivingViaWrongKindDerivErrNoEtaReduceDerivErrBootFileFoundDerivErrDataConsNotAllInScopeDerivErrGNDUsedOnDataDerivErrNullaryClassesDerivErrLastArgMustBeAppDerivErrNoFamilyInstanceDerivErrNotStockDeriveableDerivErrHasAssociatedDatatypes!DerivErrNewtypeNonDeriveableClassDerivErrCannotEtaReduceEnoughDerivErrOnlyAnyClassDeriveableDerivErrNotDeriveableDerivErrNotAClassDerivErrNoConstructorsDerivErrLangExtRequiredDerivErrDunnoHowToDeriveForTypeDerivErrMustBeEnumType%DerivErrMustHaveExactlyOneConstructorDerivErrMustHaveSomeParametersDerivErrMustNotHaveClassContextDerivErrBadConstructorDerivErrGenericsDerivErrEnumOrProductDeriveAnyClassEnabledYesDeriveAnyClassEnabledNoDeriveAnyClassEnabledUsingGeneralizedNewtypeDerivingYesGeneralizedNewtypeDerivingNoGeneralizedNewtypeDerivingSuggestPartialTypeSignaturesYesSuggestPartialTypeSignaturesNoSuggestPartialTypeSignaturesNotClosedReasonNotLetBoundReason NotTypeClosed NotClosedSuggestUndecidableInstancesYesSuggestUndecidableInstacesNoSuggestUndecidableInstacesHasKinds YesHasKinds NoHasKindsInjectivityErrReasonInjErrRhsBareTyVarInjErrRhsCannotBeATypeFamInjErrRhsOverlapInjErrCannotInferFromRhsFixedRuntimeRepProvenanceFixedRuntimeRepDataConFieldFixedRuntimeRepPatSynSigArgFixedRuntimeRepPatSynSigResShadowedNameProvenanceShadowedNameProvenanceLocalShadowedNameProvenanceGlobalRecordFieldPartRecordFieldConstructorRecordFieldPatternRecordFieldUpdate ArgOrResultResultUnsupportedCallConventionStdCallConvUnsupportedPrimCallConvUnsupportedJavaScriptCallConvUnsupportedExpectedBackends COrAsmOrLlvmCOrAsmOrLlvmOrInterp TcRnMessageTcRnUnknownMessageTcRnMessageWithInfoTcRnSolverReportTcRnRedundantConstraintsTcRnInaccessibleCode"TcRnTypeDoesNotHaveFixedRuntimeRepTcRnImplicitLiftTcRnUnusedPatternBindsTcRnDodgyImportsTcRnDodgyExportsTcRnMissingImportListTcRnUnsafeDueToPluginTcRnModMissingRealSrcSpanTcRnIdNotExportedFromModuleSigTcRnIdNotExportedFromLocalSigTcRnShadowedNameTcRnDuplicateWarningDeclsTcRnSimplifierTooManyIterationsTcRnIllegalPatSynDeclTcRnLinearPatSynTcRnEmptyRecordUpdateTcRnIllegalFieldPunningTcRnIllegalWildcardsInRecordTcRnIllegalWildcardInTypeTcRnDuplicateFieldNameTcRnIllegalViewPatternTcRnCharLiteralOutOfRange!TcRnIllegalWildcardsInConstructorTcRnIgnoringAnnotationsTcRnAnnotationInSafeHaskellTcRnInvalidTypeApplicationTcRnTagToEnumMissingValArgTcRnTagToEnumUnspecifiedResTyTcRnTagToEnumResTyNotAnEnum(TcRnArrowIfThenElsePredDependsOnResultTyTcRnArrowCommandExpectedTcRnIllegalHsBootFileDeclTcRnRecursivePatternSynonymTcRnPartialTypeSigTyVarMismatchTcRnPartialTypeSigBadQuantifierTcRnMissingSignatureTcRnPolymorphicBinderMissingSigTcRnOverloadedSigTcRnTupleConstraintInstTcRnAbstractClassInstTcRnNoClassInstHeadTcRnUserTypeErrorTcRnConstraintInKind TcRnUnboxedTupleOrSumTypeFuncArgTcRnLinearFuncInKindTcRnForAllEscapeErrorTcRnVDQInTermTypeTcRnBadQuantPredHeadTcRnIllegalTupleConstraintTcRnNonTypeVarArgInConstraintTcRnIllegalImplicitParam"TcRnIllegalConstraintSynonymOfKindTcRnIllegalClassInstTcRnOversaturatedVisibleKindArgTcRnBadAssociatedTypeTcRnForAllRankErrTcRnMonomorphicBindingsTcRnFunDepConflictTcRnDupInstanceDeclsTcRnConflictingFamInstDeclsTcRnFamInstNotInjectiveTcRnBangOnUnliftedTypeTcRnMultipleDefaultDeclarationsTcRnBadDefaultTypeTcRnPatSynBundledWithNonDataConTcRnPatSynBundledWithWrongTypeTcRnDupeModuleExportTcRnExportedModNotImportedTcRnNullExportedModuleTcRnMissingExportListTcRnExportHiddenComponentsTcRnDuplicateExportTcRnExportedParentChildMismatchTcRnConflictingExportsTcRnAmbiguousFieldTcRnMissingFieldsTcRnFieldUpdateInvalidTypeTcRnNoConstructorHasAllFieldsTcRnMixedSelectorsTcRnMissingStrictFieldsTcRnNoPossibleParentForFieldsTcRnBadOverloadedRecordUpdateTcRnStaticFormNotClosedTcRnSpecialClassInstTcRnUselessTypeableTcRnDerivingDefaultsTcRnNonUnaryTypeclassConstraintTcRnPartialTypeSignaturesTcRnCannotDeriveInstanceTcRnLazyGADTPatternTcRnArrowProcGADTPatternTcRnTypeEqualityOutOfScope!TcRnTypeEqualityRequiresOperatorsTcRnIllegalTypeOperatorTcRnGADTMonoLocalBindsTcRnNotInScopeTcRnUntickedPromotedConstructorTcRnIllegalBuiltinSyntaxTcRnWarnDefaultingTcRnForeignImportPrimExtNotSetTcRnForeignImportPrimSafeAnn TcRnForeignFunctionImportAsValue TcRnFunPtrImportWithoutAmpersandTcRnIllegalForeignDeclBackendTcRnUnsupportedCallConvTcRnIllegalForeignTypeTcRnInvalidCIdentifierTcRnMessageDetailedErrInfoerrInfoContexterrInfoSupplementarypprFixedRuntimeRepProvenancehasKindssuggestUndecidableInstancessuggestPartialTypeSignaturesusingGeneralizedNewtypeDerivingderiveAnyClassEnabled hasWildcardhasAssociatedDataFamInstsassociatedTyLastVarInKind!associatedTyNotParamOverLastTyVar getUserGivenserrorItemOriginerrorItemEqRelerrorItemCtLoc errorItemPreddiscardProvCtxtGivensmkTcRnNotInScopemkTcReportWithInfonoValidHoleFitspprRelevantBindings$fOutputableExported$fOutputableErrorItem$fMonoidSolverReport$fSemigroupSolverReport%$fEqAssociatedTyNotParamOverLastTyVar$fEqAssociatedTyLastVarInKind$fEqHasAssociatedDataFamInsts$fEqHasWildcard$fEqDeriveAnyClassEnabled#$fEqUsingGeneralizedNewtypeDeriving"$fShowSuggestPartialTypeSignatures $fEqSuggestPartialTypeSignatures!$fShowSuggestUndecidableInstances$fEqSuggestUndecidableInstances$fShowHasKinds $fEqHasKinds$fEqUnsupportedCallConvention$fEqExpectedBackends!pprTypeDoesNotHaveFixedRuntimeRep pprScopeErrortidySkolemInfotidySkolemInfoAnonwithHsDocContextinHsDocContextpprHsDocContext$fOutputableImportError$fOutputableSolverReportErrCtxt$fDiagnosticTcRnMessageTransLayoutReasonTransLayout_WhereTransLayout_PipeCmmParserErrorCmmUnknownPrimitiveCmmUnknownMacroCmmUnknownCConvCmmUnrecognisedSafetyCmmUnrecognisedHintLexErrLexErrorLexUnknownPragmaLexErrorInPragmaLexNumEscapeRangeLexStringCharLitLexStringCharLitEOFLexUnterminatedCommentLexUnterminatedOptionsLexUnterminatedQQ LexErrKindLexErrKind_EOFLexErrKind_UTF8LexErrKind_CharNumUnderscoreReasonNumUnderscore_IntegralNumUnderscore_FloatPsErrInPatDetails PEIP_NegApp PEIP_TypeArgsPEIP_RecPatternPEIP_OtherPatDetails ParseContextis_infixincomplete_do_blockPatIncompleteDoBlockYesIncompleteDoBlockNoIncompleteDoBlockPatIsRecursiveYesPatIsRecursiveNoPatIsRecursivePsErrParseDetailsped_th_enabledped_do_in_last_100ped_mdo_in_last_100ped_pat_syn_enabledped_pattern_parsed PsMessagePsUnknownMessagePsHeaderMessagePsWarnBidirectionalFormatCharsPsWarnTransitionalLayoutPsWarnUnrecognisedPragmaPsWarnHaddockInvalidPosPsWarnHaddockIgnoreMulti#PsWarnOperatorWhitespaceExtConflictPsErrLambdaCasePsErrEmptyLambdaPsErrNumUnderscoresPsErrPrimStringInvalidCharPsErrMissingBlock PsErrLexer PsErrSuffixAT PsErrParse PsErrCmmLexerPsErrUnsupportedBoxedSumExprPsErrUnsupportedBoxedSumPat#PsErrUnexpectedQualifiedConstructorPsErrTupleSectionInPatPsErrIllegalBangPatternPsErrOpFewArgsPsErrImportQualifiedTwicePsErrImportPostQualifiedPsErrIllegalExplicitNamespacePsErrVarForTyConPsErrIllegalPatSynExportPsErrMalformedEntityStringPsErrDotsInRecordUpdatePsErrPrecedenceOutOfRangePsErrOverloadedRecordDotInvalid%PsErrOverloadedRecordUpdateNotEnabled,PsErrOverloadedRecordUpdateNoQualifiedFieldsPsErrInvalidDataConPsErrInvalidInfixDataConPsErrUnpackDataConPsErrUnexpectedKindAppInDataConPsErrInvalidRecordConPsErrIllegalUnboxedStringInPat#PsErrIllegalUnboxedFloatingLitInPatPsErrDoNotationInPatPsErrIfThenElseInPatPsErrLambdaCaseInPatPsErrCaseInPat PsErrLetInPatPsErrLambdaInPatPsErrArrowExprInPatPsErrArrowCmdInPatPsErrArrowCmdInExprPsErrViewPatInExprPsErrTypeAppWithoutSpacePsErrLazyPatWithoutSpacePsErrBangPatWithoutSpacePsErrUnallowedPragmaPsErrQualifiedDoInCmdPsErrInvalidInfixHolePsErrSemiColonsInCondExprPsErrSemiColonsInCondCmdPsErrAtInPatPosPsErrLambdaCmdInFunAppCmdPsErrCaseCmdInFunAppCmdPsErrIfCmdInFunAppCmdPsErrLetCmdInFunAppCmdPsErrDoCmdInFunAppCmdPsErrDoInFunAppExprPsErrMDoInFunAppExprPsErrLambdaInFunAppExprPsErrCaseInFunAppExprPsErrLambdaCaseInFunAppExprPsErrLetInFunAppExprPsErrIfInFunAppExprPsErrProcInFunAppExprPsErrMalformedTyOrClDeclPsErrIllegalWhereInDataDeclPsErrIllegalDataTypeContextPsErrParseErrorOnInputPsErrMalformedDeclPsErrUnexpectedTypeAppInDeclPsErrNotADataConPsErrRecordSyntaxInPatSynDeclPsErrEmptyWhereInPatSynDecl!PsErrInvalidWhereBindInPatSynDecl"PsErrNoSingleWhereBindInPatSynDeclPsErrDeclSpliceNotAtTopLevelPsErrInferredTypeVarNotAllowed+PsErrMultipleNamesInStandaloneKindSignaturePsErrIllegalImportBundleFormPsErrUnexpectedTypeInDeclPsErrExpectedHyphenPsErrSpaceInSCCPsErrInvalidPackageName PsErrInvalidRuleActivationMarkerPsErrLinearFunctionPsErrMultiWayIfPsErrExplicitForallPsErrIllegalQualifiedDoPsErrCmmParser#PsErrIllegalTraditionalRecordSyntaxPsErrParseErrorInCmd PsErrInPatPsErrParseRightOpSectionInPat"PsErrIllegalGadtRecordMultiplicityPsErrInvalidCApiImportPsErrParseLanguagePragmaPsErrUnsupportedExtPsErrParseOptionsPragmaPsErrUnknownOptionsPragmaPsError PsWarningnoParseContextincompleteDoBlockfromParseContext$fShowLexErrKind$fEqLexErrKind$fOrdLexErrKind$fShowNumUnderscoreReason$fEqNumUnderscoreReason$fOrdNumUnderscoreReason$fEqParseContext$fEqPatIncompleteDoBlockpsHeaderMessageDiagnosticpsHeaderMessageReasonpsHeaderMessageHintssuggestParensAndBlockArgspp_unexpected_fun_appparse_error_in_pat forallSym$fDiagnosticPsMessageMonadPaddError addWarning addFatalErrorgetBitallocateCommentsPallocatePriorCommentsPallocateFinalCommentsPExtBitsFfiBitInterruptibleFfiBit CApiFfiBit ArrowsBitThBit ThQuotesBitIpBitOverloadedLabelsBitExplicitForallBit BangPatBitPatternSynonymsBit HaddockBit MagicHashBitRecursiveDoBitQualifiedDoBitUnicodeSyntaxBitUnboxedParensBitDatatypeContextsBitMonadComprehensionsBitTransformComprehensionsBitQqBitRawTokenStreamBitAlternativeLayoutRuleBitALRTransitionalBitRelaxedLayoutBitNondecreasingIndentationBitSafeHaskellBitTraditionalRecordSyntaxBitExplicitNamespacesBit LambdaCaseBitBinaryLiteralsBitNegativeLiteralsBitHexFloatLiteralsBitStaticPointersBitNumericUnderscoresBit StarIsTypeBitBlockArgumentsBitNPlusKPatternsBitDoAndIfThenElseBit MultiWayIfBit GadtSyntaxBitImportQualifiedPostBitLinearTypesBitNoLexicalNegationBitOverloadedRecordDotBitOverloadedRecordUpdateBit InRulePragBitInNestedCommentBitUsePosPragsBitPunPPStatebufferoptionswarningserrors tab_first tab_countlast_tkprev_loc prev_loc2last_loclast_lenloccontext lex_statesrcfilesalr_pending_implicit_tokensalr_next_token alr_last_loc alr_contextalr_expecting_ocurlyalr_justClosedExplicitLetBlockeof_posheader_comments comment_q hdk_comments HdkCommentHdkCommentNextHdkCommentPrevHdkCommentNamedHdkCommentSection ParserOpts pExtsBitmap pDiagOptspSupportedExts ParseResultTokenITasITcaseITclassITdata ITdefault ITderivingITdoITelseIThiding ITforeignITifITimportITinITinfixITinfixlITinfixr ITinstanceITletITmodule ITnewtypeITof ITqualifiedITthenITtypeITwhereITforallITexportITlabel ITdynamicITsafeITinterruptibleITunsafe ITstdcallconv ITccallconv ITcapiconvITprimcallconvITjavascriptcallconvITmdoITfamilyITroleITgroupITbyITusing ITpatternITstaticITstock ITanyclassITviaITunit ITsignature ITdependency ITrequires ITinline_prag ITopaque_prag ITspec_pragITspec_inline_prag ITsource_prag ITrules_pragITwarning_pragITdeprecated_prag ITline_prag ITcolumn_prag ITscc_prag ITunpack_pragITnounpack_prag ITann_pragITcomplete_prag ITclose_pragIToptions_pragITinclude_pragITlanguage_pragITminimal_pragIToverlappable_pragIToverlapping_pragIToverlaps_pragITincoherent_pragITctypeITcomment_line_pragITdotdotITcolonITdcolonITequalITlamITlcaseITvbarITlarrowITrarrowITdarrowITlollyITminus ITprefixminusITbangITtildeITat ITtypeApp ITpercentITstarITdotITprojITbiglamITocurlyITccurly ITvocurly ITvccurlyITobrack ITopabrack ITcpabrackITcbrackIToparenITcparen IToubxparen ITcubxparenITsemiITcomma ITunderscore ITbackquote ITsimpleQuoteITvaridITconidITvarsymITconsymITqvaridITqconid ITqvarsym ITqconsym ITdupipvarid ITlabelvaridITcharITstring ITinteger ITrational ITprimchar ITprimstring ITprimint ITprimword ITprimfloat ITprimdoubleITopenExpQuoteITopenPatQuoteITopenDecQuoteITopenTypQuote ITcloseQuoteITopenTExpQuoteITcloseTExpQuoteITdollarITdollardollar ITtyQuote ITquasiQuote ITqQuasiQuoteITprocITrec IToparenbar ITcparenbar ITlarrowtail ITrarrowtail ITLarrowtail ITRarrowtail ITunknownITeof ITdocComment ITdocOptions ITlineCommentITblockCommentPFailedPOkwarnoptfailMsgP failLocMsgP getPState setSrcLoc getRealSrcLoc setLastToken adjustChar nextIsEOF pushLexState popLexState getLexState activeContextxtestxsetxunset mkParserOptsdisableHaddock initPragStateinitParserStategetCommentsForgetPriorCommentsForgetFinalCommentsFor getEofPos addPsMessagegetPsErrorMessages getPsMessages popContextpushModuleContext srcParseFaillexerlexerDbglexTokenStream mkParensEpAnnallocateCommentsallocatePriorCommentsallocateFinalCommentscommentToAnnotation$fOutputableToken$fMonadP$fApplicativeP $fFunctorP $fMonadPP $fEnumExtBits$fShowHdkComment$fShowLayoutContext $fShowTokenPV ImpExpQcSpec ImpExpQcName ImpExpQcTypeImpExpQcWildcard ImpExpSubSpec ImpExpAbs ImpExpAll ImpExpList ImpExpAllWithDisambTDmkHsAppTyHeadPV mkHsAppTyPVmkHsAppKindTyPV mkHsOpTyPVmkUnpackednessPV DisambECPInfixOpFunArg ecpFromCmd' ecpFromExp'mkHsProjUpdatePV mkHsLamPV mkHsLetPV superInfixOp mkHsOpAppPV mkHsCasePV mkHsLamCasePV superFunArg mkHsAppPV mkHsAppTypePVmkHsIfPVmkHsDoPV mkHsParPV mkHsVarPV mkHsLitPV mkHsOverLitPVmkHsWildCardPV mkHsTySigPVmkHsExplicitListPV mkHsSplicePV mkHsRecordPV mkHsNegAppPVmkHsSectionR_PV mkHsViewPatPV mkHsAsPatPV mkHsLazyPatPV mkHsBangPatPVmkSumOrTuplePVrejectPragmaPV DisambInfixOp mkHsVarOpPV mkHsConOpPVmkHsInfixHolePVFbindECPunECPUnpackednessPragma RuleTyTmVar LRuleTyTmVarmkTyClDmkInstD mkClassDeclmkTyData mkTySynonymmkStandaloneKindSigmkTyFamInstEqn mkDataFamInst mkTyFamInst mkFamDecl mkSpliceDeclmkRoleAnnotDeclfromSpecTyVarBndrsfromSpecTyVarBndrannBindsfixValbindsAnn cvTopDecls cvBindGroupmkPatSynMatchGroup mkConDeclH98 mkGadtDeclsetRdrNameSpace mkRuleBndrsmkRuleTyVarBndrscheckRuleTyVarBndrNamescheckRecordSyntaxcheckEmptyGADTscheckExpBlockArgumentscheckCmdBlockArguments checkContextcheckImportDecl checkPatterncheckPattern_detailsplaceHolderPunRhs checkValDefcheckValSigLhsmkBangTyaddUnpackednessPcheckMonadComp ecpFromExp ecpFromCmddataConBuilderCondataConBuilderDetails checkPrecPmkRecConstrOrUpdatemkRdrRecordUpdmkRdrRecordConmkInlinePragmamkOpaquePragmamkImport parseCImportmkExport mkExtNamemkModuleImpExp mkTypeImpExpcheckImportSpecmkImpExpSubSpecwarnPrepositiveQualifiedModule#failOpNotEnabledImportQualifiedPostfailOpImportQualifiedTwicewarnStarIsType failOpFewArgsrunPV hintBangPatmkMultTymkTokenLocationstarSym mkRdrGetFieldmkRdrProjection $fMonadPPV $fMonadPV$fApplicativePV $fFunctorPV$fDisambTDDataConBuilder$fDisambTDHsType$fDisambInfixOpRdrName$fDisambInfixOpHsExpr$fDisambECPPatBuilder$fDisambECPHsExpr$fDisambECPHsCmdlexStringLiterallexHsDocparseIdentifieraddHaddockToModule$fMonoidLowerLocBound$fSemigroupLowerLocBound$fMonoidUpperLocBound$fSemigroupUpperLocBound$fMonoidColumnBound$fSemigroupColumnBound$fMonoidLocRange$fSemigroupLocRange$fApplicativeHdkA$fHasHaddockGenLocated$fHasHaddockGenLocated0$fHasHaddockHsWildCardBndrs$fHasHaddockHsScaled$fHasHaddockGenLocated1$fHasHaddockGenLocated2$fHasHaddockGenLocated3$fHasHaddockGenLocated4$fHasHaddockHsDataDefn$fHasHaddockHsDecl$fHasHaddockGenLocated5$fHasHaddockGenLocated6$fHasHaddockGenLocated7$fHasHaddockGenLocated8$fHasHaddock[] $fFunctorHdkA $fFunctorHdkM$fApplicativeHdkM $fMonadHdkM$fShowColumnBound$fShowUpperLocBound$fShowLowerLocBound$fSemigroupHasInnerDocs$fMonoidHasInnerDocsinitParserOpts BindsTypeUnliftedTypeBinds StrictBindsExhaustivityCheckTypeNegLiteralExtEnabledYesUsingNegLiteralsNotUsingNegLiteralsThRejectionReasonThAmbiguousRecordUpdatesThAbstractClosedTypeFamilyThForeignLabelThForeignExportThMinimalPragmas ThSCCPragmasThNoUserInlineThExoticFormOfTypeThAmbiguousRecordSelectorsThMonadComprehensionSyntax ThCostCentresThExpressionFormThExoticStatementThExoticLiteralThExoticPatternThGuardedLambdasThNegativeOverloadedPatternsThHaddockDocumentationThWarningAndDeprecationPragmasThSplicesWithinDeclBracketsThNonLinearDataConDsArgNum DsMessageDsUnknownMessageDsEmptyEnumerationDsIdentitiesFoundDsOverflowedLiteralsDsRedundantBangPatternsDsOverlappingPatternsDsInaccessibleRhsDsNonExhaustivePatternsDsTopLevelBindsNotAllowed)DsUselessSpecialiseForClassMethodSelector&DsUselessSpecialiseForNoInlineFunction#DsMultiplicityCoercionsNotSupported DsOrphanRuleDsRuleLhsTooComplicatedDsRuleIgnoredDueToConstructorDsRuleBindersNotBoundDsMultipleConForNewtype#DsLazyPatCantBindVarsOfUnliftedTypeDsNotYetHandledByTHDsAggregatedViewExpressionsDsUnbangedStrictPatterns"DsCannotMixPolyAndUnliftedBindings DsInvalidInstantiationDictAtType DsWrongDoBindDsUnusedDoBind"DsRecBindsNotAllowedForUnliftedTysDsRuleMightInlineFirstDsAnotherRuleMightFireFirstMaxPmCheckModelsMaxUncoveredPatternsMaxBoundMinBoundnegLiteralExtEnabledBuildingCabalPackageYesBuildingCabalPackageNoBuildingCabalPackage DriverMessageDriverUnknownMessageDriverPsHeaderMessageDriverMissingHomeModulesDriverUnknownReexportedModulesDriverUnknownHiddenModulesDriverUnusedPackagesDriverUnnecessarySourceImports!DriverDuplicatedModuleDeclarationDriverModuleNotFoundDriverFileModuleNameMismatchDriverFileNotFound DriverStaticPointersNotSupportedDriverBackpackModuleNotFoundDriverUserDefinedRuleIgnoredDriverMixedSafetyImportDriverCannotLoadInterfaceFileDriverInferredSafeModule&DriverMarkedTrustworthyButInferredSafeDriverInferredSafeImportDriverCannotImportUnsafeModuleDriverMissingSafeHaskellModeDriverPackageNotTrusted&DriverCannotImportFromUntrustedPackageDriverRedirectedNoMainDriverHomePackagesNotClosedDriverMessages GhcMessage GhcPsMessageGhcTcRnMessage GhcDsMessageGhcDriverMessageGhcUnknownMessageWarnMsg ErrorMessagesWarningMessagesghcUnknownMessagehoistTcRnMessagehoistDsMessagecheckBuildingCabalPackage$fEqBuildingCabalPackage badMonadBindpprEqn pprContextdots$fDiagnosticDsMessagesuggestInstantiatedWith$fDiagnosticDriverMessage$fDiagnosticGhcMessage SourceErrormkSrcErrsrcErrorMessages throwErrors throwOneErrorhandleSourceError$fExceptionSourceError$fShowSourceError printMessageshandleFlagWarningsprintOrThrowDiagnosticsmkDriverPsHeaderMessageBlankEpAnnotationsNoBlankEpAnnotations BlankSrcSpanBlankSrcSpanFileNoBlankSrcSpanshowAstDataFull showAstData$fEqBlankEpAnnotations$fShowBlankEpAnnotations$fEqBlankSrcSpan$fShowBlankSrcSpan LRenamingRenaming renameFromrenameTo IncludeDeclidUnitId idModRenamingidSignatureInclude LHsUnitDecl HsUnitDeclDeclDIncludeDLHsUnitHsUnit hsunitName hsunitBody LHsModuleId HsModuleId HsModuleVarLHsModuleSubst HsModuleSubst LHsUnitIdHsUnitId HsComponentId hsPackageName hsComponentId$fOutputableHsComponentIdparseModuleNoHaddockparseSignature parseImportparseStatementparseDeclarationparseExpression parsePatternparseTypeSignature parseStmt parseType parseBackpack parseHeader parseModule getImports mkPrelImportsgetOptionsFromFile getOptionstoArgscheckProcessArgsResult $fBinaryBytes$fBinaryDocLoc$fBinaryPatSynArgs$fBinaryPatSynDir$fBinaryTypeFamilyHead$fBinaryFamilyResultSig$fBinaryInjectivityAnn$fBinaryClause$fBinaryModuleInfo$fBinaryAnnLookup $fBinaryCon$fBinaryDecidedStrictness$fBinarySourceStrictness$fBinarySourceUnpackedness $fBinaryBang$fBinaryForeign$fBinaryCallconv$fBinaryPragma$fBinaryInline$fBinaryRuleMatch$fBinaryPhases$fBinaryRuleBndr$fBinaryFunDep$fBinaryTySynEqn $fBinaryMatch $fBinaryBody $fBinaryGuard$fBinaryDerivStrategy$fBinaryDerivClause$fBinaryOverlap $fBinaryDec $fBinaryExp $fBinaryPat $fBinaryStmt $fBinaryRange $fBinaryLit$fBinaryTyVarBndr $fBinaryTyLit $fBinaryType $fBinaryInfo$fBinaryModule$fBinaryPkgName$fBinaryNameFlavour$fBinaryModName $fBinaryLocPipepipeRead pipeWrite pipeLeftoversMsgQStateqsMap qsLocationqsPipe THResultTypeTHExpTHPatTHTypeTHDec THAnnWrapperTHResult THException THCompleteSerializableExceptionEUserInterrupt EExitCodeEOtherException EvalResult EvalException EvalSuccess EvalStatus_ EvalComplete EvalBreak EvalStatusEvalExprEvalThisEvalApp ResumeContextresumeBreakMVarresumeStatusMVarresumeThreadIdEvalOptsuseSandboxThread singleStepbreakOnException breakOnErrorTHMsg THMessageNewNameReport LookupNameReify ReifyFixity ReifyTypeReifyInstances ReifyRolesReifyAnnotations ReifyModuleReifyConStrictnessGetPackageRootAddDependentFile AddTempFileAddModFinalizer AddCorePlugin AddTopDeclsAddForeignFilePath IsExtEnabled ExtsEnabledPutDocGetDoc StartRecover EndRecover FailIfErrs RunTHDoneQResultQDone QExceptionQFailMessageShutdown RtsRevertCAFs InitLinker LookupSymbol LookupClosureLoadDLL LoadArchiveLoadObj UnloadObjAddLibrarySearchPathRemoveLibrarySearchPath ResolveObjsFindSystemLibrary CreateBCOsFreeHValueRefs AddSptEntry MallocData MallocStringsPrepFFIFreeFFIMkConInfoTableEvalStmt ResumeStmt AbandonStmt EvalStringEvalStringToStringEvalIO MkCostCentresCostCentreStackInfo NewBreakArraySetupBreakpointBreakpointStatusGetBreakpointVarStartTHRunTHRunModFinalizers GetClosureSeq ResumeSeq getTHMessage putTHMessagetoSerializableExceptionfromSerializableException getMessage putMessage remoteCall remoteTHCall writePipereadPipe$fBinaryGenClosure$fBinaryPrimType$fBinaryClosureType$fBinaryStgInfoTable$fBinaryTsoFlags$fBinaryWhyBlocked$fBinaryWhatNext$fBinaryIndexTable$fBinaryCostCentreStack$fBinaryStgTSOProfInfo$fBinaryFunPtr $fBinaryPtr$fBinaryExitCode$fBinaryQResult$fBinaryEvalOpts$fBinaryEvalExpr$fBinarySerializableException$fBinaryEvalResult$fBinaryEvalStatus_$fBinaryTHResult$fBinaryTHResultType $fShowQState$fEnumTHResultType$fShowTHResultType$fGenericTHResultType$fGenericTHResult$fShowTHResult$fGenericEvalStatus_$fShowEvalStatus_$fGenericEvalResult$fShowEvalResult$fGenericSerializableException$fShowSerializableException$fGenericEvalExpr$fShowEvalExpr$fGenericEvalOpts$fShowEvalOpts$fGenericQResult $fShowQResult$fShowTHMessage $fShowMessage IServInstance iservPipe iservProcessiservLookupSymbolCacheiservPendingFrees IServConfigiservConfProgram iservConfOptsiservConfProfilediservConfDynamic iservConfHookiservConfTrace IServState IServPending IServRunningIServInterpInstanceExternalInterpInterpinterpInstance interpLoaderBCOOpts bco_n_jobs interpCmd withIServ withIServ_evalStmt resumeStmt abandonStmtevalIO evalStringevalStringToIOString mallocData mkCostCentres createBCOs addSptEntrycostCentreStackInfostoreBreakpointbreakpointStatusgetBreakpointVar getClosure seqHValue initObjLinker lookupSymbol lookupClosurepurgeLookupSymbolCacheloadDLL loadArchiveloadObj unloadObjaddLibrarySearchPathremoveLibrarySearchPath resolveObjsfindSystemLibrary iservCall readIServ writeIServ stopInterpmkFinalizedHValuefreeHValueRefswormhole wormholeReffromEvalResult getModBreaksinterpreterProfiledinterpreterDynamicHistoryhistoryApStackhistoryBreakInfohistoryEnclosingDeclsResumeBindingsResume resumeContextresumeBindingsresumeFinalIds resumeApStackresumeBreakInfo resumeSpan resumeDecl resumeCCS resumeHistoryresumeHistoryIxIcGlobalRdrEnvigre_envigre_prompt_env ExecResult ExecComplete ExecBreak execResultexecAllocation breakNames breakInfo SingleStepRunToCompletionRunAndLogSteps ExecOptionsexecSingleStepexecSourceFileexecLineNumberexecWrapisStepInteractiveImportIIDeclIIModuleInteractiveContext ic_dflags ic_mod_index ic_imports ic_tythings ic_gre_cache ic_instances ic_fix_env ic_default ic_resumeic_monad ic_int_printic_cwd ic_pluginsemptyInteractiveContext icReaderEnvicInteractiveModule icInScopeTTs icPrintUnqualextendInteractiveContextextendInteractiveContextWithIdssetInteractivePrintNamereplaceImportEnvsubstInteractiveContext$fOutputableInteractiveImportHscEnv hsc_dflags hsc_targets hsc_mod_graphhsc_IChsc_NChsc_FChsc_type_env_vars hsc_interp hsc_plugins hsc_unit_env hsc_logger hsc_hooks hsc_tmpfs$fContainsDynFlagsHscEnv$fHasLoggerHsc$fHasDynFlagsHsc $fFunctorHsc$fApplicativeHsc $fMonadHsc $fMonadIOHscrunHscrunHsc'mkInteractiveHscEnvrunInteractiveHsc hsc_home_unithsc_home_unit_maybe hsc_unitshsc_HPThsc_HUEhsc_HUGhsc_all_home_unit_ids hscUpdateHPT hscUpdateHUGhscEPShptCompleteSigshptAllInstanceshptInstancesBelowhptRuleshptAnns hptAllThingshptSomeThingsBelowUsprepareAnnotations lookupTypelookupIfaceByModule mainModIs hscInterphscUpdateLoggerFlagshscUpdateFlags hscSetFlagshscSetActiveHomeUnithscSetActiveUnitIdhscActiveUnitId discardIC WarnErrLoggerGhcTunGhcTGhcunGhcGhcMonad getSession setSession withSessiongetSessionDynFlags modifySessionmodifySessionMwithTempSession modifyLogger pushLogHookM popLogHookMputMsgM putLogMsgM withTimingMlogDiagnostics reflectGhcreifyGhcliftGhcTprintExceptiondefaultWarnErrLogger $fGhcMonadGhc$fHasLoggerGhc$fHasDynFlagsGhc $fMonadFixGhc $fMonadIOGhc $fMonadGhc$fApplicativeGhc$fGhcMonadGhcT$fHasLoggerGhcT$fHasDynFlagsGhcT $fMonadIOGhcT $fMonadGhcT$fApplicativeGhcT $fFunctorGhcT$fMonadThrowGhcT$fMonadCatchGhcT$fMonadMaskGhcT $fFunctorGhc$fMonadThrowGhc$fMonadCatchGhc$fMonadMaskGhcCoreMPreInlineUnconditionallyPostInlineUnconditionally UnfoldingDone RuleFiredLetFloatFromLet EtaExpansion EtaReduction BetaReduction CaseOfCase KnownBranch CaseMergeAltMergeCaseElim CaseIdentityFillInCaseDefaultSimplifierDone SimplCountCorePluginPassfloatOutLambdasfloatOutConstantsfloatOutOverSatAppsfloatToTopLevelOnly SimplModesm_namessm_phase sm_uf_optssm_rules sm_inline sm_case_case sm_eta_expandsm_cast_swizzle sm_pre_inline sm_logger sm_dflagsCoreToDoCoreDoSimplifyCoreDoPluginPassCoreDoFloatInwardsCoreDoFloatOutwardsCoreLiberateCaseCoreDoPrintCoreCoreDoStaticArgsCoreDoCallArity CoreDoExitify CoreDoDemand CoreDoCprCoreDoWorkerWrapperCoreDoSpecialisingCoreDoSpecConstrCoreCSECoreDoRuleCheck CoreDoNothing CoreDoPasses CoreDesugarCoreDesugarOptCoreTidyCorePrepCoreAddCallerCcsCoreAddLateCcs CoreOccurAnalpprPassDetailsrunWhenrunMaybe bindsOnlyPass simplCountNzeroSimplCountisZeroSimplCounthasDetailedCountsdoFreeSimplTick doSimplTickplusSimplCount pprSimplCountrunCoreMliftIOWithCount getHscEnv getRuleBasegetVisibleOrphanModsgetPrintUnqualified getSrcSpanM addSimplCount getUniqMaskgetPackageFamInstEnvgetAnnotationsgetFirstAnnotationsmsgputMsgS errorMsgSfatalErrorMsgSdebugTraceMsgS$fOutputableSimplMode$fOutputableFloatOutSwitches $fOrdTick$fEqTick$fOutputableTick$fHasModuleCoreM$fHasLoggerCoreM$fHasDynFlagsCoreM$fMonadIOCoreM$fMonadUniqueCoreM$fMonadPlusCoreM$fAlternativeCoreM$fApplicativeCoreM $fMonadCoreM$fOutputableCoreToDo$fFunctorCoreM ccfModuleName ccfFuncName NamePatternPChar PWildcardPEndaddCallerCostCentres$fBinaryNamePattern$fOutputableNamePattern$fBinaryCallerCcFilter$fOutputableCallerCcFilterendPass endPassIOdumpPassResultlintPassResultdisplayLintResultslintInteractiveExprinteractiveInScopelintCoreBindings lintUnfoldinglintExpr lintAxioms lintAnnots$fHasDynFlagsLintM$fMonadFailLintM $fMonadLintM$fApplicativeLintM$fFunctorLintM$fEqStaticPtrCheckTHDocs RoleAnnotEnvDefaultingPlugin dePluginInit dePluginRun dePluginStopFillDefaultingDefaultingPluginResultDefaultingProposaldeProposalTyVardeProposalCandidates deProposalCtsTcPluginRewriteResultTcPluginNoRewriteTcPluginRewriteTotcPluginReductiontcRewriterNewWantedsTcPluginSolveResulttcPluginInsolubleCtstcPluginSolvedCtstcPluginNewCtsTcPlugin tcPluginInit tcPluginSolvetcPluginRewrite tcPluginStop TcPluginM runTcPluginMTcPluginRewriterTcPluginSolver TcPatSynInfoTPSI patsig_namepatsig_implicit_bndrspatsig_univ_bndrs patsig_reqpatsig_ex_bndrs patsig_provpatsig_body_ty TcIdSigInstTISI sig_inst_sigsig_inst_skolssig_inst_theta sig_inst_tau sig_inst_wcs sig_inst_wcx CompleteSig PartialSigsig_bndrsig_ctxtsig_loc psig_name psig_hs_ty TcSigInfoTcIdSig TcPatSynSigTcSigFun WhereFrom ImportByUserImportBySystemImportByPlugin ClosedTypeIdRhsNames IsGroupClosed IdBindingInfo NotLetBound ClosedLet NonClosedLet PromotionErrTyConPEClassPE FamDataConPEConstrainedDataConPEPatSynPE RecDataConPE NoDataKindsDC TcTyThingAGlobalATcIdATyVarATcTyCon APromotionErrtct_idtct_info ArrowCtxt NoArrowCtxtThLevel PendingStuffRnPendingUntypedRnPendingTyped TcPendingThStageSplice RunSpliceCompBrack SpliceTypeTypedUntypedTcBinderTcIdBndrTcIdBndr_ExpTypeTcTvBndr TcBinderStackTcIdSetTcIdTcRef ThBindEnv TcTypeEnvErrCtxttcl_loctcl_ctxttcl_in_gen_code tcl_tclvl tcl_th_ctxt tcl_th_bndrstcl_arrow_ctxttcl_rdrtcl_env tcl_usage tcl_bndrstcl_lietcl_errs NoSelfBootSelfBootsb_mdssb_tcs RecFieldEnvtcg_modtcg_semantic_modtcg_src tcg_rdr_env tcg_default tcg_fix_env tcg_field_env tcg_type_env tcg_inst_envtcg_fam_inst_env tcg_ann_env tcg_exports tcg_importstcg_dus tcg_used_grestcg_keep tcg_th_usedtcg_th_splice_usedtcg_th_needed_deps tcg_dfun_n tcg_mergedtcg_rn_exportstcg_rn_imports tcg_rn_declstcg_dependent_filestcg_th_topdeclstcg_th_foreign_filestcg_th_topnamestcg_th_modfinalizerstcg_th_coreplugins tcg_th_statetcg_th_remote_state tcg_th_docs tcg_ev_binds tcg_tr_module tcg_bindstcg_sigs tcg_imp_specs tcg_warnstcg_annstcg_tcs tcg_ksigs tcg_insts tcg_fam_insts tcg_rules tcg_fords tcg_patsyns tcg_doc_hdrtcg_hpc tcg_self_boottcg_maintcg_safe_infertcg_safe_infer_reasonstcg_tc_plugin_solverstcg_tc_plugin_rewriterstcg_defaulting_pluginstcg_hf_plugins tcg_top_loc tcg_static_wctcg_complete_matches tcg_cc_sttcg_next_wrapper_numFrontendResultFrontendTypecheckIfLclEnvif_modif_bootif_loc if_nsubstif_implicits_env if_tv_env if_id_envIfGblEnvif_doc if_rec_types RewriteEnvREre_loc re_flavour re_eq_rel re_rewritersEnvenv_topenv_umenv_gblenv_lclTcMRnMIfLIfGIfMTcRnTcRnIf NameShape ns_mod_name ns_exportsns_map TcPluginOkTcPluginContradictiontcVisibleOrphanMods bootExports pushErrCtxtpushErrCtxtSameOriginremoveBindingShadowing getPlatformtopStage topAnnStagetopSpliceStageimpLevel outerLevelthLeveltcTyThingTyCon_maybepprTcTyThingCategorytcTyThingCategory pprPECategory peCategory mkModDepsemptyImportAvailsplusImportAvails isPartialSighasCompleteSigunsafeTcPluginTcMmkRoleAnnotEnvemptyRoleAnnotEnvlookupRoleAnnot getRoleAnnots lintGblEnv$fContainsModuleEnv$fContainsLoggerEnv$fContainsHooksEnv$fContainsDynFlagsEnv$fHasOccNameTcBinder$fOutputableTcBinder$fOutputableThStage$fOutputablePromotionErr$fOutputableIdBindingInfo$fOutputableTcTyThing$fOutputableWhereFrom$fOutputableTcIdSigInfo$fOutputableTcIdSigInst$fOutputableTcPatSynInfo$fOutputableTcSigInfo$fOutputableDefaultingProposal$fContainsModuleTcGblEnv$fFunctorTcPluginM$fApplicativeTcPluginM$fMonadTcPluginM$fMonadFailTcPluginMHoleFitPluginR hfPluginInit hfPluginRun hfPluginStop candPlugin fitPlugin FitPlugin CandPlugin TypedHoleth_relevant_cts th_implicsth_holepprHoleFitCandhfIsLcl$fOutputableTypedHole$fOrdHoleFitCandidate$fHasOccNameHoleFitCandidate$fNamedThingHoleFitCandidate$fOutputableHoleFitCandidate$fEqHoleFitCandidate $fOrdHoleFit$fOutputableHoleFit $fEqHoleFitFrontendPluginfrontendFrontendPluginAction staticPlugins loadedPluginsloadedPluginDeps CorePluginPluginRecompileForceRecompileNoForceRecompileMaybeRecompilespPluginlpPluginlpModulePluginWithArgspaPlugin paArgumentsinstallCoreToDostcPlugindefaultingPlugin holeFitPlugin driverPluginpluginRecompileparsedResultActionrenamedResultActiontypeCheckResultActionspliceRunActioninterfaceLoadActionCommandLineOption lpModuleNamepluginRecompile' purePlugin impurePlugin flagRecompile defaultPluginkeepRenamedSourcepluginsWithArgs withPlugins mapPlugins withPlugins_defaultFrontendPlugin$fMonoidPluginRecompile$fSemigroupPluginRecompile$fOutputablePluginRecompile PhaseHookTPhaseT_Unlit T_FileArgsT_CppT_HsPp T_HscRecompT_Hsc T_HscPostTc T_HscBackendT_CmmCppT_CmmT_CcT_As T_LlvmOpt T_LlvmLlc T_LlvmMangleT_MergeForeigndsForeignsHooktcForeignImportsHooktcForeignExportsHookhscFrontendHookhscCompileCoreExprHookghcPrimIfaceHook runPhaseHook runMetaHooklinkHookrunRnSpliceHookgetValueSafelyHookcreateIservProcessHook stgToCmmHookcmmToRawCmmHookDsForeignsHookinitOptCoercionOptsinitSimpleOpts initBCOOpts initEvalOptsunpackClosure#AnyfilterMmapMaybe catMaybes listToMaybe maybeToListfromJust isNothingisJustbytestring-0.10.10.0Data.ByteString.Internal ByteStringData.ByteString.Short.InternalShortByteStringGHC.IO.Handle.TypesHandlegenSymEntryData.Typeable.InternalTypeablealgTcStupidThetaisBoxedRuntimeRep_maybeInt16#Int#Word# plusAddr#rm_emptydowngradeRole_maybe defaultFvDmdCallviewCall isCardNonOnce isCardNonAbs seqSubDmd botSubDmd exnDmdType array-0.5.4.0Data.Array.BaseUArrayD:R:XBreakpointTickishPassStgcollectValBindersunboxedTupleSumKind&&&D:R:XRhsClosureCodeGen AsmTempLabelAsmTempDerivedLabelIdLabelLocalBlockLabel exprOrphNames primOpIdsD:R:NoGhcTcGhcPassdirectory-1.3.6.0System.DirectorygetTemporaryDirectoryAddr#FixIOExceptionD:R:XFunBindGhcPassGhcPassD:R:XFunBindGhcPassGhcPass0mkSmallTupleSelector1eqPmLit eqConLikeHappyStk GHC.Stack.CCS