Comp 108 ext/xmlrpc/libxmlrpc/queue.c int (*Comp)(const void *, const void *)); Comp 110 ext/xmlrpc/libxmlrpc/queue.c int (*Comp)(const void *, const void *)); Comp 691 ext/xmlrpc/libxmlrpc/queue.c int (*Comp)(const void *, const void *)) Comp 701 ext/xmlrpc/libxmlrpc/queue.c if(Comp(d, data) == 0) Comp 706 ext/xmlrpc/libxmlrpc/queue.c if(Comp(d, data) == 0) Comp 716 ext/xmlrpc/libxmlrpc/queue.c int (*Comp)(const void *, const void *)) Comp 729 ext/xmlrpc/libxmlrpc/queue.c while(Comp(list[i], key) < 0) Comp 733 ext/xmlrpc/libxmlrpc/queue.c while(Comp(list[j], key) > 0) Comp 748 ext/xmlrpc/libxmlrpc/queue.c QuickSort(list, low, j-1, Comp); Comp 749 ext/xmlrpc/libxmlrpc/queue.c QuickSort(list, j+1, high, Comp); Comp 777 ext/xmlrpc/libxmlrpc/queue.c int Q_Sort(queue *q, int (*Comp)(const void *, const void *)) Comp 814 ext/xmlrpc/libxmlrpc/queue.c QuickSort(index, 0, q->size - 1, Comp); Comp 828 ext/xmlrpc/libxmlrpc/queue.c Q_Find(q, d, Comp); Comp 854 ext/xmlrpc/libxmlrpc/queue.c int (*Comp)(const void *, const void*)) Comp 863 ext/xmlrpc/libxmlrpc/queue.c val = Comp(key, index[ mid ]); Comp 897 ext/xmlrpc/libxmlrpc/queue.c void *Q_Seek(queue *q, void *data, int (*Comp)(const void *, const void *)) Comp 906 ext/xmlrpc/libxmlrpc/queue.c if(!Q_Sort(q, Comp)) Comp 910 ext/xmlrpc/libxmlrpc/queue.c idx = Q_BSearch(q, data, Comp); Comp 941 ext/xmlrpc/libxmlrpc/queue.c int Q_Insert(queue *q, void *data, int (*Comp)(const void *, const void *)) Comp 949 ext/xmlrpc/libxmlrpc/queue.c if(!Q_Sort(q, Comp)) Comp 65 ext/xmlrpc/libxmlrpc/queue.h int Q_Sort(queue *q, int (*Comp)(const void *, const void *)); Comp 67 ext/xmlrpc/libxmlrpc/queue.h int (*Comp)(const void *, const void *)); Comp 69 ext/xmlrpc/libxmlrpc/queue.h int (*Comp)(const void *, const void *)); Comp 71 ext/xmlrpc/libxmlrpc/queue.h int (*Comp)(const void *, const void *));