&rangecomp);
/* Sort backups */
- if (num_backups > 0) {
+ if (0 < num_backups) {
qsort(backups, (size_t) num_backups, sizeof(long int),
&intcomp);
}
/* Walk through ranges */
for (k = 0; k < num_ranges; k++) {
/* Count IPs in use */
- for (; range_p->last_ip > leases[i]
+ for (; leases[i] < range_p->last_ip
&& (unsigned long) i < num_leases; i++) {
- if (range_p->first_ip > leases[i]) {
+ if (leases[i] < range_p->first_ip) {
continue;
}
/* IP with in range */
}
/* Count touched IPs */
- for (; range_p->last_ip > touches[j]
+ for (; touches[j] < range_p->last_ip
&& (unsigned long) j < num_touches; j++) {
- if (range_p->first_ip > touches[j]) {
+ if (touches[j] < range_p->first_ip) {
continue;
}
/* IP with in range */
}
/* Count backup IPs */
- if (num_backups > 0) {
- for (; range_p->last_ip > backups[m]
+ if (0 < num_backups) {
+ for (; backups[m] < range_p->last_ip
&& (unsigned long) m < num_touches; m++) {
- if (range_p->first_ip > touches[m]) {
+ if (touches[m] < range_p->first_ip) {
continue;
}
/* IP with in range */
range_p->shared_net->available += block_size;
}
- /* Reverse so that not even a one IP will be missed. */
+ /* Go backwards one step so that not even a one IP will be
+ * missed. This is possibly always unnecessary. */
if (i) {
i--;
}
range_p++;
}
- /* During count of other shared networks default network and
- * all networks got mixed to gether semantically. This fixes
- * the problem, but is not elegant. TODO: fix semantics of all
- * and default share_network. */
+ /* FIXME: During count of other shared networks default network and
+ * all networks got mixed to gether semantically. This fixes the
+ * problem, but is not elegant. */
shared_networks->available = 0;
shared_networks->used = 0;
shared_networks->touched = 0;