45   struct opcode_node *next;  member
76   ent->next = NULL;  in new_opcode_node()
135   new_ent = &opcode_nodes_head.next;  in read_table()
138     new_ent = &(*new_ent)->next;  in read_table()
156       new_ent = &((*new_ent)->next);  in read_table()
173   opcode_node* ent = opcode_nodes_head.next;  in print_opcode_nodes()
178       ent = ent->next;  in print_opcode_nodes()
241   if (!opcode->next)  in divide_table_1()
257       ent = ent->next;  in divide_table_1()
274 	      ptr = ptr->next;  in divide_table_1()
279 	ptr = ptr->next;  in divide_table_1()
298   list0.next = NULL;  in divide_table_1()
299   list1.next = NULL;  in divide_table_1()
300   ptr0 = &list0.next;  in divide_table_1()
301   ptr1 = &list1.next;  in divide_table_1()
309 	  ent = ent->next;  in divide_table_1()
310 	  (*ptr1)->next = NULL;  in divide_table_1()
311 	  ptr1 = &(*ptr1)->next;  in divide_table_1()
317 	  ent = ent->next;  in divide_table_1()
318 	  (*ptr0)->next = NULL;  in divide_table_1()
319 	  ptr0 = &(*ptr0)->next;  in divide_table_1()
324   if (list0.next == NULL)  in divide_table_1()
326       opcode = list1.next;  in divide_table_1()
329   else if (list1.next == NULL)  in divide_table_1()
331       opcode = list0.next;  in divide_table_1()
338   divide_table_1 (bittree->bits[0], list0.next);  in divide_table_1()
339   divide_table_1 (bittree->bits[1], list1.next);  in divide_table_1()
358   divide_table_1 (bittree, opcode_nodes_head.next);  in divide_table()
468       if (bittree->list->next != NULL)  in print_find_next_opcode_1()
474 	      const aarch64_opcode *next = get_aarch64_opcode (list->next);  in print_find_next_opcode_1()  local
478 	      if (list->next != NULL)  in print_find_next_opcode_1()
480 		  printf ("value = %u; break;\t", real_index (list->next->index));  in print_find_next_opcode_1()
481 		  printf ("/* %s --> %s.  */\n", curr->name, next->name);  in print_find_next_opcode_1()
489 	      list = list->next;  in print_find_next_opcode_1()
543 	  opcode_node *next = list->next;  in release_resource_decoder_tree()  local
545 	  list = next;  in release_resource_decoder_tree()
585       const opcode_node *alias = real->next;  in print_find_real_opcode()
586       for (; alias; alias = alias->next)  in print_find_real_opcode()
626       assert (node->next);  in print_find_alias_opcode()
628 	      real_index (node->next->index));  in print_find_alias_opcode()
630 	      get_aarch64_opcode (node->next)->name);  in print_find_alias_opcode()
665       assert (node->next);  in print_find_next_alias_opcode()
666       if (node->next->next == NULL)  in print_find_next_alias_opcode()
668       while (node->next->next)  in print_find_next_alias_opcode()
670 	  printf ("    case %u: value = %u; break;", real_index (node->next->index),  in print_find_next_alias_opcode()
671 		 real_index (node->next->next->index));  in print_find_next_alias_opcode()
673 		  get_aarch64_opcode (node->next)->name,  in print_find_next_alias_opcode()
674 		  get_aarch64_opcode (node->next->next)->name);  in print_find_next_alias_opcode()
675 	  node = node->next;  in print_find_next_alias_opcode()
697   opcode_node head, **next;  in find_alias_opcode()  local
763   next = &head.next;  in find_alias_opcode()
774       *next = node;  in find_alias_opcode()
775       next = &node->next;  in find_alias_opcode()
779   *next = NULL;  in find_alias_opcode()
781   return head.next;  in find_alias_opcode()
825       node->next = find_alias_opcode (ent);  in create_alias_info()
826       assert (node->next);  in create_alias_info()
845       opcode_node *list = node->next;  in release_resource_alias_info()
848 	  opcode_node *next = list->next;  in release_resource_alias_info()  local
850 	  list = next;  in release_resource_alias_info()