Searched refs:n_items (Results 1 - 5 of 5) sorted by relevance

/systemd/src/basic/
H A Dprioq.c44 unsigned n_items, n_allocated; member in struct:Prioq
88 assert(j < q->n_items);
89 assert(k < q->n_items);
135 if (j >= q->n_items)
146 if (k < q->n_items &&
172 if (q->n_items >= q->n_allocated) {
176 n = MAX((q->n_items+1) * 2, 16u);
185 k = q->n_items++;
204 l = q->items + q->n_items - 1;
208 q->n_items
[all...]
H A Dbtrfs-util.c1788 size_t n_items = 0, n_allocated = 0; local
1835 if (!GREEDY_REALLOC(items, n_allocated, n_items+1))
1838 items[n_items++] = sh->offset;
1846 if (n_items <= 0) {
1854 return (int) n_items;
/systemd/src/journal/
H A Dcatalog.c59 le64_t n_items; member in struct:CatalogHeader
417 header.n_items = htole64(n);
578 le64toh(h->n_items) <= 0 ||
579 st.st_size < (off_t) (le64toh(h->header_size) + le64toh(h->catalog_item_size) * le64toh(h->n_items))) {
605 f = bsearch(&key, (const uint8_t*) p + le64toh(h->header_size), le64toh(h->n_items), le64toh(h->catalog_item_size), catalog_compare_func);
612 f = bsearch(&key, (const uint8_t*) p + le64toh(h->header_size), le64toh(h->n_items), le64toh(h->catalog_item_size), catalog_compare_func);
619 f = bsearch(&key, (const uint8_t*) p + le64toh(h->header_size), le64toh(h->n_items), le64toh(h->catalog_item_size), catalog_compare_func);
627 le64toh(h->n_items) * le64toh(h->catalog_item_size) +
717 for (n = 0; n < le64toh(h->n_items); n++) {
H A Djournal-file.c1372 const EntryItem items[], unsigned n_items,
1382 assert(items || n_items == 0);
1385 osize = offsetof(Object, entry.items) + (n_items * sizeof(EntryItem));
1392 memcpy(o->entry.items, items, n_items * sizeof(EntryItem));
1368 journal_file_append_entry_internal( JournalFile *f, const dual_timestamp *ts, uint64_t xor_hash, const EntryItem items[], unsigned n_items, uint64_t *seqnum, Object **ret, uint64_t *offset) argument
/systemd/src/resolve/
H A Dresolved-etc-hosts.c43 size_t n_items, n_allocated; member in struct:EtcHostsItemByName
176 if (!GREEDY_REALLOC(bn->items, bn->n_allocated, bn->n_items+1))
179 bn->items[bn->n_items++] = item;
406 r = dns_answer_reserve(answer, bn->n_items);
431 for (i = 0; i < bn->n_items; i++) {

Completed in 1778 milliseconds