mirror of
				https://github.com/eledio-devices/thirdparty-littlefs.git
				synced 2025-10-31 00:32:38 +01:00 
			
		
		
		
	Also finished migrating tests with test_relocations and test_exhaustion. The issue I was running into when migrating these tests was a lack of flexibility with what you could do with the block devices. It was possible to hack in some hooks for things like bad blocks and power loss, but it wasn't clean or easily extendable. The solution here was to just put all of these test extensions into a third block device, testbd, that uses the other two example block devices internally. testbd has several useful features for testing. Note this makes it a pretty terrible block device _example_ since these hooks look more complicated than a block device needs to be. - testbd can simulate different erase values, supporting 1s, 0s, other byte patterns, or no erases at all (which can cause surprising bugs). This actually depends on the simulated erase values in ramdb and filebd. I did try to move this out of rambd/filebd, but it's not possible to simulate erases in testbd without buffering entire blocks and creating an excessive amount of extra write operations. - testbd also helps simulate power-loss by containing a "power cycles" counter that is decremented every write operation until it calls exit. This is notably faster than the previous gdb approach, which is valuable since the reentrant tests tend to take a while to resolve. - testbd also tracks wear, which can be manually set and read. This is very useful for testing things like bad block handling, wear leveling, or even changing the effective size of the block device at runtime.
		
			
				
	
	
		
			569 lines
		
	
	
		
			18 KiB
		
	
	
	
		
			TOML
		
	
	
	
	
	
			
		
		
	
	
			569 lines
		
	
	
		
			18 KiB
		
	
	
	
		
			TOML
		
	
	
	
	
	
| # allocator tests
 | |
| # note for these to work there are many constraints on the device geometry
 | |
| 
 | |
| [[case]] # parallel allocation test
 | |
| define.FILES = 3
 | |
| define.SIZE = '(((LFS_BLOCK_SIZE-8)*(LFS_BLOCK_COUNT-4)) / FILES)'
 | |
| code = '''
 | |
|     const char *names[FILES] = {"bacon", "eggs", "pancakes"};
 | |
|     lfs_file_t files[FILES];
 | |
| 
 | |
|     lfs_format(&lfs, &cfg) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
|     lfs_mkdir(&lfs, "breakfast") => 0;
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| 
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
|     for (int n = 0; n < FILES; n++) {
 | |
|         sprintf(path, "breakfast/%s", names[n]);
 | |
|         lfs_file_open(&lfs, &files[n], path,
 | |
|                 LFS_O_WRONLY | LFS_O_CREAT | LFS_O_APPEND) => 0;
 | |
|     }
 | |
|     for (int n = 0; n < FILES; n++) {
 | |
|         size = strlen(names[n]);
 | |
|         for (lfs_size_t i = 0; i < SIZE; i += size) {
 | |
|             lfs_file_write(&lfs, &files[n], names[n], size) => size;
 | |
|         }
 | |
|     }
 | |
|     for (int n = 0; n < FILES; n++) {
 | |
|         lfs_file_close(&lfs, &files[n]) => 0;
 | |
|     }
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| 
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
|     for (int n = 0; n < FILES; n++) {
 | |
|         sprintf(path, "breakfast/%s", names[n]);
 | |
|         lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
 | |
|         size = strlen(names[n]);
 | |
|         for (lfs_size_t i = 0; i < SIZE; i += size) {
 | |
|             lfs_file_read(&lfs, &file, buffer, size) => size;
 | |
|             assert(memcmp(buffer, names[n], size) == 0);
 | |
|         }
 | |
|         lfs_file_close(&lfs, &file) => 0;
 | |
|     }
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| '''
 | |
| 
 | |
| [[case]] # serial allocation test
 | |
| define.FILES = 3
 | |
| define.SIZE = '(((LFS_BLOCK_SIZE-8)*(LFS_BLOCK_COUNT-4)) / FILES)'
 | |
