Virtual address to physical address translation

By invalidly converting backup buffer (TLB) entries in the memory management unit (MMU) and restarting page table search, the problem of long-term search of page tables is solved, the conversion efficiency of virtual address to physical address is improved, and the processing system is improved Response speed.

CN112262375BActive Publication Date: 2024-12-03QUALCOMM INC
View PDF 3 Cites 0 Cited by

Patent Information

Application Number
CN201980038459.1
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Priority Date
2018-04-26
Filing Date
2019-04-25
Publication Date
2024-12-03
Estimated Expiration
2039-04-25

AI Technical Summary

Technical Problem

In the prior art, in the process of converting virtual addresses to physical addresses, page table search takes a long time, which makes the processing system unable to continue other processing and the equipment operation speed is slow.

Method used

After receiving the conversion request, the memory management unit (MMU) first invalidates the specified virtual address entry in the conversion backup buffer (TLB), and restarts the search for the specified virtual address in the page table to improve the conversion efficiency.

Benefits of technology

By invalidly specifying virtual address entries in the TLB, the waiting time is reduced, the response speed of the processing system is improved, and the equipment operation efficiency is improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN112262375B_ABST
    Figure CN112262375B_ABST
Patent Text Reader

Abstract

A memory management unit (MMU) is disclosed. The MMU is configured to: receive a translation request from a processing system, wherein the translation request specifies a virtual address to be translated; search a page table entry that specifies the virtual address in a page table stored in a physical memory system; receive a translation lookaside buffer invalidation (TLBI) signal from the processing system, wherein the TLBI signal specifies the virtual address; in response to receiving the TLBI signal that specifies the virtual address, invalidate a translation lookaside buffer (TLB) entry in a TLB, wherein the invalidated TLB entry specifies the virtual address and restart the search for a page table entry that specifies the virtual address in the page table.
Need to check novelty before this filing date? Find Prior Art

Description

[0001] Priority claim under 35 USC § 119

[0002] This patent application claims priority to non-provisional application No. 15 / 964,061, filed on April 26, 2018, entitled “TRANSLATION OF VIRTUAL ADDRESSES TO PHYSICAL ADDRESSES,” which application has been assigned to its assignee and is hereby expressly incorporated by reference.

[0003] Introduction

[0004] Aspects of the present disclosure relate generally to cache memory and, more particularly, to virtual to physical address translation.

[0005] A device may include a processing system including one or more central processing units (CPUs), a virtual memory management unit (MMU), and a translation lookaside buffer (TLB). The processing system may communicate with a physical memory system, such as a random access memory (RAM). At least one page table that maps each virtual address to a physical address associated with the physical memory system is in the physical memory system.

[0006] Using this mapping, the MMU can translate any virtual address into a physical address. A substantially complete mapping may be provided in the physical memory system, while the TLB may include a smaller subset of translations (usually corresponding to highly important or frequently used / recently used virtual addresses). The TLB is smaller than the physical memory system and can therefore be searched faster.

[0007] The physical memory system has a finite capacity. Therefore, it is often necessary to update the address mappings in the TLB and page tables. When new data is requested after the capacity of the physical memory system is reached, the old page in the physical memory system must be overwritten with the page containing the requested new data. Any translation (whether in the TLB or in the page table) pointing to the page to be overwritten must be invalidated.

[0008] Occasionally, a situation occurs where a particular translation is invalidated in the TLB while the translation of the specified virtual address is in process in the page table. According to conventional methods, the virtual address is marked as invalid, and the translation of the virtual address is completed. The processing system is then notified when the translation and invalidation are complete. Only after receiving the notification can the processing system proceed with the particular processing.

[0009] As mentioned above, the search of the page table can be time consuming. Therefore, in the above case, the processing system is required to spend time waiting for notification. Therefore, the processing system cannot continue with other processing, and the device operates more slowly. Therefore, new technologies are needed to quickly convert and remap virtual addresses. Summary of the invention

[0010] The following summary is an overview provided merely to assist in describing various aspects of the present disclosure and is provided merely for illustration of these aspects and not limitation thereof.

[0011] According to various aspects of the present disclosure, a memory management unit (MMU) is disclosed. The MMU can be configured to: receive a translation request from a processing system, wherein the translation request specifies a virtual address to be translated; search a page table entry for the specified virtual address in a page table stored in a physical memory system; receive a translation lookaside buffer invalidation (TLBI) signal from the processing system, wherein the TLBI signal specifies the virtual address; in response to receiving the TLBI signal specifying the virtual address, invalidate a translation lookaside buffer (TLB) entry in the TLB, wherein the invalidated TLB entry specifies the virtual address; and restart the search for the page table entry for the specified virtual address in the page table.

[0012] According to other aspects of the present disclosure, a method is disclosed. The method may include: receiving a translation request from a processing system at a memory management unit (MMU), wherein the translation request specifies a virtual address to be translated; searching a page table entry for the specified virtual address in a page table stored in a physical memory system; receiving a translation lookaside buffer invalidation (TLBI) signal from the processing system, wherein the TLBI signal specifies the virtual address; in response to receiving the TLBI signal specifying the virtual address, invalidating a translation lookaside buffer (TLB) entry in a TLB, wherein the invalidated TLB entry specifies the virtual address; and restarting the search for a page table entry for the specified virtual address in the page table.

[0013] According to other aspects of the present disclosure, a device is disclosed. The device may include: a component for receiving a translation request from a processing system at a memory management unit (MMU), wherein the translation request specifies a virtual address to be translated; a component for searching a page table entry for a specified virtual address in a page table stored in a physical memory system; a component for receiving a translation lookaside buffer invalidation (TLBI) signal from the processing system, wherein the TLBI signal specifies a virtual address; a component for invalidating a translation lookaside buffer (TLB) entry in a TLB, wherein in response to receiving the TLBI signal specifying the virtual address, the invalidated TLB entry specifies the virtual address; and a component for restarting the search for a page table entry in a page table in response to receiving the TLBI signal specifying the virtual address. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] The drawings are presented to aid in describing various aspects of the disclosure and are provided solely for illustration of these aspects and not limitation thereof.

[0015] Figure 1

[0013] Generally illustrated are systems for performing virtual to physical address translation and mapping in accordance with various aspects of the present disclosure.

[0016] Figure 2 A method for restarting a search in a page table for an entry including a virtual address associated with a TLBI is generally illustrated.

