/
ciifu.c
2010 lines (1915 loc) · 54.4 KB
/
ciifu.c
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
/*-------------------------------------------------------------------------
ciifu.c
SVD 10-03-93
Rotinas para Inserir/remover postings no arquivo .IFP
AOT 08-03-95
Operacao Multiusuario
---------------------------------------------------------------------------*/
#include <stdio.h>
#include <string.h>
#include "cisis.h"
#include "ciupi.h"
#if CICPP
#include <ciifu.hpp>
#include <cidbx.hpp>
#include <citrm.hpp>
#include <cirec.hpp>
#include <cifst.hpp>
#include <cirun.hpp>
#ifdef USE_ERROR_SYS
#include <ui_win.hpp>
#include <errorsys.hpp>
extern MY_ERROR_SYSTEM * errsys;
extern UIW_WINDOW * wprogress;
extern UIW_WINDOW *mainwindow;
extern MESS_SYSTEM *mess;
extern int DS_OperationStopped; // must be implemented in another way
#define USE_INFO_SYS
#include <textdb.hpp>
#endif
#endif /* CICPP */
#if !CICPP
int ifupd_reset=2;
int ifupd_wrnmsg=1;
#endif /* CICPP */
#define lnk_not_found_msg "Warning! Link not found. Cannot delete"
#define lnk_dup_msg "Warning! Duplicate link"
/*-----------------------------------------------------------------------*/
#define AOT 1
#define MULTI_IF MULTI
#define SHTEST 0
#if !CICPP
#if SHTEST
static char shtest[CIMPL+1];
#endif /* SHTEST */
#endif /* CICPP */
#define TRACEOPT 0
#define TRACEUPIF DEBIFUPD
#define TRACEUPIF2 0
#define MODIFIED TRUE
#define NOT_MODIFIED FALSE
#define PSTADDR(blk,idx) (POSTSTRU *)&blk->ifprec[idx]
#define HEAD(blk,off) (IFPHEAD *)&blk->ifprec[off]
#define HEADSIZE sizeof(IFPHEAD)
#define POSTSIZE sizeof(POSTSTRU)
#define BLK(x) x->ifpblk
#if !CICPP
static UCHR key[LE2+1],*keyp;
static INVMAP *invp;
static DBXSTRU *dbxp;
#if LINDLUX /* 2 */
static int luxtree,luxn;
static LONGX luxpunt,luxpos,luxx,luxaddr;
static L0STRU *luxpagp;
static L1STRU *luxp1;
static L2STRU *luxp2;
static char *luxp;
/* <============================ */
#else /* LINDLUX 2 */
#if !LIND /* 8x2 */
typedef struct ifpkeydata {
BOOLEAN st; /* record modified */
IFPSTRU reg;
} IFPKEYDATA;
#define UNDEFINED -1
#define CURR_INP 0
#define SEGH 1
#define FIRST 2
#define CURR_OUT 3
#define PREG(x) (IFPSTRU *)&(v[x].reg)
#define BLKX(x) BLK( (PREG(x)) )
#define STATUS(x) v[x].st
static IFPKEYDATA v[4];
static int idx_curr_inp,idx_segh,idx_first,idx_curr_out;
static BOOLEAN dupl_msg,ja_inseriu;
static POSTSTRU *pinitpst,initpst;
static UCHR buf[IFBSIZ],*pbuf;
static IFPAVAILPOS pn;
static INFO totp_inp,nxtb_inp,nxtp_inp,segp_inp,segc_inp,
accurate_totp,nxtb_out,nxtp_out,npst_read_in_seg,
off_fh_inp,off_ch_inp,blk_inp,off_inp,
idxpst_inp,idxpst_out;
static IFPSTRU *pcur_blk,*pcur_blk_out;
#endif /* !LIND 8x2 */
#endif /* LINDLUX 2 */
static LONGX nlidos;
#endif /* CICPP */
/*-------------------------------------------------------------------------*/
#if CNV_PCBINUM
/*25/07/97*/
/* Variaveis para guardar a localizacao ds headers de um segmento */
/* 128/(5+2) */
#define IFLmaxhd IFPmaxhd*MAXIFPMEM + 1 /* headers em memoria */
#if ! CICPP
static int hdn=-1; /* numero headers de um ifp */
static INFO hdblk[IFLmaxhd];
static INFO hdoff[IFLmaxhd];
#endif /* CICPP */
#endif /*CNV_PCBINUM */
/*-------------------------------------------------------------------------*/
#if ! CICPP
#if ANSI
void optlnk1(char *lnk1p,LONGX qtylk1,char *olnk1p,LONGX oqtylk1);
void optlnk2(char *lnk2p,LONGX qtylk2,char *olnk2p,LONGX oqtylk2);
void trace_records(LONGX tell);
void posiciona_inicio_seg(void);
void verif_grava_rec(DBXSTRU *dbxp,int idx );
PUNT upif_init_index(DBXSTRU *dbxp, int treecase, UCHR *key,INFO TSTblk,
INFO TSToff);
PUNT upif_create_root(DBXSTRU *dbxp,PUNT esq,UCHR *key,
PUNT dir,int treecase,BOOLEAN first);
BOOLEAN upif_find_key_leaf(L0STRU *lp, UCHR *key, int treecase,
int *pos);
BOOLEAN upif_find_key_node(N0STRU *np,UCHR *key, int treecase,
int *pos);
void upif_fnd_pifp(DBXSTRU *dbxp,UCHR *key,int treecase,
POSTSTRU *pst,UCHR oper,int PSTFLAG);
void upif_branqueia(UCHR *str, int size);
BOOLEAN upif_insert_index (DBXSTRU *dbxp,
PUNT punt,int treecase,int level,int isroot,
UCHR *b_key,PUNT b_punt,
UCHR *p_key,PUNT *p_punt);
PUNT upif_search_btree(INVMAP *invp,int treecase, UCHR *key);
BOOLEAN upif_insert_leaf(DBXSTRU *dbxp,L0STRU *lp,UCHR *key,int treecase,
UCHR *p_b_key,PUNT *p_b_punt,int pos,
INFO blk,INFO off );
void upif_print_msg(POSTSTRU *ppst,UCHR *msg);
void upif_print_lfitem(int treecase,UCHR *lfitem);
void next_output_element(void);
#else
void optlnk1();
void optlnk2();
void trace_records();
void posiciona_inicio_seg();
PUNT upif_init_index();
PUNT upif_create_root();
BOOLEAN upif_find_key_leaf();
BOOLEAN upif_find_key_node();
void upif_fnd_pifp();
void upif_branqueia();
BOOLEAN upif_insert_index ();
PUNT upif_search_btree();
BOOLEAN upif_insert_leaf();
void upif_print_msg();
void upif_print_lfitem();
void next_output_element();
#endif
#if ANSI
void read_ifpcntrl(void);
void upif_delete_posting(POSTSTRU *ppst);
void upif_delete_elem(void);
void print_post(POSTSTRU *pst);
/* void verif_headers_x_current(IFPSTRU *pcurrent,BOOLEAN *update_flag); */
void update_frst_curr_headers(INFO nelem);
void update_ifpcntrl(INFO nxtb,INFO nxtp);
void next_output_blk(void );
void next_input_blk(void);
void next_input_seg(void);
void next_input_element(void );
void copia_posting(POSTSTRU *ppst,BOOLEAN *ja_inseriu);
void insere_posting( int idx_ifprec, int idx, POSTSTRU *ppst);
void gethead_counters(IFPSTRU *p,INFO off,
INFO *nxtb , INFO *nxtp,INFO *totp ,
INFO *segp, INFO *segc);
void update_header(IFPSTRU *pifp,INFO off,
INFO nxtb , INFO nxtp,INFO totp ,
INFO segp, INFO segc);
void create_new_segment(INFO segp,INFO segc);
void upif_split_segment(POSTSTRU *ppst);
void upif_find_segment(POSTSTRU *ppst);
void upif_insert_into_seg(POSTSTRU *ppst);
#if !LIND /* 11 */
void upif_process_new_key(POSTSTRU *ppst,INFO *blk,INFO *off);
void upif_process_posting(POSTSTRU *ppst,INFO blk, INFO off, UCHR operation);
#endif /* !LIND 11 */
#else
void read_ifpcntrl();
void upif_delete_posting();
void upif_delete_elem();
void print_post();
/* void verif_headers_x_current();*/
void update_frst_curr_headers();
void update_ifpcntrl();
void next_output_blk();
void next_input_blk();
void next_input_seg();
void next_input_element();
void copia_posting();
void insere_posting();
void gethead_counters();
void update_header();
void create_new_segment();
void upif_split_segment();
void upif_find_segment();
void upif_insert_into_seg();
#if !LIND /* 11 */
void upif_process_new_key();
void upif_process_posting();
#endif /* !LIND 11 */
#endif
#endif /* CICPP */
#include "ciifuh.c"
/*------------------------------------------------------------------------*/
#if CICPP
CIIFU :: CIIFU(CISISX *parm_cisisp)
{
cisisxp = parm_cisisp;
ifupd_reset=2;
ifupd_wrnmsg=0;
#if CNV_PCBINUM
hdn=-1; /* numero headers de um ifp */
#endif /*CNV_PCBINUM */
idx_curr_inp=0;
}
#endif /* CICPP */
#if TRACEUPIF
#if CICPP
void CIIFU :: upif_print_lfitem(int treecase,
UCHR *lfitem)
#else /*CICPP*/
void upif_print_lfitem(treecase , lfitem)
int treecase;
UCHR *lfitem;
#endif /*CICPP*/
{
UCHR str [LE2+1];
int keysize;
L1IDXE *lfi1;
L2IDXE *lfi2;
INFO info1,info2;
keysize = vlex[treecase];
memmove (str, lfitem, keysize );
str[keysize]='\0';
if (treecase == 0) {
lfi1 = (L1IDXE *)lfitem;
info1=lfi1->info1;
info2=lfi1->info2;
}
else {
lfi2 = (L2IDXE *)lfitem;
info1 = lfi2->info1;
info2 = lfi2->info2;
}
printf(" (%s %"_LD_" %"_LD_")",str, info1, info2);
#if LIND /* x */
if (treecase == 0) printf(" (%"_LD_")",lfi1->info3info4.info3);
else printf(" (%"_LD_")",lfi2->info3info4.info3);
#endif /* LIND x */
}
#endif
/*-----------------------------------------------------------------------*/
#if CICPP
void CIIFU :: upif_print_msg(POSTSTRU *pst,
UCHR *msg)
#else /*CICPP*/
void upif_print_msg(pst,msg)
POSTSTRU *pst;
UCHR *msg;
#endif /*CICPP*/
{
if (ifupd_wrnmsg) {
print_post(pst);
printf(" %s\n",msg);
}
}
/*------------------------------------------------------------------------*/
#if !LIND /* 3 */
#if CICPP
void CIIFU :: verif_grava_rec(DBXSTRU *dbxp,
int idx)
#else /*CICPP*/
void verif_grava_rec(dbxp,idx)
DBXSTRU *dbxp;
int idx ;
#endif /*CICPP*/
{
#if 1
IFPSTRU *tmp;
tmp=PREG(idx);
#endif
if (STATUS(idx)==MODIFIED) {
#if 0 /* Nao tirar!!!*/
printf("\n Gravando blk=%"_LD_,BLK(tmp));
#endif
#if CNV_PCBINUM
ifpwrit(dbxp,(char *)tmp,(LONGX)IFBSIZ,hdblk,hdoff,hdn);
#else /* CNV_PCBINUM */
ifpwrit(dbxp,(char *)tmp,(LONGX)IFBSIZ);
#endif /* CNV_PCBINUM */
STATUS(idx)=NOT_MODIFIED;
}
}
/*-----------------------------------------------------------------------*/
#if CICPP
void CIIFU :: update_frst_curr_headers(INFO nelem)
#else /*CICPP*/
void update_frst_curr_headers(nelem)
INFO nelem;
#endif /*CICPP*/
{ IFPHEAD *h,*fh;
#if CNV_PCBINUM
ifp_ins_new_hd(BLKX(idx_segh),off_ch_inp,hdblk,hdoff,IFLmaxhd,&hdn);
#endif /*CNV_PCBINUM */
h=HEAD( (PREG(idx_segh)),off_ch_inp);
/* 25-08-95: Conclui que: O ifptot so tem valor correto no primeiro
header do posting. Nos outros fica sempre com o mesmo valor
da capacidade do segmento. Desta forma nao se incrementa o
ifptot dos segmentos 2,3,..n .
Esta alteracao deve ser feita junto com as outras de 25-08-95
*/
/* 25-08-95
h->ifptotp+=nelem;
*/
h->ifpsegp+=nelem;
STATUS(idx_segh)=MODIFIED;
#if CNV_PCBINUM
/*hh*/ ifp_ins_new_hd(BLKX(idx_first),off_fh_inp,hdblk,hdoff,IFLmaxhd,&hdn);
#endif /*CNV_PCBINUM */
fh=HEAD( (PREG(idx_first)),(int) off_fh_inp);
/* 25-08-95
Nas linhas a seguir, o teste que era feito para saber se
deveria ou nao alterar no primeiro segmento perde o efeito.
Sempre devera ser feito. Esse teste tinha sentido para
nao incrementar 2 vezes quando estavamos trabalhando com
o primeiro segmento.
Deixei entre #if .. #endif para nao perder o historico
*/
#if 0
/* Se first coincide com current nao atualiza first */
if (fh!=h) {
fh->ifptotp+=nelem;
STATUS(idx_first)=MODIFIED;
}
#else
/* 25-08-95 */
fh->ifptotp+=nelem;
STATUS(idx_first)=MODIFIED;
#endif
}
/*------------------------------------------------------------------------*/
#if CICPP
void CIIFU :: read_ifpcntrl()
#else /*CICPP*/
void read_ifpcntrl()
#endif /*CICPP*/
{
IFPSTRU *tmp;
tmp=postread(pbuf,invp,1L,0); /* Ler registro de controle */
pn.ifpblk=1L;
pn.nxtb=tmp->ifprec[0];
pn.nxtp=tmp->ifprec[1];
}
#endif /* !LIND 3 */
/*------------------------------------------------------------------------*/
#if BEFORE20000926
#if CICPP
int CIIFU :: upif_end(int pstflag)
#else /*CICPP*/
int upif_end(pstflag)
int pstflag;
#endif /*CICPP*/
#else /* BEFORE20000926 */
#if CICPP
int CIIFU :: upif_end(char *dbnp, int pstflag)
#else /*CICPP*/
int upif_end(dbnp,pstflag)
char *dbnp;
int pstflag;
#endif /*CICPP*/
#endif /* BEFORE20000926 */
{
int rc=0;
#if !LIND /* 4.0 */
IFPHEAD *h;
IFPSTRU *t;
#endif /* !LIND 4.0 */
#if BEFORE20000927
#else /* BEFORE20000926 */
trmifupd=IFUPDXUP; /* trm IFUPDATE operation + cntwrit */
#endif /* BEFORE20000926 */
#if BEFORE20000926
#else /* BEFORE20000926 */
dbxp=dbxstorp(dbnp);
#endif /* BEFORE20000926 */
if (!DBXiinit) fatal("ciifu/upif_end/DBXiinit");
#if !LIND /* 4 */
if (pstflag == IFUPDICT) { /* .ifp was not processed */
idx_curr_inp=CURR_INP;
off_inp=2L;
t=PREG(idx_curr_inp);
BLK(t)=1L;
update_ifpcntrl(1L,IDXHEADSIZE+PSTSIZE+off_inp);
h=HEAD(t,(int)off_inp);
h->ifptotp=0;
h->ifpsegp=0;
h->ifpsegc=1;
h->ifpnxtp=0;
h->ifpnxtb=0;
STATUS(idx_curr_inp)=MODIFIED;
verif_grava_rec(dbxp,idx_curr_inp);
}
#if CNV_PCBINUM
/* Nao tem nada para converter */
ifpwrit(dbxp,(char *)&pn,(LONGX)sizeof(IFPAVAILPOS),hdblk,hdoff,(-1));
#else /* CNV_PCBINUM */
ifpwrit(dbxp,(char *)&pn,(LONGX)sizeof(IFPAVAILPOS));
#endif /* CNV_PCBINUM */
#else /* !LIND 4 */
if (pstflag == IFUPDICT) {;} /* no wrn */
#endif /* !LIND 4 */
#if BEFORE950308
cntwrit(dbxp); /* acho que nao precisa por causa de nodewrit/leafwrit */
#endif
DBXiinit=0;
#if BEFORE20000927
#else /* BEFORE20000926 */
trmifupd=0; /* reset IFUPDXUP */
#endif /* BEFORE20000926 */
#if 0
printf("\n ----------------------------------------------------------");
printf("\n =>Total de registros Processados:%"_LD_,nlidos);
printf("\n ----------------------------------------------------------");
#endif
return(rc);
}
/*------------------------------------------------------------------------*/
#if CICPP
void CIIFU :: upif_init(char *dbnp)
#else /*CICPP*/
void upif_init(dbnp)
char *dbnp;
#endif /*CICPP*/
{
#if BEFORE20000927
#else /* BEFORE20000926 */
trmifupd=IFUPDXUP; /* trm IFUPDATE operation + cntwrit */
#endif /* BEFORE20000926 */
keyp=(UCHR *)&key[0];
strcpy((char *)keyp,"!012345678");
if ((dbxp=dbxsrchp(dbnp)) == (DBXSTRU *)NULL) {
dbxp=dbxstorp(dbnp);
DBXitrac=0; DBXitell=0; DBXirang=1L;
}
#if !LIND /* 5 */
invsetup((UCHR *)dbnp,0L,0L,0L);
#else /* !LIND 5 */
invsetup((UCHR *)dbnp,0L,0L,-1L);
#endif /* !LIND 5 */
invp=DBXifmap;
DBXiinit=1;
#if !MULTI_IF
DBXirecs=0L;
DBXipadd[0]=DBXipadd[1]=0L;
DBXipdel[0]=DBXipdel[1]=0L;
#endif
#if !LIND /* 6 */
pbuf=(UCHR *)buf;
pinitpst= &initpst; /* falta inicializar com -1 */
read_ifpcntrl();
#endif /* !LIND 6 */
#if BEFORE20000927
#else /* BEFORE20000926 */
trmifupd=0; /* reset IFUPDXUP */
#endif /* BEFORE20000926 */
}
/*------------------------------------------------------------------------*/
#if !LIND /* 7 */
#if CICPP
void CIIFU :: update_ifpcntrl(INFO nxtb,
INFO nxtp)
#else /*CICPP*/
void update_ifpcntrl(nxtb,nxtp)
INFO nxtb;
INFO nxtp;
#endif /*CICPP*/
{
pn.nxtb=nxtb;
pn.nxtp=nxtp;
}
#endif /* !LIND 7 */
/*-----------------------------------------------------------------------*/
#if CICPP
void CIIFU :: print_post(POSTSTRU *pstp)
#else /*CICPP*/
void print_post(pstp)
POSTSTRU *pstp;
#endif /*CICPP*/
{
LONGX mfn;
unsigned short tag,occ,cnt;
decodepst(pstp,&mfn,&tag,&occ,&cnt);
#if AOT
printf("%s %"_LD_"/%d/%d/%d ",keyp,mfn,tag,occ,cnt);
#else
printf("\n%s %"_LD_"/%d/%d/%d ",keyp,mfn,tag,occ,cnt);
#endif
}
/*------------------------------------------------------------------------*/
#if !LIND /* 8 */
#if CICPP
void CIIFU :: next_output_blk()
#else /*CICPP*/
void next_output_blk()
#endif /*CICPP*/
{
verif_grava_rec(dbxp,idx_curr_out);
nxtb_out++;
idx_curr_out=CURR_OUT;
BLK( (PREG(idx_curr_out)) )=nxtb_out;
STATUS(idx_curr_out)=MODIFIED;
idxpst_out=0;
}
/*------------------------------------------------------------------------*/
#if CICPP
void CIIFU :: next_input_blk()
#else /*CICPP*/
void next_input_blk()
#endif /*CICPP*/
{
if (idx_curr_inp==UNDEFINED ){
idx_curr_inp=CURR_INP;
idx_first=CURR_INP;
idx_segh=CURR_INP;
STATUS(CURR_INP)=NOT_MODIFIED;
off_fh_inp=nxtp_inp;
off_ch_inp=nxtp_inp;
}else {
if ((idx_curr_inp==idx_segh) && (idx_segh!=idx_first)) {
idx_segh=SEGH;
v[idx_segh]=v[idx_curr_inp];
STATUS(idx_curr_inp)=NOT_MODIFIED;
}else {
if ((idx_curr_inp==idx_segh)&&(idx_first==idx_segh)) {
idx_segh=FIRST;
idx_first=FIRST;
v[idx_first]=v[idx_curr_inp];
STATUS(idx_curr_inp)=NOT_MODIFIED;
}
}
}
verif_grava_rec(dbxp,idx_curr_inp);
blk_inp++;
memmove(PREG(idx_curr_inp),postread(pbuf,invp,blk_inp,0),IFBSIZ);
idxpst_inp=0;
}
/*-----------------------------------------------------------------*/
#if CICPP
void CIIFU :: next_input_seg()
#else /*CICPP*/
void next_input_seg()
#endif /*CICPP*/
{
if (idx_curr_inp==UNDEFINED ){
idx_curr_inp=CURR_INP;
idx_first=CURR_INP;
idx_segh=CURR_INP;
STATUS(CURR_INP)=NOT_MODIFIED;
off_fh_inp=nxtp_inp;
off_ch_inp=nxtp_inp;
}else {
pcur_blk=PREG(idx_curr_inp);
if (BLK(pcur_blk)==nxtb_inp) {
verif_grava_rec(dbxp,idx_segh);
idx_segh=CURR_INP;
off_ch_inp=nxtp_inp;
goto get_counters;
} else {
if ((idx_curr_inp==idx_segh)&&(idx_segh==idx_first)){
idx_first=FIRST;
v[idx_first]=v[idx_curr_inp];
STATUS(idx_curr_inp)=NOT_MODIFIED;
}else {
if ((idx_curr_inp==idx_segh)&&(idx_segh != idx_first)) {
verif_grava_rec(dbxp,idx_segh);
}else {
verif_grava_rec(dbxp,idx_segh);
idx_segh=CURR_INP;
}
}
}
}
verif_grava_rec(dbxp,idx_curr_inp);
memmove(PREG(idx_curr_inp),postread(pbuf,invp,nxtb_inp,0),IFBSIZ);
/* Verifica se apos a leitura o first e segh voltaram a apontar para
o mesmo bloco e estao apontando para posicoes diferentes na memoria
*/
if ( ( BLKX(idx_first) ==BLKX( idx_segh) ) &&
(idx_first!=idx_segh)) {
if (memcmp(PREG(idx_first),PREG(idx_segh),IFBSIZ) !=0)
fatal("ciifu/first/segh");
idx_first=idx_segh;
}
off_ch_inp=nxtp_inp;
get_counters:
blk_inp=nxtb_inp;
off_inp=nxtp_inp;
gethead_counters(PREG(idx_segh),off_inp,
&nxtb_inp,&nxtp_inp,&totp_inp,&segp_inp,&segc_inp);
npst_read_in_seg=0;
idxpst_inp=off_inp+IDXHEADSIZE;
}
/*-----------------------------------------------------------------*/
#if CICPP
void CIIFU :: next_input_element()
#else /*CICPP*/
void next_input_element()
#endif /*CICPP*/
{
if (npst_read_in_seg <= segp_inp) {
if (idxpst_inp+PSTSIZE <= MAXIDXPST){
idxpst_inp+=PSTSIZE;
}else {
next_input_blk();
}
}else {
next_input_seg();
}
npst_read_in_seg+=1;
}
/*-----------------------------------------------------------------*/
#if CICPP
void CIIFU :: next_output_element()
#else /*CICPP*/
void next_output_element()
#endif /*CICPP*/
{
if (idxpst_out+PSTSIZE <= MAXIDXPST){
idxpst_out+=PSTSIZE;
}else {
next_output_blk();
}
}
/*-----------------------------------------------------------------*/
#if CICPP
void CIIFU :: copia_posting(POSTSTRU *ppst,
int *ja_inseriu)
#else /*CICPP*/
void copia_posting(ppst,ja_inseriu)
POSTSTRU *ppst;
int *ja_inseriu;
#endif /*CICPP*/
{
int x;
POSTSTRU *source,*dest;
dest = PSTADDR( (PREG(idx_curr_out)) ,(int)idxpst_out);
if (npst_read_in_seg <segp_inp) {
source = PSTADDR( (PREG(idx_curr_inp)) ,(int)idxpst_inp);
x=memcmp(source,ppst,sizeof(POSTSTRU));
}else x=1;
if (*ja_inseriu==TRUE || x<0){
memmove(dest,source,sizeof(POSTSTRU));
STATUS(idx_curr_out)=MODIFIED;
next_output_element();
next_input_element();
}else {
memmove(dest,ppst,sizeof(POSTSTRU));
STATUS(idx_curr_out)=MODIFIED;
*ja_inseriu=TRUE;
if (x==0)
upif_print_msg(ppst,(UCHR *)lnk_dup_msg);
next_output_element();
}
}
/*-----------------------------------------------------------------*/
#if CICPP
void CIIFU :: insere_posting(int idx_ifprec,
int idx,
POSTSTRU *ppst)
#else /*CICPP*/
void insere_posting(idx_ifprec,idx,ppst)
int idx_ifprec;
int idx;
POSTSTRU *ppst;
/* Insere um elemento no lugar correto e passa o valor do vetor adiante
para ser inserido na posicao seguinte
*/
#endif /*CICPP*/
{
IFPSTRU *pifp;
int x;
POSTSTRU *p,tmp;
pifp=PREG(idx_ifprec);
p=PSTADDR(pifp,idx);
x= memcmp(p,ppst,sizeof(POSTSTRU));
if (x>0) {
memmove(&tmp,p,sizeof(POSTSTRU));
memmove(p,ppst,sizeof(POSTSTRU));
memmove(ppst,&tmp,sizeof(POSTSTRU));
STATUS(idx_ifprec)=MODIFIED;
}else
if (x==0 && dupl_msg==FALSE){
upif_print_msg(ppst,(UCHR *)lnk_dup_msg);
dupl_msg=TRUE;
}
}
/*-----------------------------------------------------------------------*/
#if CICPP
void CIIFU :: gethead_counters(IFPSTRU *p,
INFO off,
INFO *nxtb,
INFO *nxtp,
INFO *totp,
INFO *segp,
INFO *segc)
#else /*CICPP*/
void gethead_counters(p,off,nxtb,nxtp,totp,segp,segc)
IFPSTRU *p;
INFO off;
INFO *nxtb , *nxtp,*totp ,*segp, *segc;
#endif /*CICPP*/
{
IFPHEAD *h;
h = HEAD(p,(int)off);
*nxtb = h->ifpnxtb;
*nxtp = h->ifpnxtp;
*totp = h->ifptotp;
*segp = h->ifpsegp;
*segc = h->ifpsegc;
}
/*-----------------------------------------------------------------------*/
#if CICPP
void CIIFU :: update_header(IFPSTRU *pifp,
INFO off,
INFO nxtb,
INFO nxtp,
INFO totp,
INFO segp,
INFO segc)
#else /*CICPP*/
void update_header(pifp,off,nxtb,nxtp,totp,segp,segc)
IFPSTRU *pifp;
INFO off;
INFO nxtb , nxtp,totp , segp, segc;
#endif /*CICPP*/
{
IFPHEAD *h;
h = HEAD(pifp,(int)off);
h->ifpnxtb=nxtb;
h->ifpnxtp=nxtp;
h->ifptotp=totp;
h->ifpsegp=segp;
h->ifpsegc=segc;
#if CNV_PCBINUM
/*hh*/ ifp_ins_new_hd(pifp->ifpblk,off,hdblk,hdoff,IFLmaxhd,&hdn);
#endif /*CNV_PCBINUM */
}
/*----------------------------------------------------------------------*/
#if CICPP
void CIIFU :: create_new_segment(INFO segp,
INFO segc)
#else /*CICPP*/
void create_new_segment(segp,segc)
INFO segp;
INFO segc;
#endif /*CICPP*/
{
IFPSTRU *x;
nxtb_out=pn.nxtb;
nxtp_out=pn.nxtp;
if (segc > MAXPSTSSEG) segc=MAXPSTSSEG;
/* Verifica se e possivel criar um header e um posting na proxima posicao
disponivel. Se nao tiver espaco, cria um novo bloco.
Se o bloco onde sera feita a insercao e o mesmo bloco que esta na me
moria, modifica o apontador. Caso contrario le o blk onde sera feita
a insercao.
*/
/* 27/10/95 - Foi feita uma alteracao para que quando estejamos inserindo
uma nova chave, seja forcada a leitura do ifp do disco e
reinicializadas as variaveis, em vez de usarmos o blk que
esta na memoria.
*/
idx_curr_out=CURR_OUT;
pcur_blk_out=PREG(idx_curr_out);
pcur_blk=PREG(idx_curr_inp);
if (BLK(pcur_blk)==nxtb_out) {
idx_curr_out=idx_curr_inp;
pcur_blk_out=PREG(idx_curr_out);
}else {
x=postread(pbuf,invp,nxtb_out,0);
memmove(pcur_blk_out,x,IFBSIZ);
STATUS(idx_curr_out)=NOT_MODIFIED;
}
if (nxtp_out+IDXHEADSIZE+PSTSIZE > MAXIDXPST) {
next_output_blk();
nxtp_out=idxpst_out;
}
/* 25-08-93 totp: nao e 'accurate' nos segmentos que sao
criados. O MicroIsis utiliza o valor do
segc
update_header(PREG(idx_curr_out),nxtp_out,
nxtb_inp,nxtp_inp,segp,segp,segc);
*/
update_header(PREG(idx_curr_out),nxtp_out,
nxtb_inp,nxtp_inp,segc,segp,segc);
idxpst_out=nxtp_out+IDXHEADSIZE;
}
/*------------------------------------------------------------------------*/
#if CICPP
void CIIFU :: posiciona_inicio_seg()
#else /*CICPP*/
void posiciona_inicio_seg()
#endif /*CICPP*/
{
if (idx_curr_inp != idx_segh) {
verif_grava_rec(dbxp,idx_curr_inp);
v[idx_curr_inp]=v[idx_segh];
/* O segh deve apontar para o novo bloco.
Se o segh e igual ao first , muda tambem o first
*/
if (idx_segh==idx_first) {
idx_first=idx_curr_inp;
}
idx_segh=idx_curr_inp;
blk_inp=BLK( (PREG(idx_curr_inp) ) );
gethead_counters(PREG(idx_segh),off_ch_inp,
&nxtb_inp,&nxtp_inp,&totp_inp,&segp_inp,&segc_inp);
npst_read_in_seg=0;
idxpst_inp=off_ch_inp+IDXHEADSIZE;
}
}
/*------------------------------------------------------------------------*/
#if CICPP
void CIIFU :: upif_split_segment(POSTSTRU *ppst)
#else /*CICPP*/
void upif_split_segment(ppst)
POSTSTRU *ppst;
#endif /*CICPP*/
{
INFO segc_out;
POSTSTRU *out;
IFPHEAD *h,*fh,*hnew;
int meio,antes,depois;
LONGX np,dep;
meio=(int)(segc_inp/2);
#if 1
antes=meio+1;
#endif
depois=(int)(segc_inp-antes)+1; /* O que vai ser inserido */
/*
Aqui deveria ser feito outro algoritmo para que nao
fiquem segmentos com poucos psotings
#if 0
if (segc_inp + 1 <= 2*accurate_totp/3){
antes=0;
depois=segc_inp +1;
}
#endif
*/
/* Se o bloco onde esta o head do segmento e igual ao segmento corrente
nao precisa ler o bloco do disco.
Basta copiar do bloco onde esta o head .
inicio do Post para fazer a quebra
O idxpst de qualquer maneira deve ser apontado para o inicio
*/
npst_read_in_seg=0;
idxpst_inp = off_ch_inp+IDXHEADSIZE;/*precisa ser setado */
np=1;
#if CNV_PCBINUM
/*hh*/ /*Marca local do header onde sera feito o split */
/*hh*/ ifp_ins_new_hd(BLKX(idx_curr_inp),off_ch_inp,hdblk,hdoff,IFLmaxhd,&hdn);
#endif /*CNV_PCBINUM */
while (np<=antes && np<=segp_inp){
insere_posting(idx_curr_inp,(int)idxpst_inp,ppst);
next_input_element();
np++;
}
create_new_segment(depois,accurate_totp);
hnew=HEAD( (PREG(idx_curr_out) ),(int)nxtp_out); /*yyy*/
segc_out=hnew->ifpsegc;
h=HEAD( (PREG(idx_segh)),(int)off_ch_inp);
h->ifpnxtb=nxtb_out;
h->ifpnxtp=nxtp_out;
h->ifptotp-=(depois-1);
h->ifpsegc=segc_inp;
h->ifpsegp=antes;
STATUS(idx_segh)=MODIFIED;
fh=HEAD( (PREG(idx_first)),(int)off_fh_inp);
/* fh->ifptotp+=1; */ /*25-08-1995*/
fh->ifptotp=accurate_totp+1; /*25-08-1995*/
STATUS(idx_first)=MODIFIED;
#if CNV_PCBINUM
/*hh*/ /*Marca local do header do primerio segmento */
/*hh*/ ifp_ins_new_hd(BLKX(idx_first),off_fh_inp,hdblk,hdoff,IFLmaxhd,&hdn);
#endif /*CNV_PCBINUM */
ja_inseriu=FALSE;
dep=0;
while (np <= depois+antes && np<=segp_inp+1) {
copia_posting(ppst,&ja_inseriu);
np++;
dep++;
}
/* Considera que ja foram lidos (processados) "depois" elementos do
segmento corrente
*/
npst_read_in_seg=depois;
/* limpa resto do vetor de saida */
while (dep < segc_out) {
out=PSTADDR( (PREG(idx_curr_out)),(int)idxpst_out);
memmove(out,pinitpst,sizeof(POSTSTRU));
STATUS(idx_curr_out)=MODIFIED;
np++;
dep++;
next_output_element();
}
verif_grava_rec(dbxp,idx_curr_out);
update_ifpcntrl(nxtb_out,idxpst_out);
}
/*------------------------------------------------------------------------*/
#if CICPP
void CIIFU :: upif_find_segment(POSTSTRU *ppst)
#else /*CICPP*/
void upif_find_segment(ppst)
POSTSTRU *ppst;
#endif /*CICPP*/
{
int pst_in_blk,
/*last_elem, *hh*/ x;
INFO last_elem;/*hh*/
BOOLEAN found;
LONGX segp_tmp;
found=FALSE;
segp_tmp=segp_inp;
for (; segp_tmp >= 0 && found==FALSE ;) {
if (nxtb_inp == 0) { found=TRUE;
}else
if (segp_tmp == 0) {
next_input_seg();
segp_tmp=segp_inp;
}else {
/*hh* last_elem=(int)idxpst_inp+((int)segp_tmp-1)*PSTSIZE; */
/*hh*/ last_elem=(INFO)idxpst_inp+((INFO)segp_tmp-1)*PSTSIZE;
if (last_elem > MAXIDXPST)last_elem=MAXIDXPST;
pst_in_blk=(last_elem-(int)idxpst_inp)/PSTSIZE+1;
last_elem=(int)idxpst_inp+(pst_in_blk-1)*PSTSIZE;
segp_tmp-= pst_in_blk;
x=memcmp((UCHR *)ppst,
PSTADDR( ( PREG(idx_curr_inp) ),last_elem),sizeof(POSTSTRU));
if ( x <= 0) {
found=TRUE;
}
else {
if (segp_tmp > 0) {
npst_read_in_seg+=pst_in_blk;
next_input_blk();