C++ ojbect model alternatives

Claim 2

A computer implemented method of modeling C++ objects in an implementation of the C++ programming language in which a class in the C++ language may inherit another class, an inherited class being known as a base class and an inheriting class being known as a derived class, a class hierarchy graph, , for a C++ language program being defined as a tuple <N,E> where N is a set of nodes representing classes in the program and E is a set of directed edges representing inheritance relationships between the classes, a nonvirtual path from class B to class D is a path in from the node labeled B to the node labeled D such that there is no virtual inheritance edge along this path, a nonvirtual region for a class D is the set of classes such that for each class B in this set, there is a nonvirtual path in from B to D, a class V is a direct, virtual base of a class D if and only if there is an edge labeled virtual in from V to D, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a class V being a virtual base of a class D if there is a virtual path in from V to D, a virtual region for the class D being a set of classes such that for each class V in the set, there is a virtual path in from V to D, said computer implemented method comprising the steps of: laying out a virtual function table (VFT) in computer memory having a number of entries, said virtual function table entry having at least a function address and supporting a virtual dispatch mechanism; laying out an object in computer memory to include as components of the object all base class subobjects of the object, data members defined in the class, and a VFT pointer to the VFT for implementing the virtual dispatch mechanism required for virtual functions; laying out virtual base pointers in computer memory to access virtual base subobjects; sharing with a derived class D a VFT pointer of a direct, virtual base class V only when the virtual base class V has a fixed part of its object that contains only a VFT pointer; and sharing with a derived class D a VFT pointer of a direct, virtual base class V only when the virtual base class V has a fixed part of its object that contains both a VFT pointer and other data and the derived class D has a fixed part of its object that only contains the VFT pointer.

Claim 3

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 1 further comprising the step of storing said virtual base pointers in said VFT as offsets to said virtual base subobjects.

Claim 4

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 1 wherein a class C shares virtual base pointers with those base classes that share their VFT pointer with class C.

Claim 5

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 1 wherein a VFT entry contains only an address of the function when no late cast is required.

Claim 6

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 1 wherein a VFT entry contains only an address of a code performing a late cast's adjustment when a late cast is required.

Claim 7

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 1 wherein a VFT for a class contains entries for all virtual functions that are visible at the class.

Claim 8

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 1 wherein when a fully derived object of class D, with static type S, is pointed to by p in a virtual function call p→ƒ( ), and the actual function invoked is ƒ defined in class E, denoted by E::ƒ( ), an early cast is an adjustment of a THIS pointer to a subobject, X, in the D object whose VFT contains the entry that has an address of E::ƒ( ), a late cast is an adjustment of the THIS pointer to point to an E subobject if the E and X subobjects are at different locations within the D object, a class C is defined as an introducing class of a virtual function ƒ, the class C declaring the virtual function ƒ and no base class of C in declaring ƒ, and the VFT contains entries for all virtual functions introduced in a class T and for all virtual functions introduced in the virtual region of the class T, thereby eliminating a need for an early virtual cast.

Claim 9

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 1 wherein when a fully derived object of class D, with static type S, is pointed to by p in a virtual function call p→ƒ( ), and the actual function invoked is ƒ defined in class E, denoted by E::ƒ( ), an early cast is an adjustment of a THIS pointer to a subobject, X, in the D object whose VFT contains the entry that has an address of E::ƒ( ), a late cast is an adjustment of the THIS pointer to point to an E subobject if the E and X subobjects are at different locations within the D object, a class C is defined as an introducing class of a virtual function ƒ, the class C declaring the virtual function ƒ and no base class of C in declaring ƒ, the VFT contains entries for all virtual functions introduced in a class T, and if there is a direct virtual base V of the class D which is not a direct virtual base of any base class of the class D, then the class D's VFT contains an entry for all virtual functions introduced in the nonvirtual region of the class V, thereby eliminating a need for an early virtual cast.

Claim 10

