Lines Matching refs:level
152 uint32 bitsPerColor, uint32 level, uint32* _leafCount,
160 *_node = _CreateNode(level, bitsPerColor, _leafCount, reducibleNodes);
170 // Recurse a level deeper if the node is not a leaf.
171 int shift = 7 - level;
172 int index = (((r & kMask[level]) >> shift) << 2) |
173 (((g & kMask[level]) >> shift) << 1) |
174 (( b & kMask[level]) >> shift);
176 level + 1, _leafCount, reducibleNodes);
182 BColorQuantizer::_CreateNode(uint32 level, uint32 bitsPerColor,
190 node->isLeaf = (level == bitsPerColor) ? true : false;
194 node->next = reducibleNodes[level];
195 reducibleNodes[level] = node;
206 // Find the deepest level containing at least one reducible node.
210 // Reduce the node most recently added to the list at level i.