[0017] Figure 3 Generally illustrated is a signal flow diagram showing an exchange of signals according to a conventional method.

[0018] Figure 4 Generally, a signal flow diagram is illustrated, which shows the signal flow diagram of various aspects of the present disclosure. Figure 1 The signal exchange performed by the various components of the system.

[0019] Figure 5 Methods for restarting and / or retrieving a conversion based on a LEAF indicator are generally illustrated in accordance with various aspects of the present disclosure.

[0020] Figure 6 A method is generally illustrated, which is Figure 5 An example implementation of determining whether to fully reboot is depicted.

[0021] Figure 7 A method is generally illustrated, which is Figure 5 An example implementation of determining whether to refetch is depicted.

[0022] Figure 8 An exemplary electronic device is generally illustrated in which one aspect of the present disclosure may be advantageously employed. DETAILED DESCRIPTION

[0023] Figure 1 A system 100 for performing virtual to physical address translation and mapping according to aspects of the present disclosure is generally illustrated.

[0024] System 100 includes a processing system 110 and a physical memory system 150. Processing system 110 may include one or more central processing units (CPUs) 120, a memory management unit (MMU) 130, and a translation lookaside buffer (TLB) 140. Processor interconnect 123 may couple CPU 120 to MMU 130. MMU 130 may be coupled to TLB 140 via TLB path 134. Physical memory system 150 may include physical memory 160 and page table 170. Physical memory system 150 may be, for example, a random access memory (RAM). MMU 130 may be coupled to physical memory system 150 via physical memory interconnect 135.

[0025] The page table 170 maps each virtual address used by the processing system 110 to a corresponding physical address associated with the physical memory system 150. The physical address may be located in the physical memory system 150, a hard disk driver (not shown), or some other storage component. When the processing system 110 requires data, the CPU 120 may send the virtual address of the requested data to the MMU 130. The MMU 130 may cooperate with the TLB 140 and / or the physical memory system 150 to perform the translation and then return the corresponding physical address to the CPU 120.

[0026] In order to perform the conversion, MMU 130 first checks TLB 140 to determine whether the virtual address of the requested data matches the virtual address of a TLB entry associated with the TLB entry. If there is a match between the requested virtual address and the virtual address in a specific TLB entry, the processing system checks the TLB entry to determine whether the valid bit is set. If the entry is valid, the TLB entry includes a valid conversion of the virtual address. Therefore, the corresponding physical address can be returned to the MMU very quickly, thereby completing the conversion. Using the converted physical address, the processing system 110 can retrieve the requested data.

[0027] If MMU 130 determines that the virtual address of the requested data does not match the virtual address of one of the TLB entries associated therewith (or if the matching TLB entry is marked invalid), MMU 130 traverses page tables 170 in physical memory system 150 until a matching virtual address is found.

[0028] Each conversion can be performed in levels. For example, MMU 130 can traverse the first page table in page table 170 to search for a match. The matching entry found in the first page table can include the first few bits of the physical address, and the indication of the additional bit can be found in the second page table in page table 170. Then, MMU 130 can store the first few bits and traverse the second page table to search for a match. As mentioned above, the matching entry can include the next few bits of the physical address, and if the matching entry includes an indication that the additional bit can be found in the third page table of page table 170, the process repeats. The process can be repeated until the matching entry indicates that the last level of conversion has been reached. The last level can be, for example, the most recently reached level. Once the last level of conversion is completed, MMU 130 should have a complete conversion of the complete physical address.

[0029] If there is a match between the requested virtual address and the virtual address in a particular page table entry, the processing system 110 retrieves the physical address from the page table entry. Once found, the physical address is returned to the MMU 130. However, using the page table 170 to perform translations can be much slower than using the TLB 140. The TLB 140 is smaller than the physical memory system 150 and is not as remote as the physical memory system 150. Therefore, the TLB 140 can be searched more quickly. The TLB 140 typically replicates a subset of the translations located in the page table 170. The replicated translations are typically associated with the most important, most frequently used, and / or most recently used virtual addresses.

[0030] It is often necessary to update the address mappings in the TLB 140 and the page table 170. The physical memory system 150 may have a finite capacity. When new data is requested after the capacity of the physical memory system 150 is reached, some pages within the physical memory system 150 must be overwritten with the requested new data. Once the overwriting has been performed and / or completed, the mapping of virtual addresses to physical addresses must be updated to reflect the fact that the overwritten data is no longer located at its previous physical address.

[0031] To invalidate the copy in TLB 140, CPU 120 may send a TLB invalidation character (TLBI) to MMU 130. If the virtual address specified in the TLBI matches a TLB entry in TLB 140, then the TLB entry is marked as invalid and the TLB will not be used for translation until it is overwritten with a valid translation (and marked as valid).

[0032] Figure 2 Generally, a method 200 for restarting a search in a page table for an entry including a virtual address associated with a TLBI is illustrated. The method 200 will be described below as it will be described by Figure 1The depicted MMU 130 performs. However, it will be appreciated that the method 200 may be performed by any suitable device.

[0033] In 210, the MMU 130 receives a translation request specifying a virtual address to be translated. Thus, the MMU 130 may constitute means for receiving a translation request specifying a virtual address to be translated. The translation request may be received from, for example, the CPU 120.

[0034] At 220, the MMU 130 searches a page table (e.g., one or more page tables 170) for a page table entry that includes the specified virtual address (received at 210). The search at 220 may be performed in cooperation with the physical memory system 150. Thus, the MMU 130 and / or the physical memory system 150 may constitute means for searching one or more page tables for a page table entry that includes the virtual address specified in the translation request.

[0035] At 230, the MMU 130 receives a TLBI signal indicating that the virtual address specified in 210 is to be invalidated. Thus, the MMU 130 may constitute means for receiving a TLBI signal specifying that the specified virtual address is to be invalidated.

[0036] At 240, MMU 130 optionally discards one or more translated bits associated with the translation of the virtual address. Thus, MMU 130 may constitute a component for discarding one or more translated bits associated with the translation of the virtual address. In some scenarios, there may not be any translated bits, in which case the discard at 240 may be omitted.

[0037] At 250, MMU 130 invalidates a TLB entry in a TLB (e.g., TLB 140), wherein the invalidated TLB entry specifies a virtual address (i.e., the same virtual address specified in 210 and 230). Thus, MMU 130 may constitute means for invalidating a TLB entry in a TLB, wherein the invalidated TLB entry specifies a virtual address.