A computer implemented method of modeling C++ objects in an implementation of the C++ programming language in which a class in the C++ language may inherit another class, an inherited class being known as a base class and an inheriting class being known as a derived class, a class hierarchy graph, , for a C++ language program being defined as a tuple <N,E> where N is a set of nodes representing classes in the program and E is a set of directed edges representing inheritance relationships between the classes, a nonvirtual path from class B to class D is a path in from the node labeled B to the node labeled D such that there is no virtual inheritance edge along this path, a nonvirtual region for a class D is the set of classes such that for each class B in this set, there is a nonvirtual path in from B to D, a class V is a direct, virtual base of a class D if and only if there is an edge labeled virtual in from V to D, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a class V being a virtual base of a class D if there is a virtual path in from V to D, a virtual region for the class D being a set of classes such that for each class V in the set, there is a virtual path in from V to D, said computer implemented method comprising the steps of: laying out a virtual function table (VFT) in computer memory having a number of entries, said virtual function table entry having at least a function address and supporting a virtual dispatch mechanism; laying out an object in computer memory to include as components of the object all base class subobjects of the object, data members defined in the class, and a VFT pointer to the VFT for implementing the virtual dispatch mechanism required for virtual functions; laying out virtual base pointers in computer memory to access virtual base subobjects; sharing with a derived class D a VFT pointer and at least one virtual base pointer of a direct, virtual base class V only when the virtual base class V has a fixed part of its object that contains only both a VFT pointer and at least one virtual base pointer.

Claim 11

A computer implemented method of modeling C++ objects in an implementation of the C++ programming language in which a class in the C++ language may inherit another class, an inherited class being known as a base class and an inheriting class being known as a derived class, a class hierarchy graph, , for a C++ language program being defined as a tuple <N,E> where N is a set of nodes representing classes in the program and E is a set of directed edges representing inheritance relationships between the classes, a nonvirtual path from class B to class D is a path in from the node labeled B to the node labeled D such that there is no virtual inheritance edge along this path, a nonvirtual region for a class D is the set of classes such that for each class B in this set, there is a nonvirtual path in from B to D, a class V is a direct, virtual base of a class D if and only if there is an edge labeled virtual in from V to D, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a class V being a virtual base of a class D if there is a virtual path in from V to D, a virtual region for the class D being a set of classes such that for each class V in the set, there is a virtual path in from V to D, said computer implemented method comprising the steps of: laying out a virtual function table (VFT) in computer memory having a number of entries, said virtual function table entry having at least a function address and supporting a virtual dispatch mechanism; laying out an object in computer memory to include as components of the object all base class subobjects of the object, data members defined in the class, and a VFT pointer to the VFT for implementing the virtual dispatch mechanism required for virtual functions; laying out virtual base pointers in computer memory to access virtual base subobjects; sharing with a derived class D a VFT pointer and at least one virtual base pointer of a direct, virtual base class V only when the virtual base class V has a fixed part of its object that contains only both a VFT pointer and at least one virtual base pointer.

Claim 12

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 9 further comprising the step of storing said virtual base pointers in said object as offsets to said virtual base subobjects.

Claim 13

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 9 wherein a class C shares virtual base pointers with those base classes that share their VFT pointer with class C.

Claim 14

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 9 wherein a VFT entry contains only an address of the function when no late cast is required.

Claim 15

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 9 wherein a VFT entry contains only an address of a code performing a late cast's adjustment when a late cast is required.

Claim 16

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 9 wherein a VFT for a class contains entries for all virtual functions that are visible at the class.

Claim 17

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 9 wherein when a fully derived object of class D, with static type S, is pointed to by p in a virtual function call p→ƒ( ), and the actual function invoked is ƒ defined in class E, denoted by E::ƒ( ), an early cast is an adjustment of a THIS pointer to a subobject, X, in the D object whose VFT contains the entry that has an address of E::ƒ( ), a late cast is an adjustment of the THIS pointer to point to an E subobject if the E and X subobjects are at different locations within the D object, a class C is defined as an introducing class of a virtual functions ƒ, the class C declaring the virtual function ƒ and no base class of C in declaring ƒ, and the VFT contains entries for all virtual functions introduced in a class T and for all virtual functions introduced in the virtual region of the class T, thereby eliminating a need for an early virtual cast.

Claim 18

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 9 wherein when a fully derived object of class D, with static type S, is pointed to by p in a virtual function call p→ƒ( ), and the actual function invoked is ƒ defined in class E, denoted by E::ƒ( ), an early cast is an adjustment of a THIS pointer to a subobject, X, in the D object whose VFT contains the entry that has an address of E:ƒ( ), a late cast is an adjustment of the THIS pointer to point to an E subobject if the E and X subobjects are at different locations within the D object, a class C is defined as an introducing class of a virtual function ƒ, the class C declaring the virtual function ƒ and no base class of C in declaring ƒ, the VFT contains entries for all virtual functions introduced in a class T, and if there is a direct virtual base V of the class D which is not a direct virtual base of any base class of the class D, then the class D's VFT contains an entry for all virtual functions introduced in the nonvirtual region of the class V, thereby eliminating a need for an early virtual cast.

