Searched defs:dither (Results 1 - 3 of 3) sorted by relevance

/openjdk7/hotspot/src/share/vm/memory/
H A DbinaryTreeDictionary.hpp194 TreeChunk<Chunk>* get_chunk_from_tree(size_t size, enum FreeBlockDictionary<Chunk>::Dither dither, bool splay);
253 Chunk* get_chunk(size_t size, enum FreeBlockDictionary<Chunk>::Dither dither) { argument
255 Chunk* res = get_chunk_from_tree(size, dither, splay());
H A DbinaryTreeDictionary.cpp377 BinaryTreeDictionary<Chunk>::get_chunk_from_tree(size_t size, enum FreeBlockDictionary<Chunk>::Dither dither, bool splay) argument
401 if (dither == FreeBlockDictionary<Chunk>::exactly) return NULL;
/openjdk7/jdk/src/share/native/sun/awt/image/jpeg/
H A Djquant1.c59 * We use a standard 16x16 ordered dither array. The basic concept of ordered
63 * "dither" value to the input pixel and then round the result to the nearest
64 * output value. The dither value is equivalent to (0.5 - threshold) times
67 * worse, since the dither may be too much or too little at a given point.
69 * The normal calculation would be to form pixel value + dither, range-limit
75 #define ODITHER_SIZE 16 /* dimension of dither matrix */
84 /* Bayer's order-4 dither array. Generated by the code given in
163 int row_index; /* cur row's vertical index in dither matrix */
164 ODITHER_MATRIX_PTR odither[MAX_Q_COMPS]; /* one dither array per component */
343 /* For ordered dither, w
527 int * dither; /* points to active row of dither matrix */ local
[all...]

Completed in 750 milliseconds