HomeSort by relevance Sort by last modified time
    Searched refs:q_ (Results 1 - 13 of 13) sorted by null

  /external/vixl/test/
test-utils-a64.h 66 VIXL_ASSERT(sizeof(dump_.q_[0]) == kQRegSizeInBytes);
115 return dump_.q_[code];
178 vec128_t q_[kNumberOfVRegisters];
test-utils-a64.cc 374 const int q_offset = offsetof(dump_t, q_);
  /external/clang/test/Analysis/
uninit-const.cpp 73 void doStuff6_3(int& q_, int *ptr_) {}
  /external/valgrind/drd/tests/
tsan_thread_wrappers_pthread.h 378 CHECK(q_.empty());
385 q_.push(item);
394 mu_.LockWhen(Condition(IsQueueNotEmpty, &q_));
414 std::queue<void*> q_; // protected by mu_ member in class:ProducerConsumerQueue
418 if (q_.empty())
420 *item_ptr = q_.front();
421 q_.pop();
tsan_unittest.cpp 6592 queue<int> q_; member in class:FifoMessageQueue
    [all...]
  /external/freetype/src/base/
ftcalc.c 272 FT_Long q_; local
284 q_ = (FT_Long)q;
286 return s < 0 ? -q_ : q_;
639 FT_Long q_; local
675 q_ = (FT_Long)q;
677 return s < 0 ? -q_ : q_;
  /external/webp/src/enc/
quant.c 191 m->iq_[i] = (1 << QFIX) / m->q_[i];
199 m->q_[i] = m->q_[1];
206 m->sharpen_[i] = (kFreqSharpening[i] * m->q_[i]) >> SHARPEN_BITS;
210 sum += m->q_[i];
225 m->y1_.q_[0] = kDcTable[clip(q + enc->dq_y1_dc_, 0, 127)];
226 m->y1_.q_[1] = kAcTable[clip(q, 0, 127)];
228 m->y2_.q_[0] = kDcTable[ clip(q + enc->dq_y2_dc_, 0, 127)] * 2;
229 m->y2_.q_[1] = kAcTable2[clip(q + enc->dq_y2_ac_, 0, 127)];
231 m->uv_.q_[0] = kDcTable[clip(q + enc->dq_uv_dc_, 0, 117)]
    [all...]
filter.c 282 const int delta = (dqm->max_edge_ * dqm->y2_.q_[1]) >> 3;
vp8enci.h 239 uint16_t q_[16]; // quantizer steps member in struct:VP8Matrix
  /external/webp/src/dsp/
enc.c 611 const uint32_t Q = mtx->q_[j];
637 const uint32_t Q = mtx->q_[j];
enc_mips32.c 203 const uint16_t* ppq = &mtx->q_[0];
    [all...]
enc_sse2.c     [all...]
enc_neon.c     [all...]

Completed in 362 milliseconds