mirror of
				https://github.com/torvalds/linux.git
				synced 2025-11-04 10:40:15 +02:00 
			
		
		
		
	Btrfs set/get macros lose type information needed to avoid unaligned accesses on sparc64. ere is a patch for the kernel bits which fixes most of the unaligned accesses on sparc64. btrfs_name_hash is modified to return the hash value instead of getting a return location via a (potentially unaligned) pointer. Signed-off-by: Chris Mason <chris.mason@oracle.com>
		
			
				
	
	
		
			111 lines
		
	
	
	
		
			3.7 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
			
		
		
	
	
			111 lines
		
	
	
	
		
			3.7 KiB
		
	
	
	
		
			C
		
	
	
	
	
	
/*
 | 
						|
 * Copyright (C) 2007 Oracle.  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 will 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 to the
 | 
						|
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 | 
						|
 * Boston, MA 021110-1307, USA.
 | 
						|
 */
 | 
						|
 | 
						|
#include <linux/highmem.h>
 | 
						|
#define BTRFS_SETGET_FUNCS(name, type, member, bits)			\
 | 
						|
u##bits btrfs_##name(struct extent_buffer *eb,				\
 | 
						|
				   type *s)				\
 | 
						|
{									\
 | 
						|
	unsigned long part_offset = (unsigned long)s;			\
 | 
						|
	unsigned long offset = part_offset + offsetof(type, member);	\
 | 
						|
	type *p;							\
 | 
						|
	/* ugly, but we want the fast path here */			\
 | 
						|
	if (eb->map_token && offset >= eb->map_start &&			\
 | 
						|
	    offset + sizeof(((type *)0)->member) <= eb->map_start +	\
 | 
						|
	    eb->map_len) {						\
 | 
						|
		p = (type *)(eb->kaddr + part_offset - eb->map_start);	\
 | 
						|
		return le##bits##_to_cpu(p->member);			\
 | 
						|
	}								\
 | 
						|
	{								\
 | 
						|
		int err;						\
 | 
						|
		char *map_token;					\
 | 
						|
		char *kaddr;						\
 | 
						|
		int unmap_on_exit = (eb->map_token == NULL);		\
 | 
						|
		unsigned long map_start;				\
 | 
						|
		unsigned long map_len;					\
 | 
						|
		__le##bits res;						\
 | 
						|
		err = map_extent_buffer(eb, offset,			\
 | 
						|
			        sizeof(((type *)0)->member),		\
 | 
						|
				&map_token, &kaddr,			\
 | 
						|
				&map_start, &map_len, KM_USER1);	\
 | 
						|
		if (err) {						\
 | 
						|
			read_eb_member(eb, s, type, member, &res);	\
 | 
						|
			return le##bits##_to_cpu(res);			\
 | 
						|
		}							\
 | 
						|
		p = (type *)(kaddr + part_offset - map_start);		\
 | 
						|
		res = le##bits##_to_cpu(p->member);			\
 | 
						|
		if (unmap_on_exit)					\
 | 
						|
			unmap_extent_buffer(eb, map_token, KM_USER1);	\
 | 
						|
		return res;						\
 | 
						|
	}								\
 | 
						|
}									\
 | 
						|
void btrfs_set_##name(struct extent_buffer *eb,				\
 | 
						|
				    type *s, u##bits val)		\
 | 
						|
{									\
 | 
						|
	unsigned long part_offset = (unsigned long)s;			\
 | 
						|
	unsigned long offset = part_offset + offsetof(type, member);	\
 | 
						|
	type *p;							\
 | 
						|
	/* ugly, but we want the fast path here */			\
 | 
						|
	if (eb->map_token && offset >= eb->map_start &&			\
 | 
						|
	    offset + sizeof(((type *)0)->member) <= eb->map_start +	\
 | 
						|
	    eb->map_len) {						\
 | 
						|
		p = (type *)(eb->kaddr + part_offset - eb->map_start);	\
 | 
						|
		p->member = cpu_to_le##bits(val);			\
 | 
						|
		return;							\
 | 
						|
	}								\
 | 
						|
	{								\
 | 
						|
		int err;						\
 | 
						|
		char *map_token;					\
 | 
						|
		char *kaddr;						\
 | 
						|
		int unmap_on_exit = (eb->map_token == NULL);		\
 | 
						|
		unsigned long map_start;				\
 | 
						|
		unsigned long map_len;					\
 | 
						|
		err = map_extent_buffer(eb, offset,			\
 | 
						|
			        sizeof(((type *)0)->member),		\
 | 
						|
				&map_token, &kaddr,			\
 | 
						|
				&map_start, &map_len, KM_USER1);	\
 | 
						|
		if (err) {						\
 | 
						|
			val = cpu_to_le##bits(val);			\
 | 
						|
			write_eb_member(eb, s, type, member, &val);	\
 | 
						|
			return;						\
 | 
						|
		}							\
 | 
						|
		p = (type *)(kaddr + part_offset - map_start);		\
 | 
						|
		p->member = cpu_to_le##bits(val);			\
 | 
						|
		if (unmap_on_exit)					\
 | 
						|
			unmap_extent_buffer(eb, map_token, KM_USER1);	\
 | 
						|
	}								\
 | 
						|
}
 | 
						|
 | 
						|
#include "ctree.h"
 | 
						|
 | 
						|
void btrfs_node_key(struct extent_buffer *eb,
 | 
						|
		    struct btrfs_disk_key *disk_key, int nr)
 | 
						|
{
 | 
						|
	unsigned long ptr = btrfs_node_key_ptr_offset(nr);
 | 
						|
	if (eb->map_token && ptr >= eb->map_start &&
 | 
						|
	    ptr + sizeof(*disk_key) <= eb->map_start + eb->map_len) {
 | 
						|
		memcpy(disk_key, eb->kaddr + ptr - eb->map_start,
 | 
						|
			sizeof(*disk_key));
 | 
						|
		return;
 | 
						|
	} else if (eb->map_token) {
 | 
						|
		unmap_extent_buffer(eb, eb->map_token, KM_USER1);
 | 
						|
		eb->map_token = NULL;
 | 
						|
	}
 | 
						|
	read_eb_member(eb, (struct btrfs_key_ptr *)ptr,
 | 
						|
		       struct btrfs_key_ptr, key, disk_key);
 | 
						|
}
 |