196 |
static int is_transparent(int ch) |
static int is_transparent(int ch) |
197 |
{ |
{ |
198 |
int i; |
int i; |
199 |
|
|
200 |
for (i = 0; i < (int)(sizeof(transparent)/sizeof(transparent[0])); i++) { |
for (i = 0; i < (int)(sizeof(transparent)/sizeof(transparent[0])); i++) { |
201 |
if (transparent[i] == ch) |
if (transparent[i] == ch) |
202 |
return 1; |
return 1; |
207 |
static const ArabicChar *find_char(int ch) |
static const ArabicChar *find_char(int ch) |
208 |
{ |
{ |
209 |
const ArabicChar *c; |
const ArabicChar *c; |
210 |
|
|
211 |
c = arabic_table; |
c = arabic_table; |
212 |
while (c->ch != 0 && c->ch != ch) |
while (c->ch != 0 && c->ch != ch) |
213 |
c++; |
c++; |
221 |
const ArabicChar *aa, *bb, *cc; |
const ArabicChar *aa, *bb, *cc; |
222 |
|
|
223 |
a = 0; |
a = 0; |
224 |
for(i=0;i<len;) { |
for (i = 0; i < len;) { |
225 |
j = i; |
j = i; |
226 |
b = line[i++]; |
b = line[i++]; |
227 |
/* find the next non transparent char */ |
/* find the next non transparent char */ |