Claim 19

A computer implemented method of modeling C++ objects in an implementation of the C++ programming language in which a class in the C++ language may inherit another class, an inherited class being known as a base class and an inheriting class being known as a derived class, a class hierarchy graph, , for a C++ language program being defined as a tuple <N,E> where N is a set of nodes representing classes in the program and E is a set of directed edges representing inheritance relationships between the classes, a nonvirtual path from class B to class D is a path in from the node labeled B to the node labeled D such that there is no virtual inheritance edge along this path, a nonvirtual region for a class D is the set of classes such that for each class B in this set, there is a nonvirtual path in from B to D, a class V is a direct, virtual base of a class D if and only if there is an edge labeled virtual in from V to D, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a class V being a virtual base of a class D if there is a virtual path in from V to D, a virtual region for the class D being a set of classes such that for each class V in the set, there is a virtual path in from V to D, said computer implemented method comprising the steps of: laying out a virtual function table (VFT) in computer memory having a number of entries, said virtual function table entry having at least a function address and supporting a virtual dispatch mechanism; laying out an object in computer memory to include as components of the object all base class subobjects of the object, data members defined in the class, and a VFT pointer to the VFT for implementing the virtual dispatch mechanism required for virtual functions; laying out virtual base pointers in computer memory to access virtual base subobjects; sharing with a derived class D at least one virtual base pointer of a direct, virtual base class V only when the virtual base class V has a fixed part of its object that contains only at least one virtual base pointer; and sharing with a derived class D at least one virtual base pointer of a direct, virtual base class V only when the virtual base class V has a fixed part of its object that contains both at least one virtual base pointer and other data and the derived class D has a fixed part of its object that only contains the at least one virtual base pointer.

Claim 20

A computer implemented method of modeling C++ objects in an implementation of the C++ programming language in which a class in the C++ language may inherit another class, an inherited class being known as a base class and an inheriting class being known as a derived class, a class hierarchy graph, , for a C++ language program being defined as a tuple <N,E> where N is a set of nodes representing classes in the program and E is a set of directed edges representing inheritance relationships between the classes, a nonvirtual path from class B to class D is a path in from the node labeled B to the node labeled D such that there is no virtual inheritance edge along this path, a nonvirtual region for a class D is the set of classes such that for each class B in this set, there is a nonvirtual path in from B to D, a class V is a direct, virtual base of a class D if and only if there is an edge labeled virtual in from V to D, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a class V being a virtual base of a class D if there is a virtual path in from V to D, a virtual region for the class D being a set of classes such that for each class V in the set, there is a virtual path in from V to D, said computer implemented method comprising the steps of: laying out a virtual function table (VFT) in computer memory having a number of entries, said virtual function table entry having at least a function address and supporting a virtual dispatch mechanism; laying out an object in computer memory to include as components of the object all base class subobjects of the object, data members defined in the class, and a VFT pointer to the VFT for implementing the virtual dispatch mechanism required for virtual functions; laying out virtual base pointers in computer memory to access virtual base subobjects; sharing with a derived class D at least one virtual base pointer of a direct, virtual base class V only when the virtual base class V has a fixed part of its object that contains only at least one virtual base pointer; and sharing with a derived class D at least one virtual base pointer of a direct, virtual base class V only when the virtual base class V has a fixed part of its object that contains both at least one virtual base pointer and other data and the derived class D has a fixed part of its object that only contains the at least one virtual base pointer.

Claim 21

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 17 further comprising the step of storing said virtual base pointers in said object as offsets to said virtual base subobjects.

Claim 22