| code = '''
 | |
|     const char *names[FILES] = {"bacon", "eggs", "pancakes"};
 | |
| 
 | |
|     lfs_format(&lfs, &cfg) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
|     lfs_mkdir(&lfs, "breakfast") => 0;
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| 
 | |
|     for (int n = 0; n < FILES; n++) {
 | |
|         lfs_mount(&lfs, &cfg) => 0;
 | |
|         sprintf(path, "breakfast/%s", names[n]);
 | |
|         lfs_file_open(&lfs, &file, path,
 | |
|                 LFS_O_WRONLY | LFS_O_CREAT | LFS_O_APPEND) => 0;
 | |
|         size = strlen(names[n]);
 | |
|         memcpy(buffer, names[n], size);
 | |
|         for (int i = 0; i < SIZE; i += size) {
 | |
|             lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|         }
 | |
|         lfs_file_close(&lfs, &file) => 0;
 | |
|         lfs_unmount(&lfs) => 0;
 | |
|     }
 | |
| 
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
|     for (int n = 0; n < FILES; n++) {
 | |
|         sprintf(path, "breakfast/%s", names[n]);
 | |
|         lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
 | |
|         size = strlen(names[n]);
 | |
|         for (int i = 0; i < SIZE; i += size) {
 | |
|             lfs_file_read(&lfs, &file, buffer, size) => size;
 | |
|             assert(memcmp(buffer, names[n], size) == 0);
 | |
|         }
 | |
|         lfs_file_close(&lfs, &file) => 0;
 | |
|     }
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| '''
 | |
| 
 | |
| [[case]] # parallel allocation reuse test
 | |
| define.FILES = 3
 | |
| define.SIZE = '(((LFS_BLOCK_SIZE-8)*(LFS_BLOCK_COUNT-4)) / FILES)'
 | |
| define.CYCLES = [1, 10]
 | |
| code = '''
 | |
|     const char *names[FILES] = {"bacon", "eggs", "pancakes"};
 | |
|     lfs_file_t files[FILES];
 | |
| 
 | |
|     lfs_format(&lfs, &cfg) => 0;
 | |
| 
 | |
|     for (int c = 0; c < CYCLES; c++) {
 | |
|         lfs_mount(&lfs, &cfg) => 0;
 | |
|         lfs_mkdir(&lfs, "breakfast") => 0;
 | |
|         lfs_unmount(&lfs) => 0;
 | |
| 
 | |
|         lfs_mount(&lfs, &cfg) => 0;
 | |
|         for (int n = 0; n < FILES; n++) {
 | |
|             sprintf(path, "breakfast/%s", names[n]);
 | |
|             lfs_file_open(&lfs, &files[n], path,
 | |
|                     LFS_O_WRONLY | LFS_O_CREAT | LFS_O_APPEND) => 0;
 | |
|         }
 | |
|         for (int n = 0; n < FILES; n++) {
 | |
|             size = strlen(names[n]);
 | |
|             for (int i = 0; i < SIZE; i += size) {
 | |
|                 lfs_file_write(&lfs, &files[n], names[n], size) => size;
 | |
|             }
 | |
|         }
 | |
|         for (int n = 0; n < FILES; n++) {
 | |
|             lfs_file_close(&lfs, &files[n]) => 0;
 | |
|         }
 | |
|         lfs_unmount(&lfs) => 0;
 | |
| 
 | |
|         lfs_mount(&lfs, &cfg) => 0;
 | |
|         for (int n = 0; n < FILES; n++) {
 | |
|             sprintf(path, "breakfast/%s", names[n]);
 | |
|             lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
 | |
|             size = strlen(names[n]);
 | |
|             for (int i = 0; i < SIZE; i += size) {
 | |
|                 lfs_file_read(&lfs, &file, buffer, size) => size;
 | |
|                 assert(memcmp(buffer, names[n], size) == 0);
 | |
|             }
 | |
|             lfs_file_close(&lfs, &file) => 0;
 | |
|         }
 | |
|         lfs_unmount(&lfs) => 0;
 | |
| 
 | |
|         lfs_mount(&lfs, &cfg) => 0;
 | |
|         for (int n = 0; n < FILES; n++) {
 | |
|             sprintf(path, "breakfast/%s", names[n]);
 | |
|             lfs_remove(&lfs, path) => 0;
 | |
|         }
 | |
|         lfs_remove(&lfs, "breakfast") => 0;
 | |
|         lfs_unmount(&lfs) => 0;
 | |
|     }
 | |
| '''
 | |
| 
 | |
| [[case]] # serial allocation reuse test
 | |
| define.FILES = 3
 | |
| define.SIZE = '(((LFS_BLOCK_SIZE-8)*(LFS_BLOCK_COUNT-4)) / FILES)'
 | |
