Back to index

glibc  2.9
Functions
weightwc.h File Reference

Go to the source code of this file.

Functions

auto int32_t __attribute ((always_inline)) findidx(const wint_t **cpp)

Function Documentation

auto int32_t __attribute ( (always_inline)  ) const [inline]

Definition at line 22 of file weightwc.h.

{
  wint_t ch = *(*cpp)++;
  int32_t i = __collidx_table_lookup ((const char *) table, ch);

  if (i >= 0)
    /* This is an index into the weight table.  Cool.  */
    return i;

  /* Oh well, more than one sequence starting with this byte.
     Search for the correct one.  */
  const int32_t *cp = (const int32_t *) &extra[-i];
  while (1)
    {
      size_t nhere;
      const int32_t *usrc = (const int32_t *) *cpp;

      /* The first thing is the index.  */
      i = *cp++;

      /* Next is the length of the byte sequence.  These are always
        short byte sequences so there is no reason to call any
        function (even if they are inlined).  */
      nhere = *cp++;

      if (i >= 0)
       {
         /* It is a single character.  If it matches we found our
            index.  Note that at the end of each list there is an
            entry of length zero which represents the single byte
            sequence.  The first (and here only) byte was tested
            already.  */
         size_t cnt;

         for (cnt = 0; cnt < nhere; ++cnt)
           if (cp[cnt] != usrc[cnt])
             break;

         if (cnt == nhere)
           {
             /* Found it.  */
             *cpp += nhere;
             return i;
           }

         /* Up to the next entry.  */
         cp += nhere;
       }
      else
       {
         /* This is a range of characters.  First decide whether the
            current byte sequence lies in the range.  */
         size_t cnt;
         size_t offset;

         for (cnt = 0; cnt < nhere - 1; ++cnt)
           if (cp[cnt] != usrc[cnt])
             break;

         if (cnt < nhere - 1)
           {
             cp += 2 * nhere;
             continue;
           }

         if (cp[nhere - 1] > usrc[nhere -1])
           {
             cp += 2 * nhere;
             continue;
           }

         if (cp[2 * nhere - 1] < usrc[nhere -1])
           {
             cp += 2 * nhere;
             continue;
           }

         /* This range matches the next characters.  Now find
            the offset in the indirect table.  */
         offset = usrc[nhere - 1] - cp[nhere - 1];
         *cpp += nhere;

         return indirect[-i + offset];
       }
    }

  /* NOTREACHED */
  return 0x43219876;
}

Here is the call graph for this function: