Skip to contentSkip to conversation

fiemap tester

RFC Josef Bacik 6 participants 9 messages May 8, 2009 – May 11, 2009 VFS

lore
Share & tools
lore
#0 lore raw

Hello,

Here is small little program which I and Eric have been working on this week to better test FIEMAP, since it seems that a few of our implementations are broken. This program is kind if like fsx for FIEMAP, it will generate a randomly sized file, from 1 fs block to 2 mb, and then randomly populate that file with data, holes and preallocated space using fallocate. Of course if fallocate doesn't work then we just don't do that. This test will do this infinitely by default, only exiting if it finds an error or if its killed. Compile like you normally would, unless you don't have the userspace stuff for the fallocate system call, in which case you need to compile with

gcc -o fiemap-tester -DNO_FALLOCATE fiemap-tester.c

If something fails it will spit out the map it was using, the extent it was on when it failed and what it was expecting, and the fiemap output it currently has. Also note that this will give FIEMAP a random map_length as well, so the fiemap output may or may not cover the entire file, so keep that in mind. Please test this on your FS if you implement FIEMAP and let me know if I've done something stupid. I've tested this on the generic stuff (with patches to fix stuff) and XFS and it seems like its working properly. Thanks,

Josef

/*
* Copyright (c) 2009 Josef Bacik
* All Rights Reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License V2
* as published by the Free Software Foundation.
*
* This program is distributed in the hope that it would be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA */

#include <stdio.h>
#include <stdlib.h>
#include <unistd.h>
#include <fcntl.h>
#include <string.h>
#include <ctype.h>
#include <sys/ioctl.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/vfs.h>
#include <linux/fs.h>
#include <linux/types.h>
#include <linux/fiemap.h>

static void
usage(void)

{
	printf("Usage: fiemap-tester [-m map] [-r number of runs] ");
#ifndef NO_FALLOCATE
	printf("[-p preallocate (1/0)] ");
#endif
	printf("filename\n");
	printf("  -m map    : generate a file with the map given and test\n");
#ifndef NO_FALLOCATE
	printf("  -p 0/1    : turn block preallocation on or off\n");
#endif
	printf("  -r count  : number of runs to execute (default infinity)\n");
	printf("  -s seed   : seed for random map generator (default 1)n");
	printf("-m and -r cannot be used together\n");
	exit(EXIT_FAILURE);
}

static char *
generate_file_mapping(int blocks, int prealloc)

{
	char *map;
	int num_types = 2, cur_block = 0;
	int i = 0;

	map = malloc(sizeof(char) * blocks);
	if (!map)
		return NULL;

	if (prealloc)
		num_types++;


	for (i = 0; i < blocks; i++) {
		long num = random() % num_types;
		switch (num) {
		case 0:
			map[cur_block] = 'D';
			break;
		case 1:
			map[cur_block] = 'H';
			break;
		case 2:
			map[cur_block] = 'P';
			break;
		}
		cur_block++;
	}

	return map;
}

static int
create_file_from_mapping(int fd, char *map, int blocks, int blocksize)

{
	int cur_offset = 0, ret = 0, bufsize;
	char *buf;
	int i = 0;

	bufsize = sizeof(char) * blocksize;
	buf = malloc(bufsize);
	if (!buf)
		return -1;

	memset(buf, 'a', bufsize);

	for (i = 0; i < blocks; i++) {
		switch (map[i]) {
		case 'D':
			ret = write(fd, buf, bufsize);
			if (ret < bufsize) {
				printf("Short write\n");
				ret = -1;
				goto out;
			}
			break;
#ifndef NO_FALLOCATE
		case 'P':
			ret = fallocate(fd, 0, cur_offset, blocksize);
			if (ret < 0) {
				printf("Error fallocating\n");
				goto out;
			}
			/* fallthrough; seek to end of prealloc space */
#endif
		case 'H':
			ret = lseek(fd, blocksize, SEEK_CUR);
			if (ret == (off_t)-1) {
				printf("Error lseeking\n");
				ret = -1;
				goto out;
			}
			break;
		default:
			printf("Hrm, unrecognized flag in map\n");
			ret = -1;
			goto out;
		}
		cur_offset += blocksize;
	}

	ret = 0;
out:
	return ret;
}

