55         for (size_t idx = 0; idx < bbGatesList.size(); idx++) {  in CalculateDominatorTree()  local
56             bbGatesAddrToIdx[bbGatesList[idx]] = idx;  in CalculateDominatorTree()
66         std::function<size_t(size_t)> unionFind = [&] (size_t idx) -> size_t {  in CalculateDominatorTree()  argument
67             size_t pIdx = parent[idx];  in CalculateDominatorTree()
68             if (pIdx == idx) {  in CalculateDominatorTree()
69                 return idx;  in CalculateDominatorTree()
72             if (semiDom[minIdx[idx]] > semiDom[minIdx[pIdx]]) {  in CalculateDominatorTree()
73                 minIdx[idx] = minIdx[pIdx];  in CalculateDominatorTree()
75             return parent[idx] = unionFindSetRoot;  in CalculateDominatorTree()
84         for (size_t idx = bbGatesList.size() - 1; idx >= 1; idx--) {  in CalculateDominatorTree()  local
86             acc.GetInStates(bbGatesList[idx], preGates);  in CalculateDominatorTree()
90                     if (preGateIdx < idx) {  in CalculateDominatorTree()
91                         semiDom[idx] = std::min(semiDom[idx], preGateIdx);  in CalculateDominatorTree()
94                         semiDom[idx] = std::min(semiDom[idx], semiDom[minIdx[preGateIdx]]);  in CalculateDominatorTree()
98             for (const auto &succDomIdx : semiDomTree[idx]) {  in CalculateDominatorTree()
100                 if (idx == semiDom[minIdx[succDomIdx]]) {  in CalculateDominatorTree()
101                     immDom[succDomIdx] = idx;  in CalculateDominatorTree()
106             minIdx[idx] = idx;  in CalculateDominatorTree()
107             merge(dfsFatherIdx[bbGatesList[idx]], idx);  in CalculateDominatorTree()
108             semiDomTree[semiDom[idx]].push_back(idx);  in CalculateDominatorTree()
110         for (size_t idx = 1; idx < bbGatesList.size(); idx++) {  in CalculateDominatorTree()  local
111             if (immDom[idx] != semiDom[idx]) {  in CalculateDominatorTree()
112                 immDom[idx] = immDom[immDom[idx]];  in CalculateDominatorTree()
134     for (size_t idx = 0; idx < bbGatesList.size(); idx++) {  in Run()  local
135         result[idx].push_back(bbGatesList[idx]);  in Run()
139     for (size_t idx = 1; idx < immDom.size(); idx++) {  in Run()  local
140         sonList[immDom[idx]].push_back(idx);  in Run()
152             size_t idx;  in Run()  member
167             auto &idx = curState.idx;  in Run()  local
168             if (idx == succList.size()) {  in Run()
173             const auto &succ = succList[idx];  in Run()
181             idx++;  in Run()
241         size_t idx = 0;  in CalculateSchedulingUpperBound()  member
282             auto &idx = curState.idx;  in CalculateSchedulingUpperBound()  local
284             if (idx == predGates.size()) {  in CalculateSchedulingUpperBound()
305                 idx++;  in CalculateSchedulingUpperBound()
307                 const auto &predGate = predGates[idx];  in CalculateSchedulingUpperBound()
358         size_t idx = 0;  in CalculateSchedulingLowerBound()  member
370             auto &idx = curState.idx;  in CalculateSchedulingLowerBound()  local
371             if (idx == prevGates.size()) {  in CalculateSchedulingLowerBound()
375             const auto &prevGate = prevGates[idx];  in CalculateSchedulingLowerBound()
377                 ++idx;  in CalculateSchedulingLowerBound()
387             ++idx;  in CalculateSchedulingLowerBound()
393         size_t idx = 0;  in CalculateSchedulingLowerBound()  member
407             auto &idx = curState.idx;  in CalculateSchedulingLowerBound()  local
408             if (idx == prevGates.size()) {  in CalculateSchedulingLowerBound()
412             const auto &prevGate = prevGates[idx];  in CalculateSchedulingLowerBound()
414                 ++idx;  in CalculateSchedulingLowerBound()
422                 ASSERT(idx > 0);  in CalculateSchedulingLowerBound()
423                 curLowerBound = bbGatesAddrToIdx.at(acc.GetIn(acc.GetIn(curGate, 0), idx - 1));  in CalculateSchedulingLowerBound()
442             ++idx;  in CalculateSchedulingLowerBound()