comparison sidlib.c @ 332:629876cc0540

Indentation cosmetics.
author Matti Hamalainen <ccr@tnsp.org>
date Mon, 13 Jan 2020 13:11:37 +0200
parents e35e15f07c66
children c2ebcb0f0d62
comparison
equal deleted inserted replaced
331:e35e15f07c66 332:629876cc0540
560 for (i = 0, node = dbh->nodes; node != NULL && i < dbh->nnodes; 560 for (i = 0, node = dbh->nodes; node != NULL && i < dbh->nnodes;
561 node = (SIDLibSLDBNode *) node->node.next) 561 node = (SIDLibSLDBNode *) node->node.next)
562 dbh->pindex[i++] = node; 562 dbh->pindex[i++] = node;
563 563
564 // Sort the indexes 564 // Sort the indexes
565 qsort(dbh->pindex, dbh->nnodes, sizeof(SIDLibSLDBNode *), sidlib_sldb_compare_nodes); 565 qsort(dbh->pindex, dbh->nnodes,
566 sizeof(SIDLibSLDBNode *), sidlib_sldb_compare_nodes);
566 } 567 }
567 568
568 return THERR_OK; 569 return THERR_OK;
569 } 570 }
570 571
591 { 592 {
592 SIDLibSLDBNode keyItem, *key, **item; 593 SIDLibSLDBNode keyItem, *key, **item;
593 594
594 memcpy(&keyItem.hash, hash, sizeof(th_md5hash_t)); 595 memcpy(&keyItem.hash, hash, sizeof(th_md5hash_t));
595 key = &keyItem; 596 key = &keyItem;
596 item = bsearch(&key, dbh->pindex, dbh->nnodes, sizeof(dbh->pindex[0]), sidlib_sldb_compare_nodes); 597 item = bsearch(&key, dbh->pindex, dbh->nnodes,
598 sizeof(dbh->pindex[0]), sidlib_sldb_compare_nodes);
597 599
598 return (item != NULL) ? *item : NULL; 600 return (item != NULL) ? *item : NULL;
599 } 601 }
600 602
601 603
1144 node = (SIDLibSTILNode *) node->node.next) 1146 node = (SIDLibSTILNode *) node->node.next)
1145 { 1147 {
1146 dbh->pindex[i++] = node; 1148 dbh->pindex[i++] = node;
1147 1149
1148 // Sort the subtunes 1150 // Sort the subtunes
1149 qsort(node->subtunes, node->nsubtunes, sizeof(SIDLibSTILSubTune), sidlib_stildb_compare_subtunes); 1151 qsort(node->subtunes, node->nsubtunes,
1152 sizeof(SIDLibSTILSubTune), sidlib_stildb_compare_subtunes);
1150 } 1153 }
1151 1154
1152 // Sort the indexes 1155 // Sort the indexes
1153 qsort(dbh->pindex, dbh->nnodes, sizeof(SIDLibSTILNode *), sidlib_stildb_compare_nodes); 1156 qsort(dbh->pindex, dbh->nnodes,
1157 sizeof(SIDLibSTILNode *), sidlib_stildb_compare_nodes);
1154 } 1158 }
1155 1159
1156 return THERR_OK; 1160 return THERR_OK;
1157 } 1161 }
1158 1162
1163 { 1167 {
1164 SIDLibSTILNode keyItem, *key, **item; 1168 SIDLibSTILNode keyItem, *key, **item;
1165 1169
1166 keyItem.filename = (char *) filename; 1170 keyItem.filename = (char *) filename;
1167 key = &keyItem; 1171 key = &keyItem;
1168 item = bsearch(&key, dbh->pindex, dbh->nnodes, sizeof(SIDLibSTILNode *), sidlib_stildb_compare_nodes); 1172 item = bsearch(&key, dbh->pindex, dbh->nnodes,
1173 sizeof(SIDLibSTILNode *), sidlib_stildb_compare_nodes);
1169 1174
1170 return item != NULL ? *item : NULL; 1175 return item != NULL ? *item : NULL;
1171 } 1176 }