static void
show_extent_block(struct fiemap_extent *extent, int blocksize)

{
	__u64	logical = extent->fe_logical;
	__u64	phys = extent->fe_physical;
	__u64	length = extent->fe_length;
	int	flags = extent->fe_flags;

	printf("logical: [%8llu..%8llu] phys: %8llu..%8llu "
	       "flags: 0x%03X tot: %llu\n",
		logical / blocksize, (logical + length - 1) / blocksize,
		phys / blocksize, (phys + length - 1) / blocksize,
		flags,
		(length / blocksize));
}

static void
show_extents(struct fiemap *fiemap, int blocksize)

{
	unsigned int i;

	for (i = 0; i < fiemap->fm_mapped_extents; i++)
		show_extent_block(&fiemap->fm_extents[i], blocksize);
}

static int
check_flags(struct fiemap *fiemap, int blocksize)

{
	struct fiemap_extent *extent;
	__u64 aligned_offset, aligned_length;
	int c;

	for (c = 0; c < fiemap->fm_mapped_extents; c++) {
		extent = &fiemap->fm_extents[c];

		aligned_offset = extent->fe_physical & ~((__u64)blocksize - 1);
		aligned_length = extent->fe_length & ~((__u64)blocksize - 1);

		if ((aligned_offset != extent->fe_physical ||
		     aligned_length != extent->fe_length) &&
		    !(extent->fe_flags & FIEMAP_EXTENT_NOT_ALIGNED)) {
			printf("ERROR: FIEMAP_EXTENT_NOT_ALIGNED is not set "
			       "but the extent is unaligned: %llu\n",
			       (unsigned long long)
			       (extent->fe_logical / blocksize));
			return -1;
		}

		if (extent->fe_flags & FIEMAP_EXTENT_DATA_ENCRYPTED &&
		    !(extent->fe_flags & FIEMAP_EXTENT_ENCODED)) {
			printf("ERROR: FIEMAP_EXTENT_DATA_ENCRYPTED is set, "
			       "but FIEMAP_EXTENT_ENCODED is not set: %llu\n",
			       (unsigned long long)
			       (extent->fe_logical / blocksize));
			return -1;
		}

		if (extent->fe_flags & FIEMAP_EXTENT_NOT_ALIGNED &&
		    aligned_offset == extent->fe_physical &&
		    aligned_length == extent->fe_length) {
			printf("ERROR: FIEMAP_EXTENT_NOT_ALIGNED is set but "
			       "offset and length is blocksize aligned: "
			       "%llu\n",
			       (unsigned long long)
			       (extent->fe_logical / blocksize));
			return -1;
		}

		if (extent->fe_flags & FIEMAP_EXTENT_LAST &&
		    c + 1 < fiemap->fm_mapped_extents) {
			printf("ERROR: FIEMAP_EXTENT_LAST is set but there are"
			       " more extents left: %llu\n",
			       (unsigned long long)
			       (extent->fe_logical / blocksize));
			return -1;
		}

		if (extent->fe_flags & FIEMAP_EXTENT_DELALLOC &&
		    !(extent->fe_flags & FIEMAP_EXTENT_UNKNOWN)) {
			printf("ERROR: FIEMAP_EXTENT_DELALLOC is set but "
			       "FIEMAP_EXTENT_UNKNOWN is not set: %llu\n",
			       (unsigned long long)
			       (extent->fe_logical / blocksize));
			return -1;
		}

		if (extent->fe_flags & FIEMAP_EXTENT_DATA_INLINE &&
		    !(extent->fe_flags & FIEMAP_EXTENT_NOT_ALIGNED)) {
			printf("ERROR: FIEMAP_EXTENT_DATA_INLINE is set but "
			       "FIEMAP_EXTENT_NOT_ALIGNED is not set: %llu\n",
			       (unsigned long long)
			       (extent->fe_logical / blocksize));
			return -1;
		}

		if (extent->fe_flags & FIEMAP_EXTENT_DATA_TAIL &&
		    !(extent->fe_flags & FIEMAP_EXTENT_NOT_ALIGNED)) {
			printf("ERROR: FIEMAP_EXTENT_DATA_TAIL is set but "
			       "FIEMAP_EXTENT_NOT_ALIGNED is not set: %llu\n",
			       (unsigned long long)
			       (extent->fe_logical / blocksize));
			return -1;
		}
	}

	return 0;
}

