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
|
#include "bbs.h"
#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};
/* 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 */
/* for casting */
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;
}
inline static int get_data_tail(fav_t *fp){
return fp->DataTail;
}
inline int get_data_number(fav_t *fp){
return fp->nBoards + fp->nLines + fp->nFolders;
}
inline fav_t *get_current_fav(void){
if (fav_stack_num == 0)
return NULL;
return fav_stack[fav_stack_num - 1];
}
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;
}
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;
}
static void fav_decrease(fav_t *fp, fav_type_t *ft){
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--;
}
static void fav_increase(fav_t *fp, fav_type_t *ft)
{
switch (get_item_type(ft)){
case FAVT_BOARD:
fp->nBoards++;
break;
case FAVT_LINE:
fp->nLines++;
fp->lineID++;
break;
case FAVT_FOLDER:
fp->nFolders++;
fp->folderID++;
break;
}
fav_number++;
fp->DataTail++;
}
inline static int get_folder_num(fav_t *fp) {
return fp->nFolders;
}
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;
}
/* bool:
* 0: unset 1: set 2: opposite */
void set_attr(fav_type_t *ft, int bit, char bool){
if (bool == 2)
ft->attr ^= bit;
else if (bool == 1)
ft->attr |= bit;
else
ft->attr &= ~bit;
}
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);
memset(p, 0, size);
return p;
}
/* allocate the header(fav_type_t) and item it self. */
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;
}
/* symbolic link */
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 static fav_t *get_fav_root(void){
return fav_stack[0];
}
char current_fav_at_root(void) {
return get_current_fav() == get_fav_root();
}
/* is it an valid entry */
inline int valid_item(fav_type_t *ft){
return ft->attr & FAVH_FAV;
}
/* return: the exact number after cleaning
* reset the line number, board number, folder number, and total number (number)
*/
static void rebuild_fav(fav_t *fp)
{
int i, j, nData;
fav_type_t *ft;
fav_number = 0;
fp->lineID = fp->folderID = 0;
fp->nLines = fp->nFolders = fp->nBoards = 0;
nData = fp->DataTail;
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:
/*
bid = cast_board(ft)->bid;
if (SHM->GV2.e.cleanboard && bcache[bid - 1].brdname[0])
continue;
*/
break;
case FAVT_LINE:
cast_line(ft)->lid = fp->lineID + 1;
break;
case FAVT_FOLDER:
cast_folder(ft)->fid = fp->folderID + 1;
rebuild_fav(get_fav_folder(&fp->favh[i]));
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 cleanup(void)
{
rebuild_fav(get_fav_root());
}
/* 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)
{
rebuild_fav(get_current_fav());
qsort(get_current_fav()->favh, get_data_number(get_current_fav()), 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)
{
rebuild_fav(get_current_fav());
qsort(get_current_fav()->favh, get_data_number(get_current_fav()), sizeof(fav_type_t), favcmp_by_class);
}
/*
* The following is the movement operations in the user interface.
*/
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();
}
/* load from the rec file */
static void read_favrec(int fd, fav_t *fp)
{
int i;
fav_type_t *ft;
read(fd, &fp->nBoards, sizeof(fp->nBoards));
read(fd, &fp->nLines, sizeof(fp->nLines));
read(fd, &fp->nFolders, sizeof(fp->nFolders));
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);
for(i = 0; i < fp->DataTail; i++){
read(fd, &fp->favh[i].type, sizeof(fp->favh[i].type));
read(fd, &fp->favh[i].attr, sizeof(fp->favh[i].attr));
fp->favh[i].fp = (void *)fav_malloc(get_type_size(fp->favh[i].type));
read(fd, fp->favh[i].fp, get_type_size(fp->favh[i].type));
}
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(fd, p);
cast_folder(ft)->this_folder = p;
cast_folder(ft)->fid = ++(fp->folderID);
break;
}
case FAVT_LINE:
cast_line(ft)->lid = ++(fp->lineID);
break;
}
}
}
int fav_load(void)
{
int fd;
char buf[128];
fav_t *fp;
if (fav_stack_num > 0)
return -1;
setuserfile(buf, FAV4);
fd = open(buf, O_RDONLY);
if (fd < 0){
return -1;
}
fp = (fav_t *)fav_malloc(sizeof(fav_t));
read_favrec(fd, fp);
fav_stack_push_fav(fp);
close(fd);
fav_set_memcheck(MEM_CHECK);
return 0;
}
/* write to the rec file */
static void write_favrec(int fd, fav_t *fp)
{
int i;
if (fp == NULL)
return;
write(fd, &fp->nBoards, sizeof(fp->nBoards));
write(fd, &fp->nLines, sizeof(fp->nLines));
write(fd, &fp->nFolders, sizeof(fp->nFolders));
fp->DataTail = get_data_number(fp);
for(i = 0; i < fp->DataTail; i++){
write(fd, &fp->favh[i].type, sizeof(fp->favh[i].type));
write(fd, &fp->favh[i].attr, sizeof(fp->favh[i].attr));
write(fd, fp->favh[i].fp, get_type_size(fp->favh[i].type));
}
for(i = 0; i < fp->DataTail; i++){
if (fp->favh[i].type == FAVT_FOLDER)
write_favrec(fd, get_fav_folder(&fp->favh[i]));
}
}
int fav_save(void)
{
int fd;
char buf[128];
fav_t *fp = get_fav_root();
#ifdef MEM_CHECK
if (fav_memcheck() != MEM_CHECK)
return -1;
#endif
if (fp == NULL)
return -1;
cleanup();
setuserfile(buf, FAV4);
fd = open(buf, O_CREAT | O_TRUNC | O_WRONLY, 0600);
if (fd < 0)
return -1;
write_favrec(fd, fp);
close(fd);
return 0;
}
/* It didn't need to remove it self, just remove all the attributes.
* It'll be remove when it save to the record file. */
static void fav_free_item(fav_type_t *ft)
{
set_attr(ft, 0xFFFF, FALSE);
}
static int fav_non_recursive_remove(fav_t *fp, fav_type_t *ft)
{
set_attr(ft, 0xFFFF, FALSE);
fav_decrease(fp, ft);
return 0;
}
static int fav_remove(fav_t *fp, fav_type_t *ft)
{
fav_free_item(ft);
fav_decrease(fp, ft);
return 0;
}
/* free the mem of whole fav tree */
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];
fav_remove(fp, ft);
}
free(fp);
fp = NULL;
}
void fav_free(void)
{
fav_free_branch(get_fav_root());
/* reset the stack */
fav_stack_num = 0;
}
static fav_type_t *get_fav_item(short id, int type)
{
int i;
fav_type_t *ft;
fav_t *fp = get_current_fav();
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;
}
void fav_remove_item(short id, char type)
{
fav_remove(get_current_fav(), get_fav_item(id, type));
}
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 (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;
}
time_t getbrdtime(short bid)
{
fav_type_t *fb = getboard(bid);
if (!fb)
return 0;
return cast_board(fb)->lastvisit;
}
void setbrdtime(short bid, time_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;
}
/* suppose we don't add too much fav_type_t at the same time. */
static int enlarge_if_full(fav_t *fp)
{
fav_type_t * p;
/* enlarge the volume if need. */
if (fav_number >= MAX_FAV)
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;
}
inline static int is_maxsize(void){
return fav_number >= MAX_FAV;
}
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;
}
/* just move, in one folder */
static void move_in_folder(fav_t *fav, int from, int to)
{
int i, count;
fav_type_t tmp;
/* Find real locations of from and to in fav->favh[] */
for(count = i = 0; count <= from; i++)
if (valid_item(&fav->favh[i]))
count++;
from = i - 1;
for(count = i = 0; count <= to; i++)
if (valid_item(&fav->favh[i]))
count++;
to = i - 1;
fav_item_copy(&tmp, &fav->favh[from]);
if (from < to) {
for(i = from; i < to; i++)
fav_item_copy(&fav->favh[i], &fav->favh[i + 1]);
}
else { // to < from
for(i = from; i > to; i--)
fav_item_copy(&fav->favh[i], &fav->favh[i - 1]);
}
fav_item_copy(&fav->favh[to], &tmp);
}
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 */
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;
}
/* if place < 0, just put the item to the tail */
fav_type_t *fav_add_line(void)
{
fav_t *fp = get_current_fav();
fav_type_t *ft;
if (get_line_num(fp) >= MAX_LINE)
return NULL;
ft = init_add(fp, FAVT_LINE);
if (ft == NULL)
return NULL;
cast_line(ft)->lid = get_line_id(fp);
return ft;
}
fav_type_t *fav_add_folder(void)
{
fav_t *fp = get_current_fav();
fav_type_t *ft;
if (fav_stack_full())
return NULL;
if (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();
cast_folder(ft)->fid = get_folder_id(fp); // after fav_increase
return ft;
}
fav_type_t *fav_add_board(int bid)
{
fav_t *fp = get_current_fav();
fav_type_t *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, 1);
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.*/
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)
{
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)
{
int i;
fav_type_t *tmp;
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);
set_attr(tmp, FAVH_TAG, FALSE);
/* give the new id */
switch (tmp->type) {
case FAVT_FOLDER:
cast_folder(tmp)->fid = fp->folderID + 1;
break;
case FAVT_LINE:
cast_line(tmp)->lid = fp->lineID + 1;
break;
}
if (fav_add(fav_get_tmp_fav(), tmp) < 0)
return -1;
if (get_item_type(ft) == FAVT_FOLDER)
fav_non_recursive_remove(fp, ft);
else
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);
}
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;
}
void fav_remove_all_tag(void)
{
fav_dosomething_all_tagged_item(remove_tags);
}
void fav_set_folder_title(fav_type_t *ft, char *title)
{
if (get_item_type(ft) != FAVT_FOLDER)
return;
strlcpy(cast_folder(ft)->title, title, sizeof(cast_folder(ft)->title));
}
/* 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;
time_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 = (fav_t *)fav_malloc(sizeof(fav_t));
fav3_board_t *brd;
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;
}
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;
}
|