Searched refs:items (Results 1 - 25 of 41) sorted by relevance

12

/systemd/src/test/
H A Dtest-list.c29 list_item items[4]; local
35 for (i = 0; i < ELEMENTSOF(items); i++) {
36 LIST_INIT(item, &items[i]);
37 assert_se(LIST_JUST_US(item, &items[i]));
38 LIST_PREPEND(item, head, &items[i]);
42 LIST_FOREACH_OTHERS(item, cursor, &items[2]) {
44 assert_se(cursor != &items[2]);
46 assert_se(i == ELEMENTSOF(items)-1);
49 LIST_FOREACH_OTHERS(item, cursor, &items[0]) {
51 assert_se(cursor != &items[
[all...]
/systemd/src/basic/
H A Dprioq.c46 struct prioq_item *items; member in struct:Prioq
64 free(q->items);
91 assert(!q->items[j].idx || *(q->items[j].idx) == j);
92 assert(!q->items[k].idx || *(q->items[k].idx) == k);
94 saved_data = q->items[j].data;
95 saved_idx = q->items[j].idx;
96 q->items[j].data = q->items[
[all...]
H A Djson.c626 JsonVariant *key = NULL, *value = NULL, *var = NULL, *items = NULL; local
691 if(!GREEDY_REALLOC(items, allocated, size + toadd))
695 r = json_variant_deep_copy(&items[size], value);
699 r = json_variant_deep_copy(&items[size], key);
703 r = json_variant_deep_copy(&items[size+1], value);
726 json_raw_unref(items, size);
731 scope->objects = items;
765 _cleanup_(json_variant_array_unrefp) JsonVariant **items = NULL;
837 if (!GREEDY_REALLOC(items, allocated, s+2))
840 items[
[all...]
/systemd/src/resolve/
H A Dresolved-dns-answer.h50 DnsAnswerItem items[0]; member in struct:DnsAnswer
96 (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \
100 UNIQ_T(i, q)++, (kk) = (UNIQ_T(i, q) < (a)->n_rrs ? (a)->items[UNIQ_T(i, q)].rr : NULL))
106 (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \
107 (ifi) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].ifindex : 0; \
112 (kk) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].rr : NULL), \
113 (ifi) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_T(i, q)].ifindex : 0))
119 (kk) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].rr : NULL; \
120 (fl) = ((a) && (a)->n_rrs > 0) ? (a)->items[0].flags : 0; \
125 (kk) = ((UNIQ_T(i, q) < (a)->n_rrs) ? (a)->items[UNIQ_
[all...]
H A Dresolved-dns-answer.c29 a = malloc0(offsetof(DnsAnswer, items) + sizeof(DnsAnswerItem) * n);
84 a->items[a->n_rrs++] = (DnsAnswerItem) {
119 if (a->items[i].ifindex != ifindex)
122 r = dns_resource_record_equal(a->items[i].rr, rr);
127 if ((rr->ttl == 0) != (a->items[i].rr->ttl == 0))
132 if (rr->ttl > a->items[i].rr->ttl) {
134 dns_resource_record_unref(a->items[i].rr);
135 a->items[i].rr = rr;
138 a->items[i].flags |= flags;
142 r = dns_resource_key_equal(a->items[
684 DnsAnswerItem *items; local
[all...]
H A Dresolved-etc-hosts.c42 EtcHostsItem **items; member in struct:EtcHostsItemByName
57 free(bn->items);
176 if (!GREEDY_REALLOC(bn->items, bn->n_allocated, bn->n_items+1))
179 bn->items[bn->n_items++] = item;
434 if ((found_a && bn->items[i]->family != AF_INET) &&
435 (found_aaaa && bn->items[i]->family != AF_INET6))
438 r = dns_resource_record_new_address(&rr, bn->items[i]->family, &bn->items[i]->address, bn->name);
H A Dresolved-dns-rr.h102 LIST_FIELDS(DnsTxtItem, items);
150 DnsTxtItem *items; member in struct:DnsResourceRecord::__anon231::__anon236
/systemd/src/journal/
H A Dcatalog.h33 int catalog_list_items(FILE *f, const char* database, bool oneline, char **items);
H A Djournal-verify.c214 if ((le64toh(o->object.size) - offsetof(EntryObject, items)) % sizeof(EntryItem) != 0) {
217 offsetof(EntryObject, items),
222 if ((le64toh(o->object.size) - offsetof(EntryObject, items)) / sizeof(EntryItem) <= 0) {
224 "Invalid number items in entry: %"PRIu64,
225 (le64toh(o->object.size) - offsetof(EntryObject, items)) / sizeof(EntryItem));
251 if (o->entry.items[i].object_offset == 0 ||
252 !VALID64(o->entry.items[i].object_offset)) {
256 o->entry.items[i].object_offset);
265 if ((le64toh(o->object.size) - offsetof(HashTableObject, items)) % sizeof(HashItem) != 0 ||
266 (le64toh(o->object.size) - offsetof(HashTableObject, items)) / sizeo
[all...]
H A Dcatalog.c393 CatalogItem *items, size_t n) {
427 k = fwrite(items, 1, n * sizeof(CatalogItem), w);
464 _cleanup_free_ CatalogItem *items = NULL; local
497 log_info("No items in catalog.");
500 log_debug("Found %u items in catalog.", hashmap_size(h));
502 items = new(CatalogItem, hashmap_size(h));
503 if (!items) {
520 items[n++] = *i;
524 qsort_safe(items, n, sizeof(CatalogItem), catalog_compare_func);
528 sz = write_catalog(database, sb, items,
392 write_catalog(const char *database, struct strbuf *sb, CatalogItem *items, size_t n) argument
704 const CatalogItem *items; local
736 catalog_list_items(FILE *f, const char *database, bool oneline, char **items) argument
[all...]
H A Djournal-def.h112 EntryItem items[]; member in struct:EntryObject
122 HashItem items[]; member in struct:HashTableObject
128 le64_t items[]; member in struct:EntryArrayObject
H A Djournal-file.c643 offsetof(Object, hash_table.items) + s,
648 memzero(o->hash_table.items, s);
650 f->header->data_hash_table_offset = htole64(p + offsetof(Object, hash_table.items));
670 offsetof(Object, hash_table.items) + s,
675 memzero(o->hash_table.items, s);
677 f->header->field_hash_table_offset = htole64(p + offsetof(Object, hash_table.items));
1178 return (le64toh(o->object.size) - offsetof(Object, entry.items)) / sizeof(EntryItem);
1187 return (le64toh(o->object.size) - offsetof(Object, entry_array.items)) / sizeof(uint64_t);
1197 return (le64toh(o->object.size) - offsetof(Object, hash_table.items)) / sizeof(HashItem);
1224 o->entry_array.items[
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
1520 EntryItem *items; local
3016 EntryItem *items; local
[all...]
H A Djournal-authenticate.c468 if (p < offsetof(Object, hash_table.items))
470 p -= offsetof(Object, hash_table.items);
477 if (p < offsetof(Object, hash_table.items))
479 p -= offsetof(Object, hash_table.items);
/systemd/tools/
H A Dmake-man-rules.py113 aliases=mjoin(k for k,v in rulegroup.items() if k != v),
115 for k,v in sorted(rulegroup.items())
118 for k,v in sorted(rulegroup.items())
121 for conditional,rulegroup in sorted(rules.items())
H A Dmake-directive-index.py256 for varname, manpages in sorted(directives.items()):
298 for name, directives in directive_groups.items():
/systemd/src/libsystemd/sd-bus/
H A Dkdbus.h144 * struct kdbus_vec - I/O vector for kdbus payload items
294 * @_KDBUS_ITEM_USER_BASE: Start of user items
295 * @KDBUS_ITEM_NEGOTIATE: Negotiate supported items
321 * @_KDBUS_ITEM_ATTACH_BASE: Start of metadata attach items
342 * @_KDBUS_ITEM_POLICY_BASE: Start of policy items
344 * @_KDBUS_ITEM_KERNEL_BASE: Start of kernel-generated message items
356 * these items only for informational purposes, such as generating log
513 * @items: A list of kdbus_items containing the message payload
527 struct kdbus_item items[0]; member in struct:kdbus_msg
566 * @items
574 struct kdbus_item items[0]; member in struct:kdbus_cmd_send
637 struct kdbus_item items[0]; member in struct:kdbus_cmd_recv
656 struct kdbus_item items[0]; member in struct:kdbus_cmd_free
719 struct kdbus_item items[0]; member in struct:kdbus_cmd_hello
736 struct kdbus_item items[0]; member in struct:kdbus_info
773 struct kdbus_item items[0]; member in struct:kdbus_cmd_list
806 struct kdbus_item items[0]; member in struct:kdbus_cmd_info
837 struct kdbus_item items[0]; member in struct:kdbus_cmd_match
880 struct kdbus_item items[0]; member in struct:kdbus_cmd
[all...]
H A Dbus-control.c68 size = offsetof(struct kdbus_cmd, items) + KDBUS_ITEM_SIZE(l);
73 n->items[0].size = KDBUS_ITEM_HEADER_SIZE + l;
74 n->items[0].type = KDBUS_ITEM_NAME;
75 memcpy(n->items[0].str, name, l);
169 size = offsetof(struct kdbus_cmd, items) + KDBUS_ITEM_SIZE(l);
173 n->items[0].size = KDBUS_ITEM_HEADER_SIZE + l;
174 n->items[0].type = KDBUS_ITEM_NAME;
175 memcpy(n->items[0].str, name, l);
279 KDBUS_ITEM_FOREACH(item, name, items) {
411 KDBUS_ITEM_FOREACH(item, info, items) {
[all...]
H A Dbus-kernel.c305 sz = offsetof(struct kdbus_msg, items);
356 d = m->kdbus->items;
457 KDBUS_ITEM_FOREACH(d, k, items) {
538 KDBUS_ITEM_FOREACH(d, k, items) {
887 struct kdbus_item *items, *item; local
942 sz = ALIGN8(offsetof(struct kdbus_cmd_hello, items)) +
963 item = hello->items;
1020 /* extract bloom parameters from items */
1021 items = (void*)((uint8_t*)b->kdbus_buffer + hello->offset);
1022 KDBUS_FOREACH(item, items, hell
[all...]
/systemd/src/bus-proxyd/
H A Dbus-xml-policy.c53 LIST_FIND_TAIL(items, *list, tail);
54 LIST_INSERT_AFTER(items, *list, tail, i);
399 LIST_REMOVE(items, first, i);
431 LIST_REMOVE(items, first, i);
739 static int check_policy_items(PolicyItem *items, const struct policy_check_filter *filter) { argument
748 LIST_FOREACH(items, i, items) {
765 PolicyItem *items; local
776 * 1. Check default items
777 * 2. Check group items
1088 dump_items(PolicyItem *items, const char *prefix) argument
[all...]
H A Dbus-xml-policy.h64 LIST_FIELDS(PolicyItem, items);
/systemd/src/core/
H A Dbus-endpoint.c37 size = ALIGN8(offsetof(struct kdbus_cmd, items));
47 n = update->items;
H A Dbus-policy.c118 size = offsetof(struct kdbus_cmd_hello, items) +
124 n = hello->items;
/systemd/src/tmpfiles/
H A Dtmpfiles.c146 Item *items; member in struct:ItemArray
164 static OrderedHashmap *items = NULL, *globs = NULL; variable
222 Item *item = j->items + n;
429 if (ordered_hashmap_get(items, sub_path)) {
1682 j = ordered_hashmap_get(items, prefix);
1709 k = process_item(array->items + n);
1736 item_free_contents(a->items + n);
1737 free(a->items);
1761 /* check if the items are the same */
2067 h = needs_glob(i.type) ? globs : items;
[all...]
/systemd/src/shared/
H A Dsleep-config.c50 const ConfigTableItem items[] = { local
62 "Sleep\0", config_item_table_lookup, items,
/systemd/src/bootchart/
H A Dbootchart.c100 const ConfigTableItem items[] = { local
118 NULL, config_item_table_lookup, items, true, NULL);

Completed in 3297 milliseconds

12