static int
check_data(struct fiemap *fiemap, __u64 logical_offset, int blocksize,
int last, int prealloc)

{
	struct fiemap_extent *extent;
	__u64 orig_offset = logical_offset;
	int c, found = 0;

	for (c = 0; c < fiemap->fm_mapped_extents; c++) {
		__u64 start, end;
		extent = &fiemap->fm_extents[c];

		start = extent->fe_logical;
		end = extent->fe_logical + extent->fe_length;

		if (logical_offset > end)
			continue;

		if (logical_offset + blocksize < start)
			break;

		if (logical_offset >= start &&
		    logical_offset < end) {
			if (prealloc &&
			    (!extent->fe_flags & FIEMAP_EXTENT_UNWRITTEN)) {
				printf("ERROR: preallocated extent is not "
				       "marked with FIEMAP_EXTENT_UNWRITTEN: "
				       "%llu\n",
				       (unsigned long long)
				       (start / blocksize));
				return -1;
			}

			if (logical_offset + blocksize > end) {
				logical_offset = end+1;
				continue;
			} else {
				found = 1;
				break;
			}
		}
	}

	if (!found) {
		printf("ERROR: couldn't find extent at %llu\n",
		       (unsigned long long)(orig_offset / blocksize));
	} else if (last &&
		   !(fiemap->fm_extents[c].fe_flags & FIEMAP_EXTENT_LAST)) {
		printf("ERROR: last extent not marked as last: %llu\n",
		       (unsigned long long)(orig_offset / blocksize));
		found = 0;
	}

	return (!found) ? -1 : 0;
}

static int
check_weird_fs_hole(int fd, __u64 logical_offset, int blocksize)

{
	static int warning_printed = 0;
	int block, i;
	size_t buf_len = sizeof(char) * blocksize;
	char *buf;

	block = (int)(logical_offset / blocksize);
	if (ioctl(fd, FIBMAP, &block) < 0) {
		perror("Can't fibmap file");
		return -1;
	}

	if (!block) {
		printf("ERROR: FIEMAP claimed there was data at a block "
		       "which should be a hole, and FIBMAP confirmend that "
		       "it is in fact a hole, so FIEMAP is wrong: %llu\n",
		       (unsigned long long)(logical_offset / blocksize));
		return -1;
	}

	buf = malloc(buf_len);
	if (!buf) {
		perror("Could not allocate temporary buffer");
		return -1;
	}

	if (pread(fd, buf, buf_len, (off_t)logical_offset) < 0) {
		perror("Error reading from file");
		free(buf);
		return -1;
	}

	for (i = 0; i < buf_len; i++) {
		if (buf[i] != 0) {
			printf("ERROR: FIEMAP claimed there was data (%c) at "
			       "block %llu that should have been a hole, and "
			       "FIBMAP confirmed that it was allocated, but "
			       "it should be filled with 0's, but it was not "
			       "so you have a big problem!\n",
			       buf[i],
			       (unsigned long long)(logical_offset / blocksize));
			free(buf);
			return -1;
		}
	}

	if (warning_printed) {
		free(buf);
		return 0;
	}

	printf("HEY FS PERSON: your fs is weird.  I specifically wanted a\n"
	       "hole and you allocated a block anyway.  FIBMAP confirms that\n"
	       "you allocated a block, and the block is filled with 0's so\n"
	       "everything is kosher, but you still allocated a block when\n"
	       "didn't need to.  This may or may not be what you wanted,\n"
	       "which is why I'm only printing this message once, in case\n"
	       "you didnt do it on purpose: %llu\n",
	       (unsigned long long)(logical_offset / blocksize));
	warning_printed = 1;
	free(buf);

	return 0;
}