A computer implemented method of modeling C++ objects in an implementation of the C++ programming language in which a class in the C++ programming language may inherit another class, an inherited class being known as a base class and an inheriting class being known as a derived class, a class hierarchy graph, , for a C++ language program being defined as a tuple <N,E> where N is a set of nodes representing classes in the program and E is a set of directed edges representing inheritance relationships between the classes, a nonvirtual path from class B to class D is a path in from the node labeled B to the node labeled D such that there is no virtual inheritance edge along this path, a nonvirtual region for a class D is the set of classes such that for each class B in this set, there is a nonvirtual path in from B to D, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a class V being a virtual base of a class D if there is a virtual path in from V to D, a virtual region for the class D being a set of classes such that for each class V in the set, there is a virtual path in (from V to D, said computer implemented method comprising the steps of: laying out a virtual function table (VFT) in computer memory having a number of entries, said VFT entries having at least a function address and supporting a virtual dispatch mechanism; laying out an object in computer memory to include as components of the object all base class subobjects of the object, data members defined in the class, and a VFT pointer to the VFT for implementing the virtual dispatch mechanism required for virtual functions; and laying out virtual base pointers in computer memory to access virtual base subobjects, wherein when a fully derived object of class D, with static type S, is pointed to by p in a virtual function call p →ƒ( ), and the actual function invoked is ƒ defined in class E, denoted by E::ƒ( ), an early cast is an adjustment of a THIS pointer to a subobject, X, in the D object whose VFT contains the entry that has an address of E::ƒ( ), a late cast is an adjustment of the THIS pointer to point to an E subobject if the E and X subobjects are at different locations within the D object, a class C is defined as an introducing class of a virtual function ƒ, the class C declaring the virtual function ƒ and no base class of C in declaring ƒ, the VFT contains entries for all virtual functions introduced in a class T and for all virtual functions introduced in the virtual region of the class T, thereby eliminating a need for an early virtual cast.

Claim 23

A computer implemented method of modeling C++ objects in an implementation of the C++ programming language in which a class in the C++ programming language may inherit another class, an inherited class being known as a base class and an inheriting class being known as a derived class, a class hierarchy graph, , for a C++ language program being defined as a tuple <N,E> where N is a set of nodes representing classes in the program and E is a set of directed edges representing inheritance relationships between the classes, a nonvirtual path from class B to class D is a path in from the node labeled B to the node labeled D such that there is no virtual inheritance edge along this path, a nonvirtual region for a class D is the set of classes such that for each class B in this set, there is a nonvirtual path in from B to D, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a class V being a virtual base of a class D if there is a virtual path in from V to D, a virtual region for the class D being a set of classes such that for each class V in the set, there is a virtual path in (from V to D, said computer implemented method comprising the steps of: laying out a virtual function table (VFT) in computer memory having a number of entries, said VFT entries having at least a function address and supporting a virtual dispatch mechanism; laying out an object in computer memory to include as components of the object all base class subobjects of the object, data members defined in the class, and a VFT pointer to the VFT for implementing the virtual dispatch mechanism required for virtual functions; and laying out virtual base pointers in computer memory to access virtual base subobjects, wherein when a fully derived object of class D, with static type S, is pointed to by p in a virtual function call p →ƒ( ), and the actual function invoked is ƒ defined in class E, denoted by E::ƒ( ), an early cast is an adjustment of a THIS pointer to a subobject, X, in the D object whose VFT contains the entry that has an address of E::ƒ( ), a late cast is an adjustment of the THIS pointer to point to an E subobject if the E and X subobjects are at different locations within the D object, a class C is defined as an introducing class of a virtual function ƒ, the class C declaring the virtual function ƒ and no base class of C in declaring ƒ, the VFT contains entries for all virtual functions introduced in a class T and for all virtual functions introduced in the virtual region of the class T, thereby eliminating a need for an early virtual cast.

Claim 24

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 19 further comprising the step of storing said virtual base pointers in said VFT as offsets to virtual base subobjects.

Claim 25

A computer implemented method of modeling C++ objects in an implementation of the C++ programming language in which a class in the C++ language may inherit another class, an inherited class being known as a base class and an inheriting class being known as a derived class, a class hierarchy graph, , for a C++ language program being defined as a tuple <N,E> where N is a set of nodes representing classes in the program and E is a set of directed edges representing inheritance relationships between the classes, a nonvirtual path from class B to class D is a path in from the node labeled B to the node labeled D such that there is no virtual inheritance edge along this path, a nonvirtual region for a class D is the set of classes such that for each class B in this set, there is a nonvirtual path in from B to D, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a class V being a virtual base of a class D if there is a virtual path in from V to D, a class V being a virtual base of a class D if there is a virtual path in from V to D, a virtual region for the class D being a set of classes such that for each class V in the set, there is a virtual path in from V to D, said computer implemented method comprising the steps of: laying out a virtual function table (VFT) in computer memory having a number of entries, said VFT entries having at least a function address and supporting a virtual dispatch mechanism; laying out an object in computer memory to include as components of the object all base class subobjects of the object, data members defined in the class, and a VFT pointer to the VFT for implementing the virtual dispatch mechanism required for virtual functions; and laying out virtual base pointers in computer memory to access virtual base subobjects, wherein when a fully derived object of class D, with static type S, is pointed to by p in a virtual function call p→ƒ( ), and the actual function invoked is ƒ defined in class E, denoted by E::ƒ( ), an early cast is an adjustment of a THIS pointer to a subobject, X, in the D object whose VFT contains the entry that has an address of E::ƒ( ), a late cast is an adjustment of the THIS pointer to point to an E subobject if the E and X subobjects are at different locations within the D object, a class C is defined as an introducing class of a virtual function ƒ, the class C declaring the virtual function ƒ and no base class of C in declaring ƒ, the VFT contains entries for all virtual functions introduced in a class T, and if there is a direct virtual base V of the class D which is not a direct virtual base of any base class of the class D, then the class D's VFT contains an entry for all virtual functions introduced in the nonvirtual region of the class V, thereby eliminating a need for an early virtual cast.

Claim 26

A computer implemented method of modeling C++ objects in an implementation of the C++ programming language in which a class in the C++ language may inherit another class, an inherited class being known as a base class and an inheriting class being known as a derived class, a class hierarchy graph, , for a C++ language program being defined as a tuple <N,E> where N is a set of nodes representing classes in the program and E is a set of directed edges representing inheritance relationships between the classes, a nonvirtual path from class B to class D is a path in from the node labeled B to the node labeled D such that there is no virtual inheritance edge along this path, a nonvirtual region for a class D is the set of classes such that for each class B in this set, there is a nonvirtual path in from B to D, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a class V being a virtual base of a class D if there is a virtual path in from V to D, a class V being a virtual base of a class D if there is a virtual path in from V to D, a virtual region for the class D being a set of classes such that for each class V in the set, there is a virtual path in from V to D, said computer implemented method comprising the steps of: laying out a virtual function table (VFT) in computer memory having a number of entries, said VFT entries having at least a function address and supporting a virtual dispatch mechanism; laying out an object in computer memory to include as components of the object all base class subobjects of the object, data members defined in the class, and a VFT pointer to the VFT for implementing the virtual dispatch mechanism required for virtual functions; and laying out virtual base pointers in computer memory to access virtual base subobjects, wherein when a fully derived object of class D, with static type S, is pointed to by p in a virtual function call p→ƒ( ), and the actual function invoked is ƒ defined in class E, denoted by E::ƒ( ), an early cast is an adjustment of a THIS pointer to a subobject, X, in the D object whose VFT contains the entry that has an address of E::ƒ( ), a late cast is an adjustment of the THIS pointer to point to an E subobject if the E and X subobjects are at different locations within the D object, a class C is defined as an introducing class of a virtual function ƒ, the class C declaring the virtual function ƒ and no base class of C in declaring ƒ, the VFT contains entries for all virtual functions introduced in a class T, and if there is a direct virtual base V of the class D which is not a direct virtual base of any base class of the class D, then the class D's VFT contains an entry for all virtual functions introduced in the nonvirtual region of the class V, thereby eliminating a need for an early virtual cast.

Claim 27

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 21 further comprising the step of storing said virtual base pointers in said VFT as offsets to virtual base subobjects.

Claim 28

A computer implemented method of modeling C++ objects in an implementation of the C++ programming language in which a class in the C++ language may inherit another class, an inherited class being known as a base class and an inheriting class being known as a derived class, a class hierarchy graph, , for an C++ language program being defined as a tuple <N,E> where N is a set of nodes representing classes in the program and E is a set of directed edges representing inheritance relationships between the classes, a nonvirtual path from class B to class D is a path in from the node labeled B to the node labeled D such that there is no virtual inheritance edge along this path, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a nonvirtual region for a class D is the set of classes such that for each class B in this set, there is a nonvirtual path in from B to D, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a class V being a virtual base of a class D if there is a virtual path in from V to D, a virtual region for the class D being a set of classes such that for each class V in the set, there is a virtual path in from V to D, wherein when a fully derived object of class D, with static type S, is pointed to by p in a virtual function call p→ƒ( ), and the actual function invoked is ƒ defined in class E, denoted by E::ƒ( ), an early cast is an adjustment of a THIS pointer to a subobject, X, in the D object whose VFT contains the entry that has an address of E::ƒ( ), a late cast is an adjustment of the THIS pointer to point to an E subobject if the E and X subobjects are at different locations within the D object, said computer implemented method comprising the steps of: laying out a virtual function table (VFT) in computer memory having a number of entries, said VFT table entries having at least a function address and supporting a virtual dispatch mechanism; laying out an object model in computer memory to include as components of the object all base class subobjects of the object, data members defined in the class, and a VFT pointer to the VFT for implementing the virtual dispatch mechanism required for virtual functions; laying out virtual base pointers in computer memory to access virtual base subobjects; and performing a nonvirtual cast, for a virtual function call p→ƒ( ), to a most derived subobject that is a base-or-self of the static type pointed to by p and defines a virtual function ƒ( ) and has an entry for ƒ( ) in its VFT, if such a subobject exists, thereby providing a virtual dispatch that eliminates late casts where possible.

Claim 29

A computer implemented method of modeling C++ objects in an implementation of the C++ programming language in which a class in the C++ language may inherit another class, an inherited class being known as a base class and an inheriting class being known as a derived class, a class hierarchy graph, , for an C++ language program being defined as a tuple <N,E> where N is a set of nodes representing classes in the program and E is a set of directed edges representing inheritance relationships between the classes, a nonvirtual path from class B to class D is a path in from the node labeled B to the node labeled D such that there is no virtual inheritance edge along this path, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a nonvirtual region for a class D is the set of classes such that for each class B in this set, there is a nonvirtual path in from B to D, a virtual path from class V to class D is a path in from the node labeled V to the node labeled D such that there is at least one virtual inheritance edge along this path, a class V being a virtual base of a class D if there is a virtual path in from V to D, a virtual region for the class D being a set of classes such that for each class V in the set, there is a virtual path in from V to D, wherein when a fully derived object of class D, with static type S, is pointed to by p in a virtual function call p→ƒ( ), and the actual function invoked is ƒ defined in class E, denoted by E::ƒ( ), an early cast is an adjustment of a THIS pointer to a subobject, X, in the D object whose VFT contains the entry that has an address of E::ƒ( ), a late cast is an adjustment of the THIS pointer to point to an E subobject if the E and X subobjects are at different locations within the D object, said computer implemented method comprising the steps of: laying out a virtual function table (VFT) in computer memory having a number of entries, said VFT table entries having at least a function address and supporting a virtual dispatch mechanism; laying out an object model in computer memory to include as components of the object all base class subobjects of the object, data members defined in the class, and a VFT pointer to the VFT for implementing the virtual dispatch mechanism required for virtual functions; laying out virtual base pointers in computer memory to access virtual base subobjects; and performing a nonvirtual cast, for a virtual function call p→ƒ( ), to a most derived subobject that is a base-or-self of the static type pointed to by p and defines a virtual function ƒ( ) and has an entry for ƒ( ) in its VFT, if such a subobject exists, thereby providing a virtual dispatch that eliminates late casts where possible.

Claim 30

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 23 wherein the VFT contains entries for all virtual functions introduced in the class and for all virtual functions introduced in the virtual region of the class, thereby eliminating a need for an early virtual cast.

Claim 31

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 24 further comprising the step of storing said virtual base pointers in said VFT as offsets to virtual base subobjects.

Claim 32

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 23 wherein the VFT contains entries for all virtual functions introduced in a class T, and if there is a direct virtual base V of the class D which is not a direct virtual base of any base class of the class D, then the class D's VFT contains an entry for all virtual functions introduced in the nonvirtual region of the class V, thereby eliminating a need for an early virtual cast.

Claim 33

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 26 further comprising the step of storing said virtual base pointers in said VFT as offsets to virtual base subobjects.

Claim 34

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 23 wherein a VFT for a class contains entries for all virtual functions that are visible at the class.

Claim 35

The computer implemented method of modeling C++ objects in an implementation of the C++ programming language recited in claim 23 wherein a VFT for a class contains entries for all virtual functions that are introduced in the class.