/root/src/xen/xen/include/xen/nodemask.h

Source (jump to first uncovered line)
#ifndef __LINUX_NODEMASK_H
#define __LINUX_NODEMASK_H

/*
 * Nodemasks provide a bitmap suitable for representing the
 * set of Node's in a system, one bit position per Node number.
 *
 * See detailed comments in the file linux/bitmap.h describing the
 * data type on which these nodemasks are based.
 *
 * For details of nodemask_scnprintf(), nodelist_scnpintf() and
 * nodemask_parse(), see bitmap_scnprintf() and bitmap_parse()
 * in lib/bitmap.c.
 *
 * The available nodemask operations are:
 *
 * void node_set(node, mask)    turn on bit 'node' in mask
 * void node_clear(node, mask)    turn off bit 'node' in mask
 * void nodes_setall(mask)    set all bits
 * void nodes_clear(mask)   clear all bits
 * int node_isset(node, mask)   true iff bit 'node' set in mask
 * int node_test_and_set(node, mask)  test and set bit 'node' in mask
 *
 * void nodes_and(dst, src1, src2)  dst = src1 & src2  [intersection]
 * void nodes_or(dst, src1, src2) dst = src1 | src2  [union]
 * void nodes_xor(dst, src1, src2)  dst = src1 ^ src2
 * void nodes_andnot(dst, src1, src2) dst = src1 & ~src2
 * void nodes_complement(dst, src)  dst = ~src
 *
 * int nodes_equal(mask1, mask2)  Does mask1 == mask2?
 * int nodes_intersects(mask1, mask2) Do mask1 and mask2 intersect?
 * int nodes_subset(mask1, mask2) Is mask1 a subset of mask2?
 * int nodes_empty(mask)    Is mask empty (no bits sets)?
 * int nodes_full(mask)     Is mask full (all bits sets)?
 * int nodes_weight(mask)   Hamming weight - number of set bits
 *
 * void nodes_shift_right(dst, src, n)  Shift right
 * void nodes_shift_left(dst, src, n) Shift left
 *
 * int first_node(mask)     Number lowest set bit, or MAX_NUMNODES
 * int next_node(node, mask)    Next node past 'node', or MAX_NUMNODES
 * int last_node(mask)      Number highest set bit, or MAX_NUMNODES
 * int first_unset_node(mask)   First node not set in mask, or 
 *          MAX_NUMNODES.
 * int cycle_node(node, mask)   Next node cycling from 'node', or
 *          MAX_NUMNODES
 *
 * nodemask_t nodemask_of_node(node)  Return nodemask with bit 'node' set
 * NODE_MASK_ALL      Initializer - all bits set
 * NODE_MASK_NONE     Initializer - no bits set
 * unsigned long *nodes_addr(mask)  Array of unsigned long's in mask
 *
 * int nodemask_scnprintf(buf, len, mask) Format nodemask for printing
 * int nodelist_scnprintf(buf, len, mask) Format nodemask as a list for printing
 * int nodemask_parse(ubuf, ulen, mask) Parse ascii string as nodemask
 *
 * for_each_node_mask(node, mask) for-loop node over mask
 *
 * int num_online_nodes()   Number of online Nodes
 *
 * int node_online(node)    Is some node online?
 *
 * int any_online_node(mask)    First online node in mask
 *
 * node_set_online(node)    set bit 'node' in node_online_map
 * node_set_offline(node)   clear bit 'node' in node_online_map
 *
 * for_each_online_node(node)   for-loop node over node_online_map
 *
 * Subtlety:
 * 1) The 'type-checked' form of node_isset() causes gcc (3.3.2, anyway)
 *    to generate slightly worse code.  So use a simple one-line #define
 *    for node_isset(), instead of wrapping an inline inside a macro, the
 *    way we do the other calls.
 */

#include <xen/kernel.h>
#include <xen/bitmap.h>
#include <xen/numa.h>

typedef struct { DECLARE_BITMAP(bits, MAX_NUMNODES); } nodemask_t;
extern nodemask_t _unused_nodemask_arg_;

#define node_set(node, dst) __node_set((node), &(dst))
static inline void __node_set(int node, volatile nodemask_t *dstp)
{
  set_bit(node, dstp->bits);
}

#define node_clear(node, dst) __node_clear((node), &(dst))
static inline void __node_clear(int node, volatile nodemask_t *dstp)
{
  clear_bit(node, dstp->bits);
}

#define nodes_setall(dst) __nodes_setall(&(dst), MAX_NUMNODES)
static inline void __nodes_setall(nodemask_t *dstp, int nbits)
{
  bitmap_fill(dstp->bits, nbits);
}

#define nodes_clear(dst) __nodes_clear(&(dst), MAX_NUMNODES)
static inline void __nodes_clear(nodemask_t *dstp, int nbits)
{
  bitmap_zero(dstp->bits, nbits);
}

