4 * (C) Copyright 1989-1995
12 * - change lkparea to use a_type == 0 as "virgin area" flag
13 * 02-Apr-98 JLH: add code to link 8051 data spaces
22 * The module lkarea.c contains the functions which
23 * create and link together all area definitions read
24 * from the .rel file(s).
26 * lkarea.c contains the following functions:
32 * lkarea.c contains no global variables.
35 /*)Function VOID newarea()
37 * The function newarea() creates and/or modifies area
38 * and areax structures for each A directive read from
39 * the .rel file(s). The function lkparea() is called
40 * to find tha area structure associated with this name.
41 * If the area does not yet exist then a new area
42 * structure is created and linked to any existing
43 * linked area structures. The area flags are copied
44 * into the area flag variable. For each occurence of
45 * an A directive an areax structure is created and
46 * linked to the areax structures associated with this
47 * area. The size of this area section is placed into
48 * the areax structure. The flag value for all subsequent
49 * area definitions for the same area are compared and
50 * flagged as an error if they are not identical.
51 * The areax structure created for every occurence of
52 * an A directive is loaded with a pointer to the base
53 * area structure and a pointer to the associated
54 * head structure. And finally, a pointer to this
55 * areax structure is loaded into the list of areax
56 * structures in the head structure. Refer to lkdata.c
57 * for details of the structures and their linkage.
60 * areax **halp pointer to an array of pointers
61 * int i counter, loop variable, value
63 * int narea number of areas in this head structure
64 * areax * taxp pointer to an areax structure
68 * area *ap Pointer to the current
70 * areax *axp Pointer to the current
72 * head *hp Pointer to the current
74 * int lkerr error flag
77 * Addr_T eval() lkeval.c
78 * VOID exit() c_library
79 * int fprintf() c_library
80 * VOID getid() lklex.c
81 * VOID lkparea() lkarea.c
85 * The area and areax structures are created and
86 * linked with the appropriate head structures.
87 * Failure to allocate area or areax structure
88 * space will terminate the linker. Other internal
89 * errors most likely caused by corrupted .rel
90 * files will also terminate the linker.
94 * Create an area entry.
96 * A xxxxxx size nnnn flags mm
99 * | `------------- axp->a_size
100 * `------------------------- ap->a_id
106 register int i, narea;
120 axp->a_size = eval();
127 while (taxp->a_axp) {
135 /* if (i && (ap->a_flag != i)) { */
136 /* fprintf(stderr, "Conflicting flags in area %8s\n", id); */
141 * Evaluate area address
144 axp->a_addr = eval();
146 * Place pointer in header area list
149 fprintf(stderr, "No header defined\n");
154 for (i=0; i < narea ;++i) {
155 if (halp[i] == NULL) {
160 fprintf(stderr, "Header area list overflow\n");
164 /*)Function VOID lkparea(id)
166 * char * id pointer to the area name string
168 * The function lkparea() searches the linked area structures
169 * for a name match. If the name is not found then an area
170 * structure is created. An areax structure is created and
171 * appended to the areax structures linked to the area structure.
172 * The associated base area and head structure pointers are
173 * loaded into the areax structure.
176 * area * tap pointer to an area structure
177 * areax * taxp pointer to an areax structure
180 * area *ap Pointer to the current
182 * area *areap The pointer to the first
183 * area structure of a linked list
184 * areax *axp Pointer to the current
188 * VOID * new() lksym()
189 * char * strcpy() c_library
190 * int symeq() lksym.c
193 * Area and/or areax structures are created.
194 * Failure to allocate space for created structures
195 * will terminate the linker.
201 register struct area *tap;
202 register struct areax *taxp;
205 axp = (struct areax *) new (sizeof(struct areax));
206 axp->a_addr = -1; /* default: no address yet */
208 if (symeq(id, ap->a_id)) {
219 ap = (struct area *) new (sizeof(struct area));
231 strncpy(ap->a_id, id, NCPS);
235 /*)Function VOID lnkarea()
237 * The function lnkarea() resolves all area addresses.
238 * The function evaluates each area structure (and all
239 * the associated areax structures) in sequence. The
240 * linking process supports four (4) possible area types:
242 * ABS/OVR - All sections (each individual areax
243 * section) starts at the identical base
244 * area address overlaying all other
245 * areax sections for this area. The
246 * size of the area is largest of the area
249 * ABS/CON - All sections (each individual areax
250 * section) are concatenated with the
251 * first section starting at the base
252 * area address. The size of the area
253 * is the sum of the section sizes.
255 * NOTE: Multiple absolute (ABS) areas are
256 * never concatenated with each other,
257 * thus absolute area A and absolute area
258 * B will overlay each other if they begin
259 * at the same location (the default is
260 * always address 0 for absolute areas).
262 * REL/OVR - All sections (each individual areax
263 * section) starts at the identical base
264 * area address overlaying all other
265 * areax sections for this area. The
266 * size of the area is largest of the area
269 * REL/CON - All sections (each individual areax
270 * section) are concatenated with the
271 * first section starting at the base
272 * area address. The size of the area
273 * is the sum of the section sizes.
275 * NOTE: Relocatable (REL) areas are always concatenated
276 * with each other, thus relocatable area B
277 * (defined after area A) will follow
278 * relocatable area A independent of the
279 * starting address of area A. Within a
280 * specific area each areax section may be
281 * overlayed or concatenated with other
285 * If a base address for an area is specified then the
286 * area will start at that address. Any relocatable
287 * areas defined subsequently will be concatenated to the
288 * previous relocatable area if it does not have a base
291 * The names s_<areaname> and l_<areaname> are created to
292 * define the starting address and length of each area.
295 * Addr_T rloc ;current relocation address
296 * char temp[] ;temporary string
297 * struct symbol *sp ;symbol structure
300 * area *ap Pointer to the current
302 * area *areap The pointer to the first
303 * area structure of a linked list
306 * int fprintf() c_library
307 * VOID lnksect() lkarea.c
308 * symbol *lkpsym() lksym.c
309 * char * strncpy() c_library
310 * int symeq() lksym.c
313 * All area and areax addresses and sizes are
314 * determined and saved in their respective
319 * Resolve all area addresses.
328 /*JCF: used to save the REG_BANK_[0-3] and SBIT_BYTES area pointers*/
332 rloc[0] = rloc[1] = rloc[2] = rloc[3] = 0;
335 if (ap->a_flag&A_ABS) {
341 /* Determine memory space */
343 if (ap->a_flag & A_CODE) {
346 if (ap->a_flag & A_XDATA) {
349 if (ap->a_flag & A_BIT) {
353 * Relocatable sections
355 if (ap->a_type == 0) { /* JLH */
356 ap->a_addr = rloc[ locIndex ];
360 rloc[ locIndex ] = ap->a_addr + ap->a_size;
364 * Create symbols called:
365 * s_<areaname> the start address of the area
366 * l_<areaname> the length of the area
369 if (! symeq(ap->a_id, _abs_)) {
370 strncpy(temp+2,ap->a_id,NCPS-2);
374 sp = lkpsym(temp, 1);
375 sp->s_addr = ap->a_addr ;
376 /* sp->s_axp = ap->a_axp; JLH: was NULL; */
380 sp = lkpsym(temp, 1);
381 sp->s_addr = ap->a_size;
387 /*JCF: Since area BSEG is defined just before BSEG_BYTES, use the bit size of BSEG
388 to compute the byte size of BSEG_BYTES: */
389 if (!strcmp(ap->a_id, "BSEG")) {
390 ap->a_ap->a_axp->a_size += ((ap->a_addr + ap->a_size + 7)/8); /*Bits to bytes*/
392 else if (!strcmp(ap->a_id, "REG_BANK_0")) ta[0]=ap;
393 else if (!strcmp(ap->a_id, "REG_BANK_1")) ta[1]=ap;
394 else if (!strcmp(ap->a_id, "REG_BANK_2")) ta[2]=ap;
395 else if (!strcmp(ap->a_id, "REG_BANK_3")) ta[3]=ap;
396 else if (!strcmp(ap->a_id, "BSEG_BYTES"))
401 /*If upper register banks are not used roll back the relocation counter*/
402 if ( (ta[j]->a_size==0) && (ta[j-1]->a_size==0) )
413 /*)Function VOID lnksect()
415 * area * tap pointer to an area structure
417 * The function lnksect() is the function called by
418 * lnkarea() to resolve the areax addresses. Refer
419 * to the function lnkarea() for more detail. Pageing
420 * boundary and length errors will be reported by this
424 * Addr_T size size of area
425 * Addr_T addr address of area
426 * areax * taxp pointer to an areax structure
429 * int lkerr error flag
435 * All area and areax addresses and sizes area determined
436 * and linked into the structures.
440 lnksect(register struct area *tap)
442 register Addr_T size, addr;
443 register struct areax *taxp;
448 if ((tap->a_flag&A_PAG) && (addr & 0xFF)) {
450 "\n?ASlink-Warning-Paged Area %8s Boundary Error\n", tap->a_id);
455 if (tap->a_flag&A_OVR) {
461 if (taxp->a_size > size)
467 * Concatenated sections
471 addr += taxp->a_size;
472 size += taxp->a_size;
477 if ((tap->a_flag&A_PAG) && (size > 256)) {
479 "\n?ASlink-Warning-Paged Area %8s Length Error\n", tap->a_id);
482 if ((tap->a_flag&A_PAG) && (tap->a_size) &&
483 ((tap->a_addr & 0xFFFFFF00) != ((addr-1) & 0xFFFFFF00)))
486 "\n?ASlink-Warning-Paged Area %8s Boundary Error\n", tap->a_id);
491 Addr_T lnksect2 (struct area *tap, int rloc);
493 unsigned long codemap[524288];
495 /*Modified version of the functions for packing variables in internal data memory*/
498 Addr_T rloc[4]={0, 0, 0, 0};
504 struct area *dseg_ap = NULL;
505 struct area *abs_ap = NULL;
506 struct area *gs0_ap = NULL;
507 struct sym *sp_dseg_s=NULL, *sp_dseg_l=NULL;
509 for(j=0; j<256; j++) idatamap[j]=' ';
510 memset(codemap, 0, sizeof(codemap));
512 /* first sort all absolute areas to the front */
514 /* no need to check first area, it's in front anyway */
515 while (ap && ap->a_ap)
517 if (ap->a_ap->a_flag & A_ABS)
518 {/* next area is absolute, move it to front,
519 reversed sequence is no problem for absolutes */
521 ap->a_ap = abs_ap->a_ap;
522 abs_ap->a_ap = areap;
528 /* next accumulate all GSINITx/GSFINAL area sizes
529 into GSINIT so they stay together */
533 if (!strncmp(ap->a_id, "GS", 2))
540 ap->a_size += axp->a_size;
544 gs_size += ap->a_size;
545 if (!strcmp(ap->a_id, "GSINIT0"))
553 gs0_ap->a_size = gs_size;
558 /* Determine memory space */
559 if (ap->a_flag & A_CODE) locIndex = 1;
560 else if (ap->a_flag & A_XDATA) locIndex = 2;
561 else if (ap->a_flag & A_BIT) locIndex = 3;
564 if (ap->a_flag & A_ABS) /* Absolute sections */
566 lnksect2(ap, locIndex);
568 else /* Relocatable sections */
572 ap->a_addr = rloc[locIndex];
576 rloc[locIndex] = lnksect2(ap, locIndex);
580 * Create symbols called:
581 * s_<areaname> the start address of the area
582 * l_<areaname> the length of the area
585 if (! symeq(ap->a_id, _abs_))
587 strncpy(temp+2,ap->a_id,NCPS-2);
591 sp = lkpsym(temp, 1);
592 sp->s_addr = ap->a_addr ;
594 if (!strcmp(ap->a_id, "DSEG")) sp_dseg_s=sp;
597 sp = lkpsym(temp, 1);
598 sp->s_addr = ap->a_size;
601 if (!strcmp(ap->a_id, "DSEG")) sp_dseg_l=sp;
604 /*Since area BSEG is defined just before BSEG_BYTES, use the bit size of BSEG
605 to compute the byte size of BSEG_BYTES: */
606 if (!strcmp(ap->a_id, "BSEG"))
608 ap->a_ap->a_axp->a_size = ((ap->a_addr + ap->a_size + 7)/8); /*Bits to bytes*/
610 else if (!strcmp(ap->a_id, "DSEG"))
612 dseg_ap=ap; /*Need it later to set its correct size*/
617 /*Compute the size of DSEG*/
622 for(j=0; j<0x80; j++) if(idatamap[j]!=' ') dseg_ap->a_size++;
624 if(sp_dseg_s!=NULL) sp_dseg_s->s_addr=0;
625 if(sp_dseg_l!=NULL) sp_dseg_l->s_addr=dseg_ap->a_size;
628 /*Print the memory map*/
629 fprintf(stderr, "Internal RAM layout:\n"
630 " 0 1 2 3 4 5 6 7 8 9 A B C D E F");
633 if(j%16==0) fprintf(stderr, "\n0x%02x:|", j);
634 fprintf(stderr, "%c|", idatamap[j]);
636 fprintf(stderr, "\n0-3:Reg Banks, a-z:Data, B:Bits, Q:Overlay, I:iData, S:Stack\n");
641 Addr_T find_empty_space(Addr_T start, Addr_T size)
644 unsigned long mask, b;
650 j = (start + size) >> 5;
651 mask = -(1 << (start & 0x1F));
655 if (codemap[i] & mask)
658 for (b=0x80000000; b!=0; b>>=1, k--)
673 mask &= (1 << ((start + size) & 0x1F)) - 1;
674 if (codemap[i] & mask)
677 for (b=0x80000000; b!=0; b>>=1, k--)
682 start = (a & ~0x1F) + k;
691 Addr_T allocate_space(Addr_T start, Addr_T size, char* id)
697 j = (start + size) >> 5;
698 mask = -(1 << (start & 0x1F));
702 if (codemap[i] & mask)
704 fprintf(stderr, "memory overlap near 0x%X for %s\n", a, id);
706 codemap[i++] |= mask;
710 mask &= (1 << ((start + size) & 0x1F)) - 1;
711 if (codemap[i] & mask)
713 fprintf(stderr, "memory overlap near 0x%X for %s\n", a, id);
719 Addr_T lnksect2 (struct area *tap, int rloc)
721 register Addr_T size, addr;
722 register struct areax *taxp;
724 char fchar=' ', dchar='a';
725 char ErrMsg[]="?ASlink-Error-Could not get %d consecutive byte%s"
726 " in internal RAM for area %s.\n";
730 /*Notice that only ISEG and SSEG can be in the indirectly addressable internal RAM*/
731 if( (!strcmp(tap->a_id, "ISEG")) || (!strcmp(tap->a_id, "SSEG")) )
733 if((iram_size<=0)||(iram_size>0x100))
740 if((iram_size<=0)||(iram_size>0x80))
749 if ((tap->a_flag&A_PAG) && (addr & 0xFF))
752 "\n?ASlink-Warning-Paged Area %8s Boundary Error\n", tap->a_id);
758 /*Use a letter to identify each area in the internal RAM layout map*/
761 /**/ if(!strcmp(tap->a_id, "DSEG"))
762 fchar='D'; /*It will be converted to letters 'a' to 'z' later for each areax*/
763 else if(!strcmp(tap->a_id, "ISEG"))
765 else if(!strcmp(tap->a_id, "SSEG"))
767 else if(!strcmp(tap->a_id, "OSEG"))
769 else if(!strcmp(tap->a_id, "REG_BANK_0"))
771 else if(!strcmp(tap->a_id, "REG_BANK_1"))
773 else if(!strcmp(tap->a_id, "REG_BANK_2"))
775 else if(!strcmp(tap->a_id, "REG_BANK_3"))
777 else if(!strcmp(tap->a_id, "BSEG_BYTES"))
779 else if(!strcmp(tap->a_id, "BIT_BANK"))
786 /**/ if(!strcmp(tap->a_id, "GSINIT"))
791 /**/ if(!strcmp(tap->a_id, "XSTK"))
795 if (tap->a_flag&A_OVR) /* Overlayed sections */
799 if ( (fchar=='0')||(fchar=='1')||(fchar=='2')||(fchar=='3') ) /*Reg banks*/
804 for(j=addr; (j<(int)(addr+taxp->a_size)) && (j<ramlimit); j++)
807 else if( (fchar=='S') || (fchar=='Q') ) /*Overlay and stack in internal RAM*/
809 /*Find the size of the space currently used for this areax overlay*/
810 for(j=0, size=0; j<ramlimit; j++)
811 if(idatamap[j]==fchar) size++;
813 if( (fchar=='S') && (stacksize==0) )
815 /*Search for the largest space available and use it for stack*/
816 for(j=0, k=0, taxp->a_size=0; j<ramlimit; j++)
820 if((++k)>(int)taxp->a_size) taxp->a_size=k;
827 stacksize=taxp->a_size;
830 /*If more space required, release the previously allocated areax in
831 internal RAM and search for a bigger one*/
832 if((int)taxp->a_size>size)
834 size=(int)taxp->a_size;
836 for(j=0; j<ramlimit; j++)
837 if(idatamap[j]==fchar) idatamap[j]=' ';
839 /*Search for a space large enough in data memory for this overlay areax*/
840 for(j=0, k=0; j<ramlimit; j++)
846 if(k==(int)taxp->a_size) break;
849 if(k==(int)taxp->a_size)
851 taxp->a_addr = j-k+1;
852 if(addr<(unsigned int)ramlimit)
854 for(j=ramlimit-1; (j>=0)&&(idatamap[j]==' '); j--);
859 /*Mark the memory used for overlay*/
860 if(k==(int)taxp->a_size)
862 for(j=taxp->a_addr; (j<(int)(taxp->a_addr+taxp->a_size)) && (j<ramlimit); j++)
865 /*Set the new size of the data memory area*/
868 else /*Couldn't find a chunk big enough: report the problem.*/
870 tap->a_unaloc=taxp->a_size;
871 fprintf(stderr, ErrMsg, taxp->a_size, taxp->a_size>1?"s":"", tap->a_id);
876 for(j=0; j<ramlimit; j++)
878 if (idatamap[j]==fchar)
887 else if (fchar=='T') /*Bit addressable bytes in internal RAM*/
889 /*Find the size of the space currently used for this areax overlay*/
890 for(j=0x20, size=0; j<0x30; j++)
891 if(idatamap[j]==fchar) size++;
893 /*If more space required, release the previously allocated areax in
894 internal RAM and search for a bigger one*/
895 if((int)taxp->a_size>size)
897 size=(int)taxp->a_size;
899 for(j=0x20; j<0x30; j++)
900 if(idatamap[j]==fchar) idatamap[j]=' ';
902 /*Search for a space large enough in data memory for this overlay areax*/
903 for(j=0x20, k=0; j<0x30; j++)
909 if(k==(int)taxp->a_size) break;
912 if(k==(int)taxp->a_size)
914 taxp->a_addr = j-k+1;
915 if(addr<(unsigned int)0x30)
917 for(j=0x2F; (j>=0x20)&&(idatamap[j]==' '); j--);
918 if(j>=0x20) addr=j+1;
922 /*Mark the memory used for overlay*/
923 if(k==(int)taxp->a_size)
925 for(j=taxp->a_addr; (j<(int)(taxp->a_addr+taxp->a_size)) && (j<0x30); j++)
928 /*Set the new size of the data memory area*/
931 else /*Couldn't find a chunk big enough: report the problem.*/
933 tap->a_unaloc=taxp->a_size;
934 fprintf(stderr, ErrMsg, taxp->a_size, taxp->a_size>1?"s":"", tap->a_id);
939 for(j=0x20; j<0x30; j++)
941 if (idatamap[j]==fchar)
950 else /*Overlay areas not in internal ram*/
953 if (taxp->a_size > size) size = taxp->a_size;
958 else if (tap->a_flag & A_ABS) /* Absolute sections */
964 allocate_space(taxp->a_addr, taxp->a_size, tap->a_id);
966 taxp->a_addr = 0; /* reset to zero so relative addresses become absolute */
967 size += taxp->a_size;
971 else /* Concatenated sections */
973 if ((rloc == 1) && tap->a_size)
975 addr = find_empty_space(addr, tap->a_size);
979 if( (fchar=='D') || (fchar=='I') )
983 /*Search for a space large enough in internal RAM for this areax*/
984 for(j=0, k=0; j<ramlimit; j++)
990 if(k==(int)taxp->a_size) break;
993 if(k==(int)taxp->a_size)
995 taxp->a_addr = j-k+1;
996 if(addr<(unsigned int)ramlimit)
998 for(j=ramlimit-1; (j>=0)&&(idatamap[j]==' '); j--);
1003 for(j=taxp->a_addr; (j<(int)(taxp->a_addr+taxp->a_size)) && (j<ramlimit); j++)
1004 idatamap[j]=(fchar=='D')?dchar:fchar;
1005 if((taxp->a_size>0)&&(fchar=='D'))dchar++;
1006 if((dchar<'a')||(dchar>'z')) dchar='D'; /*Ran out of letters?*/
1008 else /*We are in trouble, there is not enough memory for an areax chunk*/
1010 taxp->a_addr = addr;
1011 addr += taxp->a_size;
1012 size += taxp->a_size;
1013 tap->a_unaloc+=taxp->a_size;
1014 fprintf(stderr, ErrMsg, taxp->a_size, taxp->a_size>1?"s":"", tap->a_id);
1024 for(j=addr; j<((int)(addr+taxp->a_size)); j++)
1028 taxp->a_addr = addr;
1029 addr += taxp->a_size;
1030 size += taxp->a_size;
1033 else /*For concatenated BIT, CODE, and XRAM areax's*/
1035 if((fchar=='K') && (taxp->a_size == 1))
1037 taxp->a_size = 256-(addr & 0xFF);
1039 //find next unused address now
1040 if ((rloc == 1) && taxp->a_size)
1042 addr = find_empty_space(addr, taxp->a_size);
1043 allocate_space(addr, taxp->a_size, tap->a_id);
1045 taxp->a_addr = addr;
1046 addr += taxp->a_size;
1047 size += taxp->a_size;
1054 if ((tap->a_flag&A_PAG) && (size > 256))
1057 "\n?ASlink-Warning-Paged Area %8s Length Error\n", tap->a_id);
1060 if ((tap->a_flag&A_PAG) && (tap->a_size) &&
1061 ((tap->a_addr & 0xFFFFFF00) != ((addr-1) & 0xFFFFFF00)))
1064 "\n?ASlink-Warning-Paged Area %8s Boundary Error\n", tap->a_id);