Lines Matching full:labels
34 // The purpose of adjustment is to assign indexes to Labels of a program 'p' to
35 // make the sequence of indexes similar to a 'model' program 'm'. Labels
52 // we can quickly find Labels adjacent in address order.
101 // adjacent labels will have the same RVA difference.
106 // labels correspond.
109 // likely that the labels near the corresponding labels also match. A
110 // conservative way of extending the match is to assign only those labels
113 // * If two labels correspond, then we can try to match up the references
114 // before and after the labels in the reference stream. For this to be
130 // references contains the distribution of labels following the string. The
132 // labels within the label reference stream.
364 // Since following labels are no longer in address lockstep, assume
604 // TODO(sra): we could simply append all the labels in index order to
608 // single-occurrence labels.