/* No static inline type checking - see Subtlety (1) above. */
#define node_isset(node, nodemask) test_bit((node), (nodemask).bits)

#define node_test_and_set(node, nodemask) \
      __node_test_and_set((node), &(nodemask))
static inline int __node_test_and_set(int node, nodemask_t *addr)
{
  return test_and_set_bit(node, addr->bits);
}

#define nodes_and(dst, src1, src2) \
      __nodes_and(&(dst), &(src1), &(src2), MAX_NUMNODES)
static inline void __nodes_and(nodemask_t *dstp, const nodemask_t *src1p,
          const nodemask_t *src2p, int nbits)
{
  bitmap_and(dstp->bits, src1p->bits, src2p->bits, nbits);
}

#define nodes_or(dst, src1, src2) \
      __nodes_or(&(dst), &(src1), &(src2), MAX_NUMNODES)
static inline void __nodes_or(nodemask_t *dstp, const nodemask_t *src1p,
          const nodemask_t *src2p, int nbits)
{
  bitmap_or(dstp->bits, src1p->bits, src2p->bits, nbits);
}

#define nodes_xor(dst, src1, src2) \
      __nodes_xor(&(dst), &(src1), &(src2), MAX_NUMNODES)
static inline void __nodes_xor(nodemask_t *dstp, const nodemask_t *src1p,
          const nodemask_t *src2p, int nbits)
{
  bitmap_xor(dstp->bits, src1p->bits, src2p->bits, nbits);
}

#define nodes_andnot(dst, src1, src2) \
      __nodes_andnot(&(dst), &(src1), &(src2), MAX_NUMNODES)
static inline void __nodes_andnot(nodemask_t *dstp, const nodemask_t *src1p,
          const nodemask_t *src2p, int nbits)
{
  bitmap_andnot(dstp->bits, src1p->bits, src2p->bits, nbits);
}

#define nodes_complement(dst, src) \
      __nodes_complement(&(dst), &(src), MAX_NUMNODES)
static inline void __nodes_complement(nodemask_t *dstp,
          const nodemask_t *srcp, int nbits)
{
  bitmap_complement(dstp->bits, srcp->bits, nbits);
}

#define nodes_equal(src1, src2) \
      __nodes_equal(&(src1), &(src2), MAX_NUMNODES)
static inline int __nodes_equal(const nodemask_t *src1p,
          const nodemask_t *src2p, int nbits)
{
  return bitmap_equal(src1p->bits, src2p->bits, nbits);
}

#define nodes_intersects(src1, src2) \
      __nodes_intersects(&(src1), &(src2), MAX_NUMNODES)
static inline int __nodes_intersects(const nodemask_t *src1p,
          const nodemask_t *src2p, int nbits)
{
  return bitmap_intersects(src1p->bits, src2p->bits, nbits);
}

#define nodes_subset(src1, src2) \
      __nodes_subset(&(src1), &(src2), MAX_NUMNODES)
static inline int __nodes_subset(const nodemask_t *src1p,
          const nodemask_t *src2p, int nbits)
{
  return bitmap_subset(src1p->bits, src2p->bits, nbits);
}

#define nodes_empty(src) __nodes_empty(&(src), MAX_NUMNODES)
static inline int __nodes_empty(const nodemask_t *srcp, int nbits)
{
  return bitmap_empty(srcp->bits, nbits);
}

#define nodes_full(nodemask) __nodes_full(&(nodemask), MAX_NUMNODES)
static inline int __nodes_full(const nodemask_t *srcp, int nbits)
{
  return bitmap_full(srcp->bits, nbits);
}

#define nodes_weight(nodemask) __nodes_weight(&(nodemask), MAX_NUMNODES)
static inline int __nodes_weight(const nodemask_t *srcp, int nbits)
{
  return bitmap_weight(srcp->bits, nbits);
}

#define nodes_shift_right(dst, src, n) \
      __nodes_shift_right(&(dst), &(src), (n), MAX_NUMNODES)
static inline void __nodes_shift_right(nodemask_t *dstp,
          const nodemask_t *srcp, int n, int nbits)
{
  bitmap_shift_right(dstp->bits, srcp->bits, n, nbits);
}

#define nodes_shift_left(dst, src, n) \
      __nodes_shift_left(&(dst), &(src), (n), MAX_NUMNODES)
static inline void __nodes_shift_left(nodemask_t *dstp,
          const nodemask_t *srcp, int n, int nbits)
{
  bitmap_shift_left(dstp->bits, srcp->bits, n, nbits);
}

/* FIXME: better would be to fix all architectures to never return
          > MAX_NUMNODES, then the silly min_ts could be dropped. */

#define first_node(src) __first_node(&(src), MAX_NUMNODES)
static inline int __first_node(const nodemask_t *srcp, int nbits)
{
  return min_t(int, nbits, find_first_bit(srcp->bits, nbits));
}

