CatalogItem        68 src/journal/catalog.c         const CatalogItem *i = p;
CatalogItem        85 src/journal/catalog.c         const CatalogItem *i = a, *j = b;
CatalogItem       111 src/journal/catalog.c         _cleanup_free_ CatalogItem *i = NULL;
CatalogItem       122 src/journal/catalog.c         i = new0(CatalogItem, 1);
CatalogItem       332 src/journal/catalog.c                           CatalogItem *items, size_t n) {
CatalogItem       359 src/journal/catalog.c         header.catalog_item_size = htole64(sizeof(CatalogItem));
CatalogItem       370 src/journal/catalog.c         k = fwrite(items, 1, n * sizeof(CatalogItem), w);
CatalogItem       371 src/journal/catalog.c         if (k != n * sizeof(CatalogItem)) {
CatalogItem       409 src/journal/catalog.c         _cleanup_free_ CatalogItem *items = NULL;
CatalogItem       410 src/journal/catalog.c         CatalogItem *i;
CatalogItem       447 src/journal/catalog.c         items = new(CatalogItem, hashmap_size(h));
CatalogItem       462 src/journal/catalog.c         qsort_safe(items, n, sizeof(CatalogItem), catalog_compare_func);
CatalogItem       511 src/journal/catalog.c             le64toh(h->catalog_item_size) < sizeof(CatalogItem) ||
CatalogItem       528 src/journal/catalog.c         CatalogItem key, *f = NULL;
CatalogItem       647 src/journal/catalog.c         const CatalogItem *items;
CatalogItem       658 src/journal/catalog.c         items = (const CatalogItem*) ((const uint8_t*) p + le64toh(h->header_size));