FSE 2008

288 views

Published on

Published in: Technology, Education
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
288
On SlideShare
0
From Embeds
0
Number of Embeds
6
Actions
Shares
0
Downloads
2
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide
  • FSE 2008

    1. 3.
    2. 4.
    3. 5.
    4. 7.
    5. 8.
    6. 9.
    7. 10.
    8. 13.
    9. 14.
    10. 15.
    11. 16. 0 1 2 0 1 2
    12. 17.
    13. 18.
    14. 19.
    15. 20.
    16. 21.
    17. 22.
    18. 23.
    19. 24.
    20. 25.
    21. 26.
    22. 27.
    23. 28.
    24. 32.
    25. 33.
    26. 34.
    27. 35.
    28. 36.
    29. 37.
    30. 38.
    31. 40.
    32. 41.
    33. 42.
    34. 43.
    35. 44.
    36. 47. public Block isMu(...) { ... final Iterator iter = cfg.preds(phi.block()).iterator(); final Block pred1 = (Block) iter.next(); final Block pred2 = (Block) iter.next();
    37. 48. while (c == null && enumMap.hasMoreElements()) { ... if (!enumC.hasMoreElements()) c = null ; } // At this point, c == null if there are no more elements, // and otherwise is the first collection with a free element // (with enumC set up to return that element). if (c == null ) { // no more elements, so return null; return ( null ); } else { Perm answer = (Perm) enumC.nextElement(); ...
    38. 49. private final void FillBuff() { ... try { if ((i = inputStream.read(...)) == -1) { inputStream.close(); throw new java.io.IOException(); } else maxNextCharInd += i; return ; } ... }
    39. 50. static String getLine(BufferedReader reader, int line) { if (reader == null) return &quot;&quot;; try { String text=null; for(int i=0; i < line; i++) { text = reader.readLine(); } return text; } catch (IOException ioe) { return null; } }
    40. 51. private List markUsages(IDataFlowNode inode) { ... for (Iterator k = ((List)entry.getValue()) .iterator();k.hasNext();) { addAccess( k , inode); } ... } ... private void addAccess( Iterator k , IDataFlowNode inode) { NameOccurrence occurrence = (NameOccurrence) k.next(); ... }
    41. 52. private List markUsages(IDataFlowNode inode) { ... for (NameOccurrence occurrence: entry.getValue()) { addAccess(occurrence, inode); } ... } ... private void addAccess(NameOccurrence occurrence, IDataFlowNode inode) { ... }
    42. 53. public Iterator iterator() { return new Iterator() { Iterator i = list.iterator(); public void remove() { throw new UnsupportedOperationException(); } public boolean hasNext() { return i.hasNext(); } public Object next() { return i.next(); } }; }

    ×