Rev 193 | Rev 268 | Go to most recent revision | Details | Compare with Previous | Last modification | View Log | RSS feed
Rev | Author | Line No. | Line |
---|---|---|---|
259 | daniel-mar | 1 | /* |
2 | This file is part of a common library |
||
3 | Copyright (C) 1990-2006 Toby Thain, toby@telegraphics.com.au |
||
4 | |||
5 | This program is free software; you can redistribute it and/or modify |
||
6 | it under the terms of the GNU General Public License as published by |
||
7 | the Free Software Foundation; either version 2 of the License, or |
||
8 | (at your option) any later version. |
||
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 |
||
13 | GNU General Public License for more details. |
||
14 | |||
15 | You should have received a copy of the GNU General Public License |
||
16 | along with this program; if not, write to the Free Software |
||
17 | Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA |
||
18 | */ |
||
19 | |||
20 | #include <stdarg.h> |
||
21 | #include <string.h> // memcpy |
||
22 | |||
23 | #include "misc.h" |
||
24 | |||
25 | int GCD(int m,int n){ int r; |
||
26 | while(r = m % n) |
||
27 | m = n, n = r; |
||
28 | return n; |
||
29 | } |
||
30 | |||
31 | void simplify_fraction(int n,int d, int*n_,int*d_){ |
||
32 | int g = GCD(n,d); |
||
33 | *n_ = n/g; |
||
34 | *d_ = d/g; |
||
35 | } |
||
36 | |||
37 | void multiply_fraction(int u,int u_, int v,int v_, int*w,int*w_){ |
||
38 | int d1 = GCD(u,v_),d2 = GCD(u_,v); |
||
39 | *w = (u/d1)*(v/d2); |
||
40 | *w_ = (u_/d2)*(v_/d1); |
||
41 | } |
||
42 | |||
43 | // these conflict with #defines in Photoshop API |
||
44 | #ifndef max |
||
45 | int max(int a,int b){return a>b?a:b;} |
||
46 | int min(int a,int b){return a<b?a:b;} |
||
47 | #endif |
||
48 | |||
49 | void copy_hex(char *p,unsigned char *q,int n){ |
||
50 | static char hex[] = "0123456789ABCDEF"; |
||
51 | |||
52 | while(n--){ |
||
53 | *p++ = hex[*q >> 4]; |
||
54 | *p++ = hex[*q & 15]; |
||
55 | q++; |
||
56 | } |
||
57 | *p = 0; |
||
58 | } |
||
59 | |||
60 | int count_set_bits(unsigned x){ int n; |
||
61 | for(n = 0; x; x >>= 1) |
||
62 | n += x & 1; |
||
63 | return n; |
||
64 | } |