binutils/opcodes/aarch64-gen.c

61   /* List of opcodes; only valid for the leaf node.  */
186   struct bittree* node;
187   node = malloc (sizeof (struct bittree));
188   if (!node)
190   node->bitno = -1;
191   node->bits[0] = NULL;
192   node->bits[1] = NULL;
193   return node;
196 /* The largest number of opcode entries that exist at a leaf node of the
347   /* Record the opcode entries on this leaf node.  */
398   /* Leaf node located.  */
460   /* Leaf node located.  */
464       /* Find multiple opcode entries in one leaf node.  */
532   /* Leaf node located.  */
544       /* Free the tree node.  */
553   /* Free the tree node.  */
622       const opcode_node *node = table + i;
623       assert (node->next);
624       printf ("    case %u: value = %u; break;", real_index (node->index),
625 	      real_index (node->next->index));
626       printf ("\t/* %s --> %s.  */\n", get_aarch64_opcode (node)->name,
627 	      get_aarch64_opcode (node->next)->name);
661       const opcode_node *node = table + i;
662       assert (node->next);
663       if (node->next->next == NULL)
665       while (node->next->next)
667 	  printf ("    case %u: value = %u; break;", real_index (node->next->index),
668 		 real_index (node->next->next->index));
670 		  get_aarch64_opcode (node->next)->name,
671 		  get_aarch64_opcode (node->next->next)->name);
672 	  node = node->next;
767       opcode_node *node = new_opcode_node ();
772       node->index = alias - aarch64_opcode_table;
773       *next = node;
774       next = &node->next;
819       opcode_node *node = ret + i;
823       node->index = ent - aarch64_opcode_table;
824       node->next = find_alias_opcode (ent);
825       assert (node->next);
839   opcode_node *node = alias_info;
842   for (; i < num; ++i, ++node)
844       opcode_node *list = node->next;