Lines Matching +defs:next +defs:best +defs:match
784 p->next = image_types;
807 for (type = image_types; type; type = type->next)
1215 img->prev->next = img->next;
1217 c->buckets[img->hash % IMAGE_CACHE_BUCKETS_SIZE] = img->next;
1219 if (img->next)
1220 img->next->prev = img->prev;
1346 /* Find the "best" corner color of a bitmap.
1355 RGB_PIXEL_COLOR corner_pixels[4], best;
1384 best = corner_pixels[i], best_count = n;
1387 return best;
1850 for (img = c->buckets[i]; img; img = img->next)
1980 img->next = c->buckets[i];
1981 if (img->next)
1982 img->next->prev = img;
3029 /* Bitswap XBM bytes to match how Windows does things. */
3133 #define match() \
3140 match ()
3144 match (); \
3156 match ();
3183 match ();
3188 match ();
3194 match ();
3223 match ();
3238 match ();
3256 #undef match
3587 struct xpm_cached_color *next;
3635 struct xpm_cached_color *p, *next;
3639 for (p = xpm_color_cache[i]; p; p = next)
3641 next = p->next;
3687 p->next = xpm_color_cache[bucket];
3706 for (p = xpm_color_cache[h]; p; p = p->next)
4333 #define match() \
4340 match ()
4345 match (); \
4352 match();
4537 #undef match
4611 struct ct_color *next;
4648 struct ct_color *p, *next;
4651 for (p = ct_table[i]; p; p = next)
4653 next = p->next;
4706 for (p = ct_table[i]; p; p = p->next)
4732 p->next = ct_table[i];
4751 p->next = ct_table[i];
4772 for (p = ct_table[i]; p; p = p->next)
4805 p->next = ct_table[i];
4838 for (p = ct_table[i]; p; p = p->next)