Home
last modified time | relevance | path

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

/external/perfetto/src/trace_processor/db/
Dtable.cc38 row_count_ = other.row_count_; in operator =()
59 table.row_count_ = row_count_; in CopyExceptRowMaps()
78 std::vector<uint32_t> idx(row_count_); in Sort()
151 table.row_count_ = row_count_; in LookupJoin()
171 std::vector<uint32_t> indices(row_count_); in LookupJoin()
172 for (uint32_t i = 0; i < row_count_; ++i) { in LookupJoin()
Dtable.h113 RowMap rm(0, row_count_, optimize_for);
126 table.row_count_ = rm.size(); in Apply()
158 PERFETTO_CHECK(sv->size() == row_count_); in ExtendWithColumn()
173 PERFETTO_CHECK(sv->size() == row_count_); in ExtendWithColumn()
217 uint32_t row_count() const { return row_count_; } in row_count()
225 uint32_t row_count_ = 0; variable
/external/deqp-deps/amber/src/
Dtype.h110 void SetRowCount(uint32_t size) { row_count_ = size; } in SetRowCount()
111 uint32_t RowCount() const { return row_count_; } in RowCount()
126 bool IsVec() const { return column_count_ == 1 && row_count_ > 1; } in IsVec()
129 bool IsVec3() const { return column_count_ == 1 && row_count_ == 3; } in IsVec3()
132 bool IsMatrix() const { return column_count_ > 1 && row_count_ > 1; } in IsMatrix()
135 uint32_t row_count_ = 1;
/external/perfetto/src/trace_processor/tables/
Dmacros_internal.h120 row_maps_.back().Insert(row_count_++);