Mercurial > hg > audiodb
view libtests/test_utils_lib.h @ 596:6ad0a6e67d4c
Take advantage of those new handy _or_goto_error macros
Use them in various places where previously we either elided the error
checking (various lseek() calls) or used a combination of calls
(replaced by malloc_and_fill_or_goto_error()).
In the process, fix what is probably a bug (or else introduce one, but I
don't think so): audiodb_track_id_datum() computed the offset into the
timesTable wrongly, forgetting to multiply by 2. (TODO: this should be
easily testable using the API).
Now all of LIBOBJS can be produced by my (Debian's) mingw32
cross-compiler, except for lshlib.o.
author | mas01cr |
---|---|
date | Tue, 11 Aug 2009 21:42:49 +0000 |
parents | e18843dc0aea |
children | a35ca2d5f238 |
line wrap: on
line source
#include <sys/types.h> #include <sys/stat.h> #include <math.h> #include <unistd.h> #include <fcntl.h> #include <string.h> #include <stdio.h> #include <stdlib.h> #define TESTDB "testdb" void clean_remove_db(char * dbname) { unlink(dbname); } void maketestfile(const char *path, int dim, double *doubles, int ndoubles) { FILE *file; file = fopen(path, "w"); fwrite(&dim, sizeof(int), 1, file); fwrite(doubles, sizeof(double), ndoubles, file); fflush(file); fclose(file); } int close_enough(double a, double b, double epsilon) { return (fabs(a-b) < epsilon); } int result_position(adb_query_results_t *r, const char *key, float dist, uint32_t qpos, uint32_t ipos) { for(uint32_t k = 0; k < r->nresults; k++) { adb_result_t result = r->results[k]; if(close_enough(dist, result.dist, 1e-4) && (qpos == result.qpos) && (ipos == result.ipos) && !(strcmp(key, result.key))) { return k; } } return -1; } #define result_present_or_fail(r, k, d, q, i) \ if(result_position(r, k, d, q, i) < 0) return 1; int entry_position(adb_liszt_results_t *l, const char *key, uint32_t nvectors) { for(uint32_t k = 0; k < l->nresults; k++) { adb_track_entry_t entry = l->entries[k]; if((nvectors == entry.nvectors) && !strcmp(key, entry.key)) { return k; } } return -1; } #define entry_present_or_fail(l, k, n) \ if(entry_position(l, k, n) < 0) return 1;