[0038] At 260, the MMU 130 restarts searching the page table for the specified virtual address. The restart at 260 may be performed in cooperation with the physical memory system 150. Thus, the MMU 130 and / or the physical memory system 150 may constitute means for restarting the search of the page table.

[0039] As will be discussed in more detail below, in some scenarios, the MMU 130 may perform a full restart by discarding all converted bits and restarting from the first level of conversion. In other scenarios, the MMU 130 may perform a re-fetch by discarding a portion of the converted bits (e.g., only bits associated with the most recent level of conversion) and replacing them. As used herein, a restart may be a general term that encompasses a full restart or a re-fetch.

[0040] Figure 2 The functionality depicted can be implemented in various ways consistent with the teachings of this article. In some designs, the functionality can be implemented as one or more electrical components. In some designs, the functionality can be implemented as a processing system including one or more processor components. In some designs, the functionality can be implemented using, for example, at least a portion of one or more integrated circuits (e.g., ASICs). As discussed herein, an integrated circuit can include a processor, software, other related components, or any combination thereof. Therefore, the functionality of different modules can be implemented as, for example, different subsets of integrated circuits, different subsets of software module sets, or combinations thereof. Moreover, it is to be understood that a given subset (e.g., a subset of an integrated circuit and / or a software module set) can provide at least a portion of the functionality for more than one module.

[0041] in addition, Figure 2 The functionality depicted, as well as other components and functions described herein, may be implemented using any suitable components. Such components may also be implemented, at least in part, using corresponding structures taught herein. The above components may also correspond to similarly designated "code for..." functionality. Thus, in some aspects, one or more such components may be implemented using one or more of the following: a processor component, an integrated circuit, or other suitable structure taught herein.

[0042] Figure 3 Generally illustrated is a signal flow diagram 300 showing the exchange of signals according to a conventional method. The signal flow diagram 300 shows signals exchanged between a conventional CPU, a conventional MMU, and a conventional physical memory system.

[0043] At 310 , the CPU sends a request to the MMU to convert the specified virtual address into a corresponding physical address.

[0044] At 320, the MMU searches the conventional TLB for the specified virtual address. At 322, the MMU determines whether the virtual address is in the TLB. In this example, the virtual address is not in the TLB ('No' in 322). As a result, the MMU triggers a search of the physical memory system (particularly one or more of its page tables).

[0045] At 330, the physical memory system searches the page table for the specified virtual address. The search of the page table may sometimes be referred to as a "page walk". The page walk may take some time to complete and may continue until the physical memory system finds a page table entry that includes the specified virtual address. At 332, the physical memory system returns the corresponding physical address to the MMU.

[0046] However, before the return at 332 is performed by the physical memory system (ie, before or during the page walk), one or more CPUs may invalidate one or more translations.

[0047] At 340, the CPU may transmit one or more TLBIs that specify the same virtual address as specified in the request at 310. At 342, after transmitting the one or more TLBIs, the CPU may transmit a synchronization request (SYNC-REQ) to the MMU.

[0048] After receiving one or more TLBIs and a SYNC-REQ, the MMU waits for translation of the specified virtual address at 350. The MMU may wait for the duration of the page walk.

[0049] At 360, after receiving the corresponding physical address from the physical memory system, the MMU determines whether the translation matches one of the one or more TLBIs. In this example, the virtual address being translated is the same as the invalid virtual address ('yes' at 360). Therefore, the MMU determines that there is a match between the translation returned at 332 and one of the one or more TLBIs received at 340, and proceeds to 370.

[0050] At 370, in response to determining that the corresponding physical address is associated with the virtual address specified in the TLBI, the MMU discards the corresponding physical address. At 372, the MMU determines whether all translations (i.e., all translations that match the virtual address specified in the TLBI and / or all translations to be processed in the physical memory system when the TLBI is received) have been returned by the physical memory system and discarded by the MMU. If the MMU determines that the translation has not been returned and discarded ('No' in 372), the MMU returns to 350 and waits for the next translation. If the MMU determines that all translations have been returned and discarded ('Yes' in 372), the MMU proceeds to 380.

[0051] The MMU transmits a synchronization acknowledgement (SYNC-ACK) to the CPU at 380. The SYNC-ACK may signal to the CPU that it may safely proceed with any processing that has the transition invalidation specified in the TLBI as a precondition.

[0052] The CPU requests that the virtual address be retranslated to a physical address at 390. The virtual address specified in the request transmitted at 390 may be the same as the virtual address specified in the request transmitted at 310. Assuming that a new TLBI is not issued, the TLB and / or page table may be used to perform the translation and return the corresponding physical address.

[0053] Figure 4 Generally illustrated is a signal flow diagram 400 showing the Figure 1 The various components of the depicted system 100 perform signal exchanges according to various aspects of the present disclosure. Specifically, the signal flow diagram 400 shows the signals exchanged between the CPU 120, the MMU 130, and the physical memory system 150.

[0054] At 410 , one or more CPUs 120 send a request to the MMU 130 to convert the specified virtual address to a corresponding physical address.

[0055] At 420, the MMU 130 searches the TLB 140 for the specified virtual address. In this example, the virtual address is not in the TLB 140. At 422, the MMU 130 determines whether the virtual address is in the TLB 140. In this example, the virtual address is not in the TLB 140 ('No' in 422). As a result, the MMU 130 triggers a search of the page table 170 provided in the physical memory system 150.

[0056] At 430, the physical memory system 150 searches the page table 170 for the specified virtual address. Page walking may take some time to complete, and may continue until the physical memory system 150 finds a page table entry in the page table 170 that includes the specified virtual address.

[0057] As in Figure 3 In the depicted signaling scenario, the CPU 120 may invalidate one or more translations before or during the page walk at 430. At 440, the CPU 120 may transmit one or more TLBIs that specify the same virtual address as the virtual address specified in the request at 410. At 442, after transmitting the one or more TLBIs, the CPU 120 may transmit a synchronization request (SYNC-REQ) to the MMU 130.

[0058] At 450, MMU 130 determines whether the virtual address associated with the pending translation matches the virtual address specified in the TLBI. In this example, the virtual address specified in the TLBI is currently being searched (at 430). In response to determining that the virtual address specified in the TLBI is currently being searched ('yes' at 450), MMU 130 proceeds to 452. In some implementations, this determination may be as follows with respect to Figures 5 to 7 Described method is implemented.

