Lines Matching refs:ed
196 EdgeData &ed = getHeuristicEdgeData(eItr);
197 ed.isUpToDate = false;
268 EdgeData &ed = getHeuristicEdgeData(eItr);
269 (void)ed;
270 assert(ed.isUpToDate && "Edge data is not up to date.");
309 EdgeData &ed = getHeuristicEdgeData(eItr);
311 if (ed.isUpToDate)
322 ed.worst = 0;
323 ed.reverseWorst = 0;
324 ed.unsafe.clear();
325 ed.unsafe.resize(numRegs, 0);
326 ed.reverseUnsafe.clear();
327 ed.reverseUnsafe.resize(numReverseRegs, 0);
333 ed.unsafe[i] = 1;
334 ed.reverseUnsafe[j] = 1;
338 if (colInfCounts[j] > ed.worst) {
339 ed.worst = colInfCounts[j];
342 if (rowInfCounts[i] > ed.reverseWorst) {
343 ed.reverseWorst = rowInfCounts[i];
349 ed.isUpToDate = true;
357 EdgeData &ed = getHeuristicEdgeData(eItr);
359 assert(ed.isUpToDate && "Using out-of-date edge numbers.");
366 nIsNode1 ? ed.unsafe : ed.reverseUnsafe;
367 nd.numDenied += nIsNode1 ? ed.worst : ed.reverseWorst;
384 EdgeData &ed = getHeuristicEdgeData(eItr);
386 assert(ed.isUpToDate && "Using out-of-date edge numbers.");
393 nIsNode1 ? ed.unsafe : ed.reverseUnsafe;
394 nd.numDenied -= nIsNode1 ? ed.worst : ed.reverseWorst;
