Lines Matching defs:ed
195 EdgeData &ed = getHeuristicEdgeData(eId);
196 ed.isUpToDate = false;
267 EdgeData &ed = getHeuristicEdgeData(eId);
268 (void)ed;
269 assert(ed.isUpToDate && "Edge data is not up to date.");
308 EdgeData &ed = getHeuristicEdgeData(eId);
310 if (ed.isUpToDate)
321 ed.worst = 0;
322 ed.reverseWorst = 0;
323 ed.unsafe.clear();
324 ed.unsafe.resize(numRegs, 0);
325 ed.reverseUnsafe.clear();
326 ed.reverseUnsafe.resize(numReverseRegs, 0);
332 ed.unsafe[i] = 1;
333 ed.reverseUnsafe[j] = 1;
337 if (colInfCounts[j] > ed.worst) {
338 ed.worst = colInfCounts[j];
341 if (rowInfCounts[i] > ed.reverseWorst) {
342 ed.reverseWorst = rowInfCounts[i];
348 ed.isUpToDate = true;
356 EdgeData &ed = getHeuristicEdgeData(eId);
358 assert(ed.isUpToDate && "Using out-of-date edge numbers.");
365 nIsNode1 ? ed.unsafe : ed.reverseUnsafe;
366 nd.numDenied += nIsNode1 ? ed.worst : ed.reverseWorst;
383 EdgeData &ed = getHeuristicEdgeData(eId);
385 assert(ed.isUpToDate && "Using out-of-date edge numbers.");
392 nIsNode1 ? ed.unsafe : ed.reverseUnsafe;
393 nd.numDenied -= nIsNode1 ? ed.worst : ed.reverseWorst;