Lines Matching defs:db
36 struct data_block *db;
50 pointer to the last db that was added, and start searching from
53 db = last_used;
55 db = data_blocks;
58 for (; db->next && db->next->block < new_db->block; db = db->next)
61 if (db->next == NULL) {
62 db->next = new_db;
64 new_db->next = db->next;
65 db->next = new_db;
72 struct data_block *db = malloc(sizeof(struct data_block));
73 if (db == NULL)
76 db->block = block;
77 db->len = len;
78 db->data = data;
79 db->filename = NULL;
80 db->next = NULL;
82 queue_db(db);
89 struct data_block *db = malloc(sizeof(struct data_block));
90 if (db == NULL)
93 db->block = block;
94 db->len = len;
95 db->filename = strdup(filename);
96 db->offset = offset;
97 db->next = NULL;
99 queue_db(db);
107 struct data_block *db;
110 for (db = data_blocks; db; db = db->next) {
111 if (db->block < last_block)
112 error("data blocks out of order: %u < %u", db->block, last_block);
113 last_block = db->block + DIV_ROUND_UP(db->len, info.block_size) - 1;
115 if (db->filename)
116 file_func(out, (u64)db->block * info.block_size, db->filename, db->offset, db->len);
118 data_func(out, (u64)db->block * info.block_size, db->data, db->len);
126 struct data_block *db = data_blocks;
127 while (db) {
128 struct data_block *next = db->next;
129 free((void*)db->filename);
131 // There used to be a free() of db->data here, but it
139 free(db);
140 db = next;
