Go to the documentation of this file.
   61   char * nextDir = 
NULL;
 
   78   while ( 
name[i] != 
'\0' && 
name[i] != 
'/' && i < 
sizeof(dirName) ) {
 
   82   assert( i < 
sizeof(dirName) );
 
   83   if ( i == 
sizeof(dirName) )
 
   92   if ( *nextDir == 
'/' )
 
  101   if ( *nextDir != 
'\0' ) {
 
  102     while ( tmp != 
NULL ) {
 
  111               *head->
size, nextDir );
 
  112           if ( dirList == 
NULL )
 
  138   while ( tmp != 
NULL ) {
 
  177   if ( dirList == 
NULL )
 
  221   while ( tmp != 
NULL ) {
 
  243   if (node == 
NULL) 
return;
 
  244   newNode->
next = *node;
 
  245   if (*node != 
NULL) (*node)->
prev = newNode;
 
  
 
char * strcpy(char *, const char *)
struct cacheNode * ubixfs_cacheAdd(struct cacheNode *node, struct cacheNode *newNode)
void kfree(void *baseAddr)
int strcmp(const char *str1, const char *str2)
void spinUnlock(spinLock_t *lock)
struct cacheNode * ubixfs_cacheNew(const char *name)
int strlen(const char *str)
#define SPIN_LOCK_INITIALIZER
void spinLock(spinLock_t *lock)
struct cacheNode * fileListHead
struct cacheNode * parent
void ubixfs_cacheDelete(struct cacheNode **head)
struct cacheNode * fileListTail
struct cacheNode * ubixfs_cacheFind(struct cacheNode *head, char *name)
void * kmalloc(uInt32 len)