| define.CYCLES = [1, 10]
 | |
| code = '''
 | |
|     const char *names[FILES] = {"bacon", "eggs", "pancakes"};
 | |
| 
 | |
|     lfs_format(&lfs, &cfg) => 0;
 | |
| 
 | |
|     for (int c = 0; c < CYCLES; c++) {
 | |
|         lfs_mount(&lfs, &cfg) => 0;
 | |
|         lfs_mkdir(&lfs, "breakfast") => 0;
 | |
|         lfs_unmount(&lfs) => 0;
 | |
| 
 | |
|         for (int n = 0; n < FILES; n++) {
 | |
|             lfs_mount(&lfs, &cfg) => 0;
 | |
|             sprintf(path, "breakfast/%s", names[n]);
 | |
|             lfs_file_open(&lfs, &file, path,
 | |
|                     LFS_O_WRONLY | LFS_O_CREAT | LFS_O_APPEND) => 0;
 | |
|             size = strlen(names[n]);
 | |
|             memcpy(buffer, names[n], size);
 | |
|             for (int i = 0; i < SIZE; i += size) {
 | |
|                 lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|             }
 | |
|             lfs_file_close(&lfs, &file) => 0;
 | |
|             lfs_unmount(&lfs) => 0;
 | |
|         }
 | |
| 
 | |
|         lfs_mount(&lfs, &cfg) => 0;
 | |
|         for (int n = 0; n < FILES; n++) {
 | |
|             sprintf(path, "breakfast/%s", names[n]);
 | |
|             lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
 | |
|             size = strlen(names[n]);
 | |
|             for (int i = 0; i < SIZE; i += size) {
 | |
|                 lfs_file_read(&lfs, &file, buffer, size) => size;
 | |
|                 assert(memcmp(buffer, names[n], size) == 0);
 | |
|             }
 | |
|             lfs_file_close(&lfs, &file) => 0;
 | |
|         }
 | |
|         lfs_unmount(&lfs) => 0;
 | |
| 
 | |
|         lfs_mount(&lfs, &cfg) => 0;
 | |
|         for (int n = 0; n < FILES; n++) {
 | |
|             sprintf(path, "breakfast/%s", names[n]);
 | |
|             lfs_remove(&lfs, path) => 0;
 | |
|         }
 | |
|         lfs_remove(&lfs, "breakfast") => 0;
 | |
|         lfs_unmount(&lfs) => 0;
 | |
|     }
 | |
| '''
 | |
| 
 | |
| [[case]] # exhaustion test
 | |
| code = '''
 | |
|     lfs_format(&lfs, &cfg) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
|     lfs_file_open(&lfs, &file, "exhaustion", LFS_O_WRONLY | LFS_O_CREAT);
 | |
|     size = strlen("exhaustion");
 | |
|     memcpy(buffer, "exhaustion", size);
 | |
|     lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     lfs_file_sync(&lfs, &file) => 0;
 | |
| 
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     lfs_ssize_t res;
 | |
|     while (true) {
 | |
|         res = lfs_file_write(&lfs, &file, buffer, size);
 | |
|         if (res < 0) {
 | |
|             break;
 | |
|         }
 | |
| 
 | |
|         res => size;
 | |
|     }
 | |
|     res => LFS_ERR_NOSPC;
 | |
| 
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| 
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
|     lfs_file_open(&lfs, &file, "exhaustion", LFS_O_RDONLY);
 | |
|     size = strlen("exhaustion");
 | |
|     lfs_file_size(&lfs, &file) => size;
 | |
|     lfs_file_read(&lfs, &file, buffer, size) => size;
 | |
|     memcmp(buffer, "exhaustion", size) => 0;
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| '''
 | |
| 
 | |
| [[case]] # exhaustion wraparound test
 | |
| define.SIZE = '(((LFS_BLOCK_SIZE-8)*(LFS_BLOCK_COUNT-4)) / 3)'
 | |
