| /xsrc/external/mit/libXmu/dist/src/ |
| CrCmap.c | 60 /* find contiguous sequence of cells */
61 static Status contiguous(unsigned long[], int, int, unsigned long, int*, int*);
89 * defined in the default map are contiguous, for use in image processing.
206 * that our allocation includes a subset of contiguous pixels at least
210 * 2) We have a contiguous sequence of pixels, monotonically
216 * contiguous order which we prefer. If the server has a choice of
233 if (!contiguous(pixels, npixels, ncolors, delta, &first_index, &remainder))
235 /* can't find enough contiguous cells, give up */
317 * first those occurring before the contiguous sequence begins,
318 * then any following the contiguous sequence
376 contiguous(unsigned long pixels[], int npixels, int ncolors, function
[all...] |
| /xsrc/external/mit/xfs/dist/difs/ |
| charinfo.c | 331 Bool contiguous, reformat; local
419 contiguous = TRUE;
438 contiguous = FALSE;
454 if (contiguous && !reformat)
|
| /xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/ |
| brw_fs.cpp | 171 * be any component of a vector, and then we load 4 contiguous
1865 * contiguous sets of GRFs. If we split, we'll end up with reduced
2150 /** True if this slot and the next slot must remain contiguous */
2151 unsigned contiguous:1; member in struct:uniform_slot_info
2172 slots[i].contiguous = true;
2304 if (slots[u].contiguous)
|
| /xsrc/external/mit/xorgproto/dist/include/X11/ |
| Xproto.h | 1816 BOOL contiguous;
1824 BOOL contiguous;
1812 BOOL contiguous; member in struct:__anon11149
1820 BOOL contiguous; member in struct:__anon11150
|
