2 * Implementation of the Microsoft Installer (msi.dll)
4 * Copyright 2002 Mike McCormack for CodeWeavers
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
26 #include "wine/debug.h"
36 WINE_DEFAULT_DEBUG_CHANNEL(msi);
39 /* below is the query interface to a table */
41 typedef struct tagMSIORDERVIEW
51 static UINT ORDER_compare( MSIORDERVIEW *ov, UINT a, UINT b, UINT *swap )
53 UINT r, i, a_val = 0, b_val = 0;
56 for( i=0; i<ov->num_cols; i++ )
58 r = ov->table->ops->fetch_int( ov->table, a, ov->cols[i], &a_val );
59 if( r != ERROR_SUCCESS )
62 r = ov->table->ops->fetch_int( ov->table, b, ov->cols[i], &b_val );
63 if( r != ERROR_SUCCESS )
77 static UINT ORDER_mergesort( MSIORDERVIEW *ov, UINT left, UINT right )
79 UINT r, centre = (left + right)/2, temp, swap = 0, i, j;
80 UINT *array = ov->reorder;
85 /* sort the left half */
86 r = ORDER_mergesort( ov, left, centre );
87 if( r != ERROR_SUCCESS )
90 /* sort the right half */
91 r = ORDER_mergesort( ov, centre+1, right );
92 if( r != ERROR_SUCCESS )
95 for( i=left, j=centre+1; (i<=centre) && (j<=right); i++ )
97 r = ORDER_compare( ov, array[i], array[j], &swap );
98 if( r != ERROR_SUCCESS )
103 memmove( &array[i+1], &array[i], (j-i)*sizeof (UINT) );
110 return ERROR_SUCCESS;
113 static UINT ORDER_verify( MSIORDERVIEW *ov, UINT num_rows )
117 for( i=1; i<num_rows; i++ )
119 r = ORDER_compare( ov, ov->reorder[i-1], ov->reorder[i], &swap );
120 if( r != ERROR_SUCCESS )
124 ERR("Bad order! %d\n", i);
125 return ERROR_FUNCTION_FAILED;
128 return ERROR_SUCCESS;
131 static UINT ORDER_fetch_int( struct tagMSIVIEW *view, UINT row, UINT col, UINT *val )
133 MSIORDERVIEW *ov = (MSIORDERVIEW*)view;
135 TRACE("%p %d %d %p\n", ov, row, col, val );
138 return ERROR_FUNCTION_FAILED;
140 row = ov->reorder[ row ];
142 return ov->table->ops->fetch_int( ov->table, row, col, val );
145 static UINT ORDER_execute( struct tagMSIVIEW *view, MSIHANDLE record )
147 MSIORDERVIEW *ov = (MSIORDERVIEW*)view;
148 UINT r, num_rows = 0, i;
150 TRACE("%p %ld\n", ov, record);
153 return ERROR_FUNCTION_FAILED;
155 r = ov->table->ops->execute( ov->table, record );
156 if( r != ERROR_SUCCESS )
159 r = ov->table->ops->get_dimensions( ov->table, &num_rows, NULL );
160 if( r != ERROR_SUCCESS )
163 ov->reorder = HeapAlloc( GetProcessHeap(), 0, num_rows*sizeof(UINT) );
165 return ERROR_FUNCTION_FAILED;
167 for( i=0; i<num_rows; i++ )
170 r = ORDER_mergesort( ov, 0, num_rows - 1 );
171 if( r != ERROR_SUCCESS )
174 r = ORDER_verify( ov, num_rows );
175 if( r != ERROR_SUCCESS )
178 return ERROR_SUCCESS;
181 static UINT ORDER_close( struct tagMSIVIEW *view )
183 MSIORDERVIEW *ov = (MSIORDERVIEW*)view;
188 return ERROR_FUNCTION_FAILED;
191 HeapFree( GetProcessHeap(), 0, ov->reorder );
194 return ov->table->ops->close( ov->table );
197 static UINT ORDER_get_dimensions( struct tagMSIVIEW *view, UINT *rows, UINT *cols )
199 MSIORDERVIEW *ov = (MSIORDERVIEW*)view;
201 TRACE("%p %p %p\n", ov, rows, cols );
204 return ERROR_FUNCTION_FAILED;
206 return ov->table->ops->get_dimensions( ov->table, rows, cols );
209 static UINT ORDER_get_column_info( struct tagMSIVIEW *view,
210 UINT n, LPWSTR *name, UINT *type )
212 MSIORDERVIEW *ov = (MSIORDERVIEW*)view;
214 TRACE("%p %d %p %p\n", ov, n, name, type );
217 return ERROR_FUNCTION_FAILED;
219 return ov->table->ops->get_column_info( ov->table, n, name, type );
222 static UINT ORDER_modify( struct tagMSIVIEW *view, MSIMODIFY eModifyMode, MSIHANDLE hrec)
224 MSIORDERVIEW *ov = (MSIORDERVIEW*)view;
226 TRACE("%p %d %ld\n", ov, eModifyMode, hrec );
229 return ERROR_FUNCTION_FAILED;
231 return ov->table->ops->modify( ov->table, eModifyMode, hrec );
234 static UINT ORDER_delete( struct tagMSIVIEW *view )
236 MSIORDERVIEW *ov = (MSIORDERVIEW*)view;
241 ov->table->ops->delete( ov->table );
244 HeapFree( GetProcessHeap(), 0, ov->reorder );
247 HeapFree( GetProcessHeap(), 0, ov );
249 return ERROR_SUCCESS;
253 MSIVIEWOPS order_ops =
258 ORDER_get_dimensions,
259 ORDER_get_column_info,
264 UINT ORDER_CreateView( MSIDATABASE *db, MSIVIEW **view, MSIVIEW *table )
266 MSIORDERVIEW *ov = NULL;
271 r = table->ops->get_dimensions( table, NULL, &count );
272 if( r != ERROR_SUCCESS )
274 ERR("can't get table dimensions\n");
278 ov = HeapAlloc( GetProcessHeap(), HEAP_ZERO_MEMORY,
279 sizeof *ov + sizeof (UINT) * count );
281 return ERROR_FUNCTION_FAILED;
283 /* fill the structure */
284 ov->view.ops = &order_ops;
289 *view = (MSIVIEW*) ov;
291 return ERROR_SUCCESS;
294 UINT ORDER_AddColumn( MSIVIEW *view, LPWSTR name )
296 MSIORDERVIEW *ov = (MSIORDERVIEW*)view;
300 TRACE("%p adding %s\n", ov, debugstr_w( name ) );
302 if( ov->view.ops != &order_ops )
303 return ERROR_FUNCTION_FAILED;
307 return ERROR_FUNCTION_FAILED;
308 if( !table->ops->get_dimensions )
309 return ERROR_FUNCTION_FAILED;
310 if( !table->ops->get_column_info )
311 return ERROR_FUNCTION_FAILED;
313 r = table->ops->get_dimensions( table, NULL, &count );
314 if( r != ERROR_SUCCESS )
317 if( ov->num_cols >= count )
318 return ERROR_FUNCTION_FAILED;
320 r = VIEW_find_column( table, name, &n );
321 if( r != ERROR_SUCCESS )
324 ov->cols[ov->num_cols] = n;
325 TRACE("Ordering by column %s (%d)\n", debugstr_w( name ), n);
329 return ERROR_SUCCESS;