Lines Matching defs:N
123 for (auto &N : Nodes)
124 N.Bucket = Offset++;
143 llvm::partition(Nodes, [&](auto &N) { return N.Bucket == LeftBucket; });
171 for (auto &N : Nodes)
172 for (auto &UN : N.UtilityNodes)
176 for (auto &N : Nodes)
177 llvm::erase_if(N.UtilityNodes, [&](auto &UN) {
183 for (auto &N : Nodes)
184 for (auto &UN : N.UtilityNodes)
189 for (auto &N : Nodes) {
190 for (auto &UN : N.UtilityNodes) {
192 if (N.Bucket == LeftBucket) {
233 for (auto &N : Nodes) {
234 bool FromLeftToRight = (N.Bucket == LeftBucket);
235 float Gain = moveGain(N, FromLeftToRight, Signatures);
236 Gains.push_back(std::make_pair(Gain, &N));
268 bool BalancedPartitioning::moveFunctionNode(BPFunctionNode &N,
278 bool FromLeftToRight = (N.Bucket == LeftBucket);
280 N.Bucket = (FromLeftToRight ? RightBucket : LeftBucket);
284 for (auto &UN : N.UtilityNodes) {
291 for (auto &UN : N.UtilityNodes) {
310 for (auto &N : llvm::make_range(Nodes.begin(), NodesMid))
311 N.Bucket = StartBucket;
312 for (auto &N : llvm::make_range(NodesMid, Nodes.end()))
313 N.Bucket = StartBucket + 1;
316 float BalancedPartitioning::moveGain(const BPFunctionNode &N,
320 for (auto &UN : N.UtilityNodes)