yaffs.searchresults

这是一个嵌入式文件系统的实现C代码

---- list Matches (116 in 14 files) ----
Devextras.h (e:\working\yaffs): * Simple doubly linked list implementation.
Devextras.h (e:\working\yaffs): * This is only for internal list manipulation where we know
Devextras.h (e:\working\yaffs): * @head: list head to add it after
Devextras.h (e:\working\yaffs): * @head: list head to add it before
Devextras.h (e:\working\yaffs): * Delete a list entry by making the prev/next entries
Devextras.h (e:\working\yaffs): * This is only for internal list manipulation where we know
Devextras.h (e:\working\yaffs): * list_del - deletes entry from list.
Devextras.h (e:\working\yaffs): * @entry: the element to delete from the list.
Devextras.h (e:\working\yaffs): * list_del_init - deletes entry from list and reinitialize it.
Devextras.h (e:\working\yaffs): * @entry: the element to delete from the list.
Devextras.h (e:\working\yaffs): * list_empty - tests whether a list is empty
Devextras.h (e:\working\yaffs): * @head: the list to test.
Devextras.h (e:\working\yaffs): * @list: the new list to add.
Devextras.h (e:\working\yaffs): * @head: the place to add it in the first list.
Devextras.h (e:\working\yaffs):static __inline__ void list_splice(struct list_head *list, struct list_head *head)
Devextras.h (e:\working\yaffs):	struct list_head *first = list->next;
Devextras.h (e:\working\yaffs):	if (first != list) {
Devextras.h (e:\working\yaffs):		struct list_head *last = list->prev;
Devextras.h (e:\working\yaffs): * list_for_each	-	iterate over a list
Devextras.h (e:\working\yaffs): * @head:	the head for your list.
Devextras.h (e:\working\yaffs): * list_for_each_safe	-	iterate over a list safe against removal of list entry
Devextras.h (e:\working\yaffs): * @head:	the head for your list.
Devextras.h (e:\working\yaffs):#include <linux/list.h>
Mtdpart.c (e:\working\yaffs\patches):#include <linux/list.h>
Mtdpart.c (e:\working\yaffs\patches):/* Our partition linked list */
Mtdpart.c (e:\working\yaffs\patches):	struct list_head list;
Mtdpart.c (e:\working\yaffs\patches):		slave = list_entry(node, struct mtd_part, list);
Mtdpart.c (e:\working\yaffs\patches):		list_add(&slave->list, &mtd_partitions);
Nandemul.c (e:\working\yaffs\mtdemul):#include <linux/list.h>
Yaffs-0.3.html (e:\working\yaffs\documentation):mechanism proposed here is to have a list of __u16 page addresses
Yaffs-notes2.html (e:\working\yaffs\documentation):	<LI><P>siblings: this field is used to link together a list of all
Yaffs-notes2.html (e:\working\yaffs\documentation):	the head of the list of objects in the directory.</P>
Yaffs-notes2.html (e:\working\yaffs\documentation):a free list and re-used.</P>
Yaffs-notes2.html (e:\working\yaffs\documentation):list_head hashLink;	// list of objects in this hash bucket</FONT></FONT></P>
Yaffs-notes2.html (e:\working\yaffs\documentation):live on this list</FONT></FONT></P>
Yaffs-notes2.html (e:\working\yaffs\documentation):// also used for linking up the free list</FONT></FONT></P>
Yaffs-notes2.html (e:\working\yaffs\documentation):<P>hashlink is a list of Objects in the same hash bucket. 
Yaffs-notes2.html (e:\working\yaffs\documentation):<P>Directories hold a list of children objects.</P>
Yaffs-notes2.html (e:\working\yaffs\documentation):<P>Free tnodes are stored in a list. When the list is exhausted, more
Yaffs-rootfs-howto.html (e:\working\yaffs\documentation):that came with the sources will create a YAFFS block list in a file
Yaffs-rootfs-howto.html (e:\working\yaffs\documentation):from a root tree. This is a list of 512+16 byte blocks that need to
Yaffs-rootfs-howto.html (e:\working\yaffs\documentation):<P>Yaffs mailing list - to join send an email to
Yaffs2.html (e:\working\yaffs\documentation):	<LI><P>ECC was on this list, but now seems flexible enough. Thanx
Yaffsfs.c (e:\working\yaffs\direct):// configurationList is the list of devices that are supported
Yaffsfs.c (e:\working\yaffs\direct):	struct yaffsfs_ObjectListEntry *list;
Yaffsfs.c (e:\working\yaffs\direct):// Scan the configuration list to find the root.
Yaffsfs.c (e:\working\yaffs\direct):			dsc->list = NULL;
Yaffsfs.c (e:\working\yaffs\direct):	struct yaffsfs_ObjectListEntry *list = NULL;
Yaffsfs.c (e:\working\yaffs\direct):						list = dsc->list;
Yaffsfs.c (e:\working\yaffs\direct):						while(list && !inList)
Yaffsfs.c (e:\working\yaffs\direct):							if(list->objectId == entry->objectId)
Yaffsfs.c (e:\working\yaffs\direct):							list = list->next;
Yaffsfs.c (e:\working\yaffs\direct):					le->next =  dsc->list;
Yaffsfs.c (e:\working\yaffs\direct):					dsc->list = le;
Yaffsfs.c (e:\working\yaffs\direct):		while(dsc->list)
Yaffsfs.c (e:\working\yaffs\direct):			le = dsc->list;
Yaffsfs.c (e:\working\yaffs\direct):			dsc->list = dsc->list->next;
Yaffsfsd.c (e:\working\yaffs\wince):  if(pSearch->foundObjects) //If we found some objects we must clean up the cached linked list.
Yaffsfsd.c (e:\working\yaffs\wince):  //Iterate through the current list of objs already found and return true if already exists.
Yaffsfsd.c (e:\working\yaffs\wince):  //If the object hasn't already been found then add it to the list (SIDE-EFFECT alert) and return false.
Yaffsfsd.c (e:\working\yaffs\wince):  while(it->next != NULL) //iterate through singly linked list.
Yaffsfsd.c (e:\working\yaffs\wince):    //Add the item to the list.
Yaffsfsd.c (e:\working\yaffs\wince):    //'it' will currently be pointing to the last of the list nodes. i.e node->next == NULL
Yaffs_fs.c (e:\working\yaffs):#include <linux/list.h>
Yaffs_guts.c (e:\working\yaffs):// List of spare objects
Yaffs_guts.c (e:\working\yaffs):// The list is hooked together using the first pointer
Yaffs_guts.c (e:\working\yaffs):// List of spare tnodes
Yaffs_guts.c (e:\working\yaffs):// The list is hooked together using the first pointer
Yaffs_guts.c (e:\working\yaffs):// adds them to the tnode free list.
Yaffs_guts.c (e:\working\yaffs):    // Hook them into the free list
Yaffs_guts.c (e:\working\yaffs):	// Now add this bunch of tnodes to a list for freeing up.
Yaffs_guts.c (e:\working\yaffs):	// NB If we can't add this to the management list it isn't fatal
Yaffs_guts.c (e:\working\yaffs):		T(YAFFS_TRACE_ERROR,(TSTR("yaffs: Could not add tnodes to management list" TENDSTR)));
Yaffs_guts.c (e:\working\yaffs):			// Hoosterman, this thing looks like it isn't in the list
Yaffs_guts.c (e:\working\yaffs):				T(YAFFS_TRACE_ALWAYS,(TSTR("yaffs: Tnode list bug 1" TENDSTR)));
Yaffs_guts.c (e:\working\yaffs):// FreeTnode frees up a tnode and puts it back on the free list
Yaffs_guts.c (e:\working\yaffs):			// Hoosterman, this thing looks like it is already in the list
Yaffs_guts.c (e:\working\yaffs):				T(YAFFS_TRACE_ALWAYS,(TSTR("yaffs: Tnode list bug 2" TENDSTR)));
Yaffs_guts.c (e:\working\yaffs):	// Free the list of allocated tnodes
Yaffs_guts.c (e:\working\yaffs):// adds them to the object free list.
Yaffs_guts.c (e:\working\yaffs):    yaffs_ObjectList *list;
Yaffs_guts.c (e:\working\yaffs):    // Hook them into the free list
Yaffs_guts.c (e:\working\yaffs):	// Now add this bunch of Objects to a list for freeing up.
Yaffs_guts.c (e:\working\yaffs):	list = YMALLOC(sizeof(yaffs_ObjectList));
Yaffs_guts.c (e:\working\yaffs):	if(!list)
Yaffs_guts.c (e:\working\yaffs):		T(YAFFS_TRACE_ALLOCATE,(TSTR("Could not add objects to management list" TENDSTR)));
Yaffs_guts.c (e:\working\yaffs):		list->objects = newObjects;
Yaffs_guts.c (e:\working\yaffs):		list->next = dev->allocatedObjectList;
Yaffs_guts.c (e:\working\yaffs):		dev->allocatedObjectList = list;
Yaffs_guts.c (e:\working\yaffs):	// If it is still linked into the bucket list, free from the list
Yaffs_guts.c (e:\working\yaffs):// FreeObject frees up a Object and puts it back on the free list
Yaffs_guts.c (e:\working\yaffs):	// Link into the free list.
Yaffs_guts.c (e:\working\yaffs):	// Free the list of allocated Objects
Yaffs_guts.c (e:\working\yaffs):		INIT_LIST_HEAD(&dev->objectBucket[i].list);
Yaffs_guts.c (e:\working\yaffs):	// If we didn't find an empty list, then try
Yaffs_guts.c (e:\working\yaffs):	// by scanning the list.
Yaffs_guts.c (e:\working\yaffs):			list_for_each(i,&dev->objectBucket[bucket].list)
Yaffs_guts.c (e:\working\yaffs):				// If there is already one in the list
Yaffs_guts.c (e:\working\yaffs):	list_add(&in->hashLink,&dev->objectBucket[bucket].list);
Yaffs_guts.c (e:\working\yaffs):	list_for_each(i,&dev->objectBucket[bucket].list)
Yaffs_guts.c (e:\working\yaffs):		// Look if it is in the list
Yaffs_guts.c (e:\working\yaffs):		list_for_each(j,&dev->objectBucket[bucket].list)
Yaffs_guts.c (e:\working\yaffs):	// remove this hardlink from the list assocaited with the equivalent
Yaffs_guts.c (e:\working\yaffs):					// we put them all in a list.
Yaffs_guts.c (e:\working\yaffs):					// list and fix up all the chains.		
Yaffs_guts.h (e:\working\yaffs):	struct list_head children; // list of child links
Yaffs_guts.h (e:\working\yaffs):	struct list_head hashLink;	// list of objects in this hash bucket
Yaffs_guts.h (e:\working\yaffs):								// live on this list
Yaffs_guts.h (e:\working\yaffs):								// also used for linking up the free list
Yaffs_guts.h (e:\working\yaffs):	struct list_head list;
Yaffs_on_mtd.html (e:\working\yaffs\documentation):	device in the mtd list by typing <BR>#<FONT FACE="Courier, monospace">cat
Yaffs_report20020211.html (e:\working\yaffs\documentation):	has a list of children links (ie. the links in that directory).<BR>An