BIDI.c
40.6 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
/*****************************************************************************
* Copyright Statement:
* --------------------
* This software is protected by Copyright and the information contained
* herein is confidential. The software may not be copied and the information
* contained herein may not be used or disclosed except with the written
* permission of MediaTek Inc. (C) 2005
*
* BY OPENING THIS FILE, BUYER HEREBY UNEQUIVOCALLY ACKNOWLEDGES AND AGREES
* THAT THE SOFTWARE/FIRMWARE AND ITS DOCUMENTATIONS ("MEDIATEK SOFTWARE")
* RECEIVED FROM MEDIATEK AND/OR ITS REPRESENTATIVES ARE PROVIDED TO BUYER ON
* AN "AS-IS" BASIS ONLY. MEDIATEK EXPRESSLY DISCLAIMS ANY AND ALL WARRANTIES,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE IMPLIED WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE OR NONINFRINGEMENT.
* NEITHER DOES MEDIATEK PROVIDE ANY WARRANTY WHATSOEVER WITH RESPECT TO THE
* SOFTWARE OF ANY THIRD PARTY WHICH MAY BE USED BY, INCORPORATED IN, OR
* SUPPLIED WITH THE MEDIATEK SOFTWARE, AND BUYER AGREES TO LOOK ONLY TO SUCH
* THIRD PARTY FOR ANY WARRANTY CLAIM RELATING THERETO. MEDIATEK SHALL ALSO
* NOT BE RESPONSIBLE FOR ANY MEDIATEK SOFTWARE RELEASES MADE TO BUYER'S
* SPECIFICATION OR TO CONFORM TO A PARTICULAR STANDARD OR OPEN FORUM.
*
* BUYER'S SOLE AND EXCLUSIVE REMEDY AND MEDIATEK'S ENTIRE AND CUMULATIVE
* LIABILITY WITH RESPECT TO THE MEDIATEK SOFTWARE RELEASED HEREUNDER WILL BE,
* AT MEDIATEK'S OPTION, TO REVISE OR REPLACE THE MEDIATEK SOFTWARE AT ISSUE,
* OR REFUND ANY SOFTWARE LICENSE FEES OR SERVICE CHARGE PAID BY BUYER TO
* MEDIATEK FOR SUCH MEDIATEK SOFTWARE AT ISSUE.
*
* THE TRANSACTION CONTEMPLATED HEREUNDER SHALL BE CONSTRUED IN ACCORDANCE
* WITH THE LAWS OF THE STATE OF CALIFORNIA, USA, EXCLUDING ITS CONFLICT OF
* LAWS PRINCIPLES. ANY DISPUTES, CONTROVERSIES OR CLAIMS ARISING THEREOF AND
* RELATED THERETO SHALL BE SETTLED BY ARBITRATION IN SAN FRANCISCO, CA, UNDER
* THE RULES OF THE INTERNATIONAL CHAMBER OF COMMERCE (ICC).
*
*****************************************************************************/
/*****************************************************************************
*
* Filename:
* ---------
* bidi.c
*
* Project:
* --------
* Maui_Software
*
* Description:
* ------------
* bidirectional algorithm engine
*
*
* Author:
* -------
* -------
*
*============================================================================
* HISTORY
* Below this line, this part is controlled by PVCS VM. DO NOT MODIFY!!
*------------------------------------------------------------------------------
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
* removed!
* removed!
* removed!
*
*------------------------------------------------------------------------------
* Upper this line, this part is controlled by PVCS VM. DO NOT MODIFY!!
*============================================================================
****************************************************************************/
/*
* Copyright Notice
* ?2002 - 2003, Pixtel Communications, Inc., 1489 43rd Ave. W.,
* Vancouver, B.C. V6M 4K8 Canada. All Rights Reserved.
* (It is illegal to remove this copyright notice from this software or any
* portion of it)
*/
/**************************************************************
FILENAME : BIDI.c
PURPOSE : Main functions of BIDI Algorithm
REMARKS : nil
AUTHOR : Yogesh
DATE : Aug-23-2004
**************************************************************/
#ifndef __BIDI_CONSOLE__
#endif
#define __MMI_BIDI__ /* To be placed in MMI_features.h later */
#ifdef __MMI_BIDI__
#include "BidiProt.h"
#include "BidiDef.h"
#ifdef __BIDI_CONSOLE__
#include "CommonProts.h"
#else /* __BIDI_CONSOLE__ */
#endif /* __BIDI_CONSOLE__ */
#include "gui_config.h"
#include "MMIDataType.h"
#include "Unicodexdcl.h"
#include "string.h"
extern void kal_check_stack(void);
#define BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR 0
U8 input_types[MAX_TEXT_LENGTH * BIDI_ENCODING_LENGTH]; /* source array for storing the direction codes of the input string */
U8 input_levels[MAX_LEVEL_EMBEDDING]; /* This global contains all the embedding levels */
U8 dest_levels[MAX_TEXT_LENGTH * BIDI_ENCODING_LENGTH]; /* destitnation array for processed levels */
U8 dest_types[MAX_TEXT_LENGTH * BIDI_ENCODING_LENGTH]; /* Destination array for storing the direction codes of the input string */
U8 localLogicalBuffer[MAX_TEXT_LENGTH * BIDI_ENCODING_LENGTH];
static U8 find_last_marker, find_cursor_marker, find_second_highlight_marker, find_first_highlight_marker;
S32 g_cursor_index = -1;
/*PMT IRE START*/
/*code removed*/
/*PMT IRE END*/
/*****************************************************************************
* FUNCTION
* initial_bidi_map_array
* DESCRIPTION
* Initialize the array with the continue index started from base.
* PARAMETERS
* array [OUT] the source array
* count [IN] array length
* base [IN] the base index
* RETURNS
* void
*****************************************************************************/
static void initial_bidi_map_array(U16* array, U16 count, U16 base)
{
/*----------------------------------------------------------------*/
/* Local Variables */
/*----------------------------------------------------------------*/
U16 i;
/*----------------------------------------------------------------*/
/* Code Body */
/*----------------------------------------------------------------*/
if (array == NULL)
return;
for (i=0; i<count; i++)
array[i] = i+base;
return;
}
/*****************************************************************************
* FUNCTION
* remove_one_member
* DESCRIPTION
* remove one member from the source array
* PARAMETERS
* array [IN/OUT] the source array
* pos [IN] the position of the member to be removed
* total_count [IN] the array length
* RETURNS
* void
*****************************************************************************/
static void remove_one_member(U16* array, U16 pos, U16 total_count)
{
/*----------------------------------------------------------------*/
/* Local Variables */
/*----------------------------------------------------------------*/
U16 i, tmp;
/*----------------------------------------------------------------*/
/* Code Body */
/*----------------------------------------------------------------*/
if (array == NULL || pos >= total_count)
return;
tmp = array[pos];
for (i=0; i<pos; i++)
{
if (array[i] > tmp)
{
array[i]--;
}
}
for (i=pos; i<total_count-1; i++)
{
array[i] = array[i+1];
if (array[i] > tmp)
{
array[i]--;
}
}
}
/*****************************************************************************
* FUNCTION
* set_direction_using_override_map
* DESCRIPTION
* replace the direction type by the override map
* PARAMETERS
* inputTypes [?]
* inputString [?]
* sLen [IN]
* RETURNS
* void
*****************************************************************************/
static void set_direction_using_override_map(U8 *inputTypes, U8 *inputString, S16 sLen)
{
U32 i, j, len;
for(i=0; i<sLen;)
{
for(j=0; j<nMaxIndexBidiOverride; j++)
{
len = mmi_ucs2strlen(bidiOverrideLMap[j]);
if (i + len > sLen)
return;
if (mmi_ucs2ncmp((const S8*)&inputString[i*ENCODING_LENGTH], bidiOverrideLMap[j], len) == 0)
{
/* find one override string */
while(len > 0)
{
inputTypes[i] = BIDI_L;
i++;
len--;
}
break;
}
}
if (j >= nMaxIndexBidiOverride)
i++;
}
}
/*****************************************************************************
* FUNCTION
* bidi_main_internal
* DESCRIPTION
* fill the string buffer to bidirectional algorithm
* PARAMETERS
* logicalStr [IN] Input string for bidi
* logicalStrLen [IN] String length of input string
* logicalCurPos [IN] Current cursor position of input string
* visualStr [OUT] Final output string from bidi algorithm
* visualStrLen [OUT] String length of final output string
* visualCurPos [OUT] Cursor position of final output string
* pLToV [OUT] Map table from Logic to Visual
* pVToL [OUT] Map table from Visual to Logic
* inputMode [IN] the current input method direction mode
* paratype [IN] BIDI_PARAGRAPH_TYPES enum value pointed to the paragraph direction
* RETURNS
* void
*****************************************************************************/
void bidi_main_internal(
U8 *logicalStr,
U16 logicalStrLen,
U16 logicalCurPos,
U8 *visualStr,
U16 *visualStrLen,
U16 *visualCurPos,
U16 *pLToV,
U16 *pVToL,
pBOOL fSwap,
U8 inputMode,
U8 fUseOverride,
BIDI_PARAGRAPH_TYPES paratype)
{
/*----------------------------------------------------------------*/
/* Local Variables */
/*----------------------------------------------------------------*/
U8 paragraphEmbeddingLevel = 0;
#if BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR
U8 lastType;
pBOOL flag = FALSE;
#endif /* BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR */
U16 bCheckFlag;
S16 iCount, nParaCount = 0;
U8 *pInputType = input_types;
/* U8 *pInputLevels = input_levels; */
U8 *pDestLevels = dest_levels;
U8 *pDestTypes = dest_types;
/* U8 *pLogicalBuffer = localLogicalBuffer; */
U8 *pVisualBuffer = visualStr;
U16 *p_logic_to_visual = pLToV;
U16 *p_visual_to_logic = pVToL;
U16 i;
U16 mark;
/*----------------------------------------------------------------*/
/* Code Body */
/*----------------------------------------------------------------*/
if (logicalStrLen == 0)
{
/* *visualCurPos = 0; */
*visualCurPos = 0xFFFF;
*visualStr = 0;
*(visualStr + 1) = 0;
*visualStrLen = 0;
return;
}
else if (logicalStrLen >= MAX_TEXT_LENGTH - 1)
{
logicalStrLen = MAX_TEXT_LENGTH - 2; /* for '\0' and cursor marker*/
}
find_last_marker = 0;
find_cursor_marker = 0;
find_second_highlight_marker = 0;
find_first_highlight_marker = 0;
g_cursor_index = -1;
mmi_ucs2ncpy((S8*) localLogicalBuffer, (const S8*)logicalStr, (U32) logicalStrLen);
localLogicalBuffer[logicalStrLen * ENCODING_LENGTH] = 0;
localLogicalBuffer[logicalStrLen * ENCODING_LENGTH + 1] = 0;
#if BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR
if (inputMode == BIDI_R)
{
bidi_get_char_type((U8*) & localLogicalBuffer[(logicalStrLen - 1) * BIDI_ENCODING_LENGTH], (U8*) & lastType);
if (lastType == WS)
{
localLogicalBuffer[(logicalStrLen - 1) * BIDI_ENCODING_LENGTH] = 0;
localLogicalBuffer[(logicalStrLen - 1) * BIDI_ENCODING_LENGTH + 1] = 0;
if (logicalCurPos == logicalStrLen)
{
flag = TRUE;
logicalCurPos--;
}
logicalStrLen--;
}
if (logicalCurPos != 0xFFFF)
{
set_bidi_cursor_pos((U8*) localLogicalBuffer, logicalCurPos, (U16) CURSOR_MARK);
find_cursor_marker = 1;
}
logicalStrLen = (U16) mmi_ucs2strlen((const S8*)localLogicalBuffer);
set_bidi_cursor_pos((U8*) localLogicalBuffer, logicalStrLen, (U16) LAST_MARK);
find_last_marker = 1;
}
else
#endif /* BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR */
{
if (logicalCurPos != 0xFFFF)
{
set_bidi_cursor_pos((U8*) localLogicalBuffer, logicalCurPos, (U16) CURSOR_MARK);
find_cursor_marker = 1;
}
find_last_marker = 0;
}
logicalStrLen = get_direction_codes((U8*) input_types, (U8*) localLogicalBuffer, 0);
if (fUseOverride)
set_direction_using_override_map((U8*) input_types, (U8*) localLogicalBuffer, logicalStrLen);
iCount = 0;
/* modified by mbj06060, we only use one line to apply bidi*/
/* while (iCount < logicalStrLen) */
{
bCheckFlag = 0;
nParaCount = identify_paragraphs(pInputType, (U16) (logicalStrLen - iCount), &bCheckFlag);
if (paratype == P_ON)
paragraphEmbeddingLevel = get_para_embedding_level(pInputType, nParaCount);
else
paragraphEmbeddingLevel = paratype;
if (bCheckFlag == 2)
{
/* This line is ended by 0x0d0a, we handle these two letters specially*/
nParaCount--;
if (paragraphEmbeddingLevel == 1) /* R to L*/
{
mmi_ucs2ncpy((S8*)visualStr, (const S8*)&localLogicalBuffer[(logicalStrLen - 2)*ENCODING_LENGTH], 2);
pVisualBuffer += 2 * ENCODING_LENGTH;
mmi_ucs2ncpy((S8*) pVisualBuffer, (const S8*)localLogicalBuffer, logicalStrLen - 2);
pVisualBuffer[(logicalStrLen - 2) * ENCODING_LENGTH] = 0;
pVisualBuffer[(logicalStrLen - 2) * ENCODING_LENGTH + 1] = 0;
if (p_visual_to_logic)
{
p_visual_to_logic[0] = nParaCount;
p_visual_to_logic[1] = nParaCount + 1;
p_visual_to_logic += 2;
}
}
else /* L to R*/
{
/* we don't bidi 0x0d0a */
if (p_visual_to_logic)
{
p_visual_to_logic[nParaCount] = nParaCount;
p_visual_to_logic[nParaCount + 1] = nParaCount + 1;
}
mmi_ucs2cpy((S8*) visualStr, (const S8*)localLogicalBuffer);
}
}
else
mmi_ucs2cpy((S8*) visualStr, (const S8*)localLogicalBuffer);
if (bCheckFlag == 1)
{
pDestTypes[nParaCount] = 0;
pInputType[nParaCount] = 0;
nParaCount++;
}
copy_direction_codes(pDestTypes, pInputType, (U16) nParaCount);
if (p_visual_to_logic !=NULL)
initial_bidi_map_array(p_visual_to_logic, nParaCount, 0);
set_dest_levels(0, nParaCount, paragraphEmbeddingLevel, pDestLevels);
get_run_level(nParaCount, paragraphEmbeddingLevel, pDestLevels, pDestTypes);
resolve_lines(paragraphEmbeddingLevel, pVisualBuffer, nParaCount, (pBOOL)!fUseOverride, pDestTypes, pDestLevels, p_visual_to_logic);
/* If we only take account one line bidi, needn't to do the following work */
/*
pInputType += nParaCount;
pInputLevels += nParaCount;
pDestLevels += nParaCount;
pDestTypes += nParaCount;
pLogicalBuffer += nParaCount * 2;
pVisualBuffer += nParaCount * 2;
iCount += nParaCount;
if (p_visual_to_logic != NULL)
p_visual_to_logic += nParaCount;
*/
}
*visualStrLen = (U16) mmi_ucs2strlen((const S8*)visualStr);
p_visual_to_logic = pVToL;
if(fSwap)
{
bidi_reverse((U8*) visualStr, *visualStrLen, p_visual_to_logic);
}
*visualCurPos = 0xFFFF;
/* START Changed by YOGESH PMT 20050912 */
while (find_mark(visualStr, *visualStrLen, &mark, (U16*) & iCount))
/* END YOGESH PMT 20050912 */
{
switch (mark)
{
case LAST_MARK:
case CURSOR_MARK:
#if BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR
if (inputMode == BIDI_R)
{
*visualCurPos = get_bidi_cursor_pos(visualStr, (U16) LAST_MARK);
if (lastType == WS)
{
set_bidi_cursor_pos(visualStr, *visualCurPos, (U16) (0x0020));
}
else
{
/* get_bidi_cursor_pos remove one visual character, so remove one from p_visual_to_logic*/
remove_one_member(p_visual_to_logic, *visualCurPos, *visualStrLen);
}
*visualCurPos = get_bidi_cursor_pos(visualStr, (U16) CURSOR_MARK);
remove_one_member(p_visual_to_logic, *visualCurPos, *visualStrLen);
}
else
#endif /* BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR */
{
*visualCurPos = get_bidi_cursor_pos(visualStr, (U16) CURSOR_MARK);
remove_one_member(p_visual_to_logic, *visualCurPos, *visualStrLen);
}
break;
}
}
*visualStrLen = (U16) mmi_ucs2strlen((const S8*)visualStr);
/* fill p_logic_to_visual */
if (p_logic_to_visual != NULL && p_visual_to_logic != NULL)
{
for (i = 0; i<*visualStrLen; i++)
p_logic_to_visual[p_visual_to_logic[i]] = i;
}
#ifdef __MTK_TARGET__
kal_check_stack(); /* if overflow , assert it */
#endif
}
/*****************************************************************************
* FUNCTION
* bidi_main_ext
* DESCRIPTION
* fill the string buffer to bidirectional algorithm
* PARAMETERS
* logicalStr [IN] Input string for bidi
* logicalStrLen [IN] String length of input string
* logicalCurPos [IN] Current cursor position of input string
* visualStr [OUT] Final output string from bidi algorithm
* visualStrLen [OUT] String length of final output string
* visualCurPos [OUT] Cursor position of final output string
* pLToV [OUT] Map table from Logic to Visual
* pVToL [OUT] Map table from Visual to Logic
* inputMode [IN] the current input method direction mode
* paratype [IN] BIDI_PARAGRAPH_TYPES enum value pointed to the paragraph direction
* RETURNS
* void
*****************************************************************************/
void bidi_main_ext(
U8 *logicalStr,
U16 logicalStrLen,
U16 logicalCurPos,
U8 *visualStr,
U16 *visualStrLen,
U16 *visualCurPos,
U16 *pLToV,
U16 *pVToL,
pBOOL fSwap,
U8 inputMode,
U8 fUseOverride,
BIDI_PARAGRAPH_TYPES paratype)
{
/*----------------------------------------------------------------*/
/* Local Variables */
/*----------------------------------------------------------------*/
U16 bCheckFlag = 0, len = 0, count = 0, visual_len = 0;
U8 *pInputType = input_types;
U8 *pLogicalBuffer = logicalStr;
U8 *pVisualBuffer = visualStr;
/*----------------------------------------------------------------*/
/* Code Body */
/*----------------------------------------------------------------*/
*visualStrLen = 0;
if (pLToV != NULL || pVToL != NULL)
{
/* can't support multi paragraph */
bidi_main_internal(logicalStr,
logicalStrLen,
logicalCurPos,
visualStr,
visualStrLen,
visualCurPos,
pLToV,
pVToL,
fSwap,
inputMode,
fUseOverride,
paratype);
return;
}
while (pLogicalBuffer < (logicalStr + logicalStrLen * ENCODING_LENGTH))
{
len = get_direction_codes((U8*) pInputType, (U8*) pLogicalBuffer,
logicalStrLen - (pLogicalBuffer - logicalStr)/ENCODING_LENGTH);
if (len == 0)
break;
bCheckFlag= 0;
count = identify_paragraphs(pInputType, len, &bCheckFlag);
count += (bCheckFlag > 0 ? 1 : 0);
bidi_main_internal(pLogicalBuffer,
count,
0xFFFF,
pVisualBuffer,
&visual_len,
visualCurPos,
pLToV,
pVToL,
fSwap,
inputMode,
fUseOverride,
paratype);
pLogicalBuffer += count*ENCODING_LENGTH;
pVisualBuffer += visual_len*ENCODING_LENGTH;
*visualStrLen += visual_len;
}
return;
}
/*****************************************************************************
* FUNCTION
* bidi_main
* DESCRIPTION
* fill the string buffer to bidirectional algorithm
* PARAMETERS
* logicalStr [IN] Input string for bidi
* logicalStrLen [IN] String length of input string
* logicalCurPos [IN] Current cursor position of input string
* visualStr [OUT] Final output string from bidi algorithm
* visualStrLen [OUT] String length of final output string
* visualCurPos [OUT] Cursor position of final output string
* fSwap [IN] If true, then reserse the string after apply bidi algorithm
* inputMode [IN]
* logicalHilightStart [IN] Word hilight start position of input string
* logicalHilightEnd [IN] Word hilight end position of input string
* visualHilightStart [OUT] Word hilight start position of output string
* visualHilightEnd [OUT] Word hilight end position of output string
* RETURNS
* void
*****************************************************************************/
void bidi_main(
U8 *logicalStr,
U16 logicalStrLen,
U16 logicalCurPos,
U8 *visualStr,
U16 *visualStrLen,
U16 *visualCurPos,
pBOOL fSwap,
U8 inputMode,
U16 logicalHilightStart,
U16 logicalHilightEnd,
U16 *visualHilightStart,
U16 *visualHilightEnd)
{
/*----------------------------------------------------------------*/
/* Local Variables */
/*----------------------------------------------------------------*/
U8 paragraphEmbeddingLevel = 0;
#if BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR
U8 lastType;
pBOOL flag = FALSE;
#endif /* BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR */
U16 bCheckFlag;
S16 iCount, nParaCount = 0;
U8 *pInputType = input_types;
U8 *pInputLevels = input_levels;
U8 *pDestLevels = dest_levels;
U8 *pDestTypes = dest_types;
U8 *pLogicalBuffer = localLogicalBuffer;
U8 *pVisualBuffer = visualStr;
U16 mark;
/* END TARUN PMT 20050202 */
U8 testHilighOneCharFlag = 0;
/*----------------------------------------------------------------*/
/* Code Body */
/*----------------------------------------------------------------*/
memset(input_types, 0,sizeof(input_types));
memset(input_levels, 0,sizeof(input_levels));
memset(dest_levels, 0,sizeof(dest_levels));
memset(dest_types, 0,sizeof(dest_types));
memset(localLogicalBuffer, 0,sizeof(localLogicalBuffer));
if (logicalStrLen == 0)
{
/* *visualCurPos = 0; */
*visualCurPos = 0xFFFF;
*visualStr = 0;
*(visualStr + 1) = 0;
*visualStrLen = 0;
*visualHilightStart = 0;
*visualHilightEnd = 0;
return;
}
find_last_marker = 0;
find_cursor_marker = 0;
find_second_highlight_marker = 0;
find_first_highlight_marker = 0;
if (logicalCurPos != 0xFFFF)
{
if (logicalCurPos < logicalHilightEnd)
{
logicalCurPos = logicalHilightEnd;
}
if (logicalHilightStart > logicalHilightEnd)
{
logicalHilightStart = logicalHilightEnd;
}
}
/*PMT IRE START*/
/*removed unwanted code*/
/*PMT IRE END*/
mmi_ucs2ncpy((S8*) localLogicalBuffer, (const S8*)logicalStr, (U32) logicalStrLen);
#if BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR
if (inputMode == BIDI_R)
{
bidi_get_char_type((U8*) & localLogicalBuffer[(logicalStrLen - 1) * BIDI_ENCODING_LENGTH], (U8*) & lastType);
if (lastType == WS)
{
localLogicalBuffer[(logicalStrLen - 1) * BIDI_ENCODING_LENGTH] = 0;
localLogicalBuffer[(logicalStrLen - 1) * BIDI_ENCODING_LENGTH + 1] = 0;
if (logicalCurPos == logicalStrLen)
{
flag = TRUE;
logicalCurPos--;
}
logicalStrLen--;
}
if (logicalCurPos != 0xFFFF)
{
set_bidi_cursor_pos((U8*) localLogicalBuffer, logicalCurPos, (U16) CURSOR_MARK);
find_cursor_marker = 1;
}
logicalStrLen = (U16) mmi_ucs2strlen((const S8*)localLogicalBuffer);
set_bidi_cursor_pos((U8*) localLogicalBuffer, logicalStrLen, (U16) LAST_MARK);
find_last_marker = 1;
}
else
#endif /* BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR */
{
if (logicalCurPos != 0xFFFF)
{
set_bidi_cursor_pos((U8*) localLogicalBuffer, logicalCurPos, (U16) CURSOR_MARK);
find_cursor_marker = 1;
}
}
set_bidi_cursor_pos((U8*) localLogicalBuffer, logicalHilightEnd, (U16) SECOND_HIGHLT);
set_bidi_cursor_pos((U8*) localLogicalBuffer, (U16) (logicalHilightStart), (U16) FIRST_HIGHLT);
find_second_highlight_marker = 1;
find_first_highlight_marker = 1;
mmi_ucs2cpy((S8*) visualStr, (const S8*)localLogicalBuffer);
logicalStrLen = get_direction_codes((U8*) input_types, (U8*) localLogicalBuffer, 0);
iCount = 0;
while (iCount < logicalStrLen)
{
bCheckFlag = 0;
nParaCount = identify_paragraphs(pInputType, (U16) (logicalStrLen - iCount), &bCheckFlag);
copy_direction_codes(pDestTypes, pInputType, (U16) nParaCount);
if (bCheckFlag)
{
pDestTypes[nParaCount] = 0;
pInputType[nParaCount] = 0;
if (pInputType[nParaCount - 1] == BIDI_B)
{
pDestTypes[nParaCount - 1] = 0;
pInputType[nParaCount - 1] = 0;
}
}
/*----------------------------------------------------------------*/
/* We use bidi_main line by line, so we can't get the paragraph */
/* embedding level from the current line. */
/* Now change to set the paragraph embedding */
/* level by the flag: fSwap. */
/*----------------------------------------------------------------*/
/* paragraphEmbeddingLevel = get_para_embedding_level(pInputType, nParaCount); */
paragraphEmbeddingLevel = (fSwap == 1) ? 1 : 0;
set_dest_levels(0, nParaCount, paragraphEmbeddingLevel, pDestLevels);
get_run_level(nParaCount, paragraphEmbeddingLevel, pDestLevels, pDestTypes);
resolve_lines(paragraphEmbeddingLevel, pVisualBuffer, nParaCount, TRUE, pDestTypes, pDestLevels, NULL);
if (bCheckFlag)
{
nParaCount++;
}
pInputType += nParaCount;
pInputLevels += nParaCount;
pDestLevels += nParaCount;
pDestTypes += nParaCount;
pLogicalBuffer += nParaCount * 2;
pVisualBuffer += nParaCount * 2;
iCount += nParaCount;
}
*visualStrLen = (U16) mmi_ucs2strlen((const S8*)visualStr);
if (fSwap)
{
bidi_reverse((U8*) visualStr, *visualStrLen, NULL);
}
*visualCurPos = 0xFFFF;
/* START Changed by YOGESH PMT 20050912 */
while (find_mark(visualStr, *visualStrLen, &mark, (U16*) & iCount))
/* END YOGESH PMT 20050912 */
{
switch (mark)
{
case LAST_MARK:
case CURSOR_MARK:
#if BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR
if (inputMode == BIDI_R)
{
*visualCurPos = get_bidi_cursor_pos(visualStr, (U16) LAST_MARK);
if (lastType == WS)
{
set_bidi_cursor_pos(visualStr, *visualCurPos, (U16) (0x0020));
}
*visualCurPos = get_bidi_cursor_pos(visualStr, (U16) CURSOR_MARK);
}
else
#endif /* BIDI_CONSIDER_DIFF_INPUT_METHOD_BEHAVIOR */
{
*visualCurPos = get_bidi_cursor_pos(visualStr, (U16) CURSOR_MARK);
}
testHilighOneCharFlag = 1;
break;
case SECOND_HIGHLT:
*visualHilightEnd = get_bidi_cursor_pos(visualStr, (U16) SECOND_HIGHLT);
testHilighOneCharFlag = 0;
break;
case FIRST_HIGHLT:
*visualHilightStart = get_bidi_cursor_pos(visualStr, (U16) FIRST_HIGHLT);
testHilighOneCharFlag = 0;
break;
}
}
if (testHilighOneCharFlag == 0 && *visualHilightEnd == *visualHilightStart)
{
*visualHilightEnd = *visualHilightStart = *visualCurPos + 1;
}
if ((logicalHilightStart == 0) && (logicalHilightEnd == 0))
{
*visualHilightEnd = 0;
*visualHilightStart = 0;
}
if ((*visualHilightEnd <
/*=*/ *visualHilightStart) /* && (!(*visualHilightStart == 0 && *visualHilightEnd == 0)) */ )
{
(*visualHilightEnd)++;
(*visualHilightStart)++;
}
*visualStrLen = (U16) mmi_ucs2strlen((const S8*)visualStr);
#ifdef __MTK_TARGET__
kal_check_stack(); /* if overflow , assert it */
#endif
}
/*****************************************************************************
* FUNCTION
* set_bidi_cursor_pos
* DESCRIPTION
*
* PARAMETERS
* input_str [?]
* cursor_pos [IN]
* cursor_mark [IN]
* RETURNS
*
*****************************************************************************/
pBOOL set_bidi_cursor_pos(U8 *input_str, U16 cursor_pos, U16 cursor_mark)
{
/*----------------------------------------------------------------*/
/* Local Variables */
/*----------------------------------------------------------------*/
U16 sLen, iCount;
U8 cTemp[2];
/*----------------------------------------------------------------*/
/* Code Body */
/*----------------------------------------------------------------*/
mmi_wc_to_ucs2(cursor_mark, (U8*) & sLen, cTemp);
sLen = (U16) mmi_ucs2strlen((const S8*)input_str);
if (sLen < cursor_pos)
{
return FALSE;
}
for (iCount = cursor_pos; iCount <= sLen; iCount++)
{
U8 cTempSwap;
cTempSwap = input_str[iCount * BIDI_ENCODING_LENGTH];
input_str[iCount * BIDI_ENCODING_LENGTH] = cTemp[0];
cTemp[0] = cTempSwap;
cTempSwap = input_str[iCount * BIDI_ENCODING_LENGTH + 1];
input_str[iCount * BIDI_ENCODING_LENGTH + 1] = cTemp[1];
cTemp[1] = cTempSwap;
}
input_str[iCount * BIDI_ENCODING_LENGTH] = cTemp[0];
input_str[iCount * BIDI_ENCODING_LENGTH + 1] = cTemp[1];
g_cursor_index = cursor_pos;
return TRUE;
}
/* START Changed by YOGESH PMT 20050912 */
/*****************************************************************************
* FUNCTION
* find_mark
* DESCRIPTION
*
* PARAMETERS
* input_str [?]
* input_strLen [IN]
* cur_mark [?]
* cur_pos [?]
* RETURNS
*
*****************************************************************************/
pBOOL find_mark(U8 *input_str, U16 input_strLen, U16 *cur_mark, U16 *cur_pos)
{
/*----------------------------------------------------------------*/
/* Local Variables */
/*----------------------------------------------------------------*/
U16 sLen, iCount = 0;
U8 cTemp[2];
/*----------------------------------------------------------------*/
/* Code Body */
/*----------------------------------------------------------------*/
while (!((input_str[iCount * 2] == 0) && (input_str[iCount * 2 + 1] == 0)) && iCount <= input_strLen)
/* END YOGESH PMT 20050912 */
{
if (find_last_marker)
{
mmi_wc_to_ucs2(LAST_MARK, (U8*) & sLen, cTemp);
if ((input_str[iCount * BIDI_ENCODING_LENGTH] == cTemp[0]) &&
(input_str[iCount * BIDI_ENCODING_LENGTH + 1] == cTemp[1]))
{
*cur_mark = LAST_MARK;
*cur_pos = iCount;
return TRUE;
}
}
if (find_cursor_marker)
{
mmi_wc_to_ucs2(CURSOR_MARK, (U8*) & sLen, cTemp);
if ((input_str[iCount * BIDI_ENCODING_LENGTH] == cTemp[0]) &&
(input_str[iCount * BIDI_ENCODING_LENGTH + 1] == cTemp[1]))
{
*cur_mark = CURSOR_MARK;
*cur_pos = iCount;
return TRUE;
}
}
if (find_second_highlight_marker)
{
mmi_wc_to_ucs2(SECOND_HIGHLT, (U8*) & sLen, cTemp);
if ((input_str[iCount * BIDI_ENCODING_LENGTH] == cTemp[0]) &&
(input_str[iCount * BIDI_ENCODING_LENGTH + 1] == cTemp[1]))
{
*cur_mark = SECOND_HIGHLT;
*cur_pos = iCount;
return TRUE;
}
}
if (find_first_highlight_marker)
{
mmi_wc_to_ucs2(FIRST_HIGHLT, (U8*) & sLen, cTemp);
if ((input_str[iCount * BIDI_ENCODING_LENGTH] == cTemp[0]) &&
(input_str[iCount * BIDI_ENCODING_LENGTH + 1] == cTemp[1]))
{
*cur_mark = FIRST_HIGHLT;
*cur_pos = iCount;
return TRUE;
}
}
iCount++;
}
return FALSE;
}
/*****************************************************************************
* FUNCTION
* get_bidi_cursor_pos
* DESCRIPTION
*
* PARAMETERS
* input_str [?]
* cursor_mark [IN]
* RETURNS
*
*****************************************************************************/
U16 get_bidi_cursor_pos(U8 *input_str, U16 cursor_mark)
{
/*----------------------------------------------------------------*/
/* Local Variables */
/*----------------------------------------------------------------*/
U16 sLen, iCount = 0;
U8 cTemp[2];
S16 cur_pos = -1;
/*----------------------------------------------------------------*/
/* Code Body */
/*----------------------------------------------------------------*/
mmi_wc_to_ucs2(cursor_mark, (U8*) & sLen, cTemp);
/* while((input_str[iCount*BIDI_ENCODING_LENGTH]!=0)&&(input_str[iCount*BIDI_ENCODING_LENGTH+1]!=0)) */
while (!((input_str[iCount * 2] == 0) && (input_str[iCount * 2 + 1] == 0)))
{
if ((input_str[iCount * BIDI_ENCODING_LENGTH] == cTemp[0]) &&
(input_str[iCount * BIDI_ENCODING_LENGTH + 1] == cTemp[1]))
{
cur_pos = iCount;
}
if (cur_pos != -1)
{
input_str[iCount * BIDI_ENCODING_LENGTH] = input_str[(iCount + 1) * BIDI_ENCODING_LENGTH];
input_str[iCount * BIDI_ENCODING_LENGTH + 1] = input_str[(iCount + 1) * BIDI_ENCODING_LENGTH + 1];
}
iCount++;
}
return (U16) ((cur_pos == -1) ? 0 : cur_pos);
}
/*****************************************************************************
* FUNCTION
* bidi_get_char_type
* DESCRIPTION
*
* PARAMETERS
* input_char [?]
* charType [?]
* RETURNS
*
*****************************************************************************/
pBOOL bidi_get_char_type(U8 *input_char, U8 *charType)
{
/*----------------------------------------------------------------*/
/* Local Variables */
/*----------------------------------------------------------------*/
S32 nFirst = 0;
S32 nLast = nMaxIndexBidiTypeMap;
S32 nMid;
U16 charInput = 0;
/*----------------------------------------------------------------*/
/* Code Body */
/*----------------------------------------------------------------*/
#ifdef __ASCII
charInput = (U16) (*input_char);
#endif
#ifdef __UCS2_ENCODING
mmi_ucs2_to_wc((U16*) & charInput, (U8*) (input_char));
#endif
while (nLast >= nFirst)
{
nMid = (nFirst + nLast) / 2;
//START YOGESH PMT 20041108
// if((bidiCharTypeMap[nMid].sIndex<= charInput)&&((bidiCharTypeMap[nMid].sIndex+ (U16)bidiCharTypeMap[nMid].nCount)>= charInput))
if ((bidiCharTypeMap[nMid].sIndex <= charInput) &&
((bidiCharTypeMap[nMid].sIndex + (U16) bidiCharTypeMap[nMid].nCount) > charInput))
/* END YOGESH PMT 20041108 */
{
*charType = bidiCharTypeMap[nMid].type;
return TRUE;
}
//START YOGESH PMT 20041108
// if (charInput>(bidiCharTypeMap[nMid].sIndex+ (U16)bidiCharTypeMap[nMid].nCount))
if (charInput >= (bidiCharTypeMap[nMid].sIndex + (U16) bidiCharTypeMap[nMid].nCount))
{
/* END YOGESH PMT 20041108 */
nFirst = nMid + 1;
}
else
{
if (charInput < bidiCharTypeMap[nMid].sIndex)
{
nLast = nMid - 1;
}
else
{
nLast = nMid;
}
}
}
*charType = BIDI_L; /* Default Type */
return FALSE;
}
/*****************************************************************************
* FUNCTION
* bidi_get_para_direction
* DESCRIPTION
*
* PARAMETERS
* input_str [?]
* RETURNS
*
*****************************************************************************/
U8 bidi_get_para_direction(U8 *input_str)
{
/*----------------------------------------------------------------*/
/* Local Variables */
/*----------------------------------------------------------------*/
/* U8 input_types[MAX_TEXT_LENGTH*BIDI_ENCODING_LENGTH];//source array for storing the direction codes of the input string */
U16 sLen;
/*----------------------------------------------------------------*/
/* Code Body */
/*----------------------------------------------------------------*/
//START CHANGED by Yogesh 20041224
// sLen=get_direction_codes(input_types,input_str);
sLen = get_direction_codes(input_types, input_str, 0);
/* END CHANGED by Yogesh 20041224 */
return (get_para_embedding_level(input_types, sLen)) ? BIDI_R : BIDI_L;
}
MMI_BOOL bidi_is_need_bidi(U8 *text, U32 len)
{
U32 i = 0;
U16 unicode;
U8 dic = 0;
for (i = 0; i < len * 2; i += 2)
{
unicode = text[i];
unicode |= (text[i + 1] << 8);
// skip ASCII chars
if (unicode <= 0xFF)
{
continue;
}
bidi_get_char_type((U8*) (&unicode), &dic);
if (dic == BIDI_R || dic == AL || dic == AN)
{
return MMI_TRUE;
}
}
return MMI_FALSE;
}
#endif /* __MMI_BIDI___ */