CA2077272C - Managing class method names - Google Patents

Managing class method names Download PDF

Info

Publication number
CA2077272C
CA2077272C CA002077272A CA2077272A CA2077272C CA 2077272 C CA2077272 C CA 2077272C CA 002077272 A CA002077272 A CA 002077272A CA 2077272 A CA2077272 A CA 2077272A CA 2077272 C CA2077272 C CA 2077272C
Authority
CA
Canada
Prior art keywords
class
methods
som
classes
data structure
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CA002077272A
Other languages
French (fr)
Other versions
CA2077272A1 (en
Inventor
Mike H. Conner
Andrew R. Martin
Larry K. Raper
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
International Business Machines Corp
Original Assignee
International Business Machines Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by International Business Machines Corp filed Critical International Business Machines Corp
Publication of CA2077272A1 publication Critical patent/CA2077272A1/en
Application granted granted Critical
Publication of CA2077272C publication Critical patent/CA2077272C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00Arrangements for software engineering
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/448Execution paradigms, e.g. implementations of programming paradigms
    • G06F9/4488Object-oriented
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10TECHNICAL SUBJECTS COVERED BY FORMER USPC
    • Y10STECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y10S707/00Data processing: database and file management or data structures
    • Y10S707/99941Database schema or data structure
    • Y10S707/99944Object-oriented database structure

Abstract

A method, system and program for effectively managing class method names by collecting representations of all of the names and additional supporting information in a single data structure. Management is accomplished by the operation of an algorithm in the memory of a processor which employs two mechanisms. First, the class method procedure tables are initialized by class specific procedures. This allows applications to access the methods without requiring externalization of the method names. The information provided by the specific procedures is retained by the class object and is accessible via class methods whenever the information is required. Second, any additional supporting information for methods, in particular the offset in the method procedure table for each method, is recorded in a single externally named data structure. The combination of the two mechanisms eliminates the requirement of external names on a per method basis.

Description

MANAGING CLASS METHOD NAMES
Field of. the Invention This invention generally relates to improvements in object oriented application s and more particularly to effectively managing class method names.
Background of the Invention Among developers of workstation software, object-oriented programming (or OOP) is increasingly recognized as an important new programming technology. It offers expanded opportunities f_or software reuse and extensibility, with improved programmer productivity when compared to conventional software development paradigms.
Even so, object-oriented technology has not effectively penetrated major commercial software products to date. In particular, operating-systems have hesitated to embrace the new technology.
As with many new programming technologies, the early expressions of OOP concepts focused on the creation of new languages and toolkits, each designed to exploit some particular aspect. So-called pure object-oriented languages, such as Smalltalk, presume a complete run-time environment (sometimes known as a virtual machine) because their semantics represent a major departure from traditional procedurally oriented system architectures. Hybrid languages such as C++, on the other hand, require less run-time support but sometimes result in tight bindings between programs that provide objects and the client programs that use them. Tight binding between object-providing programs and their clients often require client programs to be recompiled whenever simple changes are made in the providing programs. Examples of such systems are found in US Patent 4,885,717; 4,953,080 and 4,989,132.
Because different languages and object-oriented toolkits emphasize different aspects of OOP, the utility of the resulting software is frequently limited in scope. A
C++ programmer, for example, cannot easily use objects developed in Smalltalk, nor can a Smalltalk programmer make effective use of C++ objects. Objects and classes implemented in one language simply cannot be readily used from another. Unfortunately when this occurs one of the major benefits of OOP, the increased reuse of code, is severely curtailed. Object-oriented language and toolkit boundaries become, i.n effect, barriers to interoperability.
Summary of the Tnventi.on Accordingly, it is a primary objective of the present invention to manage class method names by collecting representations of all of the names and additional supporting information in a single data structure to improve manageability.
These and other objectives of the present invention are accomplished by the operation of. an algorithm in the memory of a processor which employs two mPch anisms. First, the class method procedure tables ane initialized by class specific procedures produced by the System Object Model (SOM) compiler. These procedures arP included in the file containing the method de.fi.ni.t.ions. This allows the procedures to refer to the method names without requiring externalization o.f the method mamas. The information provided by the speci.fi.c proc.edurP~: is retained by the class data structure and i.s accessible via class methods whenever the information is required.
Second, any additional supporting information for methods, in particular the offset in the method procedure table for each method, is recorded in a single externally named data structure. The combination of the two mechanisms eliminates the requirement f_or external. names on a per method basis.
Brief_ Description of the Drawings Figure 1 is a block diagram of a personal computer system in accordance with the subject invention;
Figure 2 is a dracaing of a SOM data structure in accordance with the subject invention;
Figure 3 is a drawing of a SOM class data structure in accordance with the subject invention;
Figure 4 is a flowchart depicting a language neutral object interface in accordance with the subject invention;
Figure 5 is a flowchart depicting a link, load and execution of an application using SOM objects in accordance with the subject invention;
Figure 6 is a flowchart depicting the creation of a new SOM class in accordance with the subject invention;
Figure 7 is a flowchart depicting the detailed construction of a new SOM class in accordance with the subject invention;
Figure 8 is a flowchart depicting the detailed construction of a new SOM generic !-lass object in accordance with the subject invention;
Figure 9 is a flowchart depi.cti.ng the detailed initialization of a new SOM class abject in accordance with the subject invention;
Figure 10 i.s a flowchart depicting the detailed initialization of a SOM class data structure with offset values in accordance with the subject invention;
Figure 11 is a flowchart depicting the detailed parent class shadowing of a statically de.fi.ned class hierarchies in accordance with the subject. invention;

Figure 12 is a flow diagram depicting the redispatch method in accordance with the subject invention;
Figure 13 is a flowchart depicting the detailed initialization of the offset value in a SOM class data structure for a single public instance variable in accordance with the subject invention;
Figure 14 is a flowchart depicting the detailed control flow that occurs when a redispatch stub is employed to convert a static method call into a dynamic method call in accordance with the subject invention; and Figure 15 is a flowchart depicting the detailed control flow that initialize a method procedure table for a class in accordance with the subject invention.
Detailed Description Of The Invention The invention is preferably practiced in the context of an operating system resident on an IBM PS/2° computer available from IBM Corporation. A representative hardware environment is depicted in Figure 1, which illustrates a typical hardware configuration of a workstation in accordance with the subject invention having a central processing unit 10, such as a conventional microprocessor, and a number of other units interconnected via a system bus 12. The workstation shown in Figure 1 includes a Random Access Memory (RAM) 14, Read Only Memory (ROM) 16, an I/O adapter 18 for connecting peripheral devices such as disk units 20 to the bus, a user interface adapter 22 for connecting a keyboard 24, a mouse 26, a speaker 28, a microphone 32, and/or other user interface devices such as a touch screen device (not shown) to the bus, a communication adapter 34 for connecting the workstation to a data processing network and a display adapter 36 for connecting the bus to a display device 38. The workstation has resident thereon the OS/2 base operating system and the computer software making up this invention which is included as a toolkit.

Object-Oriented Programming i.s quickly establishing itself as an important methodol.ody in developing high quality, reusable code. The imrenti.on includes a new system for developing class libraries and Object-Oriented programs.
This system is called t:he System Object Model (SOM). A
detailed description of object or,iPn ted programming, SOM, and a comparison to other obj et-oriented languages is provided to aid in understanding th P invent=ion.
INTRODUCTION TO OBJECT--ORIENTED PROGRANlHIING
A new developmen t in the software community is Object-Oriented Programming. Object-Oriented Programming Languages (OOPL) are being used throughout the industry, Object-Oriented Databases (OODB) are starting widespread interest, even Object-Oriented Design and Analysis (OODA) tools are changing the way people design and model systems.
Object-Oriented Programming is best understood in contrast to its close cousin, Structured Programming. Both attempt to deal with the same h~tsi.c issue, managing the complexity of ever more complex software systems.
Structured Programming models a sy,tem as a layered set of functional modules. These rnodu.l.PS are bttil_t up in a pyramid like fashion, each layer represent-.ing a higher level view of the system. Structured Programrninct models the system's behavior, but gives little gmidanc~ t~ modeling the system's information.
Object-Oriented Programming models a system as a set of cooperating objects. Like Structured Programming, it tries to manage the behavioral complexity of a system.
Object-Oriented Programming, however-, goes beyond Structured Programming in also trs~ir~g to manage the informational complexity of a system.
Because Object-Oriented Frograrnming models both the behavioral and i.nformati.onal complexity of a system, the system tends to bP much better organized than if it was simply well "structured". Because Object-Oriented systems are better organized, they are easier to understand, debug, maintain, and evolve. Well organized systems also lend themselves to code reuse.
Object-Oriented Programming envisions the dual issues of managing informational and behavioral complexity as being closely related. Its basic unit of organization is the object. Objects have some associated data, which are referred to as an object's state, and a set of operations, which are referred to as an object's methods. A method is implemented by a subroutine. F~ class is a general description of an object, which defines the data representative of an ob:ject's state, and the methods for supporting the object.
OBJECT-ORIENTED PROGRAMMING IN C
Before examiningSOM, consider Object-Oriented Programmingin C; will us naturally into the this lead SOM

philosophy.Consider data a structure definition containing informationrelated a genericstack. The data structure to encompassesa series of_ functions designed to operate on a stack structure. Givena basic stack definition, multiple instances this datastr~.~r.tmrPmay be declared within of our program.

A generic stark definition, in C, appears below:
struct stackType void *stackArray[STACKSIZE(;
int stackTop;
typedef struct stackType Stack;
A definition of a generic. stack function appears next:
Stack *create(); /* mall.oc and initialize a new stack. */
void *pop( /* Pop element off stack.
*/
Stack *thisStack);

void push( /* Push onto stack. */
Stack *thisStack, void *nextElement);
Most C programmers can imagine how sttr.h functions would be written. The <push()> fraction, for example, appears below.
void push(Stack *thisStack, void *nPxtElement) {
this5tack->stackArray[thisStack-~stacliTop{ _ nextElement;
thisStack->stackTop+a;
A client program might use this stack to, say, create a stack of words needing interpretation:
main() ( Stack *wordStack;
char *subject = "Emily";
char *verb = "eats";
char *object = "ice cream";
char *nextWord;
word5tack = create();
push(wordStack, object);
push(wordStack, verb);
push(wordStack, subject);
/* ... */
while (nextWord = pop(wordStack)) {
printf("%s\n", nextWord);
/* ... */
This example can be used to r_-eview Object-Oriented Programming. A class is a definition of an object. The definition includes the data elements of the object and the methods it supports. A <stack> is an example of a class. A

stack contains two data el.emPnt.s (<stackArray> and <stackTop>), and supports three methods, <create()>, <push()>, and <pop()>. A method is li.)ce a function, but is designed to operate on an object c>f a particular class. An object is a specific lllStaIlCe, or instantiation, of a class.
The object <wordStack> is an object of class <Stack>, or <wordStack> is an instance of a stack.
Every method requires a spe d-fi.c object on which it is to operate. This object is called a target object, or sometimes a receiving object. Notice that each method (except <create()>) takes as its first parameter a pointer to the target object. This i.s because a program may have many objects of a given c7.ass, and each are potential targets for a class method.
There are three important advantages of this type of organization. First, generic concepts are developed which can be reused in other situations in which similar concepts are appropriate. Second, self-contained code is developed, which can be fully tested before it is folded into our program. Third, encapsulated code is developed in which the internal details are hidden and of no interest to the client. A client <main()> program need know nothing about the <Stack> class other than it-.~ name, the methods it supports, and the interfaces to these methods.
COMPARISON TO Cf+
Another beneficial comparison is between SOM and the most widespread Object--Oriented programming language, C++, SOM has many similarities to Cn+. Both support class definitions, inheri.tanr.e, and overridden methods (called virtual methods i.n C~+). Both support the notion of encapsulation. But. whereas C+f is designed to support stand-alone programming efforts, SOM i.s focused on the support of commercial. quality class libraries. Most of the differences between SOM and C+f hinge on this issue. C++
class libraries are version dependent, while SOM class libraries are version independent. When a new .C++ class library is released, cl.i.ent code has t:o be fully recompiled, even if the changes are unrelated to public interfaces.
C++ supports programming in only one language, C++, SOM is designed to supporl- many languages. Rather than a language, SOM is a system for defining, manipulating, and releasing class l.ibrari.es. 60M i, msed to define classes and methods, but it is left ~.tp to the i.mplementor to choose a language for implementing methods without having to learn a new language syntax.
C++ provides minimal s;apport fou implementation hiding, or encapsulation. C++ class definitions, which must be released to clients, typically inCl m3e declarations for the private data and methods. In SOM, the Client never has to focus on these implementation details. The client need see only the .sc> files, which Contains only public information. C++ also provides a limited method resolution function. SOM offers several altPrn atives, such as offset method resolution, name loo)irrp resolution, and dispatch resolution.
One other interesting difference between SOM and C++ is in its notion of class. In C+ ~ , the class declaration is very similar to a strr.rcturF dPCI_aration. It is a compile-time package with no ~haractat-istiCS that have significance at runtime. In SOM, tho M ass of an object is an object. The class object is il-sPlf an instantiation of another class, Called the metaClass. The class object supports a host of useful. methods which have no direct parallels in Ci-+, such as ~somGatName()w, <somGetParent()>, and <somFindMethod()>.
INTRODUCTION TO SOM
The OS/2~n 7.0 Operating System includes a language-neutral Object-Oriented programming mechanism called SOM (for System Oh_jer.t Model). Although it is possible to write Object-Oriented programs in traditional languages, such as the stack example, SOM is specifically designed to support tre new paradigm and to be 20 ~~2~2 used with both procedural (or non Object-Oriented) languages and Object-Oriented languages.
An important requirement of Object-Oriented programming is code reusability. Typi.ca.ll.y, rode reusability is achieved through the use of class libraries. Today~s library technology is limited in that class libraries are always language specific. A C++ library cannot be used by a Smalltalk programmer and a Smalltal.lc programmer cannot utilize a C++ library. Clearly it it necessary to create a language-neutral object model., which can be used to create class libraries usable from any programming language, procedural or Object-Oriented.
SOM introduces three important- features lacking in most procedural languages. These are Pncapsulation, inheritance, and polymorphism (referred t~ here as "override resolution"). Inheritance refers to a technique of specifying the shape and behavior of a class (called a subclass) as incremental differences from another class (called the parent class or superrl.ass).
Encapsulation refers to hiding implementation details from clients. This protects clients .from making changes in an implementation which ~o~tl.d adv~rsPl.y affect the system.
For example, i.n the staclz example t.l~erP was no protection afforded to the C code. Althon gh c-l.ients did not need to know the internal data structures of the stack, there was no way to prevent clients from lookin g at such implementation details. We could discourage, but not prevent, clients from writing code which used, and possibly corrupted, internal stack data elements.
Inheritance, or class derivation, is specific a technique for classes from existingclasses.
developing new This capabilityprovides the creation of for new classes which are more specialized classes.
ver.-sions of existing For example, could createa ~DPbuggabl.eStack>,which we is like a <Stack? class, but supports further debugging methods, such as <peek( ) > for l.oolcing at the top value and <dump()> for printing a r.ompl.ete listing of the stack.
Inheritanr.e also pr-ovi.des code consolidation. So, for example, a class defining ~:GraduateStudent> and <UnderGraduateStudent~, can he consolidated into a third class, <Student>. We them defina <GraduateStudent> and <UnderGraduate> as more specialized classes, both derived from the common parent <Studentv.
Inheritance introduces some additional semantics. A
specialized class i.s said to he derived from a more generalized class. The general c-1ass is called the parent class, or sometimes, the base class. The specialized class is called the child class, or sometimes, the derived class. A child class is said to i.nheri.t the characteristics of its parent class, meaning that any methods defined for a parent are automatically defined for a child. Thus, because <GraduateStudent> and <UnderGraduateStudent> are both derived from <Student>, they both automatically acquire any methods declared in their common parent.
Override resolution r°efers tn invol=;ed methods being resolved based not only on the t~arn~ «f_ the method, but also on a class place within a clas~ hierat-chy. This allows us to redefine methods as we derive classes. We might define a <printStudentInfo()~ method for =St=rrdeW.~ and then override, or redefine, the method i.n boYh -tlnderGraduateStudent>, and <GraduateStudent>. Override resolution resolves based on the type of the target object. if the target object type is a <Student>, the <Student~ version of ~printStudentInfo()>
is invoked. If the target object type is a <GraduateStudent>, the <GraduateStudent> version of <printStudentInfo()> is invoked.
DEFINING ChASSES IN SOM
The process of_ creatiIlg class libraries in SOM is a three step process. The class designer defines the class interface, implements the class methods, and finally loads w 20 77272 the resulting object code into a class library. Clients either use these classes directly, make modifications to suit their specific purposes, or add entirely new classes of their own.
In SOM, a class is defined by creating a class definition file. The class definition file is named with an extension of "csc". In i.ts most basic form, the class definition file is divided .into the following sections:
1. Include section This section declares files which need to be included, much like the C <#include> di.rectivP.
2. Class name and options This section defines the name of the class and declares various options.
3. Parent information This defines the parent, or base, class for this class.
All classes must have a parent. Tf a class is not derived from any existing classes, t:hPn it s parent will be the SOM
defined class <SOMObject~, ~he class information of which is in the file <somobj.sc>.
4. Data Section This section declares any data elements contained by objects of this class. By de.fanlt-., data can be accessed only by methods o.f the class.
5. Methods Section This section declares methods to which objects of this class can respond. By default, all methods declared in this section are available to any class client. The class definition file, <student.csc>, describes a non-derived <Student> class, and is set forth below.
Class Definition File: <student.csc>
include <somobj.sc.~

,.. 20 77272 class:
Student;
parent:
SOMObject;
data:
char id[16]; /* student id */
char name[32); /* student name */
methods:
void setUpStudent(char *id, chary *namP) ;
-- sets up a new student.
void printStudentInfo();
-- prints the student information.
char *getStudentType();
-- returns the student type.
char *getStudentId();
-- returns the student id.
How to Write a Method Class methods are implemented in the class method implementation file. Each method defined in the method section of the class definition file needs to be implemented. They can be i.mplPmented in any 7_an.guage that offers SOM support. C is used fnr an exemplary language throughout the specif.i.cation. However, one of ordinary skill in the art will realize thal- any programming language can be substituted. The student M ass method implementation file, <student.c?, is set forth hPinw.
Class Method Implementation File: <student.c>
#define Student Class Source #include "student.ih"
static void setUpStudent( Student *somSelf, char *icL, char *name) StudentData *somThi.s - Stu dPntGetData( somSelf ) ;
strcpy(__id, id);
strcpy(___name, name);

AT9-91-074 ~'1~
static void printStudentInfo(Student *somSelf) StudentData *somThi.s --- StudentGetData(somSelf);
printf(" Id . %s \n", id):
printf(" Name . %s \n", name);
printf(" Type . %s \n", _getStudentType(somSelf));
) static char *getStudentType(Student *somSelf) ( StudentData *somThis = Shudent:GetData(somSelf);
static char *type = "student=";
return (type);

static char *getStttdentId(Student *sornSelf) StudentData *somThis = StudentGetData(somSelf);
return (_id);
Notice that the method code appears similar to standard C. First, each method takes, as it:s first parameter, a pointer (<somSelf>) to th:= target ~t~jec-t. This parameter is implicit in the class definition file, hut is made explicit in the method i.mpl.ementati.on. SPrond, each method starts with a line setting an internal variabl.P named <somThis>, which is used by macros defined wit.hi.m the SOM header file.
Third, names of data e7.ements ~f the target object are preceded by an underscore character " '. The underscored name represents a C language macro defined in the class header file. Fourth, methods arP invoked by placing an underscore " " in front of the method name. This underscored name represents a macro for message resolution and shields a programmer from having to understand the details of this process.
The first parameter of every method is always a pointer to the target object. This is illustrated below in the method <printStudentInfo{)> which invokes the method <getStudentType{)> on its target= object.
SOM compiler generated <student.c'~
#define Student ClassSource #include "student.ih"
static void setUpStudent( Student *somSel.f, char *id, chat *name) StudentData *somThis =
StudentGetData(somSelf);
static void printStudentInfo(Student 'somSelf) ( StudentData *somThis StudentGetData(somSelf);
/* ...and so on for the other methods. */
MECHANICS OF USING SOM
There are a set of_ files involved with each class which are discussed below. The fil.PS have different extensions, but all have the same filename as t-he class definition file, <Student> in our example. These files arP described below.
Student Class Files <student.csc> - This i.s the class definition file, as described earlier.
<student_sc> - This is a subset of the class definition file. It includes al.l information from the <.csc> file which is public, including comments on public elements. For the student example, <student.sc> would include everything from <student.cse> except the data section. This file is created by the SOM compile:.

AT9-91-074 lH

<student.h> -. This is a valid C header file which contains macros necessary to invoke public. methods and access public data elements of the class. This file wi-11 be included in any client of the class, and i.s created by the SOM compiler.
<student_ih> - Similar to <student_h>, but i.t contains additional information needed for implementing methods.
This is the implementor~s version of the <_h> file, and must be included in the class methods i.mpl.ementation file. This file is created by the SOM compiler and should not be edited.
<student_c> -- Contai.ns the method implementations.
Initially created by the SOM ~:ompilPr and then updated by the class implementor.
BUILDING SOM CLASSES FROM OTHER CLASSES
There are two ways to use classes as building blocks for other classes. These are derivation (or inheritance) and construction.
DERIVATION
In this example, <GraduatPStudent> is derived from <Student>, its base, or parent ~l.ass. A derived class automatically picks up all. of t--he characteristics of the base class. A derived class can add new functionality through the definition and implemPnf.atiorr of new methods. A
derived class can also redPfi.ne mPt-hods of its base class, a process called overriding. For Pxampl.e <GraduateStudent>
adds <setUpGranduateStudent()> to those methods it inherits from <Student>. It overrides two other inherited methods, <printStudentInfo()> and <getStudentType()>. It inherits without change <setUpStudent()> and <getStudentId()> from the <Student> base class.
The class defini.ti-on file for <GraduateStudent>, <graduate_csc>, is set forth below.
Class Definition File: <graduate_csc>

include <student.sc?
class:
GraduateStudent;
parent:
Student;
data:
char thesis[1281; /* thesis title */
char degree[161; /* graduate degree type */
methods:
override printStudentInfo;
override getStudentType;
void setUpGradu ateStudent( char *id, char *name, char *thesi.s, char *degree);
The method implementation f_ilP, ~graduate.c>, is shown below.
Class Method Implementation File: <graduate.c>
#define GraduateStudent Class Som m a #include "graduate. ih"
static void printStudentInfo(GradaateStudent *somSelf) GraduateStudentData *somThis GraduateStudentGetData(somSelf);
parent__printStudentInfo(somSelf);
printf(" Thesis . %s \n", tHP_S1S);
printf(" Degree . %s \n", degree);
static char *getStudentType(GraduateStudent *somSelf) static char *type = "Graduate";
return (type);

AT9-91-0~4 »2 0 ~ ~ 2 ~ 2 static void setTJpGraduateStudeni~
GraduateStudent *somSelf_, char *id, char *name, char *thesis, char *degree) [
GraduateStudentData *somThis GraduateStudentGetData(somSelf);
_setUpStudent(somSelf,id,name);
strcpy(_thesi.s, thesis);
strcpy(__degree, degree);
Often an overridden method will. need to invoke the original method of its parent. For example, the <printStudentInfo()> for- <GraduateStudent~ first invokes the <Student> version of <printStitdentInfo()> before printing out the <Gradu ateStudent> specific information. The syntax for this is "~parent_MethodName>", as can be seen in the <printStudentInfo()> method.
A given base class can bP msed for more than one derivation. The class, rTJnderclraduateStudent>, is also derived from <Student>. 'fhP ~-1ass definition file, <undgrad.csc>, is set forth below.
Class Definition File: <undgrad.c:sc>
include <student.sc>
class:
UnderGraduateStudent;
parent:
Student;
data:
char date[161; /* graduation date */
methods:
override printStudentInfo;

AT9-91-074 i~ 2 0 7 7 2 7 2 ,"...
override getStudentType;
void setUpUnderGraduateStuden t( char *id, char *name, char *date) ;
The method implementation file, ~mdgrad.c>, is set forth below.
Class Method Implementation File: <undgrad_c>
#define UnderGrad~.tateStudent Class SOtIrCP
#include "undgrad.ih"
static void printStudentInfo( UnderGraduateStudent *somSelf) UnderGraduateStudentData *somThis =
UnderGraduateStudentGetData(somSelf);
parent___printStudentInfo(somSelf);
printf ( " Gt:~ad Date . %s \n" , date ) ;

static char *getStttdentType(UnderGnaduateStudent *somSelf) E
static char *type - "LJnderGradaate" ;
return (type);
l static void setlJpUnderGraduateStmient( UnderGraduateStudent *somSelf,c-har *i.d, char *name, char *date) E
UnderGraduateStudentDat.a * somTlti. s ----UnderGraduateStudentGetData(somSe.lf);
_setUpStudent(somSelf,id,name);
strcpy(date, date);
The second technique f_or building classes is construction. Construction refers to a class using another class, but not throt.tgh inheritance. A good example of construction is the class <Course> which includes an array of pointers to <Student>s.
Each pointer contains the address of a particular student taking the course. <Course> is constructed from <Student>.
The class definition file for- ~C:owwe~, <course.csc>, is shown below.
Class Definition File: <course.csc>
include <somobj.sc>
class:
Course;
parent:
SOMObject;
data:
char code[8]; /* course code number */
char title[ 32 ] ; /* r.ourse ti.tl.e */
char instructor[3?.]; /* i.nstrttctor teaching *,~
int credit; /* number of credits */
int capacity; /* maxi.mum member of seats */
Student *studentList[2O ; /* enrolled student list */
int enrollment; /* number of enrolled students *j methods:
override somInit;
void setUpCourse(char *code, r_har *title, char *instructor, i.nt credit, int rapacity);
-- sets up a new course.
int addStudent(Student *student);
-- enrolls a student to the course.

AT9-91-074 ?~ p 7 7 2 7 2 void dropStudent(char *studentId);
-- drops the student from th.e course.
void printCourseInfo();
-- prints course information.
Often classes will want to ta)ce special steps to initialize their instance data. An instance of <Cou rse>
must at least initialize the ~enrollment~ data element, to ensure the array index starts i.n a valid state. The method <somInit()> is always called when a new object is created.
This method is inherited from ~SOMObject>, and can be overridden when object initialization is desired.
This example brings up an interesting characteristic of inheritance, the "is-a" relationship between derived and base classes. Any derived class can be considered as a base class. We say that a derived class "is-a" base class. In the previous example, any <GraduateStudent> "is-a" <Student>, and can be used anyplace we are expecting a <Student>. The converse is not true. A base class is not a derived class.
A <Student> can not be treate~3 ~.mr.onditionally as a <Gradu ateStudent>. Thus, elements of the array <studentList>
can point to either <Student~s, a ~ GraduateStudent>s, or a <UnderGradu ateS tudent > s .
The method implementation file for <Course>, <course.c>, is set forth below.
Class Method Implementation File: <course.c>
#define Course Class Source #include <student.h>
#include "course.ih"
static void somInit(Course *somSelf) [
CourseData *somThis = CourseGet=Data(somSelf);
parent_somInit(somSelf_);
code[0) _ title[0) _ instructor[0) = 0;
_credit = _capacity = enrollment - 0;

static void setilpCourse(Course *somSelf., char *code, char *tit.le, char *instructor, int credit, int capacity) CourseData *somThis = CourseGPtData(somSelf);
strcpy(_code, code);
strcpy(__title, title) ;
strcpy(_instructor, instructor);
credit = credit;
--capacity = capacity;
]
static int addStudent(Course *somSPlf, Student *student) [
Cou rseData *somThis = Cou rseGetData(somSelf);
if(-enrollment ~- -capacity) oeturn(--1);
studentList[-enrollment++] - student;
return(0);
]
static void dropStudent(Course *somSelf, char *studentId) I
int i;
CourseData *somThis - CourseGPtDat.a(~omSelf);
for(i=0; i<_enrollment; i++) if ( ! strcmp( studentld, getSttrrlPntl<1( studentList[ i ] ) ) ) [
enrollment--, for(i; i~ enrol.lment; i+~) studentList[ i [ - sttrdanta,i st[ i+1 ] ;
return;
]
]
static void printCourseInfo(Course *somSelf) int i;
CourseData *somThis = CourseGetData(somSelf);
printf(" %s %s \n", code, titl.e);
printf(" Instructor Name : %s \n", instructor);
printf(" Credit --- %d, Capaci.t:y -- %d, Enrollment -%d \n\n", --credit, capacity, enrollment) ;

20 ~~2~2 printf(" STUDENT LIST: \n\n");
for(i=0; i.<._ enrollment; i++) _printStudentInfo ( studentl~i st[ i J ) ;
printf("\n");
Notice in particular the method <printCou rseInfo()>.
This method goes through the array ~studentList> invoking the method <printStudentInf_o()> on each student. This method is defined for <Student', and then overridden by both <GraduateStudent> and ~ZJnderC:radmateStadent>. Since the array element can point= to any of these three classes, it is impossible at compile time to determine what the actual type of the target object is, only that t.ha target object is either a <Student> or some type derived from <Student>.
Since each of these classes aet nes a aiLZerenL
<printStudentInfo()> method, it is impossible to determine which of these methods will be invoked with each pass of the loop. This is all under the r.ontr~~l of override resolution.
THE SOM CL, I ENT
To understand how a client might make use of these four classes in a program, an example i s presented below in the file <main.c>. The example il.lumi.~~at.Ps object instantiation and creation in SOM, and how met-l~od~ are i t~voked.
SOM client code. <main_c>
#include <student.h>
#include <course.h~
#include <graduate.h~
#include <undgrad.h>
main() Course *course --- CourseNew();
GraduateStudent * j ane --- Gradua teStudentDlew( ) ;
UnderGraduateStudent *mark =
UnderGraduateStudentNew();
_setUpCourse(course, "303", "Compilers ", "Dr. David Johnson", 3, 15);
-setUpGraduateStudent(jane,"423538","Jane Brown", "Code Optimization","Ph.D.");
_setUpUnderGradu ateStudent(mark,"399542", "Mark Smith", "12/17/92");
_addStudent(cou rse, jane);
_addStudent(course, mark);
_printCourseInfo(course);
A class is instantiated with the method <classNameNew()>, which is automatically defined by SOM for each recognized class. Methods at:~e invoked by placing an underscore "__" in front of the method name. The first parameter is the target object. The remaining parameters illuminate additional information required by the method.
When run, the client program gives the output shown below.
Client Program Output 303 Compilers Instructor Name : Dr. David Johnson Credit = 3, Capacity = 15, Enrol.lment ---- 2.
STUDENT LIST:
Id . 423538 Name . Jane Brown Type . Graduate Thesis . Code Optimization Degree . Ph.D.

Id . 399542 Name . Mark Smith Type . UnderGraduate Grad Date. 12/17/92 The client program output illustrates the override resolution at work in the different styles of displaying <UnderGraduate>s and <GraduateStudent>s. A <Course> thinks of itself as containing an array of Student>s, and knows that any <Student> responds to a ~printStudentInfo()>
method. But the <printStudentinfo()> method that an <UnderGraduate> responds to is different than the <printStudentInfo()> method that a <GraduateStudent>
responds to, and the two methods give di.ff_erent outputs.
SOM Object Model.
Figure 2 is a drawing of a basic SOM data structure in accordance with the subject invention. Label 210 is a state data structure for a particular object. The first full word at label 22.0 contains the address of the object s method procedure table label 240. The rest of the state data structure set forth at label 230 contains additional information pertaining to t:he objPCt. The method procedure table set forth at label 240 contains the address of the class object data structure 245 and addresses of various methods for the particular object 2.50 and 260. The address at 245 points to the class object data structure 248. All objects that are of the same class a, this object also contain an address that point=s t-o this method procedure table diagrammed at label 240. Any methods inherited by the objects will have their method procedu re addresses at the same offset in memory as they appear in t:he method procedure table as set forth at label ?.40 of the ancestor class from which it is inherited.
Addresses of the blocks of c~mput~er memory containing the series of instructions for two of the method procedures are set forth at labels 250 and 260. T~abels 270 and 280 represent locations in a computer memory containing the series of instructions of particular method procedures pointed to by the addresses represented by labels 250 and 260.
The SOM Base Classes Much of the SOM Object Model is implemented by three classes that are part of the basic SOM support. Briefly these classes are:
SOMObject - This class is tile root class of all SOM classes.
Any class must be descended from SOMObject. Because all classes are descended from SOMObject they all inherit and therefore support the methods defined by SOMObject. The methods of SOMObject like the methods of any SOM class can be overridden by the classes descended from SOMObject.
SOMClass - This class is the root meta class for all SOM
meta classes. A meta class is a class whose instances are class objects. SOMClass provides the methods that allow new class objects to be created.
SOMCIassMgr - This class is used to create the single object in a SOM based program that manages class objects.
The three SOM base classes are deti.med below.
SOMObject This is the SOM root class, a11. SOM classes must be descended from <SOMObject~. <SOMOhjPct.~ has no instance data so there is no per-instance cost t-.n beinct descended from it.
SOMObject has the .following methods:
Method: somInit Parameters: somSelf Returns: void Description:
Initialize <self>. As instances of <SOMObject> do not have any instance data there is nothing to initialize and you need not call this method. Tt is provided to induce consistencx among subclasse:~ that require initialization.

AT9-91-074 2'7 <somInit> is called automat.i.cal.l.y as a side effect of object creation (ie, by <somNew>). If this effect is not desired, you can supply your own version of <somNew> ( in a user-written metaclass) which does not invoke <somInit>.
When overriding this method you should always call the parent class version of_ this method BEFORE doing your own initialization.
Method: somUninit Parameters: somSelf Returns: void Description:
(Un-initialize self) As instances of <SOMObject> do not have any instance data there i.s nothing to un-initialize and you need not call this method. It is provided to induce consistency among subclasses that require un-initialization.
Use this method to clean up anything necessary such as dynamically allocated storage. However this method does not release the actual storage assigned to the object instance.
This method is provided as a complement to <somFree> which also releases the storage associated with a dynamically allocated object. Usually you w~ml.d just call <somFree>
which will always call. <somUni.nit-w. However, in cases where <somRenew> (see the definition of ~SOMClass>) was used to create an object instance, ~somFree~ cannot be called and you must call <somLJni.ni.t> e;tplici t:l y.
When overriding this method you should always call the parentclass version of this method AFTER doing your own un-initialization.
Method: somFree Parameters: somSelf.
Returns: void Description:
Releases the storage associated with <self>, assuming that <self> was created by <somNew> (or another class method AT9-91-074 ?.8 that used <somNew>). No future references should be made to <self>. Will call <somUnini.t> on -:self> before releasing the storage.
This method must only he called on objects created by <somNew> (see the definition of ~somClass>) and never on objects created by <somRenew>.
It should not be necessary to override this method.
(Override <somUninit> instead.) Method: somGetClassName Parameters: som5elf Returns: Zstring Description:
Returns a pointer to this object's class's name, as a NULL terminated string. It should not be necessary to override this method as i.t just invokes the class object s method (<somGetName>) to get the name.
Method: somGetClass Parameters: somSelf Returns: SOMClass Description:
Returns this object s class object.
Method: somGetSize Parameters: somSelf Returns: integer4 Description:
Returns the size of this instance i.n bytes.
Method: somRespondsTo Parameters: somSelf, somId Mid Returns: int Description:
Returns 1 ( true ) i f the indi Gated method i s supported by this object's class and 0 (false) otherwise.

r...

Method: somIsA
Parameters: somSelf, SOMClass *Acl.assobj Returns: int Description:
Returns 1 (true) if <self> s class is a descendent class of <Aclassobj> and 0 (false) otherwise. Note: a class object is considered to be descended from itself for the purposes of this method.
Method: somIsInstanceOf Parameters: somSelf, SOMClass *Acl.assobj Returns: int Description:
Returns 1 (true) if <self~ is an instance of the specified <Aclassobj> and 0 (false) otherwise.
SOMObject methods that support dynamic object models.
These methods make it easier for very dynamic domains to bind to the SOM object protocol boundary. These methods determine the appropriate method procedure and then call it with the arguments speci..fied. The de.fa.uli: implementation of these methods provided i.n this class simply lookup the method by name and call it. fiowevPr, other classes may choose to implement any form of lookup they wish. For example, one could provide an implementation of these methods that used the CL:OS form of_ method resolution. For domains that can do so it will generally be much faster to invoke their methods directly rather than going through a dispatch method. However, all. methods are reachable through the dispatch methods. SOM provides a small set of external procedures that wrap these method calls so that the caller need never do method resolution.
These methods are declared to take a variable length argument list, but like all such methods the SOM object protocol boundary requires that t:he variable part of the argument list be assembled into the standard, platform-specific, data structure for variable argument lists before the method is actually invoked. This can be very need construct useful to the in argument domains that list runtime. As they methods without being at can invoke able put the constructedargumentsi.n the ormal form to n for a call.This i.s helpful becausesuch operation an is usuallyimpossible in st highlevel languages mo and platform-specific assemblerlanguageroutineswould have to be used.

Note: Different methods are defined for different return value shapes. This avoids the memory management problems that would arise in some domains if an additional parameter was required to carry the return value. SOM does not support return values except for the four families shown below. Within a family (such as .integer) SOM only supports the largest member.
Method: somDispatchV
Parameters: somSelf, somId methodId, somId descriptor, ...
Returns: void Description:
Does not return a value.
Method: somDispatchL
Parameters: somSel.f, somId methodld, somld descriptor Returns: integer4 Description:
Returns a 4 byte quantity in the normal manner that integer data is returned. This 4 byte quantity can, of course, be something other than an integer.
Method: somDispatchA
Parameters: somSelf, somId methodld, somId descriptor Returns: void Description:

,....

Returns a data structure addrPSS in the normal manner that such data is returned.
Method. somDispatchb Parameters: somSelf, somId methodId, somId descriptor Returns: float8 Description:
Returns a 8 byte quantity in the normal manner that floating point data is returned.
SOMObject methods that support development The methods in this group are provided to support program development. They have been defined in such a way that most development contexts will Find them easy to exploit. However, some contexts may need to customize their I/O facilities. We have attempted to allow this customization in a very portable manner, however not all contexts will be able to perform the customization operations directly because they t-eqttire passing function parameters. We chose this approach because it allows great platform-neutral flexibility and we fe.l.t that any provider of development support would find it: reasonable to provide the customizations necessary for her/his specific development environment.
The chosen approach reliPS on a character output routine. An external variable, -:S~MOtttCharRoutine>, points to this routine. The SOM environment provides an implementation of this routine that should work in most development environments (it wrp.tes to the standard output stream). A development context can, however, assign a new value to <SOMOutCharRoutine> and thereby redefine the output process. SOM provides no special support for doing this assignment.
Method: somPrintSelf Parameters: somSelf AT9-91-074 32.

Returns: SOMAny Description:
Uses <SOMOutCharRoutire> to write a brief string with identifying informat10I1 abOllt th7.S object. The default implementation just gives the object s class name and its address in memory. <self> is rei:urned.
Method: somDumpSelf Parameters: somSelf, int level_ Returns: void Description:
Uses <SOMOutCharRoutine~ to write a detailed description of this object and i.ts r_urrent state. <level>
indicates the nesting level for describing compound objects it must be greater than or equal to zero. All lines in the description will be preceded by <?.*level> spaces.
This routine only actually writes the data that concerns the object as a whole, such as class, and uses <somDumpSelfInt> to describe the object.~s current state.
This approach allows readable dPSC:ripti.ons of compound objects to be constructed.
Generally it is not necessary to override this method, if it is overridden it generally must be completely replaced.
Method: somDumpSelfInt Parameters: somSelf, int level Returns: void Description:
Uses <SOMOutCharRoutine> to write out the current state of this object. Generally this method will need to be overridden. When overriding i.t, begin by calling the parent class form of this method and then write out a description of your class~s instance data. This will result in a description of all the objet t s instance data going from its root ancestor class to its specific class.
SOMClass This is the SOM metaclass. That i.s,' the instances of this class are class objects. When the SOM environment is created one instance of this class with the external name <SOMCIassClassData.classObject> i, created. This class object is unique because it is i.ts own class object. That is, SOMCIassClassData.classObject --_somGetClass(SOMCIassClassData.r.lassObjer.t). This class introduces the somNew and somRenew methods that are used to create new instances of SOM objects. somNew applied to <SOMCIassClassData.classObject> produces a new class object which can then be initialized to become a particular new class. SOMClass can be subclassed just like any SOM class.
The subclasses of SOMClass are new metaclasses and can generate class objects with different implementations than those produced by <SOMClassClassData.cl.assObject>.
SOMClass is descended from SOMObje~t.
SOMClass defines the following methods.
Method: somNew Parameters: somSel.f Returns: SOMAny Description:
Make an instance of this class. When applied to <SOMCIassClassData.classObject>, nr any other metaclass object, this will produce a new cl ass object; when applied to a regular class object this wi 11 produce an instance of that class.
Method: somRenew Parameters: somSelf, SOMAny *obj Returns: SOMAny Description:

Make an instance of this class, hut use the space pointed to by <obj> rather than allor,ating new space for the object. Note. no test is made to insure that <obj> points to enough space. <obj> is returned, biit i.t is now a pointer to a valid, initialized, object.
Method: somInitClass Parameters: somSel.f, 2,string cl.assName, SOMAny *parentClass, integer4 instanceSize, int maxStaticMethods, integer4 majorVersion, integer4 mi.norVersion Returns: void Description:
Initialize <self>.
<parentClass> is the parent (or parent class) of this class, it may be NULL in which case it defaults to SOMObject (actually SOMObjectClassData.classObject the class object for SOMObject). If a parent class is specifed then it must have already been created as a pointer to its class object is required.
<instanceSize> should be just: the space needed for this class, it is not necessary to rn~iside~- t=he parent class's (if any) space requirements.
<maxStaticMethods?~ should bP jmst the static methods defined by this class, i.t i.s nit necessary to consider the parent class's methods (if as y), even if they are overridden in this class.
<majorVersion> indicates the major version number for this implementation of the class definition, and <minorVersion> indicates the minor version number.
Method: somClassReady Parameters: somSelf Returns: void Description:

This method is invoked when all of the static initialization for the class has been finished. The default implementation simply registers the newly constructed class with the SOMCIassMgr. Metaclasses may override this method to augment the class construction sequence in any way that they wish.
Method: somGetName Parameters: somSelf.
Returns: Zstring Description:
Returns this object's class name as a NULL terminated string.
Method: somGetParent Parameters: somSelf Returns: SOMClass Description:
Returns the parent class of_ self if one exists and NULL
otherwise.
Method: somGetClassData Parameters: somSelf Returns. somClassDataStructure J
Description:
Returns a pointer to the static ~className>ClassData structure.
Method: somSetClassData Parameters: somSelf_, somClassDataStructure *cds Returns: void Description:
Sets the class pointer to the static <className>ClassData structure..

"""" AT9-91-074 3~

Method: somDescendedFrom Parameters: somSelf, SOMClass *Aclassobj Returns: int Description:
Returns 1 (true) if. <sel.f> is a descendent class of <Aclassobj> and O (false) otherwise. Note: a class object is considered to be descended i.tsel.f f_or the purposes of this method.
Method. somCheckVersion Parameters: somSelf, integer4 majorVersion, integer4 minorVersion Returns: int Description:
Returns 1 (true) if the implementation of this class is compatible with the specified major and minor version number and false (0) otherwise. An implementation is compatible with the specified version numbers if_ it has the same major version number and a minor version number that is equal to or greater than ~minorVersion~. The major, minor version number pair (0,0) is considered t:o match any version. This method is usually called immediately after creating the class object to verify that: a dynamically loaded class definition is compatible with a using application.
Method: somFindMethod Parameters: somSelf, somId methodld, somMethodProc **m Returns: int Description:
Finds the method procedure associated with <methodId>
for this class and sets <m> to it. 1 (true) is returned when the method procedure is directly callable and O (false) is returned when the method procedure is a dispatch function.
If the class does not support the specified method then <m> is set to NULL and the return value is meaningless.

Returning a dispatr_h function does not guarantee that a class supports the specified method; the dispatch may fail.
Method: somFindMethodOk Parameters: somSelf, somId methodId, SomMethodProc **m Returns: int Description:
Just like <somEindMethod~ except that if the method is not supported then an error is raised and execution is halted.
Method: somFindSMethod Parameters: somSelf, somId methodld Returns: somMethodProc Description:
Finds the indicated method, which must be a static method defined for this class, and returns a pointer to its method procedure. If the method is not defined (as a static method or at all) f_or this class then a NULL pointer is returned.
Method: somFindSMethodOk Parameters: somSelf, somId methodld Returns: somMethodProc *
Description:
Just like <somFindSMetlu>cl'~ except that an error is raised if the method is not definPd_for this class.
Method: somSupportsMethod Parameters: somSelf, somId Mid Returns: int Description:
Returns 1 (true) if the indicated method is supported by this class and 0 (false) otherwise.

....

Method: somGetNumMethods Parameters: somSelf Returns: int Description:
Returns the number of mei:hods currently supported by this class, including inherited methods (both static and dynamic).
Method: somGetInstanceSize Parameters: somSelf Returns: integer4 Description:
Returns the total size of an instance of <self>. All instances of <self~ have the same size.
Method: somGetInstanceOffset Parameters: somSelf Returns: integer4 Description:
Return the offset i.n the body part of this object for the instance data belonging to thi:: class.
Method: somGetInstancePartSize Parameters: somSelf Returns: integer4 Description:
Returns the size in bytes of the instance data required for this class. This doe.~ not include the instance data space required for this class' ancestor or descendent classes.
Method: somGetNumStaticMethods Parameters: somSelf Returns: int Description:

Returns the number of static methodsthat this class has. This is used by a child ass initializing cl in its method table.

Method: somGetPClsMtab Parameters: somSelf Returns: somMethodTab Description:
Returns a pointer to the method table of this class~s parent class. If this class is a root class (SOMObject) then NULL is returned.
Method: somGetClassMtab Parameters: somSel.f Returns: somMethodTab Description:
Returns a pointer to the method table of this class.
Method: somAddStaticMethod Parameters: somSelf, somld methodId, somId methodDescriptor, somMethodProc *method, somMethodProc *redispatchStub, somMethodProc *appl.yStub Returns: somMOffset Description:
Adds/overrides the 1I1d1catPd method, returns the value that should be used to set the offset value in the class data structure for this method name.
<methodDescriptore i.s a somId for a string describing the calling sequence to this method as described in <somcGetNthMethodlnfo~ defined ica the SOMObject class definition.
<method> is the actual method procedu re for this method <redispatchStub> is a procedure with the same calling sequence as <method> that re-dispatches the method to one of this class's dispatch functions.
<applyStub> i.s a procedure that ta)ces a standard variable argument list data str-uctnre applies it to its target object by calling <method~ with arguments derived from the data structure. its ca 1. l.ing sequence is the same as the calling sequence of the dispatch methods defined in SOMObject. This stub is used in the support of the dispatch methods used in some classes. In classes where the dispatch functions do not need such a function this parameter may be null.
Method: som0werrideSMethod Parameters: somSelf, somId methodId, somMethodProc *method Returns: void Description:
This method can be used instead of <somAddStaticMethod>
or <somAddDynamicMethod? when it is known that the class' parent class already supports this method. This call does not require the method descriptor and stub methods that the others do.
Method: somGetMethodoffset Parameters: somSelf., somId methodld Returns: integer4 Description:
Returns the specified method's offset in the method procedure table assuming this is a static method, returns 0 if it was not. This value is used to set the offset value in this class data structure. it should only be necessary to use this method when a class used to define a method that it now inherits.
Method: somGetApplyStub Parameters: somSelf, somId methodId AT9-91-074 47.
za~~z~~
Returns: somMethodProc Description:
Returns the apply stub associated with the specified method. NULL is returned i.f the method is not supported by this class. An apply stub is a procedure that is called with a fixed calling sequence, namely (SOMAny *self, somId methodId, somId descriptor, ap l.i.st ap) where <ap> is a varargs data structure that contains the actual argument list to be passed to the method. The apply stub forwards the call to its associated metland and then returns any result produced by the method.
SOMCIassMgr SOMCIassMgr is descended from SOMObjecl=.
SOMObject defines the following methods:
Method: somFindClsInEile Parameters: somSelf, somId classId, int majorVersion, int minorVersion, Zstring file Returns: SOMClass Description:
Returns the class object for the specified class. This may result in dynamic. loading. Tf the class already exists <file> is ignored, otherwise it is used to locate and dynamically load the class. Val.»es of 0 for major and minor version numbers bypass version chPCki.ng.
Method: somFindCl.ass Parameters: somSelf, somId classId, i.nt majorVersion, int minorVersion Returns: SOMClass Description:
Returns the class object for t-.he specified class. This may result in dynamic loading. Uses somLocateClassEile to obtain the name of the file where the cl.ass~ code resides, then uses somFindClsInFile.

c AT9-91-074 4?

Method: somClassFromId Parameters: somSelf, somId classId Returns: SOMClass Description:
Finds the class object, given its Id, if it already exists. Does not load the class. Returns NULL if the class object does not yet exist.
Method: somRegisterClass Parameters: somSelf, SOMClass *cl.assObj Returns: void Description:
Lets the class manager know that the specified class is installed and tells it where the ~l.ass object is.
Method: somUnregisterClass Parameters: somSelf, SOMClass *classObj Returns: int Description:
Unloads the class file and removes the class from the SOM registry Method: somLocateClassFil.e Parameters: somSelf, somld classlc-1, int majorVersion, int minorVersion Returns: Zstring Description:
Real implementation supplied by subclasses. Default implementation returns the class name as the file name.
Subclasses may use version number info to assist in deriving the file name.
Method: somLoadClassFile Parameters: somSelf, somId classId, int majorVersion, int minorVersion, Zstring file w 20 77272 Returns: SOMClass Description:
Loads the class code and initial.i.ze the class object.
Method: somUnloadClassFile Parameters: somSelf, SOMClass *classObj Returns: int Description:
Releases the class' code and destroys the class object Method: somGetInitEunction Parameters: somSelf Returns: Zstring Description:
Supplies the name of the initialization function in the class' code file. Default implementation returns (*SOMCIassInitFuncName)().
Method: somMergeInto Parameters: somSelf, SOMObject *targetObj Returns: void Description:
Merges the SOMClassMgr registry information from the receiver to <targetObj'. ~target-Ohjv is required to be an instance of SOMCIassMgr or ot~e of its subclasses. At the completion of this operation, the -:targetObj> should be able to function as a replacement for the receiver. At the end of the operation the receiver object (which is then in a newly uninitialized state) is freed. Subclasses that override this method should similarly transfer their sections of the object and pass this method to their parent as the final step. If the receiving object is tYte distinguished instance pointed to from the global variable SOMCIassMgrObject, SOMCLassMgrObject is then reassigned to point to <targetObj>.

"w 20 772 72 Managing Object Names The subject invention improves i.rpon past object oriented techniques of requiring unique external names for every method for a class by initializing the class method table at runtime via a special procedure associated with each class implementation and by collecting the set of method offsets into a single extern ally named class data structure. This improvement reduces the complexities of managing a large list of external variables, reduces the problem of creating unique names (referred to as name mangling), reduces the memory requirements and reduces the load time of the generated execution module.
Figure 3 is a SOM <:loss data structure in accordance with the subject invention. Label 310 represents a pointer to the class object data structure set forth in Figure 2 at 248. Label 320 represents an offset into the method procedure table set forth in Figure 2. at label 240 or into the object's state data structure set forth in Figure 2 at label 230. Similarly, labels 330 and 340 represent additional offsets into the method procedure table or into its state data structure. For additional methods that are first defined in this class or methods that are mentioned in the class release order section brrt defined by one of the class' ancestor classes, or public instance variables defined by this class, there arP similar entries in the class data structure representing offsets associated with this class as signified by the elipses and "N + 1" at label 350. The additional entry is necessary because of the first entry represents a pointer to t=he class object data structure 248 in Figure ?..
The order of the values i.n the class data structure is determined by the order of the corresponding method or public instance variable name in the release order section of the class OIDL file. Methods or public data members defined in the class but not mentioned in the release order section are ordered after those mentioned in the release order section and in the order in which they appear in the class OIDL file.
Object Interface Definition Language (OIDL) The invention redefines language dependent object definitions as a neutral set of information from which object support for any language is provided. The neutral set of information is referred t~ as an Object Interface Definition Language (OIDL) definition in SOM. SOM OIDL
provides the basis for generating binding files that enable programming languages to use and provide SOM objects and their definitions (referred to as classes). Each OIDL file defines the complete interface to a class of SOM objects.
OIDL files come in different forms for different languages. The different forms enable a class implementer to specify additional language-specific information that allows the SOM Compiler to provide support for constructing the class. Each of these different: forms share a common core language that specifies the exact information that a user must know to use a class. OIle o.f the facilities of the SOM Compiler is the extraction of t:he common core part of a class definition. Thus, the clans impl_ementer can maintain a language-specific OIDf fi le fro a class, and use the SOM
Compiler to produce a language-nPmtral. core definition as needed.
This section describes OTDL~ with the extensions to support C-language programming. 11s indicated above, OIDL
files are compiled by the SOM Compiler to produce a set of language-specific or use-specific binding .files.
The SOM Compi.l.er produces seven different files for the C language.
o A public header file for programs that use a class.
Use of a class includes creating instance objects of the class, ca11il1g methods on instance objects, and subclassing the class to produce new classes.

AT9-91-074 4~ 2 0 7 7 2 7 2 o A private header file, which provides usage bindings to any private methods the class might have.
o An implementation header file, which provides macros and other material to support the implementation of the class.
o An implementation template, which provides an outline of the class implementation that the class provider can then edit.
o A language-neutral core def.ini.tion o A private language-neutral core file, which contains private parts of the class interface.
o An OS/2 .DEF file that can be used to package the class in the form of an OS/2 DLL.
OIDL files can contain the fol..lowing sections:
o Include section;
o Class section;
o Release Order section;
o Metaclass section;
o Parent Class section;
o Passthru section;
o Data section; and o Methods section.
Include section This required section contains an include statement that is a directive to the O1DL preprocessor telling the ~- 20 77272 compiler where to find the class interface definition for this class parent class, the class' metaclass if the class specifies one, and the private interface files for any ancestor class for which this class overrides one or more of its private methods.
Class Section This required section introduces the class, giving its name, attributes and optionally a description of the class as a whole.
Release Order Section This optional section contains a release order statement that forces the compiler to build certain critical data structures with their items arranged in the order specified. This allows the class interface and implementation to be evolved withoztt requiring programs that use this class be recompiled.
Release order applies to all method names public and data items. If the releas~ of_ somemethod public ordeT~ or data item is not specified, it will.default to an implementation-specific orderd on occurrencein base its the OIDL file. The introduction new public ems of data or it methods might CaLrSe the default~rdea:~ingof other public data items or methods to c:hangP;programsusing class the would then need to be recompiled.

Metaclass section This optional section specifi.PS the class metaclass, giving its name and, optionally, a description of the reason for the metaclass, or other_ comments about its role in this class' interface. If a metacl_ass is specified, its definition must be included in the include section. If no metaclass is specified, the metac-l.ass of this class' parent class will be used.
A class metaclass can also be implicitly defined through the combined use of the class attribute in the data AT9-91-074 4a 2 4 7 7 2 7 2 section and the class attribute in the method section. If either of these attributes are msed, then the metaclass section must be bypassed. In this case, the implied metaclass will be a subclass o.f the metaclass of the parent class.
Parent Class Section This required section specifies the r.lass~ parent class by indicating the name and optionally a description of the role of the parent class i.n thi.s cl.ass~ interface.
Passthru Section This optional section provides blocks of code to be passed by the compiler into various binding files. The contents of the passed information are ignored by the compiler. Even comments contained in passthru lines are processed without modification.
Data Section This optional section lists the instance variables for this class. This section i s generally present only in the language specific. version of the class interface definition (a .CSC file). However, it must he present in the public form of the class interface definii-ioo if the class contains public instance variables. AN51 r syntax is used to describe these variables.
Methods Section This optional sectlOrl lists the methods supported by this class. ANSI C function-prototype syntax is used to define the calling sequence to each method.
SOM Compiler The SOM Compiler translates the OIDL~ source definition of a SOM class into a set o.f bindings appropriate for a particular programming language. The SOM Compiler supplied with the OS/2_0 toolkit produces a complete set of bindings for the C programming language.
The compiler operates in two phases - a precompile phase and an emission phase. In the first phase a precompiler reads and analyzes a user-supplied class definition and produces intermediate output files containing binary class information, comments and passthru lines. In the second phase, one or more emitter programs run to produce the appropriate language binding files. Two additional programs serve as preprocessors for the SOM
precompiler phase. The sequencing and execution of all of these programs is directed by the SOM Compiler.
The output from the emitters, plus user-supplied logic for the class methods, are subsequently compiled by the C
compiler and linked by the OS/2. lin)cer to create a loadable module. Loadable modules can be packaged in self-contained files or placed in a DLL so the class can be used from many programs.
Referring to Figure 4, control. commences at terminal 400 and flows directly into function block 404 where a SOM
language neutral object interface definition (OIDL) 402 is input to the SOM OIDL compiler 404. The SOM OIDL compiler parses the object definitions in OtDL, into a canonical form 406 to simplify the code generation pror_ess as input to the target language emitter 41Ø The language emitter 410 generates language bindings 414 which include the class data structure depicted in Figure 3. Control flows to the language compiler shown in function block 420 which receives additional inputs from the language applications 416 and the SOM bindings 412. The language compiler could be a C, Fortran, Cobol or other compiler depending on user preference. Output from the language compiler is an object file 422 which can be link edited with the SOM runtime library for subsequent Pxacuti.on.
Figure 5 is a flowchart depicting a link, load and execution of an application using SOM objects in accordance with the subject invention. Processing commences at terminal 500 and immediately flows into function block 530 for a dynamic link and load of the SOM objects 510 created in Figure 4 at label 42.2 and the SOM run time library 520.
Then, at function block 540, the appl.i.cation is started, which invokes the creation of necessary classes and objects as set forth in function block 550 and detailed in Figures 6, 7, 8, 9 and 10. Finally, the applir.ation is executed as shown in function block 560 and control is terminated at terminal block 570.
Version Independence For_ Object Oriented Programs This aspect of the invention generally relates to improvements in object oriented applications and more particularly solving problems arising from the independent evolution of object definition libraries and the computer applications that use them.
The version independence processing isolates the executable binary form of comprutPr applications that use object definition libraries (al.so called object class libraries) from certain changes in the implementations or specification of the object definit-ions that naturally arise during the lifecycle of the libraries. Specifically, the following changes can be made t-o an object definition without compromising its use by the unmodified executable binary form of a computer- application which dynamically loads the object definit.ien each time the application is executed:
1) add new methods to an object definition;
2) move the point of definition for a method from a child class to its parent class;
3) add to, delete from, or otherwise change the private instance data associated with an object definition; and 4) insert a new class definition into a class hierarchy.

.. ~o »Z~z This processing is accomplished by the operation of an algorithm in the memory of a processor employing several techniques as follows. Method and instance offset are removed from application binary images. In static object models, such as the one defined in C+r, an offset (an integer number) into a method procedure table is used to select a method procedure f_or each particular method name.
The offset depends on the number and order of the methods of the class the method is defined in and the number of methods defined by its ancestors.
This approach has the benefit of being a very fast form of method resolution. However, i.n the prior art object models have placed these offsets in the binary images of the applications that used a parti.cul.ar object class, resulting in the requirement to recompile the application whenever the offsets required a change.
In SOM, the offsets associated with methods are collected into a single memory data structure for each class, called the class eiata sY.rwc:t:ur:e, detailed in the discussion of Figure 3. This data structure is given an external name and its content=s are ref_er.red to in applications. Each class data structure is initialized to contain the appropriate offset valrtes when a class object is initialized as detailed in Figure 1Ø Thus each time an application is executed all the offset values are recalculated based on the current definitions of the classes used by the application.
Note that any references in an application's binary images to the values stored in the class data structure contain offsets. However, these offsets can remain constant across the four kinds of changes enumerated above. This is because the class data structure only contains offsets for the methods defined in a particular class, not for offsets of methods inherited by the class. Thtts, new methods added to a class can have their_ offsets added at the end of the class data structure without disturbing the positions of the m...

offset values for methods that were already defined in the class.
The SOM Object Interface Definition Language (OIDL) contains a Release Order Section, discussed.. in the section titled "SOM Object Model" above. The releas~ order section of OIDL allows the class implementor to insure that new method offset values are added after the method offset values for methods already defined in a class. The release order section' in an OIDL file also causes an entry to be retained in a class data strmctur-P if one of the methods defined in the class is moved to a parent class as highlighted in Figure 3. This entry is then initialized from the parent offset value by a simple assignment statement that the OIDL compiler adds the logic initializing the class data structure as described in Figure 10.
A similar problem arises with public instance data. An application that accesses a public instance variable contained in one of the application's object's state data structure must do so via a offset into the objec t s state data structure. In the prior art, this offset was contained in application s binary image. If this technique is employed, then the application~~ binary image must be regenerated (via recompilation) any time the offset changes due to a change in the size of one or more of the object s ancestor classe s instance data requirements or due to changes in the objec t s o~an instance data layout.
In SOM this problem is solved by putting the offset for each public data variable in the class data structure detailed in Figure 3 and the ensuing discussion. Each class data structure is initialized to contain the appropriate offset values when the class object is initialized as detailed in Figures 7 and 1.3. Thus, each time an application is executed al.l the offset values are recalculated based on the current def_.initions of the classes used by the application.

r' Remove object state data structure sizes from applications binary images When new instances o.f objects are created, a correct amount of computer memory must be allocated to hold the object's state data structure. In the prior art, the size of this block of_ memory was cont:ai.ned in an application's binary image. If this technique is employed, then the application's binary image must be regenerated (via recompilation) any time the size of the object's state data structure changes. In SOM, this value is available via a call to the object's class object and thPr_efore need not be contained in an application's binary image.
The techniques described above allow each of the four changes previously highlighted t~ occur with respect to class definitions used by an application without requiring that the application's binary image to be regenerated.
Figure 6 is a flowch3r: depicting the creation of a new SOM class in accordance with the subject invention. Control commences at terminal 600 which flows immediately into a test for a correct version number: at decision block 610 where a check is performed to verify the correctness of the version number. If. an incorrect. version number is detected, then a message is displayed in output block 612 and control is terminated at terminal. bl.oclz 674. If a correct version number is detected, then another test: is performed at decision block 620 to determine if the SOM class exists. If the SOM class exists, then processing is returned at terminal block 622.
If the SOM class does not exist at decision block 620, then a test is performed at decision block 630 to determine if the SOM runtime environment is active. If it is not active, then the SOM runtime environment is invoked at function block 632. Whether the SOM environment was initially present or not, control then flows to decision block 640 to check for an error in the SOM environment at decision block 640. If an error is detected, then an -~ 20 77272 appropriate message is presented at output block 642 and processing is terminated at terminal block 644. If an error is not detected, then control passes to function block 650 where a default metaclass is prepared. Next, a class is constructed in function block 657. as detailed in Figure 7.
Finally, processing i~ returned at terminal block 660.
Figure 7 is a flowr_hart depicting the detailed construction of a new SOM class in accordance with the subject invention. Control commences at terminal 700 and flows immediately into function bloc)t 710 where a generic class object is created a,s detailecJ in Figure 8. Next, the new generic class is initialized to default values at function block 720 and detailed in Figure 9. Then, at function block 730, the instance data offset is initialized for the particular new class. Control flows to function block 740 where the class data structure (Figure 3) for the new class is initialized by assigning values representing each static method for the new class as detailed in Figure 10.
At function block 750, 760 and 770 the parent class is set, the class data is i.niti.aJized and the class is registered. These steps involve updating the new class data structure as detailed in the discussion of Figures 2, 10 and 13. Finally, control is returned at terminal 780.
Figure 8 is a flowchart. depicting the detailed construction of a new SOM g~nerir class ObJect in accordance with the subject invention. Control commences at terminal 800 and immediately flows into function block 810 where memory is allocated for the object. Then, a test is performed at decision block 820 to determine whether the memory was allocated. If an error_ is detected, then an appropriate error message is displayed at output block 830 and processing is terminated at terminal block 840. If no error is detected, then the default values of the object are set at function block 850 and control is returned at terminal block 860.

~0 77272 Figure 9 is a flowchart depicting the detailed initialization of a new SOM class object in accordance with the subject invention. Control commences at terminal 900 and immediately enters a decision block 910 and a test is performed to detect if the parent class of the new SOM class object exists. If a parent class exists, then the parent class is initialized in function block 912. Once the parent class is initialized, then memory for the class name is allocated at function block 920. Next, a test is performed again to detect if the parent class of the new SOM class object exists at decision block 930.
If a parent class does not exist, then initial variables are set to zero as shown in function block 932 and control passes to function block 970. If a parent class exists, then the initial variables are updated based upon the values from the parent class in function blocks 940, 950, and 960. Then, in function block 970, the version number for the class is set and error processing is performed in decision block 980. If an error is detected, then an appropriate message is displayed at output block 982 and processing terminates at terminal block 984. If no error is detected, then control is returned at terminal block 990.
Figure 10 is a flowchart depicting the detailed initialization of a SOM class data structure with offset values in accordance with the subject invention. Control commences at terminal blocl~ 1000 and immediately flows into function block 1010 where a loop commences with the acquisition of the next static method. In function block 1020, the new method id is registered with the SOM runtime environment. Then, a test is performed to determine if the method has already been registered in a parent class in decision block 1030. If the method has been registered, then the method offset is overridden at function block 1032 and control passes to decision bl.oc)c 1070.
If the method has not been registered with any parent class, then a test is performed to determine if the method has been defined in the current class at decision block 1040. If the method has been defined, then the existing offsets are employed at function Mock 1042 and control is passed to decision block 1070. If the method has not been defined, then memory is allocated and values are initialized in function blocks 1050 and 1060. In function block 1060 the offset is calculated by adding the number of inherited static methods to the number of inherited static methods processed to date by the class. Error processing is performed in decision block 7.070, and if an error is detected, then an appropriate message is displayed at output block 1072 and processing terminates at terminal block 1074.
After error processing is completed, another test is performed at decision block 1080 to determine if any additional methods require processing. If there are additional methods, then control. passes to function block 1010 for the next iteration of the loop. Otherwise, control flows to terminal 1090 where control returns.
Parent Class Shadowing Logic for providing a dynamic insertion of a replacement parent class, referred t<.> W object programming as a parent class shadow, i.s detailed i.n this section of the invention. This processing allows the statically compiled definition of what parent class i~ linked to a particular class at runtime to be dynainic.ally altered during execution.
The ability to insert a new parent class into a statically compiled class hierarchy ofE'ers more flexibility to maintain and enhance existing rode after it has appeared in binary form. It also offers a new degree of freedom for customizing code withortt access to source materials since this result can be achieved without recompilation.
Prior art systems have inherent: limitations associated with statically linking derived classes and their parent classes. These limitations include, computation of the size of the derived object state data structure, initialization of the derived method procedure tah.le, and the inability to AT9-91-074 Y 5Z p 7 7 2 7 2 provide access to a parent class' methods from within the derived class' methods (called parent class resolution).
The SOM object model removes these static references by having all the parent class information available at runtime through the parent class object. 'thus, when the derived class implementation needs information about the size of the parent class' state data structure, the addresses of the parent class' method procedures, or access to the parent class' method procedure table (to support parent class resolution) an appropriate call i.s placed to acquire the information from the parent class object. The detailed processing to obtain this information are given in Figures 7, 8, 9, and 10.
SOM introduces a class manager for every SOM process.
The class manager is responsibl.P for keeping a registry of classes. The class construction code generated by the SOM
compiler works with the class manager to establish the relationship between a class and its parent class whenever a child class object is created. The SOM class manager is an instance of a class which call be silbclassed like any other SOM class.
Derived classes establish a connection to their parent class object by making calls on the SOM Class Manager object. An application designer wanting to substitute an alternate class implementation for the original class implementation follows the following steps:
1) Subclass SOMCIassMgr providing a new set of application specific rules for determining a class object from a class name (i.e., changing the implementations of somClassEromId, somFindClass, and somEindClsInFile) A simple and useful way to do this is to add a method to register a shadow class object under an existing class name and then return the shadow class object to the calling application in any subsequent calls to somClassEromId, r~
somFindClass, or somFindClsInFile where the shadowed name is specified.
2) Before creating any derived class objects that are to have a shadowed parent class object, create an instance of the new class manager class (as described in step 1 above), initialize it from the existing SOMClassMgr instance (via the somMergeInto method), and then replace the existing SOMClassMgr instance with the new class manager instance by overriding the address of the existing SOMCIassMgr instance in the SOM runtime.
3) Still before creating any derived class objects that are to have a shadowed parent class object, use the facilities of the application specified class manager object to register the shadow class objects.
After the above three steps have been completed, derived class objects can be created. They will be linked to the appropriate parent shadow class objects. This will work because of the specific. logic nsPd to initialize a class object and link to its parent class object as depicted in Figure 11. This logic consists of two basic steps:
1) First, a call. is made to i.rmnrP that the statically known parent class object has been c-rPat:ed. This serves two important purposes:
(a) It creates a static referenr.P to the binary image of the statically known parent class definition, thus insuring that the parent class implementation will be linked into the binary image of the application.
(b) It insures that the at least the statically known parent class object has been registered with the SOM
class manager object before the next step occurs.
If the statically known parent class object has already been created (say by an application following the shadowing steps discussed above) then a second attempt at this time is ignored.

,.. ~0 77272 2) Second, a call is made to the SOM class manager object to retrieve the address of the appropriate class object based on the name of the derived class parent class. If the parent class has been shadowed then this call will return the shadow class object.
The combination of the techniques and mechanisms described above effectively isolate a derived class' binary image from any dependency on the exact class of the class object that the derived class uses to extract parent class data from.
Two restrictions must be observed when inserting a new class between a child class and i.ts parent class. First, the insertion must be accomplished before any instances of the child class have been created. Second, the inserted class must also be an immediate chi.l.d of the original parent class. Because the SOM class manager is used as an intermediary when establishing the relationships between classes at run time, even a statically linked class can be shadowed in this manner.
Figure 11 is a flowchart depicting the detailed parent class shadowing of a statically defined class hierarchies in accordance with the subject i.nvent.i.on. Control commences at terminal block 1100 and immediately flows into function block 1110 where the statically defined parent class object is created. Next, the shadow parent- class is created and used to override the statically defined parent class at function block 1120. Then, the child class is created as shown in function bloc)c J.130 and the child class interrogates the SOM class manager to ascertain its current, rather than statically defined, parent class. Control returns at terminal block 1140.
Redispatch Method Stubs A central aspect of object oT-iented programming is referred to as method resolution. This processing selects a particular method given an object, the method's id and the r~
2p 77272 arguments passed to the method invocation. In many object models, such as the one used in C++, method resolution consists of determining an offset into an object specific table of procedure entry points based on an analysis of the program s source code. This type of resolution is referred to in object models as static. In other object models such as the one used in Smalltalk, a more dynamic model is used that consists of using the name o.f the object to determine a specific method at runtime. In object models this is referred to as dynamic.
The invention consists of ~ programming mechanism called redispatch stubs to ameliorate the difference between static and dynamic models. A redispatch stub is a small procedure with an entry point that can be placed into a table of procedure entry points. The table of procedure entry points are used in a static object model as a substitute for the actual method entry point that is expected. The redispatch stub is generated automatically based on the requirements of the dynamic object model. The redispatch stub converts the call generated in the static object model into the form necessary in the dynamic object model and supplies any missing information in the process.
Thus, if an object is accessed from a static object model that is provided by a dynamic. object model, it can be represented to the static object model vi.a a table of entry points which each indicate a particml.ar redispatch stub.
Figure 12 is a flow diagram depicting the redispatch method in accordance with the subject invention. Label 1200 is a state data structure for a particular object. The first full word at label 1210 contains the address of the objec t s method procedure table label 1240. The rest of the state data structure is set forth at label 1230 contains additional information pertaining to the object. The method procedure table set forth at label 1240 containing the addresses of various methods for t-.he particular object. All objects that are of the same class as this object also contain an address that. points to this method procedure table diagrammed at label 1240. Any methods inherited by the objects will. have their method procedure addresses at the same offset in memory as they appear in the method procedure table as set forth at label 1240 of the ancestor class from which it is inherited.
In the figure, label 1250 contains a pointer to a redispatch stub 1270. A redispatch stub is a sequence of instructions that appear as a method t;o a client program.
However, the instructions merely convert the method call into a call to an object's appropriate dispatch function as illustrated at label 1260. The address at label 1260 is a pointer to the object's dispatch function 1280. All SOM
objects have a dispatch function. The dispatch function 1280 implements an algorithm to select a particular method based on the parameters passed by the redispatch stab.
These parameters include the method s identifier, a string describing a set of arguments passed to the identified method, and a data structure containing the set of arguments.
Offset Values Figure 13 is a flowchart depicting the detailed initialization o.f_ the offset value in a SOM class data structure for a single public instance variable. This logic sequence is repeated for each public instance variable defined in a particular class (sPe the discussion of the OIDL Data Section above). Control. commences at the terminal block 1300 and immediately flows into the function block 1310 where the offset of the instance variable is calculated by adding the instance var.iab.te~s offset within this class' object state data to the offset of the beginning of this class object state data within the object state data structure set forth in Figure 2 at label 230.
The beginning of the r.l.ass objer_t state data is determined by adding up the sizes of each of this class' ancestor classe s object state data. Control then passes to function block 1320 when the calculated offset is stored into the position in the class data structure as determined AT9-91-074 62, 2p 77272 by the position of the public instance variable's name in the OIDL files Release Order Section (see the OIDL Release Order section above and Figure 3 above). Control then flows to the terminal block 1330 and the process is complete.
Redispatch Stubs Figure 14 is a flowchart depicting the detailed control flow that occurs when a redispatch stub is employed to convert a static method call. into a dynamic method call.
Control commences at the terminal block 1.400 and immediately flows into the function block 141.0 where the address of the redispatch stub is determined in the normal static method resolution manner by gettinct the address stored in the object's method procedure table at an offset contained in the appropriate class data structure at position determined when the class was defined.
Control then passes to function block 1420 where the redispatch stub is called exactly like it was the real static method procedure. Fimct:i~n bloc)z 1430 depicts how the redispatch stub calls the object's dispatch method (using normal method resolution as described above). The redispatch stub adds the methods identifier and descriptor to the call as required key the object's dispatch method.
These values are incorporated into the redispatch function definition when i.t i.s generated by the SOM OIDL compiler.
(Note: as detailed in the defi.niti~>n of the SOMObject class above, all classes must support dispatch methods). The object's dispatch method procedure determines which actual method procedure should be called using an algorithm specific to the objec t s class as shown in function block 1440.
SOM provides default implementationof such an a algorithmthat looksthe method's identifierup in a table containedin the determine object's the class object to address f a methodprocedure. Other objectmodels might o use otheralgorithms.Control then passes function to block -. Zp 77272 1450 where the method procedure determined in block 1440 is called. When the method procedure returns its return value if any is returned to the original caller of the redispatch stub at terminal block 1460. The redi.spatch stub allows the original static method call to be converted to one of arbitrary dynamics without requiring any changes to the application program that is manipulating the object.
Method Procedure Table Initialization Figure 15 is a flowchart depicting the detailed control flow that will properly initialize a method procedure table for a class that may change the association of method procedures to method during the execution of an application using the class. Control commences at terminal block 1500 and immediately flows into function block 1510 where space is allocated for the method procedure table. Enough space is allocated to contain an entry for the address of the class' object and each of the method inherited or defined by the class in accordance with Figure 7. Control then passes to function block 1520 where each method entry in the method procedure table is replaced by i.ts redispatch stub.
Redispatch stubs for inherited arP determined by requesting them from the class' parent c.l.ass. Redispatch stubs for the class are generated by the SOM compiler and supplied to the class initialization procedure in the calls to register each of the class' static method. Control then passes to function block 1.530 where the metlmd procedure table entries for the class' dispatch function aoe replaced by the actual address of the class' dispatch function (it is never correct to have a redispatch stub address in a dispatch function slot as this would result in a infinite loop). Finally control passes to the terminal block 1540 and processing is complete.
While the invention has been described in terms of a preferred embodiment in a specific system environment, those skilled in the art recognize that the invention can be practiced, with modification, i.n other and different AT9-91-074 6~ p 7 7 2 7 2 hardware and software environments within the spirit and scope of the appended claims.
.!

Claims (5)

1. An apparatus for organizing a set of classes, wherein each class in the set of classes has a plurality of methods, each method having a method name and being implemented by a function in a computer memory, comprising:
a) means for initializing a method procedure area in storage to hold method procedure data for each of said plurality of methods for each class in the set of classes, said method procedure area having an identified starting location in said storage;
b) means for defining the function for each of the plurality of methods, the means for defining placing method procedure data at identifiable locations in the method procedure area statically for each class;
c) means for collecting in a specified order an offset value from the starting location of said method procedure area for each of said identifiable locations into a class data structure for each class, wherein collection of the offset values occurs only when said class is initialized by an executing process;
d) means for permitting external access to the class data structure; and e) external program means for accessing said data structure to obtain offsets for a particular method procedures at said identifiable locations in said method procedure area.
2. An apparatus as recited in claim 1, wherein (a) includes means for storing the method procedure area on a disk or other permanent storage medium.
3. An apparatus as recited in claim 1, wherein said means for defining includes means for overriding one or more of said plurality of the methods.
4. An apparatus as recited in claim 1, wherein said means for defining includes means for uniquely differentiating between different ones of the plurality of methods such that each of said plurality of methods is referencable by its original method name.
5. A method for organizing a set of classes, wherein each class in the set of classes has a plurality of methods, each method having a method name and being implemented by a function in a computer memory, the method comprising the steps of:
a) initializing a method procedure area in a computer storage to hold method procedure data for each of said plurality of methods for each class in the set of classes, said method procedure table having an identified starting location in said storage;
b) defining the function for each of the plurality of methods by placing method procedure data at identifiable locations in the method procedure area statically for each class in the set of classes;
c) collecting in a specified order an offset value from said starting location of said method procedure area for each of said identifiable locations into a class data structure for each class in the set of classes, wherein the step of collecting the offset values occurs only when said class is initialized by an executing process; and d) transforming the class data structure for each class into an externally addressable data structure in a computer memory.
CA002077272A 1991-12-12 1992-09-01 Managing class method names Expired - Fee Related CA2077272C (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
US07/805,779 1991-12-12
US07/805,779 US5361350A (en) 1991-12-12 1991-12-12 Object oriented method management system and software for managing class method names in a computer system

Publications (2)

Publication Number Publication Date
CA2077272A1 CA2077272A1 (en) 1993-06-13
CA2077272C true CA2077272C (en) 2000-01-11

Family

ID=25192494

Family Applications (1)

Application Number Title Priority Date Filing Date
CA002077272A Expired - Fee Related CA2077272C (en) 1991-12-12 1992-09-01 Managing class method names

Country Status (6)

Country Link
US (1) US5361350A (en)
EP (1) EP0546809A3 (en)
JP (1) JPH05241844A (en)
KR (1) KR950007883B1 (en)
CN (1) CN1096637C (en)
CA (1) CA2077272C (en)

Families Citing this family (70)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US5481708A (en) * 1992-06-05 1996-01-02 Borland International, Inc. System and methods for optimizing object-oriented compilations
US5404525A (en) * 1992-09-30 1995-04-04 International Business Machines Corporation Efficient method router that supports multiple simultaneous object versions
US5459860A (en) * 1992-10-05 1995-10-17 International Business Machines Corporation Computerized system and process for managing a distributed database system
US6209040B1 (en) * 1992-10-09 2001-03-27 Microsoft Corporation Method and system for interfacing to a type library
US5649131A (en) * 1992-12-30 1997-07-15 Lucent Technologies Inc. Communications protocol
JPH06214865A (en) * 1993-01-12 1994-08-05 Fujitsu Ltd Object base data processor
JP3178151B2 (en) * 1993-03-19 2001-06-18 富士ゼロックス株式会社 Message Oriented Message Compiling Device
US6378003B1 (en) * 1993-04-05 2002-04-23 International Business Machines Corporation Method and system for deriving metaclasses in an object oriented system
JPH06332786A (en) * 1993-05-25 1994-12-02 Fujitsu Ltd Data processing system with composite object
JPH0713766A (en) * 1993-06-14 1995-01-17 Internatl Business Mach Corp <Ibm> Object-oriented computer system and object class management method
US5911076A (en) * 1993-06-14 1999-06-08 International Business Machines Corporation Object oriented framework for creating new emitters for a compiler
US5603031A (en) * 1993-07-08 1997-02-11 General Magic, Inc. System and method for distributed computation based upon the movement, execution, and interaction of processes in a network
US6684261B1 (en) * 1993-07-19 2004-01-27 Object Technology Licensing Corporation Object-oriented operating system
US5379432A (en) 1993-07-19 1995-01-03 Taligent, Inc. Object-oriented interface for a procedural operating system
JP2986051B2 (en) * 1993-08-04 1999-12-06 インターナショナル・ビジネス・マシーンズ・コーポレイション Object oriented computer system and object execution method
US5710926A (en) * 1993-09-03 1998-01-20 Maurer; Joseph Clark Developers tool for object-oriented programming
US5463769A (en) * 1993-12-15 1995-10-31 International Business Machines Corporation Method and apparatus using dictionary of methods and states for high performance context switching between build and run modes in a computer application builder program
US5522071A (en) * 1994-01-18 1996-05-28 Sybase, Inc. Run-time message redirection for invoking object oriented methods based on alternate dispatch variable
US5761511A (en) * 1994-01-28 1998-06-02 Sun Microsystems, Inc. Method and apparatus for a type-safe framework for dynamically extensible objects
CA2130065C (en) * 1994-08-12 1999-03-02 Michael Joel Cincinatus Utilizing pseudotables as a method and mechanism for providing database monitor information
US5675801A (en) * 1994-09-30 1997-10-07 International Business Machines Corporation Object oriented system and method for generating target language code
US5581755A (en) * 1995-01-31 1996-12-03 Unisys Corporation Method for maintaining a history of system data and processes for an enterprise
US6341276B1 (en) 1995-03-01 2002-01-22 Ibm Corporation System for selecting a computer solution from a pre-defined set
US6715148B1 (en) 1995-04-03 2004-03-30 International Business Machines Corporation Efficient method router that supports multiple simultaneous object versions
US5727212A (en) * 1995-04-12 1998-03-10 International Business Machines Corporation Object oriented device driver system for procedural device drivers
US5764991A (en) * 1995-06-30 1998-06-09 Canon Kabushiki Kaisha Processing object oriented code and virtual function code
US5758348A (en) * 1995-07-25 1998-05-26 Unisys Corp. Method for generically manipulating properties of objects in an object oriented repository
US5911070A (en) * 1995-08-07 1999-06-08 Inprise Corporation Development system with methods for bi-directional application program code generation
US5724589A (en) * 1995-10-13 1998-03-03 Borland International, Inc. Development system with a property-method-event programming model for developing context-free reusable software components
US6003037A (en) * 1995-11-14 1999-12-14 Progress Software Corporation Smart objects for development of object oriented software
US5764958A (en) * 1995-11-30 1998-06-09 International Business Machines Corporation Method and apparatus for creating dynamic roles with a system object model
US5794030A (en) * 1995-12-04 1998-08-11 Objectivity, Inc. System and method for maintenance and deferred propagation of schema changes to the affected objects in an object oriented database
US5983019A (en) * 1996-03-18 1999-11-09 Tandem Computers Incorporated Method and system for providing interpretive access to an object system
US5778355A (en) * 1996-06-11 1998-07-07 International Business Machines Corp. Database method and apparatus for interactively retrieving data members and related members from a collection of data
US5953528A (en) * 1996-10-30 1999-09-14 Electronic Data Systems Corporation Knowledge object registration
US5860088A (en) * 1996-12-06 1999-01-12 International Business Machines Corporation Method for extraction of a variable length record from fixed length sectors on a disk drive
CA2194020C (en) 1996-12-24 2002-02-05 Kevin Paul Hickman Minimizing debug information for global types in compiled languages
CA2194021A1 (en) * 1996-12-24 1998-06-24 Kevin Paul Hickman Binary class library with debugging support
US5907707A (en) * 1997-01-14 1999-05-25 International Business Machines Corporation Object model for Java
US6845505B1 (en) 1997-02-03 2005-01-18 Oracle International Corporation Web request broker controlling multiple processes
US6225995B1 (en) 1997-10-31 2001-05-01 Oracle Corporaton Method and apparatus for incorporating state information into a URL
US6026404A (en) * 1997-02-03 2000-02-15 Oracle Corporation Method and system for executing and operation in a distributed environment
US6247056B1 (en) 1997-02-03 2001-06-12 Oracle Corporation Method and apparatus for handling client request with a distributed web application server
US6710786B1 (en) 1997-02-03 2004-03-23 Oracle International Corporation Method and apparatus for incorporating state information into a URL
US5920720A (en) * 1997-02-25 1999-07-06 Microsoft Corporation Efficient computer based virtual machine object structure
US6298389B1 (en) * 1997-06-20 2001-10-02 Compaq Computers, Inc. Method for input and output of structures for the Java language
US6119122A (en) * 1997-09-17 2000-09-12 Novell, Inc. Method and apparatus for generically viewing and editing objects
US5983234A (en) * 1997-09-17 1999-11-09 Novell, Inc. Method and apparatus for generically viewing and editing objects
US6385660B2 (en) 1997-10-06 2002-05-07 Sun Microsystems, Inc. Site specific message dispatch in object-oriented systems
US6317796B1 (en) * 1997-10-06 2001-11-13 Sun Microsystems, Inc. Inline database for receiver types in object-oriented systems
US6334114B1 (en) 1997-10-31 2001-12-25 Oracle Corporation Method and apparatus for performing transactions in a stateless web environment which supports a declarative paradigm
US6219632B1 (en) * 1997-11-20 2001-04-17 International Business Machines Corporation System for the facilitation of supporting multiple concurrent languages through the use of semantic knowledge representation
US6349275B1 (en) * 1997-11-24 2002-02-19 International Business Machines Corporation Multiple concurrent language support system for electronic catalogue using a concept based knowledge representation
US6070168A (en) * 1997-12-31 2000-05-30 Nortel Networks Corporation Platform-independent object memory manager
US6061520A (en) * 1998-04-07 2000-05-09 Sun Microsystems, Inc. Method and system for performing static initialization
US6708181B1 (en) * 1998-09-01 2004-03-16 International Business Machines Corporation System and method for initializing variables in an object-oriented program
US6163794A (en) 1998-10-23 2000-12-19 General Magic Network system extensible by users
US6510551B1 (en) * 1998-12-22 2003-01-21 Channelpoint, Inc. System for expressing complex data relationships using simple language constructs
US7024657B2 (en) * 2000-02-21 2006-04-04 Matsushita Electric Industrial Co., Ltd. Program generation apparatus for program execution system, replaces variable name in each class file by assigned offset number so that same offset numbers are assigned to non-dependent variables with same variable name
US6851114B1 (en) * 2000-11-06 2005-02-01 Sun Microsystems, Inc. Method for improving the performance of safe language multitasking
US8762415B2 (en) * 2003-03-25 2014-06-24 Siebel Systems, Inc. Modeling of order data
US7720794B2 (en) * 2003-08-05 2010-05-18 International Business Machines Corporation Identifying resource and data instances in management systems
US7617239B2 (en) * 2004-05-21 2009-11-10 Siebel Systems, Inc. Modeling of activity data
US7984416B2 (en) * 2006-03-24 2011-07-19 The Mathworks, Inc. System and method for providing class definitions in a dynamically typed array-based language
US8966456B2 (en) * 2006-03-24 2015-02-24 The Mathworks, Inc. System and method for providing and using meta-data in a dynamically typed array-based language
CN101286880B (en) * 2008-05-07 2010-09-01 中兴通讯股份有限公司 Method and apparatus for managing object's creation
US9170825B2 (en) * 2011-04-21 2015-10-27 Oracle International Corporation Interface method resolution for virtual extension methods
FR3087026A1 (en) * 2018-10-04 2020-04-10 Movida Production METHOD FOR GENERATING A BINDING BETWEEN A C / C ++ LIBRARY AND AN INTERPRETED LANGUAGE, AND IMPLEMENTATION OF THIS METHOD FOR THE TRANSFORMATION OF A THREE-DIMENSIONAL MODEL (3D)
US11436039B2 (en) 2019-05-04 2022-09-06 Prasaga Foundation Systemic extensible blockchain object model comprising a first-class object model and a distributed ledger technology
US20200402084A1 (en) 2019-06-03 2020-12-24 Cerebri AI Inc. Object-oriented ai modeling

Family Cites Families (12)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US4558413A (en) * 1983-11-21 1985-12-10 Xerox Corporation Software version management system
US4885717A (en) * 1986-09-25 1989-12-05 Tektronix, Inc. System for graphically representing operation of object-oriented programs
US4791558A (en) * 1987-02-13 1988-12-13 International Business Machines Corporation System and method for generating an object module in a first format and then converting the first format into a format which is loadable into a selected computer
US5206951A (en) * 1987-08-21 1993-04-27 Wang Laboratories, Inc. Integration of data between typed objects by mutual, direct invocation between object managers corresponding to object types
US4953080A (en) * 1988-04-25 1990-08-28 Hewlett-Packard Company Object management facility for maintaining data in a computer system
US5041992A (en) * 1988-10-24 1991-08-20 University Of Pittsburgh Interactive method of developing software interfaces
US4989132A (en) * 1988-10-24 1991-01-29 Eastman Kodak Company Object-oriented, logic, and database programming tool with garbage collection
US5075847A (en) * 1989-05-26 1991-12-24 Hewlett-Packard Company Method and apparatus for computer program encapsulation
US5555427A (en) * 1989-12-26 1996-09-10 Fujitsu Limited Distributed processing in a system of computers at terminals connected by a communication network
JPH03257624A (en) * 1990-03-08 1991-11-18 Fujitsu Ltd Screen language system
US5280610A (en) * 1990-08-14 1994-01-18 Digital Equipment Corporation Methods and apparatus for implementing data bases to provide object-oriented invocation of applications
US5265206A (en) * 1990-10-23 1993-11-23 International Business Machines Corporation System and method for implementing a messenger and object manager in an object oriented programming environment

Also Published As

Publication number Publication date
US5361350A (en) 1994-11-01
KR930014001A (en) 1993-07-22
CA2077272A1 (en) 1993-06-13
CN1096637C (en) 2002-12-18
KR950007883B1 (en) 1995-07-21
EP0546809A2 (en) 1993-06-16
JPH05241844A (en) 1993-09-21
CN1073540A (en) 1993-06-23
EP0546809A3 (en) 1993-11-18

Similar Documents

Publication Publication Date Title
CA2077272C (en) Managing class method names
CA2077273C (en) Language neutral objects
US5421016A (en) System and method for dynamically invoking object methods from an application designed for static method invocation
US5418964A (en) System and method for parent class shadowing in a statically linked object hierarchy
US5493680A (en) Method for creating an object subclass with selective inheritance
US5339438A (en) Version independence for object oriented programs
US5692195A (en) Parent class shadowing
Roberts et al. A refactoring tool for Smalltalk
EP0664903B1 (en) Loader system
US6378003B1 (en) Method and system for deriving metaclasses in an object oriented system
US6209040B1 (en) Method and system for interfacing to a type library
Oberleitner et al. The Vienna Component Framework enabling composition across component models
EP2080094A2 (en) System and method for interoperating with foreign objects from a single language computing environment
Thirunarayan et al. Simulating multiple inheritance and generics in Java
Konstantas et al. An implementation of Hybrid, a concurrent object-oriented language
Hlopko et al. Towards a Runtime Code Update in Java.
Broughton et al. Designing system software for parallel declarative systems
Singer et al. Plugins
Hampapuram Simulating Multiple Inheritance and Generics in Java Krishnaprasad Thirunarayan Dept. of Computer Science and Engr. Wright State Univ., Dayton, OH-45435.(email: tkprasad@ cs. wright. edu)
Pucella The design of a COM-oriented module system
Ezzio Enhanced Classes and Managed Fields
Artzi et al. Using predicate fields in a highly flexible industrial control system
Li et al. Data Modeling in Java
UNIT et al. CS 2203 OBJECT-ORIENTED PROGRAMMING 3 0 0 3
Sessions et al. INTERNATIONAL BUSINESS MACHINES CORPORATION.

Legal Events

Date Code Title Description
EEER Examination request
MKLA Lapsed