Techniques to manage a file are described. An apparatus may comprise a file system interface for a client to receive a request for a file having a file name. The client may generate a unique identifier for the file name in response to the request using a stream cone messaging system, with the unique identifier to represent the file name and comprising a fewer number of bits than the file name. An interconnect system connected to the client may communicate the unique identifier and file name to the server. Other embodiments are described and claimed.
|
9. A computer-implemented method to represent a file name with an identifier to improve performance of an interconnect system, comprising:
receiving a file request having a file name by a file system interface for a client;
generating an identifier for said file name using a stream cone messaging system;
sending said identifier and said file name to a server;
searching for location information using said file name; and
storing said location information with said identifier.
6. A computer-implemented method to represent a file name with an identifier to improve performance of an interconnect system, comprising:
receiving a first request from a client at a server to access a file having a file name and identifier, said identifier to represent said file name and to comprise a fewer number of bits than said file name, with said identifier generated by a client in response to said first request using a stream cone messaging system; and
sending an acknowledgement message to said client.
11. A computer-implemented method to represent a file name with an identifier to improve performance of an interconnect system, comprising:
receiving a file request with a file name by a file system interface for a client;
generating an identifier for said file name by said file system interface in response to said first request using a stream cone messaging system, said unique identifier to represent said file name and comprise a fewer number of bits than said file name; and
sending said unique identifier and file name to a file system manager.
1. A computer-implemented method to represent a file name with an identifier to improve performance of an interconnect system, comprising:
receiving a first request by a file system interface for a client to access a file having a file name;
generating an identifier for said file name by said client in response to said first request using a stream cone messaging system, with said identifier to represent said file name and comprise a fewer number of bits than said file name; and
sending said first request to a server with said identifier and said file name.
21. An apparatus to represent a file name with an identifier to improve performance of an interconnect system, comprising:
a file interface system for a client to generate an identifier for a file name in response to a file request using a stream cone messaging system, said identifier to represent said file name and comprise a fewer number of bits than said file name;
a server to locate file information using said file name and store said file information using said identifier; and
an interconnect system to transport said file name and said identifier between said client and said server.
19. An apparatus to represent a file name with an identifier to improve performance of an interconnect system, comprising:
a file system interface for a client to receive a request for a file having a file name, said client to generate a unique identifier for said file name in response to said request using a stream cone messaging system, said unique identifier to represent said file name and comprise a fewer number of bits than said file name, and send said unique identifier and said file name to a server; and
an interconnect system connected to said client to communicate said unique identifier and said file name to said server.
25. An apparatus to represent a file name with an identifier to improve performance of an interconnect system, comprising:
a file system interface for a client to receive a request for a file having a file name and generate a unique identifier for said file name in response to said request using a stream cone messaging system, said identifier to represent said file name and comprise a fewer number of bits than said file name;
a file system manager to locate file information using said file name and store said file information using said unique identifier; and
a communications system to communicate said unique identifier and said file name between said file system interface and said file system manager.
13. A computer-readable medium tangibly embodied with software for execution by a computer to represent a file name with an identifier to improve performance of an interconnect system, comprising:
a storage medium;
said storage medium including stored instructions that, when executed by a processor, result in receiving a first request by a file system interface for a client to access a file having a file name, generating an identifier for said file name by said client in response to said first request using a stream cone messaging system, with said identifier to represent said file name and comprise a fewer number of bits than said file name, and sending said first request to a server with said identifier and said file name.
17. A computer-readable medium tangibly embodied with software for execution by a computer to represent a file name with an identifier to improve performance of an interconnect system, comprising:
a storage medium;
said storage medium including stored instructions that, when executed by a processor, result in receiving a file request having a file name by a file system interface for a client, generating an identifier for said file name by said client in response to said first request using a stream cone messaging system, said identifier to represent said file name and comprise a fewer number of bits than said file name, sending said identifier and said file name to a server, searching for location information using said file name, and storing said location information with said identifier.
4. The method of
receiving a second request at said client to access said file;
retrieving said identifier associated with said file name from said memory; and
sending said second request to said server using said associated identifier.
7. The method of
searching for location information for said file;
associating said location information with said identifier; and
storing said location information and said identifier in memory.
8. The method of
receiving a second request at said server to access said file using said identifier; and
retrieving said location information from said memory using said identifier.
12. The method of
receiving said unique identifier and said file name at said file system manager;
searching for file information using said file name; and
storing said file information using said unique identifier.
14. The article of
15. The article of
16. The article of
18. The article of
20. The apparatus of
24. The apparatus of
26. The apparatus of
a communications medium comprising at least one of a group comprising twisted pair wire, co-axial cable, fiber optic and radio-frequencies; and
a communications interface to operate in accordance with a set of communication protocols.
|
|||||||||||||||||||||||||
This disclosure relates to computer and communication systems. More particularly, it relates to methods and apparatus to improve file management within a computer and communication system.
Computer and communications systems are frequently similar in architecture. Each system may comprise a number of separate components each designed to perform certain functions. The components may communicate information to other components over an interconnect system. An interconnect system operates to manage the transfer of information over a communications medium, such as metal leads, twisted-pair wire, co-axial cable, fiber optics, radio frequencies and so forth. Communications between components typically help coordinate operations of the individual components so that they may act as a cohesive system. This type of distributed system architecture may provide certain advantages in terms of performance, redundancy, scalability and efficiency.
There are disadvantages, however, associated with this type of system design. One disadvantage is that a component may have to remain idle as it waits for information from another component. Idle time may represent an inefficient use of system resources. Another disadvantage is that functionality may be allocated to components in a manner that increases the amount of information communicated between components. This increase in communications increases demands on the finite resources of the interconnect system.
The subject matter regarded as embodiments of the invention is particularly pointed out and distinctly claimed in the concluding portion of the specification. Embodiments of the invention, however, both as to organization and method of operation, together with objects, features, and advantages thereof, may best be understood by reference to the following detailed description when read with the accompanying drawings in which:
In the following detailed description, numerous specific details are set forth in order to provide a thorough understanding of the embodiments of the invention. It will be understood by those skilled in the art, however, that the embodiments of the invention may be practiced without these specific details. In other instances, well-known methods, procedures, components and circuits have not been described in detail so as not to obscure the embodiments of the invention.
Embodiments of the invention may improve performance of a distributed system by reducing idle time for distributed components as well as bandwidth demands for the interconnect system. More particularly, one embodiment of the invention may improve performance of a distributed system used for file management. Consequently, this may reduce delays associated with file operations. Accordingly, a user may benefit in terms of more responsive applications and services.
A file management system typically comprises a client and a server. A client in this context may refer to a requester of services. A server in this context may refer to a provider of services. The client typically sends a file request to a server over an interconnect system. The file request may be in the form of a message, and may include a function request and a file name. A message in this context may comprise one or more alphanumeric characters, symbols or logical expressions that when combined represent, for example, control words, commands, instructions, information or data. The message could vary in composition from a single bit to entire phrases, for example. The server associates a unique identifier with the file name, identifies location information for the file, and stores it with the unique identifier. The server then sends the unique identifier back to the client. The client receives the unique identifier and uses it in lieu of the file name for subsequent file requests.
A unique identifier is assigned to a file name to reduce bandwidth demands on the interconnect systems. A file name may comprise a number of alphanumeric characters or symbols (“character string”), for example. Each character or symbol is converted to one or more bits, typically with 8 bits (e.g., 1 byte) per character. Since a file name may comprise many characters, the interconnect system may have to transport a relatively large number of bits. To reduce this problem, the server may assign a unique identifier to each file name and sends the unique identifier to the client. The unique identifier is typically smaller in length than the file name. For example, a unique identifier may have a length of 32 or 64 bits. The client may then use the unique identifier for subsequent file requests.
There are disadvantages, however, to having the server assign a unique identifier to a file name. One disadvantage is that the client may have to remain idle as it waits for the unique identifier prior to processing subsequent file request. Another disadvantage is that the client and server may need to communicate more information than necessary, thereby increasing demands on the interconnect system.
With respect to the first disadvantage, the client may have to remain idle as it waits for the unique identifier from the server. To initiate the assignment process, the client sends a message to the server requesting assignment of a unique identifier to a file name. The server associates a unique identifier with the file name, identifies location information for the file, and stores it with the unique identifier. The server then sends a message with the unique identifier back to the client. While waiting to receive the unique identifier from the server, the client may receive subsequent file requests with the same file name. The client may not be able to begin processing these file requests until the entire assignment process is completed. As a result, the client may be forced to remain idle during this time period.
With respect to the second disadvantage, the client and server may need to communicate unnecessary information to perform the assignment function, thereby increasing demands on the interconnect system. A file management system as described above requires at least two messages. The client sends a first message to the server requesting assignment of a unique identifier to a file name. The server sends a second message to the client with the unique identifier. Each message requires use of a certain amount of bandwidth from the interconnect system. Bandwidth in this context may refer to the speed at which information can be transferred over an interconnect system, and is typically measured in kilobits per second (kbps). By way of contrast, one embodiment of the invention may perform the assignment process using only one message, thereby potentially reducing bandwidth demands on the interconnect system by as much as 50%.
Embodiments of the invention may improve performance of a distributed system by reducing idle time for a client as well as bandwidth demands for the interconnect system. One embodiment of the invention assigns a unique identifier to a file name at the client, and sends the unique identifier to the server. This may reduce client idle time since the client may begin processing subsequent file requests without having to wait for a message from the server. This may also reduce bandwidth demands since the server does not need to send a message back to the server to complete the assignment process, or alternatively, may send a message that is shorter than those needed by previous file management systems.
It is worthy to note that any reference in the specification to “one embodiment” or “an embodiment” means in this context that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification do not necessarily all refer to the same embodiment.
Referring now in detail to the drawings wherein like parts are designated by like reference numerals throughout, there is illustrated in
Processor 202 can be any type of processor capable of providing the speed and functionality desirable for various embodiments of the invention. For example, processor 202 could be a processor from a family of processors made by Intel Corporation, Motorola, Compaq or Sun Microsystems. In one embodiment of the invention, processor 202 may be a dedicated processor to manage input/output (I/O) devices, such as hard drives, keyboards, printers, network interface cards and so forth. This processor is typically referred to as an I/O processor (IOP).
In one embodiment of the invention, memory 204 comprises a machine-readable medium and may include any medium capable of storing instructions adapted to be executed by a processor. Some examples of such media include, but are not limited to, read-only memory (ROM), random-access memory (RAM), programmable ROM, erasable programmable ROM, electronically erasable programmable ROM, dynamic RAM, magnetic disk (e.g., floppy disk and hard drive), optical disk (e.g., CD-ROM) and any other media that may store digital information. In one embodiment of the invention, the instructions are stored on the medium in a compressed and/or encrypted format. As used herein, the phrase “adapted to be executed by a processor” is meant to encompass instructions stored in a compressed and/or encrypted format, as well as instructions that have to be compiled or installed by an installer before being executed by the processor. Further, client 200 may contain various combinations of machine-readable storage devices through various I/O controllers, which are accessible by processor 202 and which are capable of storing a combination of computer program instructions and data.
Memory 204 may store and allow execution by processor 202 of program instructions and data to implement the functions of a client, such as client 106 and client 200. In one embodiment of the invention, memory 204 includes a set of program instructions that will be collectively referred to herein as a file system interface 206.
File system interface 206 may be an interface that operates to provide access to one or more files for system 100. An interface in this context may refer to a defined protocol by which one software module may access functionality from another software module. A file in this context refers to a discrete set of data stored in memory, such as in memory 204 or a hard drive. File system interface 206 may receive a request to perform certain operations for a file, such as create, open, seek, read, write, rename, delete, copy, move, and so forth. The request may originate from a host OS or an application program, for example. A host OS may comprise an OS for a system. For example, if an embodiment of the invention was implemented as part of a personal computer, the host OS might comprise an OS sold by Microsoft Corporation, such as Microsoft Windows® 95, 98, 2000 and NT, for example.
In one embodiment of the invention file system interface 206 operates as an Operating System Service Module (OSM) as defined by the Intelligent I/O Specification (I2O) developed by the I2O Special Interest Group (SIG) (I2O SIG), version 1.5,adopted in April of 1997,and available from “www.i20sig.org” (“I2O Specification”), although the invention is not limited in scope in this respect.
By way of background, the I2O Specification defines a standard architecture for intelligent I/O that is independent of both the specific device being controlled and the host operating system (OS). Intelligent I/O in this context refers to moving the function of processing low-level interrupts from a central processing unit (CPU) or other processor to I/O processors (IOPs) designed specifically to provide processing for I/O functions. This may improve I/O performance as well as permit the CPU or other processor to provide processing functionality for other tasks. An interrupt in this context refers to a request to access an I/O device, such as a hard drive, floppy disk drive, printer, monitor, keyboard, network interface card (NIC) and so forth.
The I2O Specification describes an OSM, an Intermediate Services Module (ISM) and a Hardware Device Module (HDM). The OSM may be a driver that operates as an interface between a host OS and an ISM. A driver in this context refers to a set of program instructions that manage operations of a particular component, device or software module. The ISM may operate as an interface between the OSM and a Hardware Device Module (HDM). The ISM may perform specific functionality for I/O management functions, network protocols or peer-to-peer functionality such as background archiving, for example. The HDM may be a driver that operates to control a particular I/O device.
The I2O Specification defines a communications model that comprises a message-passing system. The OSM, ISM and HDM communicate and coordinate operations by passing information in the form of messages through a message layer. A message layer in this context may manage and dispatch requests, provide a set of Application Programming Interfaces (APIs) for delivering messages, and provide a set of support routines to process messages.
In one embodiment of the invention, file system interface 206 operates as an OSM in accordance with the I2O Specification. In one embodiment of the invention, file system interface 206 receives file requests from an application program via the host OS, translates the request into a message in accordance with the I2O Specification, and sends it to a file system manager (described below) for processing. An application program in this context refers to a program that provides a predetermined set of functions for specialized tasks, typically having a user interface to facilitate the processing of commands and instructions between a user and the computer system. Examples of application programs might include a word processor, spread sheet, database or Internet browser.
Interface 208 may comprise any suitable technique for controlling communication signals between computer or network devices using a desired set of communications protocols, services and operating procedures, for example. In one embodiment of the invention, interface 208 may operate, for example, in accordance with the PCI Specification and the I2O Specification. In another embodiment of the invention, interface 208 may operate in accordance with the Transmission Control Protocol (TCP) as defined by the Internet Engineering Task Force (IETF) standard 7, Request For Comment (RFC) 793,adopted in September, 1981,and the Internet Protocol (IP) as defined by the ETF standard 5,RFC 791, adopted in September, 1981,both available from “www.ietf.org.” Although interface 208 may operate with in accordance with the above described protocols, it can be appreciated that interface 208 may operate with any suitable technique for controlling communication signals between computer or network devices using a desired set of communications protocols, services and operating procedures, for example, and still fall within the scope of the invention.
Interface 208 also includes connectors for connecting interface 208 with a suitable communications medium. Interface 208 may receive communication signals over any suitable medium such as copper leads, twisted-pair wire, co-axial cable, fiber optics, radio frequencies, and so forth. In one embodiment of the invention, the connectors are suitable for use with a bus to carry signals that comply with the PCI Specification.
In one embodiment of the invention, memory 304 contains program instructions for a file system manager 306. File system manager 306 performs file management and provides access to a storage medium (not shown) containing a plurality of files. File system 306 performs file operations such as create, open, seek, read, write, rename, delete, copy, move, and so forth, in response to file requests received from file system interface 206. One example of file system interface 206 includes an ISM operating in accordance with the I2O Specification, although the scope of the invention is not limited in this respect.
The operation of systems 100, 200 and 300 will be described in more detail with reference to
As shown in
Once the client assigns an identifier to a file, the identifier is used for future requests for the file. The client receives a second request at the client to access the file. The client retrieves the identifier associated with the file name from memory. The client sends the second request to the server using the associated identifier.
As shown in
Once the server indexes the location information for a file using the identifier, the server can use the identifier to access the location information for subsequent file requests. The server receives a second request to access the file having the identifier. The server retrieves the location information from memory using the identifier.
The operation of systems 100, 200 and 300, and the flow diagrams shown in
File system manager 306 receives the message over connection 104. File system manager 306 parses the message and invokes the function “identify (test file one, A123).” The term parses in this context refers to separating individual characters or sub-sets of characters from the message that represent, for example, commands, control words, file names, data, function calls, sub-routine names, flags and so forth. The term “invokes” in this context refers to a command sent to the processor to begin executing program instructions associated with a given function or sub-routine. This function takes as inputs “test file one” and “A123,” and informs file system manager 306 that the file name “test file one” will be referenced in subsequent file requests as “A123.” This may be accomplished by updating a lookup table in memory by storing the file name and unique identifier together as corresponding or linked terms, that is, one may be found by searching for the other. File system manager 306 searches for location information for file “A123,” which is typically located on a storage device such as a hard drive. Examples of location information may include addressing information, device, cylinder number and track number, although the invention is not limited in scope in this respect. File system manager 306 associates the location information with identifier “A123,” and stores the location information with identifier “A123” in a lookup table in memory 304. File system manager 306 sends an acknowledgement message to file system interface 206 that the file name identifier and location information have been received. An acknowledgement message in this context refers to a short message indicating that a previous message was received. The acknowledgement message may comprise a single bit, character, word or phrase, as desired by a particular system.
Subsequent file requests received by file system manager 306 will then use identifier “A123” when requesting operations for file name “test file one.” For example, file system interface 206 receives a second request to perform a “delete” operation for “test file one.” File system interface 206 retrieves the previously associated identifier “A123” for “test file one” from memory. File system interface 206 sends a message “delete(‘A123’)” to file system manager 306. File system manager 306 receives the message “delete(‘A123’)” and retrieves the location information for file name “test file one” using the identifier “A123.” File system manager 306 then performs the requested file operation using the retrieved location information.
In one embodiment of the invention, file system interface 206 may be implemented as an OSM in accordance with the I2O Specification and a particular host OS, such as the Linux OS version 2.3.99 pre-3 kernel available from “www.kernel.org” (“Linux Kernel”). In this embodiment of the invention, the OSM may further comprise a stream forest OSM, a stream tree OSM, and a class specification. A class in this context may refer to a specific interface definition. A tree in this context may refer to a collection of storage objects called cones. An object in this context may refer to an instance of a class. A cone in this context may refer to a storage object that supports read, write and lock capabilities, for example. A forest in this context may refer to a collection of trees.
In this embodiment of the invention, the stream forest OSM may be used to model a collection of file systems. The stream forest OSM may provide file naming operations, such as creating a name, erasing a name, or renaming a particular forest, for example. Further, open and close operations may also be supported. The tree OSM may be used to model a particular file system. A file may be modeled as a cone. The stream forest OSM may also function to support file operations, such as to name a file, rename it, erase it, lock it from change, read it or write it, for example.
The OSM may be designed to communicate with an ISM. The ISM may further comprise a stream forest ISM and a stream tree ISM. The stream forest ISM may support the file system naming capability of the OSM. In one embodiment of the invention, the stream tree ISM may support stream cone identifiers with lengths of 28 characters. The stream tree ISM may also support 216 open stream cones, as well as 232 possible stream cones. The tree ISM may support 264 bytes for all contained stream cones. It can be appreciated that these values do not limit the scope of the invention in this respect.
In operation, the stream tree OSM, stream forest OSM, stream tree ISM and stream forest ISM may all communicate using a messaging scheme in accordance with a class specification as discussed below. This messaging scheme will be referred to as a streaming messaging scheme, and will be discussed in further detail below. A host OS may use the functionality provided by the stream forest OSM and stream tree OSM. The host OS may use the stream forest OSM to model a grouping of file systems, and the stream tree OSM to model a particular file system, for example. The stream forest OSM may use the stream forest ISM to manage groupings of file systems within an IRTOS environment. The stream tree OSM may use the stream tree ISM to manage a file system within an I2O Real-Time Operating System (IRTOS) environment. The stream forest OSM and stream tree OSM may communicate with the stream forest OSM and stream tree ISM, respectively, using the stream messaging scheme. This embodiment of the invention will be further described with reference to FIG. 7.
The file system interface communicates with a file system manager over a bus 614 that communicates signals in accordance with the PCI Specification. The file system manager may comprise a stream forest ISM 616, a stream tree ISM 618, a Redundant Array of Inexpensive Disks (RAID) ISM 620, a Small Computer System Interface (SCSI) HDM 622 and IRTOS 624.
In this embodiment of the invention, the modules shown in system 600 may be implemented using the C programming language, although the scope of the invention is not limited in this respect. Further, in this embodiment of the invention modules shown in system 600 support identifiers having a length of 255 characters.
Stream tree OSM 608 may be configured to provide access to a typical file system. Stream tree OSM 608 may be configured to support one or more Linux VFS required functions, as defined by the Linux Specification. Stream tree OSM 608 may be configured to support stream tree class messages, as discussed in more detail below. Stream tree OSM 608 may be configured to operate with Linux OS 604 using, for example, the Linux Kernel. Stream tree OSM 608 may support a stream tree ISM, such as stream tree ISM 618.
Stream forest OSM 602 may provide the function loctl( ) kernel interface. Stream forest OSM 602 may function to create a stream tree within a stream forest, using a function name such as “IOCTL_SF_TREECREATE.” This function may accept as inputs, for example, an input buffer defined in the C language as follows:
struct ik_sf_treecreate {
U32 SizeInBlocks;
char name[256];
}.
Stream forest OSM 602 may also function to rename an existing stream tree, using a function name such as “IOCTL_SF_TREERENAME.” This function may accept as inputs, for example, an input buffer defined in the C language as follows:
struct ik_sf_treerename {
char IdentifierBeforeRename [256];
char IdentifierAfterRename [256];
}.
Stream forest OSM 602 may also function to erase an existing stream tree, using a function name such as “IOCTL_SF_TREEERASE.” This function may accept as inputs, for example, an input buffer defined in the C language as follows:
struct ik_sf_treeerase {
char IdentifierToErase[256];
}.
Stream forest OSM 602 may use one or more of the following data structures. A data structure referred to herein as a “super block” may be used to represent the initial “inode” of a file system. An “inode” in this context may refer to a file node of the file system. A super block operation list may be a grouping of functions used to manipulate the super block. An inode record data structure may be used to represent each file node of the file system. An inode operation list may be a grouping of functions used to manipulate an inode. A file record data structure may be used to represent an abstract file within a file system. A file operation list may be used to support file operations. All of these data structures combined with operation list operations may be used to represent a file system.
Stream tree class messages may be issued for several of the data structures. A stream tree class message may be issued, for example, for the inode operations create, lookup, make directory (“mkdir”), remove directory (“rmdir”), and rename directory. A stream tree class message may be issued for various file operations, such as open, read, write, seek, and close.
Stream forest OSM 602 may register the contained file system with the identifier “i2ofs,” for example, within the Linux kernel. Stream forest OSM 602 may use the NULL identifier for the root tree cone container, for example. Stream forest OSM 602 may use the identifier ‘.’ for the current tree cone container, for example. Stream forest OSM 602 may use the identifier ‘..’ for the parent tree cone container, for example.
System 600 may contain system descriptions for one or more of the following modules:
System 600 may also provide the function VFS i2ofs_read super (struct super_block *sb, void *options, int silent). This function may accept the inputs as defined in Table 1.
TABLE 1
Variable
Variable Type
Identifier
Description
Struct
Sb
This input may specify the location where
super_block*
the super block should be set.
Void*
Options
This input may specify the options passed by
mount.
int
Silent
This input may specify if the mount
operation is silent.
This function sets the values in the super block structure to 0.The following variables may be set as follows:
The inode may be set to zero, with various associated variables having the following settings:
struct super_block {
struct list_head s_list;
kdev_t s_dev;
unsigned long s_blocksize;
unsigned long s_blocksize_bits;
unsigned char s_lock;
unsigned char s_dirt;
struct file_system_type *s_type;
struct super_operations *s_op;
struct dquot_operations *dq_op;
unsigned long s_flags;
unsigned long s_magic;
struct dentry *s_root;
wait_queue_head_t s_wait;
struct inode *s_ibasket;
short int s_ibasket_count;
short int s_ibasket_max;
struct list_head s_dirty;
struct list_head s_files;
struct block_device *s_bdev;
}.
The variable super_block->s_op may contain the following C functions and provide access to the super block.
struct super_operations {
void
(*read_inode) (struct inode *);
void
(*write_inode) (struct inode *)
void
(*put_inode) (struct inode *);
void
(*delete_inode) (struct inode *);
void
(*put_super) (struct super_block *);
void
(*write_super) (struct super_block *);
void
(*statfs) (struct super_block *, s6truct statfs *);
int
(*remount_fs) (struct super_block *, int *, char *);
void
(*clear_inode) (struct inode);
void
(*umount_begin) (struct super_block *);
}.
An example of an inode interface may be as follows:
struct inode {
struct list-head i_hash;
struct list_head i_list;
struct list_head i_dentry;
unsigned long i_ino;
unsigned int i_count;
kdev_t i_dev;
umode_t i_mode;
nlink_t i_nlink;
uid_t i_uid;
gid_t i_gid;
kdev_t i_rdev;
loff_t I_size;
time_t I_atime;
time_t I_mtime;
time_t I_ctime;
unsigned long I_blksize;
unsigned long I_blocks;
unsigned long I_version;
struct semaphore I_sem;
struct semaphore I_zombie;
struct inode_operations *I_op;
struct file_operations *I_fop;
struct super_block *I_sb;
wait_queue_head_t I_wait;
struct file_lock *I_flock;
struct address_space *I_mapping;
struct address_space I_data;
struct dquot *I_dquot[MAXQUOTAS];
struct pipe_inode_info *I_pipe.
Struct block_dev ice I_bdev;
Unsigned long I_state;
Unsigned int I_flags;
Unsigned char I_sock;
Atomic_t I_writecount;
Unsigned int I_attr_flags;
__u32 I_generation;
}.
The variable inode->i_op may contain the following C functions and provide method access to the super block, as follows:
struct inode_operations {
struct file_operations *default_file_ops;
int (*create) (struct inode *, const char *, int, int, struct inode **);
struct dentry * (*lookup) (struct inode *, struct dentry *)
int (*link) (struct dentry *, struct inode *, struct dentry *);
int (*unlink) (struct inode *, struct dentry *);
int (*symlink) (struct inode *, struct dentry *, const char *);
int (*mkdir) (struct inode *, struct dentry *, int);
int (*rmdir) (struct inode *, struct dentry *);
int (*mknod) (struct inode *, struct dentry *, int, int);
int (*rename)(struct inode *, struct dentry *, struct inode *,struct
dentry *);
int (*readlink) (struct dentry *, char *, int);
struct dentry * (*follow_link) (struct dentry *, struct dentry *,
unsigned int);
void (*truncate) (struct inode *);
int (*permission) (struct inode *, int);
int (*revalidate) (struct dentry *);
int (*setattr) (struct dentry *, struct iattr *);
int (*getattr) (struct dentry *, struct iattr *);
}.
System 600 also provides a function create (struct inode *, const char *, int, int, struct inode **). This function may accept the inputs set forth in Table 2.
TABLE 2
Variable
Variable Type
Identifier
Description
struct inode*
ParentDirectory
This input may specify the input
directory of the create operation.
const char*
NewName
This input may specify the name of the
new file system object.
int
NewSize
This input may specify the new size of
the object.
Int
NewMode
This input may specify the new mode of
the object.
struct inode**
NewInode
This input may specify the new inode of
the created object.
This function may create a new inode using get_empty_inode ( ). The function may initialize the new mode by attaching the const char * variable to it via dentry relationship. The function may initialize the new inode structure with the size specified. The function may initialize the new mode structure with the mode specified. The function may send a StreamConeCreate message to the stream tree ISM. The message may be configured as follows:
System 600 may also provide a function struct dentry *lookup (struct inode *, struct dentry *). This function may accept the inputs set forth in Table 3.
TABLE 3
Variable
Variable Type
Identifier
Description
struct inode*
ParentDirectory
This input may specify the input
directory of the lookup operation.
This function may send a StreamConeIdentify message to stream tree ISM 618. The message may be configured as follows:
System 600 may provide the function mkdir (struct inode *, struct dentry *, int). This function may accept the inputs as set forth in Table 4.
TABLE 4
Variable
Variable Type
Identifier
Description
struct inode*
ParentDirectory
This input may specify the input
directory of the mkdir operation.
Struct dentry*
Name
This input may specify the name of
the object to create.
int
Mode
This input may specify the mode of
the new directory.
The function may send a StreamConeCreate message to create a directory. The message may be configured as follows:
System 600 may provide the function rmdir (struct inode *, struct dentry *). This function may accept the inputs set forth in Table 5.
TABLE 5
Variable
Variable Type
Identifier
Description
struct inode*
ParentDirectory
This input may specify the input
directory of the lookup operation.
struct dentry*
Name
This input may specify the name of
the object to remove.
int
Length
This input may specify the length of
Name in characters.
This function may send a StreamConeErase message to remove a directory. The message may be configured as follows:
System 600 may also provide the function rename (struct inode *, struct dentry *, struct inode *, struct dentry *). This function may accept the inputs set forth in Table 6.
TABLE 6
Variable
Variable Type
Identifier
Description
struct inode*
OldDir
This input may specify the directory of the
file to rename.
struct dentry*
OldName
This input may specify the name of the
object to rename.
struct inode*
NewDir
This input may specify the new directory
of the object.
struct dentry*
NewName
This input may specify the new name of the
object.
This function may send a StreamConeIdentify message to the ISM. The message may be configured as follows:
System 600 may also provide the function truncate (struct inode *). This function may accept the inputs set forth in Table 7.
TABLE 7
Variable
Variable Type
Identifier
Description
struct inode*
File
This input may specify the file to truncate.
The function may send a StreamConeResize message to the ISM. The message may be configured as follows:
struct file {
struct list_head f_1st;
struct dentry *f_dentry;
struct file_operations *f_op;
atomic_t f_count;
unsigned int f_flags;
mode_t f_mode;
loff_t f_pos;
unsigned long f_reada;
unsigned long f_ramax;
unsigned long f_raend;
unsigned long f_ralen;
unsigned long f_rawin;
struct fown_struct f_owner;
unsigned int f_uid;
unsigned int f_gid;
int f_error;
unsigned long f_version;
}.
System 600 may provide one or more file operations described below. The variable f->s_op may contain the following C functions and may provide access to the super block.
struct file_operations {
loff_t
(*llseek) (struct file *, off_t, int)
ssize_t
(*read) (struct file *, char *, size_t, loff t *);
ssize_t
(*write) (struct file *, const char *, size_t, loff_t *);
int
(*readdir) (struct file *, void *, filldir_t);
u_int
(*poll) (struct file *, struct poll_table_struct *);
int
(*ioctl) (struct inode *, struct file *, unsigned int,
unsigned long);
int
(*mmap) (struct file *, struct vm_area_struct *);
int
(*open) (struct inode *, struct file *);
int
(*release) (struct inode *, struct file *);
int
(*fsync) (struct inode *, struct dentry *);
int
(*fasynch) (int, struct file *, int);
int
(*lock) (struct file *, int, struct file_lock *);
ssize_t
(*readv) (struct file *, const struct iovec *, unsigned long,
loff_t *);
ssize_t
(*writev) (struct file *, const struct iovec *, unsigned long,
loff_t *);
}.
System 600 may provide the function llseek (struct file * ,off_t, int). This function may accept the inputs as set forth in Table 8.
TABLE 8
Variable
Variable Type
Identifier
Description
struct file*
File
This input may specify the file pointer to
seek.
off_t
Offset
This input may specify the offset from
Origin to seek to.
Int
Origin
This input may specify the Origin.
This function may send a StreamConeSeek message to the ISM. The message may be configured as follows:
System 600 may provide the function read (struct file *, char *, size_t, loff_t). This function may accept the inputs set forth in Table 9.
TABLE 9
Variable
Variable Type
Identifier
Description
struct file*
File
This input may specify the file pointer
to read.
char*
Buffer
This input may specify the buffer to
read into.
Size_t
Size
This input may specify size in bytes
to read.
loff_t
SeekChange
This input specifies how much data was
read.
This function may send a StreamConeRead message to the ISM. The message may be configured as follows:
System 600 may provide the function write (struct file *, const char *, size_t, loff_t *). This function may accept the inputs set forth in Table 10.
TABLE 10
Variable
Variable Type
Identifier
Description
struct file*
File
This input may specify the file pointer
to read.
Const char*
Buffer
This input may specify the buffer to write.
Size_t
Size
This input may specify size in bytes
to read.
Loff_t
SeekChange
This input specifies how much data was
written.
This function may send a StreamConeWrite message to the ISM. The message may be configured as follows:
System 600 may provide the function readdir (struct file *, void *, filldir_t). This function may accept the inputs set forth in Table 11.
TABLE 11
Variable
Variable
Type
Identifier
Description
struct file *
File
This input may specify the file pointer to read.
This function may send a StreamConeEnumerate message to the ISM. The message may be configured as follows:
System 600 may also provide a dentry interface as follows:
struct dentry {
int d_count
unsigned int d_flags;
struct inode * d_inode;
struct dentry *d_parent;
struct dentry *d_mounts;
struct dentry *d_covers;
struct list_head d_ash;
struct list_head d_lru;
struct list_head d_child;
struct list_head d_subdirs;
struct list_head d_alias;
struct qstr d_name;
unsigned long d_time;
struct dentry_operations *d_op;
struct super_block *d_sb;
unsigned long d_reftime;
void *d_fsdata;
unsigned char d_iname[DNAME_INLINE_LEN];
}.
Stream tree ISM 618 may support one or more stream tree class messages, as defined herein. Stream tree 618 may function and support messages from a stream tree OSM, such as stream tree OSM 608. Stream forest ISM 616 may support stream forest class messages, as defined herein. Stream forest ISM 616 may function and support messages from a stream forest OSM, such as stream forest OSM 602.
Stream forest ISM 616 may include a user interface. The user interface may include a user screen that may display one or more stream trees on initialization. A user may be able to create new stream trees. When creating new stream trees, the user may be presented with a screen asking for size and identification. If a stream tree is created, a stream tree class object may be created. The user may also be able to erase stream trees. The user interface may provide for confirmation of erasure of stream trees. Stream forest messages may be handled and tree objects created as appropriate.
System 600 may provide the message StreamConeCreate. This message may be used to create a new stream cone that will store information, and may accept the inputs as set forth in Table 12.
TABLE 12
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the handle that should be
closed.
U32
TYPE
This input may specify the type to create. 1
indicates a file and 2 indicates a directory.
SGL
SGL
Specifies the identifier.
System 600 may also provide the message StreamConeEnumerate. This message may be used to list one or more stream cones within a stream cone container, and may accept the inputs as set forth in Table 13.
TABLE 13
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the handle that
should be closed.
U32
ENUMERATOR
This input may specify a zero-based index
indicating which entry should be
enumerated into the SGL.
SGL
SGL
Specifies the location of the enumerated
stream cone identifier.
System 600 may retrieve the inode relating to HANDLE from the handle manager. When an enumerator is set to 0,the “ext2fs” library call dir_iterate( ) may be used with the inode relating to handle as the parent to generate a list of stream cone identifiers on the “ext2” filesystem. A list entry corresponding to the ENUMERATOR index may be copied into SGL.
System 600 may provide the message StreamConeErase. This message is used to erase a stream cone identifier, and may accept the inputs as set forth in Table 14.
TABLE 14
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the handle that should be
closed.
SGL
SGL
This input may specify the name of the identifier
that should be erased.
System 600 may provide the message StreamConeGetInformation. This message may be used to retrieve information about the stream cone, and may accept the inputs as set forth in Table 15.
TABLE 15
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the handle where
information should be retrieved from.
SGL
SGL
This input may specify the name of the identifier
that should be erased.
System 600 may provide the message StreamConeIdentify. This message may be used to map a handle identifier to a string identifier, and may accept the inputs as set forth in Table 16.
TABLE 16
Variable
Variable
Type
Identifier
Description
U32
PARENT
This input may specify the parent handle
HANDLE
stream cone container.
U32
CHILD
This input may specify the child handle that
HANDLE
should be mapped to the stream cone
identifier.
U32
ATTRIBUTES
This input may specify the attributes of the
identified stream cone.
SGL
SGL
This input may specify the name of the
identifier.
System 600 may provide the message StreamConeLock. This message may be used to lock a byte range of a file, and may accept the inputs as set forth in Table 17.
TABLE 17
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the parent handle stream
cone container.
U64
INDEX
This input may specify the byte index that should
be locked.
U64
SIZE
This input may specify the size in bytes that
should be locked.
System 600 may provide the message StreamConeRead. This message may be used to read a block from a stream cone, and may accept the inputs as set forth in Table 18.
TABLE 18
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the parent handle stream
cone container.
U64
SIZE
This input may specify the size of the block to
read.
SGL
SGL
This input may specify where in memory the file
should be stored.
System 600 may also provide a message StreamConeRelease. This message may be used to close an identification of the specified handle, and may accept the inputs as set forth in Table 19.
TABLE 19
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the handle that should be
closed.
This function may unlink HANDLE from the inode identifier.
System 600 may provide a message StreamConeRename. This message may be used to rename a stream cone, and may accept the inputs as set forth in Table 20.
TABLE 20
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the handle that
should be renamed.
U32
NEWPARENT
This input may specify the current or new
parent handle.
SGL
SGL
This input may specify the name of the
new SGL.
System 600 may also provide a message StreamConeResize. This message is used to resize a stream cone, and may accept the inputs as set forth in Table 21.
TABLE 21
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the handle that should be
renamed.
U64
SIZE
This input may specify the new size of the stream
cone.
System 600 may provide a message StreamConeSeek. This message is used to change the position of a stream cone, and may accept the inputs as set forth in Table 22.
TABLE 22
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the handle that should
be renamed.
U64
NEW
This input may specify the new position of the
POSITION
stream cone.
System 600 may provide a message StreamConeGetInformation. This message may be used to set information regarding the stream cone, and may accept the inputs as set forth in Table 23.
TABLE 23
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the handle that should
have information set.
SGL
SGL
This input may specify the information set block.
System 600 may provide a message StreamConeUnlock. This message may be used to unlock a previously set byte lock range, and may accept the inputs as set forth in Table 24.
TABLE 24
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the handle that
should be unlocked.
U64
INDEX
This input may specify the start byte of the
range of bytes to unlock.
U64
BYTECOUNT
This input may specify the byte count to
unlock.
System 600 may provide a message StreamConeWrite. This message may be used to write a block to a stream cone, and may accept the inputs as set forth in Table 25.
TABLE 25
Variable
Variable
Type
Identifier
Description
U32
HANDLE
This input may specify the handle that
should be written.
U64
BYTECOUNT
This input may specify the count in bytes
that should be written.
SGL
SGL
This input may specify the block to be
written.
While certain features of the embodiments of the invention have been illustrated as described herein, many modifications, substitutions, changes and equivalents will now occur to those skilled in the art. It is, therefore, to be understood that the appended claims are intended to cover all such modifications and changes as fall within the true spirit of the embodiments of the invention.
| Patent | Priority | Assignee | Title |
| 10515387, | Sep 04 2003 | GOOGLE LLC | Systems and methods for determining user actions |
| 10726164, | Jun 22 2006 | GOOGLE LLC | Secure and extensible pay per action online advertising |
| 10963891, | Sep 12 2006 | GOOGLE LLC | Secure conversion tracking |
| 11042886, | Sep 04 2003 | GOOGLE LLC | Systems and methods for determining user actions |
| 11100518, | Sep 04 2003 | GOOGLE LLC | Systems and methods for determining user actions |
| 7272630, | Jun 06 2001 | Microsoft Technology Licensing, LLC | Locating potentially identical objects across multiple computers based on stochastic partitioning of workload |
| 7346774, | Mar 26 2001 | Microsoft Technology Licensing, LLC | Encrypted key cache |
| 7359937, | Jun 06 2001 | Microsoft Technology Licensing, LLC | Locating potentially identical objects across multiple computers based on stochastic partitioning of workload |
| 7401220, | Mar 21 2001 | Microsoft Technology Licensing, LLC | On-disk file format for a serverless distributed file system |
| 7415608, | Mar 21 2001 | Microsoft Technology Licensing, LLC | On-disk file format for a serverless distributed file system |
| 7444387, | Jun 06 2001 | Microsoft Technology Licensing, LLC | Locating potentially identical objects across multiple computers based on stochastic partitioning of workload |
| 7454612, | Mar 21 2001 | Microsoft Technology Licensing, LLC | On-disk file format for a serverless distributed file system |
| 7475258, | Jan 17 2001 | Microsoft Technology Licensing, LLC | Exclusive encryption |
| 7487245, | Jun 06 2001 | Microsoft Technology Licensing, LLC | Locating potentially identical objects across multiple computers based on stochastic partitioning of workload |
| 7505970, | Mar 26 2001 | Microsoft Technology Licensing, LLC | Serverless distributed file system |
| 7509423, | Jun 06 2001 | Microsoft Technology Licensing, LLC | Locating potentially identical objects across multiple computers based on stochastic partitioning of workload |
| 7509636, | Dec 15 2003 | Microsoft Technology Licensing, LLC | System and method for updating files utilizing delta compression patching |
| 7519623, | Jun 06 2001 | Microsoft Technology Licensing, LLC | Locating potentially identical objects across multiple computers based on stochastic partitioning of workload |
| 7539867, | Mar 21 2001 | Microsoft Technology Licensing, LLC | On-disk file format for a serverless distributed file system |
| 7555656, | Jan 17 2001 | Microsoft Technology Licensing, LLC | Exclusive encryption |
| 7571186, | Jun 06 2001 | Microsoft Technology Licensing, LLC | Locating potentially identical objects across multiple computers based on stochastic partitioning of workload |
| 7571327, | Jan 17 2001 | Microsoft Technology Licensing, LLC | Exclusive encryption |
| 7685415, | Jan 17 2001 | Microsoft Technology Licensing, LLC | Exclusive encryption |
| 7770023, | Jan 17 2001 | Microsoft Technology Licensing, LLC | Exclusive encryption |
| 7886364, | Mar 26 2001 | Microsoft Technology Licensing, LLC | Encrypted key cache |
| 8112452, | Oct 06 2004 | Microsoft Technology Licensing, LLC | Serverless distributed file system |
| 8239639, | Jun 08 2007 | SanDisk Technologies, Inc | Method and apparatus for providing data type and host file information to a mass storage system |
| 8706551, | Sep 04 2003 | GOOGLE LLC | Systems and methods for determining user actions |
| 8713283, | Jun 08 2007 | SanDisk Technologies, Inc | Method of interfacing a host operating through a logical address space with a direct file storage medium |
| 9898627, | Jun 22 2006 | GOOGLE LLC | Secure and extensible pay per action online advertising |
| Patent | Priority | Assignee | Title |
| 5619690, | Jun 21 1993 | Hitachi, LTD | Computer system including a computer which requests an access to a logical address in a secondary storage system with specification of a local address in the secondary storage system |
| 5623600, | Sep 26 1995 | Trend Micro, Incorporated | Virus detection and removal apparatus for computer networks |
| 5742817, | Dec 08 1995 | EMC Corporation | Method and apparatus for file server addressing |
| 6088659, | Sep 11 1997 | Elster Electricity, LLC | Automated meter reading system |
| 6112263, | Dec 15 1997 | Intel Corporation | Method for multiple independent processes controlling access to I/O devices in a computer system |
| 6134617, | Apr 03 1998 | AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE LIMITED | Method and apparatus for managing access to a loop in a data processing system |
| 6249782, | Dec 17 1998 | Apple Inc | System and method for reducing file name length and for retrieving the reduced file name entitled files |
| 6286045, | May 19 1997 | AT HOME BONDHOLDERS LIQUIDATING TRUST | Information storage and delivery over a computer network using centralized intelligence to monitor and control the information being delivered |
| 6442548, | Jan 31 1997 | GOOGLE LLC | Database interface for database unaware applications |
| 6650761, | May 19 1999 | DIGIMARC CORPORATION AN OREGON CORPORATION | Watermarked business cards and methods |
| Executed on | Assignor | Assignee | Conveyance | Frame | Reel | Doc |
| Dec 30 2000 | Intel Corporation | (assignment on the face of the patent) | / | |||
| Feb 27 2001 | DAKE, STEVEN C | Intel Corporation | ASSIGNMENT OF ASSIGNORS INTEREST SEE DOCUMENT FOR DETAILS | 011735 | /0708 |
| Date | Maintenance Fee Events |
| Feb 04 2009 | M1551: Payment of Maintenance Fee, 4th Year, Large Entity. |
| Feb 13 2013 | M1552: Payment of Maintenance Fee, 8th Year, Large Entity. |
| Feb 13 2013 | M1555: 7.5 yr surcharge - late pmt w/in 6 mo, Large Entity. |
| Mar 17 2017 | REM: Maintenance Fee Reminder Mailed. |
| Sep 04 2017 | EXP: Patent Expired for Failure to Pay Maintenance Fees. |
| Date | Maintenance Schedule |
| Aug 09 2008 | 4 years fee payment window open |
| Feb 09 2009 | 6 months grace period start (w surcharge) |
| Aug 09 2009 | patent expiry (for year 4) |
| Aug 09 2011 | 2 years to revive unintentionally abandoned end. (for year 4) |
| Aug 09 2012 | 8 years fee payment window open |
| Feb 09 2013 | 6 months grace period start (w surcharge) |
| Aug 09 2013 | patent expiry (for year 8) |
| Aug 09 2015 | 2 years to revive unintentionally abandoned end. (for year 8) |
| Aug 09 2016 | 12 years fee payment window open |
| Feb 09 2017 | 6 months grace period start (w surcharge) |
| Aug 09 2017 | patent expiry (for year 12) |
| Aug 09 2019 | 2 years to revive unintentionally abandoned end. (for year 12) |