12 // We need a sorted list of priority groups, where each element in the list
18   int priority;                         // priority of this group  member
38     gl->group[i].priority = -1;  in NewGroupList()
54 static void AddToGroup(group_list_t *gl, int priority, int partition) {  in AddToGroup()  argument
56   // See if I've already got a group with this priority  in AddToGroup()
58     if (gl->group[i].priority == priority)  in AddToGroup()
64     gl->group[i].priority = priority;  in AddToGroup()
75     if (gl->group[i].priority == old_priority) {  in ChangeGroup()
76       gl->group[i].priority = new_priority;  in ChangeGroup()
88     for (j=i; j && (gl->group[j-1].priority < tmp.priority); j--)  in SortGroups()
97   int priority;  in CgptPrioritize()  local
143     // Determine the current priority groups  in CgptPrioritize()
149       priority = GetPriority(&drive, PRIMARY, i);  in CgptPrioritize()
153         params->orig_priority = priority;  // remember the original priority  in CgptPrioritize()
155           AddToGroup(groups, priority, i); // we'll move them all later  in CgptPrioritize()
159         AddToGroup(groups, priority, i);   // just remember  in CgptPrioritize()
163     // If we're including friends, then change the original group priority  in CgptPrioritize()
172     // We'll never lower anything to zero, so if the last group is priority zero  in CgptPrioritize()
175     if (groups->group[i-1].priority == 0)  in CgptPrioritize()
180       priority = params->max_priority;  in CgptPrioritize()
182       priority = groups->num_groups > 15 ? 15 : groups->num_groups;  in CgptPrioritize()
186       groups->group[i].priority = priority;  in CgptPrioritize()
187       if (priority > 1)  in CgptPrioritize()
188         priority--;  in CgptPrioritize()
195                     groups->group[i].part[j], groups->group[i].priority);  in CgptPrioritize()