devextras.h
上传用户:wealth48
上传日期:2022-06-24
资源大小:1701k
文件大小:6k
- /*
- * YAFFS: Yet another FFS. A NAND-flash specific file system.
- * devextras.h
- *
- * Copyright (C) 2002 Aleph One Ltd.
- * for Toby Churchill Ltd and Brightstar Engineering
- *
- * Created by Charles Manning <charles@aleph1.co.uk>
- *
- * This program is free software; you can redistribute it and/or modify
- * it under the terms of the GNU Lesser General Public License version 2.1 as
- * published by the Free Software Foundation.
- *
- * Note: Only YAFFS headers are LGPL, YAFFS C code is covered by GPL.
- *
- * This file is just holds extra declarations used during development.
- * Most of these are from kernel includes placed here so we can use them in
- * applications.
- *
- * $Id: devextras.h,v 1.5 2002/09/27 20:50:50 charles Exp $
- *
- */
-
- #ifndef __EXTRAS_H__
- #define __EXTRAS_H__
- #define __inline__ __inline
- typedef unsigned char __u8;
- typedef unsigned short __u16;
- typedef unsigned __u32;
- /*
- * Simple doubly linked list implementation.
- *
- * Some of the internal functions ("__xxx") are useful when
- * manipulating whole lists rather than single entries, as
- * sometimes we already know the next/prev entries and we can
- * generate better code by using them directly rather than
- * using the generic single-entry routines.
- */
-
- #define prefetch(x) 1
-
- struct list_head {
- struct list_head *next, *prev;
- };
- #define LIST_HEAD_INIT(name) { &(name), &(name) }
- #define LIST_HEAD(name)
- struct list_head name = LIST_HEAD_INIT(name)
- #define INIT_LIST_HEAD(ptr) do {
- (ptr)->next = (ptr); (ptr)->prev = (ptr);
- } while (0)
- /*
- * Insert a new entry between two known consecutive entries.
- *
- * This is only for internal list manipulation where we know
- * the prev/next entries already!
- */
- static __inline__ void __list_add(struct list_head * new,
- struct list_head * prev,
- struct list_head * next)
- {
- next->prev = new;
- new->next = next;
- new->prev = prev;
- prev->next = new;
- }
- /**
- * list_add - add a new entry
- * @new: new entry to be added
- * @head: list head to add it after
- *
- * Insert a new entry after the specified head.
- * This is good for implementing stacks.
- */
- static __inline__ void list_add(struct list_head *new, struct list_head *head)
- {
- __list_add(new, head, head->next);
- }
- /**
- * list_add_tail - add a new entry
- * @new: new entry to be added
- * @head: list head to add it before
- *
- * Insert a new entry before the specified head.
- * This is useful for implementing queues.
- */
- static __inline__ void list_add_tail(struct list_head *new, struct list_head *head)
- {
- __list_add(new, head->prev, head);
- }
- /*
- * Delete a list entry by making the prev/next entries
- * point to each other.
- *
- * This is only for internal list manipulation where we know
- * the prev/next entries already!
- */
- static __inline__ void __list_del(struct list_head * prev,
- struct list_head * next)
- {
- next->prev = prev;
- prev->next = next;
- }
- /**
- * list_del - deletes entry from list.
- * @entry: the element to delete from the list.
- * Note: list_empty on entry does not return true after this, the entry is in an undefined state.
- */
- static __inline__ void list_del(struct list_head *entry)
- {
- __list_del(entry->prev, entry->next);
- }
- /**
- * list_del_init - deletes entry from list and reinitialize it.
- * @entry: the element to delete from the list.
- */
- static __inline__ void list_del_init(struct list_head *entry)
- {
- __list_del(entry->prev, entry->next);
- INIT_LIST_HEAD(entry);
- }
- /**
- * list_empty - tests whether a list is empty
- * @head: the list to test.
- */
- static __inline__ int list_empty(struct list_head *head)
- {
- return head->next == head;
- }
- /**
- * list_splice - join two lists
- * @list: the new list to add.
- * @head: the place to add it in the first list.
- */
- static __inline__ void list_splice(struct list_head *list, struct list_head *head)
- {
- struct list_head *first = list->next;
- if (first != list) {
- struct list_head *last = list->prev;
- struct list_head *at = head->next;
- first->prev = head;
- head->next = first;
- last->next = at;
- at->prev = last;
- }
- }
- /**
- * list_entry - get the struct for this entry
- * @ptr: the &struct list_head pointer.
- * @type: the type of the struct this is embedded in.
- * @member: the name of the list_struct within the struct.
- */
- #define list_entry(ptr, type, member)
- ((type *)((char *)(ptr)-(unsigned long)(&((type *)0)->member)))
- /**
- * list_for_each - iterate over a list
- * @pos: the &struct list_head to use as a loop counter.
- * @head: the head for your list.
- */
- #define list_for_each(pos, head)
- for (pos = (head)->next, prefetch(pos->next); pos != (head);
- pos = pos->next, prefetch(pos->next))
- /**
- * list_for_each_safe - iterate over a list safe against removal of list entry
- * @pos: the &struct list_head to use as a loop counter.
- * @n: another &struct list_head to use as temporary storage
- * @head: the head for your list.
- */
- #define list_for_each_safe(pos, n, head)
- for (pos = (head)->next, n = pos->next; pos != (head);
- pos = n, n = pos->next)
- /*
- * File types
- */
- #define DT_UNKNOWN 0
- #define DT_FIFO 1
- #define DT_CHR 2
- #define DT_DIR 4
- #define DT_BLK 6
- #define DT_REG 8
- #define DT_LNK 10
- #define DT_SOCK 12
- #define DT_WHT 14
- /*
- * Attribute flags. These should be or-ed together to figure out what
- * has been changed!
- */
- #define ATTR_MODE 1
- #define ATTR_UID 2
- #define ATTR_GID 4
- #define ATTR_SIZE 8
- #define ATTR_ATIME 16
- #define ATTR_MTIME 32
- #define ATTR_CTIME 64
- #define ATTR_ATIME_SET 128
- #define ATTR_MTIME_SET 256
- #define ATTR_FORCE 512 /* Not a change, but a change it */
- #define ATTR_ATTR_FLAG 1024
- struct iattr {
- unsigned int ia_valid;
- unsigned ia_mode;
- unsigned ia_uid;
- unsigned ia_gid;
- unsigned ia_size;
- unsigned ia_atime;
- unsigned ia_mtime;
- unsigned ia_ctime;
- unsigned int ia_attr_flags;
- };
- #endif