Lines Matching defs:reverse
894 /* If reverse is false, then we search for the first flow table in the
900 bool reverse)
902 #define list_advance_entry(pos, reverse) \
903 ((reverse) ? list_prev_entry(pos, list) : list_next_entry(pos, list))
905 #define list_for_each_advance_continue(pos, head, reverse) \
906 for (pos = list_advance_entry(pos, reverse); \
908 pos = list_advance_entry(pos, reverse))
916 list_for_each_advance_continue(iter, &root->children, reverse) {
921 ft = find_closest_ft_recursive(iter, &iter->children, reverse);
945 /* If reverse is false then return the first flow table next to the passed node
949 static struct mlx5_flow_table *find_closest_ft(struct fs_node *node, bool reverse,
964 reverse);
1019 bool reverse)
1023 ft = find_closest_ft(node, reverse, false);