static int
check_hole(struct fiemap *fiemap, int fd, __u64 logical_offset, int blocksize)

{
	struct fiemap_extent *extent;
	__u64 orig_offset = logical_offset;
	int c, found = 0;

	for (c = 0; c < fiemap->fm_mapped_extents; c++) {
		__u64 start, end;
		extent = &fiemap->fm_extents[c];

		start = extent->fe_logical;
		end = extent->fe_logical + extent->fe_length;

		if (logical_offset > end)
			continue;
		if (logical_offset + blocksize < start)
			break;

		if (logical_offset >= start &&
		    logical_offset < end) {

			if (check_weird_fs_hole(fd, logical_offset,
						blocksize) == 0)
				break;

			printf("ERROR: found an allocated extent where a hole "
			       "should be: %llu\n",
			       (unsigned long long)(start / blocksize));
			return -1;
		}
	}

	return 0;
}

static int
compare_fiemap_and_map(int fd, char *map, int blocks, int blocksize)

{
	struct fiemap *fiemap;
	char *fiebuf;
	int blocks_to_map, ret, cur_extent = 0, last_data;
	__u64 map_start, map_length;
	int i, c;

	blocks_to_map = (random() % blocks) + 1;
	fiebuf = malloc(sizeof(struct fiemap) +
			(blocks_to_map * sizeof(struct fiemap_extent)));
	if (!fiebuf) {
		perror("Could not allocate fiemap buffers");
		return -1;
	}

	fiemap = (struct fiemap *)fiebuf;
	map_start = 0;
	map_length = blocks_to_map * blocksize;

	for (i = 0; i < blocks; i++) {
		if (map[i] != 'H')
			last_data = i;
	}

	fiemap->fm_flags = FIEMAP_FLAG_SYNC;
	fiemap->fm_extent_count = blocks_to_map;
	fiemap->fm_mapped_extents = 0;

	do {
		fiemap->fm_start = map_start;
		fiemap->fm_length = map_length;

		ret = ioctl(fd, FS_IOC_FIEMAP, (unsigned long)fiemap);
		if (ret < 0) {
			perror("FIEMAP ioctl failed");
			free(fiemap);
			return -1;
		}

		if (check_flags(fiemap, blocksize))
			goto error;

		for (i = cur_extent, c = 1; i < blocks; i++, c++) {
			__u64 logical_offset = i * blocksize;

			if (c > blocks_to_map)
				break;

			switch (map[i]) {
			case 'D':
				if (check_data(fiemap, logical_offset,
					       blocksize, last_data == i, 0))
					goto error;
				break;
			case 'H':
				if (check_hole(fiemap, fd, logical_offset,
					       blocksize))
					goto error;
				break;
			case 'P':
				if (check_data(fiemap, logical_offset,
					       blocksize, last_data == i, 1))
					goto error;
				break;
			default:
				printf("ERROR: weird value in map: %c\n",
				       map[i]);
				goto error;
			}
		}
		cur_extent = i;
		map_start = i * blocksize;
	} while (cur_extent < blocks);

	ret = 0;
	return ret;
error:
	printf("map is '%s'\n", map);
	show_extents(fiemap, blocksize);
	return -1;
}

int
main(int argc, char **argv)