[0059] At 452, MMU 130 transmits a SYNC-ACK to CPU 120. The SYNC-ACK transmitted at 452 may be similar in some aspects to the SYNC-ACK transmitted at 452. Figure 3 Specifically, the SYNC-ACK may signal to the CPU 120 that the CPU 120 may safely proceed with any processing that has the conversion invalidation specified in the TLBI as a precondition. However, it will be understood that Figure 4 The depicted signal flow diagram 400 results in faster transmission and reception of the SYNC-ACK. This is because the MMU 130 does not wait for the transition before transmitting the SYNC-ACK (as at 350).

[0060] At 454, the MMU 130 discards the one or more translated bits associated with the invalid virtual address. For example, if the physical memory system 150 has provided the MMU 130 with one or more bits ( Figure 4 100 ), the MMU 130 discards the one or more bits. As will be discussed in more detail below, a full restart may require discarding all translated bits associated with the invalid virtual address, while a re-fetch may preserve one or more translated bits associated with unaffected levels of translation and only discard one or more translated bits associated with the last level of translation.

[0061] At 456, the MMU 130 completely restarts or re-fetches a portion of the translation requested at 410. Specifically, the MMU 130 triggers a search in the page table 170 for the specified virtual address (the same virtual address identified in the request at 410). Figures 5 to 7 As discussed in more detail, the decision between a full restart or a re-fetch can be based on the LEAF indicator provided in the TLBI. (As far as applicants are aware, LEAF is traditionally capitalized, but it is not an acronym.)

[0062] At 470, the physical memory system 150 searches the page table 170 for the specified virtual address. At 472, the physical memory system 150 returns a physical address corresponding to the specified virtual address to the MMU 130. At 480, the MMU 130 provides the physical address to the CPU 120.

[0063] It is important to understand that Figure 3 In contrast to the depicted MMU, regardless of whether the translation has been completed, the MMU 130 will automatically restart the translation requested at 410. If a TLBI is received before the corresponding physical address (or portion thereof) has been provided back to the CPU 120, the MMU 130 discards one or more of the translated bits and immediately proceeds to replace them with a new (valid) translation.

[0064] Figure 5 Generally, a method 500 for restarting and / or retrieving a conversion based on a LEAF indicator is illustrated in accordance with aspects of the present disclosure. The method 500 may be Figure 4 An example implementation of the determination at 456 is depicted.

[0065] The TLBI may include multiple fields, including: a virtual address field, an application space ID (ASID) field, a virtual machine ID (VMID) field, a translation regime indicator field, a LEAF indicator field, a phase indicator field, other suitable fields or any combination thereof. The LEAF indicator can be, for example, a one-bit field, where 1 (LEAF-1) indicates that the last level of translation has been invalidated, and 0 (LEAF-0) indicates that some other level of translation has been invalidated. The method 500 will be described below as it will be performed by the MMU 130. However, it will be understood that according to various aspects of the present disclosure, the method 500 can be performed by any suitable device.

[0066] At 510, MMU 130 determines whether LEAF-0 or LEAF-1 is indicated in the LEAF indicator field of the received TLBI. If LEAF-0 is indicated ('LEAF-0' at 510), method 500 may proceed to 520. If LEAF-1 is indicated ('LEAF-1' at 510), method 500 may proceed to 540.

[0067] At 520, the MMU 130 sets a page size parameter that is equal to the page size value associated with the first fetch level. The page size parameter may indicate the size and / or arrangement of a mask used to perform any or all virtual address match determinations described in the present disclosure. Thus, a determination as to whether a specified virtual address has a match may depend on the page size. Depending on the page size parameter, one or more bits of the virtual address may be masked (i.e., not used to determine a match).

[0068] At 530, the MMU 130 determines whether to completely restart the entire translation, as will be described below with respect to Figure 6 discussed in more detail.

[0069] At 540, the MMU 130 sets a page size parameter equal to the page size value associated with the current roaming level. As mentioned above, the page size parameter may indicate the size and / or arrangement of a mask used to perform the match determination of the present disclosure.

[0070] At 550, the MMU 130 determines whether to re-fetch the last level of the translation, as will be described below with respect to Figure 6 discussed in more detail.

[0071] It is to be understood that method 500 or elements thereof may be as follows Figure 4 Depicted are example implementations of the determination at 450 and / or the discard at 454. Furthermore, the method 500 may constitute a prerequisite for a full restart or a refetch at 456, wherein the MMU 130 determines whether to restart the translation and whether the restart is a full restart or a refetch.

