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 the 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 locIndex);
493 unsigned long codemap[524288];
494 unsigned long xdatamap[131072];
496 /*Modified version of the functions for packing variables in internal data memory*/
499 Addr_T rloc[4]={0, 0, 0, 0};
505 struct area *dseg_ap = NULL;
506 struct area *abs_ap = NULL;
507 struct area *gs0_ap = NULL;
508 struct sym *sp_dseg_s=NULL, *sp_dseg_l=NULL;
510 for(j=0; j<256; j++) idatamap[j]=' ';
511 memset(codemap, 0, sizeof(codemap));
512 memset(xdatamap, 0, sizeof(xdatamap));
514 /* first sort all absolute areas to the front */
516 /* no need to check first area, it's in front anyway */
517 while (ap && ap->a_ap)
519 if (ap->a_ap->a_flag & A_ABS)
520 {/* next area is absolute, move it to front,
521 reversed sequence is no problem for absolutes */
523 ap->a_ap = abs_ap->a_ap;
524 abs_ap->a_ap = areap;
533 /* next accumulate all GSINITx/GSFINAL area sizes
534 into GSINIT so they stay together */
538 if (!strncmp(ap->a_id, "GS", 2))
545 ap->a_size += axp->a_size;
549 gs_size += ap->a_size;
550 if (!strcmp(ap->a_id, "GSINIT0"))
558 gs0_ap->a_size = gs_size;
563 /* Determine memory space */
564 if (ap->a_flag & A_CODE) locIndex = 1;
565 else if (ap->a_flag & A_XDATA) locIndex = 2;
566 else if (ap->a_flag & A_BIT) locIndex = 3;
569 if (ap->a_flag & A_ABS) /* Absolute sections */
571 lnksect2(ap, locIndex);
573 else /* Relocatable sections */
577 ap->a_addr = rloc[locIndex];
581 rloc[locIndex] = lnksect2(ap, locIndex);
585 * Create symbols called:
586 * s_<areaname> the start address of the area
587 * l_<areaname> the length of the area
590 if (! symeq(ap->a_id, _abs_))
592 strncpy(temp+2,ap->a_id,NCPS-2);
596 sp = lkpsym(temp, 1);
597 sp->s_addr = ap->a_addr ;
599 if (!strcmp(ap->a_id, "DSEG")) sp_dseg_s=sp;
602 sp = lkpsym(temp, 1);
603 sp->s_addr = ap->a_size;
606 if (!strcmp(ap->a_id, "DSEG")) sp_dseg_l=sp;
609 /*Since area BSEG is defined just before BSEG_BYTES, use the bit size of BSEG
610 to compute the byte size of BSEG_BYTES: */
611 if (!strcmp(ap->a_id, "BSEG"))
613 ap->a_ap->a_axp->a_size = ((ap->a_addr + ap->a_size + 7)/8); /*Bits to bytes*/
615 else if (!strcmp(ap->a_id, "DSEG"))
617 dseg_ap=ap; /*Need it later to set its correct size*/
622 /*Compute the size of DSEG*/
627 for(j=0; j<0x80; j++) if(idatamap[j]!=' ') dseg_ap->a_size++;
629 if(sp_dseg_s!=NULL) sp_dseg_s->s_addr=0;
630 if(sp_dseg_l!=NULL) sp_dseg_l->s_addr=dseg_ap->a_size;
634 Addr_T find_empty_space(Addr_T start, Addr_T size, unsigned long *map)
637 unsigned long mask, b;
643 j = (start + size) >> 5;
644 mask = -(1 << (start & 0x1F));
651 for (b=0x80000000; b!=0; b>>=1, k--)
666 mask &= (1 << ((start + size) & 0x1F)) - 1;
670 for (b=0x80000000; b!=0; b>>=1, k--)
675 start = (a & ~0x1F) + k;
684 Addr_T allocate_space(Addr_T start, Addr_T size, char* id, unsigned long *map)
690 j = (start + size) >> 5;
691 mask = -(1 << (start & 0x1F));
697 fprintf(stderr, "memory overlap near 0x%X for %s\n", a, id);
703 mask &= (1 << ((start + size) & 0x1F)) - 1;
706 fprintf(stderr, "memory overlap near 0x%X for %s\n", a, id);
712 Addr_T lnksect2 (struct area *tap, int locIndex)
714 register Addr_T size, addr;
715 register struct areax *taxp;
717 char fchar=' ', dchar='a';
718 char ErrMsg[]="?ASlink-Error-Could not get %d consecutive byte%s"
719 " in internal RAM for area %s.\n";
723 /*Notice that only ISEG and SSEG can be in the indirectly addressable internal RAM*/
724 if( (!strcmp(tap->a_id, "ISEG")) || (!strcmp(tap->a_id, "SSEG")) )
726 if((iram_size<=0)||(iram_size>0x100))
733 if((iram_size<=0)||(iram_size>0x80))
742 if ((tap->a_flag&A_PAG) && (addr & 0xFF))
745 "\n?ASlink-Warning-Paged Area %8s Boundary Error\n", tap->a_id);
751 /*Use a letter to identify each area in the internal RAM layout map*/
754 /**/ if(!strcmp(tap->a_id, "DSEG"))
755 fchar='D'; /*It will be converted to letters 'a' to 'z' later for each areax*/
756 else if(!strcmp(tap->a_id, "ISEG"))
758 else if(!strcmp(tap->a_id, "SSEG"))
760 else if(!strcmp(tap->a_id, "OSEG"))
762 else if(!strcmp(tap->a_id, "REG_BANK_0"))
764 else if(!strcmp(tap->a_id, "REG_BANK_1"))
766 else if(!strcmp(tap->a_id, "REG_BANK_2"))
768 else if(!strcmp(tap->a_id, "REG_BANK_3"))
770 else if(!strcmp(tap->a_id, "BSEG_BYTES"))
772 else if(!strcmp(tap->a_id, "BIT_BANK"))
777 else if (locIndex == 1)
779 /**/ if(!strcmp(tap->a_id, "GSINIT"))
782 else if (locIndex == 2)
784 /**/ if(!strcmp(tap->a_id, "XSTK"))
788 if (tap->a_flag&A_OVR) /* Overlayed sections */
792 if ( (fchar=='0')||(fchar=='1')||(fchar=='2')||(fchar=='3') ) /*Reg banks*/
797 for(j=addr; (j<(int)(addr+taxp->a_size)) && (j<ramlimit); j++)
800 else if( (fchar=='S') || (fchar=='Q') ) /*Overlay and stack in internal RAM*/
802 /*Find the size of the space currently used for this areax overlay*/
803 for(j=0, size=0; j<ramlimit; j++)
804 if(idatamap[j]==fchar) size++;
806 if( (fchar=='S') && (stacksize==0) )
808 /*Search for the largest space available and use it for stack*/
809 for(j=0, k=0, taxp->a_size=0; j<ramlimit; j++)
813 if((++k)>(int)taxp->a_size) taxp->a_size=k;
820 stacksize=taxp->a_size;
823 /*If more space required, release the previously allocated areax in
824 internal RAM and search for a bigger one*/
825 if((int)taxp->a_size>size)
827 size=(int)taxp->a_size;
829 for(j=0; j<ramlimit; j++)
830 if(idatamap[j]==fchar) idatamap[j]=' ';
832 /*Search for a space large enough in data memory for this overlay areax*/
833 for(j=0, k=0; j<ramlimit; j++)
839 if(k==(int)taxp->a_size) break;
842 if(k==(int)taxp->a_size)
844 taxp->a_addr = j-k+1;
845 if(addr<(unsigned int)ramlimit)
847 for(j=ramlimit-1; (j>=0)&&(idatamap[j]==' '); j--);
852 /*Mark the memory used for overlay*/
853 if(k==(int)taxp->a_size)
855 for(j=taxp->a_addr; (j<(int)(taxp->a_addr+taxp->a_size)) && (j<ramlimit); j++)
858 /*Set the new size of the data memory area*/
861 else /*Couldn't find a chunk big enough: report the problem.*/
863 tap->a_unaloc=taxp->a_size;
864 fprintf(stderr, ErrMsg, taxp->a_size, taxp->a_size>1?"s":"", tap->a_id);
869 for(j=0; j<ramlimit; j++)
871 if (idatamap[j]==fchar)
880 else if (fchar=='T') /*Bit addressable bytes in internal RAM*/
882 /*Find the size of the space currently used for this areax overlay*/
883 for(j=0x20, size=0; j<0x30; j++)
884 if(idatamap[j]==fchar) size++;
886 /*If more space required, release the previously allocated areax in
887 internal RAM and search for a bigger one*/
888 if((int)taxp->a_size>size)
890 size=(int)taxp->a_size;
892 for(j=0x20; j<0x30; j++)
893 if(idatamap[j]==fchar) idatamap[j]=' ';
895 /*Search for a space large enough in data memory for this overlay areax*/
896 for(j=0x20, k=0; j<0x30; j++)
902 if(k==(int)taxp->a_size) break;
905 if(k==(int)taxp->a_size)
907 taxp->a_addr = j-k+1;
908 if(addr<(unsigned int)0x30)
910 for(j=0x2F; (j>=0x20)&&(idatamap[j]==' '); j--);
911 if(j>=0x20) addr=j+1;
915 /*Mark the memory used for overlay*/
916 if(k==(int)taxp->a_size)
918 for(j=taxp->a_addr; (j<(int)(taxp->a_addr+taxp->a_size)) && (j<0x30); j++)
921 /*Set the new size of the data memory area*/
924 else /*Couldn't find a chunk big enough: report the problem.*/
926 tap->a_unaloc=taxp->a_size;
927 fprintf(stderr, ErrMsg, taxp->a_size, taxp->a_size>1?"s":"", tap->a_id);
932 for(j=0x20; j<0x30; j++)
934 if (idatamap[j]==fchar)
943 else /*Overlay areas not in internal ram*/
946 if (taxp->a_size > size) size = taxp->a_size;
951 else if (tap->a_flag & A_ABS) /* Absolute sections */
957 for (j=taxp->a_addr; (j<(int)(taxp->a_addr+taxp->a_size)) && (j<ramlimit); j++)
962 allocate_space(taxp->a_addr, taxp->a_size, tap->a_id, codemap);
966 allocate_space(taxp->a_addr, taxp->a_size, tap->a_id, xdatamap);
968 taxp->a_addr = 0; /* reset to zero so relative addresses become absolute */
969 size += taxp->a_size;
973 else /* Concatenated sections */
975 if ((locIndex == 1) && tap->a_size)
977 addr = find_empty_space(addr, tap->a_size, codemap);
979 if ((locIndex == 2) && tap->a_size)
981 addr = find_empty_space(addr, tap->a_size, xdatamap);
985 if( (fchar=='D') || (fchar=='I') )
989 /*Search for a space large enough in internal RAM for this areax*/
990 for(j=0, k=0; j<ramlimit; j++)
996 if(k==(int)taxp->a_size) break;
999 if(k==(int)taxp->a_size)
1001 taxp->a_addr = j-k+1;
1002 if(addr<(unsigned int)ramlimit)
1004 for(j=ramlimit-1; (j>=0)&&(idatamap[j]==' '); j--);
1009 for(j=taxp->a_addr; (j<(int)(taxp->a_addr+taxp->a_size)) && (j<ramlimit); j++)
1010 idatamap[j]=(fchar=='D')?dchar:fchar;
1011 if((taxp->a_size>0)&&(fchar=='D'))dchar++;
1012 if((dchar<'a')||(dchar>'z')) dchar='D'; /*Ran out of letters?*/
1014 else /*We are in trouble, there is not enough memory for an areax chunk*/
1016 taxp->a_addr = addr;
1017 addr += taxp->a_size;
1018 size += taxp->a_size;
1019 tap->a_unaloc+=taxp->a_size;
1020 fprintf(stderr, ErrMsg, taxp->a_size, taxp->a_size>1?"s":"", tap->a_id);
1030 for(j=addr; j<((int)(addr+taxp->a_size)); j++)
1034 taxp->a_addr = addr;
1035 addr += taxp->a_size;
1036 size += taxp->a_size;
1039 else /*For concatenated BIT, CODE, and XRAM areax's*/
1041 if((fchar=='K') && (taxp->a_size == 1))
1043 taxp->a_size = 256-(addr & 0xFF);
1045 //find next unused address now
1046 if ((locIndex == 1) && taxp->a_size)
1048 addr = find_empty_space(addr, taxp->a_size, codemap);
1049 allocate_space(addr, taxp->a_size, tap->a_id, codemap);
1051 if ((locIndex == 2) && taxp->a_size)
1053 addr = find_empty_space(addr, taxp->a_size, xdatamap);
1054 allocate_space(addr, taxp->a_size, tap->a_id, xdatamap);
1056 taxp->a_addr = addr;
1057 addr += taxp->a_size;
1058 size += taxp->a_size;
1065 if ((tap->a_flag&A_PAG) && (size > 256))
1068 "\n?ASlink-Warning-Paged Area %8s Length Error\n", tap->a_id);
1071 if ((tap->a_flag&A_PAG) && (tap->a_size) &&
1072 ((tap->a_addr & 0xFFFFFF00) != ((addr-1) & 0xFFFFFF00)))
1075 "\n?ASlink-Warning-Paged Area %8s Boundary Error\n", tap->a_id);