~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

TOMOYO Linux Cross Reference
Linux/include/linux/union_find.h

Version: ~ [ linux-6.12-rc7 ] ~ [ linux-6.11.7 ] ~ [ linux-6.10.14 ] ~ [ linux-6.9.12 ] ~ [ linux-6.8.12 ] ~ [ linux-6.7.12 ] ~ [ linux-6.6.60 ] ~ [ linux-6.5.13 ] ~ [ linux-6.4.16 ] ~ [ linux-6.3.13 ] ~ [ linux-6.2.16 ] ~ [ linux-6.1.116 ] ~ [ linux-6.0.19 ] ~ [ linux-5.19.17 ] ~ [ linux-5.18.19 ] ~ [ linux-5.17.15 ] ~ [ linux-5.16.20 ] ~ [ linux-5.15.171 ] ~ [ linux-5.14.21 ] ~ [ linux-5.13.19 ] ~ [ linux-5.12.19 ] ~ [ linux-5.11.22 ] ~ [ linux-5.10.229 ] ~ [ linux-5.9.16 ] ~ [ linux-5.8.18 ] ~ [ linux-5.7.19 ] ~ [ linux-5.6.19 ] ~ [ linux-5.5.19 ] ~ [ linux-5.4.285 ] ~ [ linux-5.3.18 ] ~ [ linux-5.2.21 ] ~ [ linux-5.1.21 ] ~ [ linux-5.0.21 ] ~ [ linux-4.20.17 ] ~ [ linux-4.19.323 ] ~ [ linux-4.18.20 ] ~ [ linux-4.17.19 ] ~ [ linux-4.16.18 ] ~ [ linux-4.15.18 ] ~ [ linux-4.14.336 ] ~ [ linux-4.13.16 ] ~ [ linux-4.12.14 ] ~ [ linux-4.11.12 ] ~ [ linux-4.10.17 ] ~ [ linux-4.9.337 ] ~ [ linux-4.4.302 ] ~ [ linux-3.10.108 ] ~ [ linux-2.6.32.71 ] ~ [ linux-2.6.0 ] ~ [ linux-2.4.37.11 ] ~ [ unix-v6-master ] ~ [ ccs-tools-1.8.12 ] ~ [ policy-sample ] ~
Architecture: ~ [ i386 ] ~ [ alpha ] ~ [ m68k ] ~ [ mips ] ~ [ ppc ] ~ [ sparc ] ~ [ sparc64 ] ~

Diff markup

Differences between /include/linux/union_find.h (Architecture m68k) and /include/linux/union_find.h (Architecture ppc)


  1 /* SPDX-License-Identifier: GPL-2.0 */              1 /* SPDX-License-Identifier: GPL-2.0 */
  2 #ifndef __LINUX_UNION_FIND_H                        2 #ifndef __LINUX_UNION_FIND_H
  3 #define __LINUX_UNION_FIND_H                        3 #define __LINUX_UNION_FIND_H
  4 /**                                                 4 /**
  5  * union_find.h - union-find data structure im      5  * union_find.h - union-find data structure implementation
  6  *                                                  6  *
  7  * This header provides functions and structur      7  * This header provides functions and structures to implement the union-find
  8  * data structure. The union-find data structu      8  * data structure. The union-find data structure is used to manage disjoint
  9  * sets and supports efficient union and find       9  * sets and supports efficient union and find operations.
 10  *                                                 10  *
 11  * See Documentation/core-api/union_find.rst f     11  * See Documentation/core-api/union_find.rst for documentation and samples.
 12  */                                                12  */
 13                                                    13 
 14 struct uf_node {                                   14 struct uf_node {
 15         struct uf_node *parent;                    15         struct uf_node *parent;
 16         unsigned int rank;                         16         unsigned int rank;
 17 };                                                 17 };
 18                                                    18 
 19 /* This macro is used for static initializatio     19 /* This macro is used for static initialization of a union-find node. */
 20 #define UF_INIT_NODE(node)      {.parent = &no     20 #define UF_INIT_NODE(node)      {.parent = &node, .rank = 0}
 21                                                    21 
 22 /**                                                22 /**
 23  * uf_node_init - Initialize a union-find node     23  * uf_node_init - Initialize a union-find node
 24  * @node: pointer to the union-find node to be     24  * @node: pointer to the union-find node to be initialized
 25  *                                                 25  *
 26  * This function sets the parent of the node t     26  * This function sets the parent of the node to itself and
 27  * initializes its rank to 0.                      27  * initializes its rank to 0.
 28  */                                                28  */
 29 static inline void uf_node_init(struct uf_node     29 static inline void uf_node_init(struct uf_node *node)
 30 {                                                  30 {
 31         node->parent = node;                       31         node->parent = node;
 32         node->rank = 0;                            32         node->rank = 0;
 33 }                                                  33 }
 34                                                    34 
 35 /* find the root of a node */                      35 /* find the root of a node */
 36 struct uf_node *uf_find(struct uf_node *node);     36 struct uf_node *uf_find(struct uf_node *node);
 37                                                    37 
 38 /* Merge two intersecting nodes */                 38 /* Merge two intersecting nodes */
 39 void uf_union(struct uf_node *node1, struct uf     39 void uf_union(struct uf_node *node1, struct uf_node *node2);
 40                                                    40 
 41 #endif /* __LINUX_UNION_FIND_H */                  41 #endif /* __LINUX_UNION_FIND_H */
 42                                                    42 

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

kernel.org | git.kernel.org | LWN.net | Project Home | SVN repository | Mail admin

Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.

sflogo.php