Searched refs:prevSize (Results 1 – 7 of 7) sorted by relevance
370 for (int n = 0, prevSize = 1; n < rules.size(); n++) { in buildDistanceData()372 … checkArgument(rule.size() >= prevSize, "<languageMatch> elements out of order at: %s", rule); in buildDistanceData()373 checkArgument(rule.size() == prevSize || (n > 0 && rules.get(n - 1).isDefaultRule()), in buildDistanceData()375 prevSize = rule.size(); in buildDistanceData()
262 deUintptr prevSize = m_numElements; in resize() local268 for (deUintptr ndx = prevSize; ndx < m_numElements; ndx++) in resize()280 deUintptr prevSize = m_numElements; in resize() local286 for (deUintptr ndx = prevSize; ndx < m_numElements; ndx++) in resize()
51 int prevSize = 0; in closure() local52 while (glyphs.size() > prevSize) { in closure()53 prevSize = glyphs.size(); in closure()
518 int prevSize = 0; in build() local532 if (size < prevSize) { in build()535 prevSize = size; in build()
626 const auto &prevSize = attachmentSize.value(); in attachmentsHaveSameDimensions() local628 return (curSize.width != prevSize.width || curSize.height != prevSize.height); in attachmentsHaveSameDimensions()
26370 u32 prevSize; /* Size of previous chunk in Mem3Block elements */26459 assert( size==mem3.aPool[i+size-1].u.hdr.prevSize );26493 assert( size==mem3.aPool[i+size-1].u.hdr.prevSize );26543 assert( mem3.aPool[i+nBlock-1].u.hdr.prevSize==nBlock );26546 mem3.aPool[i+nBlock-1].u.hdr.prevSize = nBlock;26571 mem3.aPool[mem3.iKeyBlk+mem3.szKeyBlk-1].u.hdr.prevSize = nBlock;26575 mem3.aPool[newi-1].u.hdr.prevSize = mem3.szKeyBlk;26611 assert( i > mem3.aPool[i-1].u.hdr.prevSize );26612 prev = i - mem3.aPool[i-1].u.hdr.prevSize;26620 mem3.aPool[prev+size-1].u.hdr.prevSize = size;[all …]