{
	int	blocksize = 0;	/* filesystem blocksize */
	int	fd;		/* file descriptor */
	int	opt;
	int	rc;
	char	*fname;		/* filename to map */
	char	*map = NULL;	/* file map to generate */
	int	runs = -1;	/* the number of runs to have */
	int	blocks = 0;	/* the number of blocks to generate */
	int	maxblocks = 0;	/* max # of blocks to create */
	int	prealloc = 1;	/* whether or not to do preallocation */
	int	seed = 1;

	while ((opt = getopt(argc, argv, "m:r:s:p:")) != -1) {
		switch(opt) {
		case 'm':
			map = strdup(optarg);
			break;
		case 'p':
#ifndef NO_FALLOCATE
			prealloc = atoi(optarg);;
			break;
#else
			printf("Not built with preallocation support\n");
			usage();
#endif
		/* sync file before mapping */
		case 'r':
			runs = atoi(optarg);
			break;
		case 's':
			seed = atoi(optarg);
			break;
		default:
			usage();
		}
	}

	if (runs != -1 && map)
		usage();

	fname = argv[optind++];
	if (!fname)
		usage();

	fd = open(fname, O_RDWR|O_CREAT|O_TRUNC, 0644);
	if (fd < 0) {
		perror("Can't open file");
		exit(1);
	}

	if (ioctl(fd, FIGETBSZ, &blocksize) < 0) {
		perror("Can't get filesystem block size");
		close(fd);
		exit(1);
	}
#ifndef NO_FALLOCATE
	/* if fallocate passes, then we can do preallocation, else not */
	if (prealloc) {
		prealloc = !((int)fallocate(fd, 0, 0, blocksize));
		if (!prealloc)
			printf("preallocation not supported, disabling\n");
	}
#else
	prealloc = 0;

#endif

	if (ftruncate(fd, 0)) {
		perror("Can't truncate file");
		close(fd);
		exit(1);
	}

	if (map) {
		blocks = strlen(map);
		runs = 0;
	}

	srandom(seed);

	/* max file size 2mb / block size */
	maxblocks = (2 * 1024 * 1024) / blocksize;

	if (runs == -1)
		printf("Starting infinite run, if you don't see any output "
		       "then its working properly.\n");
	do {
		if (!map) {
			blocks = random() % maxblocks;
			if (blocks == 0) {
				printf("Skipping 0 length file\n");
				continue;
			}

			map = generate_file_mapping(blocks, prealloc);
			if (!map) {
				printf("Could not create map\n");
				exit(1);
			}
		}

		rc = create_file_from_mapping(fd, map, blocks, blocksize);
		if (rc) {
			perror("Could not create file\n");
			free(map);
			close(fd);
			exit(1);
		}

		rc = compare_fiemap_and_map(fd, map, blocks, blocksize);
		if (rc) {
			printf("Problem comparing fiemap and map\n");
			free(map);
			close(fd);
			exit(1);
		}

		free(map);
		map = NULL;

		if (ftruncate(fd, 0)) {
			perror("Could not truncate file\n");
			close(fd);
			exit(1);
		}

		if (lseek(fd, 0, SEEK_SET)) {
			perror("Could not seek set\n");
			close(fd);
			exit(1);
		}

		if (runs) runs--;
	} while (runs != 0);

	close(fd);

	return 0;
}
#1 lore raw
Quoted 2 lines · On Fri, 8 May 2009 15:16:49 -0400 Josef Bacik <[email protected]> wrote:

Here is small little program which I and Eric have been working on this week to better test FIEMAP

I for one wouldn't complain were someone to create Documentation/fs/tests/ and to then start filling it with stuff.

#2 lore raw
Quoted 8 lines · Andrew Morton
Quoted 2 lines · On Fri, 8 May 2009 15:16:49 -0400 Josef Bacik <[email protected]> wrote:

Here is small little program which I and Eric have been working on this week to better test FIEMAP

I for one wouldn't complain were someone to create Documentation/fs/tests/ and to then start filling it with stuff.

