q_                391 google_apis/drive/drive_api_requests.cc   return url_generator_.GetFilesListUrl(max_results_, page_token_, q_);
q_                334 google_apis/drive/drive_api_requests.h   const std::string& q() const { return q_; }
q_                335 google_apis/drive/drive_api_requests.h   void set_q(const std::string& q) { q_ = q; }
q_                345 google_apis/drive/drive_api_requests.h   std::string q_;
q_                219 skia/ext/recursive_gaussian_convolution.cc   computeCoefficients(q_, b_);
q_                 36 skia/ext/recursive_gaussian_convolution.h   float q_;
q_                637 third_party/libwebp/dsp/enc.c       const int Q = mtx->q_[j];
q_                662 third_party/libwebp/dsp/enc.c       const int Q = mtx->q_[j];
q_                827 third_party/libwebp/dsp/enc_sse2.c   const __m128i q0 = _mm_loadu_si128((__m128i*)&mtx->q_[0]);
q_                828 third_party/libwebp/dsp/enc_sse2.c   const __m128i q8 = _mm_loadu_si128((__m128i*)&mtx->q_[8]);
q_                456 third_party/libwebp/enc/filter.c       const int delta = (dqm->max_edge_ * dqm->y2_.q_[1]) >> 3;
q_                191 third_party/libwebp/enc/quant.c     m->iq_[i] = (1 << QFIX) / m->q_[i];
q_                199 third_party/libwebp/enc/quant.c     m->q_[i] = m->q_[1];
q_                206 third_party/libwebp/enc/quant.c       m->sharpen_[i] = (kFreqSharpening[i] * m->q_[i]) >> SHARPEN_BITS;
q_                210 third_party/libwebp/enc/quant.c     sum += m->q_[i];
q_                225 third_party/libwebp/enc/quant.c     m->y1_.q_[0] = kDcTable[clip(q + enc->dq_y1_dc_, 0, 127)];
q_                226 third_party/libwebp/enc/quant.c     m->y1_.q_[1] = kAcTable[clip(q,                  0, 127)];
q_                228 third_party/libwebp/enc/quant.c     m->y2_.q_[0] = kDcTable[ clip(q + enc->dq_y2_dc_, 0, 127)] * 2;
q_                229 third_party/libwebp/enc/quant.c     m->y2_.q_[1] = kAcTable2[clip(q + enc->dq_y2_ac_, 0, 127)];
q_                231 third_party/libwebp/enc/quant.c     m->uv_.q_[0] = kDcTable[clip(q + enc->dq_uv_dc_, 0, 117)];
q_                232 third_party/libwebp/enc/quant.c     m->uv_.q_[1] = kAcTable[clip(q + enc->dq_uv_ac_, 0, 127)];
q_                247 third_party/libwebp/enc/quant.c     m->min_disto_ = 10 * m->y1_.q_[0];   // quantization-aware min disto
q_                564 third_party/libwebp/enc/quant.c     const int thresh = mtx->q_[1] * mtx->q_[1] / 4;
q_                595 third_party/libwebp/enc/quant.c     const int Q  = mtx->q_[j];
q_                692 third_party/libwebp/enc/quant.c     in[j] = out[n] * mtx->q_[j];
q_                237 third_party/libwebp/enc/vp8enci.h   uint16_t q_[16];        // quantizer steps
q_                174 third_party/tcmalloc/chromium/src/debugallocation.cc     q_[q_front_] = block;
q_                180 third_party/tcmalloc/chromium/src/debugallocation.cc     const QueueEntry& ret = q_[q_back_];
q_                193 third_party/tcmalloc/chromium/src/debugallocation.cc   QueueEntry q_[kFreeQueueSize];
q_                176 third_party/tcmalloc/vendor/src/debugallocation.cc     q_[q_front_] = block;
q_                182 third_party/tcmalloc/vendor/src/debugallocation.cc     const QueueEntry& ret = q_[q_back_];
q_                195 third_party/tcmalloc/vendor/src/debugallocation.cc   QueueEntry q_[kFreeQueueSize];