list_prev_entry
topa = list_prev_entry(topa, list);
n = list_prev_entry(spawn, list);
prev = list_prev_entry(va_block, node);
prev = list_prev_entry(node, list);
next = list_prev_entry(next, chain_node);
prev_node = list_prev_entry(node, node_list);
hole = list_prev_entry(node, node_list);
prev_node = list_prev_entry(node, node_list);
i915_seqno_passed(list_prev_entry(rq, signal_link)->fence.seqno,
other = list_prev_entry(node, node_list);
#define list_prev_op(_op) list_prev_entry(_op, entry)
entry = list_prev_entry(entry, head);
lru = list_prev_entry(lru, link);
parent = list_prev_entry(nd, link)->csdev;
parent = list_prev_entry(nd, link)->csdev;
err = cscfg_owner_get(list_prev_entry(owner_info, item));
cscfg_owner_put(list_prev_entry(owner_info, item));
cscfg_owner_put(list_prev_entry(owner_info, item));
last_offset = list_prev_entry(entry, list)->src_offset + 1;
((reverse) ? list_prev_entry(pos, list) : list_next_entry(pos, list))
pos = list_prev_entry(pos, list);
prev = list_prev_entry(matcher, list_node);
prev = list_prev_entry(matcher, list_node);
prev_nic_matcher = list_prev_entry(nic_matcher, list_node);
prev_nic_matcher = list_prev_entry(next_nic_matcher, list_node);
prev_ste = list_prev_entry(ste, miss_list_node);
err = mlxsw_sp_nve_mc_record_refresh(list_prev_entry(mc_record, list));
prev_record = list_prev_entry(mc_record, list);
prev = list_prev_entry(ipip_entry,
#define nfp_meta_prev(meta) list_prev_entry(meta, l)
*prev = list_prev_entry(bus_cur, bus_list);
core = list_prev_entry(core, elem);
core = list_prev_entry(core, elem);
core = list_prev_entry(core, elem);
vdev = list_prev_entry(vdev, vdev.dev_set_list);
prev_trans = list_prev_entry(trans->transaction, list);
prev_trans = list_prev_entry(cur_trans, list);
prev = list_prev_entry(cf, g_list);
prev = list_prev_entry(cf, i_list);
return list_prev_entry(sb, s_list);
return drm_bridge_get(list_prev_entry(bridge, chain_node));
#define drm_gpuva_prev_op(op) list_prev_entry(op, entry)
list_last_entry(head, typeof(*(pos)), member) : list_prev_entry(pos, member))
pos = list_prev_entry(pos, member))
for (pos = list_prev_entry(pos, member); \
pos = list_prev_entry(pos, member))
pos = list_prev_entry(pos, member))
n = list_prev_entry(pos, member); \
pos = n, n = list_prev_entry(n, member))
list_prev_entry(pos, node_list)
w = list_prev_entry(w, list);
w = list_prev_entry(w, list);
insert_entry = list_prev_entry(entry, link);
KUNIT_EXPECT_PTR_EQ(test, &test_struct1, list_prev_entry(&test_struct2,
prg = list_prev_entry(rg, link);
while ((page = list_prev_entry(page, lru)) != head) {
while ((page = list_prev_entry(page, lru)) != head) {
n = list_prev_entry(prev, list);
prule = list_prev_entry(rule, list);
pos = list_prev_entry(pos, member))
#define func_prev(func) list_prev_entry(func, l)
#define bb_prev(bb) list_prev_entry(bb, l)
pos = list_prev_entry(pos, member))
for (pos = list_prev_entry(pos, member); \
pos = list_prev_entry(pos, member))
n = list_prev_entry(pos, member); \
pos = n, n = list_prev_entry(n, member))
list_prev_entry(sym, list) : NULL
entry = list_prev_entry(entry, node);
struct disasm_line *pos = list_prev_entry(cursor, al.node);
pos = list_prev_entry(pos, al.node);
last_bb->end = list_prev_entry(last_bb->end, al.node);
prev = list_prev_entry(curr, al.node);
prev = list_prev_entry(prev, al.node);
struct evsel *pos = list_prev_entry(first_wildcard_match, core.node);