Home
last modified time | relevance | path

Searched refs:row_ (Results 1 – 4 of 4) sorted by relevance

/external/webp/src/utils/
Dquant_levels_dec_utils.c48 int row_; // current input row being processed member
102 if (p->row_ >= 0 && p->row_ < p->height_ - 1) { in VFilter()
138 const uint8_t* const dither = kOrderedDither[p->row_ % DSIZE]; in ApplyFilter()
245 p->row_ = -radius; in InitParams()
271 for (; p.row_ < p.height_; ++p.row_) { in WebPDequantizeLevels()
275 if (p.row_ >= p.radius_) { in WebPDequantizeLevels()
/external/webrtc/webrtc/modules/desktop_capture/
Ddesktop_region.cc505 row_(region.rows_.begin()), in Iterator()
508 assert(row_->second->spans.size() > 0); in Iterator()
509 row_span_ = row_->second->spans.begin(); in Iterator()
517 return row_ == region_.rows_.end(); in IsAtEnd()
525 if (row_span_ == row_->second->spans.end()) { in Advance()
526 previous_row_ = row_; in Advance()
527 ++row_; in Advance()
528 if (row_ != region_.rows_.end()) { in Advance()
529 assert(row_->second->spans.size() > 0); in Advance()
530 row_span_ = row_->second->spans.begin(); in Advance()
[all …]
Ddesktop_region.h85 Rows::const_iterator row_; variable
/external/v8/src/interpreter/
Dbytecode-peephole-table.h65 static const PeepholeActionAndData* const row_[kNumberOfBytecodes]; member