Home
last modified time | relevance | path

Searched refs:IsPowerOf2 (Results 1 – 8 of 8) sorted by relevance

/external/vixl/src/vixl/
Dcompiler-intrinsics.cc33 VIXL_ASSERT(IsPowerOf2(width) && (width <= 64)); in CountLeadingSignBitsFallBack()
43 VIXL_ASSERT(IsPowerOf2(width) && (width <= 64)); in CountLeadingZerosFallBack()
78 VIXL_ASSERT(IsPowerOf2(width) && (width <= 64)); in CountSetBitsFallBack()
113 VIXL_ASSERT(IsPowerOf2(width) && (width <= 64)); in CountTrailingZerosFallBack()
Dcompiler-intrinsics.h85 inline bool IsPowerOf2(V value) { in IsPowerOf2() function
Dutils.h195 VIXL_ASSERT(IsPowerOf2(value)); in WhichPowerOf2()
/external/vixl/src/vixl/a64/
Dcpu-a64.cc99 VIXL_ASSERT(IsPowerOf2(dsize)); in EnsureIAndDCacheCoherency()
100 VIXL_ASSERT(IsPowerOf2(isize)); in EnsureIAndDCacheCoherency()
Dassembler-a64.h267 VIXL_ASSERT(IsPowerOf2(lanes_) && (lanes_ <= 16)); in VRegister()
271 VIXL_ASSERT(IsPowerOf2(lanes_) && (lanes_ <= 16)); in CPURegister()
276 VIXL_ASSERT(IsPowerOf2(lanes_) && (lanes_ <= 16)); in VRegister()
Dassembler-a64.cc5174 if (!IsPowerOf2(d)) { in IsImmLogical()
/external/v8/src/compiler/
Dmachine-operator-reducer.cc208 if (m.right().IsPowerOf2()) { // x * 2^n => x << n in Reduce()
243 if (m.right().IsPowerOf2()) { // x / 2^n => x >> n in Reduce()
272 if (m.right().IsPowerOf2()) { // x % 2^n => x & 2^n-1 in Reduce()
Dnode-matchers.h73 bool IsPowerOf2() const { in IsPowerOf2() function