2 * fs_reiserfs.c - an implementation for the Reiser filesystem
4 * Copyright (C) 2001 Jeffrey Mahoney (jeffm@suse.com)
8 * Copyright (C) 2000, 2001 Free Software Foundation, Inc.
10 * This program is free software; you can redistribute it and/or modify
11 * it under the terms of the GNU General Public License as published by
12 * the Free Software Foundation; either version 2 of the License, or
13 * (at your option) any later version.
15 * This program is distributed in the hope that it will be useful,
16 * but WITHOUT ANY WARRANTY; without even the implied warranty of
17 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 * GNU General Public License for more details.
20 * You should have received a copy of the GNU General Public License
21 * along with this program; if not, write to the Free Software
22 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
33 #include "reiserfs/reiserfs.h"
35 /* Exported in struct fs_t */
36 static int reiserfs_open( struct boot_file_t *file, const char *dev_name,
37 struct partition_t *part, const char *file_name );
38 static int reiserfs_read( struct boot_file_t *file, unsigned int size,
41 static int reiserfs_seek( struct boot_file_t *file, unsigned int newpos );
42 static int reiserfs_close( struct boot_file_t *file );
44 struct fs_t reiserfs_filesystem = {
52 static int reiserfs_read_super( void );
53 static int reiserfs_open_file( char *dirname );
54 static int reiserfs_read_data( char *buf, __u32 len );
57 static struct reiserfs_state reiserfs;
58 static struct reiserfs_state *INFO = &reiserfs;
60 /* Adapted from GRUB: */
61 static char FSYS_BUF[FSYSREISER_CACHE_SIZE];
66 reiserfs_open( struct boot_file_t *file, const char *dev_name,
67 struct partition_t *part, const char *file_name )
69 static char buffer[1024];
74 memset( INFO, 0, sizeof(struct reiserfs_state) );
79 DEBUG_F( "Determining offset for partition %d\n", part->part_number );
80 INFO->partition_offset = ((uint64_t)part->part_start) * part->blocksize;
81 DEBUG_F( "%Lu = %lu * %hu\n", INFO->partition_offset,
86 INFO->partition_offset = 0;
88 strncpy(buffer, dev_name, 1020);
89 if (_machine != _MACH_bplan)
90 strcat(buffer, ":0"); /* 0 is full disk in (non-buggy) OF */
92 file->of_device = prom_open( buffer );
93 DEBUG_F( "Trying to open dev_name=%s; filename=%s; partition offset=%Lu\n",
94 buffer, file_name, INFO->partition_offset );
96 if ( file->of_device == PROM_INVALID_HANDLE || file->of_device == NULL )
98 DEBUG_F( "Can't open device %p\n", file->of_device );
99 DEBUG_LEAVE(FILE_ERR_BADDEV);
100 return FILE_ERR_BADDEV;
103 DEBUG_F("%p was successfully opened\n", file->of_device);
105 if ( reiserfs_read_super() != 1 )
107 DEBUG_F( "Couldn't open ReiserFS @ %s/%Lu\n", buffer, INFO->partition_offset );
108 prom_close( file->of_device );
109 DEBUG_LEAVE(FILE_ERR_BAD_FSYS);
110 return FILE_ERR_BAD_FSYS;
113 DEBUG_F( "Attempting to open %s\n", file_name );
114 strcpy(buffer, file_name); /* reiserfs_open_file modifies argument */
115 if (reiserfs_open_file(buffer) == 0)
117 DEBUG_F( "reiserfs_open_file failed. errnum = %d\n", errnum );
118 prom_close( file->of_device );
119 DEBUG_LEAVE_F(errnum);
123 DEBUG_F( "Successfully opened %s\n", file_name );
125 DEBUG_LEAVE(FILE_ERR_OK);
131 reiserfs_read( struct boot_file_t *file, unsigned int size, void *buffer )
133 return reiserfs_read_data( buffer, size );
137 reiserfs_seek( struct boot_file_t *file, unsigned int newpos )
144 reiserfs_close( struct boot_file_t *file )
146 if( file->of_device )
148 prom_close(file->of_device);
150 DEBUG_F("reiserfs_close called\n");
156 static __inline__ __u32
160 while( word && (word & (1 << ++i)) == 0 );
164 static __inline__ int
165 is_power_of_two( unsigned long word )
167 return ( word & -word ) == word;
171 read_disk_block( struct boot_file_t *file, __u32 block, __u32 start,
172 __u32 length, void *buf )
174 __u16 fs_blocksize = INFO->blocksize == 0 ? REISERFS_OLD_BLOCKSIZE
176 unsigned long long pos = (unsigned long long)block * (unsigned long long)fs_blocksize;
177 pos += (unsigned long long)INFO->partition_offset + (unsigned long long)start;
178 DEBUG_F( "Reading %u bytes, starting at block %u, disk offset %Lu\n",
179 length, block, pos );
180 if (!prom_lseek( file->of_device, pos )) {
181 DEBUG_F("prom_lseek failed\n");
184 return prom_read( file->of_device, buf, length );
189 journal_read( __u32 block, __u32 len, char *buffer )
191 return read_disk_block( INFO->file,
192 (INFO->journal_block + block), 0,
196 /* Read a block from ReiserFS file system, taking the journal into
197 * account. If the block nr is in the journal, the block from the
201 block_read( __u32 blockNr, __u32 start, __u32 len, char *buffer )
203 __u32 transactions = INFO->journal_transactions;
204 __u32 desc_block = INFO->journal_first_desc;
205 __u32 journal_mask = INFO->journal_block_count - 1;
206 __u32 translatedNr = blockNr;
207 __u32 *journal_table = JOURNAL_START;
209 // DEBUG_F( "block_read( %u, %u, %u, ..)\n", blockNr, start, len );
211 while ( transactions-- > 0 )
216 if ( *journal_table != 0xffffffff )
218 /* Search for the blockNr in cached journal */
219 j_len = le32_to_cpu(*journal_table++);
220 while ( i++ < j_len )
222 if ( le32_to_cpu(*journal_table++) == blockNr )
224 journal_table += j_len - i;
231 /* This is the end of cached journal marker. The remaining
232 * transactions are still on disk. */
233 struct reiserfs_journal_desc desc;
234 struct reiserfs_journal_commit commit;
236 if ( !journal_read( desc_block, sizeof(desc), (char *) &desc ) )
239 j_len = le32_to_cpu(desc.j_len);
240 while ( i < j_len && i < JOURNAL_TRANS_HALF )
241 if ( le32_to_cpu(desc.j_realblock[i++]) == blockNr )
244 if ( j_len >= JOURNAL_TRANS_HALF )
246 int commit_block = ( desc_block + 1 + j_len ) & journal_mask;
248 if ( !journal_read( commit_block,
249 sizeof(commit), (char *) &commit ) )
253 if ( le32_to_cpu(commit.j_realblock[i++ - JOURNAL_TRANS_HALF]) == blockNr )
261 INFO->journal_block + ( ( desc_block + i ) & journal_mask );
263 DEBUG_F( "block_read: block %u is mapped to journal block %u.\n",
264 blockNr, translatedNr - INFO->journal_block );
266 /* We must continue the search, as this block may be overwritten in
267 * later transactions. */
269 desc_block = (desc_block + 2 + j_len) & journal_mask;
272 return read_disk_block( INFO->file, translatedNr, start, len, buffer );
275 /* Init the journal data structure. We try to cache as much as
276 * possible in the JOURNAL_START-JOURNAL_END space, but if it is full
277 * we can still read the rest from the disk on demand.
279 * The first number of valid transactions and the descriptor block of the
280 * first valid transaction are held in INFO. The transactions are all
281 * adjacent, but we must take care of the journal wrap around.
286 struct reiserfs_journal_header header;
287 struct reiserfs_journal_desc desc;
288 struct reiserfs_journal_commit commit;
289 __u32 block_count = INFO->journal_block_count;
293 __u32 *journal_table = JOURNAL_START;
295 journal_read( block_count, sizeof ( header ), ( char * ) &header );
296 desc_block = le32_to_cpu(header.j_first_unflushed_offset);
297 if ( desc_block >= block_count )
300 INFO->journal_transactions = 0;
301 INFO->journal_first_desc = desc_block;
302 next_trans_id = le32_to_cpu(header.j_last_flush_trans_id) + 1;
304 DEBUG_F( "journal_init: last flushed %u\n", le32_to_cpu(header.j_last_flush_trans_id) );
308 journal_read( desc_block, sizeof(desc), (char *) &desc );
309 if ( strcmp( JOURNAL_DESC_MAGIC, desc.j_magic ) != 0
310 || desc.j_trans_id != next_trans_id
311 || desc.j_mount_id != header.j_mount_id )
312 /* no more valid transactions */
315 commit_block = ( desc_block + le32_to_cpu(desc.j_len) + 1 ) & ( block_count - 1 );
316 journal_read( commit_block, sizeof(commit), (char *) &commit );
317 if ( desc.j_trans_id != commit.j_trans_id
318 || desc.j_len != commit.j_len )
319 /* no more valid transactions */
323 DEBUG_F( "Found valid transaction %u/%u at %u.\n",
324 le32_to_cpu(desc.j_trans_id), le32_to_cpu(desc.j_mount_id),
329 if ( journal_table < JOURNAL_END )
331 if ( ( journal_table + 1 + le32_to_cpu(desc.j_len) ) >= JOURNAL_END )
333 /* The table is almost full; mark the end of the cached * *
335 *journal_table = 0xffffffff;
336 journal_table = JOURNAL_END;
342 /* Cache the length and the realblock numbers in the table. *
343 * The block number of descriptor can easily be computed. *
344 * and need not to be stored here. */
345 *journal_table++ = desc.j_len;
346 for ( i = 0; i < le32_to_cpu(desc.j_len) && i < JOURNAL_TRANS_HALF; i++ )
348 *journal_table++ = desc.j_realblock[i];
350 DEBUG_F( "block %u is in journal %u.\n",
351 le32_to_cpu(desc.j_realblock[i]), desc_block );
354 for ( ; i < le32_to_cpu(desc.j_len); i++ )
357 commit.j_realblock[i - JOURNAL_TRANS_HALF];
359 DEBUG_F( "block %u is in journal %u.\n",
360 le32_to_cpu(commit.j_realblock[i - JOURNAL_TRANS_HALF]),
366 desc_block = (commit_block + 1) & (block_count - 1);
369 DEBUG_F( "Transaction %u/%u at %u isn't valid.\n",
370 le32_to_cpu(desc.j_trans_id), le32_to_cpu(desc.j_mount_id),
374 INFO->journal_transactions
375 = next_trans_id - le32_to_cpu(header.j_last_flush_trans_id) - 1;
376 return (errnum == 0);
379 /* check filesystem types and read superblock into memory buffer */
381 reiserfs_read_super( void )
383 struct reiserfs_super_block super;
384 __u64 superblock = REISERFS_SUPERBLOCK_BLOCK;
386 if (read_disk_block(INFO->file, superblock, 0, sizeof(super), &super) != sizeof(super)) {
387 DEBUG_F("read_disk_block failed!\n");
391 DEBUG_F( "Found super->magic: \"%s\"\n", super.s_magic );
393 if( strcmp( REISER2FS_SUPER_MAGIC_STRING, super.s_magic ) != 0 &&
394 strcmp( REISERFS_SUPER_MAGIC_STRING, super.s_magic ) != 0 )
396 /* Try old super block position */
397 superblock = REISERFS_OLD_SUPERBLOCK_BLOCK;
399 if (read_disk_block( INFO->file, superblock, 0, sizeof (super), &super ) != sizeof(super)) {
400 DEBUG_F("read_disk_block failed!\n");
404 if ( strcmp( REISER2FS_SUPER_MAGIC_STRING, super.s_magic ) != 0 &&
405 strcmp( REISERFS_SUPER_MAGIC_STRING, super.s_magic ) != 0 )
407 /* pre journaling super block - untested */
408 if ( strcmp( REISERFS_SUPER_MAGIC_STRING,
409 (char *) ((__u32) &super + 20 ) ) != 0 )
412 super.s_blocksize = cpu_to_le16(REISERFS_OLD_BLOCKSIZE);
413 super.s_journal_block = 0;
418 DEBUG_F( "ReiserFS superblock data:\n" );
419 DEBUG_F( "Block count: %u\n", le32_to_cpu(super.s_block_count) )
420 DEBUG_F( "Free blocks: %u\n", le32_to_cpu(super.s_free_blocks) );
421 DEBUG_F( "Journal block: %u\n", le32_to_cpu(super.s_journal_block) );
422 DEBUG_F( "Journal size (in blocks): %u\n",
423 le32_to_cpu(super.s_orig_journal_size) );
424 DEBUG_F( "Root block: %u\n\n", le32_to_cpu(super.s_root_block) );
427 INFO->version = le16_to_cpu(super.s_version);
428 INFO->blocksize = le16_to_cpu(super.s_blocksize);
429 INFO->blocksize_shift = log2( INFO->blocksize );
431 INFO->journal_block = le32_to_cpu(super.s_journal_block);
432 INFO->journal_block_count = le32_to_cpu(super.s_orig_journal_size);
434 INFO->cached_slots = (FSYSREISER_CACHE_SIZE >> INFO->blocksize_shift) - 1;
436 /* At this point, we've found a valid superblock. If we run into problems
437 * mounting the FS, the user should probably know. */
439 /* A few sanity checks ... */
440 if ( INFO->version > REISERFS_MAX_SUPPORTED_VERSION )
442 prom_printf( "ReiserFS: Unsupported version field: %u\n",
447 if ( INFO->blocksize < FSYSREISER_MIN_BLOCKSIZE
448 || INFO->blocksize > FSYSREISER_MAX_BLOCKSIZE )
450 prom_printf( "ReiserFS: Unsupported block size: %u\n",
455 /* Setup the journal.. */
456 if ( INFO->journal_block != 0 )
458 if ( !is_power_of_two( INFO->journal_block_count ) )
460 prom_printf( "ReiserFS: Unsupported journal size, "
461 "not a power of 2: %u\n",
462 INFO->journal_block_count );
467 /* Read in super block again, maybe it is in the journal */
468 block_read( superblock, 0, sizeof (struct reiserfs_super_block),
472 /* Read in the root block */
473 if ( !block_read( le32_to_cpu(super.s_root_block), 0,
474 INFO->blocksize, ROOT ) )
476 prom_printf( "ReiserFS: Failed to read in root block\n" );
480 /* The root node is always the "deepest", so we can
481 determine the hieght of the tree using it. */
482 INFO->tree_depth = blkh_level(BLOCKHEAD(ROOT));
485 DEBUG_F( "root read_in: block=%u, depth=%u\n",
486 le32_to_cpu(super.s_root_block), INFO->tree_depth );
488 if ( INFO->tree_depth >= REISERFS_MAX_TREE_HEIGHT )
490 prom_printf( "ReiserFS: Unsupported tree depth (too deep): %u\n",
495 if ( INFO->tree_depth == BLKH_LEVEL_LEAF )
497 /* There is only one node in the whole filesystem, which is
498 simultanously leaf and root */
499 memcpy( LEAF, ROOT, INFO->blocksize );
504 /***************** TREE ACCESSING METHODS *****************************/
506 /* I assume you are familiar with the ReiserFS tree, if not go to
507 * http://devlinux.com/projects/reiserfs/
509 * My tree node cache is organized as following
511 * 1 LEAF node (if the ROOT is also a LEAF it is copied here
512 * 2-n other nodes on current path from bottom to top.
513 * if there is not enough space in the cache, the top most are
516 * I have only two methods to find a key in the tree:
517 * search_stat(dir_id, objectid) searches for the stat entry (always
518 * the first entry) of an object.
519 * next_key() gets the next key in tree order.
521 * This means, that I can only sequential reads of files are
522 * efficient, but this really doesn't hurt for grub.
525 /* Read in the node at the current path and depth into the node cache.
526 * You must set INFO->blocks[depth] before.
529 read_tree_node( __u32 blockNr, __u16 depth )
531 char *cache = CACHE(depth);
532 int num_cached = INFO->cached_slots;
535 if ( depth < num_cached )
537 /* This is the cached part of the path.
538 Check if same block is needed. */
539 if ( blockNr == INFO->blocks[depth] )
543 cache = CACHE(num_cached);
545 DEBUG_F( " next read_in: block=%u (depth=%u)\n", blockNr, depth );
547 if ( !block_read( blockNr, 0, INFO->blocksize, cache ) )
549 DEBUG_F( "block_read failed\n" );
553 DEBUG_F( "FOUND: blk_level=%u, blk_nr_item=%u, blk_free_space=%u\n",
554 blkh_level(BLOCKHEAD(cache)),
555 blkh_nr_item(BLOCKHEAD(cache)),
556 le16_to_cpu(BLOCKHEAD(cache)->blk_free_space) );
558 /* Make sure it has the right node level */
559 if ( blkh_level(BLOCKHEAD(cache)) != depth )
561 DEBUG_F( "depth = %u != %u\n", blkh_level(BLOCKHEAD(cache)), depth );
562 DEBUG_LEAVE(FILE_ERR_BAD_FSYS);
563 errnum = FILE_ERR_BAD_FSYS;
567 INFO->blocks[depth] = blockNr;
571 /* Get the next key, i.e. the key following the last retrieved key in
572 * tree order. INFO->current_ih and
573 * INFO->current_info are adapted accordingly. */
578 struct item_head *ih = INFO->current_ih + 1;
582 DEBUG_F( "next_key:\n old ih: key %u:%u:%u:%u version:%u\n",
583 le32_to_cpu(INFO->current_ih->ih_key.k_dir_id),
584 le32_to_cpu(INFO->current_ih->ih_key.k_objectid),
585 le32_to_cpu(INFO->current_ih->ih_key.u.k_offset_v1.k_offset),
586 le32_to_cpu(INFO->current_ih->ih_key.u.k_offset_v1.k_uniqueness),
587 ih_version(INFO->current_ih) );
590 if ( ih == &ITEMHEAD[blkh_nr_item(BLOCKHEAD( LEAF ))] )
592 depth = BLKH_LEVEL_LEAF;
593 /* The last item, was the last in the leaf node. * Read in the next
597 if ( depth == INFO->tree_depth )
599 /* There are no more keys at all. * Return a dummy item with
602 ( struct item_head * )
603 &BLOCKHEAD( LEAF )->blk_right_delim_key;
608 DEBUG_F( " depth=%u, i=%u\n", depth, INFO->next_key_nr[depth] );
611 while ( INFO->next_key_nr[depth] == 0 );
613 if ( depth == INFO->tree_depth )
615 else if ( depth <= INFO->cached_slots )
616 cache = CACHE( depth );
619 cache = read_tree_node( INFO->blocks[depth], --depth );
626 __u16 nr_item = blkh_nr_item(BLOCKHEAD( cache ));
627 int key_nr = INFO->next_key_nr[depth]++;
630 DEBUG_F( " depth=%u, i=%u/%u\n", depth, key_nr, nr_item );
632 if ( key_nr == nr_item )
633 /* This is the last item in this block, set the next_key_nr *
635 INFO->next_key_nr[depth] = 0;
638 read_tree_node( dc_block_number( &(DC( cache )[key_nr])),
643 while ( depth > BLKH_LEVEL_LEAF );
648 INFO->current_ih = ih;
649 INFO->current_item = &LEAF[ih_location(ih)];
651 DEBUG_F( " new ih: key %u:%u:%u:%u version:%u\n",
652 le32_to_cpu(INFO->current_ih->ih_key.k_dir_id),
653 le32_to_cpu(INFO->current_ih->ih_key.k_objectid),
654 le32_to_cpu(INFO->current_ih->ih_key.u.k_offset_v1.k_offset),
655 le32_to_cpu(INFO->current_ih->ih_key.u.k_offset_v1.k_uniqueness),
656 ih_version(INFO->current_ih) );
661 /* preconditions: reiserfs_read_super already executed, therefore
662 * INFO block is valid
663 * returns: 0 if error (errnum is set),
664 * nonzero iff we were able to find the key successfully.
665 * postconditions: on a nonzero return, the current_ih and
666 * current_item fields describe the key that equals the
667 * searched key. INFO->next_key contains the next key after
669 * side effects: messes around with the cache.
672 search_stat( __u32 dir_id, __u32 objectid )
678 struct item_head *ih;
681 DEBUG_F( "search_stat:\n key %u:%u:0:0\n", le32_to_cpu(dir_id),
682 le32_to_cpu(objectid) );
685 depth = INFO->tree_depth;
688 DEBUG_F( "depth = %d\n", depth );
689 while ( depth > BLKH_LEVEL_LEAF )
693 nr_item = blkh_nr_item(BLOCKHEAD( cache ));
697 for ( i = 0; i < nr_item; i++ )
699 if (le32_to_cpu(key->k_dir_id) > le32_to_cpu(dir_id)
700 || (key->k_dir_id == dir_id
701 && (le32_to_cpu(key->k_objectid) > le32_to_cpu(objectid)
702 || (key->k_objectid == objectid
703 && (key->u.k_offset_v1.k_offset
704 | key->u.k_offset_v1.k_uniqueness) > 0))))
710 DEBUG_F( " depth=%d, i=%d/%d\n", depth, i, nr_item );
712 INFO->next_key_nr[depth] = ( i == nr_item ) ? 0 : i + 1;
713 cache = read_tree_node( dc_block_number(&(DC(cache)[i])), --depth );
719 nr_item = blkh_nr_item(BLOCKHEAD(LEAF));
721 DEBUG_F( "nr_item = %d\n", nr_item );
722 for ( i = 0; i < nr_item; i++ )
724 if ( ih->ih_key.k_dir_id == dir_id
725 && ih->ih_key.k_objectid == objectid
726 && ih->ih_key.u.k_offset_v1.k_offset == 0
727 && ih->ih_key.u.k_offset_v1.k_uniqueness == 0 )
730 DEBUG_F( " depth=%d, i=%d/%d\n", depth, i, nr_item );
732 INFO->current_ih = ih;
733 INFO->current_item = &LEAF[ih_location(ih)];
741 DEBUG_LEAVE(FILE_ERR_BAD_FSYS);
742 errnum = FILE_ERR_BAD_FSYS;
747 reiserfs_read_data( char *buf, __u32 len )
752 char *prev_buf = buf;
755 DEBUG_F( "reiserfs_read_data: INFO->file->pos=%Lu len=%u, offset=%Lu\n",
756 INFO->file->pos, len, (__u64) IH_KEY_OFFSET(INFO->current_ih) - 1 );
759 if ( INFO->current_ih->ih_key.k_objectid != INFO->fileinfo.k_objectid
760 || IH_KEY_OFFSET( INFO->current_ih ) > INFO->file->pos + 1 )
762 search_stat( INFO->fileinfo.k_dir_id, INFO->fileinfo.k_objectid );
766 while ( errnum == 0 )
768 if ( INFO->current_ih->ih_key.k_objectid != INFO->fileinfo.k_objectid )
771 offset = INFO->file->pos - IH_KEY_OFFSET( INFO->current_ih ) + 1;
772 blocksize = ih_item_len(INFO->current_ih);
775 DEBUG_F( " loop: INFO->file->pos=%Lu len=%u, offset=%u blocksize=%u\n",
776 INFO->file->pos, len, offset, blocksize );
779 if ( IH_KEY_ISTYPE( INFO->current_ih, TYPE_DIRECT )
780 && offset < blocksize )
782 to_read = blocksize - offset;
786 memcpy( buf, INFO->current_item + offset, to_read );
789 else if ( IH_KEY_ISTYPE( INFO->current_ih, TYPE_INDIRECT ) )
791 blocksize = ( blocksize >> 2 ) << INFO->blocksize_shift;
793 while ( offset < blocksize )
795 __u32 blocknr = le32_to_cpu(((__u32 *)
796 INFO->current_item)[offset >> INFO->blocksize_shift]);
798 int blk_offset = offset & (INFO->blocksize - 1);
800 to_read = INFO->blocksize - blk_offset;
804 /* Journal is only for meta data.
805 Data blocks can be read directly without using block_read */
806 read_disk_block( INFO->file, blocknr, blk_offset, to_read,
813 INFO->file->pos += to_read;
822 return (errnum != 0) ? 0 : buf - prev_buf;
826 /* preconditions: reiserfs_read_super already executed, therefore
827 * INFO block is valid
828 * returns: 0 if error, nonzero iff we were able to find the file successfully
829 * postconditions: on a nonzero return, INFO->fileinfo contains the info
830 * of the file we were trying to look up, filepos is 0 and filemax is
831 * the size of the file.
834 reiserfs_open_file( char *dirname )
836 struct reiserfs_de_head *de_head;
838 __u32 dir_id, objectid, parent_dir_id = 0, parent_objectid = 0;
840 char linkbuf[PATH_MAX]; /* buffer for following symbolic links */
845 dir_id = cpu_to_le32(REISERFS_ROOT_PARENT_OBJECTID);
846 objectid = cpu_to_le32(REISERFS_ROOT_OBJECTID);
851 DEBUG_F( "dirname=%s\n", dirname );
853 /* Search for the stat info first. */
854 if ( !search_stat( dir_id, objectid ) )
858 DEBUG_F( "sd_mode=0%o sd_size=%Lu\n",
859 sd_mode((struct stat_data *) INFO->current_item ),
860 sd_size(INFO->current_ih, INFO->current_item ));
863 mode = sd_mode((struct stat_data *)INFO->current_item);
865 /* If we've got a symbolic link, then chase it. */
866 if ( S_ISLNK( mode ) )
870 DEBUG_F("link count = %d\n", link_count);
872 if ( ++link_count > MAX_LINK_COUNT )
874 DEBUG_F("Symlink loop\n");
875 errnum = FILE_ERR_SYMLINK_LOOP;
879 /* Get the symlink size. */
880 INFO->file->len = sd_size(INFO->current_ih, INFO->current_item);
882 /* Find out how long our remaining name is. */
883 while ( dirname[len] && !isspace( dirname[len] ) )
886 if ( INFO->file->len + len > sizeof ( linkbuf ) - 1 )
888 errnum = FILE_ERR_LENGTH;
892 /* Copy the remaining name to the end of the symlink data. Note *
893 * that DIRNAME and LINKBUF may overlap! */
894 memmove( linkbuf + INFO->file->len, dirname, len + 1 );
896 INFO->fileinfo.k_dir_id = dir_id;
897 INFO->fileinfo.k_objectid = objectid;
900 || reiserfs_read_data( linkbuf, INFO->file->len ) != INFO->file->len ) {
901 DEBUG_F("reiserfs_open_file - if !next_key || reiserfs_read_data\n");
908 DEBUG_F( "symlink=%s\n", linkbuf );
912 if ( *dirname == '/' )
914 /* It's an absolute link, so look it up in root. */
915 dir_id = cpu_to_le32(REISERFS_ROOT_PARENT_OBJECTID);
916 objectid = cpu_to_le32(REISERFS_ROOT_OBJECTID);
920 /* Relative, so look it up in our parent directory. */
921 dir_id = parent_dir_id;
922 objectid = parent_objectid;
925 /* Now lookup the new name. */
929 /* if we have a real file (and we're not just printing *
930 * possibilities), then this is where we want to exit */
932 if ( !*dirname || isspace( *dirname ) )
934 if ( !S_ISREG( mode ) )
936 errnum = FILE_ERR_BAD_TYPE;
941 INFO->file->len = sd_size(INFO->current_ih, INFO->current_item);
943 INFO->fileinfo.k_dir_id = dir_id;
944 INFO->fileinfo.k_objectid = objectid;
948 /* continue with the file/directory name interpretation */
949 while ( *dirname == '/' )
951 if ( !S_ISDIR( mode ) )
953 errnum = FILE_ERR_NOTDIR;
956 for ( rest = dirname; ( ch = *rest ) && !isspace( ch ) && ch != '/';
968 if ( INFO->current_ih->ih_key.k_objectid != objectid )
971 name_end = INFO->current_item + ih_item_len(INFO->current_ih);
972 de_head = ( struct reiserfs_de_head * ) INFO->current_item;
973 num_entries = ih_entry_count(INFO->current_ih);
974 while ( num_entries > 0 )
976 char *filename = INFO->current_item + deh_location(de_head);
977 char tmp = *name_end;
979 if( deh_state(de_head) & (1 << DEH_Visible))
983 /* Directory names in ReiserFS are not null * terminated.
984 * We write a temporary 0 behind it. * NOTE: that this
985 * may overwrite the first block in * the tree cache.
986 * That doesn't hurt as long as we * don't call next_key
989 cmp = strcmp( dirname, filename );
994 /* The beginning of this name marks the end of the next name.
1002 errnum = FILE_ERR_NOTFOUND;
1010 parent_dir_id = dir_id;
1011 parent_objectid = objectid;
1012 dir_id = de_head->deh_dir_id; /* LE */
1013 objectid = de_head->deh_objectid; /* LE */
1019 #ifndef __LITTLE_ENDIAN
1021 struct offset_v2 offset_v2;
1023 } offset_v2_esafe_overlay;
1026 offset_v2_k_type( struct offset_v2 *v2 )
1028 offset_v2_esafe_overlay tmp = *(offset_v2_esafe_overlay *)v2;
1029 tmp.linear = le64_to_cpu( tmp.linear );
1030 return tmp.offset_v2.k_type;
1034 offset_v2_k_offset( struct offset_v2 *v2 )
1036 offset_v2_esafe_overlay tmp = *(offset_v2_esafe_overlay *)v2;
1037 tmp.linear = le64_to_cpu( tmp.linear );
1038 return tmp.offset_v2.k_offset;
1043 uniqueness2type (__u32 uniqueness)
1045 switch (uniqueness) {
1046 case V1_SD_UNIQUENESS: return TYPE_STAT_DATA;
1047 case V1_INDIRECT_UNIQUENESS: return TYPE_INDIRECT;
1048 case V1_DIRECT_UNIQUENESS: return TYPE_DIRECT;
1049 case V1_DIRENTRY_UNIQUENESS: return TYPE_DIRENTRY;
1056 * c-file-style: "k&r"