binutils/opcodes/ia64-gen.c

1732   struct disent *ent;
1736       ent = which;
1738       ent->nextcnt++;
1739       while (ent->nexte != NULL)
1740 	ent = ent->nexte;
1742       ent = (ent->nexte = tmalloc (struct disent));
1746       ent = tmalloc (struct disent);
1747       ent->next_ent = disinsntable;
1748       disinsntable = ent;
1749       which = ent;
1751   ent->nextcnt = 0;
1752   ent->nexte = NULL;
1753   ent->insn = insn;
1754   ent->priority = order;
1761   ent->completer_index = ci;
1769   struct disent *ent = disinsntable;
1770   struct disent *prev = ent;
1772   ent->ournum = 32768;
1773   while ((ent = ent->next_ent) != NULL)
1775       ent->ournum = prev->ournum + prev->nextcnt + 1;
1776       prev = ent;
1824 add_dis_entry (first, opcode, mask, opcodenum, ent, completer_index)
1829      struct completer_entry *ent;
1835   while (ent != NULL)
1837       ia64_insn newopcode = (opcode & (~ ent->mask)) | ent->bits;
1838       add_dis_entry (first, newopcode, mask, opcodenum, ent->addl_entries,
1841       if (ent->is_terminal)
1844                                 opcodenum, opcode_count - ent->order - 1,
1848       ent = ent->alternative;
1855 compact_distree (ent)
1856      struct bittree *ent;
1858 #define IS_SKIP(ent) \
1859     ((ent->bits[2] !=NULL) \
1860      && (ent->bits[0] == NULL && ent->bits[1] == NULL && ent->skip_flag == 0))
1863   struct bittree *nent = ent;
1874       struct bittree *next = ent->bits[2];
1876       ent->bits[0] = nent->bits[0];
1877       ent->bits[1] = nent->bits[1];
1878       ent->bits[2] = nent->bits[2];
1879       ent->disent = nent->disent;
1880       ent->skip_flag = 1;
1881       ent->bits_to_skip = bitcnt;
1893       struct bittree *i = ent->bits[x];
1908 gen_dis_table (ent)
1909      struct bittree *ent;
1921   if (ent->skip_flag && ent->bits[0] == NULL && ent->bits[1] == NULL &&
1922       ent->bits[2] == NULL)
1924       if (ent->disent == NULL)
1927 	ent->skip_flag = 0;
1932   if (ent->skip_flag)
1936     if (ent->bits[x] != NULL)
1939   if (ent->disent != NULL)
1941       if (ent->bits[2] != NULL)
1960   if (ent->skip_flag)
1963       insn_list[our_offset + 0] |= 0x40 | ((ent->bits_to_skip >> 2) & 0xf);
1964       insn_list[our_offset + 1] |= ((ent->bits_to_skip & 3) << 6);
1973   if (ent->bits[0] != NULL)
1975       struct bittree *nent = ent->bits[0];
1985       if (IS_ONLY_IFZERO (ent))
2004       if (ent->bits[x] != NULL || (x == 2 && ent->disent != NULL))
2006 	  struct bittree *i = ent->bits[x];
2025 	    idest = ent->disent->ournum;
2063 	      if (ent->bits[0] == NULL && ent->bits[1] == NULL
2064 		  && ent->bits[2] == NULL && ent->skip_flag == 0
2065 		  && ent->disent != NULL
2066 		  && ent->disent->ournum < (32768 + 4096))
2120       if (ent->skip_flag)
2121 	printf ("%d: skipping %d\n", our_offset, ent->bits_to_skip);
2123       if (ent->bits[0] != NULL)
2152       struct disent *ent = cent;
2154       while (ent != NULL)
2156 	  printf ("{ 0x%x, %d, %d, %d },\n", ent->completer_index,
2157 		  ent->insn, (ent->nexte != NULL ? 1 : 0),
2158                   ent->priority);
2159 	  ent = ent->nexte;
2265 insert_gclist (struct completer_entry *ent)
2267   if (ent != NULL)
2273       ent->addl_entries = insert_gclist (ent->addl_entries);
2274       ent->alternative = insert_gclist (ent->alternative);
2288 	  glist[0] = ent;
2290 	  return ent;
2293       if (ent->name->num < glist[0]->name->num)
2295       else if (ent->name->num > glist[end - 1]->name->num)
2304 	      c = ent->name->num - glist[i]->name->num;
2311 			 && ent->name->num == glist[i - 1]->name->num)
2327 		  if (ent->name->num != glist[i]->name->num)
2330 		  if (completer_entries_eq (ent, glist[i]))
2339 	if (ent->name->num >= glist[i - 1]->name->num)
2343 	if (ent->name->num < glist[i]->name->num)
2349       glist[i] = ent;
2352   return ent;
2374 compute_completer_bits (ment, ent)
2376      struct completer_entry *ent;
2378   while (ent != NULL)
2380       compute_completer_bits (ment, ent->addl_entries);
2382       if (ent->is_terminal)
2385 	  ia64_insn our_bits = ent->bits;
2386 	  struct completer_entry *p = ent->parent;
2407 	  ent->bits = our_bits;
2408 	  ent->mask = mask;
2412 	  ent->bits = 0;
2413 	  ent->mask = 0;
2416       ent = ent->alternative;
2614 print_completer_entry (ent)
2615      struct completer_entry *ent;
2618   ia64_insn mask = ent->mask, bits = ent->bits;
2636 	  ent->name->num,
2637 	  ent->alternative != NULL ? ent->alternative->num : -1,
2638 	  ent->addl_entries != NULL ? ent->addl_entries->num : -1,
2640 	  ent->is_terminal ? 1 : 0,
2641           ent->dependencies);