Blame view

include/asm-generic/div64.h 1.34 KB
1da177e4c   Linus Torvalds   Linux-2.6.12-rc2
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
  #ifndef _ASM_GENERIC_DIV64_H
  #define _ASM_GENERIC_DIV64_H
  /*
   * Copyright (C) 2003 Bernardo Innocenti <bernie@develer.com>
   * Based on former asm-ppc/div64.h and asm-m68knommu/div64.h
   *
   * The semantics of do_div() are:
   *
   * uint32_t do_div(uint64_t *n, uint32_t base)
   * {
   * 	uint32_t remainder = *n % base;
   * 	*n = *n / base;
   * 	return remainder;
   * }
   *
   * NOTE: macro parameter n is evaluated multiple times,
   *       beware of side effects!
   */
  
  #include <linux/types.h>
  #include <linux/compiler.h>
  
  #if BITS_PER_LONG == 64
  
  # define do_div(n,base) ({					\
  	uint32_t __base = (base);				\
  	uint32_t __rem;						\
  	__rem = ((uint64_t)(n)) % __base;			\
  	(n) = ((uint64_t)(n)) / __base;				\
  	__rem;							\
   })
  
  #elif BITS_PER_LONG == 32
  
  extern uint32_t __div64_32(uint64_t *dividend, uint32_t divisor);
  
  /* The unnecessary pointer compare is there
   * to check for type safety (n must be 64bit)
   */
  # define do_div(n,base) ({				\
  	uint32_t __base = (base);			\
  	uint32_t __rem;					\
  	(void)(((typeof((n)) *)0) == ((uint64_t *)0));	\
  	if (likely(((n) >> 32) == 0)) {			\
  		__rem = (uint32_t)(n) % __base;		\
  		(n) = (uint32_t)(n) / __base;		\
  	} else 						\
  		__rem = __div64_32(&(n), __base);	\
  	__rem;						\
   })
  
  #else /* BITS_PER_LONG == ?? */
  
  # error do_div() does not yet support the C64
  
  #endif /* BITS_PER_LONG */
  
  #endif /* _ASM_GENERIC_DIV64_H */