- Merge from trunk
[reactos.git] / dll / win32 / msi / cond.y
1 %{
2
3 /*
4 * Implementation of the Microsoft Installer (msi.dll)
5 *
6 * Copyright 2003 Mike McCormack 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 "config.h"
26
27 #include <stdarg.h>
28 #include <stdio.h>
29 #include <stdlib.h>
30
31 #include "windef.h"
32 #include "winbase.h"
33 #include "winuser.h"
34 #include "msi.h"
35 #include "msiquery.h"
36 #include "objbase.h"
37 #include "oleauto.h"
38
39 #include "msipriv.h"
40 #include "msiserver.h"
41 #include "wine/debug.h"
42 #include "wine/unicode.h"
43 #include "wine/list.h"
44
45 #define YYLEX_PARAM info
46 #define YYPARSE_PARAM info
47
48 static int cond_error(const char *str);
49
50 WINE_DEFAULT_DEBUG_CHANNEL(msi);
51
52 typedef struct tag_yyinput
53 {
54 MSIPACKAGE *package;
55 LPCWSTR str;
56 INT n;
57 MSICONDITION result;
58 struct list mem;
59 } COND_input;
60
61 struct cond_str {
62 LPCWSTR data;
63 INT len;
64 };
65
66 static LPWSTR COND_GetString( COND_input *info, const struct cond_str *str );
67 static LPWSTR COND_GetLiteral( COND_input *info, const struct cond_str *str );
68 static int cond_lex( void *COND_lval, COND_input *info);
69
70 static void *cond_alloc( COND_input *cond, unsigned int sz );
71 static void *cond_track_mem( COND_input *cond, void *ptr, unsigned int sz );
72 static void cond_free( void *ptr );
73
74 static INT compare_int( INT a, INT operator, INT b );
75 static INT compare_string( LPCWSTR a, INT operator, LPCWSTR b, BOOL convert );
76
77 static INT compare_and_free_strings( LPWSTR a, INT op, LPWSTR b, BOOL convert )
78 {
79 INT r;
80
81 r = compare_string( a, op, b, convert );
82 cond_free( a );
83 cond_free( b );
84 return r;
85 }
86
87 static BOOL num_from_prop( LPCWSTR p, INT *val )
88 {
89 INT ret = 0, sign = 1;
90
91 if (!p)
92 return FALSE;
93 if (*p == '-')
94 {
95 sign = -1;
96 p++;
97 }
98 if (!*p)
99 return FALSE;
100 while (*p)
101 {
102 if( *p < '0' || *p > '9' )
103 return FALSE;
104 ret = ret*10 + (*p - '0');
105 p++;
106 }
107 *val = ret*sign;
108 return TRUE;
109 }
110
111 %}
112
113 %pure-parser
114
115 %union
116 {
117 struct cond_str str;
118 LPWSTR string;
119 INT value;
120 }
121
122 %token COND_SPACE COND_EOF
123 %token COND_OR COND_AND COND_NOT COND_XOR COND_IMP COND_EQV
124 %token COND_LT COND_GT COND_EQ COND_NE COND_GE COND_LE
125 %token COND_ILT COND_IGT COND_IEQ COND_INE COND_IGE COND_ILE
126 %token COND_LPAR COND_RPAR COND_TILDA COND_SS COND_ISS
127 %token COND_ILHS COND_IRHS COND_LHS COND_RHS
128 %token COND_PERCENT COND_DOLLARS COND_QUESTION COND_AMPER COND_EXCLAM
129 %token <str> COND_IDENT <str> COND_NUMBER <str> COND_LITER
130
131 %nonassoc COND_ERROR COND_EOF
132
133 %type <value> expression boolean_term boolean_factor
134 %type <value> value_i integer operator
135 %type <string> identifier symbol_s value_s literal
136
137 %%
138
139 condition:
140 expression
141 {
142 COND_input* cond = (COND_input*) info;
143 cond->result = $1;
144 }
145 | /* empty */
146 {
147 COND_input* cond = (COND_input*) info;
148 cond->result = MSICONDITION_NONE;
149 }
150 ;
151
152 expression:
153 boolean_term
154 {
155 $$ = $1;
156 }
157 | expression COND_OR boolean_term
158 {
159 $$ = $1 || $3;
160 }
161 | expression COND_IMP boolean_term
162 {
163 $$ = !$1 || $3;
164 }
165 | expression COND_XOR boolean_term
166 {
167 $$ = ( $1 || $3 ) && !( $1 && $3 );
168 }
169 | expression COND_EQV boolean_term
170 {
171 $$ = ( $1 && $3 ) || ( !$1 && !$3 );
172 }
173 ;
174
175 boolean_term:
176 boolean_factor
177 {
178 $$ = $1;
179 }
180 | boolean_term COND_AND boolean_factor
181 {
182 $$ = $1 && $3;
183 }
184 ;
185
186 boolean_factor:
187 COND_NOT boolean_factor
188 {
189 $$ = $2 ? 0 : 1;
190 }
191 | value_i
192 {
193 $$ = $1 ? 1 : 0;
194 }
195 | value_s
196 {
197 $$ = ($1 && $1[0]) ? 1 : 0;
198 cond_free( $1 );
199 }
200 | value_i operator value_i
201 {
202 $$ = compare_int( $1, $2, $3 );
203 }
204 | symbol_s operator value_i
205 {
206 int num;
207 if (num_from_prop( $1, &num ))
208 $$ = compare_int( num, $2, $3 );
209 else
210 $$ = ($2 == COND_NE || $2 == COND_INE );
211 cond_free( $1 );
212 }
213 | value_i operator symbol_s
214 {
215 int num;
216 if (num_from_prop( $3, &num ))
217 $$ = compare_int( $1, $2, num );
218 else
219 $$ = ($2 == COND_NE || $2 == COND_INE );
220 cond_free( $3 );
221 }
222 | symbol_s operator symbol_s
223 {
224 $$ = compare_and_free_strings( $1, $2, $3, TRUE );
225 }
226 | symbol_s operator literal
227 {
228 $$ = compare_and_free_strings( $1, $2, $3, TRUE );
229 }
230 | literal operator symbol_s
231 {
232 $$ = compare_and_free_strings( $1, $2, $3, TRUE );
233 }
234 | literal operator literal
235 {
236 $$ = compare_and_free_strings( $1, $2, $3, FALSE );
237 }
238 | literal operator value_i
239 {
240 $$ = 0;
241 cond_free( $1 );
242 }
243 | value_i operator literal
244 {
245 $$ = 0;
246 cond_free( $3 );
247 }
248 | COND_LPAR expression COND_RPAR
249 {
250 $$ = $2;
251 }
252 ;
253
254 operator:
255 /* common functions */
256 COND_EQ { $$ = COND_EQ; }
257 | COND_NE { $$ = COND_NE; }
258 | COND_LT { $$ = COND_LT; }
259 | COND_GT { $$ = COND_GT; }
260 | COND_LE { $$ = COND_LE; }
261 | COND_GE { $$ = COND_GE; }
262 | COND_SS { $$ = COND_SS; }
263 | COND_IEQ { $$ = COND_IEQ; }
264 | COND_INE { $$ = COND_INE; }
265 | COND_ILT { $$ = COND_ILT; }
266 | COND_IGT { $$ = COND_IGT; }
267 | COND_ILE { $$ = COND_ILE; }
268 | COND_IGE { $$ = COND_IGE; }
269 | COND_ISS { $$ = COND_ISS; }
270 | COND_LHS { $$ = COND_LHS; }
271 | COND_RHS { $$ = COND_RHS; }
272 | COND_ILHS { $$ = COND_ILHS; }
273 | COND_IRHS { $$ = COND_IRHS; }
274 ;
275
276 value_s:
277 symbol_s
278 {
279 $$ = $1;
280 }
281 | literal
282 {
283 $$ = $1;
284 }
285 ;
286
287 literal:
288 COND_LITER
289 {
290 COND_input* cond = (COND_input*) info;
291 $$ = COND_GetLiteral( cond, &$1 );
292 if( !$$ )
293 YYABORT;
294 }
295 ;
296
297 value_i:
298 integer
299 {
300 $$ = $1;
301 }
302 | COND_DOLLARS identifier
303 {
304 COND_input* cond = (COND_input*) info;
305 INSTALLSTATE install = INSTALLSTATE_UNKNOWN, action = INSTALLSTATE_UNKNOWN;
306
307 MSI_GetComponentStateW(cond->package, $2, &install, &action );
308 $$ = action;
309 cond_free( $2 );
310 }
311 | COND_QUESTION identifier
312 {
313 COND_input* cond = (COND_input*) info;
314 INSTALLSTATE install = INSTALLSTATE_UNKNOWN, action = INSTALLSTATE_UNKNOWN;
315
316 MSI_GetComponentStateW(cond->package, $2, &install, &action );
317 $$ = install;
318 cond_free( $2 );
319 }
320 | COND_AMPER identifier
321 {
322 COND_input* cond = (COND_input*) info;
323 INSTALLSTATE install = INSTALLSTATE_UNKNOWN, action = INSTALLSTATE_UNKNOWN;
324
325 MSI_GetFeatureStateW(cond->package, $2, &install, &action );
326 if (action == INSTALLSTATE_UNKNOWN)
327 $$ = MSICONDITION_FALSE;
328 else
329 $$ = action;
330
331 cond_free( $2 );
332 }
333 | COND_EXCLAM identifier
334 {
335 COND_input* cond = (COND_input*) info;
336 INSTALLSTATE install = INSTALLSTATE_UNKNOWN, action = INSTALLSTATE_UNKNOWN;
337
338 MSI_GetFeatureStateW(cond->package, $2, &install, &action );
339 $$ = install;
340 cond_free( $2 );
341 }
342 ;
343
344 symbol_s:
345 identifier
346 {
347 COND_input* cond = (COND_input*) info;
348 UINT len;
349
350 $$ = msi_dup_property( cond->package->db, $1 );
351 if ($$)
352 {
353 len = (lstrlenW($$) + 1) * sizeof (WCHAR);
354 $$ = cond_track_mem( cond, $$, len );
355 }
356 cond_free( $1 );
357 }
358 | COND_PERCENT identifier
359 {
360 COND_input* cond = (COND_input*) info;
361 UINT len = GetEnvironmentVariableW( $2, NULL, 0 );
362 $$ = NULL;
363 if (len++)
364 {
365 $$ = cond_alloc( cond, len*sizeof (WCHAR) );
366 if( !$$ )
367 YYABORT;
368 GetEnvironmentVariableW( $2, $$, len );
369 }
370 cond_free( $2 );
371 }
372 ;
373
374 identifier:
375 COND_IDENT
376 {
377 COND_input* cond = (COND_input*) info;
378 $$ = COND_GetString( cond, &$1 );
379 if( !$$ )
380 YYABORT;
381 }
382 ;
383
384 integer:
385 COND_NUMBER
386 {
387 COND_input* cond = (COND_input*) info;
388 LPWSTR szNum = COND_GetString( cond, &$1 );
389 if( !szNum )
390 YYABORT;
391 $$ = atoiW( szNum );
392 cond_free( szNum );
393 }
394 ;
395
396 %%
397
398
399 static int COND_IsAlpha( WCHAR x )
400 {
401 return( ( ( x >= 'A' ) && ( x <= 'Z' ) ) ||
402 ( ( x >= 'a' ) && ( x <= 'z' ) ) ||
403 ( ( x == '_' ) ) );
404 }
405
406 static int COND_IsNumber( WCHAR x )
407 {
408 return( (( x >= '0' ) && ( x <= '9' )) || (x =='-') || (x =='.') );
409 }
410
411 static WCHAR *strstriW( const WCHAR *str, const WCHAR *sub )
412 {
413 LPWSTR strlower, sublower, r;
414 strlower = CharLowerW( strdupW( str ) );
415 sublower = CharLowerW( strdupW( sub ) );
416 r = strstrW( strlower, sublower );
417 if (r)
418 r = (LPWSTR)str + (r - strlower);
419 msi_free( strlower );
420 msi_free( sublower );
421 return r;
422 }
423
424 static BOOL str_is_number( LPCWSTR str )
425 {
426 int i;
427
428 if (!*str)
429 return FALSE;
430
431 for (i = 0; i < lstrlenW( str ); i++)
432 if (!isdigitW(str[i]))
433 return FALSE;
434
435 return TRUE;
436 }
437
438 static INT compare_substring( LPCWSTR a, INT operator, LPCWSTR b )
439 {
440 int lhs, rhs;
441
442 /* substring operators return 0 if LHS is missing */
443 if (!a || !*a)
444 return 0;
445
446 /* substring operators return 1 if RHS is missing */
447 if (!b || !*b)
448 return 1;
449
450 /* if both strings contain only numbers, use integer comparison */
451 lhs = atoiW(a);
452 rhs = atoiW(b);
453 if (str_is_number(a) && str_is_number(b))
454 return compare_int( lhs, operator, rhs );
455
456 switch (operator)
457 {
458 case COND_SS:
459 return strstrW( a, b ) ? 1 : 0;
460 case COND_ISS:
461 return strstriW( a, b ) ? 1 : 0;
462 case COND_LHS:
463 return 0 == strncmpW( a, b, lstrlenW( b ) );
464 case COND_RHS:
465 {
466 int l = lstrlenW( a );
467 int r = lstrlenW( b );
468 if (r > l) return 0;
469 return 0 == lstrcmpW( a + (l - r), b );
470 }
471 case COND_ILHS:
472 return 0 == strncmpiW( a, b, lstrlenW( b ) );
473 case COND_IRHS:
474 {
475 int l = lstrlenW( a );
476 int r = lstrlenW( b );
477 if (r > l) return 0;
478 return 0 == lstrcmpiW( a + (l - r), b );
479 }
480 default:
481 ERR("invalid substring operator\n");
482 return 0;
483 }
484 return 0;
485 }
486
487 static INT compare_string( LPCWSTR a, INT operator, LPCWSTR b, BOOL convert )
488 {
489 if (operator >= COND_SS && operator <= COND_RHS)
490 return compare_substring( a, operator, b );
491
492 /* null and empty string are equivalent */
493 if (!a) a = szEmpty;
494 if (!b) b = szEmpty;
495
496 if (convert && str_is_number(a) && str_is_number(b))
497 return compare_int( atoiW(a), operator, atoiW(b) );
498
499 /* a or b may be NULL */
500 switch (operator)
501 {
502 case COND_LT:
503 return -1 == lstrcmpW( a, b );
504 case COND_GT:
505 return 1 == lstrcmpW( a, b );
506 case COND_EQ:
507 return 0 == lstrcmpW( a, b );
508 case COND_NE:
509 return 0 != lstrcmpW( a, b );
510 case COND_GE:
511 return -1 != lstrcmpW( a, b );
512 case COND_LE:
513 return 1 != lstrcmpW( a, b );
514 case COND_ILT:
515 return -1 == lstrcmpiW( a, b );
516 case COND_IGT:
517 return 1 == lstrcmpiW( a, b );
518 case COND_IEQ:
519 return 0 == lstrcmpiW( a, b );
520 case COND_INE:
521 return 0 != lstrcmpiW( a, b );
522 case COND_IGE:
523 return -1 != lstrcmpiW( a, b );
524 case COND_ILE:
525 return 1 != lstrcmpiW( a, b );
526 default:
527 ERR("invalid string operator\n");
528 return 0;
529 }
530 return 0;
531 }
532
533
534 static INT compare_int( INT a, INT operator, INT b )
535 {
536 switch (operator)
537 {
538 case COND_LT:
539 case COND_ILT:
540 return a < b;
541 case COND_GT:
542 case COND_IGT:
543 return a > b;
544 case COND_EQ:
545 case COND_IEQ:
546 return a == b;
547 case COND_NE:
548 case COND_INE:
549 return a != b;
550 case COND_GE:
551 case COND_IGE:
552 return a >= b;
553 case COND_LE:
554 case COND_ILE:
555 return a <= b;
556 case COND_SS:
557 case COND_ISS:
558 return ( a & b ) ? 1 : 0;
559 case COND_RHS:
560 return ( ( a & 0xffff ) == b ) ? 1 : 0;
561 case COND_LHS:
562 return ( ( (a>>16) & 0xffff ) == b ) ? 1 : 0;
563 default:
564 ERR("invalid integer operator\n");
565 return 0;
566 }
567 return 0;
568 }
569
570
571 static int COND_IsIdent( WCHAR x )
572 {
573 return( COND_IsAlpha( x ) || COND_IsNumber( x ) || ( x == '_' )
574 || ( x == '#' ) || (x == '.') );
575 }
576
577 static int COND_GetOperator( COND_input *cond )
578 {
579 static const struct {
580 const WCHAR str[4];
581 int id;
582 } table[] = {
583 { {'~','<','=',0}, COND_ILE },
584 { {'~','>','<',0}, COND_ISS },
585 { {'~','>','>',0}, COND_IRHS },
586 { {'~','<','>',0}, COND_INE },
587 { {'~','>','=',0}, COND_IGE },
588 { {'~','<','<',0}, COND_ILHS },
589 { {'~','=',0}, COND_IEQ },
590 { {'~','<',0}, COND_ILT },
591 { {'~','>',0}, COND_IGT },
592 { {'>','=',0}, COND_GE },
593 { {'>','<',0}, COND_SS },
594 { {'<','<',0}, COND_LHS },
595 { {'<','>',0}, COND_NE },
596 { {'<','=',0}, COND_LE },
597 { {'>','>',0}, COND_RHS },
598 { {'>',0}, COND_GT },
599 { {'<',0}, COND_LT },
600 { {0}, 0 }
601 };
602 LPCWSTR p = &cond->str[cond->n];
603 int i = 0, len;
604
605 while ( 1 )
606 {
607 len = lstrlenW( table[i].str );
608 if ( !len || 0 == strncmpW( table[i].str, p, len ) )
609 break;
610 i++;
611 }
612 cond->n += len;
613 return table[i].id;
614 }
615
616 static int COND_GetOne( struct cond_str *str, COND_input *cond )
617 {
618 int rc, len = 1;
619 WCHAR ch;
620
621 str->data = &cond->str[cond->n];
622
623 ch = str->data[0];
624
625 switch( ch )
626 {
627 case 0: return 0;
628 case '(': rc = COND_LPAR; break;
629 case ')': rc = COND_RPAR; break;
630 case '&': rc = COND_AMPER; break;
631 case '!': rc = COND_EXCLAM; break;
632 case '$': rc = COND_DOLLARS; break;
633 case '?': rc = COND_QUESTION; break;
634 case '%': rc = COND_PERCENT; break;
635 case ' ': rc = COND_SPACE; break;
636 case '=': rc = COND_EQ; break;
637
638 case '~':
639 case '<':
640 case '>':
641 rc = COND_GetOperator( cond );
642 if (!rc)
643 rc = COND_ERROR;
644 return rc;
645 default:
646 rc = 0;
647 }
648
649 if ( rc )
650 {
651 cond->n += len;
652 return rc;
653 }
654
655 if (ch == '"' )
656 {
657 LPCWSTR p = strchrW( str->data + 1, '"' );
658 if (!p)
659 return COND_ERROR;
660 len = p - str->data + 1;
661 rc = COND_LITER;
662 }
663 else if( COND_IsAlpha( ch ) )
664 {
665 static const WCHAR szNot[] = {'N','O','T',0};
666 static const WCHAR szAnd[] = {'A','N','D',0};
667 static const WCHAR szXor[] = {'X','O','R',0};
668 static const WCHAR szEqv[] = {'E','Q','V',0};
669 static const WCHAR szImp[] = {'I','M','P',0};
670 static const WCHAR szOr[] = {'O','R',0};
671
672 while( COND_IsIdent( str->data[len] ) )
673 len++;
674 rc = COND_IDENT;
675
676 if ( len == 3 )
677 {
678 if ( !strncmpiW( str->data, szNot, len ) )
679 rc = COND_NOT;
680 else if( !strncmpiW( str->data, szAnd, len ) )
681 rc = COND_AND;
682 else if( !strncmpiW( str->data, szXor, len ) )
683 rc = COND_XOR;
684 else if( !strncmpiW( str->data, szEqv, len ) )
685 rc = COND_EQV;
686 else if( !strncmpiW( str->data, szImp, len ) )
687 rc = COND_IMP;
688 }
689 else if( (len == 2) && !strncmpiW( str->data, szOr, len ) )
690 rc = COND_OR;
691 }
692 else if( COND_IsNumber( ch ) )
693 {
694 while( COND_IsNumber( str->data[len] ) )
695 len++;
696 rc = COND_NUMBER;
697 }
698 else
699 {
700 ERR("Got unknown character %c(%x)\n",ch,ch);
701 return COND_ERROR;
702 }
703
704 cond->n += len;
705 str->len = len;
706
707 return rc;
708 }
709
710 static int cond_lex( void *COND_lval, COND_input *cond )
711 {
712 int rc;
713 struct cond_str *str = COND_lval;
714
715 do {
716 rc = COND_GetOne( str, cond );
717 } while (rc == COND_SPACE);
718
719 return rc;
720 }
721
722 static LPWSTR COND_GetString( COND_input *cond, const struct cond_str *str )
723 {
724 LPWSTR ret;
725
726 ret = cond_alloc( cond, (str->len+1) * sizeof (WCHAR) );
727 if( ret )
728 {
729 memcpy( ret, str->data, str->len * sizeof(WCHAR));
730 ret[str->len]=0;
731 }
732 TRACE("Got identifier %s\n",debugstr_w(ret));
733 return ret;
734 }
735
736 static LPWSTR COND_GetLiteral( COND_input *cond, const struct cond_str *str )
737 {
738 LPWSTR ret;
739
740 ret = cond_alloc( cond, (str->len-1) * sizeof (WCHAR) );
741 if( ret )
742 {
743 memcpy( ret, str->data+1, (str->len-2) * sizeof(WCHAR) );
744 ret[str->len - 2]=0;
745 }
746 TRACE("Got literal %s\n",debugstr_w(ret));
747 return ret;
748 }
749
750 static void *cond_alloc( COND_input *cond, unsigned int sz )
751 {
752 struct list *mem;
753
754 mem = msi_alloc( sizeof (struct list) + sz );
755 if( !mem )
756 return NULL;
757
758 list_add_head( &(cond->mem), mem );
759 return mem + 1;
760 }
761
762 static void *cond_track_mem( COND_input *cond, void *ptr, unsigned int sz )
763 {
764 void *new_ptr;
765
766 if( !ptr )
767 return ptr;
768
769 new_ptr = cond_alloc( cond, sz );
770 if( !new_ptr )
771 {
772 msi_free( ptr );
773 return NULL;
774 }
775
776 memcpy( new_ptr, ptr, sz );
777 msi_free( ptr );
778 return new_ptr;
779 }
780
781 static void cond_free( void *ptr )
782 {
783 struct list *mem = (struct list *)ptr - 1;
784
785 if( ptr )
786 {
787 list_remove( mem );
788 msi_free( mem );
789 }
790 }
791
792 static int cond_error(const char *str)
793 {
794 TRACE("%s\n", str );
795 return 0;
796 }
797
798 MSICONDITION MSI_EvaluateConditionW( MSIPACKAGE *package, LPCWSTR szCondition )
799 {
800 COND_input cond;
801 MSICONDITION r;
802 struct list *mem, *safety;
803
804 TRACE("%s\n", debugstr_w( szCondition ) );
805
806 if ( szCondition == NULL )
807 return MSICONDITION_NONE;
808
809 cond.package = package;
810 cond.str = szCondition;
811 cond.n = 0;
812 cond.result = MSICONDITION_ERROR;
813
814 list_init( &cond.mem );
815
816 if ( !cond_parse( &cond ) )
817 r = cond.result;
818 else
819 r = MSICONDITION_ERROR;
820
821 LIST_FOR_EACH_SAFE( mem, safety, &cond.mem )
822 {
823 /* The tracked memory lives directly after the list struct */
824 void *ptr = mem + 1;
825 if ( r != MSICONDITION_ERROR )
826 WARN( "condition parser failed to free up some memory: %p\n", ptr );
827 cond_free( ptr );
828 }
829
830 TRACE("%i <- %s\n", r, debugstr_w(szCondition));
831 return r;
832 }
833
834 MSICONDITION WINAPI MsiEvaluateConditionW( MSIHANDLE hInstall, LPCWSTR szCondition )
835 {
836 MSIPACKAGE *package;
837 UINT ret;
838
839 package = msihandle2msiinfo( hInstall, MSIHANDLETYPE_PACKAGE);
840 if( !package )
841 {
842 HRESULT hr;
843 BSTR condition;
844 IWineMsiRemotePackage *remote_package;
845
846 remote_package = (IWineMsiRemotePackage *)msi_get_remote( hInstall );
847 if (!remote_package)
848 return MSICONDITION_ERROR;
849
850 condition = SysAllocString( szCondition );
851 if (!condition)
852 {
853 IWineMsiRemotePackage_Release( remote_package );
854 return ERROR_OUTOFMEMORY;
855 }
856
857 hr = IWineMsiRemotePackage_EvaluateCondition( remote_package, condition );
858
859 SysFreeString( condition );
860 IWineMsiRemotePackage_Release( remote_package );
861
862 if (FAILED(hr))
863 {
864 if (HRESULT_FACILITY(hr) == FACILITY_WIN32)
865 return HRESULT_CODE(hr);
866
867 return ERROR_FUNCTION_FAILED;
868 }
869
870 return ERROR_SUCCESS;
871 }
872
873 ret = MSI_EvaluateConditionW( package, szCondition );
874 msiobj_release( &package->hdr );
875 return ret;
876 }
877
878 MSICONDITION WINAPI MsiEvaluateConditionA( MSIHANDLE hInstall, LPCSTR szCondition )
879 {
880 LPWSTR szwCond = NULL;
881 MSICONDITION r;
882
883 szwCond = strdupAtoW( szCondition );
884 if( szCondition && !szwCond )
885 return MSICONDITION_ERROR;
886
887 r = MsiEvaluateConditionW( hInstall, szwCond );
888 msi_free( szwCond );
889 return r;
890 }