X-Git-Url: https://git.sur5r.net/?a=blobdiff_plain;f=src%2Fcc65%2Fcodeseg.h;h=4a96bb57d4ec7740aff82c5f2ac987d35bbdaa5f;hb=aef8789873bd008d42aa50330ca98488fad91b31;hp=d29f7c83857afad88d05c284bfb727b562877d5d;hpb=f42300ef62779856c7c5c88a9d84c9eb63da31ba;p=cc65 diff --git a/src/cc65/codeseg.h b/src/cc65/codeseg.h index d29f7c838..4a96bb57d 100644 --- a/src/cc65/codeseg.h +++ b/src/cc65/codeseg.h @@ -6,9 +6,9 @@ /* */ /* */ /* */ -/* (C) 2001 Ullrich von Bassewitz */ -/* Wacholderweg 14 */ -/* D-70597 Stuttgart */ +/* (C) 2001-2003 Ullrich von Bassewitz */ +/* Römerstrasse 52 */ +/* D-70794 Filderstadt */ /* EMail: uz@cc65.org */ /* */ /* */ @@ -80,7 +80,7 @@ struct CodeSeg { Collection Entries; /* List of code entries */ Collection Labels; /* Labels for next insn */ CodeLabel* LabelHash [CS_LABEL_HASH_SIZE]; /* Label hash table */ - unsigned char ExitRegs; /* Register use on exit */ + unsigned short ExitRegs; /* Register use on exit */ }; @@ -94,12 +94,25 @@ struct CodeSeg { CodeSeg* NewCodeSeg (const char* SegName, SymEntry* Func); /* Create a new code segment, initialize and return it */ -void CS_AddEntry (CodeSeg* S, struct CodeEntry* E, LineInfo* LI); +void CS_AddEntry (CodeSeg* S, struct CodeEntry* E); /* Add an entry to the given code segment */ -void CS_AddEntryLine (CodeSeg* S, LineInfo* LI, const char* Format, va_list ap) attribute ((format(printf,3,0))); +void CS_AddVLine (CodeSeg* S, LineInfo* LI, const char* Format, va_list ap) attribute ((format(printf,3,0))); /* Add a line to the given code segment */ +void CS_AddLine (CodeSeg* S, LineInfo* LI, const char* Format, ...) attribute ((format(printf,3,4))); +/* Add a line to the given code segment */ + +#if defined(HAVE_INLINE) +INLINE unsigned CS_GetEntryCount (const CodeSeg* S) +/* Return the number of entries for the given code segment */ +{ + return CollCount (&S->Entries); +} +#else +# define CS_GetEntryCount(S) CollCount (&(S)->Entries) +#endif + void CS_InsertEntry (CodeSeg* S, struct CodeEntry* E, unsigned Index); /* Insert the code entry at the index given. Following code entries will be * moved to slots with higher indices. @@ -109,6 +122,8 @@ void CS_DelEntry (CodeSeg* S, unsigned Index); /* Delete an entry from the code segment. This includes moving any associated * labels, removing references to labels and even removing the referenced labels * if the reference count drops to zero. + * Note: Labels are moved forward if possible, that is, they are moved to the + * next insn (not the preceeding one). */ void CS_DelEntries (CodeSeg* S, unsigned Start, unsigned Count); @@ -116,10 +131,28 @@ void CS_DelEntries (CodeSeg* S, unsigned Start, unsigned Count); * labels attached to the entries and so on. */ -void CS_MoveEntry (CodeSeg* S, unsigned OldPos, unsigned NewPos); +void CS_MoveEntries (CodeSeg* S, unsigned Start, unsigned Count, unsigned NewPos); +/* Move a range of entries from one position to another. Start is the index + * of the first entry to move, Count is the number of entries and NewPos is + * the index of the target entry. The entry with the index Start will later + * have the index NewPos. All entries with indices NewPos and above are + * moved to higher indices. If the code block is moved to the end of the + * current code, and if pending labels exist, these labels will get attached + * to the first instruction of the moved block (the first one after the + * current code end) + */ + +#if defined(HAVE_INLINE) +INLINE void CS_MoveEntry (CodeSeg* S, unsigned OldPos, unsigned NewPos) /* Move an entry from one position to another. OldPos is the current position * of the entry, NewPos is the new position of the entry. */ +{ + CollMove (&S->Entries, OldPos, NewPos); +} +#else +# define CS_MoveEntry(S, OldPos, NewPos) CollMove (&(S)->Entries, OldPos, NewPos) +#endif #if defined(HAVE_INLINE) INLINE struct CodeEntry* CS_GetEntry (CodeSeg* S, unsigned Index) @@ -128,9 +161,14 @@ INLINE struct CodeEntry* CS_GetEntry (CodeSeg* S, unsigned Index) return CollAt (&S->Entries, Index); } #else -# define CS_GetEntry(S, Index) CollAt(&(S)->Entries, (Index)) +# define CS_GetEntry(S, Index) ((struct CodeEntry*) CollAt(&(S)->Entries, (Index))) #endif +struct CodeEntry* CS_GetPrevEntry (CodeSeg* S, unsigned Index); +/* Get the code entry preceeding the one with the index Index. If there is no + * preceeding code entry, return NULL. + */ + struct CodeEntry* CS_GetNextEntry (CodeSeg* S, unsigned Index); /* Get the code entry following the one with the index Index. If there is no * following code entry, return NULL. @@ -145,6 +183,24 @@ int CS_GetEntries (CodeSeg* S, struct CodeEntry** List, unsigned CS_GetEntryIndex (CodeSeg* S, struct CodeEntry* E); /* Return the index of a code entry */ +int CS_RangeHasLabel (CodeSeg* S, unsigned Start, unsigned Count); +/* Return true if any of the code entries in the given range has a label + * attached. If the code segment does not span the given range, check the + * possible span instead. + */ + +#if defined(HAVE_INLINE) +INLINE int CS_HavePendingLabel (const CodeSeg* S) +/* Return true if there are open labels that will get attached to the next + * instruction that is added. + */ +{ + return (CollCount (&S->Labels) > 0); +} +#else +# define CS_HavePendingLabel(S) (CollCount (&(S)->Labels) > 0) +#endif + CodeLabel* CS_AddLabel (CodeSeg* S, const char* Name); /* Add a code label for the next instruction to follow */ @@ -184,19 +240,50 @@ void CS_MoveLabelRef (CodeSeg* S, struct CodeEntry* E, CodeLabel* L); void CS_DelCodeAfter (CodeSeg* S, unsigned Last); /* Delete all entries including the given one */ -void CS_Output (const CodeSeg* S, FILE* F); -/* Output the code segment data to a file */ +void CS_ResetMarks (CodeSeg* S, unsigned First, unsigned Last); +/* Remove all user marks from the entries in the given range */ #if defined(HAVE_INLINE) -INLINE unsigned CS_GetEntryCount (const CodeSeg* S) -/* Return the number of entries for the given code segment */ +INLINE void CS_ResetAllMarks (CodeSeg* S) +/* Remove all user marks from the code segment */ { - return CollCount (&S->Entries); + if (CS_GetEntryCount (S) > 0) { + CS_ResetMarks (S, 0, CS_GetEntryCount (S)); + } } #else -# define CS_GetEntryCount(S) CollCount (&(S)->Entries) +# define CS_ResetAllMarks(S) \ + ((CS_GetEntryCount (S) > 0)? CS_ResetMarks (S, 0, CS_GetEntryCount (S)) : (void) 0) #endif +int CS_IsBasicBlock (CodeSeg* S, unsigned First, unsigned Last); +/* Check if the given code segment range is a basic block. That is, check if + * First is the only entrance and Last is the only exit. This means that no + * jump/branch inside the block may jump to an insn below First or after(!) + * Last, and that no insn may jump into this block from the outside. + */ + +void CS_OutputPrologue (const CodeSeg* S, FILE* F); +/* If the given code segment is a code segment for a function, output the + * assembler prologue into the file. That is: Output a comment header, switch + * to the correct segment and enter the local function scope. If the code + * segment is global, do nothing. + */ + +void CS_OutputEpilogue (const CodeSeg* S, FILE* F); +/* If the given code segment is a code segment for a function, output the + * assembler epilogue into the file. That is: Close the local function scope. + */ + +void CS_Output (const CodeSeg* S, FILE* F); +/* Output the code segment data to a file */ + +void CS_FreeRegInfo (CodeSeg* S); +/* Free register infos for all instructions */ + +void CS_GenRegInfo (CodeSeg* S); +/* Generate register infos for all instructions */ + /* End of codeseg.h */