/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-â
âvi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8                                :viâ
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ¡
â Copyright 2022 Justine Alexandra Roberts Tunney                              â
â                                                                              â
â Permission to use, copy, modify, and/or distribute this software for         â
â any purpose with or without fee is hereby granted, provided that the         â
â above copyright notice and this permission notice appear in all copies.      â
â                                                                              â
â THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL                â
â WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED                â
â WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE             â
â AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL         â
â DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR        â
â PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER               â
â TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR             â
â PERFORMANCE OF THIS SOFTWARE.                                                â
ââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââââ*/
#include "libc/intrin/describeflags.internal.h"

// TODO(jart): Fork this function into ASAN and non-ASAN versions.
const char *DescribeFlags(char *p, size_t n, struct DescribeFlags *d, size_t m,
                          const char *prefix, unsigned x) {
  bool t;
  char b[21];
  size_t i, j, k;
  for (t = i = j = 0; j < m; ++j) {
    if (d[j].flag && d[j].flag != -1 && (x & d[j].flag) == d[j].flag) {
      x &= ~d[j].flag;
      if (t) {
        if (i + 1 < n) p[i++] = '|';
      } else {
        t = true;
      }
      for (k = 0; prefix && prefix[k]; ++k) {
        if (i + 1 < n) p[i++] = prefix[k];
      }
      for (k = 0; d[j].name[k]; ++k) {
        if (i + 1 < n) p[i++] = d[j].name[k];
      }
    }
  }
  if (x || !t) {
    if (t && i + 1 < n) p[i++] = '|';
    if (i + 1 < n) p[i++] = '0';
    if (x) {
      if (i + 1 < n) p[i++] = 'x';
      k = 0;
      do {
        if (i + 1 < n) b[k++] = "0123456789abcdef"[x % 16];
      } while ((x /= 16));
      while (k--) {
        if (i + 1 < n) p[i++] = b[k];
      }
    }
  }
  if (i < n) p[i] = 0;
  return p;
}
