openmamba/distromatic
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

headerlist.c: indentation fixes

Browse Source
This commit is contained in:
Silvan Calarco 2021-03-20 12:24:36 +01:00
parent 7d07afc0cc
commit 367ba2bf22
1 changed files with 42 additions and 43 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

85
src/headerlist.c
View File

@ -432,52 +432,51 @@ struct providedList*
findOrCreateProvidedListEntry(struct providedList* *idx, findOrCreateProvidedListEntry(struct providedList* *idx,
char* findname, int create, int arch) char* findname, int create, int arch)
{ {
struct providedList *newprovided, *currprovided, *prevprovided = NULL; struct providedList *newprovided, *currprovided, *prevprovided = NULL;
int c = 0, i; int c = 0, i;
int idxbot = 0, idxtop; int idxbot = 0, idxtop;
if (idx[1]) { if (idx[1]) {
idxtop = PROVIDEDLIST_IDX_SIZE; idxtop = PROVIDEDLIST_IDX_SIZE;
while (idxtop-idxbot > 1) { while (idxtop-idxbot > 1) {
i = (idxtop + idxbot) / 2; i = (idxtop + idxbot) / 2;
if (! idx[i]) idxtop = i; if (! idx[i]) idxtop = i;
else { else {
c = strcmp(idx[i]->name,findname); c = strcmp(idx[i]->name,findname);
if (c < 0) idxbot = i; if (c < 0) idxbot = i;
else if (c > 0) idxtop = i; else if (c > 0) idxtop = i;
else { idxbot = i-1; idxtop = i; } else { idxbot = i-1; idxtop = i; }
} }
} }
// printf("idxbot=%d idxtop=%d %s %s\n",idxbot,idxtop,idx[idxbot]->name,findname); //printf("idxbot=%d idxtop=%d %s %s\n",idxbot,idxtop,idx[idxbot]->name,findname);
} }
currprovided = idx[idxbot]; currprovided = idx[idxbot];
while (currprovided && ((c=strcmp(currprovided->name,findname)) < 0)) { while (currprovided && ((c=strcmp(currprovided->name,findname)) < 0)) {
prevprovided = currprovided; prevprovided = currprovided;
currprovided = currprovided->next; currprovided = currprovided->next;
} }
if ((!currprovided) || (c > 0)) { if ((!currprovided) || (c > 0)) {
if (!create) return NULL; if (!create) return NULL;
providedListCount[arch]++; providedListCount[arch]++;
newprovided = malloc(sizeof(struct providedList)); newprovided = malloc(sizeof(struct providedList));
if (prevprovided) { if (prevprovided) {
newprovided->next = prevprovided->next; newprovided->next = prevprovided->next;
prevprovided->next = newprovided; prevprovided->next = newprovided;
} else { } else {
idx[0]=newprovided; idx[0]=newprovided;
newprovided->next = currprovided; newprovided->next = currprovided;
} }
newprovided->provider = NULL; newprovided->provider = NULL;
newprovided->numproviders = 0; newprovided->numproviders = 0;
newprovided->numbuildproviders = 0; newprovided->numbuildproviders = 0;
newprovided->buildprovider = NULL; newprovided->buildprovider = NULL;
newprovided->name = strdup(findname); newprovided->name = strdup(findname);
newprovided->id = ++providedListId; newprovided->id = ++providedListId;
return newprovided; return newprovided;
} }
return currprovided;
return currprovided;
} }
struct fileTree* struct fileTree*