/* binary search in sorted array */
static int list_search(struct udev_list *list, const char *name)
{
- unsigned int first, last;
+ unsigned first, last;
first = 0;
last = list->entries_cur;
while (first < last) {
- unsigned int i;
+ unsigned i;
int cmp;
i = (first + last)/2;
/* allocate or enlarge sorted array if needed */
if (list->entries_cur >= list->entries_max) {
struct udev_list_entry **entries;
- unsigned int add;
+ unsigned add;
add = list->entries_max;
if (add < 1)
i = (-i)-1;
/* insert into sorted list */
- if ((unsigned int)i < list->entries_cur)
+ if ((unsigned)i < list->entries_cur)
udev_list_entry_insert_before(entry, list->entries[i]);
else
udev_list_entry_append(entry, list);