Home > Articles > Operating Systems, Server > Microsoft Servers

Macros and Constants

The definitions in Listing 4-5 are supplements to the structures in Listings 4-2 to 4-4 and make the work with i386 memory management easier. They can be subdivided into three main groups. The first group handles linear addresses:

  1. X86_PAGE_MASK, X86_PDI_MASK, and X86_PTI_MASK are bit masks that isolate the constituent parts of linear addresses. They are based on the constants PAGE_SHIFT (12), PDI-SHIFT (22), and PTI-SHIFT (12), defined in the Windows 2000 DDK header file ntddk.h. X86_PAGE_MASK evaluates to 0xFFFFF000, effectively masking off the 4-KB offset part of a linear address (cf. X86_LINEAR_4K). X86_PDI_MASK is equal to 0xFFC00000 and obviously extracts the 10 topmost PDI bits of a linear address (cf. X86_LINEAR_4M and X86_LINEAR_4K). X86_PTI_MASK evaluates to 0x003FF0000 and masks off all bits except for the page-table index (PTI) bits of a linear address (cf. X86_LINEAR_4K).

  2. Listing 4-4. i386 Linear Addresses

    // =================================================================
    // =================================================================
    typedef struct _X86_LINEAR_4M // linear address (4-MB page)
                PVOID pAddress;       // packed address
                unsigned Offset : 22; // offset into page
                unsigned PDI    : 10; // page-directory index
        X86_LINEAR_4M, *PX86_LINEAR_4M, **PPX86_LINEAR_4M;
    #define X86_LINEAR_4M_ sizeof (X86_LINEAR_4M)
    // -----------------------------------------------------------------
    typedef struct _X86_LINEAR_4K // linear address (4-KB page)
                PVOID pAddress;       // packed address
                unsigned Offset : 12; // offset into page
                unsigned PTI    : 10; // page-table index
                unsigned PDI    : 10; // page-directory index
        X86_LINEAR_4K, *PX86_LINEAR_4K, **PPX86_LINEAR_4K;
    #define X86_LINEAR_4K_ sizeof (X86_LINEAR_4K)
    // -----------------------------------------------------------------
    typedef struct _X86_LINEAR // general linear address
            {        PVOID         pAddress; // packed address
            X86_LINEAR_4M linear4M; // linear address (4-MB page)
            X86_LINEAR_4K linear4K; // linear address (4-KB page)
        X86_LINEAR, *PX86_LINEAR, **PPX86_LINEAR;
    #define X86_LINEAR_ sizeof (X86_LINEAR)
    // =================================================================
  3. X86_PAGE(), X86_PDI(), and X86_PTI() use the above constants to compute the page index, PDI, or PTI of a given linear address. X86_PAGE() is typically used to read a PTE from the Windows 2000 PTE array starting at address 0xC0000000. X86_PDI() and X86_PTI() simply apply X86_PDI_MASK or X86_PTI_ MASK to the supplied pointer and shift the resulting index to the rightmost bit position.

  4. X86_OFFSET_4M() and X86_OFFSET_4K() extract the offset portion of a 4-MB or 4-KB linear address, respectively.

  5. X86_PAGE_4M and X86_PAGE_4K compute the sizes of 4-MB and 4-KB pages from the DDK constants PDI_SHIFT and PTI_SHIFT, resulting in X86_PAGE_4M = 4,194,304 and X86_PAGE_4K = 4,096. Note that X86_PAGE_4K is equivalent to the DDK constant PAGE_SIZE, also defined in ntddk.h.

  6. X86_PAGES_4M and X86_PAGES_4K state the number of 4-MB or 4-KB pages fitting into the 4-GB linear address space. X86_PAGES_4M evaluates to 1,024, and X86_PAGES_4K to 1,048,576.

The second group of macros and constants relates to the Windows 2000 PDE and PTE arrays. Unlike several other system addresses, the base addresses of these arrays are not available as global variables set up at boot time, but are defined as constants. This can be proved easily by disassembling the memory manager API functions MmGetPhysicalAddress() or MmIsAddressValid(), where these addresses appear as "magic numbers." These constants are not included in the DDK header files, but Listing 4-5 shows how they might have been defined.

  • X86_PAGES is a hard-coded address and points, of course, to 0xC0000000, where the Windows 2000 PTE array starts.

  • X86_PTE_ARRAY is equal to X86_PAGES, but typecasts the value to PX86_PE, that is, a pointer to an array of X86_PE page entry structures, as defined in Listing 4-2.

  • X86_PDE_ARRAY is a tricky definition that computes the base address of the PDE array from the PTE array location, using the PTI_SHIFT constant. As explained earlier, the general formula for mapping a linear address to a PTE address is ((LinearAddress >> 12) * 4) + 0xC0000000, and the page-directory is located by setting LinearAddress to 0xC0000000. Nothing else is done by the definition of X86_PDE_ARRAY.

Listing 4-5. Additional i386 Memory Management Definitions

// =================================================================
// =================================================================

#define X86_PAGE_MASK (0 - (1 << PAGE_SHIFT))
#define X86_PAGE(_p)  (((DWORD) (_p) & X86_PAGE_MASK) >> PAGE_SHIFT)

#define X86_PDI_MASK  (0 - (1 << PDI_SHIFT))
#define X86_PDI(_p)   (((DWORD) (_p) & X86_PDI_MASK) >> PDI_SHIFT)

#define X86_PTI_MASK  ((0 - (1 << PTI_SHIFT)) & ~X86_PDI_MASK)
#define X86_PTI(_p)   (((DWORD) (_p) & X86_PTI_MASK) >> PTI_SHIFT)

#define X86_OFFSET_4M(_p) ((_p) & ~(X86_PDI_MASK               ))
#define X86_OFFSET_4K(_p) ((_p) & ~(X86_PDI_MASK | X86_PTI_MASK))

#define X86_PAGE_4M   (1 << PDI_SHIFT)
#define X86_PAGE_4K   (1 << PTI_SHIFT)

#define X86_PAGES_4M  (1 << (32 - PDI_SHIFT))
#define X86_PAGES_4K  (1 << (32 - PTI_SHIFT))

// -----------------------------------------------------------------

#define X86_PAGES         0xC0000000
#define X86_PTE_ARRAY     ((PX86_PE) X86_PAGES)
#define X86_PDE_ARRAY     (X86_PTE_ARRAY + (X86_PAGES >> PTI_SHIFT))

// -----------------------------------------------------------------

#define X86_SELECTOR_RPL            0x0003
#define X86_SELECTOR_TI             0x0004
#define X86_SELECTOR_INDEX          0xFFF8
#define X86_SELECTOR_SHIFT          3

#define X86_SELECTOR_LIMIT          (X86_SELECTOR_INDEX >> \

// -----------------------------------------------------------------

#define X86_DESCRIPTOR_SYS_TSS16A       0x1
#define X86_DESCRIPTOR_SYS_LDT          0x2
#define X86_DESCRIPTOR_SYS_TSS16B       0x3
#define X86_DESCRIPTOR_SYS_CALL16       0x4
#define X86_DESCRIPTOR_SYS_TASK         0x5
#define X86_DESCRIPTOR_SYS_INT16        0x6
#define X86_DESCRIPTOR_SYS_TRAP16       0x7
#define X86_DESCRIPTOR_SYS_TSS32A       0x9
#define X86_DESCRIPTOR_SYS_TSS32B       0xB
#define X86_DESCRIPTOR_SYS_CALL32       0xC
#define X86_DESCRIPTOR_SYS_INT32        0xE
#define X86_DESCRIPTOR_SYS_TRAP32       0xF

// -----------------------------------------------------------------

#define X86_DESCRIPTOR_APP_CODE         0x8

// =================================================================

The last two sections of Listing 4-5 handle selectors and special types of descriptors, and are complementary to Listing 4-2:

  • X86_SELECTOR_RPL, X86_SELECTOR_TI, and X86_SELECTOR_INDEX are bit masks corresponding to the RPL, TI, and Index members of the X86_SELECTOR structures defined in Listing 4-2.

  • X86_SELECTOR_SHIFT is a right-shift factor that right-aligns the value of the selector's Index member.

  • X86_SELECTOR_LIMIT defines the maximum index value a selector can hold and is equal to 8,191. This value determines the maximum size of a descriptor table. Each selector index points to a descriptor, and each descriptor consists of 64 bits or 8 bytes (cf. X86_DESCRIPTOR in Listing 4-2), so the maximum descriptor table size amounts to 8,192 * 8 = 64 KB.

  • The list of X86_DESCRIPTOR_SYS_* constants define values of a descriptor's Type member if its S-bit is zero, identifying it as a system descriptor. Please refer to Listing 4-2 for the bit-field layout of a descriptor, determined by the structure X86_DESCRIPTOR. The system descriptor types are described in detail in the Intel manuals (Intel 1999c, pp. 3-15f) and summarized in Table 4-1.

The X86_DESCRIPTOR_APP_* constants concluding Listing 4-5 apply to a descriptor's Type member if it is an application descriptor referring to a code or data segment, identified by a nonzero S-bit. Because application descriptor types can be characterized by independent properties reflected by the four type bits, the X86_DESCRIPTOR_APP_* constants are defined as single-bit masks, in which some bits are interpreted differently for data and code segments:

  • X86_DESCRIPTOR_APP_ACCESSED is set if the segment has been accessed.

  • X86_DESCRIPTOR_APP_READ_WRITE decides whether a data segment allows read-only or read/write access.

  • X86_DESCRIPTOR_APP_EXECUTE_READ decides whether a code segment allows execute-only or execute/read access.

  • X86_DESCRIPTOR_APP_DOWN is set for expand-down data segments, which is a property commonly exposed by stack segments.

  • X86_DESCRIPTOR_APP_CONFORMING indicates whether a code segment is conforming, that is, whether it can be called by less privileged code (cf. Intel 1999c, pp. 4-13ff).

  • X86_DESCRIPTOR_APP_CODE distinguishes code and data segments. Note that stack segments belong to the data segment category and must always be writable.

We will revisit system descriptors later when the memory spy application presented in the next sections is up and running. Table 4-1 also concludes a short introduction to i386 memory management. For more information on this topic, please refer to the original Intel Pentium manuals (Intel 1999a, 1999b, 1999c) or one of the secondary readings, such as Robert L. Hummel's great 80486 reference handbook (Hummel 1992).

Table 4-1. System Descriptor Types






16-bit Task State Segment (Available)



Local Descriptor Table



16-bit Task State Segment (Busy)



16-bit Call Gate



Task Gate



16-bit Interrupt Gate



16-bit Trap Gate



32-bit Task State Segment (Available)



32-bit Task State Segment (Busy)



32-bit Call Gate



32-bit Interrupt Gate



32-bit Trap Gate

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information

To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.


Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.


If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information

Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information

If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information

Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents

California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure

Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact

Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice

We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020