f8.pkl

version = 1.24

• nuids = 8
• nlabels = 6
• items = item list
  2. Type : item
     • uid = 2
     • type = INT : type
       • size = 4
       • align = 4
  7. Type : item
     • uid = 7
     • type = FUNCTION : type
       • size = 0
       • align = 0
       • type = 2
       • formals = int list 2 2
  1. Symbol : item
     • uid = 1
     • symbol = symbol
       • id = compare
       • type = 7
       • scope = GLOBAL
       • sclass = AUTO
       • ref = 0
       • flags = 0
• interfaces = interface list
  1. Export : interface
     • p = 1
  2. Segment : interface
     • seg = CODE
  3. Local : interface
     • uid = 3
     • p = symbol
       • id = a
       • type = 2
       • scope = PARAM
       • sclass = AUTO
       • ref = 0
       • flags = 0
  4. Local : interface
     • uid = 4
     • p = symbol
       • id = b
       • type = 2
       • scope = PARAM
       • sclass = AUTO
       • ref = 0
       • flags = 0
  5. Local : interface
     • uid = 5
     • p = symbol
       • id = a
       • type = 2
       • scope = PARAM
       • sclass = AUTO
       • ref = 15000
       • flags = 0
  6. Local : interface
     • uid = 6
     • p = symbol
       • id = b
       • type = 2
       • scope = PARAM
       • sclass = AUTO
       • ref = 15000
       • flags = 0
  7. Function : interface
     • f = 1
     • caller = int list 3 4
     • callee = int list 5 6
     • ncalls = 0
     • codelist = interface list
       1. Blockbeg : interface
       2. Forest : interface
          • nodes = node list
            1. Compare : node
               • suffix = I
               • size = 4
               • op = GE
               • left = Unary : node
                 • suffix = I
                 • size = 4
                 • op = INDIR
                 • left = ADDRF : node
                   • suffix = P
                   • size = 4
                   • uid = 5
               • right = Unary : node
                 • suffix = I
                 • size = 4
                 • op = INDIR
                 • left = ADDRF : node
                   • suffix = P
                   • size = 4
                   • uid = 6
               • label = 2
       3. Forest : interface
          • nodes = node list
            1. Unary : node
               • suffix = I
               • size = 4
               • op = RET
               • left = CNST : node
                 • suffix = I
                 • size = 4
                 • value = -1
       4. Forest : interface
          • nodes = node list
            1. BRANCH : node
               • suffix = V
               • size = 0
               • label = 1
       5. Forest : interface
          • nodes = node list
            1. LABEL : node
               • suffix = V
               • size = 0
               • label = 2
       6. Forest : interface
          • nodes = node list
            1. Compare : node
               • suffix = I
               • size = 4
               • op = NE
               • left = Unary : node
                 • suffix = I
                 • size = 4
                 • op = INDIR
                 • left = ADDRF : node
                   • suffix = P
                   • size = 4
                   • uid = 5
               • right = Unary : node
                 • suffix = I
                 • size = 4
                 • op = INDIR
                 • left = ADDRF : node
                   • suffix = P
                   • size = 4
                   • uid = 6
               • label = 4
       7. Forest : interface
          • nodes = node list
            1. Unary : node
               • suffix = I
               • size = 4
               • op = RET
               • left = CNST : node
                 • suffix = I
                 • size = 4
                 • value = 0
       8. Forest : interface
          • nodes = node list
            1. BRANCH : node
               • suffix = V
               • size = 0
               • label = 1
       9. Forest : interface
          • nodes = node list
            1. LABEL : node
               • suffix = V
               • size = 0
               • label = 4
       10. Forest : interface
           • nodes = node list
             1. Unary : node
                • suffix = I
                • size = 4
                • op = RET
                • left = CNST : node
                  • suffix = I
                  • size = 4
                  • value = 1
       11. Blockend : interface
       12. Forest : interface
           • nodes = node list
             1. LABEL : node
                • suffix = V
                • size = 0
                • label = 1
• argc = 5
• argv = string list
  1. 24,'E:\APPS\LCC\BIN\rcc.exe'
  2. 18,'-target=x86/win32'
  3. 6,'-asdl'
  4. 46,'C:\DOCUME~1\ADMINI~1\LOCALS~1\Temp\lcc15040.i'
  5. 7,'f8.pkl'