Lines Matching refs:ENT
1738 struct disent *ent;
1742 ent = which;
1744 ent->nextcnt++;
1745 while (ent->nexte != NULL)
1746 ent = ent->nexte;
1748 ent = (ent->nexte = tmalloc (struct disent));
1752 ent = tmalloc (struct disent);
1753 ent->next_ent = disinsntable;
1754 disinsntable = ent;
1755 which = ent;
1757 ent->nextcnt = 0;
1758 ent->nexte = NULL;
1759 ent->insn = insn;
1760 ent->priority = order;
1767 ent->completer_index = ci;
1775 struct disent *ent = disinsntable;
1776 struct disent *prev = ent;
1778 ent->ournum = 32768;
1779 while ((ent = ent->next_ent) != NULL)
1781 ent->ournum = prev->ournum + prev->nextcnt + 1;
1782 prev = ent;
1825 int opcodenum, struct completer_entry *ent, ci_t completer_index)
1830 while (ent != NULL)
1832 ia64_insn newopcode = (opcode & (~ ent->mask)) | ent->bits;
1833 add_dis_entry (first, newopcode, mask, opcodenum, ent->addl_entries,
1836 if (ent->is_terminal)
1839 opcodenum, opcode_count - ent->order - 1,
1843 ent = ent->alternative;
1850 compact_distree (struct bittree *ent)
1852 #define IS_SKIP(ent) \
1853 ((ent->bits[2] !=NULL) \
1854 && (ent->bits[0] == NULL && ent->bits[1] == NULL && ent->skip_flag == 0))
1857 struct bittree *nent = ent;
1868 struct bittree *next = ent->bits[2];
1870 ent->bits[0] = nent->bits[0];
1871 ent->bits[1] = nent->bits[1];
1872 ent->bits[2] = nent->bits[2];
1873 ent->disent = nent->disent;
1874 ent->skip_flag = 1;
1875 ent->bits_to_skip = bitcnt;
1887 struct bittree *i = ent->bits[x];
1900 in ENT. */
1902 gen_dis_table (struct bittree *ent)
1914 if (ent->skip_flag && ent->bits[0] == NULL && ent->bits[1] == NULL &&
1915 ent->bits[2] == NULL)
1917 if (ent->disent == NULL)
1920 ent->skip_flag = 0;
1925 if (ent->skip_flag)
1929 if (ent->bits[x] != NULL)
1932 if (ent->disent != NULL)
1934 if (ent->bits[2] != NULL)
1953 if (ent->skip_flag)
1956 insn_list[our_offset + 0] |= 0x40 | ((ent->bits_to_skip >> 2) & 0xf);
1957 insn_list[our_offset + 1] |= ((ent->bits_to_skip & 3) << 6);
1960 #define IS_ONLY_IFZERO(ENT) \
1961 ((ENT)->bits[0] != NULL && (ENT)->bits[1] == NULL && (ENT)->bits[2] == NULL \
1962 && (ENT)->disent == NULL && (ENT)->skip_flag == 0)
1966 if (ent->bits[0] != NULL)
1968 struct bittree *nent = ent->bits[0];
1978 if (IS_ONLY_IFZERO (ent))
1997 if (ent->bits[x] != NULL || (x == 2 && ent->disent != NULL))
1999 struct bittree *i = ent->bits[x];
2018 idest = ent->disent->ournum;
2056 if (ent->bits[0] == NULL && ent->bits[1] == NULL
2057 && ent->bits[2] == NULL && ent->skip_flag == 0
2058 && ent->disent != NULL
2059 && ent->disent->ournum < (32768 + 4096))
2113 if (ent->skip_flag)
2114 printf ("%d: skipping %d\n", our_offset, ent->bits_to_skip);
2116 if (ent->bits[0] != NULL)
2145 struct disent *ent = cent;
2147 while (ent != NULL)
2149 printf ("{ 0x%lx, %d, %d, %d },\n", ( long ) ent->completer_index,
2150 ent->insn, (ent->nexte != NULL ? 1 : 0),
2151 ent->priority);
2152 ent = ent->nexte;
2254 /* Insert ENT into the global list of completers and return it. If an
2258 insert_gclist (struct completer_entry *ent)
2260 if (ent != NULL)
2266 ent->addl_entries = insert_gclist (ent->addl_entries);
2267 ent->alternative = insert_gclist (ent->alternative);
2281 glist[0] = ent;
2283 return ent;
2286 if (ent->name->num < glist[0]->name->num)
2288 else if (ent->name->num > glist[end - 1]->name->num)
2297 c = ent->name->num - glist[i]->name->num;
2304 && ent->name->num == glist[i - 1]->name->num)
2320 if (ent->name->num != glist[i]->name->num)
2323 if (completer_entries_eq (ent, glist[i]))
2332 if (ent->name->num >= glist[i - 1]->name->num)
2336 if (ent->name->num < glist[i]->name->num)
2342 glist[i] = ent;
2345 return ent;
2366 compute_completer_bits (struct main_entry *ment, struct completer_entry *ent)
2368 while (ent != NULL)
2370 compute_completer_bits (ment, ent->addl_entries);
2372 if (ent->is_terminal)
2375 ia64_insn our_bits = ent->bits;
2376 struct completer_entry *p = ent->parent;
2397 ent->bits = our_bits;
2398 ent->mask = mask;
2402 ent->bits = 0;
2403 ent->mask = 0;
2406 ent = ent->alternative;
2601 print_completer_entry (struct completer_entry *ent)
2604 ia64_insn mask = ent->mask, bits = ent->bits;
2622 ent->name->num,
2623 ent->alternative != NULL ? ent->alternative->num : -1,
2624 ent->addl_entries != NULL ? ent->addl_entries->num : -1,
2626 ent->is_terminal ? 1 : 0,
2627 ent->dependencies);
Indexes created Sun Jun 28 00:24:58 UTC 2026