#define next_node(n, src) __next_node((n), &(src), MAX_NUMNODES)
static inline int __next_node(int n, const nodemask_t *srcp, int nbits)
{
  return min_t(int, nbits, find_next_bit(srcp->bits, nbits, n+1));
}

#define last_node(src) __last_node(&(src), MAX_NUMNODES)
static inline int __last_node(const nodemask_t *srcp, int nbits)
{
  int node, pnode = nbits;
  for (node = __first_node(srcp, nbits);
       node < nbits;
       node = __next_node(node, srcp, nbits))
    pnode = node;
  return pnode;
}

#define nodemask_of_node(node)            \
({                  \
  typeof(_unused_nodemask_arg_) m;        \
  if (sizeof(m) == sizeof(unsigned long)) {     \
    m.bits[0] = 1UL<<(node);        \
  } else {              \
    nodes_clear(m);           \
    node_set((node), m);          \
  }               \
  m;                \
})

#define first_unset_node(mask) __first_unset_node(&(mask))
static inline int __first_unset_node(const nodemask_t *maskp)
{
  return min_t(int,MAX_NUMNODES,
      find_first_zero_bit(maskp->bits, MAX_NUMNODES));
}

#define cycle_node(n, src) __cycle_node((n), &(src), MAX_NUMNODES)
static inline int __cycle_node(int n, const nodemask_t *maskp, int nbits)
{
    int nxt = __next_node(n, maskp, nbits);

    if (nxt == nbits)
        nxt = __first_node(maskp, nbits);
    return nxt;
}

#define NODE_MASK_LAST_WORD BITMAP_LAST_WORD_MASK(MAX_NUMNODES)

#if MAX_NUMNODES <= BITS_PER_LONG

#define NODE_MASK_ALL             \
((nodemask_t) { {             \
  [BITS_TO_LONGS(MAX_NUMNODES)-1] = NODE_MASK_LAST_WORD    \
} })

#else

#define NODE_MASK_ALL             \
((nodemask_t) { {             \
  [0 ... BITS_TO_LONGS(MAX_NUMNODES)-2] = ~0UL,     \
  [BITS_TO_LONGS(MAX_NUMNODES)-1] = NODE_MASK_LAST_WORD   \
} })

#endif

#define NODE_MASK_NONE              \
((nodemask_t) { {             \
  [0 ... BITS_TO_LONGS(MAX_NUMNODES)-1] =  0UL      \
} })

#define nodes_addr(src) ((src).bits)

#define nodelist_scnprintf(buf, len, src) \
      __nodelist_scnprintf((buf), (len), (src), MAX_NUMNODES)
static inline int __nodelist_scnprintf(char *buf, int len,
          const nodemask_t *srcp, int nbits)
{
  return bitmap_scnlistprintf(buf, len, srcp->bits, nbits);
}

#if 0
#define nodemask_scnprintf(buf, len, src) \
      __nodemask_scnprintf((buf), (len), &(src), MAX_NUMNODES)
static inline int __nodemask_scnprintf(char *buf, int len,
          const nodemask_t *srcp, int nbits)
{
  return bitmap_scnprintf(buf, len, srcp->bits, nbits);
}

#define nodemask_parse(ubuf, ulen, dst) \
      __nodemask_parse((ubuf), (ulen), &(dst), MAX_NUMNODES)
static inline int __nodemask_parse(const char __user *buf, int len,
          nodemask_t *dstp, int nbits)
{
  return bitmap_parse(buf, len, dstp->bits, nbits);
}
#endif

#if MAX_NUMNODES > 1
#define for_each_node_mask(node, mask)      \
  for ((node) = first_node(mask);     \
    (node) < MAX_NUMNODES;     \
    (node) = next_node((node), (mask)))
#else /* MAX_NUMNODES == 1 */
#define for_each_node_mask(node, mask)      \
  if (!nodes_empty(mask))       \
    for ((node) = 0; (node) < 1; (node)++)
#endif /* MAX_NUMNODES */

/*
 * The following particular system nodemasks and operations
 * on them manage online nodes.
 */

extern nodemask_t node_online_map;

#if MAX_NUMNODES > 1
#define num_online_nodes()  nodes_weight(node_online_map)
#define node_online(node) node_isset((node), node_online_map)
#else
#define num_online_nodes()  1
#define node_online(node) ((node) == 0)
#endif

#define any_online_node(mask)     \
({            \
  int node;       \
  for_each_node_mask(node, (mask))  \
    if (node_online(node))    \
      break;      \
  node;         \
})

#define node_set_online(node)    set_bit((node), node_online_map.bits)
#define node_set_offline(node)     clear_bit((node), node_online_map.bits)

#define for_each_online_node(node) for_each_node_mask((node), node_online_map)

#endif /* __LINUX_NODEMASK_H */

Coverage Report

Created: 2017-10-25 09:10