56         Node[] opt = new Node[numBreaks];  in computeBreaks()  local
57         opt[0] = new Node(-1, 0, 0, 0, false);  in computeBreaks()
58         opt[numBreaks - 1] = new Node(-1, 0, 0, 0, false);  in computeBreaks()
72                     int lines = opt[pos].mPrevCount;  in computeBreaks()
82                                 finalBreak, p.penalty) + opt[pos].mDemerits;  in computeBreaks()
85                                 bestBreak = new Node(pos, opt[pos].mPrevCount + 1, demerits,  in computeBreaks()
89                                 bestBreak.mPrevCount = opt[pos].mPrevCount + 1;  in computeBreaks()
103                     opt[i] = bestBreak;  in computeBreaks()
110                     int lines = opt[lastBreak].mPrevCount;  in computeBreaks()
113                     opt[breakIndex] = new Node(lastBreak, lines + 1, 0 /*doesn't matter*/,  in computeBreaks()
123         int count = opt[idx].mPrevCount;  in computeBreaks()
125         while (opt[idx].mPrev != -1) {  in computeBreaks()
130             breakInfo.widths[count] = opt[idx].mWidth;  in computeBreaks()
131             breakInfo.flags [count] = opt[idx].mHasTabs ? TAB_MASK : 0;  in computeBreaks()
132             idx = opt[idx].mPrev;  in computeBreaks()