| code = '''
 | |
|     lfs_format(&lfs, &cfg) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
| 
 | |
|     lfs_file_open(&lfs, &file, "padding", LFS_O_WRONLY | LFS_O_CREAT);
 | |
|     size = strlen("buffering");
 | |
|     memcpy(buffer, "buffering", size);
 | |
|     for (int i = 0; i < SIZE; i += size) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
|     lfs_remove(&lfs, "padding") => 0;
 | |
| 
 | |
|     lfs_file_open(&lfs, &file, "exhaustion", LFS_O_WRONLY | LFS_O_CREAT);
 | |
|     size = strlen("exhaustion");
 | |
|     memcpy(buffer, "exhaustion", size);
 | |
|     lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     lfs_file_sync(&lfs, &file) => 0;
 | |
| 
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     lfs_ssize_t res;
 | |
|     while (true) {
 | |
|         res = lfs_file_write(&lfs, &file, buffer, size);
 | |
|         if (res < 0) {
 | |
|             break;
 | |
|         }
 | |
| 
 | |
|         res => size;
 | |
|     }
 | |
|     res => LFS_ERR_NOSPC;
 | |
| 
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| 
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
|     lfs_file_open(&lfs, &file, "exhaustion", LFS_O_RDONLY);
 | |
|     size = strlen("exhaustion");
 | |
|     lfs_file_size(&lfs, &file) => size;
 | |
|     lfs_file_read(&lfs, &file, buffer, size) => size;
 | |
|     memcmp(buffer, "exhaustion", size) => 0;
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
|     lfs_remove(&lfs, "exhaustion") => 0;
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| '''
 | |
| 
 | |
| [[case]] # dir exhaustion test
 | |
| code = '''
 | |
|     lfs_format(&lfs, &cfg) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
| 
 | |
|     // find out max file size
 | |
|     lfs_mkdir(&lfs, "exhaustiondir") => 0;
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     lfs_file_open(&lfs, &file, "exhaustion", LFS_O_WRONLY | LFS_O_CREAT);
 | |
|     int count = 0;
 | |
|     while (true) {
 | |
|         err = lfs_file_write(&lfs, &file, buffer, size);
 | |
|         if (err < 0) {
 | |
|             break;
 | |
|         }
 | |
| 
 | |
|         count += 1;
 | |
|     }
 | |
|     err => LFS_ERR_NOSPC;
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     lfs_remove(&lfs, "exhaustion") => 0;
 | |
|     lfs_remove(&lfs, "exhaustiondir") => 0;
 | |
| 
 | |
|     // see if dir fits with max file size
 | |
|     lfs_file_open(&lfs, &file, "exhaustion", LFS_O_WRONLY | LFS_O_CREAT);
 | |
|     for (int i = 0; i < count; i++) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     lfs_mkdir(&lfs, "exhaustiondir") => 0;
 | |
|     lfs_remove(&lfs, "exhaustiondir") => 0;
 | |
|     lfs_remove(&lfs, "exhaustion") => 0;
 | |
| 
 | |
|     // see if dir fits with > max file size
 | |
|     lfs_file_open(&lfs, &file, "exhaustion", LFS_O_WRONLY | LFS_O_CREAT);
 | |
|     for (int i = 0; i < count+1; i++) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     lfs_mkdir(&lfs, "exhaustiondir") => LFS_ERR_NOSPC;
 | |
| 
 | |
|     lfs_remove(&lfs, "exhaustion") => 0;
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| '''
 | |
| 
 | |
| # Below, I don't like these tests. They're fragile and depend _heavily_
 | |
| # on the geometry of the block device. But they are valuable. Eventually they
 | |
| # should be removed and replaced with generalized tests.
 | |
| 
 | |
| [[case]] # chained dir exhaustion test
 | |
| define.LFS_BLOCK_SIZE = 512
 | |
| define.LFS_BLOCK_COUNT = 1024
 | |
| if = 'LFS_BLOCK_SIZE == 512 and LFS_BLOCK_COUNT == 1024'
 | |
