Searched refs:RMS (Results 1 - 3 of 3) sorted by relevance

/freebsd-13-stable/contrib/bearssl/src/hash/
H A Dghash_ctmul64.c61 #define RMS(m, s) do { \ macro
66 RMS(0x5555555555555555, 1);
67 RMS(0x3333333333333333, 2);
68 RMS(0x0F0F0F0F0F0F0F0F, 4);
69 RMS(0x00FF00FF00FF00FF, 8);
70 RMS(0x0000FFFF0000FFFF, 16);
73 #undef RMS macro
H A Dghash_ctmul32.c80 #define RMS(m, s) do { \ macro
85 RMS(0x55555555, 1);
86 RMS(0x33333333, 2);
87 RMS(0x0F0F0F0F, 4);
88 RMS(0x00FF00FF, 8);
91 #undef RMS macro
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DRegAllocGreedy.cpp2244 ArrayRef<SlotIndex> RMS = LIS->getRegMaskSlotsInBlock(BI.MBB->getNumber()); local
2245 LLVM_DEBUG(dbgs() << RMS.size() << " regmasks in block:");
2248 llvm::lower_bound(RMS, Uses.front().getRegSlot()) - RMS.begin();
2249 unsigned re = RMS.size();
2251 // Look for Uses[i] <= RMS <= Uses[i+1].
2252 assert(!SlotIndex::isEarlierInstr(RMS[ri], Uses[i]));
2253 if (SlotIndex::isEarlierInstr(Uses[i+1], RMS[ri]))
2257 if (SlotIndex::isSameInstr(Uses[i+1], RMS[ri]) && i+1 == NumGaps)
2259 LLVM_DEBUG(dbgs() << ' ' << RMS[r
[all...]

Completed in 180 milliseconds