Lines Matching full:m_pos
603 m_pos(start),
772 assert((segment_stop < 0) || (m_pos <= segment_stop));
775 if ((total >= 0) && (m_pos >= total))
778 if ((segment_stop >= 0) && (m_pos >= segment_stop))
781 long long pos = m_pos;
914 m_pos = pos + size; // consume payload
917 assert((segment_stop < 0) || (m_pos <= segment_stop));
938 if (m_pos < 0)
956 if ((total >= 0) && (m_pos >= total))
959 if ((segment_stop >= 0) && (m_pos >= segment_stop))
962 pos = m_pos;
1024 m_pos = pos;
1058 m_pos = pos + size; // consume payload
1066 m_pos = pos + size; // consume payload
1115 // so it can adjust its own segment::m_pos member.
1154 m_pos = pos; // consume payload
1155 assert((segment_stop < 0) || (m_pos <= segment_stop));
1168 m_pos = total;
1173 m_pos = segment_stop;
1177 m_pos = pos;
1195 m_pos = pos;
1196 assert((segment_stop < 0) || (m_pos <= segment_stop));
1202 m_pos = -pos;
1209 // m_pos has NOT been adjusted yet (in case we need to come back here)
1343 m_pos = pos + cluster_size; //consume payload
1344 assert((segment_stop < 0) || (m_pos <= segment_stop));
1352 assert(m_pos < 0);
1360 pos = -m_pos;
1501 m_pos = element_start + element_size;
1522 m_pos = pos;
2127 m_pos(start_) {}
2154 return (m_pos >= stop);
2228 if (m_pos >= stop)
2235 while (m_pos < stop) {
2236 const long long idpos = m_pos;
2240 const long long id = ReadUInt(pReader, m_pos, len);
2242 assert((m_pos + len) <= stop);
2244 m_pos += len; // consume ID
2246 const long long size = ReadUInt(pReader, m_pos, len);
2248 assert((m_pos + len) <= stop);
2250 m_pos += len; // consume Size field
2251 assert((m_pos + size) <= stop);
2254 m_pos += size; // consume payload
2255 assert(m_pos <= stop);
2272 m_pos += size; // consume payload
2273 assert(m_pos <= stop);
2278 // return (m_pos < stop);
2601 //[ii, i) < pTP->m_pos
2603 //[j, jj) > pTP->m_pos
2611 // const long long pos_ = pCluster->m_pos;
2618 if (pos < tp.m_pos)
2620 else if (pos > tp.m_pos)
2627 // assert(Cluster::HasBlockEntries(this, tp.m_pos));
2629 Cluster* const pCluster = Cluster::Create(this, -1, tp.m_pos); //, -1);
2656 //[ii, i) < pTP->m_pos
2658 //[j, jj) > pTP->m_pos
2666 // const long long pos_ = pCluster->m_pos;
2682 // assert(Cluster::HasBlockEntries(this, tp.m_pos));
2827 m_pos = -1;
2850 m_pos = UnserializeUInt(pReader, pos, size);
2859 assert(m_pos >= 0);
2907 const long long result = stop - m_pos;
2925 return (m_pos >= total);
2930 return (m_pos >= stop);
3098 // const long long pos_ = pNext->m_pos;
3162 assert(m_pos > 0);
6015 assert(m_pos >= m_element_start);
6019 assert(m_pos <= element_stop);
6021 const long long result = element_stop - m_pos;
6030 assert(m_pos >= m_element_start);
6035 assert(m_pos == m_element_start);
6048 assert((total < 0) || (m_pos <= total)); // TODO: verify this
6050 pos = m_pos;
6260 m_pos = new_pos; // designates position just beyond timecode payload
6275 assert(m_pos >= m_element_start);
6283 if ((cluster_stop >= 0) && (m_pos >= cluster_stop))
6297 pos = m_pos;
6427 m_pos = pos;
6428 assert((cluster_stop < 0) || (m_pos <= cluster_stop));
6580 m_pos = block_stop;
6817 m_pos = payload_stop;
6823 assert(m_pos >= m_element_start);
6849 if (m_pos >= element_stop)
6874 m_pos(0),
6887 m_pos(element_start),
