sim/igen/gen.c

41 update_depth (lf *file, const gen_entry *entry, int depth, void *data)
428   /* create a new list entry and insert it */
464   gen_entry *entry;
477   for (entry = table->entries; entry != NULL; entry = entry->sibling)
479       if (entry->entries != NULL && depth != 0)
481 	  gen_entry_traverse_tree (file, entry, depth + 1,
488 	      leaf (file, entry, depth, data);
501 /* create a list element containing a single gen_table entry */
509   gen_list *entry = ZALLOC (gen_list);
510   entry->table = ZALLOC (gen_entry);
511   entry->table->top = entry;
512   entry->model = model;
513   entry->isa = isa;
520 	  insn_list_insert (&entry->table->insns, &entry->table->nr_insns, insn, NULL,	/* expanded_bits - none yet */
526   entry->table->opcode_rule = rules;
527   return entry;
570   const insn_list *entry;
576   for (entry = insns; entry != NULL; entry = entry->next)
578       insn_word_entry *word = entry->insn->word[rule->word_nr];
646       for (entry = insns; entry != NULL; entry = entry->next)
648 	  insn_word_entry *word = entry->insn->word[rule->word_nr];
803   gen_entry **entry = &table->entries;
805   /* find the new table for this entry */
806   while ((*entry) != NULL && (*entry)->opcode_nr < new_opcode_nr)
808       entry = &(*entry)->sibling;
811   if ((*entry) == NULL || (*entry)->opcode_nr != new_opcode_nr)
813       /* insert the missing entry */
815       new_entry->sibling = (*entry);
816       (*entry) = new_entry;
828   ASSERT ((*entry) != NULL && (*entry)->opcode_nr == new_opcode_nr);
829   insn_list_insert (&(*entry)->insns, &(*entry)->nr_insns, old_insn, NULL,	/* expanded_bits - only in final list */
843       /* Only include the hardwired bit information with an entry IF
844          that entry (and hence its functions) are being duplicated.  */
968 					  /* the table entry fully
1015 			   information if the entry is not going to
1076       gen_entry *entry = table;
1080 	  if (entry == NULL && path == NULL)
1082 	  if (entry == NULL || path == NULL)
1084 	  if (entry->opcode_nr != path->opcode_nr)
1086 	  entry = entry->parent;
1244 				 "decodes to the same entry");
1283     insn_list *entry;
1284     for (entry = table->insns; entry != NULL; entry = entry->next)
1290 		    entry->insn->format_name, entry->insn->name);
1292 	gen_entry_insert_expanding (table, entry->insn);
1299       gen_entry *entry;
1300       for (entry = table->entries; entry != NULL; entry = entry->sibling)
1303 	  print_gen_entry_path (table->opcode_rule->line, entry, notify);
1305 		  entry->opcode_nr, entry->nr_insns);
1306 	  for (l = entry->insns; l != NULL; l = l->next)
1315       gen_entry *entry;
1316       for (entry = table->entries; entry != NULL; entry = entry->sibling)
1318 	  if (entry->combined_parent == NULL)
1320 	      gen_entry **last = &entry->combined_next;
1322 	      for (alt = entry->sibling; alt != NULL; alt = alt->sibling)
1325 		      && insn_list_cmp (entry->insns, alt->insns) == 0)
1327 		      alt->combined_parent = entry;
1337 	  gen_entry *entry;
1338 	  for (entry = table->entries; entry != NULL; entry = entry->sibling)
1340 	      if (entry->combined_parent == NULL)
1345 		  print_gen_entry_path (table->opcode_rule->line, entry,
1347 		  for (duplicate = entry->combined_next; duplicate != NULL;
1352 		  notify (NULL, ": entries %d -", entry->nr_insns);
1353 		  for (l = entry->insns; l != NULL; l = l->next)
1376     gen_entry *entry;
1377     for (entry = table->entries; entry != NULL; entry = entry->sibling)
1379 	if (entry->combined_parent == NULL)
1381 	    if (insn_list_cmp (table->insns, entry->insns) == 0)
1387 		print_gen_entry_insns (entry, warning, "Copied", NULL);
1402 	  gen_entry **entry = &table->entries;
1408 	      if ((*entry) == NULL || (*entry)->opcode_nr != opcode_nr)
1410 		  /* missing - insert it under our feet at *entry */
1413 		  ASSERT ((*entry) != NULL);
1414 		  ASSERT ((*entry)->opcode_nr == opcode_nr);
1415 		  (*last_illegal) = *entry;
1419 	      entry = &(*entry)->sibling;
1437     gen_entry *entry;
1438     for (entry = table->entries; entry != NULL; entry = entry->sibling)
1440 	if (entry->combined_parent == NULL)
1442 	    gen_entry_expand_insns (entry);
1451   gen_list *entry;
1452   for (entry = gen->tables; entry != NULL; entry = entry->next)
1454       gen_entry_expand_insns (entry->table);
1464 make_gen_semantics_list (lf *file, const gen_entry *entry, int depth, void *data)
1469      other entry at the same level */
1470   if (entry->combined_parent != NULL)
1475   ASSERT (entry->nr_insns == 1);
1479 			   entry->insns->insn,
1480 			   entry->expanded_bits,
1481 			   entry->parent->opcode,
1482 			   entry->insns->nr_prefetched_words,
1484   /* point the table entry at the real semantic function */
1486   entry->insns->semantic = insn;
1493   gen_list *entry;
1494   for (entry = gen->tables; entry != NULL; entry = entry->next)
1496       gen_entry_traverse_tree (NULL, entry->table, 1,	/* depth */
1551 dump_insn_list (lf *file, char *prefix, insn_list *entry, char *suffix)
1553   lf_printf (file, "%s(insn_list *) %p", prefix, entry);
1555   if (entry != NULL)
1558       dump_insn_entry (file, "\n(insn ", entry->insn, ")");
1559       lf_printf (file, "\n(next %p)", entry->next);
1569 				   insn_list *entry, char *suffix)
1572   while (entry != NULL)
1574       dump_insn_list (file, "\n(", entry, ")");
1575       entry = entry->next;
1613 	       char *prefix, gen_list *entry, char *suffix, int levels)
1615   while (entry != NULL)
1617       lf_printf (file, "%s(gen_list *) %p", prefix, entry);
1618       dump_gen_entry (file, "\n(", entry->table, ")", levels);
1619       lf_printf (file, "\n(next (gen_list *) %p)", entry->next);