Lines Matching refs:ent
69 opcode_node* ent = malloc (sizeof (opcode_node));
71 if (!ent)
74 ent->opcode = 0;
75 ent->mask = 0;
76 ent->index = -1;
77 ent->next = NULL;
79 return ent;
129 const struct aarch64_opcode *ent = table;
133 if (!ent->name)
146 assert (pseudo_opcode_p (ent) == FALSE || alias_opcode_p (ent) == TRUE);
148 if (alias_opcode_p (ent) == TRUE)
154 (*new_ent)->opcode = ent->opcode;
155 (*new_ent)->mask = ent->mask;
158 } while ((++ent)->name);
162 print_one_opcode_node (opcode_node* ent)
164 printf ("%s\t%08x\t%08x\t%d\n", get_aarch64_opcode (ent)->name,
165 get_aarch64_opcode (ent)->opcode, get_aarch64_opcode (ent)->mask,
166 (int)real_index (ent->index));
174 opcode_node* ent = opcode_nodes_head.next;
176 while (ent)
178 print_one_opcode_node (ent);
179 ent = ent->next;
228 opcode_node *ent;
254 ent = opcode;
255 while (ent)
257 mask_and &= ent->mask;
258 ent = ent->next;
303 ent = opcode;
304 while (ent)
306 if (ent->opcode & bitmask)
308 ent->mask &= (~bitmask);
309 *ptr1 = ent;
310 ent = ent->next;
316 ent->mask &= (~bitmask);
317 *ptr0 = ent;
318 ent = ent->next;
696 const aarch64_opcode *ent;
705 ent = aarch64_opcode_table;
706 while (ent->name != NULL)
711 if (alias_opcode_p (ent) == TRUE
712 && (ent->mask & opcode->mask) == opcode->mask
713 && (opcode->mask & ent->opcode) == (opcode->mask & opcode->opcode))
716 preferred[i++] = ent;
718 printf ("found %s for %s.", ent->name, opcode->name);
720 ++ent;
796 const aarch64_opcode *ent;
800 ent = aarch64_opcode_table;
801 while (ent->name != NULL)
803 if (opcode_has_alias (ent))
808 assert (!alias_opcode_p (ent));
811 ++ent;
821 for (i = 0, ent = aarch64_opcode_table; i < num; ++i, ++ent)
824 while (ent->name != NULL && !opcode_has_alias (ent))
825 ++ent;
826 assert (ent->name != NULL);
827 node->index = ent - aarch64_opcode_table;
828 node->next = find_alias_opcode (ent);
1155 struct aarch64_opcode *ent = table;
1158 printf ("%s\t%08x\t%08x\n", ent->name, (unsigned int)ent->opcode,
1159 (unsigned int)ent->mask);
1160 } while ((++ent)->name);
