+
+static int sort_func(const void *a, const void *b) {
+ const ObMenuEntry *e[2] = {*(ObMenuEntry**)a, *(ObMenuEntry**)b};
+ const gchar *k[2];
+ gint i;
+
+ for (i = 0; i < 2; ++i) {
+ if (e[i]->type == OB_MENU_ENTRY_TYPE_NORMAL)
+ k[i] = e[i]->data.normal.collate_key;
+ else {
+ g_assert(e[i]->type == OB_MENU_ENTRY_TYPE_SUBMENU);
+ if (e[i]->data.submenu.submenu)
+ k[i] = e[i]->data.submenu.submenu->collate_key;
+ else
+ return -1; /* arbitrary really.. the submenu doesn't exist. */
+ }
+ }
+ return strcmp(k[0], k[1]);
+}
+
+/*!
+ @param start The first entry in the range to sort.
+ @param end The last entry in the range to sort.
+*/
+static void sort_range(ObMenu *self, GList *start, GList *end, guint len)
+{
+ ObMenuEntry **ar;
+ GList *it;
+ guint i;
+ if (!len) return;
+
+ ar = g_slice_alloc(sizeof(ObMenuEntry*) * len);
+ for (i = 0, it = start; it != g_list_next(end); ++i, it = g_list_next(it))
+ ar[i] = it->data;
+ qsort(ar, len, sizeof(ObMenuEntry*), sort_func);
+ for (i = 0, it = start; it != g_list_next(end); ++i, it = g_list_next(it))
+ it->data = ar[i];
+ g_slice_free1(sizeof(ObMenuEntry*) * len, ar);
+}
+
+void menu_sort_entries(ObMenu *self)
+{
+ GList *it, *start, *end, *last;
+ guint len;
+
+ /* need the submenus to know their labels for sorting */
+ menu_find_submenus(self);
+
+ start = self->entries;
+ len = 0;
+ for (it = self->entries; it; it = g_list_next(it)) {
+ ObMenuEntry *e = it->data;
+ if (e->type == OB_MENU_ENTRY_TYPE_SEPARATOR) {
+ end = g_list_previous(it);
+ sort_range(self, start, end, len);
+
+ it = g_list_next(it); /* skip over the separator */
+ start = it;
+ len = 0;
+ }
+ else
+ len += 1;
+ last = it;
+ }
+ sort_range(self, start, last, len);
+}