Why oh why do people think Documentation/ is a good place for code?

tests/ would be a much better place :)

Last time I brought the idea of a small in-tree test harness up at KS people weren't too fond of it, but if we get more backing now we could try it, otherwise we can just stick it into xfsqa which will hopefully soon be generalized to a general fs QA suite.

#3 lore raw
Quoted 9 lines · Christoph Hellwig
Quoted 7 lines · Andrew Morton
Quoted 2 lines · On Fri, 8 May 2009 15:16:49 -0400 Josef Bacik <[email protected]> wrote:

Here is small little program which I and Eric have been working on this week to better test FIEMAP

I for one wouldn't complain were someone to create Documentation/fs/tests/ and to then start filling it with stuff.

Quoted 8 lines

Why oh why do people think Documentation/ is a good place for code?

tests/ would be a much better place :)

Last time I brought the idea of a small in-tree test harness up at KS people weren't too fond of it, but if we get more backing now we could try it, otherwise we can just stick it into xfsqa which will hopefully soon be generalized to a general fs QA suite.

FWIW, the xfsprogs test suite git tree is currently at 11M; and that's mostly just for one subtype of one subsystem. Aiming to have a full kernel test suite in the kernel tree sounds lke it could get unwieldy to me...

I'll stick this new test into xfstests regardless, for now...

-Eric

#4 lore raw
In reply to Christoph Hellwig
Quoted 5 lines · Christoph Hellwig

Last time I brought the idea of a small in-tree test harness up at KS people weren't too fond of it, but if we get more backing now we could try it, otherwise we can just stick it into xfsqa which will hopefully soon be generalized to a general fs QA suite.

Two questions --- first of all, has there been any progress with respect to fixing the licensing of the xfsqa tree. (i.e., "All Rights Reserved" needs to change to a GPLv2 license)?

And would you be open to cleaning up xfsqa by for example, moving some of the tests out of the top-level directory, adding a modified xfs_io to xfsqa (modified to not avoid using XFS-specific ioctl whereever possible), etc.

I've been collecting my own set of test programs for ext4, and I've thought about trying to use xfsqa, but it's not obvious to me it would be more or less work, since in many ways there are a lot of places where a lot of cleanup work and filesystem portability work would be needed, and it's not clear that creating a new test framework and collection of tests would be more or less work.

(For example, of cleanup that I'd love to see, I'd really like to use real names for tests and not just random three digit numbers like 107, 108, 109, all cluterring the top-level directory along with 107.out, 108.out, 109.out, etc.)

Of course, until the copyright/licensing situation is cleared up, all of these other issues are rather moot....

- Ted

#5 lore raw
Quoted 9 lines · Theodore Tso
Quoted 4 lines · Christoph Hellwig

Last time I brought the idea of a small in-tree test harness up at KS people weren't too fond of it, but if we get more backing now we could try it, otherwise we can just stick it into xfsqa which will hopefully soon be generalized to a general fs QA suite.

Two questions --- first of all, has there been any progress with respect to fixing the licensing of the xfsqa tree. (i.e., "All Rights Reserved" needs to change to a GPLv2 license)?

We've had a verbal ack from sgi that it should be under an open-source license. But until that is committed to the repo....

Quoted 4 lines

And would you be open to cleaning up xfsqa by for example, moving some of the tests out of the top-level directory, adding a modified xfs_io to xfsqa (modified to not avoid using XFS-specific ioctl whereever possible), etc.

Sure. xfs_io already can act on non-xfs filesystems, although right now it takes a flag to do so. But it can do many ops* that way, and we're open to add more (I just sent a patch to add fallocate yesterday).

As for directory layout, whatever works is likely fine.

Quoted 6 lines

I've been collecting my own set of test programs for ext4, and I've thought about trying to use xfsqa, but it's not obvious to me it would be more or less work, since in many ways there are a lot of places where a lot of cleanup work and filesystem portability work would be needed, and it's not clear that creating a new test framework and collection of tests would be more or less work.

