How do I parallelize a Fortran code with SUIF 1?

You can use the provided parallelization driver:
pscc -parallel program.f

This driver executes a series of passes to parallelize a code.

  1. SF2C
    2. : first pass of the SUIF Fortran 77 front end
  2. CPP
    3. : preprocess
  3. SNOOT
    4. : translate pre-processed C to SUIF
  4. FIXFORTRAN
    5. : final processing for the SUIF Fortran 77 front end
  5. ENTRY_TYPES
    6. : propagate parameter type info for Fortran entry points
  6. PORKY_PRE_DEFAULTS
    PORKY_DEFAULTS
    7. : This does the default options to be used right after the front end, to turn some non-standard SUIF that the front end produces into standard SUIF. It also does some things, like constant folding and removing empty symbol tables, to make the code as simple as possible without losing information. It is equivalent to all of the options:
  7. PORKY_LINE_FIX
    8. : This removes all mark instructions that contain nothing but line information that is followed immediately by another line information mark.
  8. LINKSUIF
    9. : combine SUIF files into a file set.
  9. PORKY_UCF_OPT
    10. : Do simple optimizations on unstructured control flow (branches and labels).
  10. PORKY_DEAD_CODE1
    11. : Simple dead-code elimination.
  11. STRUCTURE
    12. : structure control flow.
  12. PORKY_FOLD1
    13. : This folds constants wherever possible.
  13. PORKY_FIND_FORS
    14. : This builds tree_for nodes out of tree_loop nodes for which a suitable index variable and bounds can be found.
  14. PORKY_CONST1
    15. : Simple constant propagation.
  15. PORKY_FOLD2
    16. :
  16. PORKY_COPY_PROP
    17. : This does copy propagation, which is the same as forward propagation limited to expressions that are simple local variables (i.e. if there is a simple copy from one local variable into another, uses of the source variable will replace the destination variable where the copy is live).
  17. PORKY_DEAD_CODE2
    18. :
  18. PORKY_UNUSED1
    19. : This removes types and symbols that are never referenced and have no external linkage, or that have external linkage but are not defined in this file (i.e. no procedure body or var_def).
  19. PORKY_EMPTY_TABLE1
    20. : This dismantles all TREE_BLOCKs that have empty symbol tables.
  20. PORKY_EMPTY_FOR1
    21. : This dismantles TREE_FORs with empty bodies.
  21. PORKY_CONTROL_SIMP1
    22. : This simplifies TREE_IFs for which this pass can tell that one branch or the other always executes, leaving only the instructions from the branch that executes and any parts of the test section that might have side effects.
  22. PORKY_FORWARD_PROP1
    23. : move as much computation as possible into the bound expressions of each loop
  23. PORKY_FOLD3
    24. :
  24. PORKY_DEAD_CODE3
    25. :
  25. PORKY_LOOP_COND
    26. : Move all loop-invariant conditionals that are inside a TREE_LOOP or TREE_FOR outside the outermost loop.
  26. PORKY_FORWARD_PROP2
    27. :
  27. PORKY_FOLD4
    28. :
  28. PORKY_DEAD_CODE4
    29. :
  29. PORKY_UNUSED2
    30. :
  30. PORKY_EMPTY_TABLE2
    31. :
  31. PORKY_EMPTY_FOR2
    32. :
  32. PORKY_CONTROL_SIMP2
    33. :
  33. PORKY_LOOP_INVARIANTS1
    34. :This moves the calculation of loop-invariant expressions outside loop bodies.
  34. PORKY_FORWARD_PROP3
    35. :
  35. PORKY_CSE1
    36. : This does simple common sub-expression elimination.
  36. PORKY_CONST2
    37. : This does simple constant propagation.
  37. PORKY_SCALARIZE
    38. : This turns local array variables into collections of element variables when all uses of the array are loads or stores of known elements. It will partly scalarize multi-dimensional arrays if they can be scalarized in some but not all dimensions.
  38. PORKY_FORWARD_PROP4
    39. :
  39. PORKY_CONST3
    40. :
  40. NORMALIZE
    41. :
  41. PORKY_IVAR1
    42. : This does simple induction variable detection.
  42. PORKY_IVAR2
    43. :
  43. PORKY_IVAR3
    44. :
  44. PORKY_KNOW_BOUNDS
    45. : This replaces comparisons of upper and lower bounds of a loop inside the loop body with the known result of that comparison. This is particularly useful after multi-level induction variables have been replaced.
  45. PORKY_CONST4
    46. :
  46. PORKY_FOLD5
    47. :
  47. SCE0
    48. :
  48. REDUCTIONS
    49. :
  49. PORKY_EMPTY_FOR3
    50. :
  50. PREDEP
    51. :
  51. PORKY_DEAD_CODE5
    52. :
  52. SKWEEL
    53. :
  53. PORKY_UNCBR
    54. : Replace call-by-reference scalar variables with copy-in, copy-out. This is useful when a later pass, such as a back-end compiler after s2c will not have access to call-by-ref form.
  54. PGEN
    55. :
  55. PORKY_FOLD6
    56. :
  56. PORKY_FORWARD_PROP5
    57. :
  57. PORKY_DEAD_CODE6
    58. :
  58. PORKY_LOOP_INVARIANTS2
    59. :
  59. PORKY_FORWARD_PROP6
    60. :
  60. PORKY_CSE2
    61. :
  61. PORKY_DEAD_CODE7
    62. :
  62. CFORM
    63. : translate inside SUIF from Fortran to C form.
  63. PORKY_UNUSED3
    64. :
  64. S2C
    65. : convert a SUIF file to C
  65. BACKEND_CC
    66. : Use cc or gcc.
  66. LD
    67. : ld.

(See the man pages provided with the SUIF distribution for more. Much of this data was gathered from the man pages.)