dlls/msi/string.c

   1 /*
   2  * String Table Functions
   3  *
   4  * Copyright 2002-2004, Mike McCormack for CodeWeavers
   5  * Copyright 2007 Robert Shearman for CodeWeavers
   6  * Copyright 2010 Hans Leidekker for CodeWeavers
   7  *
   8  * This library is free software; you can redistribute it and/or
   9  * modify it under the terms of the GNU Lesser General Public
  10  * License as published by the Free Software Foundation; either
  11  * version 2.1 of the License, or (at your option) any later version.
  12  *
  13  * This library is distributed in the hope that it will be useful,
  14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
  16  * Lesser General Public License for more details.
  17  *
  18  * You should have received a copy of the GNU Lesser General Public
  19  * License along with this library; if not, write to the Free Software
  20  * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
  21  */
  22
  23 #define COBJMACROS
  24
  25 #include <stdarg.h>
  26 #include <assert.h>
  27
  28 #include "windef.h"
  29 #include "winbase.h"
  30 #include "winerror.h"
  31 #include "wine/debug.h"
  32 #include "wine/unicode.h"
  33 #include "msi.h"
  34 #include "msiquery.h"
  35 #include "objbase.h"
  36 #include "objidl.h"
  37 #include "msipriv.h"
  38 #include "winnls.h"
  39
  40 #include "query.h"
  41
  42 WINE_DEFAULT_DEBUG_CHANNEL(msidb);
  43
  44 struct msistring
  45 {
  46     USHORT persistent_refcount;
  47     USHORT nonpersistent_refcount;
  48     LPWSTR str;
  49 };
  50
  51 struct string_table
  52 {
  53     UINT maxcount;         /* the number of strings */
  54     UINT freeslot;
  55     UINT codepage;
  56     UINT sortcount;
  57     struct msistring *strings; /* an array of strings */
  58     UINT *sorted;              /* index */
  59 };
  60
  61 static BOOL validate_codepage( UINT codepage )
  62 {
  63     if (codepage != CP_ACP && !IsValidCodePage( codepage ))
  64     {
  65         WARN("invalid codepage %u\n", codepage);
  66         return FALSE;
  67     }
  68     return TRUE;
  69 }
  70
  71 static string_table *init_stringtable( int entries, UINT codepage )
  72 {
  73     string_table *st;
  74
  75     if (!validate_codepage( codepage ))
  76         return NULL;
  77
  78     st = msi_alloc( sizeof (string_table) );
  79     if( !st )
  80         return NULL;
  81     if( entries < 1 )
  82         entries = 1;
  83
  84     st->strings = msi_alloc_zero( sizeof(struct msistring) * entries );
  85     if( !st->strings )
  86     {
  87         msi_free( st );
  88         return NULL;
  89     }
  90
  91     st->sorted = msi_alloc( sizeof (UINT) * entries );
  92     if( !st->sorted )
  93     {
  94         msi_free( st->strings );
  95         msi_free( st );
  96         return NULL;
  97     }
  98
  99     st->maxcount = entries;
 100     st->freeslot = 1;
 101     st->codepage = codepage;
 102     st->sortcount = 0;
 103
 104     return st;
 105 }
 106
 107 VOID msi_destroy_stringtable( string_table *st )
 108 {
 109     UINT i;
 110
 111     for( i=0; i<st->maxcount; i++ )
 112     {
 113         if( st->strings[i].persistent_refcount ||
 114             st->strings[i].nonpersistent_refcount )
 115             msi_free( st->strings[i].str );
 116     }
 117     msi_free( st->strings );
 118     msi_free( st->sorted );
 119     msi_free( st );
 120 }
 121
 122 static int st_find_free_entry( string_table *st )
 123 {
 124     UINT i, sz, *s;
 125     struct msistring *p;
 126
 127     TRACE("%p\n", st);
 128
 129     if( st->freeslot )
 130     {
 131         for( i = st->freeslot; i < st->maxcount; i++ )
 132             if( !st->strings[i].persistent_refcount &&
 133                 !st->strings[i].nonpersistent_refcount )
 134                 return i;
 135     }
 136     for( i = 1; i < st->maxcount; i++ )
 137         if( !st->strings[i].persistent_refcount &&
 138             !st->strings[i].nonpersistent_refcount )
 139             return i;
 140
 141     /* dynamically resize */
 142     sz = st->maxcount + 1 + st->maxcount/2;
 143     p = msi_realloc_zero( st->strings, sz * sizeof(struct msistring) );
 144     if( !p )
 145         return -1;
 146
 147     s = msi_realloc( st->sorted, sz*sizeof(UINT) );
 148     if( !s )
 149     {
 150         msi_free( p );
 151         return -1;
 152     }
 153
 154     st->strings = p;
 155     st->sorted = s;
 156
 157     st->freeslot = st->maxcount;
 158     st->maxcount = sz;
 159     if( st->strings[st->freeslot].persistent_refcount ||
 160         st->strings[st->freeslot].nonpersistent_refcount )
 161         ERR("oops. expected freeslot to be free...\n");
 162     return st->freeslot;
 163 }
 164
 165 static int find_insert_index( const string_table *st, UINT string_id )
 166 {
 167     int i, c, low = 0, high = st->sortcount - 1;
 168
 169     while (low <= high)
 170     {
 171         i = (low + high) / 2;
 172         c = strcmpW( st->strings[string_id].str, st->strings[st->sorted[i]].str );
 173
 174         if (c < 0)
 175             high = i - 1;
 176         else if (c > 0)
 177             low = i + 1;
 178         else
 179             return -1; /* already exists */
 180     }
 181     return high + 1;
 182 }
 183
 184 static void insert_string_sorted( string_table *st, UINT string_id )
 185 {
 186     int i;
 187
 188     i = find_insert_index( st, string_id );
 189     if (i == -1)
 190         return;
 191
 192     memmove( &st->sorted[i] + 1, &st->sorted[i], (st->sortcount - i) * sizeof(UINT) );
 193     st->sorted[i] = string_id;
 194     st->sortcount++;
 195 }
 196
 197 static void set_st_entry( string_table *st, UINT n, LPWSTR str, USHORT refcount, enum StringPersistence persistence )
 198 {
 199     if (persistence == StringPersistent)
 200     {
 201         st->strings[n].persistent_refcount = refcount;
 202         st->strings[n].nonpersistent_refcount = 0;
 203     }
 204     else
 205     {
 206         st->strings[n].persistent_refcount = 0;
 207         st->strings[n].nonpersistent_refcount = refcount;
 208     }
 209
 210     st->strings[n].str = str;
 211
 212     insert_string_sorted( st, n );
 213
 214     if( n < st->maxcount )
 215         st->freeslot = n + 1;
 216 }
 217
 218 static UINT msi_string2idA( const string_table *st, LPCSTR buffer, UINT *id )
 219 {
 220     DWORD sz;
 221     UINT r = ERROR_INVALID_PARAMETER;
 222     LPWSTR str;
 223
 224     TRACE("Finding string %s in string table\n", debugstr_a(buffer) );
 225
 226     if( buffer[0] == 0 )
 227     {
 228         *id = 0;
 229         return ERROR_SUCCESS;
 230     }
 231
 232     sz = MultiByteToWideChar( st->codepage, 0, buffer, -1, NULL, 0 );
 233     if( sz <= 0 )
 234         return r;
 235     str = msi_alloc( sz*sizeof(WCHAR) );
 236     if( !str )
 237         return ERROR_NOT_ENOUGH_MEMORY;
 238     MultiByteToWideChar( st->codepage, 0, buffer, -1, str, sz );
 239
 240     r = msi_string2idW( st, str, id );
 241     msi_free( str );
 242
 243     return r;
 244 }
 245
 246 static int msi_addstring( string_table *st, UINT n, const CHAR *data, int len, USHORT refcount, enum StringPersistence persistence )
 247 {
 248     LPWSTR str;
 249     int sz;
 250
 251     if( !data )
 252         return 0;
 253     if( !data[0] )
 254         return 0;
 255     if( n > 0 )
 256     {
 257         if( st->strings[n].persistent_refcount ||
 258             st->strings[n].nonpersistent_refcount )
 259             return -1;
 260     }
 261     else
 262     {
 263         if( ERROR_SUCCESS == msi_string2idA( st, data, &n ) )
 264         {
 265             if (persistence == StringPersistent)
 266                 st->strings[n].persistent_refcount += refcount;
 267             else
 268                 st->strings[n].nonpersistent_refcount += refcount;
 269             return n;
 270         }
 271         n = st_find_free_entry( st );
 272         if( n == -1 )
 273             return -1;
 274     }
 275
 276     if( n < 1 )
 277     {
 278         ERR("invalid index adding %s (%d)\n", debugstr_a( data ), n );
 279         return -1;
 280     }
 281
 282     /* allocate a new string */
 283     if( len < 0 )
 284         len = strlen(data);
 285     sz = MultiByteToWideChar( st->codepage, 0, data, len, NULL, 0 );
 286     str = msi_alloc( (sz+1)*sizeof(WCHAR) );
 287     if( !str )
 288         return -1;
 289     MultiByteToWideChar( st->codepage, 0, data, len, str, sz );
 290     str[sz] = 0;
 291
 292     set_st_entry( st, n, str, refcount, persistence );
 293
 294     return n;
 295 }
 296
 297 int msi_addstringW( string_table *st, const WCHAR *data, int len, USHORT refcount, enum StringPersistence persistence )
 298 {
 299     UINT n;
 300     LPWSTR str;
 301
 302     if( !data )
 303         return 0;
 304     if( !data[0] )
 305         return 0;
 306
 307     if( msi_string2idW( st, data, &n ) == ERROR_SUCCESS )
 308     {
 309         if (persistence == StringPersistent)
 310             st->strings[n].persistent_refcount += refcount;
 311         else
 312             st->strings[n].nonpersistent_refcount += refcount;
 313         return n;
 314     }
 315
 316     n = st_find_free_entry( st );
 317     if( n == -1 )
 318         return -1;
 319
 320     /* allocate a new string */
 321     if(len<0)
 322         len = strlenW(data);
 323     TRACE("%s, n = %d len = %d\n", debugstr_w(data), n, len );
 324
 325     str = msi_alloc( (len+1)*sizeof(WCHAR) );
 326     if( !str )
 327         return -1;
 328     memcpy( str, data, len*sizeof(WCHAR) );
 329     str[len] = 0;
 330
 331     set_st_entry( st, n, str, refcount, persistence );
 332
 333     return n;
 334 }
 335
 336 /* find the string identified by an id - return null if there's none */
 337 const WCHAR *msi_string_lookup_id( const string_table *st, UINT id )
 338 {
 339     if( id == 0 )
 340         return szEmpty;
 341
 342     if( id >= st->maxcount )
 343         return NULL;
 344
 345     if( id && !st->strings[id].persistent_refcount && !st->strings[id].nonpersistent_refcount)
 346         return NULL;
 347
 348     return st->strings[id].str;
 349 }
 350
 351 /*
 352  *  msi_id2stringA
 353  *
 354  *  [in] st         - pointer to the string table
 355  *  [in] id         - id of the string to retrieve
 356  *  [out] buffer    - destination of the UTF8 string
 357  *  [in/out] sz     - number of bytes available in the buffer on input
 358  *                    number of bytes used on output
 359  *
 360  *  Returned string is not nul terminated.
 361  */
 362 static UINT msi_id2stringA( const string_table *st, UINT id, LPSTR buffer, UINT *sz )
 363 {
 364     UINT len, lenW;
 365     const WCHAR *str;
 366
 367     TRACE("Finding string %d of %d\n", id, st->maxcount);
 368
 369     str = msi_string_lookup_id( st, id );
 370     if( !str )
 371         return ERROR_FUNCTION_FAILED;
 372
 373     lenW = strlenW( str );
 374     len = WideCharToMultiByte( st->codepage, 0, str, lenW, NULL, 0, NULL, NULL );
 375     if( *sz < len )
 376     {
 377         *sz = len;
 378         return ERROR_MORE_DATA;
 379     }
 380     *sz = WideCharToMultiByte( st->codepage, 0, str, lenW, buffer, *sz, NULL, NULL );
 381     return ERROR_SUCCESS;
 382 }
 383
 384 /*
 385  *  msi_string2idW
 386  *
 387  *  [in] st         - pointer to the string table
 388  *  [in] str        - string to find in the string table
 389  *  [out] id        - id of the string, if found
 390  */
 391 UINT msi_string2idW( const string_table *st, LPCWSTR str, UINT *id )
 392 {
 393     int i, c, low = 0, high = st->sortcount - 1;
 394
 395     while (low <= high)
 396     {
 397         i = (low + high) / 2;
 398         c = strcmpW( str, st->strings[st->sorted[i]].str );
 399
 400         if (c < 0)
 401             high = i - 1;
 402         else if (c > 0)
 403             low = i + 1;
 404         else
 405         {
 406             *id = st->sorted[i];
 407             return ERROR_SUCCESS;
 408         }
 409     }
 410
 411     return ERROR_INVALID_PARAMETER;
 412 }
 413
 414 static void string_totalsize( const string_table *st, UINT *datasize, UINT *poolsize )
 415 {
 416     UINT i, len, holesize;
 417
 418     if( st->strings[0].str || st->strings[0].persistent_refcount || st->strings[0].nonpersistent_refcount)
 419         ERR("oops. element 0 has a string\n");
 420
 421     *poolsize = 4;
 422     *datasize = 0;
 423     holesize = 0;
 424     for( i=1; i<st->maxcount; i++ )
 425     {
 426         if( !st->strings[i].persistent_refcount )
 427         {
 428             TRACE("[%u] nonpersistent = %s\n", i, debugstr_w(st->strings[i].str));
 429             (*poolsize) += 4;
 430         }
 431         else if( st->strings[i].str )
 432         {
 433             TRACE("[%u] = %s\n", i, debugstr_w(st->strings[i].str));
 434             len = WideCharToMultiByte( st->codepage, 0,
 435                      st->strings[i].str, -1, NULL, 0, NULL, NULL);
 436             if( len )
 437                 len--;
 438             (*datasize) += len;
 439             if (len>0xffff)
 440                 (*poolsize) += 4;
 441             (*poolsize) += holesize + 4;
 442             holesize = 0;
 443         }
 444         else
 445             holesize += 4;
 446     }
 447     TRACE("data %u pool %u codepage %x\n", *datasize, *poolsize, st->codepage );
 448 }
 449
 450 HRESULT msi_init_string_table( IStorage *stg )
 451 {
 452     USHORT zero[2] = { 0, 0 };
 453     UINT ret;
 454
 455     /* create the StringPool stream... add the zero string to it*/
 456     ret = write_stream_data(stg, szStringPool, zero, sizeof zero, TRUE);
 457     if (ret != ERROR_SUCCESS)
 458         return E_FAIL;
 459
 460     /* create the StringData stream... make it zero length */
 461     ret = write_stream_data(stg, szStringData, NULL, 0, TRUE);
 462     if (ret != ERROR_SUCCESS)
 463         return E_FAIL;
 464
 465     return S_OK;
 466 }
 467
 468 string_table *msi_load_string_table( IStorage *stg, UINT *bytes_per_strref )
 469 {
 470     string_table *st = NULL;
 471     CHAR *data = NULL;
 472     USHORT *pool = NULL;
 473     UINT r, datasize = 0, poolsize = 0, codepage;
 474     DWORD i, count, offset, len, n, refs;
 475
 476     r = read_stream_data( stg, szStringPool, TRUE, (BYTE **)&pool, &poolsize );
 477     if( r != ERROR_SUCCESS)
 478         goto end;
 479     r = read_stream_data( stg, szStringData, TRUE, (BYTE **)&data, &datasize );
 480     if( r != ERROR_SUCCESS)
 481         goto end;
 482
 483     if ( (poolsize > 4) && (pool[1] & 0x8000) )
 484         *bytes_per_strref = LONG_STR_BYTES;
 485     else
 486         *bytes_per_strref = sizeof(USHORT);
 487
 488     count = poolsize/4;
 489     if( poolsize > 4 )
 490         codepage = pool[0] | ( (pool[1] & ~0x8000) << 16 );
 491     else
 492         codepage = CP_ACP;
 493     st = init_stringtable( count, codepage );
 494     if (!st)
 495         goto end;
 496
 497     offset = 0;
 498     n = 1;
 499     i = 1;
 500     while( i<count )
 501     {
 502         /* the string reference count is always the second word */
 503         refs = pool[i*2+1];
 504
 505         /* empty entries have two zeros, still have a string id */
 506         if (pool[i*2] == 0 && refs == 0)
 507         {
 508             i++;
 509             n++;
 510             continue;
 511         }
 512
 513         /*
 514          * If a string is over 64k, the previous string entry is made null
 515          * and its the high word of the length is inserted in the null string's
 516          * reference count field.
 517          */
 518         if( pool[i*2] == 0)
 519         {
 520             len = (pool[i*2+3] << 16) + pool[i*2+2];
 521             i += 2;
 522         }
 523         else
 524         {
 525             len = pool[i*2];
 526             i += 1;
 527         }
 528
 529         if ( (offset + len) > datasize )
 530         {
 531             ERR("string table corrupt?\n");
 532             break;
 533         }
 534
 535         r = msi_addstring( st, n, data+offset, len, refs, StringPersistent );
 536         if( r != n )
 537             ERR("Failed to add string %d\n", n );
 538         n++;
 539         offset += len;
 540     }
 541
 542     if ( datasize != offset )
 543         ERR("string table load failed! (%08x != %08x), please report\n", datasize, offset );
 544
 545     TRACE("Loaded %d strings\n", count);
 546
 547 end:
 548     msi_free( pool );
 549     msi_free( data );
 550
 551     return st;
 552 }
 553
 554 UINT msi_save_string_table( const string_table *st, IStorage *storage, UINT *bytes_per_strref )
 555 {
 556     UINT i, datasize = 0, poolsize = 0, sz, used, r, codepage, n;
 557     UINT ret = ERROR_FUNCTION_FAILED;
 558     CHAR *data = NULL;
 559     USHORT *pool = NULL;
 560
 561     TRACE("\n");
 562
 563     /* construct the new table in memory first */
 564     string_totalsize( st, &datasize, &poolsize );
 565
 566     TRACE("%u %u %u\n", st->maxcount, datasize, poolsize );
 567
 568     pool = msi_alloc( poolsize );
 569     if( ! pool )
 570     {
 571         WARN("Failed to alloc pool %d bytes\n", poolsize );
 572         goto err;
 573     }
 574     data = msi_alloc( datasize );
 575     if( ! data )
 576     {
 577         WARN("Failed to alloc data %d bytes\n", datasize );
 578         goto err;
 579     }
 580
 581     used = 0;
 582     codepage = st->codepage;
 583     pool[0] = codepage & 0xffff;
 584     pool[1] = codepage >> 16;
 585     if (st->maxcount > 0xffff)
 586     {
 587         pool[1] |= 0x8000;
 588         *bytes_per_strref = LONG_STR_BYTES;
 589     }
 590     else
 591         *bytes_per_strref = sizeof(USHORT);
 592
 593     n = 1;
 594     for( i=1; i<st->maxcount; i++ )
 595     {
 596         if( !st->strings[i].persistent_refcount )
 597         {
 598             pool[ n*2 ] = 0;
 599             pool[ n*2 + 1] = 0;
 600             n++;
 601             continue;
 602         }
 603
 604         sz = datasize - used;
 605         r = msi_id2stringA( st, i, data+used, &sz );
 606         if( r != ERROR_SUCCESS )
 607         {
 608             ERR("failed to fetch string\n");
 609             sz = 0;
 610         }
 611
 612         if (sz)
 613             pool[ n*2 + 1 ] = st->strings[i].persistent_refcount;
 614         else
 615             pool[ n*2 + 1 ] = 0;
 616         if (sz < 0x10000)
 617         {
 618             pool[ n*2 ] = sz;
 619             n++;
 620         }
 621         else
 622         {
 623             pool[ n*2 ] = 0;
 624             pool[ n*2 + 2 ] = sz&0xffff;
 625             pool[ n*2 + 3 ] = (sz>>16);
 626             n += 2;
 627         }
 628         used += sz;
 629         if( used > datasize  )
 630         {
 631             ERR("oops overran %d >= %d\n", used, datasize);
 632             goto err;
 633         }
 634     }
 635
 636     if( used != datasize )
 637     {
 638         ERR("oops used %d != datasize %d\n", used, datasize);
 639         goto err;
 640     }
 641
 642     /* write the streams */
 643     r = write_stream_data( storage, szStringData, data, datasize, TRUE );
 644     TRACE("Wrote StringData r=%08x\n", r);
 645     if( r )
 646         goto err;
 647     r = write_stream_data( storage, szStringPool, pool, poolsize, TRUE );
 648     TRACE("Wrote StringPool r=%08x\n", r);
 649     if( r )
 650         goto err;
 651
 652     ret = ERROR_SUCCESS;
 653
 654 err:
 655     msi_free( data );
 656     msi_free( pool );
 657
 658     return ret;
 659 }
 660
 661 UINT msi_get_string_table_codepage( const string_table *st )
 662 {
 663     return st->codepage;
 664 }
 665
 666 UINT msi_set_string_table_codepage( string_table *st, UINT codepage )
 667 {
 668     if (validate_codepage( codepage ))
 669     {
 670         st->codepage = codepage;
 671         return ERROR_SUCCESS;
 672     }
 673     return ERROR_FUNCTION_FAILED;
 674 }