| code = '''
 | |
|     lfs_format(&lfs, &cfg) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
| 
 | |
|     // find out max file size
 | |
|     lfs_mkdir(&lfs, "exhaustiondir") => 0;
 | |
|     for (int i = 0; i < 10; i++) {
 | |
|         sprintf(path, "dirwithanexhaustivelylongnameforpadding%d", i);
 | |
|         lfs_mkdir(&lfs, path) => 0;
 | |
|     }
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     lfs_file_open(&lfs, &file, "exhaustion", LFS_O_WRONLY | LFS_O_CREAT);
 | |
|     int count = 0;
 | |
|     while (true) {
 | |
|         err = lfs_file_write(&lfs, &file, buffer, size);
 | |
|         if (err < 0) {
 | |
|             break;
 | |
|         }
 | |
| 
 | |
|         count += 1;
 | |
|     }
 | |
|     err => LFS_ERR_NOSPC;
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     lfs_remove(&lfs, "exhaustion") => 0;
 | |
|     lfs_remove(&lfs, "exhaustiondir") => 0;
 | |
|     for (int i = 0; i < 10; i++) {
 | |
|         sprintf(path, "dirwithanexhaustivelylongnameforpadding%d", i);
 | |
|         lfs_remove(&lfs, path) => 0;
 | |
|     }
 | |
| 
 | |
|     // see that chained dir fails
 | |
|     lfs_file_open(&lfs, &file, "exhaustion", LFS_O_WRONLY | LFS_O_CREAT);
 | |
|     for (int i = 0; i < count+1; i++) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_sync(&lfs, &file) => 0;
 | |
| 
 | |
|     for (int i = 0; i < 10; i++) {
 | |
|         sprintf(path, "dirwithanexhaustivelylongnameforpadding%d", i);
 | |
|         lfs_mkdir(&lfs, path) => 0;
 | |
|     }
 | |
| 
 | |
|     lfs_mkdir(&lfs, "exhaustiondir") => LFS_ERR_NOSPC;
 | |
| 
 | |
|     // shorten file to try a second chained dir
 | |
|     while (true) {
 | |
|         err = lfs_mkdir(&lfs, "exhaustiondir");
 | |
|         if (err != LFS_ERR_NOSPC) {
 | |
|             break;
 | |
|         }
 | |
| 
 | |
|         lfs_ssize_t filesize = lfs_file_size(&lfs, &file);
 | |
|         filesize > 0 => true;
 | |
| 
 | |
|         lfs_file_truncate(&lfs, &file, filesize - size) => 0;
 | |
|         lfs_file_sync(&lfs, &file) => 0;
 | |
|     }
 | |
|     err => 0;
 | |
| 
 | |
|     lfs_mkdir(&lfs, "exhaustiondir2") => LFS_ERR_NOSPC;
 | |
| 
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| '''
 | |
| 
 | |
| [[case]] # split dir test
 | |
| define.LFS_BLOCK_SIZE = 512
 | |
| define.LFS_BLOCK_COUNT = 1024
 | |
| if = 'LFS_BLOCK_SIZE == 512 and LFS_BLOCK_COUNT == 1024'
 | |
| code = '''
 | |
|     lfs_format(&lfs, &cfg) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
| 
 | |
|     // create one block hole for half a directory
 | |
|     lfs_file_open(&lfs, &file, "bump", LFS_O_WRONLY | LFS_O_CREAT) => 0;
 | |
|     for (lfs_size_t i = 0; i < cfg.block_size; i += 2) {
 | |
|         memcpy(&buffer[i], "hi", 2);
 | |
|     }
 | |
|     lfs_file_write(&lfs, &file, buffer, cfg.block_size) => cfg.block_size;
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     lfs_file_open(&lfs, &file, "exhaustion", LFS_O_WRONLY | LFS_O_CREAT);
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     for (lfs_size_t i = 0;
 | |
|             i < (cfg.block_count-4)*(cfg.block_size-8);
 | |
|             i += size) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     // remount to force reset of lookahead
 | |
|     lfs_unmount(&lfs) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
| 
 | |
|     // open hole
 | |
|     lfs_remove(&lfs, "bump") => 0;
 | |
| 
 | |
|     lfs_mkdir(&lfs, "splitdir") => 0;
 | |
|     lfs_file_open(&lfs, &file, "splitdir/bump",
 | |
|             LFS_O_WRONLY | LFS_O_CREAT) => 0;
 | |
|     for (lfs_size_t i = 0; i < cfg.block_size; i += 2) {
 | |
|         memcpy(&buffer[i], "hi", 2);
 | |
|     }
 | |
|     lfs_file_write(&lfs, &file, buffer, 2*cfg.block_size) => LFS_ERR_NOSPC;
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| '''
 | |
| 
 | |
| [[case]] # outdated lookahead test
 | |
| define.LFS_BLOCK_SIZE = 512
 | |
| define.LFS_BLOCK_COUNT = 1024
 | |
| if = 'LFS_BLOCK_SIZE == 512 and LFS_BLOCK_COUNT == 1024'
 | |
