You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

262 lines
5.6 KiB

11 years ago
/*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU Library General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor Boston, MA 02110-1301, USA
*/
11 years ago
#include "common.h"
11 years ago
#include "database.h"
#include "bitmap.h"
11 years ago
#include <unistd.h>
#include <getopt.h>
void usage(int exitcode) {
printf("Usage:\n"
" util <opts>\n"
" -b <path> Path to database\n"
" -t <float> Maximum difference percent (0.0 - 1.0, default: 0.1)\n"
);
printf("\n"
" -B <num> Show bitmap for this sample\n"
" -C <a>,<b> Show difference percent for this samples\n"
" -D <a>,<b> Show difference bitmap for this samples\n"
" -S <num> Search for images similar ot this sample\n"
" -U <num> Show db usage map, <num> entries per column\n"
11 years ago
);
exit(exitcode);
}
10 years ago
int search_similar(db_t *db, rec_t *sample, float tresh)
11 years ago
{
10 years ago
int ret = 0, i = 0;
match_t *matches = NULL;
11 years ago
10 years ago
ret = db_search(db, sample, tresh, &matches);
if (ret == -1) {
printf("%s\n", db->errstr);
exit(EXIT_FAILURE);
}
11 years ago
10 years ago
if (ret == 0)
11 years ago
return 0;
11 years ago
10 years ago
for (i = 0; i < ret; i++) {
printf("%lli -- %.2f\n", matches[i].num, matches[i].diff * 100);
11 years ago
}
10 years ago
FREE(matches);
return 0;
11 years ago
}
int db_usage_map(db_t *db, unsigned short int cols)
{
const int blk_size = 4096;
unsigned int i, j = 0;
unsigned char *p, *t;
char buf[256];
block_t blk;
assert(db != NULL);
assert(cols <= 256);
memset(&blk, 0x0, sizeof(block_t));
memset(buf, 0x0, sizeof(char) * 256);
blk.start = 1;
blk.records = blk_size;
while (db_rd_blk(db, &blk) > 0) {
p = blk.data;
for (i = 0; i < blk.records; i++, p += REC_LEN) {
t = p + OFF_USED;
buf[j] = (*t == 0xFF) ? '1' : '0';
if (j++ < cols)
continue;
puts(buf);
memset(buf, 0x0, sizeof(char) * 256);
j = 0;
}
if (j > 0)
puts(buf);
FREE(blk.data);
blk.start += blk_size;
}
return 0;
}
int rec_bitmap(db_t *db, rec_t *sample)
{
uint16_t row;
uint8_t i, j;
assert(db != NULL);
assert(sample != NULL);
11 years ago
if (db_rd_rec(db, sample) < 1)
return -1;
11 years ago
if (!sample->data[0]) {
puts("Sample not exists");
return 0;
}
for (i = 0; i < 16; i++) {
row = *(((uint16_t *) (&sample->data[OFF_BITMAP])) + i);
for (j = 0; j < 16; j++) {
putchar((row & 1) == 1 ? '1' : '0');
row >>= 1;
}
putchar('\n');
}
return 0;
}
int rec_diff(db_t *db, unsigned long a, unsigned long b, unsigned short int showmap)
{
rec_t src;
rec_t dst;
float diff = 0.0;
unsigned char map[BITMAP_SIZE];
uint16_t row;
uint8_t i, j;
assert(db != NULL);
memset(&src, 1, sizeof(rec_t));
memset(&dst, 2, sizeof(rec_t));
src.num = a;
dst.num = b;
if (db_rd_rec(db, &src) < 1)
return -1;
if (!src.data[0]) {
puts("First sample not exists");
return 0;
}
if (db_rd_rec(db, &dst) < 1)
return -1;
if (!src.data[0]) {
puts("First sample not exists");
return 0;
}
if (showmap == 0) {
diff = (float) bitmap_compare(&src.data[OFF_BITMAP], &dst.data[OFF_BITMAP]);
diff /= BITMAP_BITS;
printf("%.2f%%\n", diff * 100);
return 0;
}
bitmap_diffmap(&map[0], src.data + OFF_BITMAP, dst.data + OFF_BITMAP);
for (i = 0; i < 16; i++) {
row = *(((uint16_t *) map) + i);
for (j = 0; j < 16; j++) {
putchar((row & 1) == 1 ? '1' : '0');
row >>= 1;
}
putchar('\n');
}
return 0;
}
11 years ago
int main(int argc, char **argv)
{
enum { undef, search, bitmap, usage_map, diff } mode = undef;
11 years ago
const char *db_path = NULL;
float tresh = 0.10;
unsigned short int cols = 64, map = 0;
11 years ago
db_t db;
rec_t sample;
unsigned long a, b;
char *c = NULL;
11 years ago
char opt = '\0';
11 years ago
memset(&db, 0x0, sizeof(db_t));
memset(&sample, 0x0, sizeof(rec_t));
11 years ago
if (argc < 3)
usage(EXIT_FAILURE);
while ((opt = getopt(argc, argv, "b:t:B:C:D:S:U:")) != -1) {
11 years ago
switch (opt) {
case 'b' :
db_path = optarg;
break;
case 't' :
tresh = atof(optarg);
tresh = (tresh > 0.0 && tresh < 1.0) ? tresh : 0.10;
break;
case 'B' :
mode = bitmap;
sample.num = atoll(optarg);
break;
case 'D' :
map = 1;
case 'C' :
mode = diff;
if ((c = strchr(optarg, ',')) == NULL)
usage(EXIT_FAILURE);
a = atoll(optarg);
b = atoll(c + 1);
break;
11 years ago
case 'S' :
mode = search;
sample.num = atoll(optarg);
break;
case 'U' :
mode = usage_map;
cols = atoi(optarg);
if (cols <= 0 || cols >= 256)
cols = 64;
break;
11 years ago
default :
usage(EXIT_FAILURE);
break;
}
}
if ((mode == search || mode == bitmap) && sample.num <= 0)
11 years ago
usage(EXIT_FAILURE);
11 years ago
if (mode == diff && (a <= 0 || b <= 0))
usage(EXIT_FAILURE);
11 years ago
if (db_open(&db, db_path) == -1) {
11 years ago
printf("%s\n", db.errstr);
exit(EXIT_FAILURE);
}
11 years ago
if (mode == search)
10 years ago
search_similar(&db, &sample, tresh);
11 years ago
if (mode == bitmap)
rec_bitmap(&db, &sample);
11 years ago
if (mode == usage_map)
db_usage_map(&db, cols);
if (mode == diff)
rec_diff(&db, a, b, map);
11 years ago
db_close(&db);
exit(EXIT_SUCCESS);
}