1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
|
/*
* Copyright 2001 Niels Provos <provos@citi.umich.edu>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Niels Provos.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <sys/types.h>
#include <sys/queue.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <err.h>
#include "config.h"
#include "db.h"
extern int count;
extern int found;
struct dbqueue dblist;
void
db_init(void)
{
TAILQ_INIT(&dblist);
}
void
db_insert(char *filename, int type, void *obj,
int (*crack)(char *, char *, void *),
int (*compare)(void *, void *),
void (*free)(void *))
{
struct db *db, *tmp;
if ((db = malloc(sizeof(struct db))) == NULL)
err(1, "malloc");
db->filename = strdup(filename);
if (db->filename == NULL)
err(1, "strdup");
db->type = type;
db->obj = obj;
db->crack = crack;
db->free = free;
if (compare != NULL) {
for (tmp = TAILQ_FIRST(&dblist); tmp;
tmp = TAILQ_NEXT(tmp, next))
if (compare(db->obj, tmp->obj) <= 0)
break;
if (tmp)
TAILQ_INSERT_BEFORE(tmp, db, next);
else
TAILQ_INSERT_TAIL(&dblist, db, next);
} else
TAILQ_INSERT_TAIL(&dblist, db, next);
}
void
db_remove(struct db *db)
{
TAILQ_REMOVE(&dblist, db, next);
db->free(db->obj);
free(db->filename);
free(db);
}
void
db_flush(void)
{
struct db *db;
extern int quiet;
for (db = TAILQ_FIRST(&dblist); db; db = TAILQ_FIRST(&dblist)) {
if (!quiet)
fprintf(stdout, "%s : negative\n", db->filename);
db_remove(db);
}
}
int
db_crack(char *word)
{
struct db *db, *next;
int res;
for(db = TAILQ_FIRST(&dblist); db; db = next) {
next = TAILQ_NEXT(db, next);
count++;
res = (*db->crack)(db->filename, word, db->obj);
if (res) {
found++;
db_remove(db);
}
}
if (TAILQ_FIRST(&dblist) == NULL)
return (1);
return (0);
}
|
