Lines Matching +defs:C +defs:Q
185 Node C = conj(I);
190 if (Needed.count(C))
191 Is.insert(C);
198 SetVector<Node> Q;
199 Q.insert(N);
200 for (unsigned I = 0; I != Q.size(); ++I) {
201 NodeSet &Ns = Edges[Q[I]];
202 Q.insert(Ns.begin(), Ns.end());
204 FirstQ.insert(Q.begin(), Q.end());
248 Node C = conj(N);
251 NodeSet &Cs = Edges[C];
256 // Connect M with C, disconnect M from N.
258 Edges[M].insert(C);
264 Colors[C] = ColorC;
299 auto ColorKindToName = [](ColorKind C) {
300 switch (C) {
312 for (auto C : Colors)
313 dbgs() << " " << C.first << " -> " << ColorKindToName(C.second) << "\n";
356 unsigned C = ctl(I, StartAt+L) == Switch;
358 W |= C << (Log-1-L);
360 W |= C << L;
493 ColorKind C = M.at(I);
494 if (C == ColorKind::None)
501 ColorUp = InpUp ? C : G.other(C);
502 if ((C == ColorUp) != InpUp) {
565 ColorKind C = M.at(I);
566 if (C == ColorKind::None)
572 if (C == ColorUp) {
1414 // Q = V6_pred_scalar2 SegLen
1415 // V = V6_vmux Q, (Va, Vb) or (Vb, Va)
1611 OpRef C = contracting(SM, Va, Vb, Results);
1612 if (C.isValid())
1613 return C;
1715 Deleter(SelectionDAG &D, T &C)
1716 : SelectionDAG::DAGNodeDeletedListener(D, [&C] (SDNode *N, SDNode *E) {
1717 C.erase(N);
1960 // then if any other word Q matches any of the possibilities matched by P,
1961 // then Q matches all the possibilities matched by P. In fact, P == Q.
1962 // In other words, for each words P, Q, the sets of possibilities matched
1963 // by P and Q are either equal or disjoint (no partial overlap).
1983 // Assume there is Q that matches s1. Note that since P and Q came from
1984 // the same shuffle mask, the positions of unknown bits in P and Q match
1986 // between P and Q. Since P matches s0 and s1, the known bits of P much
1987 // match both s0 and s1. Also, since Q matches s1, the known bits in Q
1989 // same as in P. This implies that P == Q.
2005 for (unsigned &Q : Worklist) {
2006 if (Q == P)
2007 Q = 0;
2039 for (uint32_t C : Comps) {
2040 assert(isPowerOf2_32(C));
2041 OrAll |= C;
2254 // { 0, 8, 1, 9, 2, A, 3, B, 4, C, 5, D, 6, E, 7, F }.
2258 // 0 1 2 3 4 5 6 7 --> 0 8 1 9 2 A 3 B 4 C 5 D 6 E 7 F [*]
2259 // 8 9 A B C D E F
2277 // 0 8 2 A 4 C 6 E
2280 // 08 19 4C 5D
2286 // 0 8 1 9 2 A 3 B 4 C 5 D 6 E 7 F
2314 // 5 0 1 0 1 C 1 1 0 0 C 1 1 0 0 A 1 0 1 0
2318 // 9 1 0 0 1 9 1 0 0 1 A 1 0 1 0 C 1 1 0 0
2321 // C 1 1 0 0 5 0 1 0 1 6 0 1 1 0 6 0 1 1 0
2383 auto canonicalize = [LogLen](const CycleType &C) -> CycleType {
2384 unsigned LogPos, N = C.size();
2386 if (C[LogPos] == LogLen - 1)
2389 return C;
2391 CycleType NewC(C.begin() + LogPos, C.end());
2392 NewC.append(C.begin(), C.begin() + LogPos);
2401 const CycleType &C = *Cs.begin();
2402 if (C[0] != Len - 1)
2404 int D = Len - C.size();
2410 if (C[I] != Len - 1 - I)
2412 if (C[I] != I - (1 - D)) // I-1, I
2425 CycleType C;
2426 C.push_back(A);
2428 C.push_back(B);
2431 if (C.size() <= 1)
2433 Cycles.insert(canonicalize(C));
2466 for (const CycleType &C : Cycles) {
2468 unsigned First = (C[0] == LogLen - 1) ? 1 : 0;
2469 SwapElems.append(C.begin() + First, C.end());
2471 SwapElems.push_back(C[0]);
2564 for (uint8_t C : Data)
2565 Elems.push_back(DAG.getConstant(C, dl, MVT::i8));