sqlite.patch 4.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138
  1. Index: Makefile.in
  2. --- Makefile.in.orig 2007-06-28 14:46:18 +0200
  3. +++ Makefile.in 2007-08-14 21:01:55 +0200
  4. @@ -130,6 +130,18 @@
  5. vdbe.lo vdbeapi.lo vdbeaux.lo vdbeblob.lo vdbefifo.lo vdbemem.lo \
  6. where.lo utf.lo legacy.lo vtab.lo
  7. +# FTS1 support
  8. +ifdef FTS1
  9. +TCC += -DSQLITE_ENABLE_FTS1
  10. +LIBOBJ += fts1.lo fts1_hash.lo fts1_porter.lo fts1_tokenizer1.lo
  11. +endif
  12. +
  13. +# FTS2 support
  14. +ifdef FTS2
  15. +TCC += -DSQLITE_ENABLE_FTS2
  16. +LIBOBJ += fts2.lo fts2_hash.lo fts2_porter.lo fts2_tokenizer1.lo
  17. +endif
  18. +
  19. # All of the source code files.
  20. #
  21. SRC = \
  22. @@ -492,6 +504,25 @@
  23. $(LTLINK) -o tclsqlite3 tclsqlite-shell.lo \
  24. libsqlite3.la $(LIBTCL)
  25. +fts1.lo: $(TOP)/ext/fts1/fts1.c $(HDR)
  26. + $(LTCOMPILE) -c $(TOP)/ext/fts1/fts1.c
  27. +fts1_hash.lo: $(TOP)/ext/fts1/fts1_hash.c $(HDR)
  28. + $(LTCOMPILE) -c $(TOP)/ext/fts1/fts1_hash.c
  29. +fts1_porter.lo: $(TOP)/ext/fts1/fts1_porter.c $(HDR)
  30. + $(LTCOMPILE) -c $(TOP)/ext/fts1/fts1_porter.c
  31. +fts1_tokenizer1.lo: $(TOP)/ext/fts1/fts1_tokenizer1.c $(HDR)
  32. + $(LTCOMPILE) -c $(TOP)/ext/fts1/fts1_tokenizer1.c
  33. +
  34. +fts2.lo: $(TOP)/ext/fts2/fts2.c $(HDR)
  35. + $(LTCOMPILE) -c $(TOP)/ext/fts2/fts2.c
  36. +fts2_hash.lo: $(TOP)/ext/fts2/fts2_hash.c $(HDR)
  37. + $(LTCOMPILE) -c $(TOP)/ext/fts2/fts2_hash.c
  38. +fts2_porter.lo: $(TOP)/ext/fts2/fts2_porter.c $(HDR)
  39. + $(LTCOMPILE) -c $(TOP)/ext/fts2/fts2_porter.c
  40. +fts2_tokenizer1.lo: $(TOP)/ext/fts2/fts2_tokenizer1.c $(HDR)
  41. + $(LTCOMPILE) -c $(TOP)/ext/fts2/fts2_tokenizer1.c
  42. +
  43. +
  44. testfixture$(TEXE): $(TOP)/src/tclsqlite.c libsqlite3.la $(TESTSRC)
  45. $(LTLINK) -DTCLSH=1 -DSQLITE_TEST=1 -DSQLITE_CRASH_TEST=1 \
  46. -DSQLITE_NO_SYNC=1 $(TEMP_STORE) \
  47. Index: sqlite3.pc.in
  48. --- sqlite3.pc.in.orig 2004-07-19 06:25:47 +0200
  49. +++ sqlite3.pc.in 2007-08-14 21:04:47 +0200
  50. @@ -8,5 +8,5 @@
  51. Name: SQLite
  52. Description: SQL database engine
  53. Version: @VERSION@
  54. -Libs: -L${libdir} -lsqlite3
  55. +Libs: -L${libdir} -lsqlite3 @LIBS@
  56. Cflags: -I${includedir}
  57. Index: tool/lemon.c
  58. --- tool/lemon.c 30 Jul 2007 18:31:53 -0000 1.48
  59. +++ tool/lemon.c 23 Aug 2007 02:50:56 -0000 1.49
  60. @@ -108,7 +108,7 @@
  61. ** Principal data structures for the LEMON parser generator.
  62. */
  63. -typedef enum {B_FALSE=0, B_TRUE} Boolean;
  64. +typedef enum {LEMON_FALSE=0, LEMON_TRUE} Boolean;
  65. /* Symbols (terminals and nonterminals) of the grammar are stored
  66. ** in the following: */
  67. @@ -610,7 +610,7 @@
  68. int progress;
  69. for(i=0; i<lemp->nsymbol; i++){
  70. - lemp->symbols[i]->lambda = B_FALSE;
  71. + lemp->symbols[i]->lambda = LEMON_FALSE;
  72. }
  73. for(i=lemp->nterminal; i<lemp->nsymbol; i++){
  74. lemp->symbols[i]->firstset = SetNew();
  75. @@ -623,10 +623,10 @@
  76. if( rp->lhs->lambda ) continue;
  77. for(i=0; i<rp->nrhs; i++){
  78. struct symbol *sp = rp->rhs[i];
  79. - if( sp->type!=TERMINAL || sp->lambda==B_FALSE ) break;
  80. + if( sp->type!=TERMINAL || sp->lambda==LEMON_FALSE ) break;
  81. }
  82. if( i==rp->nrhs ){
  83. - rp->lhs->lambda = B_TRUE;
  84. + rp->lhs->lambda = LEMON_TRUE;
  85. progress = 1;
  86. }
  87. }
  88. @@ -649,10 +649,10 @@
  89. }
  90. break;
  91. }else if( s1==s2 ){
  92. - if( s1->lambda==B_FALSE ) break;
  93. + if( s1->lambda==LEMON_FALSE ) break;
  94. }else{
  95. progress += SetUnion(s1->firstset,s2->firstset);
  96. - if( s2->lambda==B_FALSE ) break;
  97. + if( s2->lambda==LEMON_FALSE ) break;
  98. }
  99. }
  100. }
  101. @@ -972,11 +972,11 @@
  102. }
  103. /* Report an error for each rule that can never be reduced. */
  104. - for(rp=lemp->rule; rp; rp=rp->next) rp->canReduce = B_FALSE;
  105. + for(rp=lemp->rule; rp; rp=rp->next) rp->canReduce = LEMON_FALSE;
  106. for(i=0; i<lemp->nstate; i++){
  107. struct action *ap;
  108. for(ap=lemp->sorted[i]->ap; ap; ap=ap->next){
  109. - if( ap->type==REDUCE ) ap->x.rp->canReduce = B_TRUE;
  110. + if( ap->type==REDUCE ) ap->x.rp->canReduce = LEMON_TRUE;
  111. }
  112. }
  113. for(rp=lemp->rule; rp; rp=rp->next){
  114. @@ -1210,7 +1210,7 @@
  115. break;
  116. }else{
  117. SetUnion(newcfp->fws,xsp->firstset);
  118. - if( xsp->lambda==B_FALSE ) break;
  119. + if( xsp->lambda==LEMON_FALSE ) break;
  120. }
  121. }
  122. if( i==rp->nrhs ) Plink_add(&cfp->fplp,newcfp);
  123. @@ -4271,7 +4271,7 @@
  124. sp->prec = -1;
  125. sp->assoc = UNK;
  126. sp->firstset = 0;
  127. - sp->lambda = B_FALSE;
  128. + sp->lambda = LEMON_FALSE;
  129. sp->destructor = 0;
  130. sp->datatype = 0;
  131. Symbol_insert(sp,sp->name);