Lines Matching defs:chain
47 RTCList<MEDIUMTASK> chain;
180 * the biggest parent in the previous chain. So even if the new
182 * it. Adding the biggest size in the chain should balance this a
186 for (size_t e = mtc.chain.size(); e > 0; --e)
188 MEDIUMTASK &mt = mtc.chain.at(e - 1);
276 /* Create the medium task chain. In this case it will always
303 mtc.chain.append(mt);
389 /* Build a histogram of used medias and the parent chain. */
404 mtc.chain.append(mt);
417 /* Build up the index list of the image chain. Unfortunately we can't do
424 for (size_t a = mtc.chain.size(); a > 0; --a)
425 mtc.chain[a - 1].uIdx = uIdx++;
442 * is a direct children in the source chain). */
448 for (size_t a = 0; a < mtc.chain.size(); ++a)
450 const MEDIUMTASK &mt = mtc.chain.at(a);
458 /* Check if there is a "step" in the histogram when going the chain
472 /* Update the old medium chain with the updated one. */
473 mtc.chain = newChain;
539 mtc.chain.append(mt);
554 /* Build up the index list of the image chain. Unfortunately we can't do
561 for (size_t a = mtc.chain.size(); a > 0; --a)
562 mtc.chain[a - 1].uIdx = uIdx++;
802 /* now check if there is a parent chain which leads to the
881 * be cloned. Any parent disks in the original chain will be merged
1048 * parents/parent chain. If a medium is in this map already, it isn't
1060 for (size_t a = mtc.chain.size(); a > 0; --a)
1062 const MEDIUMTASK &mt = mtc.chain.at(a - 1);
1259 * chain. */
1271 rc = mtc.chain.first().pMedium->COMGETTER(Id)(bstrSrcId.asOutParam());
1282 const MEDIUMTASK &mt = mtc.chain.first();