[0072] Figure 6 A method is generally illustrated, which is Figure 5 The example implementation of determining whether to completely restart 530 is depicted. Thus, method 600 (with Figure 5 The method 600 will be described below as it will be performed by the MMU 130. However, it will be understood that the method 600 may be performed by any suitable device in accordance with various aspects of the present disclosure.

[0073] At 610, MMU 130 determines whether the virtual address specified in the received TLBI matches the virtual address used in one of the pending translations in the set of pending translations. If MMU 130 determines that the virtual addresses do not match ('No' at 610), then method 600 proceeds to 640. If MMU 130 determines that the virtual addresses do match ('Yes' at 610), then method 600 proceeds to 620.

[0074] At 620, the MMU 130 determines whether the ASID specified in the received TLBI matches the ASID used in the pending translation set. If the MMU 130 determines that the ASIDs do not match ('No' at 620), the method 600 proceeds to 640. If the MMU 130 determines that the ASIDs do match ('Yes' at 620), the method 600 proceeds to 630.

[0075] For a transformation with non-global attributes, a transformation only matches the received TLBI if the ASID specified in the TLBI matches the ASID of the pending transformation. For a transformation with global attributes, the ASID may not need to match. However, whether a transformation has global or non-global attributes may not be known until the transformation is almost complete (e.g., when a Translation Table Descriptor (TTD) is received).

[0076] According to aspects of the present disclosure, the attribute type may be determined based on the LEAF indicator. Figures 5 to 6 It is to be understood that, prior to the determination at 620, it is determined that the LEAF indicator specified in the TLBI is LEAF-0. According to aspects of the present disclosure, the attribute may be assumed to be non-global based on the determination that the LEAF indicator specified in the TLBI is LEAF-0. Therefore, since the attribute is assumed to be non-global, the ASID may be matched at 620 before proceeding to optional 630 and / or 650. Moreover, the ASID match may be performed before the TTD is received, thereby increasing the speed of the conversion.

[0077] At 630, MMU 130 optionally determines whether the one or more other values ​​specified in the TLBI match the corresponding one or more other values ​​used in the set of translations to be processed. If MMU 130 determines that the one or more other values ​​do not match ('No' at 630), then method 600 proceeds to 640. If MMU 130 determines that the one or more other values ​​do match ('Yes' at 630), then method 600 proceeds to 650. The one or more values ​​may include, for example, a VMID, a translation regime, a translation phase, other suitable fields, or any combination thereof.

[0078] It will be appreciated that if a match is not found in any of determinations 610, 620, and / or 630, then method 600 will proceed to 640. Also, if a match is found in each and every determination (610, 620, and 630 (if included)), then method 600 will proceed to 650.

[0079] At 640, MMU 130 determines that the pending translation is not affected by the received TLBI because one or more of the virtual address, ASID, and / or other values ​​specified in the TLBI do not match corresponding values ​​in any of the pending translation sets.

[0080] At 650, MMU 130 determines that the pending translation is affected by the received TLBI and completely restarts the entire translation. The determination that the pending translation is affected is based on determining that all of the virtual addresses, ASIDs, and / or optional other values ​​specified in the TLBI match corresponding values ​​associated with one or more pending translations.

[0081] Briefly return to Figure 4 It will be appreciated that the MMU 130 may determine a full restart transition at 456. It will also be appreciated that the Figures 5 to 6 The complete restart at 456 may be accomplished by method 500 and / or method 600 depicted in FIG.

[0082] Figure 7 Generally, a method 700 is illustrated, wherein Figure 5 The example implementation of determining whether to re-fetch 550 is depicted. Thus, method 700 (with Figure 5 The method 700 will be described below as it will be performed by the MMU 130. However, it will be understood that the method 700 may be performed by any suitable device in accordance with various aspects of the present disclosure.

[0083] At 710, MMU 130 determines whether both the virtual address and the ASID specified in the received TLBI match the virtual address and the ASID respectively associated with the pending translation in the pending translation set. If MMU 130 determines that both the specified virtual address and the ASID match the pending translation ('yes' at 710), method 700 proceeds to 712. If MMU 130 determines that the specified virtual address or the ASID does not match any pending translation ('no' at 710), method 700 proceeds to 720.

[0084] At 712, if the translation has a non-global attribute, then the MMU 130 determines that the translation is affected. This determination may be tracked using a LEAF affected if non-global flag (eg, may be set to 1 for a correct and may be set to 0 for an error).

[0085] As mentioned above, for a transition with non-global attributes, a transition only matches a received TLBI if the ASID specified in the TLBI matches the ASID of the transition to be processed. However, it may be necessary to wait until the TTD arrives to determine the attributes of the transition. As will be discussed in more detail below, if a transition is determined to be non-global when the TTD is received, then it may also be determined (based on the determination that the transition is non-global) that the transition is affected by the TLBI.

[0086] At 720, MMU 130 determines whether the virtual address specified in the received TLBI matches the virtual address of a pending translation associated with the pending translation set. If MMU 130 determines that the specified virtual address matches the pending translation ('yes' at 720), method 700 proceeds to 722. If MMU 130 determines that the specified virtual address and ASID do not match any pending translation ('no' at 720), method 700 proceeds to 730.

[0087] At 722, if the conversion has global attributes, the MMU 130 determines that the conversion is affected by the received TLBI. The LEAF affected flag if global can be used (e.g., it can be set to 1 for correct and can be set to 0 for error) to track this determination. As mentioned above, for conversions with global attributes, if the virtual address specified in the TLBI matches the virtual address of the pending conversion, the conversion can match the received TLBI, regardless of whether the ASID matches. However, as mentioned above, it may be necessary to wait until the TTD arrives to determine the attributes of the conversion. As will be discussed in more detail below, if when the TTD is received, it is determined that the conversion is global, then it can also be determined (based on the determination that the conversion is global) that the conversion is affected by the TLBI.

[0088] At 730, the MMU 130 determines that the translation is not affected. It will be appreciated that the determination at 730 may be based on the determination (in 710 and 720) that the specified virtual address does not match the pending translation. Because the pending translation is not affected by the TLBI, there is no need to restart the pending translation. Moreover, there is no need to determine whether the translation has global or non-global attributes, and therefore there is no reason to wait until a TTD is received.

[0089] At 740, the MMU 130 receives the TTD. As mentioned above, the TTD may be received when a translation is complete, and may specify whether the translation has global or non-global attributes.

[0090] At 750, the MMU 130 determines whether the last level of translation has been reached. This determination may be based on one or more fields in the TTD received at 740. If the MMU 130 determines that the last level of translation has been reached ('yes' at 750), then the method 700 may proceed to 760. If the MMU 130 determines that the last level of translation has not been reached ('no' at 750), then the method 700 may proceed to 790.

[0091] At 760, the MMU 130 determines whether the translation has global attributes. The determination may be based on one or more fields in the TTD received at 740. If the MMU 130 determines that the translation has global attributes ('yes' at 760), the method 700 may proceed to 762. If the MMU 130 determines that the translation has non-global attributes ('no' at 760), the method 700 may proceed to 764.

[0092] At 762, the MMU 130 determines whether the LEAF affected if non-global flag is set at 712. If the LEAF affected if non-global flag is set at 712 ('yes' at 762), the method 700 proceeds to 770. If the LEAF affected if non-global flag is not set at 712 ('no' at 762), the method 700 proceeds to 790.

[0093] At 764, the MMU 130 determines whether the if global then LEAF affected flag is set at 722. If the if global then LEAF affected flag is set at 722 ('yes' at 762), the method 700 proceeds to 770. If the if global then LEAF affected flag is not set at 722 ('no' at 762), the method 700 proceeds to 790.

[0094] At 770 , the MMU 130 determines that the TLBI matches the pending translation and determines to keep translated bits not associated with the last level of the translation, discards any translated bits associated with the last level of the translation, and refetches the last level of the translation.

[0095] At 790, MMU 130 determines that the TLBI does not match the pending translation. Therefore, the pending translation may be determined to be unaffected by the TLBI.

[0096] Figure 8 An exemplary electronic device 800 is generally illustrated in which one aspect of the present disclosure may be advantageously employed.

[0097] The electronic device 800 may be combined with Figure 1 The depicted system 100 is configured to perform Figure 4 The signaling system described is configured to perform Figure 5 The system of the method 500 is configured to perform Figure 6 The method 600 depicted herein and / or a system configured to perform Figure 7 The system of the method 700 is depicted. Figure 8 In the description of FIG. 8 , the electronic device 800 is shown to include a processor 810. The electronic device 800 may also include a cache 820. Figure 8 In the figure, a processor 810 is exemplarily shown, and the processor 810 is coupled to the memory 830 with a cache 820 between the processor 810 and the memory 830, but it is understood that the electronic device 800 may also support other memory configurations known in the art.

[0098] Figure 8 Also depicted is a display controller 840 coupled to the processor 810 and to a display 842.

[0066] In some cases, the electronic device 800 may be configured for wireless communications. Figure 8 Optional blocks are depicted in dashed lines, such as a coder / decoder (codec) 860 (e.g., an audio and / or voice codec) coupled to the processor 810. A speaker 862 and a microphone 864 may also be coupled to the codec 860. Also, a wireless antenna 852 may be coupled to a wireless controller 850, which is coupled to the processor 810. In the presence of one or more of these optional blocks, in certain aspects, the processor 810, display controller 840, memory 830, and wireless controller 850 are included in a system-in-package or system-on-chip device 870.

[0099] Thus, in certain aspects, input device 812 and power supply 872 are coupled to system-on-chip device 870. Also, in certain aspects, as Figure 8 As illustrated, where one or more optional blocks are present, the display 842, input device 812, speaker 862, microphone 864, wireless antenna 852, and power supply 872 are external to the system-on-chip device 870. However, each of the display 842, input device 812, speaker 862, microphone 864, wireless antenna 852, and power supply 872 can be coupled to a component, such as an interface or controller, of the system-on-chip device 870. In some embodiments, one or more components of the electronic device 800 can communicate with each other via a system bus.

[0100] It should be noted that although Figure 8A generic electronic device 800 is generally depicted, but one or more components of the electronic device 800 may additionally or alternatively be integrated into a set-top box, music player, video player, entertainment unit, navigation device, personal digital assistant (PDA), fixed location data unit, computer, laptop computer, tablet computer, communication device, mobile phone, or other similar device.

[0101] Those skilled in the art will appreciate that any of a variety of different technologies and techniques may be used to represent information and signals. For example, the data, instructions, commands, information, signals, bits, symbols, and chips that may be cited in the above entire description may be represented by voltage, current, electromagnetic waves, magnetic fields or particles, light fields or particles, or any combination thereof. Further, those skilled in the art will appreciate that the various illustrative logic blocks, modules, circuits, and algorithm steps described in conjunction with the various aspects disclosed herein may be implemented as electronic hardware, computer software, or a combination of the two. In order to clearly illustrate this interchangeability of hardware and software, various illustrative components, frames, modules, circuits, and steps have been generally described above in terms of their functionality. Whether this functionality is implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system. The technician may implement the described functionality in different ways for each specific application, but this implementation decision should not be interpreted as causing a departure from the scope of the present invention.

[0102] The methods, sequences and / or algorithms described in conjunction with the various aspects disclosed herein can be directly implemented in hardware, in a software module executed by a processor, or in a combination of the two. The software module can reside in a RAM memory, a flash memory, a ROM memory, an EPROM memory, an EEPROM memory, a register, a hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. An exemplary storage medium is coupled to the processor so that the processor can read information from the storage medium and write information to the storage medium. In an alternative, the storage medium may be essential for the processor.

[0103] Therefore, one aspect of the present invention may include a computer readable medium implementing a method for bus control. Therefore, the present invention is not limited to the illustrated examples, and any means for performing the functionality described herein are included in various aspects of the present invention.

[0104] In view of the above description and explanation, it will be appreciated by those skilled in the art that the various illustrative logic blocks, modules, circuits and algorithm steps described in conjunction with the various aspects disclosed herein can be implemented as electronic hardware, computer software or a combination of the two. In order to clearly illustrate this interchangeability of hardware and software, various illustrative components, frames, modules, circuits and steps have been generally described above in terms of their functionality. Whether this functionality is implemented as hardware or software depends on the specific application and the design constraints imposed on the overall system. The technician can implement the described functionality in different ways for each specific application, but this implementation decision should not be interpreted as causing a departure from the scope of the present disclosure.

[0105] Thus, it is to be understood that, for example, a device or any component of a device may be configured (or made operable or adapted) to provide the functionality taught herein. This may be accomplished, for example, by manufacturing (e.g., making) the device or component so that it will provide the functionality; by programming the device or component so that it will provide the functionality; or by using some other suitable implementation technique. As one example, an integrated circuit may be fabricated to provide the requisite functionality. As another example, an integrated circuit may be fabricated to support the requisite functionality and then configured (e.g., via programming) to provide the requisite functionality. As yet another example, a processor circuit may execute code to provide the requisite functionality.

[0106] Moreover, the methods, sequences and / or algorithms described in conjunction with the various aspects disclosed herein can be directly implemented in hardware, in a software module executed by a processor, or in a combination of the two. The software module can reside in a random access memory (RAM), a flash memory, a read-only memory (ROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), a register, a hard disk, a removable disk, a CD-ROM, or any other form of non-transitory storage medium known in the art. As used herein, the term "non-transitory" does not exclude any physical storage medium or memory, specifically does not exclude dynamic memory (such as RAM), but only excludes the interpretation that the medium can be interpreted as a temporary propagation signal. The example storage medium is coupled to the processor so that the processor can read information from the storage medium and can write information to the storage medium. In an alternative, the storage medium may be essential to the processor (such as a cache memory).

[0107] Although the foregoing disclosure shows various illustrative aspects, it should be noted that various changes and modifications may be made to the illustrated examples without departing from the scope defined by the appended claims. The present disclosure is not intended to be limited to the specific illustrated examples. For example, unless otherwise indicated, the functions, steps, and / or actions of the device claims according to the various aspects of the present disclosure described herein do not need to be performed in any particular order. In addition, although certain aspects may be described or claimed in singular form, plural forms are contemplated unless limitations on the singular form are explicitly set forth.

[0108] It will be understood that any reference to an element using names such as "first", "second" etc. herein does not generally limit the quantity or order of those elements. On the contrary, these names can be used as a convenient method to distinguish two or more elements or element instances in this article. Therefore, the reference to the first and second elements does not imply that there are only two elements, and does not imply that the first element must be before the second element in some way. And, unless otherwise stated, the element set may include one or more elements. In addition, the term of the form "at least one of A, B or C" or "one or more of A, B or C" or "at least one of the group comprising A, B and C" used in the description or claim means "A or B or C or any combination of these elements".

[0109] The terms used herein are only used to describe specific embodiments and are not intended to be any embodiments disclosed herein. As used herein, the singular forms "a", "an" and "the" are also intended to include the plural forms, unless the context clearly indicates otherwise. It will also be understood that when used herein, the terms "comprises", "comprising", "includes" and / or "including" specify the presence of the features, integers, steps, operations, elements and / or components illustrated, but do not exclude the presence or addition of one or more other functions, integers, steps, operations, elements, components and / or groups thereof. Similarly, the phrase "based on" used herein does not necessarily exclude the influence of other factors, and in all cases should be interpreted as "based at least in part on" rather than, for example, "based only on".

[0110] It will be understood that terms such as "top" and "bottom", "left" and "right", "vertical" and "horizontal", etc. are strictly relative terms used with respect to each other, and do not express or imply any relationship with respect to gravity, manufacturing equipment used to manufacture the components described herein, or some other equipment coupled, mounted, etc. to the components described herein. The term "exchange" may refer to the transfer of one or more data from one component to another. For example, with respect to a particular component, the exchange functionality may be constituted by the send functionality, the receive functionality, or any combination thereof.

Claims

1. A memory management unit MMU, configured to: receiving a translation request from a processing system, wherein the translation request specifies a virtual address to be translated; searching a page table stored in a physical memory system for a page table entry specifying the virtual address; receiving a translation lookaside buffer invalidate TLBI signal from the processing system, wherein the TLBI signal specifies the virtual address; In response to receiving the TLBI signal specifying the virtual address: invalidating a translation lookaside buffer (TLB) entry in a TLB, wherein the invalidated TLB entry specifies the virtual address; and restarting the search in the page table for the page table entry specifying the virtual address; and wherein the MMU is further configured to discard one or more translated bits associated with the translation of the virtual address, and to discard, the MMU is further configured to: selecting the one or more converted bits based on the LEAF indication; and The selected one or more converted bits are discarded.

2. The MMU of claim 1 , wherein the searching of the page table comprises: a search of at least one primary page table resulting in translation of at least one primary portion of a physical address; as well as A search of the secondary page table for translation of at least one secondary portion of the physical address has been initiated but not yet completed.

3. The MMU of claim 2, wherein: The TLBI signal specifies that LEAF-1 is inactive; For discarding, the MMU is further configured to discard any translated bits associated with the at least one secondary portion of the physical address; and To restart the search of the page table, the MMU is further configured to complete the translation of the at least one secondary portion of the physical address by refetching one or more bits from the secondary page table.

4. The MMU of claim 3, wherein to restart the search of the page table, the MMU is further configured to: maintaining the at least one preliminary portion of the physical address; and A complete translation of the virtual address is provided to the processing system, the virtual address including the at least one primary portion of the physical address and the at least one secondary portion of the physical address.

5. The MMU of claim 2, wherein: The TLBI signal specifies that LEAF-0 is invalid; To discard, the MMU is further configured to discard any translated bits associated with the search of the at least one primary page table and to discard any translated bits associated with the search of the secondary page table; and To restart the search of the page tables, the MMU is further configured to completely restart the search of the at least one primary page table and the search of the secondary page table.

6. The MMU of claim 1 , wherein: The TLBI signal further specifies whether the TLBI signal is LEAF-0 invalid or LEAF-1 invalid; and The MMU is also configured to: In response to a determination that the TLBI signal is LEAF-0 invalid and a determination that one or more of the virtual address and application space ID ASID specified in the TLBI signal matches the translation, completely restarting the entire translation; as well as In response to a determination that the TLBI signal is LEAF-1 invalid and a determination that one or more of the virtual address and the ASID specified in the TLBI signal matches the translation, a last stage of the translation is re-fetched.

7. The MMU of claim 6, wherein the MMU is further configured to: determining whether the virtual address and the ASID match the TLBI signal; responsive to a determination that both the virtual address and the ASID match the TLBI signal, setting a LEAF affected if not global flag; Receive translation table descriptor TTD; Based on the TTD, determining whether the transformation has a global attribute; and Responsive to a determination that the LEAF affected if non-global flag is set and a determination that the transformation does not have a global attribute, the last level of the transformation is re-fetched.

8. The MMU of claim 6, wherein the MMU is further configured to: determining whether the virtual address matches the TLBI signal; responsive to a determination that the virtual address matches the TLBI signal, setting a LEAF if global then affected flag; Receive translation table descriptor TTD; Based on the TTD, determining whether the transformation has a global attribute; and Responsive to a determination that the LEAF Affected If Global flag is set and a determination that the transformation has a global attribute, the last level of the transformation is re-fetched.

9. The MMU of claim 1, wherein the system is provided in a device selected from the group consisting of a set-top box, a music player, a video player, an entertainment unit, a navigation device, a personal digital assistant (PDA), a fixed location data unit, a computer, a laptop computer, a tablet computer, a communication device, and a mobile phone.

10. A method for managing a memory, comprising: At a memory management unit (MMU), receiving a translation request from a processing system, wherein the translation request specifies a virtual address to be translated; searching a page table stored in a physical memory system for a page table entry specifying the virtual address; receiving a translation lookaside buffer invalidate TLBI signal from the processing system, wherein the TLBI signal specifies the virtual address; In response to receiving the TLBI signal specifying the virtual address: invalidating a translation lookaside buffer (TLB) entry in a TLB, wherein the invalidated TLB entry specifies the virtual address; and restarting the search in the page table for the page table entry specifying the virtual address; as well as In response to receiving the TLBI signal specifying the virtual address, discarding one or more converted bits associated with the translation of the virtual address, wherein the discarding comprises: selecting the one or more converted bits based on the LEAF indication; as well as The selected one or more converted bits are discarded.

11. The method of claim 10, wherein the searching of the page table comprises: searching at least one primary page table resulting in a translation of at least one primary portion of a physical address; as well as A secondary page table is searched that has begun but not yet completed translation of at least one secondary portion of the physical address.

12. The method according to claim 11, wherein: The TLBI signal specifies that LEAF-1 is inactive; The discarding comprises discarding any converted bits associated with the at least one secondary portion of the physical address; and The restarting includes completing the translation of the at least one secondary portion of the physical address by refetching one or more bits from the secondary page table.

13. The method according to claim 12, wherein the restarting further comprises: maintaining said at least one preliminary portion of said physical address; as well as A complete translation of the virtual address is provided to the processing system, the virtual address including the at least one primary portion of the physical address and the at least one secondary portion of the physical address.

14. The method according to claim 11, wherein: The TLBI signal specifies that LEAF-0 is invalid; The discarding includes discarding any converted bits associated with the search of the at least one primary page table and discarding any converted bits associated with the search of the secondary page table; and The restarting includes completely restarting the searching of the at least one primary page table and the searching of the secondary page table.

15. The method of claim 10, wherein: The TLBI signal also specifies that the TLBI signal is LEAF-0 invalid or LEAF-1 invalid; as well as The method further comprises: In response to a determination that the TLBI signal is LEAF-0 invalid and a determination that one or more of the virtual address and application space ID ASID specified in the TLBI signal matches the translation, completely restarting the entire translation; as well as In response to a determination that the TLBI signal is LEAF-1 invalid and a determination that one or more of the virtual address and the ASID specified in the TLBI signal matches the translation, a last stage of the translation is re-fetched.

16. The method according to claim 15, further comprising: determining whether the virtual address and the ASID match the TLBI signal; responsive to a determination that both the virtual address and the ASID match the TLBI signal, setting a LEAF affected if not global flag; Receive translation table descriptor TTD; Based on the TTD, determining whether the transformation has a global attribute; and Responsive to a determination that the LEAF affected if non-global flag is set and a determination that the transformation does not have a global attribute, the last level of the transformation is re-fetched.

17. The method according to claim 15, further comprising: determining whether the virtual address matches the TLBI signal; responsive to a determination that the virtual address matches the TLBI signal, setting a LEAF if global then affected flag; Receive translation table descriptor TTD; Based on the TTD, determining whether the transformation has a global attribute; and Responsive to a determination that the LEAF Affected If Global flag is set and a determination that the transformation has a global attribute, the last level of the transformation is re-fetched.

18. The method of claim 10, wherein the method is implemented in a device selected from the group consisting of a set-top box, a music player, a video player, an entertainment unit, a navigation device, a personal digital assistant (PDA), a fixed location data unit, a computer, a laptop computer, a tablet computer, a communication device, and a mobile phone.

19. An apparatus for managing a memory, comprising: means for receiving a translation request from a processing system at a memory management unit (MMU), wherein the translation request specifies a virtual address to be translated; means for searching a page table stored in a physical memory system for a page table entry specifying the virtual address; means for receiving a translation lookaside buffer invalid TLBI signal from the processing system, wherein the TLBI signal specifies the virtual address; means for invalidating a translation lookaside buffer (TLB) entry in a TLB, wherein in response to receiving the TLBI signal specifying the virtual address, the invalidated TLB entry specifies the virtual address; means for restarting said searching of said page table entry in said page table in response to receiving said TLBI signal specifying said virtual address; as well as means for discarding one or more translated bits associated with the translation of the virtual address in response to receiving the TLBI signal specifying the virtual address, wherein the means for discarding comprises: means for selecting the one or more converted bits based on a LEAF indication; as well as Means for discarding selected ones of the one or more converted bits.

20. The apparatus of claim 19, wherein the means for searching the page table comprises: means for searching at least one primary page table resulting in translation of at least one primary portion of a physical address; as well as Means for searching the secondary page table for translation of at least one secondary portion of the physical address that has been initiated but not yet completed.

21. The apparatus of claim 20, wherein: The TLBI signal specifies that LEAF-1 is inactive; The means for discarding comprises means for discarding any translated bits associated with the at least one secondary portion of the physical address; and The means for restarting includes means for completing the translation of the at least one secondary portion of the physical address by refetching one or more bits from the secondary page table.

22. The apparatus of claim 21, wherein the means for restarting further comprises: means for holding said at least one primary portion of said physical address; as well as Means for providing a complete translation of the virtual address to the processing system, the virtual address comprising the at least one primary portion of the physical address and the at least one secondary portion of the physical address.

23. The apparatus of claim 20, wherein: The TLBI signal specifies that LEAF-0 is invalid; said means for discarding comprises means for discarding any translated bits associated with said search of said at least one primary page table and means for discarding any translated bits associated with said search of said secondary page table; and The means for restarting includes means for completely restarting the searching of the at least one primary page table and the searching of the secondary page table.

24. The apparatus of claim 19, wherein: The TLBI signal also specifies that the TLBI signal is LEAF-0 invalid or LEAF-1 invalid; as well as The device also includes: means for completely restarting the entire translation in response to a determination that the TLBI signal is LEAF-0 invalid and a determination that one or more of the virtual address and application space ID ASID specified in the TLBI signal matches the translation; as well as Means for re-fetching a last stage of a translation in response to a determination that the TLBI signal is LEAF-1 invalid and a determination that one or more of the virtual address and the ASID specified in the TLBI signal matches the translation.

25. The apparatus according to claim 24, further comprising: means for determining whether the virtual address and the ASID match the TLBI signal; means for setting a LEAF affected if not global flag in response to a determination that both the virtual address and the ASID match the TLBI signal; A component for receiving a translation table descriptor TTD; means for determining whether the transformation has a global attribute based on the TTD; as well as Means for re-fetching the last level of the transformation in response to a determination that the LEAF affected if non-global flag is set and a determination that the transformation does not have a global attribute.

26. The apparatus of claim 24, further comprising: means for determining whether the virtual address matches the TLBI signal; means for setting a LEAF if global affected flag in response to a determination that the virtual address matches the TLBI signal; A component for receiving a translation table descriptor TTD; means for determining whether the transformation has a global attribute based on the TTD; as well as Means for re-fetching the last level of the transformation in response to a determination that the LEAF if global flag is set and a determination that the transformation has a global attribute.

27. The apparatus of claim 19, wherein the apparatus is provided in a device selected from the group consisting of a set-top box, a music player, a video player, an entertainment unit, a navigation device, a personal digital assistant (PDA), a fixed location data unit, a computer, a laptop computer, a tablet computer, a communication device, and a mobile phone.

Citation Information

Patent Citations

  • Translation of virtual addresses to physical addresses

    US20190332550A1

  • Detection of conflicts between transactions and page shootdowns

    US20140075151A1

  • Instruction cache translation management

    US20160140042A1