• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /barrelfish-2018-10-04/lib/tenaciousd/

Lines Matching refs:entry

42     // Allocate minimum sized log entry
43 struct tenaciousd_log_entry *entry =
45 assert(entry != NULL);
47 // Read minimum sized entry
49 LOG_MIN_ENTRY_SIZE(log), entry);
56 storage_free(log, entry);
61 if(entry->size + sizeof(struct tenaciousd_log_entry)
63 return entry;
67 entry = storage_realloc(log->vsic, entry,
68 entry->size + sizeof(struct tenaciousd_log_entry));
69 assert(entry != NULL);
72 entry->size - LOG_MIN_ENTRY_SIZE(log) + sizeof(struct tenaciousd_log_entry),
73 ((uint8_t *)entry) + LOG_MIN_ENTRY_SIZE(log));
79 if(entry->data[entry->size] != LOG_ENTRY_END_MARKER) {
80 // This entry is invalid
81 storage_free(log, entry);
85 return entry;
120 // Either we couldn't read (cause EOF) or there's no entry
185 struct tenaciousd_log_entry *entry)
190 log->end = entry->next = end +
191 STORAGE_VSIC_ROUND(vsic, entry->size + sizeof(struct tenaciousd_log_entry));
193 entry->data[entry->size] = LOG_ENTRY_END_MARKER;
197 entry->size + sizeof(struct tenaciousd_log_entry), entry);
207 struct tenaciousd_log_entry *entry =
210 if(entry == NULL) {
217 .entry = entry,
231 iter.offset += STORAGE_VSIC_ROUND(log->vsic, iter.entry->size);
232 iter.entry = read_entry(log, iter.offset);
245 struct tenaciousd_log_entry *entry = storage_malloc(log->vsic, *size);
246 assert(entry != NULL);
250 entry->size = *size;
251 return entry;
256 struct tenaciousd_log_entry *entry,
261 entry = storage_realloc(log->vsic, entry, *newsize);
262 assert(entry != NULL);
266 entry->size = *newsize;
267 return entry;
271 struct tenaciousd_log_entry *entry)
273 storage_free(log->vsic, entry);