+
+/* Return the number of decodable bits in this insn. */
+static int
+count_decodable_bits (insn)
+ const CGEN_INSN *insn;
+{
+ unsigned mask = CGEN_INSN_BASE_MASK (insn);
+ int bits = 0;
+ int m;
+ for (m = 1; m != 0; m <<= 1)
+ {
+ if (mask & m)
+ ++bits;
+ }
+ return bits;
+}
+
+/* Add an instruction to the hash chain. */
+static void
+add_insn_to_hash_chain (hentbuf, insn, htable, hash)
+ CGEN_INSN_LIST *hentbuf;
+ const CGEN_INSN *insn;
+ CGEN_INSN_LIST **htable;
+ unsigned int hash;
+{
+ CGEN_INSN_LIST *current_buf;
+ CGEN_INSN_LIST *previous_buf;
+ int insn_decodable_bits;
+
+ /* Add insns sorted by the number of decodable bits, in decreasing order.
+ This ensures that any insn which is a special case of another will be
+ checked first. */
+ insn_decodable_bits = count_decodable_bits (insn);
+ previous_buf = NULL;
+ for (current_buf = htable[hash]; current_buf != NULL;
+ current_buf = current_buf->next)
+ {
+ int current_decodable_bits = count_decodable_bits (current_buf->insn);
+ if (insn_decodable_bits >= current_decodable_bits)
+ break;
+ previous_buf = current_buf;
+ }
+
+ /* Now insert the new insn. */
+ hentbuf->insn = insn;
+ hentbuf->next = current_buf;
+ if (previous_buf == NULL)
+ htable[hash] = hentbuf;
+ else
+ previous_buf->next = hentbuf;
+}
+