Changeset 609 for branches/GNU/src/binutils/opcodes/cgen-opc.c

Timestamp:

Aug 16, 2003, 6:59:22 PM (22 years ago)

Author:

bird

Message:

binutils v2.14 - offical sources.

File:

• branches/GNU/src/binutils/opcodes/cgen-opc.c (modified) (7 diffs, 1 prop)

branches/GNU/src/binutils/opcodes/cgen-opc.c

@@ -21 +21 @@
 
 #include "sysdep.h"
-#include <ctype.h>
 #include <stdio.h>
 #include "ansidecl.h"
 #include "libiberty.h"
+#include "safe-ctype.h"
 #include "bfd.h"
 #include "symcat.h"
@@ -70 +70 @@
       while (*p
              && (*p == *n
-                 || (isalpha ((unsigned char) *p)
-                     && (tolower ((unsigned char) *p)
-                         == tolower ((unsigned char) *n)))))
+                 || (ISALPHA (*p) && (TOLOWER (*p) == TOLOWER (*n)))))
         ++n, ++p;
 
@@ -119 +117 @@
 {
   unsigned int hash;
+  size_t i;
 
   if (kt->name_hash_table == NULL)
@@ -133 +132 @@
   if (ke->name[0] == 0)
     kt->null_entry = ke;
+
+  for (i = 1; i < strlen (ke->name); i++)
+    if (! ISALNUM (ke->name[i])
+        && ! strchr (kt->nonalpha_chars, ke->name[i]))
+      {
+        size_t idx = strlen (kt->nonalpha_chars);
+        
+        /* If you hit this limit, please don't just
+           increase the size of the field, instead
+           look for a better algorithm.  */
+        if (idx >= sizeof (kt->nonalpha_chars) - 1)
+          abort ();
+        kt->nonalpha_chars[idx] = ke->name[i];
+        kt->nonalpha_chars[idx+1] = 0;
+      }
 }
 
@@ -217 +231 @@
   else
     for (hash = 0; *name; ++name)
-      hash = (hash * 97) + (unsigned char) tolower (*name);
+      hash = (hash * 97) + (unsigned char) TOLOWER (*name);
   return hash % kt->hash_table_size;
 }
@@ -379 +393 @@
      int length;
 {
-  bfd_get_bits (buf, length, cd->insn_endian == CGEN_ENDIAN_BIG);
+  int big_p = (cd->insn_endian == CGEN_ENDIAN_BIG);
+  int insn_chunk_bitsize = cd->insn_chunk_bitsize;
+  CGEN_INSN_INT value = 0;
+
+  if (insn_chunk_bitsize != 0 && insn_chunk_bitsize < length)
+    {
+      /* We need to divide up the incoming value into insn_chunk_bitsize-length
+         segments, and endian-convert them, one at a time. */
+      int i;
+
+      /* Enforce divisibility. */ 
+      if ((length % insn_chunk_bitsize) != 0)
+        abort ();
+
+      for (i = 0; i < length; i += insn_chunk_bitsize) /* NB: i == bits */
+        {
+          int index;
+          bfd_vma this_value;
+          index = i; /* NB: not dependent on endianness; opposite of cgen_put_insn_value! */
+          this_value = bfd_get_bits (& buf[index / 8], insn_chunk_bitsize, big_p);
+          value = (value << insn_chunk_bitsize) | this_value;
+        }
+    }
+  else
+    {
+      value = bfd_get_bits (buf, length, cd->insn_endian == CGEN_ENDIAN_BIG);
+    }
+
+  return value;
 }
 
@@ -391 +433 @@
      CGEN_INSN_INT value;
 {
-  bfd_put_bits ((bfd_vma) value, buf, length,
-                cd->insn_endian == CGEN_ENDIAN_BIG);
+  int big_p = (cd->insn_endian == CGEN_ENDIAN_BIG);
+  int insn_chunk_bitsize = cd->insn_chunk_bitsize;
+
+  if (insn_chunk_bitsize != 0 && insn_chunk_bitsize < length)
+    {
+      /* We need to divide up the incoming value into insn_chunk_bitsize-length
+         segments, and endian-convert them, one at a time. */
+      int i;
+
+      /* Enforce divisibility. */ 
+      if ((length % insn_chunk_bitsize) != 0)
+        abort ();
+
+      for (i = 0; i < length; i += insn_chunk_bitsize) /* NB: i == bits */
+        {
+          int index;
+          index = (length - insn_chunk_bitsize - i); /* NB: not dependent on endianness! */
+          bfd_put_bits ((bfd_vma) value, & buf[index / 8], insn_chunk_bitsize, big_p);
+          value >>= insn_chunk_bitsize;
+        }
+    }
+  else
+    {
+      bfd_put_bits ((bfd_vma) value, buf, length, big_p);
+    }
 }