Lines Matching defs:connector

417 /// root and marking the depth of each connector value (operand). Then we join
418 /// the candidate roots based on the common connector values, taking the one
447   // Map from candidate connector values to their roots and depths. Using a
517         if (!entry.connector /* new edge */ || entry.cost.first > q.depth) {
518           if (!entry.connector)
521           entry.connector = value;
576         // `connector`, violating the optimality of our spanning tree.
633                      << entry.connector.getLoc() << "\n";
681   // up starting from the connector, until the candidate root is reached, and
694     // Determine the connector.
695     Value connector = graph[target][source].connector;
696     assert(connector && "invalid edge");
697     LLVM_DEBUG(llvm::dbgs() << "  * Connector: " << connector.getLoc() << "\n");
699     Position *pos = valueToPosition.lookup(connector);
700     assert(pos && "connector has not been traversed yet");
702     // Traverse from the connector upwards towards the target root.
703     for (Value value = connector; value != target;) {