<html>
    <head>
      <base href="http://llvm.org/bugs/" />
    </head>
    <body><table border="1" cellspacing="0" cellpadding="8">
        <tr>
          <th>Bug ID</th>
          <td><a class="bz_bug_link 
          bz_status_NEW "
   title="NEW --- - Add an option to allow an exhaustive search during last chance recoloring"
   href="http://llvm.org/bugs/show_bug.cgi?id=18747">18747</a>
          </td>
        </tr>

        <tr>
          <th>Summary</th>
          <td>Add an option to allow an exhaustive search during last chance recoloring
          </td>
        </tr>

        <tr>
          <th>Product</th>
          <td>libraries
          </td>
        </tr>

        <tr>
          <th>Version</th>
          <td>trunk
          </td>
        </tr>

        <tr>
          <th>Hardware</th>
          <td>All
          </td>
        </tr>

        <tr>
          <th>OS</th>
          <td>All
          </td>
        </tr>

        <tr>
          <th>Status</th>
          <td>NEW
          </td>
        </tr>

        <tr>
          <th>Severity</th>
          <td>enhancement
          </td>
        </tr>

        <tr>
          <th>Priority</th>
          <td>P
          </td>
        </tr>

        <tr>
          <th>Component</th>
          <td>Register Allocator
          </td>
        </tr>

        <tr>
          <th>Assignee</th>
          <td>unassignedbugs@nondot.org
          </td>
        </tr>

        <tr>
          <th>Reporter</th>
          <td>qcolombet@apple.com
          </td>
        </tr>

        <tr>
          <th>CC</th>
          <td>llvmbugs@cs.uiuc.edu
          </td>
        </tr>

        <tr>
          <th>Classification</th>
          <td>Unclassified
          </td>
        </tr></table>
      <p>
        <div>
        <pre>Since r200883, the greedy register allocator features a last chance recoloring
mechanism.
This mechanism allows to find a valid assignment of the variables (if any) when
the regular heuristic fails.
It uses a backtracking algorithm which is currently cutoff with some heuristics
to avoid uncontrolled compile time.

There is two things to improve here:
1. When the assignment fails because of the early cutoffs, this should be
reported instead of the current obscur “ran out of registers”.
2. We should provide an option (e.g., -fexhaustive-register-search) to allow to
explore all the possibilities when the allocation failed because of a cutoffs
(which we would know thanks to 1.).

For testing the reporting in 1., one can use the test-case of r200883 and
artificially cut the search space with:
- lcr-max-depth=<uint>
- lcr-max-interf=<uint></pre>
        </div>
      </p>
      <hr>
      <span>You are receiving this mail because:</span>
      
      <ul>
          <li>You are on the CC list for the bug.</li>
      </ul>
    </body>
</html>