1 /*****************************************************************************/
5 /* Code segment structure */
9 /* (C) 2001 Ullrich von Bassewitz */
11 /* D-70597 Stuttgart */
12 /* EMail: uz@cc65.org */
15 /* This software is provided 'as-is', without any expressed or implied */
16 /* warranty. In no event will the authors be held liable for any damages */
17 /* arising from the use of this software. */
19 /* Permission is granted to anyone to use this software for any purpose, */
20 /* including commercial applications, and to alter it and redistribute it */
21 /* freely, subject to the following restrictions: */
23 /* 1. The origin of this software must not be misrepresented; you must not */
24 /* claim that you wrote the original software. If you use this software */
25 /* in a product, an acknowledgment in the product documentation would be */
26 /* appreciated but is not required. */
27 /* 2. Altered source versions must be plainly marked as such, and must not */
28 /* be misrepresented as being the original software. */
29 /* 3. This notice may not be removed or altered from any source */
32 /*****************************************************************************/
58 /*****************************************************************************/
59 /* Helper functions */
60 /*****************************************************************************/
64 static void MoveLabelsToPool (CodeSeg* S, CodeEntry* E)
65 /* Move the labels of the code entry E to the label pool of the code segment */
67 unsigned LabelCount = GetCodeLabelCount (E);
68 while (LabelCount--) {
69 CodeLabel* L = GetCodeLabel (E, LabelCount);
72 CollAppend (&S->Labels, L);
74 CollDeleteAll (&E->Labels);
79 static CodeLabel* FindCodeLabel (CodeSeg* S, const char* Name, unsigned Hash)
80 /* Find the label with the given name. Return the label or NULL if not found */
82 /* Get the first hash chain entry */
83 CodeLabel* L = S->LabelHash[Hash];
87 if (strcmp (Name, L->Name) == 0) {
98 static CodeLabel* NewCodeSegLabel (CodeSeg* S, const char* Name, unsigned Hash)
99 /* Create a new label and insert it into the label hash table */
101 /* Not found - create a new one */
102 CodeLabel* L = NewCodeLabel (Name, Hash);
104 /* Enter the label into the hash table */
105 L->Next = S->LabelHash[L->Hash];
106 S->LabelHash[L->Hash] = L;
108 /* Return the new label */
114 static void RemoveLabelFromHash (CodeSeg* S, CodeLabel* L)
115 /* Remove the given code label from the hash list */
117 /* Get the first entry in the hash chain */
118 CodeLabel* List = S->LabelHash[L->Hash];
121 /* First, remove the label from the hash chain */
123 /* First entry in hash chain */
124 S->LabelHash[L->Hash] = L->Next;
126 /* Must search through the chain */
127 while (List->Next != L) {
128 /* If we've reached the end of the chain, something is *really* wrong */
129 CHECK (List->Next != 0);
133 /* The next entry is the one, we have been searching for */
134 List->Next = L->Next;
140 /*****************************************************************************/
141 /* Functions for parsing instructions */
142 /*****************************************************************************/
146 static const char* SkipSpace (const char* S)
147 /* Skip white space and return an updated pointer */
149 while (IsSpace (*S)) {
157 static const char* ReadToken (const char* L, const char* Term,
158 char* Buf, unsigned BufSize)
159 /* Read the next token into Buf, return the updated line pointer. The
160 * token is terminated by one of the characters given in term.
163 /* Read/copy the token */
165 unsigned ParenCount = 0;
166 while (*L && (ParenCount > 0 || strchr (Term, *L) == 0)) {
172 } else if (*L == '(') {
178 /* Terminate the buffer contents */
181 /* Return the updated line pointer */
187 static CodeEntry* ParseInsn (CodeSeg* S, const char* L)
188 /* Parse an instruction nnd generate a code entry from it. If the line contains
189 * errors, output an error message and return NULL.
190 * For simplicity, we don't accept the broad range of input a "real" assembler
191 * does. The instruction and the argument are expected to be separated by
192 * white space, for example.
197 am_t AM = 0; /* Initialize to keep gcc silent */
204 L = ReadToken (L, " \t", Mnemo, sizeof (Mnemo));
206 /* Try to find the opcode description for the mnemonic */
207 OPC = FindOpcode (Mnemo);
209 /* If we didn't find the opcode, print an error and bail out */
211 Error ("ASM code error: %s is not a valid mnemonic", Mnemo);
215 /* Skip separator white space */
218 /* Get the addressing mode */
229 StrCopy (Arg, sizeof (Arg), L+1);
235 L = ReadToken (L+1, ",)", Arg, sizeof (Arg));
237 /* Check for errors */
239 Error ("ASM code error: syntax error");
243 /* Check the different indirect modes */
245 /* Expect zp x indirect */
247 if (toupper (*L) != 'X') {
248 Error ("ASM code error: `X' expected");
253 Error ("ASM code error: `)' expected");
258 Error ("ASM code error: syntax error");
262 } else if (*L == ')') {
263 /* zp indirect or zp indirect, y */
267 if (toupper (*L) != 'Y') {
268 Error ("ASM code error: `Y' expected");
273 Error ("ASM code error: syntax error");
277 } else if (*L == '\0') {
280 Error ("ASM code error: syntax error");
296 /* Absolute, maybe indexed */
297 L = ReadToken (L, ",", Arg, sizeof (Arg));
299 /* Assume absolute */
301 } else if (*L == ',') {
305 Error ("ASM code error: syntax error");
312 } else if (Reg == 'Y') {
315 Error ("ASM code error: syntax error");
319 Error ("ASM code error: syntax error");
328 /* If the instruction is a branch, check for the label and generate it
329 * if it does not exist. Ignore anything but local labels here.
332 if ((OPC->Info & OF_BRA) != 0 && Arg[0] == 'L') {
336 /* Addressing mode must be alsobute or something is really wrong */
337 CHECK (AM == AM_ABS);
339 /* Addressing mode is a branch/jump */
342 /* Generate the hash over the label, then search for the label */
343 Hash = HashStr (Arg) % CS_LABEL_HASH_SIZE;
344 Label = FindCodeLabel (S, Arg, Hash);
346 /* If we don't have the label, it's a forward ref - create it */
348 /* Generate a new label */
349 Label = NewCodeSegLabel (S, Arg, Hash);
353 /* We do now have the addressing mode in AM. Allocate a new CodeEntry
354 * structure and initialize it.
356 E = NewCodeEntry (OPC->OPC, AM, Arg, Label);
358 /* Return the new code entry */
364 /*****************************************************************************/
366 /*****************************************************************************/
370 CodeSeg* NewCodeSeg (const char* SegName, SymEntry* Func)
371 /* Create a new code segment, initialize and return it */
375 /* Allocate memory */
376 CodeSeg* S = xmalloc (sizeof (CodeSeg));
378 /* Initialize the fields */
379 S->SegName = xstrdup (SegName);
381 InitCollection (&S->Entries);
382 InitCollection (&S->Labels);
383 for (I = 0; I < sizeof(S->LabelHash) / sizeof(S->LabelHash[0]); ++I) {
387 /* If we have a function given, get the return type of the function.
388 * Assume ANY return type besides void will use the A and X registers.
390 if (S->Func && !IsTypeVoid (GetFuncReturn (Func->Type))) {
391 S->ExitRegs = REG_AX;
393 S->ExitRegs = REG_NONE;
396 /* Return the new struct */
402 void AddCodeEntry (CodeSeg* S, const char* Format, va_list ap)
403 /* Add a line to the given code segment */
409 /* Format the line */
411 xvsprintf (Buf, sizeof (Buf), Format, ap);
413 /* Skip whitespace */
416 /* Check which type of instruction we have */
417 E = 0; /* Assume no insn created */
421 /* Empty line, just ignore it */
425 /* Comment or hint, ignore it for now */
429 /* Control instruction */
430 ReadToken (L, " \t", Token, sizeof (Token));
431 Error ("ASM code error: Pseudo instruction `%s' not supported", Token);
435 E = ParseInsn (S, L);
439 /* If we have a code entry, transfer the labels and insert it */
442 /* Transfer the labels if we have any */
444 unsigned LabelCount = CollCount (&S->Labels);
445 for (I = 0; I < LabelCount; ++I) {
448 CodeLabel* L = CollAt (&S->Labels, I);
450 /* Attach it to the entry */
451 AttachCodeLabel (E, L);
454 /* Delete the transfered labels */
455 CollDeleteAll (&S->Labels);
457 /* Add the entry to the list of code entries in this segment */
458 CollAppend (&S->Entries, E);
465 void InsertCodeEntry (CodeSeg* S, struct CodeEntry* E, unsigned Index)
466 /* Insert the code entry at the index given. Following code entries will be
467 * moved to slots with higher indices.
470 /* Insert the entry into the collection */
471 CollInsert (&S->Entries, E, Index);
476 void DelCodeEntry (CodeSeg* S, unsigned Index)
477 /* Delete an entry from the code segment. This includes moving any associated
478 * labels, removing references to labels and even removing the referenced labels
479 * if the reference count drops to zero.
482 /* Get the code entry for the given index */
483 CodeEntry* E = GetCodeEntry (S, Index);
485 /* If the entry has a labels, we have to move this label to the next insn.
486 * If there is no next insn, move the label into the code segement label
487 * pool. The operation is further complicated by the fact that the next
488 * insn may already have a label. In that case change all reference to
489 * this label and delete the label instead of moving it.
491 unsigned Count = GetCodeLabelCount (E);
494 /* The instruction has labels attached. Check if there is a next
497 if (Index == GetCodeEntryCount (S)-1) {
499 /* No next instruction, move to the codeseg label pool */
500 MoveLabelsToPool (S, E);
504 /* There is a next insn, get it */
505 CodeEntry* N = GetCodeEntry (S, Index+1);
507 /* Move labels to the next entry */
508 MoveCodeLabels (S, E, N);
513 /* If this insn references a label, remove the reference. And, if the
514 * the reference count for this label drops to zero, remove this label.
517 /* Remove the reference */
518 RemoveCodeLabelRef (S, E);
521 /* Delete the pointer to the insn */
522 CollDelete (&S->Entries, Index);
524 /* Delete the instruction itself */
530 void DelCodeEntries (CodeSeg* S, unsigned Start, unsigned Count)
531 /* Delete a range of code entries. This includes removing references to labels,
532 * labels attached to the entries and so on.
535 /* Start deleting the entries from the rear, because this involves less
539 DelCodeEntry (S, Start + Count);
545 void MoveCodeEntry (CodeSeg* S, unsigned OldPos, unsigned NewPos)
546 /* Move an entry from one position to another. OldPos is the current position
547 * of the entry, NewPos is the new position of the entry.
550 /* Get the code entry and remove it from the collection */
551 CodeEntry* E = GetCodeEntry (S, OldPos);
552 CollDelete (&S->Entries, OldPos);
554 /* Correct NewPos if needed */
555 if (NewPos >= OldPos) {
556 /* Position has changed with removal */
560 /* Now insert it at the new position */
561 CollInsert (&S->Entries, E, NewPos);
566 struct CodeEntry* GetNextCodeEntry (CodeSeg* S, unsigned Index)
567 /* Get the code entry following the one with the index Index. If there is no
568 * following code entry, return NULL.
571 if (Index >= CollCount (&S->Entries)-1) {
572 /* This is the last entry */
575 /* Code entries left */
576 return CollAtUnchecked (&S->Entries, Index+1);
582 int GetCodeEntries (CodeSeg* S, struct CodeEntry** List,
583 unsigned Start, unsigned Count)
584 /* Get Count code entries into List starting at index start. Return true if
585 * we got the lines, return false if not enough lines were available.
588 /* Check if enough entries are available */
589 if (Start + Count > CollCount (&S->Entries)) {
593 /* Copy the entries */
595 *List++ = CollAtUnchecked (&S->Entries, Start++);
598 /* We have the entries */
604 unsigned GetCodeEntryIndex (CodeSeg* S, struct CodeEntry* E)
605 /* Return the index of a code entry */
607 int Index = CollIndex (&S->Entries, E);
614 void AddCodeLabel (CodeSeg* S, const char* Name)
615 /* Add a code label for the next instruction to follow */
617 /* Calculate the hash from the name */
618 unsigned Hash = HashStr (Name) % CS_LABEL_HASH_SIZE;
620 /* Try to find the code label if it does already exist */
621 CodeLabel* L = FindCodeLabel (S, Name, Hash);
623 /* Did we find it? */
625 /* We found it - be sure it does not already have an owner */
626 CHECK (L->Owner == 0);
628 /* Not found - create a new one */
629 L = NewCodeSegLabel (S, Name, Hash);
632 /* Safety. This call is quite costly, but safety is better */
633 if (CollIndex (&S->Labels, L) >= 0) {
634 Internal ("AddCodeLabel: Label `%s' already defined", Name);
637 /* We do now have a valid label. Remember it for later */
638 CollAppend (&S->Labels, L);
643 CodeLabel* GenCodeLabel (CodeSeg* S, struct CodeEntry* E)
644 /* If the code entry E does already have a label, return it. Otherwise
645 * create a new label, attach it to E and return it.
650 if (CodeEntryHasLabel (E)) {
652 /* Get the label from this entry */
653 L = GetCodeLabel (E, 0);
658 const char* Name = LocalLabelName (GetLocalLabel ());
660 /* Generate the hash over the name */
661 unsigned Hash = HashStr (Name) % CS_LABEL_HASH_SIZE;
663 /* Create a new label */
664 L = NewCodeSegLabel (S, Name, Hash);
666 /* Attach this label to the code entry */
667 AttachCodeLabel (E, L);
671 /* Return the label */
677 void DelCodeLabel (CodeSeg* S, CodeLabel* L)
678 /* Remove references from this label and delete it. */
682 /* First, remove the label from the hash chain */
683 RemoveLabelFromHash (S, L);
685 /* Remove references from insns jumping to this label */
686 Count = CollCount (&L->JumpFrom);
687 for (I = 0; I < Count; ++I) {
688 /* Get the insn referencing this label */
689 CodeEntry* E = CollAt (&L->JumpFrom, I);
690 /* Remove the reference */
693 CollDeleteAll (&L->JumpFrom);
695 /* Remove the reference to the owning instruction if it has one. The
696 * function may be called for a label without an owner when deleting
697 * unfinished parts of the code. This is unfortunate since it allows
698 * errors to slip through.
701 CollDeleteItem (&L->Owner->Labels, L);
704 /* All references removed, delete the label itself */
710 void MergeCodeLabels (CodeSeg* S)
711 /* Merge code labels. That means: For each instruction, remove all labels but
712 * one and adjust references accordingly.
717 /* Walk over all code entries */
718 unsigned EntryCount = GetCodeEntryCount (S);
719 for (I = 0; I < EntryCount; ++I) {
724 /* Get a pointer to the next entry */
725 CodeEntry* E = GetCodeEntry (S, I);
727 /* If this entry has zero labels, continue with the next one */
728 unsigned LabelCount = GetCodeLabelCount (E);
729 if (LabelCount == 0) {
733 /* We have at least one label. Use the first one as reference label. */
734 RefLab = GetCodeLabel (E, 0);
736 /* Walk through the remaining labels and change references to these
737 * labels to a reference to the one and only label. Delete the labels
738 * that are no longer used. To increase performance, walk backwards
741 for (J = LabelCount-1; J >= 1; --J) {
743 /* Get the next label */
744 CodeLabel* L = GetCodeLabel (E, J);
746 /* Move all references from this label to the reference label */
747 MoveLabelRefs (L, RefLab);
749 /* Remove the label completely. */
753 /* The reference label is the only remaining label. Check if there
754 * are any references to this label, and delete it if this is not
757 if (CollCount (&RefLab->JumpFrom) == 0) {
758 /* Delete the label */
759 DelCodeLabel (S, RefLab);
766 void MoveCodeLabels (CodeSeg* S, struct CodeEntry* Old, struct CodeEntry* New)
767 /* Move all labels from Old to New. The routine will move the labels itself
768 * if New does not have any labels, and move references if there is at least
769 * a label for new. If references are moved, the old label is deleted
773 /* Get the number of labels to move */
774 unsigned OldLabelCount = GetCodeLabelCount (Old);
776 /* Does the new entry have itself a label? */
777 if (CodeEntryHasLabel (New)) {
779 /* The new entry does already have a label - move references */
780 CodeLabel* NewLabel = GetCodeLabel (New, 0);
781 while (OldLabelCount--) {
783 /* Get the next label */
784 CodeLabel* OldLabel = GetCodeLabel (Old, OldLabelCount);
786 /* Move references */
787 MoveLabelRefs (OldLabel, NewLabel);
789 /* Delete the label */
790 DelCodeLabel (S, OldLabel);
796 /* The new entry does not have a label, just move them */
797 while (OldLabelCount--) {
799 /* Move the label to the new entry */
800 MoveCodeLabel (GetCodeLabel (Old, OldLabelCount), New);
809 void RemoveCodeLabelRef (CodeSeg* S, struct CodeEntry* E)
810 /* Remove the reference between E and the label it jumps to. The reference
811 * will be removed on both sides and E->JumpTo will be 0 after that. If
812 * the reference was the only one for the label, the label will get
816 /* Get a pointer to the label and make sure it exists */
817 CodeLabel* L = E->JumpTo;
820 /* Delete the entry from the label */
821 CollDeleteItem (&L->JumpFrom, E);
823 /* The entry jumps no longer to L */
826 /* If there are no more references, delete the label */
827 if (CollCount (&L->JumpFrom) == 0) {
834 void MoveCodeLabelRef (CodeSeg* S, struct CodeEntry* E, CodeLabel* L)
835 /* Change the reference of E to L instead of the current one. If this
836 * was the only reference to the old label, the old label will get
840 /* Get the old label */
841 CodeLabel* OldLabel = E->JumpTo;
843 /* Be sure that code entry references a label */
844 PRECONDITION (OldLabel != 0);
846 /* Remove the reference to our label */
847 RemoveCodeLabelRef (S, E);
849 /* Use the new label */
855 void AddCodeSegHint (CodeSeg* S, unsigned Hint)
856 /* Add a hint for the preceeding instruction */
860 /* Get the number of entries in this segment */
861 unsigned EntryCount = GetCodeEntryCount (S);
863 /* Must have at least one entry */
864 CHECK (EntryCount > 0);
866 /* Get the last entry */
867 E = GetCodeEntry (S, EntryCount-1);
875 void DelCodeSegAfter (CodeSeg* S, unsigned Last)
876 /* Delete all entries including the given one */
878 /* Get the number of entries in this segment */
879 unsigned Count = GetCodeEntryCount (S);
881 /* First pass: Delete all references to labels. If the reference count
882 * for a label drops to zero, delete it.
887 /* Get the next entry */
888 CodeEntry* E = GetCodeEntry (S, C);
890 /* Check if this entry has a label reference */
892 /* Remove the reference to the label */
893 RemoveCodeLabelRef (S, E);
898 /* Second pass: Delete the instructions. If a label attached to an
899 * instruction still has references, it must be references from outside
900 * the deleted area. Don't delete the label in this case, just make it
901 * ownerless and move it to the label pool.
906 /* Get the next entry */
907 CodeEntry* E = GetCodeEntry (S, C);
909 /* Check if this entry has a label attached */
910 if (CodeEntryHasLabel (E)) {
911 /* Move the labels to the pool and clear the owner pointer */
912 MoveLabelsToPool (S, E);
915 /* Delete the pointer to the entry */
916 CollDelete (&S->Entries, C);
918 /* Delete the entry itself */
925 void OutputCodeSeg (const CodeSeg* S, FILE* F)
926 /* Output the code segment data to a file */
930 /* Get the number of entries in this segment */
931 unsigned Count = GetCodeEntryCount (S);
933 /* If the code segment is empty, bail out here */
938 /* Output the segment directive */
939 fprintf (F, ".segment\t\"%s\"\n\n", S->SegName);
941 /* If this is a segment for a function, enter a function */
943 fprintf (F, ".proc\t_%s\n\n", S->Func->Name);
946 /* Output all entries */
947 for (I = 0; I < Count; ++I) {
951 OutputCodeEntry (CollConstAt (&S->Entries, I), F);
953 /* Print usage info */
954 Use = GetRegInfo ((CodeSeg*) S, I+1);
957 (Use & REG_A)? 'A' : '_',
958 (Use & REG_X)? 'X' : '_',
959 (Use & REG_Y)? 'Y' : '_');
962 /* If this is a segment for a function, leave the function */
964 fprintf (F, "\n.endproc\n\n");