| code = '''
 | |
|     lfs_format(&lfs, &cfg) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
| 
 | |
|     // fill completely with two files
 | |
|     lfs_file_open(&lfs, &file, "exhaustion1",
 | |
|             LFS_O_WRONLY | LFS_O_CREAT) => 0;
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     for (lfs_size_t i = 0;
 | |
|             i < ((cfg.block_count-2)/2)*(cfg.block_size-8);
 | |
|             i += size) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     lfs_file_open(&lfs, &file, "exhaustion2",
 | |
|             LFS_O_WRONLY | LFS_O_CREAT) => 0;
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     for (lfs_size_t i = 0;
 | |
|             i < ((cfg.block_count-2+1)/2)*(cfg.block_size-8);
 | |
|             i += size) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     // remount to force reset of lookahead
 | |
|     lfs_unmount(&lfs) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
| 
 | |
|     // rewrite one file
 | |
|     lfs_file_open(&lfs, &file, "exhaustion1",
 | |
|             LFS_O_WRONLY | LFS_O_TRUNC) => 0;
 | |
|     lfs_file_sync(&lfs, &file) => 0;
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     for (lfs_size_t i = 0;
 | |
|             i < ((cfg.block_count-2)/2)*(cfg.block_size-8);
 | |
|             i += size) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     // rewrite second file, this requires lookahead does not
 | |
|     // use old population
 | |
|     lfs_file_open(&lfs, &file, "exhaustion2",
 | |
|             LFS_O_WRONLY | LFS_O_TRUNC) => 0;
 | |
|     lfs_file_sync(&lfs, &file) => 0;
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     for (lfs_size_t i = 0;
 | |
|             i < ((cfg.block_count-2+1)/2)*(cfg.block_size-8);
 | |
|             i += size) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| '''
 | |
| 
 | |
| [[case]] # outdated lookahead and split dir test
 | |
| define.LFS_BLOCK_SIZE = 512
 | |
| define.LFS_BLOCK_COUNT = 1024
 | |
| if = 'LFS_BLOCK_SIZE == 512 and LFS_BLOCK_COUNT == 1024'
 | |
| code = '''
 | |
|     lfs_format(&lfs, &cfg) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
| 
 | |
|     // fill completely with two files
 | |
|     lfs_file_open(&lfs, &file, "exhaustion1",
 | |
|             LFS_O_WRONLY | LFS_O_CREAT) => 0;
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     for (lfs_size_t i = 0;
 | |
|             i < ((cfg.block_count-2)/2)*(cfg.block_size-8);
 | |
|             i += size) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     lfs_file_open(&lfs, &file, "exhaustion2",
 | |
|             LFS_O_WRONLY | LFS_O_CREAT) => 0;
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     for (lfs_size_t i = 0;
 | |
|             i < ((cfg.block_count-2+1)/2)*(cfg.block_size-8);
 | |
|             i += size) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     // remount to force reset of lookahead
 | |
|     lfs_unmount(&lfs) => 0;
 | |
|     lfs_mount(&lfs, &cfg) => 0;
 | |
| 
 | |
|     // rewrite one file with a hole of one block
 | |
|     lfs_file_open(&lfs, &file, "exhaustion1",
 | |
|             LFS_O_WRONLY | LFS_O_TRUNC) => 0;
 | |
|     lfs_file_sync(&lfs, &file) => 0;
 | |
|     size = strlen("blahblahblahblah");
 | |
|     memcpy(buffer, "blahblahblahblah", size);
 | |
|     for (lfs_size_t i = 0;
 | |
|             i < ((cfg.block_count-2)/2 - 1)*(cfg.block_size-8);
 | |
|             i += size) {
 | |
|         lfs_file_write(&lfs, &file, buffer, size) => size;
 | |
|     }
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     // try to allocate a directory, should fail!
 | |
|     lfs_mkdir(&lfs, "split") => LFS_ERR_NOSPC;
 | |
| 
 | |
|     // file should not fail
 | |
|     lfs_file_open(&lfs, &file, "notasplit",
 | |
|             LFS_O_WRONLY | LFS_O_CREAT) => 0;
 | |
|     lfs_file_write(&lfs, &file, "hi", 2) => 2;
 | |
|     lfs_file_close(&lfs, &file) => 0;
 | |
| 
 | |
|     lfs_unmount(&lfs) => 0;
 | |
| '''
 |