More Details for Interprocedural Register Allocation project on GSoC 2016 page

[vivekvpandya]

Summary

This patch adds draft proposal link, blog URL and status reporting interval details for GSoC 2016 project named "Interprocedural Register Allocation". It also adds a status column to track to progress of project. It may help others looking to move the previous year project forward.

[grosser]

Thank you Vivek for pushing this forward (and sorry for having dropped your name in the original file).

I think this already goes in the right direction. Two comments:

1. I would exclude the 'active' for now. It is very likely it will be maintained and at least for now it does not add information as all of you should be active. I suggest to add it at the moment when first projects become known inactive.

2. It would also be nice to add an abstract of your work below the table.

I added Anton in case he wants to give feedback as well as Roman, another GSoC student, who should be able to help you with committing this patch in case you do not have commit access yet.

[vivekvpandya]

The updated patch removes status field, adds abstract for each project as available on GSoC website. Other students are free to change their abstract if required, this patch just provides structure for them.

[grosser]

This looks good to me. Do you have commit access?

[vivekvpandya]

No I don't have commit access. If I recall there was a document on llvm.org about how to request commit access but I am not able to find it.

[grosser]

That's fine. Roman, can you help out here?

[gareevroman]

Sorry, I wasn’t able to commit it earlier. Please check that everything is OK.

[vivekvpandya]

Thanks gareevroman for help changes are upstream now.

*Vivek Pandya*

2016.html

 <!--#include virtual="../header.incl" -->
 
 <div class="www_sectiontitle">Google Summer of Code - 2016</div>
 
 <!-- *********************************************************************** -->
 
 <div class="www_text">
 <style type="text/css">
 .tg  {border-collapse:collapse;border-spacing:0;}
 .tg td{font-family:Arial, sans-serif;font-size:14px;padding:10px 5px;border-style:solid;border-width:1px;overflow:hidden;word-break:normal;}
 .tg th{font-family:Arial, sans-serif;font-size:14px;font-weight:normal;padding:10px 5px;border-style:solid;border-width:1px;overflow:hidden;word-break:normal;}
 .tg .tg-9hbo{font-weight:bold;vertical-align:top}
 .tg .tg-yw4l{vertical-align:top}
+.tg .tg-yw4la{color:#009ACD;font-weight:bold}
 </style>
 <table class="tg">
   <tr>
     <th class="tg-9hbo">Project Name<br></th>
+    <th class="tg-9hbo">Status</th>
     <th class="tg-9hbo">Student</th>
     <th class="tg-9hbo">Mentor</th>
   </tr>
   <tr>
     <td class="tg-yw4l">Better Alias Analysis By Default<br></td>
+    <td class="tg-yw4la">Active<br></td>
     <td class="tg-yw4l">Jia Chen<br></td>
     <td class="tg-yw4l">Hal Finkel / George Burgess IV<br></td>
   </tr>
   <tr>
     <td class="tg-yw4l">Capture Tracking Improvements<br></td>
+    <td class="tg-yw4la">Active<br></td>
     <td class="tg-yw4l">Scott Egerton<br></td>
     <td class="tg-yw4l">Nuno P. Lopes / Mehdi Amini</td>
   </tr>
   <tr>
     <td class="tg-yw4l">Enabling LLVM's self-hosted modules builds using libstdc++<br></td>
+    <td class="tg-yw4la">Active<br></td>
     <td class="tg-yw4l">Bianca-Cristina Cristescu<br></td>
     <td class="tg-yw4l">Vassil Vassilev<br></td>
   </tr>
   <tr>
     <td class="tg-yw4l">Finding and analysing copy-pasted code with clang<br></td>
+    <td class="tg-yw4la">Active<br></td>
     <td class="tg-yw4l">Raphael Isemann<br></td>
     <td class="tg-yw4l">Vassil Vassilev<br></td>
   </tr>
   <tr>
     <td class="tg-yw4l">Improvement of vectorization process in Polly<br></td>
+    <td class="tg-yw4la">Active<br></td>
     <td class="tg-yw4l">Roman Gareev<br></td>
     <td class="tg-yw4l">Tobias Grosser<br></td>
   </tr>
   <tr>
-    <td class="tg-yw4l">Interprocedural Register Allocation in LLVM<br></td>
-    <td class="tg-yw4l">Mehdi Amini<br></td>
-    <td class="tg-yw4l">Hal Finkel<br></td>
+    <td class="tg-yw4l">Interprocedural Register Allocation in LLVM<br>
+      <a href="https://docs.google.com/document/d/1DrsaFJdtxV73Zpns2bEgjATLFcWuaYMPHuvt5THLeLk/edit?usp=sharing" target="_blank">Draft proposal 
+      </a><br/>
+      Reporting Interval : weekly </br>
+      Personal website/blog : <a href="http://vivekvpandya.github.io/" target="_blank">vivekvpandya.github.io 
+      </a><br/>
+    </td>
+    <td class="tg-yw4la">Active<br></td>
+    <td class="tg-yw4l">Vivek Pandya<br></td>
+    <td class="tg-yw4l">Mehdi Amini, Hal Finkel<br></td>
   </tr>
   <tr>
     <td class="tg-yw4l">Polly as an Analysis Pass in LLVM<br></td>
+    <td class="tg-yw4la">Active<br></td>
     <td class="tg-yw4l">Utpal Boral<br></td>
     <td class="tg-yw4l">Johannes Doerfert<br></td>
   </tr>
   <tr>
     <td class="tg-yw4l">SAFECode's Memory Policy Hardening<br></td>
+    <td class="tg-yw4la">Active<br></td>
     <td class="tg-yw4l">Zhengyang Liu<br></td>
     <td class="tg-yw4l">John Criswell<br></td>
   </tr>
   <tr>
     <td class="tg-yw4l">Enabiling Polyhedral Optimizations in Julia (funded by Julia)<br></td>
+    <td class="tg-yw4la">Active<br></td>
     <td class="tg-yw4l">Matthias Reisinger<br></td>
     <td class="tg-yw4l">Tobias Grosser, Tim Holy, Jameson<br></td>
   </tr>
 </table>
 
 </div>
 
 <hr>