diff options
| author | Tor Andersson <tor.andersson@artifex.com> | 2011-04-08 13:49:11 +0200 |
|---|---|---|
| committer | Tor Andersson <tor.andersson@artifex.com> | 2011-04-08 13:49:11 +0200 |
| commit | 94e774a8bd2891f36885ae710efd42caebd855ed (patch) | |
| tree | 883147e1bf5dc8feba5d142b8ffcde8e7e0676f6 /draw/draw_mesh.c | |
| parent | a1b5f023ccebd339e9a74ef7f3bcc94c0c74d3e0 (diff) | |
| download | mupdf-94e774a8bd2891f36885ae710efd42caebd855ed.tar.xz | |
Remove inline keyword where it is not strictly necessary for performance.
Also put the function on the same line for inline functions, so
they stick out and are easy to find with grep.
Diffstat (limited to 'draw/draw_mesh.c')
| -rw-r--r-- | draw/draw_mesh.c | 12 |
1 files changed, 4 insertions, 8 deletions
diff --git a/draw/draw_mesh.c b/draw/draw_mesh.c index eeebf0a1..4254cb64 100644 --- a/draw/draw_mesh.c +++ b/draw/draw_mesh.c @@ -121,8 +121,7 @@ static int clip_poly(float src[MAXV][MAXN], * gouraud shaded polygon scan conversion */ -static inline void -paint_scan(fz_pixmap *pix, int y, int x1, int x2, int *v1, int *v2, int n) +static void paint_scan(fz_pixmap *pix, int y, int x1, int x2, int *v1, int *v2, int n) { unsigned char *p = pix->samples + ((y - pix->y) * pix->w + (x1 - pix->x)) * pix->n; int v[FZ_MAX_COLORS]; @@ -156,8 +155,7 @@ paint_scan(fz_pixmap *pix, int y, int x1, int x2, int *v1, int *v2, int n) } } -static inline int -find_next(int gel[MAXV][MAXN], int len, int a, int *s, int *e, int d) +static int find_next(int gel[MAXV][MAXN], int len, int a, int *s, int *e, int d) { int b; @@ -186,8 +184,7 @@ find_next(int gel[MAXV][MAXN], int len, int a, int *s, int *e, int d) } } -static inline void -load_edge(int gel[MAXV][MAXN], int s, int e, int *ael, int *del, int n) +static void load_edge(int gel[MAXV][MAXN], int s, int e, int *ael, int *del, int n) { int swp, k, dy; @@ -207,8 +204,7 @@ load_edge(int gel[MAXV][MAXN], int s, int e, int *ael, int *del, int n) } } -static inline void -step_edge(int *ael, int *del, int n) +static inline void step_edge(int *ael, int *del, int n) { int k; ael[0] += del[0]; |