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
|
/* $Id$ */
#include "bbs.h"
/**
* Structure
* =========
* fav4 的主要架構如下:
*
* fav_t - 用來裝各種 entry(fav_type_t) 的 directory
* 進入我的最愛時,看到的東西就是根據 fav_t 生出來的。
* 裡面紀錄者,這一個 level 中有多少個看板、目錄、分隔線。(favh)
* 是一個 array (with pre-allocated buffer)
*
* fav_type_t - fav entry 的 base class
* 存取時透過 type 變數來得知正確的型態。
*
* fav_board_t / fav_line_t / fav_folder_t - derived class
* 詳細情形請參考 fav.h 中的定義。
* 以 cast_(board|line|folder)_t 來將一個 fav_type_t 作動態轉型。
*
* Policy
* ======
* 為了避免過度的資料搬移,當將一個 item 從我的最愛中移除時,只將他的
* FAVH_FAV flag 移除。而沒有這個 flag 的 item 也不被視為我的最愛。
*
* 我的最愛中,沒設 FAVH_FAV 的資料,將在某些時候,如寫入檔案時,呼叫
* rebuild_fav 清除乾淨。
*
* Others
* ======
* 站長搬移看板所用的 t ,因為不能只存在 nbrd 裡面,又不然再弄出額外的空間,
* 所以當站長不在我的最愛按了 t ,會把這個記錄暫存在 fav 中
* (FAVH_ADM_TAG == 1, FAVH_FAV == 0)。
*/
#ifdef MEM_CHECK
static int memcheck;
#endif
/* the total number of items, every level. */
static int fav_number;
/* definition of fav stack, the top one is in use now. */
static int fav_stack_num = 0;
static fav_t *fav_stack[FAV_MAXDEPTH] = {0};
static char dirty = 0;
/* fav_tmp is for recordinge while copying, moving, etc. */
static fav_t *fav_tmp;
//static int fav_tmp_snum; /* the sequence number in favh in fav_t */
// DEPRECATED
typedef struct {
char fid;
char title[BTLEN + 1];
int this_folder;
} fav_folder4_t;
/**
* cast_(board|line|folder) 一族用於將 base class 作轉型
* (不檢查實際 data type)
*/
inline static fav_board_t *cast_board(fav_type_t *p){
return (fav_board_t *)p->fp;
}
inline static fav_line_t *cast_line(fav_type_t *p){
return (fav_line_t *)p->fp;
}
inline static fav_folder_t *cast_folder(fav_type_t *p){
return (fav_folder_t *)p->fp;
}
/**
* 傳回指定的 fp(dir) 中的 fp->DataTail, 第一個沒用過的位置的 index
*/
inline static int get_data_tail(fav_t *fp){
return fp->DataTail;
}
/**
* 傳回指定 dir 中所用的 entry 的總數 (只算真的在裡面,而不算已被移除的)
*/
inline int get_data_number(fav_t *fp){
return fp->nBoards + fp->nLines + fp->nFolders;
}
/**
* 傳回目前所在的 dir pointer
*/
inline fav_t *get_current_fav(void){
if (fav_stack_num == 0)
return NULL;
return fav_stack[fav_stack_num - 1];
}
/**
* 將 ft(entry) cast 成一個 dir
*/
inline fav_t *get_fav_folder(fav_type_t *ft){
return cast_folder(ft)->this_folder;
}
inline int get_item_type(fav_type_t *ft){
return ft->type;
}
/**
* 將一個指定的 dir pointer 存下來,之後可用 fav_get_tmp_fav 來存用
*/
inline static void fav_set_tmp_folder(fav_t *fp){
fav_tmp = fp;
}
inline static fav_t *fav_get_tmp_fav(void){
return fav_tmp;
}
/**
* 將 fp(dir) 記的數量中,扣除一單位 ft(entry)
*/
static void fav_decrease(fav_t *fp, fav_type_t *ft)
{
dirty = 1;
switch (get_item_type(ft)){
case FAVT_BOARD:
fp->nBoards--;
break;
case FAVT_LINE:
fp->nLines--;
break;
case FAVT_FOLDER:
fp->nFolders--;
break;
}
fav_number--;
}
/**
* 將 fp(dir) 記的數量中,增加一單位 ft(entry)
*/
static void fav_increase(fav_t *fp, fav_type_t *ft)
{
dirty = 1;
switch (get_item_type(ft)){
case FAVT_BOARD:
fp->nBoards++;
break;
case FAVT_LINE:
fp->nLines++;
cast_line(ft)->lid = ++fp->lineID;
break;
case FAVT_FOLDER:
fp->nFolders++;
cast_folder(ft)->fid = ++fp->folderID;
break;
}
fav_number++;
fp->DataTail++;
}
inline static int get_folder_num(fav_t *fp) {
return fp->nFolders;
}
/**
* get_(folder|line)_id 傳回 fp 中一個新的 folder/line id
*/
inline static int get_folder_id(fav_t *fp) {
return fp->folderID;
}
inline static int get_line_id(fav_t *fp) {
return fp->lineID;
}
inline static int get_line_num(fav_t *fp) {
return fp->nLines;
}
/**
* 設定某個 flag。
* @bit: 目前所有 flags 有: FAVH_FAV, FAVH_TAG, FAVH_UNREAD, FAVH_ADM_TAG
* @param bool: FALSE: unset, TRUE: set, EXCH: opposite
*/
void set_attr(fav_type_t *ft, int bit, char bool){
if (ft == NULL)
return;
if (bool == EXCH)
ft->attr ^= bit;
else if (bool == TRUE)
ft->attr |= bit;
else
ft->attr &= ~bit;
}
inline int is_set_attr(fav_type_t *ft, char bit){
return ft->attr & bit;
}
char *get_item_title(fav_type_t *ft)
{
switch (get_item_type(ft)){
case FAVT_BOARD:
return bcache[cast_board(ft)->bid - 1].brdname;
case FAVT_FOLDER:
return cast_folder(ft)->title;
case FAVT_LINE:
return "----";
}
return NULL;
}
static char *get_item_class(fav_type_t *ft)
{
switch (get_item_type(ft)){
case FAVT_BOARD:
return bcache[cast_board(ft)->bid - 1].title;
case FAVT_FOLDER:
return "目錄";
case FAVT_LINE:
return "----";
}
return NULL;
}
#ifdef MEM_CHECK
inline static void fav_set_memcheck(int n) {
memcheck = n;
}
inline static int fav_memcheck(void) {
return memcheck;
}
#endif
/* ---*/
static int get_type_size(int type)
{
switch (type){
case FAVT_BOARD:
return sizeof(fav_board_t);
case FAVT_FOLDER:
return sizeof(fav_folder_t);
case FAVT_LINE:
return sizeof(fav_line_t);
}
return 0;
}
inline static void* fav_malloc(int size){
void *p = (void *)malloc(size);
assert(p);
memset(p, 0, size);
return p;
}
/**
* allocate header(fav_type_t, base class) 跟 fav_*_t (derived class)
* @return 新 allocate 的空間
*/
static fav_type_t *fav_item_allocate(int type)
{
int size = 0;
fav_type_t *ft = (fav_type_t *)fav_malloc(sizeof(fav_type_t));
size = get_type_size(type);
if (size) {
ft->fp = fav_malloc(size);
ft->type = type;
}
return ft;
}
/**
* 只複製 fav_type_t
*/
inline static void
fav_item_copy(fav_type_t *target, const fav_type_t *source){
target->type = source->type;
target->attr = source->attr;
target->fp = source->fp;
}
inline fav_t *get_fav_root(void){
return fav_stack[0];
}
/**
* 是否為有效的 entry
*/
inline int valid_item(fav_type_t *ft){
return ft->attr & FAVH_FAV;
}
/**
* 清除 fp(dir) 中無效的 entry/dir,如果 clean_invisible == true,該 user
* 看不見的看板也會被清除。「無效」指的是沒有 FAVH_FAV flag,所以不包含不
* 存在的看板。
*/
static void rebuild_fav(fav_t *fp, int clean_invisible)
{
int i, j, nData;
fav_type_t *ft;
fav_number -= get_data_number(fp);
fp->lineID = fp->folderID = 0;
fp->nLines = fp->nFolders = fp->nBoards = 0;
nData = fp->DataTail;
fp->DataTail = 0;
for (i = 0, j = 0; i < nData; i++){
if (!(fp->favh[i].attr & FAVH_FAV))
continue;
ft = &fp->favh[i];
switch (get_item_type(ft)){
case FAVT_BOARD:
if (clean_invisible)
if (!HasBoardPerm(&bcache[cast_board(ft)->bid - 1]))
continue;
break;
case FAVT_LINE:
break;
case FAVT_FOLDER:
rebuild_fav(get_fav_folder(&fp->favh[i]), clean_invisible);
break;
default:
continue;
}
fav_increase(fp, &fp->favh[i]);
if (i != j)
fav_item_copy(&fp->favh[j], &fp->favh[i]);
j++;
}
fp->DataTail = get_data_number(fp);
}
inline void fav_cleanup(void)
{
rebuild_fav(get_fav_root(), 0);
}
void fav_clean_invisible(void)
{
rebuild_fav(get_fav_root(), 1);
}
/* sort the fav */
static int favcmp_by_name(const void *a, const void *b)
{
return strcasecmp(get_item_title((fav_type_t *)a), get_item_title((fav_type_t *)b));
}
void fav_sort_by_name(void)
{
fav_t *fp = get_current_fav();
if (fp == NULL)
return;
dirty = 1;
rebuild_fav(fp, 0);
qsort(fp->favh, get_data_number(fp), sizeof(fav_type_t), favcmp_by_name);
}
static int favcmp_by_class(const void *a, const void *b)
{
fav_type_t *f1, *f2;
int cmp;
f1 = (fav_type_t *)a;
f2 = (fav_type_t *)b;
if (get_item_type(f1) == FAVT_FOLDER)
return -1;
if (get_item_type(f2) == FAVT_FOLDER)
return 1;
if (get_item_type(f1) == FAVT_LINE)
return 1;
if (get_item_type(f2) == FAVT_LINE)
return -1;
cmp = strncasecmp(get_item_class(f1), get_item_class(f2), 4);
if (cmp)
return cmp;
return strcasecmp(get_item_title(f1), get_item_title(f2));
}
void fav_sort_by_class(void)
{
fav_t *fp = get_current_fav();
if (fp == NULL)
return;
dirty = 1;
rebuild_fav(fp, 0);
qsort(fp->favh, get_data_number(fp), sizeof(fav_type_t), favcmp_by_class);
}
/**
* The following is the movement operations in the user interface.
*/
/**
* 目錄層數是否達到最大值 FAV_MAXDEPTH
*/
inline int fav_stack_full(void){
return fav_stack_num >= FAV_MAXDEPTH;
}
inline static int fav_stack_push_fav(fav_t *fp){
if (fav_stack_full())
return -1;
fav_stack[fav_stack_num++] = fp;
return 0;
}
inline static int fav_stack_push(fav_type_t *ft){
// if (ft->type != FAVT_FOLDER)
// return -1;
return fav_stack_push_fav(get_fav_folder(ft));
}
inline static void fav_stack_pop(void){
fav_stack[--fav_stack_num] = NULL;
}
void fav_folder_in(short fid)
{
fav_type_t *tmp = getfolder(fid);
if (get_item_type(tmp) == FAVT_FOLDER){
fav_stack_push(tmp);
}
}
void fav_folder_out(void)
{
fav_stack_pop();
}
static void read_favrec(FILE *frp, fav_t *fp)
{
int i;
fav_type_t *ft;
fread(&fp->nBoards, sizeof(fp->nBoards), 1, frp);
fread(&fp->nLines, sizeof(fp->nLines), 1, frp);
fread(&fp->nFolders, sizeof(fp->nFolders), 1, frp);
fp->DataTail = get_data_number(fp);
fp->nAllocs = fp->DataTail + FAV_PRE_ALLOC;
fp->lineID = fp->folderID = 0;
fp->favh = (fav_type_t *)fav_malloc(sizeof(fav_type_t) * fp->nAllocs);
fav_number += get_data_number(fp);
for(i = 0; i < fp->DataTail; i++){
ft = &fp->favh[i];
fread(&ft->type, sizeof(ft->type), 1, frp);
fread(&ft->attr, sizeof(ft->attr), 1, frp);
ft->fp = (void *)fav_malloc(get_type_size(ft->type));
/* TODO A pointer has different size between 32 and 64-bit arch.
* But the pointer in fav_folder_t is irrelevant here.
* In order not to touch the current .fav4, fav_folder4_t is used
* here. It should be FIXED in the next version. */
switch (ft->type) {
case FAVT_FOLDER:
fread(ft->fp, sizeof(fav_folder4_t), 1, frp);
break;
case FAVT_BOARD:
case FAVT_LINE:
fread(ft->fp, get_type_size(ft->type), 1, frp);
break;
}
}
for(i = 0; i < fp->DataTail; i++){
ft = &fp->favh[i];
switch (ft->type) {
case FAVT_FOLDER: {
fav_t *p = (fav_t *)fav_malloc(sizeof(fav_t));
read_favrec(frp, p);
cast_folder(ft)->this_folder = p;
cast_folder(ft)->fid = ++(fp->folderID);
break;
}
case FAVT_LINE:
cast_line(ft)->lid = ++(fp->lineID);
break;
}
}
}
/**
* 從記錄檔中 load 出我的最愛。
*/
int fav_load(void)
{
FILE *frp;
char buf[128];
fav_t *fp;
if (fav_stack_num > 0)
return -1;
setuserfile(buf, FAV4);
if (!dashf(buf)) {
fp = (fav_t *)fav_malloc(sizeof(fav_t));
fav_stack_push_fav(fp);
#ifdef MEM_CHECK
fav_set_memcheck(MEM_CHECK);
#endif
return 0;
}
if ((frp = fopen(buf, "r")) == NULL)
return -1;
fp = (fav_t *)fav_malloc(sizeof(fav_t));
fav_number = 0;
read_favrec(frp, fp);
fav_stack_push_fav(fp);
fclose(frp);
#ifdef MEM_CHECK
fav_set_memcheck(MEM_CHECK);
#endif
return 0;
}
/* write to the rec file */
static void write_favrec(FILE *fwp, fav_t *fp)
{
int i;
fav_type_t *ft;
if (fp == NULL)
return;
fwrite(&fp->nBoards, sizeof(fp->nBoards), 1, fwp);
fwrite(&fp->nLines, sizeof(fp->nLines), 1, fwp);
fwrite(&fp->nFolders, sizeof(fp->nFolders), 1, fwp);
fp->DataTail = get_data_number(fp);
for(i = 0; i < fp->DataTail; i++){
ft = &fp->favh[i];
fwrite(&ft->type, sizeof(ft->type), 1, fwp);
fwrite(&ft->attr, sizeof(ft->attr), 1, fwp);
/* TODO Please refer to read_favrec() */
switch (ft->type) {
case FAVT_FOLDER:
fwrite(ft->fp, sizeof(fav_folder4_t), 1, fwp);
break;
case FAVT_BOARD:
case FAVT_LINE:
fwrite(ft->fp, get_type_size(ft->type), 1, fwp);
break;
}
}
for(i = 0; i < fp->DataTail; i++){
if (fp->favh[i].type == FAVT_FOLDER)
write_favrec(fwp, get_fav_folder(&fp->favh[i]));
}
}
/**
* 把記錄檔 save 進我的最愛。
* @note fav_cleanup() 會先被呼叫。
*/
int fav_save(void)
{
FILE *fwp;
char buf[PATHLEN], buf2[PATHLEN];
fav_t *fp = get_fav_root();
#ifdef MEM_CHECK
if (fav_memcheck() != MEM_CHECK)
return -1;
#endif
if (fp == NULL)
return -1;
fav_cleanup();
if (!dirty)
return 0;
setuserfile(buf, FAV4".tmp");
setuserfile(buf2, FAV4);
fwp = fopen(buf, "w");
if(fwp == NULL)
return -1;
write_favrec(fwp, fp);
fclose(fwp);
Rename(buf, buf2);
return 0;
}
/**
* remove ft (設為 invalid,實際上會等到 save 時才清除)
*/
static inline void fav_free_item(fav_type_t *ft)
{
set_attr(ft, 0xFFFF, FALSE);
}
/**
* delete ft from fp
*/
static int fav_remove(fav_t *fp, fav_type_t *ft)
{
if (fp == NULL || ft == NULL)
return -1;
fav_free_item(ft);
fav_decrease(fp, ft);
return 0;
}
/**
* free the mem of fp recursively
*/
static void fav_free_branch(fav_t *fp)
{
int i;
fav_type_t *ft;
if (fp == NULL)
return;
for(i = 0; i < fp->DataTail; i++){
ft = &fp->favh[i];
switch(get_item_type(ft)){
case FAVT_FOLDER:
fav_free_branch(cast_folder(ft)->this_folder);
break;
case FAVT_BOARD:
case FAVT_LINE:
if (ft->fp)
free(ft->fp);
break;
}
fav_remove(fp, ft);
}
free(fp->favh);
free(fp);
fp = NULL;
}
/**
* free the mem of the whole fav tree recursively
*/
void fav_free(void)
{
fav_free_branch(get_fav_root());
/* reset the stack */
fav_stack_num = 0;
}
/**
* 從目前的 dir 中找出特定類別 (type)、id 為 id 的 entry。
* 找不到傳回 NULL
*/
static fav_type_t *get_fav_item(short id, int type)
{
int i;
fav_type_t *ft;
fav_t *fp = get_current_fav();
if (fp == NULL)
return NULL;
for(i = 0; i < fp->DataTail; i++){
ft = &fp->favh[i];
if (!valid_item(ft) || get_item_type(ft) != type)
continue;
if (fav_getid(ft) == id)
return ft;
}
return NULL;
}
/**
* 從目前的 dir 中 remove 特定類別 (type)、id 為 id 的 entry。
*/
void fav_remove_item(short id, char type)
{
fav_remove(get_current_fav(), get_fav_item(id, type));
}
/**
* get*(bid) 傳回目前的 dir 中該類別 id == bid 的 entry。
*/
fav_type_t *getadmtag(short bid)
{
int i;
fav_t *fp = get_fav_root();
fav_type_t *ft;
for (i = 0; i < fp->DataTail; i++) {
ft = &fp->favh[i];
if (get_item_type(ft) == FAVT_BOARD && cast_board(ft)->bid == bid && is_set_attr(ft, FAVH_ADM_TAG))
return ft;
}
return NULL;
}
fav_type_t *getboard(short bid)
{
return get_fav_item(bid, FAVT_BOARD);
}
fav_type_t *getfolder(short fid)
{
return get_fav_item(fid, FAVT_FOLDER);
}
char *get_folder_title(int fid)
{
return get_item_title(get_fav_item(fid, FAVT_FOLDER));
}
char getbrdattr(short bid)
{
fav_type_t *fb = getboard(bid);
if (!fb)
return 0;
return fb->attr;
}
time4_t getbrdtime(short bid)
{
fav_type_t *fb = getboard(bid);
if (!fb)
return 0;
return cast_board(fb)->lastvisit;
}
void setbrdtime(short bid, time4_t t)
{
fav_type_t *fb = getboard(bid);
if (fb)
cast_board(fb)->lastvisit = t;
}
int fav_getid(fav_type_t *ft)
{
switch(get_item_type(ft)){
case FAVT_FOLDER:
return cast_folder(ft)->fid;
case FAVT_LINE:
return cast_line(ft)->lid;
case FAVT_BOARD:
return cast_board(ft)->bid;
}
return -1;
}
inline static int is_maxsize(void){
return fav_number >= MAX_FAV;
}
/**
* 每次一個 dir 滿時,這個 function 會將 buffer 大小調大 FAV_PRE_ALLOC 個,
* 直到上限為止。
*/
static int enlarge_if_full(fav_t *fp)
{
fav_type_t * p;
/* enlarge the volume if need. */
if (is_maxsize())
return -1;
if (fp->DataTail < fp->nAllocs)
return 1;
/* realloc and clean the tail */
p = (fav_type_t *)realloc(fp->favh, sizeof(fav_type_t) * (fp->nAllocs + FAV_PRE_ALLOC));
if( p == NULL )
return -1;
fp->favh = p;
memset(fp->favh + fp->nAllocs, 0, sizeof(fav_type_t) * FAV_PRE_ALLOC);
fp->nAllocs += FAV_PRE_ALLOC;
return 0;
}
/**
* 將一個新的 entry item 加入 fp 中
*/
static int fav_add(fav_t *fp, fav_type_t *item)
{
if (enlarge_if_full(fp) < 0)
return -1;
fav_item_copy(&fp->favh[fp->DataTail], item);
fav_increase(fp, item);
return 0;
}
static void move_in_folder(fav_t *fav, int src, int dst)
{
int i, count;
fav_type_t tmp;
if (src == dst || fav == NULL)
return;
dirty = 1;
/* Find real locations of src and dst in fav->favh[] */
for(count = i = 0; count <= src; i++)
if (valid_item(&fav->favh[i]))
count++;
src = i - 1;
for(count = i = 0; count <= dst; i++)
if (valid_item(&fav->favh[i]))
count++;
dst = i - 1;
fav_item_copy(&tmp, &fav->favh[src]);
if (src < dst) {
for(i = src; i < dst; i++)
fav_item_copy(&fav->favh[i], &fav->favh[i + 1]);
}
else { // dst < src
for(i = src; i > dst; i--)
fav_item_copy(&fav->favh[i], &fav->favh[i - 1]);
}
fav_item_copy(&fav->favh[dst], &tmp);
}
/**
* 將目前目錄中第 src 個 entry 移到 dst。
* @note src/dst 是 user 實際上看到的位置,也就是不包含 invalid entry。
*/
void move_in_current_folder(int from, int to)
{
move_in_folder(get_current_fav(), from, to);
}
/**
* the following defines the interface of add new fav_XXX
*/
/**
* allocate 一個 folder entry
*/
inline static fav_t *alloc_folder_item(void){
fav_t *fp = (fav_t *)fav_malloc(sizeof(fav_t));
fp->nAllocs = FAV_PRE_ALLOC;
fp->favh = (fav_type_t *)fav_malloc(sizeof(fav_type_t) * FAV_PRE_ALLOC);
return fp;
}
static fav_type_t *init_add(fav_t *fp, int type)
{
fav_type_t *ft;
if (is_maxsize())
return NULL;
ft = fav_item_allocate(type);
set_attr(ft, FAVH_FAV, TRUE);
fav_add(fp, ft);
return ft;
}
/**
* 新增一分隔線
* @return 加入的 entry 指標
*/
fav_type_t *fav_add_line(void)
{
fav_t *fp = get_current_fav();
if (fp == NULL || get_line_num(fp) >= MAX_LINE)
return NULL;
return init_add(fp, FAVT_LINE);
}
/**
* 新增一目錄
* @return 加入的 entry 指標
*/
fav_type_t *fav_add_folder(void)
{
fav_t *fp = get_current_fav();
fav_type_t *ft;
if (fav_stack_full())
return NULL;
if (fp == NULL || get_folder_num(fp) >= MAX_FOLDER)
return NULL;
ft = init_add(fp, FAVT_FOLDER);
if (ft == NULL)
return NULL;
cast_folder(ft)->this_folder = alloc_folder_item();
return ft;
}
/**
* 將指定看板加入目前的目錄。
* @return 加入的 entry 指標
* @note 不允許同一個板被加入兩次
*/
fav_type_t *fav_add_board(int bid)
{
fav_t *fp = get_current_fav();
fav_type_t *ft = getboard(bid);
if (fp == NULL)
return NULL;
if (ft != NULL)
return ft;
ft = init_add(fp, FAVT_BOARD);
if (ft == NULL)
return NULL;
cast_board(ft)->bid = bid;
return ft;
}
/**
* for administrator to move/administrate board
*/
fav_type_t *fav_add_admtag(int bid)
{
fav_t *fp = get_fav_root();
fav_type_t *ft;
if (is_maxsize())
return NULL;
ft = fav_item_allocate(FAVT_BOARD);
if (ft == NULL)
return NULL;
// turn on FAVH_ADM_TAG
set_attr(ft, FAVH_ADM_TAG, TRUE);
fav_add(fp, ft);
cast_board(ft)->bid = bid;
return ft;
}
/* everything about the tag in fav mode.
* I think we don't have to implement the function 'cross-folder' tag.*/
/**
* 將目前目錄下,由 type & id 指定的 entry 標上/取消 tag
* @param bool 同 set_attr
* @note 若同一個目錄不幸有同樣的東西,只有第一個會作用。
*/
void fav_tag(short id, char type, char bool) {
fav_type_t *ft = get_fav_item(id, type);
if (ft != NULL)
set_attr(ft, FAVH_TAG, bool);
}
static void fav_dosomething_tagged_item(fav_t *fp, int (*act)(fav_t *, fav_type_t *))
{
int i;
for(i = 0; i < fp->DataTail; i++){
if (is_set_attr(&fp->favh[i], FAVH_FAV) && is_set_attr(&fp->favh[i], FAVH_TAG))
if ((*act)(fp, &fp->favh[i]) < 0)
break;
}
}
static int remove_tagged_item(fav_t *fp, fav_type_t *ft)
{
// do not remove the folder if it's on the stack
if (get_item_type(ft) == FAVT_FOLDER) {
int i;
for(i = 0; i < FAV_MAXDEPTH && fav_stack[i] != NULL; i++) {
if (fav_stack[i] == get_fav_folder(ft)){
set_attr(ft, FAVH_TAG, FALSE);
return 0;
}
}
}
return fav_remove(fp, ft);
}
inline static int fav_remove_tagged_item(fav_t *fp){
fav_dosomething_tagged_item(fp, remove_tagged_item);
return 0;
}
/* add an item into a fav_t.
* here we must give the line and foler a new id to prevent an old one is exist.
*/
static int add_and_remove_tag(fav_t *fp, fav_type_t *ft)
{
fav_type_t *tmp;
// do not remove the folder if it's on the stack
if (get_item_type(ft) == FAVT_FOLDER) {
int i;
for(i = 0; i < FAV_MAXDEPTH && fav_stack[i] != NULL; i++) {
if (fav_stack[i] == get_fav_folder(ft)){
set_attr(ft, FAVH_TAG, FALSE);
return 0;
}
}
}
tmp = fav_malloc(sizeof(fav_type_t));
fav_item_copy(tmp, ft);
/* since fav_item_copy is symbolic link, we disable removed link to
* prevent double-free when doing fav_clean(). */
ft->fp = NULL;
set_attr(tmp, FAVH_TAG, FALSE);
if (fav_add(fav_get_tmp_fav(), tmp) < 0)
return -1;
fav_remove(fp, ft);
return 0;
}
inline static int fav_add_tagged_item(fav_t *fp){
if (fp == fav_get_tmp_fav())
return -1;
fav_dosomething_tagged_item(fp, add_and_remove_tag);
return 0;
}
static void fav_do_recursively(fav_t *fp, int (*act)(fav_t *))
{
int i;
fav_type_t *ft;
for(i = 0; i < fp->DataTail; i++){
ft = &fp->favh[i];
if (!valid_item(ft))
continue;
if (get_item_type(ft) == FAVT_FOLDER && get_fav_folder(ft) != NULL){
fav_do_recursively(get_fav_folder(ft), act);
}
}
(*act)(fp);
}
static void fav_dosomething_all_tagged_item(int (*act)(fav_t *))
{
fav_do_recursively(get_fav_root(), act);
}
/**
* fav_*_all_tagged_item 在整個我的最愛上對已標上 tag 的 entry 做某件事。
*/
void fav_remove_all_tagged_item(void)
{
fav_dosomething_all_tagged_item(fav_remove_tagged_item);
}
void fav_add_all_tagged_item(void)
{
fav_set_tmp_folder(get_current_fav());
fav_dosomething_all_tagged_item(fav_add_tagged_item);
}
inline static int remove_tag(fav_t *fp, fav_type_t *ft)
{
set_attr(ft, FAVH_TAG, FALSE);
return 0;
}
inline static int remove_tags(fav_t *fp)
{
fav_dosomething_tagged_item(fp, remove_tag);
return 0;
}
/**
* 移除我的最愛所有的 tags
*/
void fav_remove_all_tag(void)
{
fav_dosomething_all_tagged_item(remove_tags);
}
/**
* 設定 folder 的中文名稱
*/
void fav_set_folder_title(fav_type_t *ft, char *title)
{
if (get_item_type(ft) != FAVT_FOLDER)
return;
dirty = 1;
strlcpy(cast_folder(ft)->title, title, sizeof(cast_folder(ft)->title));
}
#define BRD_OLD 0
#define BRD_NEW 1
#define BRD_END 2
/**
* 如果 user 開啟 FAVNEW_FLAG 的功能:
* mode == 1: update 看板,並將新看板加入我的最愛。
* mode == 0: update 資訊但不加入。
*
* @return 加入的看板數
* PS. count 就讓它數完,才不會在下一次 login 又從一半開始數。
*/
int updatenewfav(int mode)
{
/* mode: 0: don't write to fav 1: write to fav */
int i, fd, brdnum;
int count = 0;
char fname[80], *brd;
if(!(cuser.uflag2 & FAVNEW_FLAG))
return 0;
setuserfile(fname, FAVNB);
if( (fd = open(fname, O_RDWR | O_CREAT, 0600)) != -1 ){
assert(numboards>=0);
brdnum = numboards; /* avoid race */
brd = (char *)malloc((brdnum + 1) * sizeof(char));
memset(brd, 0, (brdnum + 1) * sizeof(char));
i = read(fd, brd, (brdnum + 1) * sizeof(char));
if (i < 0) {
free(brd);
close(fd);
vmsg("favorite subscription error");
return -1;
}
/* if it's a new file, no BRD_END is in it. */
brd[i] = BRD_END;
for(i = 0; i < brdnum + 1 && brd[i] != BRD_END; i++){
if(brd[i] == BRD_NEW){
/* check the permission if the board exsits */
if(bcache[i].brdname[0] && HasBoardPerm(&bcache[i])){
if(mode && !(bcache[i].brdattr & BRD_SYMBOLIC)) {
fav_add_board(i + 1);
count++;
}
brd[i] = BRD_OLD;
}
}
else{
if(!bcache[i].brdname[0])
brd[i] = BRD_NEW;
}
}
if( i < brdnum) { // the board number may change
for(; i < brdnum; ++i){
if(bcache[i].brdname[0] && HasBoardPerm(&bcache[i])){
if(mode && !(bcache[i].brdattr & BRD_SYMBOLIC)) {
fav_add_board(i + 1);
count++;
}
brd[i] = BRD_OLD;
}
else
brd[i] = BRD_NEW;
}
}
brd[i] = BRD_END;
lseek(fd, 0, SEEK_SET);
write(fd, brd, (brdnum + 1) * sizeof(char));
free(brd);
close(fd);
}
return count;
}
void subscribe_newfav(void)
{
updatenewfav(0);
}
#ifdef NOT_NECESSARY_NOW
/** backward compatible **/
/* old struct */
#define BRD_UNREAD 1
#define BRD_FAV 2
#define BRD_LINE 4
#define BRD_TAG 8
#define BRD_GRP_HEADER 16
typedef struct {
short bid;
char attr;
time4_t lastvisit;
} fav3_board_t;
typedef struct {
short nDatas;
short nAllocs;
char nLines;
fav_board_t *b;
} fav3_t;
int fav_v3_to_v4(void)
{
int i, fd, fdw;
char buf[128];
short nDatas;
char nLines;
fav_t *fav4;
fav3_board_t *brd;
setuserfile(buf, FAV3);
if (!dashf(buf))
return -1;
setuserfile(buf, FAV4);
if (dashf(buf))
return 0;
fdw = open(buf, O_WRONLY | O_CREAT | O_TRUNC, 0600);
if (fdw < 0)
return -1;
setuserfile(buf, FAV3);
fd = open(buf, O_RDONLY);
if (fd < 0) {
close(fdw);
return -1;
}
fav4 = (fav_t *)fav_malloc(sizeof(fav_t));
read(fd, &nDatas, sizeof(nDatas));
read(fd, &nLines, sizeof(nLines));
fav4->DataTail = nDatas;
//fav4->nBoards = nDatas - (-nLines);
//fav4->nLines = -nLines;
fav4->nBoards = fav4->nFolders = fav4->nLines = 0;
fav4->favh = (fav_type_t *)fav_malloc(sizeof(fav_type_t) * fav4->DataTail);
brd = (fav3_board_t *)fav_malloc(sizeof(fav3_board_t) * nDatas);
read(fd, brd, sizeof(fav3_board_t) * nDatas);
for(i = 0; i < fav4->DataTail; i++){
fav4->favh[i].type = brd[i].attr & BRD_LINE ? FAVT_LINE : FAVT_BOARD;
if (brd[i].attr & BRD_UNREAD)
fav4->favh[i].attr |= FAVH_UNREAD;
if (brd[i].attr & BRD_FAV)
fav4->favh[i].attr |= FAVH_FAV;
if (brd[i].attr & BRD_TAG)
fav4->favh[i].attr |= FAVH_TAG;
fav4->favh[i].fp = (void *)fav_malloc(get_type_size(fav4->favh[i].type));
if (brd[i].attr & BRD_LINE){
fav4->favh[i].type = FAVT_LINE;
cast_line(&fav4->favh[i])->lid = ++fav4->nLines;
}
else{
fav4->favh[i].type = FAVT_BOARD;
cast_board(&fav4->favh[i])->bid = brd[i].bid;
cast_board(&fav4->favh[i])->lastvisit = brd[i].lastvisit;
fav4->nBoards++;
}
}
write_favrec(fdw, fav4);
fav_free_branch(fav4);
free(brd);
close(fd);
close(fdw);
return 0;
}
#endif
|