Lines Matching refs:total
36 // long long total, available;
37 // status = pReader->Length(&total, &available);
39 // assert((total < 0) || (available <= total));
100 long long total, available;
102 int status = pReader->Length(&total, &available);
104 assert((total < 0) || (available <= total));
328 long long total, available;
330 const long status = pReader->Length(&total, &available);
332 assert((total < 0) || (available <= total));
371 long long total, available;
373 long status = pReader->Length(&total, &available);
375 assert((total < 0) || (available <= total));
438 long long total, available;
440 long status = pReader->Length(&total, &available);
467 if ((total >= 0) && ((total - available) < 5))
473 if ((total >= 0) && ((total - pos) < 5))
510 if ((total >= 0) && ((total - pos) < len))
527 if ((total >= 0) && ((total - pos) < result))
644 long long total, available;
646 const long status = pReader->Length(&total, &available);
654 if ((total >= 0) && (available > total))
667 // total file size is unknown. We could decide to always
669 // we happen to know the total file length). This would have
675 if ((total >= 0) && (pos >= total))
685 if ((total >= 0) && ((pos + len) > total))
706 if ((total >= 0) && ((pos + len) > total))
728 else if (total < 0)
731 else if ((pos + size) > total)
747 if ((total >= 0) && ((pos + size) > total))
761 long long total, available;
763 const int status = m_pReader->Length(&total, &available);
768 assert((total < 0) || (available <= total));
771 assert((segment_stop < 0) || (total < 0) || (segment_stop <= total));
775 if ((total >= 0) && (m_pos >= total))
845 // We read EBML elements either in total or nothing at all.
941 long long total, avail;
943 long status = m_pReader->Length(&total, &avail);
948 assert((total < 0) || (avail <= total));
956 if ((total >= 0) && (m_pos >= total))
1167 if ((total >= 0) && (pos >= total)) {
1168 m_pos = total;
1217 if ((total >= 0) && (pos >= total))
1367 long long total, avail;
1369 long status = m_pReader->Length(&total, &avail);
1374 assert((total < 0) || (avail <= total));
1381 if ((total >= 0) && (pos >= total))
1383 total - element_start;
1855 long long total, avail;
1857 const int status = m_pReader->Length(&total, &avail);
1862 assert((total < 0) || (avail <= total));
1866 if ((total < 0) || (pos >= total))
1946 if ((total >= 0) && (element_stop > total))
2915 long long total, avail;
2917 const int status = m_pReader->Length(&total, &avail);
2922 if (total < 0)
2925 return (m_pos >= total);
3164 long long total, avail;
3166 long status = m_pReader->Length(&total, &avail);
3171 assert((total < 0) || (avail <= total));
3270 long long total, avail;
3272 long status = m_pReader->Length(&total, &avail);
3277 assert((total < 0) || (avail <= total));
3289 if ((total >= 0) && (pos >= total))
3495 if ((total >= 0) && (pos >= total))
6040 long long total, avail;
6042 const int status = pReader->Length(&total, &avail);
6047 assert((total < 0) || (avail <= total));
6048 assert((total < 0) || (m_pos <= total)); // TODO: verify this
6288 total, avail;
6290 status = pReader->Length(&total, &avail);
6295 assert((total < 0) || (avail <= total));
6303 if ((total >= 0) && (pos >= total)) {
6404 } else if ((total >= 0) && (block_stop > total)) {
6405 m_element_size = total - m_element_start;
6406 pos = total;
6441 if ((total >= 0) && (start > total))
6449 if ((total >= 0) && (stop > total))
6463 long long total, avail;
6465 long status = pReader->Length(&total, &avail);
6470 assert((total < 0) || (avail <= total));
6592 long long total, avail;
6594 long status = pReader->Length(&total, &avail);
6599 assert((total < 0) || (avail <= total));
6601 if ((total >= 0) && (payload_stop > total))
6996 long long total, avail;
6998 long status = pReader->Length(&total, &avail);
7003 assert((total < 0) || (avail <= total));
7007 if ((total >= 0) && (pos >= total))
7032 if ((total >= 0) && ((pos + len) > total))
7066 if ((total >= 0) && ((pos + len) > total))
7093 if ((total >= 0) && (cluster_stop > total))