1726   struct disent *ent;  local
1730       ent = which;
1732       ent->nextcnt++;
1733       while (ent->nexte != NULL)
1734 	ent = ent->nexte;
1736       ent = (ent->nexte = tmalloc (struct disent));
1740       ent = tmalloc (struct disent);
1741       ent->next_ent = disinsntable;
1742       disinsntable = ent;
1743       which = ent;
1745   ent->nextcnt = 0;
1746   ent->nexte = NULL;
1747   ent->insn = insn;
1748   ent->priority = order;
1755   ent->completer_index = ci;
1762   struct disent *ent = disinsntable;  in finish_distable()  local
1763   struct disent *prev = ent;  in finish_distable()
1765   ent->ournum = 32768;  in finish_distable()
1766   while ((ent = ent->next_ent) != NULL)  in finish_distable()
1768       ent->ournum = prev->ournum + prev->nextcnt + 1;  in finish_distable()
1769       prev = ent;  in finish_distable()
1815 add_dis_entry (first, opcode, mask, opcodenum, ent, completer_index)  in add_dis_entry()  argument
1820      struct completer_entry *ent;
1826   while (ent != NULL)
1828       ia64_insn newopcode = (opcode & (~ ent->mask)) | ent->bits;
1829       add_dis_entry (first, newopcode, mask, opcodenum, ent->addl_entries,
1832       if (ent->is_terminal)
1835                                 opcodenum, opcode_count - ent->order - 1, 
1839       ent = ent->alternative;
1845 compact_distree (ent)  in compact_distree()  argument
1846      struct bittree *ent;  in compact_distree()
1848 #define IS_SKIP(ent) \  argument
1849     ((ent->bits[2] !=NULL) \
1850      && (ent->bits[0] == NULL && ent->bits[1] == NULL && ent->skip_flag == 0))
1853   struct bittree *nent = ent;
1864       struct bittree *next = ent->bits[2];
1866       ent->bits[0] = nent->bits[0];
1867       ent->bits[1] = nent->bits[1];
1868       ent->bits[2] = nent->bits[2];
1869       ent->disent = nent->disent;
1870       ent->skip_flag = 1;
1871       ent->bits_to_skip = bitcnt;
1883       struct bittree *i = ent->bits[x];
1897 gen_dis_table (ent)  in gen_dis_table()  argument
1898      struct bittree *ent;  in gen_dis_table()
1910   if (ent->skip_flag && ent->bits[0] == NULL && ent->bits[1] == NULL &&
1911       ent->bits[2] == NULL)
1913       if (ent->disent == NULL)
1916 	ent->skip_flag = 0;
1921   if (ent->skip_flag)
1925     if (ent->bits[x] != NULL)
1928   if (ent->disent != NULL)
1930       if (ent->bits[2] != NULL)
1949   if (ent->skip_flag)
1952       insn_list[our_offset + 0] |= 0x40 | ((ent->bits_to_skip >> 2) & 0xf);
1953       insn_list[our_offset + 1] |= ((ent->bits_to_skip & 3) << 6);
1962   if (ent->bits[0] != NULL)
1964       struct bittree *nent = ent->bits[0];
1974       if (IS_ONLY_IFZERO (ent))
1993       if (ent->bits[x] != NULL || (x == 2 && ent->disent != NULL))
1995 	  struct bittree *i = ent->bits[x];
2014 	    idest = ent->disent->ournum;
2052 	      if (ent->bits[0] == NULL && ent->bits[1] == NULL
2053 		  && ent->bits[2] == NULL && ent->skip_flag == 0
2054 		  && ent->disent != NULL
2055 		  && ent->disent->ournum < (32768 + 4096))
2109       if (ent->skip_flag)
2110 	printf ("%d: skipping %d\n", our_offset, ent->bits_to_skip);
2112       if (ent->bits[0] != NULL)
2140       struct disent *ent = cent;  in print_dis_table()  local
2142       while (ent != NULL)  in print_dis_table()
2144 	  printf ("{ 0x%x, %d, %d, %d },\n", ent->completer_index,  in print_dis_table()
2145 		  ent->insn, (ent->nexte != NULL ? 1 : 0),  in print_dis_table()
2146                   ent->priority);  in print_dis_table()
2147 	  ent = ent->nexte;  in print_dis_table()
2249 insert_gclist (struct completer_entry *ent)  in insert_gclist()  argument
2251   if (ent != NULL)  in insert_gclist()
2257       ent->addl_entries = insert_gclist (ent->addl_entries);  in insert_gclist()
2258       ent->alternative = insert_gclist (ent->alternative);  in insert_gclist()
2272 	  glist[0] = ent;  in insert_gclist()
2274 	  return ent;  in insert_gclist()
2277       if (ent->name->num < glist[0]->name->num)  in insert_gclist()
2279       else if (ent->name->num > glist[end - 1]->name->num)  in insert_gclist()
2288 	      c = ent->name->num - glist[i]->name->num;  in insert_gclist()
2295 			 && ent->name->num == glist[i - 1]->name->num)  in insert_gclist()
2311 		  if (ent->name->num != glist[i]->name->num)  in insert_gclist()
2314 		  if (completer_entries_eq (ent, glist[i]))  in insert_gclist()
2323 	if (ent->name->num >= glist[i - 1]->name->num)  in insert_gclist()
2327 	if (ent->name->num < glist[i]->name->num)  in insert_gclist()
2333       glist[i] = ent;  in insert_gclist()
2336   return ent;  in insert_gclist()
2356 compute_completer_bits (ment, ent)  in compute_completer_bits()  argument
2358      struct completer_entry *ent;
2360   while (ent != NULL)
2362       compute_completer_bits (ment, ent->addl_entries);
2364       if (ent->is_terminal)
2367 	  ia64_insn our_bits = ent->bits;
2368 	  struct completer_entry *p = ent->parent;
2389 	  ent->bits = our_bits;
2390 	  ent->mask = mask;
2394 	  ent->bits = 0;
2395 	  ent->mask = 0;
2398       ent = ent->alternative;
2592 print_completer_entry (ent)  in print_completer_entry()  argument
2593      struct completer_entry *ent;  in print_completer_entry()
2596   ia64_insn mask = ent->mask, bits = ent->bits;
2614 	  ent->name->num,
2615 	  ent->alternative != NULL ? ent->alternative->num : -1,
2616 	  ent->addl_entries != NULL ? ent->addl_entries->num : -1,
2618 	  ent->is_terminal ? 1 : 0,
2619           ent->dependencies);