kc3-lang/libxkbcommon/src/util-list.h

Branch : - branch - android master - tag -

• Show log

  Commit

• Author : Pierre Le Marre
  Date : 2025-01-22 16:39:35
  Hash : 0c940827
  Message : clang-tidy: Macro arguments should be enclosed in parentheses

• src/util-list.h

• /*
   * Copyright © 2008-2011 Kristian Høgsberg
   * Copyright © 2011 Intel Corporation
   * Copyright © 2013-2015 Red Hat, Inc.
   *
   * Permission is hereby granted, free of charge, to any person obtaining a
   * copy of this software and associated documentation files (the "Software"),
   * to deal in the Software without restriction, including without limitation
   * the rights to use, copy, modify, merge, publish, distribute, sublicense,
   * and/or sell copies of the Software, and to permit persons to whom the
   * Software is furnished to do so, subject to the following conditions:
   *
   * The above copyright notice and this permission notice (including the next
   * paragraph) shall be included in all copies or substantial portions of the
   * Software.
   *
   * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
   * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
   * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL
   * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
   * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
   * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
   * DEALINGS IN THE SOFTWARE.
   */
  
  #pragma once
  
  #include "config.h"
  
  #include <stdbool.h>
  #include <stddef.h>
  
  /*
   * This list data structure is a verbatim copy from wayland-util.h from the
   * Wayland project; except that wl_ prefix has been removed.
   */
  
  struct list {
  	struct list *prev;
  	struct list *next;
  };
  
  void list_init(struct list *list);
  void list_insert(struct list *list, struct list *elm);
  void list_append(struct list *list, struct list *elm);
  void list_remove(struct list *elm);
  bool list_empty(const struct list *list);
  bool list_is_last(const struct list *list, const struct list *elm);
  
  #define container_of(ptr, type, member)					\
  	(__typeof__(type) *)((char *)(ptr) -				\
  		 offsetof(__typeof__(type), member))
  
  #define list_first_entry(head, pos, member)				\
  	container_of((head)->next, __typeof__(*(pos)), member)
  
  #define list_last_entry(head, pos, member)				\
  	container_of((head)->prev, __typeof__(*(pos)), member)
  
  #define list_for_each(pos, head, member)				\
  	for ((pos) = 0, (pos) = list_first_entry(head, pos, member);	\
  	     &(pos)->member != (head);					\
  	     (pos) = list_first_entry(&(pos)->member, pos, member))
  
  #define list_for_each_safe(pos, tmp, head, member)			\
  	for ((pos) = 0, (tmp) = 0,						\
  	     (pos) = list_first_entry(head, pos, member),			\
  	     (tmp) = list_first_entry(&(pos)->member, tmp, member);		\
  	     &(pos)->member != (head);					\
  	     (pos) = (tmp),							\
  	     (tmp) = list_first_entry(&(pos)->member, tmp, member))