Patent
1995-05-18
1997-01-28
Treat, William M.
395419, G06F 9455
Patent
active
055985530
ABSTRACT:
Segmentation is added to a reduced instruction set computer (RISC) processor which supports paging. The arithmetic-logic-unit (ALU) is extended to allow for a 3-port addition so that the segment base can be added when the virtual address is being generated. Segment bounds checking is achieved by extending the paging system to allow for valid regions that are less than the full page size. Sub-page validity can mimic segmentation because a segment can be broken up into a number of full pages and one or more partially-valid pages at the segment boundaries. A page that is not wholly valid has an "event" on the page, and a memory reference to this page will either cause a software routine to be invoked to check the segment bound, or an extension to the TLB, called a sub-page validity buffer, is used to check if the reference was to a valid portion of the page. Events may also be defined for program watchpoints and defective memory locations. Segment bounds thus do not have to be compared for each access, and the bounds do not even have to be stored on the CPU die.
REFERENCES:
patent: 4675646 (1987-01-01), Lauer
patent: 5239642 (1993-08-01), Guitierrez et al.
patent: 5249278 (1993-09-01), Krauskopf
patent: 5371894 (1994-12-01), DiBrino
Blomgren James S.
Cohen Earl T.
Richter David E.
Auvinen Stuart T.
Exponential Technology Inc.
Treat William M.
LandOfFree
Program watchpoint checking using paging with sub-page validity does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Program watchpoint checking using paging with sub-page validity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Program watchpoint checking using paging with sub-page validity will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-947693