Yes, xfsqa would/will take some work to get there I guess. OTOH so much of filesystem testing could be shared, it's a shame to duplicate it for each filesytem, too.

Quoted 4 lines

(For example, of cleanup that I'd love to see, I'd really like to use real names for tests and not just random three digit numbers like 107, 108, 109, all cluterring the top-level directory along with 107.out, 108.out, 109.out, etc.)

Well they're not random, they are sequential ;)

But yeah at least giving each test a description (at least a DESCRIPTION="tests fubarbaz") would be helpful.

Quoted 2 lines

Of course, until the copyright/licensing situation is cleared up, all of these other issues are rather moot....

I'll press SGI on this...

-Eric

Quoted 1 line

- Ted

*fadvise, file, print, freeze, thaw, fsync, fdatasync, getrusage, madvise, mincore, mmap, mread, msync, munmap, mwrite, open, stat, close, setfl, statfs, pread, pwrite, sendfile, truncate

#6 lore raw
In reply to Theodore Tso
Quoted 9 lines · Theodore Tso
Quoted 4 lines · Christoph Hellwig

Last time I brought the idea of a small in-tree test harness up at KS people weren't too fond of it, but if we get more backing now we could try it, otherwise we can just stick it into xfsqa which will hopefully soon be generalized to a general fs QA suite.

Two questions --- first of all, has there been any progress with respect to fixing the licensing of the xfsqa tree. (i.e., "All Rights Reserved" needs to change to a GPLv2 license)?

Given that we are not lawyers:

The current kernel tree contains >3500 files that contain the phrase "All Rights Reserved". Are they a problem?

Signature · 3 lines
~Randy
LPC 2009, Sept. 23-25, Portland, Oregon
http://linuxplumbersconf.org/2009/
#7 lore raw
Quoted 5 lines · Randy Dunlap

Given that we are not lawyers:

The current kernel tree contains >3500 files that contain the phrase "All Rights Reserved". Are they a problem?

Yes, but how many of them are followed with a GPL licensing statement? And presumably we have a signed-off-by chain that which includes someone asserting that they have followed the Developer's Certification of Origin rules. (That being said, it's usually better if the All Rights Reserved is removed, after getting explicit permission from the original copyright owner to make it available under a GPLv2 license.)

The issue with the xfstests tree is the *only* copyright permission statement is "All Rights Reserved", and while there is an oral assertion from SGI that it was supposed to be released under an open source license, there is nothing in writing or in the source distribution indicating this, and it wasn't clear to me whether this oral assurance happened before or after SGI was purchased by Rackspace.

- Ted

#8 lore raw
In reply to Christoph Hellwig
Quoted 11 lines · On Mon, 11 May 2009 05:46:39 -0400 Christoph Hellwig <[email protected]> wrote:
Quoted 8 lines · Andrew Morton
Quoted 2 lines · On Fri, 8 May 2009 15:16:49 -0400 Josef Bacik <[email protected]> wrote:

Here is small little program which I and Eric have been working on this week to better test FIEMAP

I for one wouldn't complain were someone to create Documentation/fs/tests/ and to then start filling it with stuff.

Why oh why do people think Documentation/ is a good place for code?

I don't think anyone does. But it's better than nothing.

Quoted 1 line

tests/ would be a much better place :)

Yup.

Quoted 4 lines

Last time I brought the idea of a small in-tree test harness up at KS people weren't too fond of it, but if we get more backing now we could try it, otherwise we can just stick it into xfsqa which will hopefully soon be generalized to a general fs QA suite.

Well Sam had all this done in his tree six-odd months ago - moved all the compileable stuff out of Documentation/ and into tests/ and we'd shaken out pretty much all the problems I think. But then he ran into a busy spot and it didn't quite get finished and merged.

Hopefully that will all come back again sometime. Until then, we keep on plugging away with the current setup.