#define srandom srand
#endif
-
#include <linux/kdev_t.h>
/*#include <linux/fs.h> */
#include <sys/mount.h>
#endif
#endif /* __KLIBC__ */
-
/*
* min()/max()/clamp() macros that also do
* strict type-checking.. See the
int container_enough; /* flag external handlers can set to
* indicate that subarrays have not enough (-1),
* enough to start (0), or all expected disks (1) */
- char sys_name[20];
+ char sys_name[20];
struct mdinfo *devs;
struct mdinfo *next;
int num;
} mapping_t;
-
struct mdstat_ent {
char *dev;
char devnm[32];
struct dev_member {
char *name;
struct dev_member *next;
- } *members;
+ } *members;
struct mdstat_ent *next;
};
struct active_array;
struct metadata_update;
-
/* 'struct reshape' records the intermediate states of
* a general reshape.
* The starting geometry is converted to the 'before' geometry
* (in a->resync_start).
* resync status is really irrelevant if the array is not consistent,
* but some metadata (DDF!) have a place to record the distinction.
- * If 'consistent' is '2', then the array can mark it dirty if a
+ * If 'consistent' is '2', then the array can mark it dirty if a
* resync/recovery/whatever is required, or leave it clean if not.
* Return value is 0 dirty (not consistent) and 1 if clean.
* it is only really important if consistent is passed in as '2'.
extern int add_dev(const char *name, const struct stat *stb, int flag, struct FTW *s);
-
extern int Manage_ro(char *devname, int fd, int readonly);
extern int Manage_run(char *devname, int fd, int quiet);
extern int Manage_stop(char *devname, int fd, int quiet,
static inline int is_subarray(char *vers)
{
/* The version string for a 'subarray' (an array in a container)
- * is
+ * is
* /containername/componentname for normal read-write arrays
* -containername/componentname for arrays which mdmon must not
* reconfigure. They might be read-only
#define LEVEL_CONTAINER (-100)
#define LEVEL_UNSUPPORTED (-200)
-
/* faulty stuff */
#define WriteTransient 0
#define ModeMask 0x1f
#define ModeShift 5
-
#ifdef __TINYC__
#undef minor
#undef major
#define ALGORITHM_ROTATING_N_RESTART 9 /* DDF PRL=6 RLQ=2 */
#define ALGORITHM_ROTATING_N_CONTINUE 10 /*DDF PRL=6 RLQ=3 */
-
/* For every RAID5 algorithm we define a RAID6 algorithm
* with exactly the same layout for data and parity, and
* with the Q block always on the last device (N-1).