LCOV - code coverage report
Current view: top level - fs/btrfs - math.h (source / functions) Hit Total Coverage
Test: btrfstest.info Lines: 5 6 83.3 %
Date: 2014-11-28 Functions: 0 0 -

          Line data    Source code
       1             : 
       2             : /*
       3             :  * Copyright (C) 2012 Fujitsu.  All rights reserved.
       4             :  * Written by Miao Xie <miaox@cn.fujitsu.com>
       5             :  *
       6             :  * This program is free software; you can redistribute it and/or
       7             :  * modify it under the terms of the GNU General Public
       8             :  * License v2 as published by the Free Software Foundation.
       9             :  *
      10             :  * This program is distributed in the hope that it will be useful,
      11             :  * but WITHOUT ANY WARRANTY; without even the implied warranty of
      12             :  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
      13             :  * General Public License for more details.
      14             :  *
      15             :  * You should have received a copy of the GNU General Public
      16             :  * License along with this program; if not, write to the
      17             :  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
      18             :  * Boston, MA 021110-1307, USA.
      19             :  */
      20             : 
      21             : #ifndef __BTRFS_MATH_H
      22             : #define __BTRFS_MATH_H
      23             : 
      24             : #include <asm/div64.h>
      25             : 
      26             : static inline u64 div_factor(u64 num, int factor)
      27             : {
      28      174848 :         if (factor == 10)
      29             :                 return num;
      30      174851 :         num *= factor;
      31      174960 :         do_div(num, 10);
      32             :         return num;
      33             : }
      34             : 
      35             : static inline u64 div_factor_fine(u64 num, int factor)
      36             : {
      37           0 :         if (factor == 100)
      38             :                 return num;
      39      222803 :         num *= factor;
      40      222803 :         do_div(num, 100);
      41             :         return num;
      42             : }
      43             : 
      44             : #endif

Generated by: LCOV version 1.10