2 * Implementation of line breaking algorithm for the Uniscribe Script Processor
4 * Copyright 2011 CodeWeavers, Aric Stewart
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
22 #include "usp10_internal.h"
24 WINE_DEFAULT_DEBUG_CHANNEL(uniscribe
);
26 extern const unsigned short wine_linebreak_table
[];
28 enum breaking_types
{ b_BK
=1, b_CR
, b_LF
, b_CM
, b_SG
, b_GL
, b_CB
, b_SP
, b_ZW
, b_NL
, b_WJ
, b_JL
, b_JV
, b_JT
, b_H2
, b_H3
, b_XX
, b_OP
, b_CL
, b_CP
, b_QU
, b_NS
, b_EX
, b_SY
, b_IS
, b_PR
, b_PO
, b_NU
, b_AL
, b_ID
, b_IN
, b_HY
, b_BB
, b_BA
, b_SA
, b_AI
, b_B2
, b_HL
, b_CJ
, b_RI
};
30 enum breaking_class
{b_r
=1, b_s
, b_x
};
32 static void debug_output_breaks(const short* breaks
, int count
)
34 if (TRACE_ON(uniscribe
))
38 for (i
= 0; i
< count
&& i
< 200; i
++)
42 case b_x
: TRACE("x"); break;
43 case b_r
: TRACE("!"); break;
44 case b_s
: TRACE("+"); break;
54 static inline void else_break(short* before
, short class)
56 if (*before
== 0) *before
= class;
59 void BREAK_line(const WCHAR
*chars
, int count
, const SCRIPT_ANALYSIS
*sa
, SCRIPT_LOGATTR
*la
)
65 TRACE("In %s\n",debugstr_wn(chars
,count
));
67 break_class
= HeapAlloc(GetProcessHeap(),0, count
* sizeof(short));
68 break_before
= HeapAlloc(GetProcessHeap(),0, count
* sizeof(short));
70 for (i
= 0; i
< count
; i
++)
72 break_class
[i
] = get_table_entry( wine_linebreak_table
, chars
[i
] );
75 memset(&la
[i
],0,sizeof(SCRIPT_LOGATTR
));
77 la
[i
].fCharStop
= TRUE
;
78 switch (break_class
[i
])
83 la
[i
].fWhiteSpace
= TRUE
;
86 la
[i
].fCharStop
= FALSE
;
92 /* TODO: Have outside algorithms for these scripts */
93 for (i
= 0; i
< count
; i
++)
95 switch(break_class
[i
])
101 break_class
[i
] = b_AL
;
104 break_class
[i
] = b_NS
;
110 break_before
[0] = b_x
;
111 for (i
= 0; i
< count
; i
++)
113 switch(break_class
[i
])
117 if (i
< count
-1 && break_class
[i
+1] == b_LF
)
119 else_break(&break_before
[i
],b_x
);
120 else_break(&break_before
[i
+1],b_x
);
126 if (i
< count
-1) else_break(&break_before
[i
+1],b_r
);
127 else_break(&break_before
[i
],b_x
);
131 else_break(&break_before
[i
],b_x
);
134 else_break(&break_before
[i
],b_x
);
136 while (i
< count
-1 && break_class
[i
+1] == b_SP
)
138 else_break(&break_before
[i
],b_s
);
143 debug_output_breaks(break_before
,count
);
146 for (i
= 0; i
< count
; i
++)
148 if (break_class
[i
] == b_CM
)
152 switch (break_class
[i
-1])
160 break_class
[i
] = b_AL
;
163 break_class
[i
] = break_class
[i
-1];
166 else break_class
[i
] = b_AL
;
170 for (i
= 0; i
< count
; i
++)
172 switch(break_class
[i
])
176 else_break(&break_before
[i
],b_x
);
178 else_break(&break_before
[i
+1],b_x
);
183 else_break(&break_before
[i
+1],b_x
);
187 if (break_class
[i
-1] != b_SP
&&
188 break_class
[i
-1] != b_BA
&&
189 break_class
[i
-1] != b_HY
)
190 else_break(&break_before
[i
],b_x
);
199 else_break(&break_before
[i
],b_x
);
203 while (i
< count
-1 && break_class
[i
+1] == b_SP
)
205 else_break(&break_before
[i
+1],b_x
);
208 else_break(&break_before
[i
+1],b_x
);
213 while (j
< count
-1 && break_class
[j
] == b_SP
)
215 if (break_class
[j
] == b_OP
)
218 else_break(&break_before
[j
],b_x
);
224 while(j
> 0 && break_class
[j
] == b_SP
)
226 if (break_class
[j
] == b_CL
|| break_class
[j
] == b_CP
)
228 for (j
++; j
<= i
; j
++)
229 else_break(&break_before
[j
],b_x
);
235 while (j
< count
&& break_class
[j
] == b_SP
)
237 if (break_class
[j
] == b_B2
)
240 else_break(&break_before
[j
],b_x
);
246 debug_output_breaks(break_before
,count
);
248 for (i
= 0; i
< count
; i
++)
250 switch(break_class
[i
])
255 else_break(&break_before
[i
+1],b_s
);
259 else_break(&break_before
[i
],b_x
);
261 else_break(&break_before
[i
+1],b_x
);
265 else_break(&break_before
[i
],b_s
);
267 else_break(&break_before
[i
+1],b_s
);
273 else_break(&break_before
[i
],b_x
);
277 else_break(&break_before
[i
+1],b_x
);
282 switch (break_class
[i
+1])
286 else_break(&break_before
[i
+2], b_x
);
293 switch (break_class
[i
-1])
300 else_break(&break_before
[i
], b_x
);
309 if ((break_class
[i
] == b_ID
&& break_class
[i
+1] == b_PO
) ||
310 (break_class
[i
] == b_AL
&& break_class
[i
+1] == b_NU
) ||
311 (break_class
[i
] == b_HL
&& break_class
[i
+1] == b_NU
) ||
312 (break_class
[i
] == b_NU
&& break_class
[i
+1] == b_AL
) ||
313 (break_class
[i
] == b_NU
&& break_class
[i
+1] == b_HL
))
314 else_break(&break_before
[i
+1],b_x
);
316 if ((break_class
[i
] == b_PR
&& break_class
[i
+1] == b_ID
) ||
317 (break_class
[i
] == b_PR
&& break_class
[i
+1] == b_AL
) ||
318 (break_class
[i
] == b_PR
&& break_class
[i
+1] == b_HL
) ||
319 (break_class
[i
] == b_PO
&& break_class
[i
+1] == b_AL
) ||
320 (break_class
[i
] == b_PO
&& break_class
[i
+1] == b_HL
))
321 else_break(&break_before
[i
+1],b_x
);
324 if ((break_class
[i
] == b_CL
&& break_class
[i
+1] == b_PO
) ||
325 (break_class
[i
] == b_CP
&& break_class
[i
+1] == b_PO
) ||
326 (break_class
[i
] == b_CL
&& break_class
[i
+1] == b_PR
) ||
327 (break_class
[i
] == b_CP
&& break_class
[i
+1] == b_PR
) ||
328 (break_class
[i
] == b_NU
&& break_class
[i
+1] == b_PO
) ||
329 (break_class
[i
] == b_NU
&& break_class
[i
+1] == b_PR
) ||
330 (break_class
[i
] == b_PO
&& break_class
[i
+1] == b_OP
) ||
331 (break_class
[i
] == b_PO
&& break_class
[i
+1] == b_NU
) ||
332 (break_class
[i
] == b_PR
&& break_class
[i
+1] == b_OP
) ||
333 (break_class
[i
] == b_PR
&& break_class
[i
+1] == b_NU
) ||
334 (break_class
[i
] == b_HY
&& break_class
[i
+1] == b_NU
) ||
335 (break_class
[i
] == b_IS
&& break_class
[i
+1] == b_NU
) ||
336 (break_class
[i
] == b_NU
&& break_class
[i
+1] == b_NU
) ||
337 (break_class
[i
] == b_SY
&& break_class
[i
+1] == b_NU
))
338 else_break(&break_before
[i
+1],b_x
);
341 if (break_class
[i
] == b_JL
)
343 switch (break_class
[i
+1])
349 else_break(&break_before
[i
+1],b_x
);
352 if ((break_class
[i
] == b_JV
|| break_class
[i
] == b_H2
) &&
353 (break_class
[i
+1] == b_JV
|| break_class
[i
+1] == b_JT
))
354 else_break(&break_before
[i
+1],b_x
);
355 if ((break_class
[i
] == b_JT
|| break_class
[i
] == b_H3
) &&
356 break_class
[i
+1] == b_JT
)
357 else_break(&break_before
[i
+1],b_x
);
360 switch (break_class
[i
])
367 if (break_class
[i
+1] == b_IN
|| break_class
[i
+1] == b_PO
)
368 else_break(&break_before
[i
+1],b_x
);
370 if (break_class
[i
] == b_PO
)
372 switch (break_class
[i
+1])
379 else_break(&break_before
[i
+1],b_x
);
384 if ((break_class
[i
] == b_AL
&& break_class
[i
+1] == b_AL
) ||
385 (break_class
[i
] == b_AL
&& break_class
[i
+1] == b_HL
) ||
386 (break_class
[i
] == b_HL
&& break_class
[i
+1] == b_AL
) ||
387 (break_class
[i
] == b_HL
&& break_class
[i
+1] == b_HL
))
388 else_break(&break_before
[i
+1],b_x
);
391 if ((break_class
[i
] == b_IS
&& break_class
[i
+1] == b_AL
) ||
392 (break_class
[i
] == b_IS
&& break_class
[i
+1] == b_HL
))
393 else_break(&break_before
[i
+1],b_x
);
396 if ((break_class
[i
] == b_AL
|| break_class
[i
] == b_HL
|| break_class
[i
] == b_NU
) &&
397 break_class
[i
+1] == b_OP
)
398 else_break(&break_before
[i
+1],b_x
);
399 if (break_class
[i
] == b_CP
&&
400 (break_class
[i
+1] == b_AL
|| break_class
[i
] == b_HL
|| break_class
[i
] == b_NU
))
401 else_break(&break_before
[i
+1],b_x
);
404 if (break_class
[i
] == b_RI
&& break_class
[i
+1] == b_RI
)
405 else_break(&break_before
[i
+1],b_x
);
408 debug_output_breaks(break_before
,count
);
411 for (i
= 0; i
< count
-1; i
++)
412 else_break(&break_before
[i
+1],b_s
);
414 debug_output_breaks(break_before
,count
);
415 for (i
= 0; i
< count
; i
++)
417 if (break_before
[i
] != b_x
)
419 la
[i
].fSoftBreak
= TRUE
;
420 la
[i
].fWordStop
= TRUE
;
424 HeapFree(GetProcessHeap(), 0, break_before
);
425 HeapFree(GetProcessHeap(), 0, break_class
);