6502/cc65
1
0
Fork 0
mirror of https://github.com/cc65/cc65.git synced 2024-06-10 13:29:50 +00:00
Code Issues Projects Releases Wiki Activity

Remove CollFirst in favour of CollAt.

Browse Source 
git-svn-id: svn://svn.cc65.org/cc65/trunk@5176 b7a2c559-68d2-44c3-8de9-860c34a00d81
This commit is contained in:
uz 2011-08-15 17:57:26 +00:00
parent 8d8c676be2
commit eadbb7dcb0
1 changed files with 4 additions and 16 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

20
src/dbginfo/dbginfo.c
View File

@ -818,18 +818,6 @@ static unsigned CollIdAt (Collection* C, unsigned Index)
static void* CollFirst (Collection* C)
/* Return the first item in a collection */
{
/* We must have at least one entry */
assert (C->Count > 0);
/* Return the element */
return C->Items[0].Ptr;
}
static void CollQuickSort (Collection* C, int Lo, int Hi,
int (*Compare) (const void*, const void*))
/* Internal recursive sort function. */
@ -1043,7 +1031,7 @@ static cc65_sourceinfo* new_cc65_sourceinfo (unsigned Count)
{
cc65_sourceinfo* S = xmalloc (sizeof (*S) - sizeof (S->data[0]) +
Count * sizeof (S->data[0]));
S->count = Count;
S->count = Count;
return S;
}
@ -1276,7 +1264,7 @@ static void CreateLineInfoList (LineInfoList* L, Collection* LineInfos)
}
/* Step 1: Determine the number of unique address entries needed */
LI = CollFirst (LineInfos);
LI = CollAt (LineInfos, 0);
L->Count += (LI->End - LI->Start) + 1;
End = LI->End;
for (I = 1; I < CollCount (LineInfos); ++I) {
@ -1304,7 +1292,7 @@ static void CreateLineInfoList (LineInfoList* L, Collection* LineInfos)
/* Step 3: Determine the number of entries per unique address */
List = L->List;
LI = CollFirst (LineInfos);
LI = CollAt (LineInfos, 0);
StartIndex = 0;
Start = LI->Start;
End = LI->End;
@ -1358,7 +1346,7 @@ static void CreateLineInfoList (LineInfoList* L, Collection* LineInfos)
/* Step 5: Enter the data into the table */
List = L->List;
LI = CollFirst (LineInfos);
LI = CollAt (LineInfos, 0);
StartIndex = 0;
Start = LI->Start;
End = LI->End;