Lines Matching refs:pCP
2136 CuePoint* const pCP = *p++;
2137 assert(pCP);
2139 delete pCP;
2218 CuePoint* const pCP = new CuePoint(m_preload_count, pos);
2219 m_cue_points[m_preload_count++] = pCP;
2262 CuePoint* const pCP = m_cue_points[m_count];
2263 assert(pCP);
2264 assert((pCP->GetTimeCode() >= 0) || (-pCP->GetTimeCode() == idpos));
2265 if (pCP->GetTimeCode() < 0 && (-pCP->GetTimeCode() != idpos))
2268 pCP->Load(pReader);
2282 bool Cues::Find(long long time_ns, const Track* pTrack, const CuePoint*& pCP,
2299 pCP = *i;
2300 assert(pCP);
2302 if (time_ns <= pCP->GetTime(m_pSegment))
2304 pTP = pCP->Find(pTrack);
2320 CuePoint* const pCP = *k;
2321 assert(pCP);
2323 pCP->Load(pReader);
2325 const long long t = pCP->GetTime(m_pSegment);
2339 pCP = *--i;
2340 assert(pCP);
2341 assert(pCP->GetTime(m_pSegment) <= time_ns);
2355 pCP = *i;
2356 assert(pCP);
2358 if (time_ns <= pCP->GetTime(m_pSegment)) {
2359 pTP = pCP->Find(pTrack);
2372 CuePoint* const pCP = *k;
2373 assert(pCP);
2375 const long long t = pCP->GetTime(m_pSegment);
2389 pCP = *--i;
2390 assert(pCP);
2391 assert(pCP->GetTime(m_pSegment) <= time_ns);
2402 pTP = pCP->Find(pTrack);
2410 const CuePoint*& pCP,
2413 pCP = 0;
2437 pCP = *k;
2438 assert(pCP);
2440 const long long t = pCP->GetTime(m_pSegment);
2456 pCP = *i;
2457 assert(pCP);
2458 assert(pCP->GetTime(m_pSegment) > time_ns);
2460 pTP = pCP->Find(pTrack);
2484 CuePoint* const pCP = pp[0];
2485 assert(pCP);
2486 assert(pCP->GetTimeCode() >= 0);
2488 return pCP;
2511 CuePoint* const pCP = pp[index];
2512 assert(pCP);
2514 pCP->Load(m_pSegment->m_pReader);
2515 assert(pCP->GetTimeCode() >= 0);
2522 CuePoint* const pCP = pp[index];
2523 assert(pCP);
2524 assert(pCP->GetTimeCode() >= 0);
2527 return pCP;
2578 const BlockEntry* Cues::GetBlock(const CuePoint* pCP,
2580 if (pCP == NULL)
2586 return m_pSegment->GetBlock(*pCP, *pTP);
3802 const CuePoint*& pCP,
3811 if (!m_pCues->Find(time_ns, pTrack, pCP, pTP))
3814 assert(pCP);
3822 return GetCluster(pCP, pTP, pCluster, pBlockEntry);
