sim/igen/gen.c

41 update_depth (lf *file, const gen_entry *entry, int depth, void *data)
432   /* create a new list entry and insert it */
468   gen_entry *entry;
481   for (entry = table->entries; entry != NULL; entry = entry->sibling)
483       if (entry->entries != NULL && depth != 0)
485 	  gen_entry_traverse_tree (file, entry, depth + 1,
492 	      leaf (file, entry, depth, data);
505 /* create a list element containing a single gen_table entry */
513   gen_list *entry = ZALLOC (gen_list);
514   entry->table = ZALLOC (gen_entry);
515   entry->table->top = entry;
516   entry->model = model;
517   entry->isa = isa;
524 	  insn_list_insert (&entry->table->insns, &entry->table->nr_insns, insn, NULL,	/* expanded_bits - none yet */
530   entry->table->opcode_rule = rules;
531   return entry;
574   const insn_list *entry;
580   for (entry = insns; entry != NULL; entry = entry->next)
582       insn_word_entry *word = entry->insn->word[rule->word_nr];
650       for (entry = insns; entry != NULL; entry = entry->next)
652 	  insn_word_entry *word = entry->insn->word[rule->word_nr];
807   gen_entry **entry = &table->entries;
809   /* find the new table for this entry */
810   while ((*entry) != NULL && (*entry)->opcode_nr < new_opcode_nr)
812       entry = &(*entry)->sibling;
815   if ((*entry) == NULL || (*entry)->opcode_nr != new_opcode_nr)
817       /* insert the missing entry */
819       new_entry->sibling = (*entry);
820       (*entry) = new_entry;
832   ASSERT ((*entry) != NULL && (*entry)->opcode_nr == new_opcode_nr);
833   insn_list_insert (&(*entry)->insns, &(*entry)->nr_insns, old_insn, NULL,	/* expanded_bits - only in final list */
847       /* Only include the hardwired bit information with an entry IF
848          that entry (and hence its functions) are being duplicated.  */
972 					  /* the table entry fully
1019 			   information if the entry is not going to
1080       gen_entry *entry = table;
1084 	  if (entry == NULL && path == NULL)
1086 	  if (entry == NULL || path == NULL)
1088 	  if (entry->opcode_nr != path->opcode_nr)
1090 	  entry = entry->parent;
1248 				 "decodes to the same entry");
1287     insn_list *entry;
1288     for (entry = table->insns; entry != NULL; entry = entry->next)
1294 		    entry->insn->format_name, entry->insn->name);
1296 	gen_entry_insert_expanding (table, entry->insn);
1303       gen_entry *entry;
1304       for (entry = table->entries; entry != NULL; entry = entry->sibling)
1307 	  print_gen_entry_path (table->opcode_rule->line, entry, notify);
1309 		  entry->opcode_nr, entry->nr_insns);
1310 	  for (l = entry->insns; l != NULL; l = l->next)
1319       gen_entry *entry;
1320       for (entry = table->entries; entry != NULL; entry = entry->sibling)
1322 	  if (entry->combined_parent == NULL)
1324 	      gen_entry **last = &entry->combined_next;
1326 	      for (alt = entry->sibling; alt != NULL; alt = alt->sibling)
1329 		      && insn_list_cmp (entry->insns, alt->insns) == 0)
1331 		      alt->combined_parent = entry;
1341 	  gen_entry *entry;
1342 	  for (entry = table->entries; entry != NULL; entry = entry->sibling)
1344 	      if (entry->combined_parent == NULL)
1349 		  print_gen_entry_path (table->opcode_rule->line, entry,
1351 		  for (duplicate = entry->combined_next; duplicate != NULL;
1356 		  notify (NULL, ": entries %d -", entry->nr_insns);
1357 		  for (l = entry->insns; l != NULL; l = l->next)
1380     gen_entry *entry;
1381     for (entry = table->entries; entry != NULL; entry = entry->sibling)
1383 	if (entry->combined_parent == NULL)
1385 	    if (insn_list_cmp (table->insns, entry->insns) == 0)
1391 		print_gen_entry_insns (entry, warning, "Copied", NULL);
1406 	  gen_entry **entry = &table->entries;
1412 	      if ((*entry) == NULL || (*entry)->opcode_nr != opcode_nr)
1414 		  /* missing - insert it under our feet at *entry */
1417 		  ASSERT ((*entry) != NULL);
1418 		  ASSERT ((*entry)->opcode_nr == opcode_nr);
1419 		  (*last_illegal) = *entry;
1423 	      entry = &(*entry)->sibling;
1441     gen_entry *entry;
1442     for (entry = table->entries; entry != NULL; entry = entry->sibling)
1444 	if (entry->combined_parent == NULL)
1446 	    gen_entry_expand_insns (entry);
1455   gen_list *entry;
1456   for (entry = gen->tables; entry != NULL; entry = entry->next)
1458       gen_entry_expand_insns (entry->table);
1468 make_gen_semantics_list (lf *file, const gen_entry *entry, int depth, void *data)
1473      other entry at the same level */
1474   if (entry->combined_parent != NULL)
1479   ASSERT (entry->nr_insns == 1);
1483 			   entry->insns->insn,
1484 			   entry->expanded_bits,
1485 			   entry->parent->opcode,
1486 			   entry->insns->nr_prefetched_words,
1488   /* point the table entry at the real semantic function */
1490   entry->insns->semantic = insn;
1497   gen_list *entry;
1498   for (entry = gen->tables; entry != NULL; entry = entry->next)
1500       gen_entry_traverse_tree (NULL, entry->table, 1,	/* depth */
1555 dump_insn_list (lf *file, char *prefix, insn_list *entry, char *suffix)
1557   lf_printf (file, "%s(insn_list *) %p", prefix, entry);
1559   if (entry != NULL)
1562       dump_insn_entry (file, "\n(insn ", entry->insn, ")");
1563       lf_printf (file, "\n(next %p)", entry->next);
1573 				   insn_list *entry, char *suffix)
1576   while (entry != NULL)
1578       dump_insn_list (file, "\n(", entry, ")");
1579       entry = entry->next;
1617 	       char *prefix, gen_list *entry, char *suffix, int levels)
1619   while (entry != NULL)
1621       lf_printf (file, "%s(gen_list *) %p", prefix, entry);
1622       dump_gen_entry (file, "\n(", entry->table, ")", levels);
1623       lf_printf (file, "\n(next (gen_list *) %p)", entry->next);