Home
last modified time | relevance | path

Searched refs:head_other (Results 1 – 25 of 27) sorted by relevance

12

/dports/graphics/cairo/cairo-1.17.4/src/
H A Dcairo-mono-scan-converter.c258 struct edge *head_other, *remaining; in sort_edges() local
261 head_other = list->next; in sort_edges()
263 if (head_other == NULL) { in sort_edges()
268 remaining = head_other->next; in sort_edges()
269 if (list->x.quo <= head_other->x.quo) { in sort_edges()
271 head_other->next = NULL; in sort_edges()
273 *head_out = head_other; in sort_edges()
274 head_other->prev = list->prev; in sort_edges()
275 head_other->next = list; in sort_edges()
276 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-bentley-ottmann-rectangular.c390 edge_t *head_other, *remaining; in sort_edges() local
393 head_other = list->next; in sort_edges()
395 if (head_other == NULL) { in sort_edges()
400 remaining = head_other->next; in sort_edges()
401 if (list->x <= head_other->x) { in sort_edges()
403 head_other->next = NULL; in sort_edges()
405 *head_out = head_other; in sort_edges()
406 head_other->prev = list->prev; in sort_edges()
407 head_other->next = list; in sort_edges()
408 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-tor22-scan-converter.c1038 struct edge *head_other, *remaining; in sort_edges() local
1041 head_other = list->next; in sort_edges()
1043 if (head_other == NULL) { in sort_edges()
1048 remaining = head_other->next; in sort_edges()
1049 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1051 head_other->next = NULL; in sort_edges()
1053 *head_out = head_other; in sort_edges()
1054 head_other->prev = list->prev; in sort_edges()
1055 head_other->next = list; in sort_edges()
1056 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-tor-scan-converter.c1106 struct edge *head_other, *remaining; in sort_edges() local
1109 head_other = list->next; in sort_edges()
1111 if (head_other == NULL) { in sort_edges()
1116 remaining = head_other->next; in sort_edges()
1117 if (list->cell <= head_other->cell) { in sort_edges()
1119 head_other->next = NULL; in sort_edges()
1121 *head_out = head_other; in sort_edges()
1122 head_other->prev = list->prev; in sort_edges()
1123 head_other->next = list; in sort_edges()
1124 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-clip-tor-scan-converter.c1104 struct edge *head_other, *remaining; in sort_edges() local
1107 head_other = list->next; in sort_edges()
1110 if (head_other == NULL) { in sort_edges()
1119 remaining = head_other->next; in sort_edges()
1120 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1123 head_other->next = NULL; in sort_edges()
1125 *head_out = head_other; in sort_edges()
1126 head_other->next = list; in sort_edges()
1133 remaining = sort_edges (remaining, i, &head_other); in sort_edges()
1134 *head_out = merge_sorted_edges (*head_out, head_other); in sort_edges()
/dports/www/firefox-esr/firefox-91.8.0/gfx/cairo/cairo/src/
H A Dcairo-mono-scan-converter.c258 struct edge *head_other, *remaining; in sort_edges() local
261 head_other = list->next; in sort_edges()
263 if (head_other == NULL) { in sort_edges()
268 remaining = head_other->next; in sort_edges()
269 if (list->x.quo <= head_other->x.quo) { in sort_edges()
271 head_other->next = NULL; in sort_edges()
273 *head_out = head_other; in sort_edges()
274 head_other->prev = list->prev; in sort_edges()
275 head_other->next = list; in sort_edges()
276 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-bentley-ottmann-rectangular.c390 edge_t *head_other, *remaining; in sort_edges() local
393 head_other = list->next; in sort_edges()
395 if (head_other == NULL) { in sort_edges()
400 remaining = head_other->next; in sort_edges()
401 if (list->x <= head_other->x) { in sort_edges()
403 head_other->next = NULL; in sort_edges()
405 *head_out = head_other; in sort_edges()
406 head_other->prev = list->prev; in sort_edges()
407 head_other->next = list; in sort_edges()
408 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-tor22-scan-converter.c1038 struct edge *head_other, *remaining; in sort_edges() local
1041 head_other = list->next; in sort_edges()
1043 if (head_other == NULL) { in sort_edges()
1048 remaining = head_other->next; in sort_edges()
1049 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1051 head_other->next = NULL; in sort_edges()
1053 *head_out = head_other; in sort_edges()
1054 head_other->prev = list->prev; in sort_edges()
1055 head_other->next = list; in sort_edges()
1056 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-tor-scan-converter.c1106 struct edge *head_other, *remaining; in sort_edges() local
1109 head_other = list->next; in sort_edges()
1111 if (head_other == NULL) { in sort_edges()
1116 remaining = head_other->next; in sort_edges()
1117 if (list->cell <= head_other->cell) { in sort_edges()
1119 head_other->next = NULL; in sort_edges()
1121 *head_out = head_other; in sort_edges()
1122 head_other->prev = list->prev; in sort_edges()
1123 head_other->next = list; in sort_edges()
1124 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-clip-tor-scan-converter.c1104 struct edge *head_other, *remaining; in sort_edges() local
1107 head_other = list->next; in sort_edges()
1110 if (head_other == NULL) { in sort_edges()
1119 remaining = head_other->next; in sort_edges()
1120 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1123 head_other->next = NULL; in sort_edges()
1125 *head_out = head_other; in sort_edges()
1126 head_other->next = list; in sort_edges()
1133 remaining = sort_edges (remaining, i, &head_other); in sort_edges()
1134 *head_out = merge_sorted_edges (*head_out, head_other); in sort_edges()
/dports/www/firefox/firefox-99.0/gfx/cairo/cairo/src/
H A Dcairo-mono-scan-converter.c258 struct edge *head_other, *remaining; in sort_edges() local
261 head_other = list->next; in sort_edges()
263 if (head_other == NULL) { in sort_edges()
268 remaining = head_other->next; in sort_edges()
269 if (list->x.quo <= head_other->x.quo) { in sort_edges()
271 head_other->next = NULL; in sort_edges()
273 *head_out = head_other; in sort_edges()
274 head_other->prev = list->prev; in sort_edges()
275 head_other->next = list; in sort_edges()
276 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-bentley-ottmann-rectangular.c390 edge_t *head_other, *remaining; in sort_edges() local
393 head_other = list->next; in sort_edges()
395 if (head_other == NULL) { in sort_edges()
400 remaining = head_other->next; in sort_edges()
401 if (list->x <= head_other->x) { in sort_edges()
403 head_other->next = NULL; in sort_edges()
405 *head_out = head_other; in sort_edges()
406 head_other->prev = list->prev; in sort_edges()
407 head_other->next = list; in sort_edges()
408 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-tor22-scan-converter.c1038 struct edge *head_other, *remaining; in sort_edges() local
1041 head_other = list->next; in sort_edges()
1043 if (head_other == NULL) { in sort_edges()
1048 remaining = head_other->next; in sort_edges()
1049 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1051 head_other->next = NULL; in sort_edges()
1053 *head_out = head_other; in sort_edges()
1054 head_other->prev = list->prev; in sort_edges()
1055 head_other->next = list; in sort_edges()
1056 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-tor-scan-converter.c1106 struct edge *head_other, *remaining; in sort_edges() local
1109 head_other = list->next; in sort_edges()
1111 if (head_other == NULL) { in sort_edges()
1116 remaining = head_other->next; in sort_edges()
1117 if (list->cell <= head_other->cell) { in sort_edges()
1119 head_other->next = NULL; in sort_edges()
1121 *head_out = head_other; in sort_edges()
1122 head_other->prev = list->prev; in sort_edges()
1123 head_other->next = list; in sort_edges()
1124 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-clip-tor-scan-converter.c1104 struct edge *head_other, *remaining; in sort_edges() local
1107 head_other = list->next; in sort_edges()
1110 if (head_other == NULL) { in sort_edges()
1119 remaining = head_other->next; in sort_edges()
1120 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1123 head_other->next = NULL; in sort_edges()
1125 *head_out = head_other; in sort_edges()
1126 head_other->next = list; in sort_edges()
1133 remaining = sort_edges (remaining, i, &head_other); in sort_edges()
1134 *head_out = merge_sorted_edges (*head_out, head_other); in sort_edges()
/dports/mail/thunderbird/thunderbird-91.8.0/gfx/cairo/cairo/src/
H A Dcairo-mono-scan-converter.c258 struct edge *head_other, *remaining; in sort_edges() local
261 head_other = list->next; in sort_edges()
263 if (head_other == NULL) { in sort_edges()
268 remaining = head_other->next; in sort_edges()
269 if (list->x.quo <= head_other->x.quo) { in sort_edges()
271 head_other->next = NULL; in sort_edges()
273 *head_out = head_other; in sort_edges()
274 head_other->prev = list->prev; in sort_edges()
275 head_other->next = list; in sort_edges()
276 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-bentley-ottmann-rectangular.c390 edge_t *head_other, *remaining; in sort_edges() local
393 head_other = list->next; in sort_edges()
395 if (head_other == NULL) { in sort_edges()
400 remaining = head_other->next; in sort_edges()
401 if (list->x <= head_other->x) { in sort_edges()
403 head_other->next = NULL; in sort_edges()
405 *head_out = head_other; in sort_edges()
406 head_other->prev = list->prev; in sort_edges()
407 head_other->next = list; in sort_edges()
408 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-tor22-scan-converter.c1038 struct edge *head_other, *remaining; in sort_edges() local
1041 head_other = list->next; in sort_edges()
1043 if (head_other == NULL) { in sort_edges()
1048 remaining = head_other->next; in sort_edges()
1049 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1051 head_other->next = NULL; in sort_edges()
1053 *head_out = head_other; in sort_edges()
1054 head_other->prev = list->prev; in sort_edges()
1055 head_other->next = list; in sort_edges()
1056 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-tor-scan-converter.c1106 struct edge *head_other, *remaining; in sort_edges() local
1109 head_other = list->next; in sort_edges()
1111 if (head_other == NULL) { in sort_edges()
1116 remaining = head_other->next; in sort_edges()
1117 if (list->cell <= head_other->cell) { in sort_edges()
1119 head_other->next = NULL; in sort_edges()
1121 *head_out = head_other; in sort_edges()
1122 head_other->prev = list->prev; in sort_edges()
1123 head_other->next = list; in sort_edges()
1124 list->prev = head_other; in sort_edges()
[all …]
H A Dcairo-clip-tor-scan-converter.c1104 struct edge *head_other, *remaining; in sort_edges() local
1107 head_other = list->next; in sort_edges()
1110 if (head_other == NULL) { in sort_edges()
1119 remaining = head_other->next; in sort_edges()
1120 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1123 head_other->next = NULL; in sort_edges()
1125 *head_out = head_other; in sort_edges()
1126 head_other->next = list; in sort_edges()
1133 remaining = sort_edges (remaining, i, &head_other); in sort_edges()
1134 *head_out = merge_sorted_edges (*head_out, head_other); in sort_edges()
/dports/games/libretro-2048/libretro-2048-35a299c/cairo/src/
H A Dcairo-tor-scan-converter.c1254 struct edge *head_other, *remaining; in sort_edges() local
1257 head_other = list->next; in sort_edges()
1260 if (head_other == NULL) { in sort_edges()
1269 remaining = head_other->next; in sort_edges()
1270 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1273 head_other->next = NULL; in sort_edges()
1275 *head_out = head_other; in sort_edges()
1276 head_other->next = list; in sort_edges()
1283 remaining = sort_edges (remaining, i, &head_other); in sort_edges()
1284 *head_out = merge_sorted_edges (*head_out, head_other); in sort_edges()
/dports/lang/spidermonkey78/firefox-78.9.0/gfx/cairo/cairo/src/
H A Dcairo-tor-scan-converter.c1287 struct edge *head_other, *remaining; in sort_edges() local
1290 head_other = list->next; in sort_edges()
1293 if (head_other == NULL) { in sort_edges()
1302 remaining = head_other->next; in sort_edges()
1303 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1306 head_other->next = NULL; in sort_edges()
1308 *head_out = head_other; in sort_edges()
1309 head_other->next = list; in sort_edges()
1316 remaining = sort_edges (remaining, i, &head_other); in sort_edges()
1317 *head_out = merge_sorted_edges (*head_out, head_other); in sort_edges()
/dports/lang/spidermonkey60/firefox-60.9.0/gfx/cairo/cairo/src/
H A Dcairo-tor-scan-converter.c1287 struct edge *head_other, *remaining; in sort_edges() local
1290 head_other = list->next; in sort_edges()
1293 if (head_other == NULL) { in sort_edges()
1302 remaining = head_other->next; in sort_edges()
1303 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1306 head_other->next = NULL; in sort_edges()
1308 *head_out = head_other; in sort_edges()
1309 head_other->next = list; in sort_edges()
1316 remaining = sort_edges (remaining, i, &head_other); in sort_edges()
1317 *head_out = merge_sorted_edges (*head_out, head_other); in sort_edges()
/dports/www/firefox-legacy/firefox-52.8.0esr/gfx/cairo/cairo/src/
H A Dcairo-tor-scan-converter.c1287 struct edge *head_other, *remaining; in sort_edges() local
1290 head_other = list->next; in sort_edges()
1293 if (head_other == NULL) { in sort_edges()
1302 remaining = head_other->next; in sort_edges()
1303 if (list->x.quo <= head_other->x.quo) { in sort_edges()
1306 head_other->next = NULL; in sort_edges()
1308 *head_out = head_other; in sort_edges()
1309 head_other->next = list; in sort_edges()
1316 remaining = sort_edges (remaining, i, &head_other); in sort_edges()
1317 *head_out = merge_sorted_edges (*head_out, head_other); in sort_edges()
/dports/x11-drivers/xf86-video-intel/xf86-video-intel-31486f40f8e8f8923ca0799aea84b58799754564/src/sna/
H A Dsna_trapezoids_mono.c329 struct mono_edge *head_other, *remaining; in mono_sort_edges() local
332 head_other = list->next; in mono_sort_edges()
334 if (head_other == NULL) { in mono_sort_edges()
339 remaining = head_other->next; in mono_sort_edges()
340 if (list->x.quo <= head_other->x.quo) { in mono_sort_edges()
342 head_other->next = NULL; in mono_sort_edges()
344 *head_out = head_other; in mono_sort_edges()
345 head_other->prev = list->prev; in mono_sort_edges()
346 head_other->next = list; in mono_sort_edges()
347 list->prev = head_other; in mono_sort_edges()
[all …]

12