programs/regedit/treeview.c

   1 /*
   2  * Regedit treeview
   3  *
   4  * Copyright (C) 2002 Robert Dickenson <robd@reactos.org>
   5  *
   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.
  10  *
  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.
  15  *
  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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
  19  */
  20
  21 #define WIN32_LEAN_AND_MEAN     /* Exclude rarely-used stuff from Windows headers */
  22
  23 #define NONAMELESSUNION
  24 #define NONAMELESSSTRUCT
  25 #include <windows.h>
  26 #include <commctrl.h>
  27 #include <stdlib.h>
  28 #include <tchar.h>
  29 #include <stdio.h>
  30 #include <wine/debug.h>
  31 #include <shlwapi.h>
  32
  33 #include "main.h"
  34 #include "regproc.h"
  35
  36 WINE_DEFAULT_DEBUG_CHANNEL(regedit);
  37
  38 /* Global variables and constants  */
  39 /* Image_Open, Image_Closed, and Image_Root - integer variables for indexes of the images.  */
  40 /* CX_BITMAP and CY_BITMAP - width and height of an icon.  */
  41 /* NUM_BITMAPS - number of bitmaps to add to the image list.  */
  42 int Image_Open;
  43 int Image_Closed;
  44 int Image_Root;
  45
  46 #define CX_ICON    16
  47 #define CY_ICON    16
  48 #define NUM_ICONS    3
  49
  50 static BOOL UpdateExpandingTree(HWND hwndTV, HTREEITEM hItem, int state);
  51
  52 static BOOL get_item_path(HWND hwndTV, HTREEITEM hItem, HKEY* phKey, LPTSTR* pKeyPath, int* pPathLen, int* pMaxLen)
  53 {
  54     TVITEM item;
  55     int maxLen, len;
  56     LPTSTR newStr;
  57
  58     item.mask = TVIF_PARAM;
  59     item.hItem = hItem;
  60     if (!TreeView_GetItem(hwndTV, &item)) return FALSE;
  61
  62     if (item.lParam) {
  63         /* found root key with valid key value */
  64         *phKey = (HKEY)item.lParam;
  65         return TRUE;
  66     }
  67
  68     if(!get_item_path(hwndTV, TreeView_GetParent(hwndTV, hItem), phKey, pKeyPath, pPathLen, pMaxLen)) return FALSE;
  69     if (*pPathLen) {
  70         (*pKeyPath)[*pPathLen] = _T('\\');
  71         ++(*pPathLen);
  72     }
  73
  74     do {
  75         item.mask = TVIF_TEXT;
  76         item.hItem = hItem;
  77         item.pszText = *pKeyPath + *pPathLen;
  78         item.cchTextMax = maxLen = *pMaxLen - *pPathLen;
  79         if (!TreeView_GetItem(hwndTV, &item)) return FALSE;
  80         len = _tcslen(item.pszText);
  81         if (len < maxLen - 1) {
  82             *pPathLen += len;
  83             break;
  84         }
  85         newStr = HeapReAlloc(GetProcessHeap(), 0, *pKeyPath, *pMaxLen * 2);
  86         if (!newStr) return FALSE;
  87         *pKeyPath = newStr;
  88         *pMaxLen *= 2;
  89     } while(TRUE);
  90
  91     return TRUE;
  92 }
  93
  94 static BOOL get_item_pathW(HWND hwndTV, HTREEITEM hItem, HKEY* phKey, LPWSTR* pKeyPath, int* pPathLen, int* pMaxChars)
  95 {
  96     TVITEMW item;
  97     int maxChars, chars;
  98     LPWSTR newStr;
  99
 100     item.mask = TVIF_PARAM;
 101     item.hItem = hItem;
 102     if (!TreeView_GetItem(hwndTV, &item)) return FALSE;
 103
 104     if (item.lParam) {
 105     /* found root key with valid key value */
 106     *phKey = (HKEY)item.lParam;
 107     return TRUE;
 108     }
 109
 110     if(!get_item_pathW(hwndTV, TreeView_GetParent(hwndTV, hItem), phKey, pKeyPath, pPathLen, pMaxChars)) return FALSE;
 111     if (*pPathLen) {
 112         (*pKeyPath)[*pPathLen] = '\\';
 113         ++(*pPathLen);
 114     }
 115
 116     do {
 117         item.mask = TVIF_TEXT;
 118         item.hItem = hItem;
 119         item.pszText = *pKeyPath + *pPathLen;
 120         item.cchTextMax = maxChars = *pMaxChars - *pPathLen;
 121         if (!TreeView_GetItemW(hwndTV, &item)) return FALSE;
 122         chars = lstrlenW(item.pszText);
 123     if (chars < maxChars - 1) {
 124             *pPathLen += chars;
 125             break;
 126     }
 127     newStr = HeapReAlloc(GetProcessHeap(), 0, *pKeyPath, *pMaxChars * 2);
 128     if (!newStr) return FALSE;
 129     *pKeyPath = newStr;
 130     *pMaxChars *= 2;
 131     } while(TRUE);
 132
 133     return TRUE;
 134 }
 135
 136 LPTSTR GetItemPath(HWND hwndTV, HTREEITEM hItem, HKEY* phRootKey)
 137 {
 138     int pathLen = 0, maxLen;
 139     TCHAR *pathBuffer;
 140
 141     pathBuffer = HeapAlloc(GetProcessHeap(), 0, 1024);
 142     if (!pathBuffer) return NULL;
 143     *pathBuffer = 0;
 144     maxLen = HeapSize(GetProcessHeap(), 0, pathBuffer);
 145     if (maxLen == (SIZE_T) - 1) return NULL;
 146     if (!hItem) hItem = TreeView_GetSelection(hwndTV);
 147     if (!hItem) return NULL;
 148     if (!get_item_path(hwndTV, hItem, phRootKey, &pathBuffer, &pathLen, &maxLen)) return NULL;
 149     return pathBuffer;
 150 }
 151
 152 LPWSTR GetItemPathW(HWND hwndTV, HTREEITEM hItem, HKEY* phRootKey)
 153 {
 154     int pathLen = 0, maxLen;
 155     WCHAR *pathBuffer;
 156
 157     pathBuffer = HeapAlloc(GetProcessHeap(), 0, 1024*sizeof(WCHAR));
 158     if (!pathBuffer) return NULL;
 159     *pathBuffer = 0;
 160     maxLen = HeapSize(GetProcessHeap(), 0, pathBuffer);
 161     if (maxLen == (SIZE_T) - 1) return NULL;
 162     maxLen = maxLen / sizeof(WCHAR);
 163     if (!hItem) hItem = TreeView_GetSelection(hwndTV);
 164     if (!hItem) return NULL;
 165     if (!get_item_pathW(hwndTV, hItem, phRootKey, &pathBuffer, &pathLen, &maxLen)) return NULL;
 166     return pathBuffer;
 167 }
 168
 169 static LPTSTR get_path_component(LPCTSTR *lplpKeyName) {
 170      LPCTSTR lpPos = *lplpKeyName;
 171      LPTSTR lpResult = NULL;
 172      int len;
 173      if (!lpPos)
 174          return NULL;
 175      while(*lpPos && *lpPos != '\\')
 176          lpPos++;
 177      if (*lpPos && lpPos == *lplpKeyName)
 178          return NULL;
 179      len = (lpPos+1-(*lplpKeyName)) * sizeof(TCHAR);
 180      lpResult = HeapAlloc(GetProcessHeap(), 0, len);
 181      if (!lpResult) /* that would be very odd */
 182          return NULL;
 183      memcpy(lpResult, *lplpKeyName, len-1);
 184      lpResult[len-1] = '\0';
 185      *lplpKeyName = *lpPos ? lpPos+1 : NULL;
 186      return lpResult;
 187 }
 188
 189 HTREEITEM FindPathInTree(HWND hwndTV, LPCTSTR lpKeyName) {
 190     TVITEMEX tvi;
 191     TCHAR buf[261]; /* tree view has 260 character limitation on item name */
 192     HTREEITEM hItem, hOldItem;
 193
 194     buf[260] = '\0';
 195     hItem = TreeView_GetRoot(hwndTV);
 196     SendMessage(hwndTV, TVM_EXPAND, TVE_EXPAND, (LPARAM)hItem );
 197     hItem = TreeView_GetChild(hwndTV, hItem);
 198     hOldItem = hItem;
 199     while(1) {
 200         LPTSTR lpItemName = get_path_component(&lpKeyName);
 201         if (lpItemName) {
 202             while(hItem) {
 203                 tvi.mask = TVIF_TEXT | TVIF_HANDLE;
 204                 tvi.hItem = hItem;
 205                 tvi.pszText = buf;
 206                 tvi.cchTextMax = 260;
 207                 SendMessage(hwndTV, TVM_GETITEM, 0, (LPARAM) &tvi);
 208                 if (!_tcsicmp(tvi.pszText, lpItemName)) {
 209                      SendMessage(hwndTV, TVM_EXPAND, TVE_EXPAND, (LPARAM)hItem );
 210                      if (!lpKeyName)
 211                          return hItem;
 212                      hOldItem = hItem;
 213                      hItem = TreeView_GetChild(hwndTV, hItem);
 214                      break;
 215                 }
 216                 hItem = TreeView_GetNextSibling(hwndTV, hItem);
 217             }
 218             HeapFree(GetProcessHeap(), 0, lpItemName);
 219             if (!hItem)
 220                 return hOldItem;
 221         }
 222         else
 223             return hItem;
 224     }
 225 }
 226
 227 BOOL DeleteNode(HWND hwndTV, HTREEITEM hItem)
 228 {
 229     if (!hItem) hItem = TreeView_GetSelection(hwndTV);
 230     if (!hItem) return FALSE;
 231     return TreeView_DeleteItem(hwndTV, hItem);
 232 }
 233
 234 /* Add an entry to the tree. Only give hKey for root nodes (HKEY_ constants) */
 235 static HTREEITEM AddEntryToTree(HWND hwndTV, HTREEITEM hParent, LPTSTR label, HKEY hKey, DWORD dwChildren)
 236 {
 237     TVINSERTSTRUCT tvins;
 238
 239     if (hKey) {
 240         if (RegQueryInfoKey(hKey, 0, 0, 0, &dwChildren, 0, 0, 0, 0, 0, 0, 0) != ERROR_SUCCESS) {
 241             dwChildren = 0;
 242         }
 243     }
 244
 245     tvins.u.item.mask = TVIF_TEXT | TVIF_IMAGE | TVIF_SELECTEDIMAGE | TVIF_CHILDREN | TVIF_PARAM;
 246     tvins.u.item.pszText = label;
 247     tvins.u.item.cchTextMax = lstrlen(label);
 248     tvins.u.item.iImage = Image_Closed;
 249     tvins.u.item.iSelectedImage = Image_Open;
 250     tvins.u.item.cChildren = dwChildren;
 251     tvins.u.item.lParam = (LPARAM)hKey;
 252     tvins.hInsertAfter = (HTREEITEM)(hKey ? TVI_LAST : TVI_SORT);
 253     tvins.hParent = hParent;
 254     return TreeView_InsertItem(hwndTV, &tvins);
 255 }
 256
 257 static BOOL match_string(LPCTSTR sstring1, LPCTSTR sstring2, int mode)
 258 {
 259     if (mode & SEARCH_WHOLE)
 260         return !stricmp(sstring1, sstring2);
 261     else
 262         return NULL != StrStrI(sstring1, sstring2);
 263 }
 264
 265 static BOOL match_item(HWND hwndTV, HTREEITEM hItem, LPCTSTR sstring, int mode, int *row)
 266 {
 267     TVITEM item;
 268     TCHAR keyname[KEY_MAX_LEN];
 269     item.mask = TVIF_TEXT;
 270     item.hItem = hItem;
 271     item.pszText = keyname;
 272     item.cchTextMax = KEY_MAX_LEN;
 273     if (!TreeView_GetItem(hwndTV, &item)) return FALSE;
 274     if ((mode & SEARCH_KEYS) && match_string(keyname, sstring, mode)) {
 275         *row = -1;
 276         return TRUE;
 277     }
 278
 279     if (mode & (SEARCH_VALUES | SEARCH_CONTENT)) {
 280         int i, adjust;
 281         TCHAR valName[KEY_MAX_LEN], *KeyPath;
 282         HKEY hKey, hRoot;
 283         DWORD lenName;
 284
 285         KeyPath = GetItemPath(hwndTV, hItem, &hRoot);
 286
 287         if (!KeyPath || !hRoot)
 288              return FALSE;
 289
 290         if (RegOpenKeyEx(hRoot, KeyPath, 0, KEY_READ, &hKey) != ERROR_SUCCESS) {
 291             HeapFree(GetProcessHeap(), 0, KeyPath);
 292             return FALSE;
 293         }
 294
 295         HeapFree(GetProcessHeap(), 0, KeyPath);
 296         lenName = KEY_MAX_LEN;
 297         adjust = 0;
 298         /* RegEnumValue won't return empty default value, so fake it when dealing with *row,
 299            which corresponds to list view rows, not value ids */
 300         if (ERROR_SUCCESS == RegEnumValue(hKey, 0, valName, &lenName, NULL, NULL, NULL, NULL) && *valName)
 301             adjust = 1;
 302
 303         i = (*row)-adjust;
 304         if (i < 0) i = 0;
 305         while(1) {
 306             DWORD lenValue = 0, type = 0;
 307             lenName = KEY_MAX_LEN;
 308
 309             if (ERROR_SUCCESS != RegEnumValue(hKey,
 310                 i, valName, &lenName, NULL, &type, NULL, &lenValue))
 311                 break;
 312
 313             if (mode & SEARCH_VALUES) {
 314                 if (match_string(valName, sstring, mode)) {
 315                     RegCloseKey(hKey);
 316                     *row = i+adjust;
 317                     return TRUE;
 318                 }
 319             }
 320
 321             if ((mode & SEARCH_CONTENT) && (type == REG_EXPAND_SZ || type == REG_SZ)) {
 322                 LPTSTR buffer;
 323                 buffer = HeapAlloc(GetProcessHeap(), 0, lenValue);
 324                 RegEnumValue(hKey, i, valName, &lenName, NULL, &type, (LPBYTE)buffer, &lenValue);
 325                 if (match_string(buffer, sstring, mode)) {
 326                     HeapFree(GetProcessHeap(), 0, buffer);
 327                     RegCloseKey(hKey);
 328                     *row = i+adjust;
 329                     return TRUE;
 330                 }
 331                 HeapFree(GetProcessHeap(), 0, buffer);
 332             }
 333
 334             i++;
 335         }
 336         RegCloseKey(hKey);
 337     }
 338     return FALSE;
 339 }
 340
 341 HTREEITEM FindNext(HWND hwndTV, HTREEITEM hItem, LPCTSTR sstring, int mode, int *row)
 342 {
 343     HTREEITEM hTry, hLast;
 344
 345     hLast = hItem;
 346     (*row)++;
 347     if (match_item(hwndTV, hLast, sstring, mode & ~SEARCH_KEYS, row)) {
 348         return hLast;
 349     }
 350     *row = 0;
 351
 352     while(hLast) {
 353         /* first look in subtree */
 354         /* no children? maybe we haven't loaded them yet? */
 355         if (!TreeView_GetChild(hwndTV, hLast)) {
 356             UpdateExpandingTree(hwndTV, hLast, TreeView_GetItemState(hwndTV, hLast, -1));
 357         }
 358         hTry = TreeView_GetChild(hwndTV, hLast);
 359         if (hTry) {
 360             if (match_item(hwndTV, hTry, sstring, mode, row))
 361                 return hTry;
 362             hLast = hTry;
 363             continue;
 364         }
 365         /* no more children, maybe there are any siblings? */
 366         hTry = TreeView_GetNextSibling(hwndTV, hLast);
 367         if (hTry) {
 368             if (match_item(hwndTV, hTry, sstring, mode, row))
 369                 return hTry;
 370             hLast = hTry;
 371             continue;
 372         }
 373         /* no more siblings, look at the next siblings in parent(s) */
 374         hLast = TreeView_GetParent(hwndTV, hLast);
 375         if (!hLast)
 376             return NULL;
 377         while (hLast && (hTry = TreeView_GetNextSibling(hwndTV, hLast)) == NULL) {
 378             hLast = TreeView_GetParent(hwndTV, hLast);
 379         }
 380         if (match_item(hwndTV, hTry, sstring, mode, row))
 381             return hTry;
 382         hLast = hTry;
 383     }
 384     return NULL;
 385 }
 386
 387 static BOOL RefreshTreeItem(HWND hwndTV, HTREEITEM hItem)
 388 {
 389     HKEY hRoot, hKey, hSubKey;
 390     HTREEITEM childItem;
 391     LPTSTR KeyPath;
 392     DWORD dwCount, dwIndex, dwMaxSubKeyLen;
 393     LPSTR Name;
 394     TVITEM tvItem;
 395
 396     hRoot = NULL;
 397     KeyPath = GetItemPath(hwndTV, hItem, &hRoot);
 398
 399     if (!KeyPath || !hRoot)
 400         return FALSE;
 401
 402     if (*KeyPath) {
 403         if (RegOpenKeyEx(hRoot, KeyPath, 0, KEY_READ, &hKey) != ERROR_SUCCESS) {
 404             WINE_TRACE("RegOpenKeyEx failed, \"%s\" was probably removed.\n", KeyPath);
 405             return FALSE;
 406         }
 407     } else {
 408         hKey = hRoot;
 409     }
 410     HeapFree(GetProcessHeap(), 0, KeyPath);
 411
 412     if (RegQueryInfoKey(hKey, 0, 0, 0, &dwCount, &dwMaxSubKeyLen, 0, 0, 0, 0, 0, 0) != ERROR_SUCCESS) {
 413         return FALSE;
 414     }
 415
 416     /* Set the number of children again */
 417     tvItem.mask = TVIF_CHILDREN;
 418     tvItem.hItem = hItem;
 419     tvItem.cChildren = dwCount;
 420     if (!TreeView_SetItem(hwndTV, &tvItem)) {
 421         return FALSE;
 422     }
 423
 424     /* We don't have to bother with the rest if it's not expanded. */
 425     if (TreeView_GetItemState(hwndTV, hItem, TVIS_EXPANDED) == 0) {
 426         RegCloseKey(hKey);
 427         return TRUE;
 428     }
 429
 430     dwMaxSubKeyLen++; /* account for the \0 terminator */
 431     if (!(Name = HeapAlloc(GetProcessHeap(), 0, dwMaxSubKeyLen * sizeof(TCHAR)))) {
 432         return FALSE;
 433     }
 434     tvItem.cchTextMax = dwMaxSubKeyLen;
 435     if (!(tvItem.pszText = HeapAlloc(GetProcessHeap(), 0, dwMaxSubKeyLen * sizeof(TCHAR)))) {
 436         return FALSE;
 437     }
 438
 439     /* Now go through all the children in the registry, and check if any have to be added. */
 440     for (dwIndex = 0; dwIndex < dwCount; dwIndex++) {
 441         DWORD cName = dwMaxSubKeyLen, dwSubCount;
 442         BOOL found;
 443
 444         found = FALSE;
 445         if (RegEnumKeyEx(hKey, dwIndex, Name, &cName, 0, 0, 0, NULL) != ERROR_SUCCESS) {
 446             continue;
 447         }
 448
 449         /* Find the number of children of the node. */
 450         dwSubCount = 0;
 451         if (RegOpenKeyEx(hKey, Name, 0, KEY_QUERY_VALUE, &hSubKey) == ERROR_SUCCESS) {
 452             if (RegQueryInfoKey(hSubKey, 0, 0, 0, &dwSubCount, 0, 0, 0, 0, 0, 0, 0) != ERROR_SUCCESS) {
 453                 dwSubCount = 0;
 454             }
 455             RegCloseKey(hSubKey);
 456         }
 457
 458         /* Check if the node is already in there. */
 459         for (childItem = TreeView_GetChild(hwndTV, hItem); childItem;
 460                 childItem = TreeView_GetNextSibling(hwndTV, childItem)) {
 461             tvItem.mask = TVIF_TEXT;
 462             tvItem.hItem = childItem;
 463             if (!TreeView_GetItem(hwndTV, &tvItem)) {
 464                 return FALSE;
 465             }
 466
 467             if (!stricmp(tvItem.pszText, Name)) {
 468                 found = TRUE;
 469                 break;
 470             }
 471         }
 472
 473         if (found == FALSE) {
 474             WINE_TRACE("New subkey %s\n", Name);
 475             AddEntryToTree(hwndTV, hItem, Name, NULL, dwSubCount);
 476         }
 477     }
 478     HeapFree(GetProcessHeap(), 0, Name);
 479     HeapFree(GetProcessHeap(), 0, tvItem.pszText);
 480     RegCloseKey(hKey);
 481
 482     /* Now go through all the children in the tree, and check if any have to be removed. */
 483     childItem = TreeView_GetChild(hwndTV, hItem);
 484     while (childItem) {
 485         HTREEITEM nextItem = TreeView_GetNextSibling(hwndTV, childItem);
 486         if (RefreshTreeItem(hwndTV, childItem) == FALSE) {
 487             SendMessage(hwndTV, TVM_DELETEITEM, 0, (LPARAM)childItem);
 488         }
 489         childItem = nextItem;
 490     }
 491
 492     return TRUE;
 493 }
 494
 495 BOOL RefreshTreeView(HWND hwndTV)
 496 {
 497     HTREEITEM hItem;
 498     HTREEITEM hSelectedItem;
 499     HCURSOR hcursorOld;
 500
 501     WINE_TRACE("\n");
 502     hSelectedItem = TreeView_GetSelection(hwndTV);
 503     hcursorOld = SetCursor(LoadCursor(NULL, IDC_WAIT));
 504     SendMessage(hwndTV, WM_SETREDRAW, FALSE, 0);
 505
 506     hItem = TreeView_GetChild(hwndTV, TreeView_GetRoot(hwndTV));
 507     while (hItem) {
 508         RefreshTreeItem(hwndTV, hItem);
 509         hItem = TreeView_GetNextSibling(hwndTV, hItem);
 510     }
 511
 512     SendMessage(hwndTV, WM_SETREDRAW, TRUE, 0);
 513     InvalidateRect(hwndTV, NULL, FALSE);
 514     SetCursor(hcursorOld);
 515
 516     /* We reselect the currently selected node, this will prompt a refresh of the listview. */
 517     SendMessage(hwndTV, TVM_SELECTITEM, TVGN_CARET, (LPARAM)hSelectedItem);
 518     return TRUE;
 519 }
 520
 521 HTREEITEM InsertNode(HWND hwndTV, HTREEITEM hItem, LPTSTR name)
 522 {
 523     TCHAR buf[MAX_NEW_KEY_LEN];
 524     HTREEITEM hNewItem = 0;
 525     TVITEMEX item;
 526
 527     if (!hItem) hItem = TreeView_GetSelection(hwndTV);
 528     if (!hItem) return FALSE;
 529     if (TreeView_GetItemState(hwndTV, hItem, TVIS_EXPANDEDONCE)) {
 530         hNewItem = AddEntryToTree(hwndTV, hItem, name, 0, 0);
 531     } else {
 532         item.mask = TVIF_CHILDREN | TVIF_HANDLE;
 533         item.hItem = hItem;
 534         if (!TreeView_GetItem(hwndTV, &item)) return FALSE;
 535         item.cChildren = 1;
 536         if (!TreeView_SetItem(hwndTV, &item)) return FALSE;
 537     }
 538     SendMessage(hwndTV, TVM_EXPAND, TVE_EXPAND, (LPARAM)hItem );
 539     if (!hNewItem) {
 540         for(hNewItem = TreeView_GetChild(hwndTV, hItem); hNewItem; hNewItem = TreeView_GetNextSibling(hwndTV, hNewItem)) {
 541             item.mask = TVIF_HANDLE | TVIF_TEXT;
 542             item.hItem = hNewItem;
 543             item.pszText = buf;
 544             item.cchTextMax = COUNT_OF(buf);
 545             if (!TreeView_GetItem(hwndTV, &item)) continue;
 546             if (lstrcmp(name, item.pszText) == 0) break;
 547         }
 548     }
 549     if (hNewItem)
 550         SendMessage(hwndTV, TVM_SELECTITEM, TVGN_CARET, (LPARAM)hNewItem);
 551
 552     return hNewItem;
 553 }
 554
 555 HWND StartKeyRename(HWND hwndTV)
 556 {
 557     HTREEITEM hItem;
 558
 559     if(!(hItem = TreeView_GetSelection(hwndTV))) return 0;
 560     return TreeView_EditLabel(hwndTV, hItem);
 561 }
 562
 563 static BOOL InitTreeViewItems(HWND hwndTV, LPTSTR pHostName)
 564 {
 565     TVINSERTSTRUCT tvins;
 566     HTREEITEM hRoot;
 567     static TCHAR hkcr[] = {'H','K','E','Y','_','C','L','A','S','S','E','S','_','R','O','O','T',0},
 568                  hkcu[] = {'H','K','E','Y','_','C','U','R','R','E','N','T','_','U','S','E','R',0},
 569                  hklm[] = {'H','K','E','Y','_','L','O','C','A','L','_','M','A','C','H','I','N','E',0},
 570                  hku[]  = {'H','K','E','Y','_','U','S','E','R','S',0},
 571                  hkcc[] = {'H','K','E','Y','_','C','U','R','R','E','N','T','_','C','O','N','F','I','G',0},
 572                  hkdd[] = {'H','K','E','Y','_','D','Y','N','_','D','A','T','A',0};
 573
 574     tvins.u.item.mask = TVIF_TEXT | TVIF_IMAGE | TVIF_SELECTEDIMAGE | TVIF_CHILDREN | TVIF_PARAM;
 575     /* Set the text of the item.  */
 576     tvins.u.item.pszText = pHostName;
 577     tvins.u.item.cchTextMax = lstrlen(pHostName);
 578     /* Assume the item is not a parent item, so give it an image.  */
 579     tvins.u.item.iImage = Image_Root;
 580     tvins.u.item.iSelectedImage = Image_Root;
 581     tvins.u.item.cChildren = 5;
 582     /* Save the heading level in the item's application-defined data area.  */
 583     tvins.u.item.lParam = (LPARAM)NULL;
 584     tvins.hInsertAfter = (HTREEITEM)TVI_FIRST;
 585     tvins.hParent = TVI_ROOT;
 586     /* Add the item to the tree view control.  */
 587     if (!(hRoot = TreeView_InsertItem(hwndTV, &tvins))) return FALSE;
 588
 589     if (!AddEntryToTree(hwndTV, hRoot, hkcr, HKEY_CLASSES_ROOT, 1)) return FALSE;
 590     if (!AddEntryToTree(hwndTV, hRoot, hkcu, HKEY_CURRENT_USER, 1)) return FALSE;
 591     if (!AddEntryToTree(hwndTV, hRoot, hklm, HKEY_LOCAL_MACHINE, 1)) return FALSE;
 592     if (!AddEntryToTree(hwndTV, hRoot, hku, HKEY_USERS, 1)) return FALSE;
 593     if (!AddEntryToTree(hwndTV, hRoot, hkcc, HKEY_CURRENT_CONFIG, 1)) return FALSE;
 594     if (!AddEntryToTree(hwndTV, hRoot, hkdd, HKEY_DYN_DATA, 1)) return FALSE;
 595
 596     /* expand and select host name */
 597     SendMessage(hwndTV, TVM_EXPAND, TVE_EXPAND, (LPARAM)hRoot );
 598     SendMessage(hwndTV, TVM_SELECTITEM, TVGN_CARET, (LPARAM)hRoot);
 599     return TRUE;
 600 }
 601
 602
 603 /*
 604  * InitTreeViewImageLists - creates an image list, adds three bitmaps
 605  * to it, and associates the image list with a tree view control.
 606  * Returns TRUE if successful, or FALSE otherwise.
 607  * hwndTV - handle to the tree view control.
 608  */
 609 static BOOL InitTreeViewImageLists(HWND hwndTV)
 610 {
 611     HIMAGELIST himl;  /* handle to image list  */
 612     HICON hico;       /* handle to icon  */
 613
 614     /* Create the image list.  */
 615     if ((himl = ImageList_Create(CX_ICON, CY_ICON,
 616                                  ILC_MASK, 0, NUM_ICONS)) == NULL)
 617         return FALSE;
 618
 619     /* Add the open file, closed file, and document bitmaps.  */
 620     hico = LoadIcon(hInst, MAKEINTRESOURCE(IDI_OPEN_FILE));
 621     Image_Open = ImageList_AddIcon(himl, hico);
 622
 623     hico = LoadIcon(hInst, MAKEINTRESOURCE(IDI_CLOSED_FILE));
 624     Image_Closed = ImageList_AddIcon(himl, hico);
 625
 626     hico = LoadIcon(hInst, MAKEINTRESOURCE(IDI_ROOT));
 627     Image_Root = ImageList_AddIcon(himl, hico);
 628
 629     /* Fail if not all of the images were added.  */
 630     if (ImageList_GetImageCount(himl) < NUM_ICONS)
 631     {
 632       return FALSE;
 633     }
 634
 635     /* Associate the image list with the tree view control.  */
 636     SendMessage(hwndTV, TVM_SETIMAGELIST, TVSIL_NORMAL, (LPARAM)himl);
 637
 638     return TRUE;
 639 }
 640
 641 BOOL UpdateExpandingTree(HWND hwndTV, HTREEITEM hItem, int state)
 642 {
 643     DWORD dwCount, dwIndex, dwMaxSubKeyLen;
 644     HKEY hRoot, hNewKey, hKey;
 645     LPTSTR keyPath;
 646     LPTSTR Name;
 647     LONG errCode;
 648     HCURSOR hcursorOld;
 649
 650     static int expanding;
 651     if (expanding) return FALSE;
 652     if (state & TVIS_EXPANDEDONCE ) {
 653         return TRUE;
 654     }
 655     expanding = TRUE;
 656     hcursorOld = SetCursor(LoadCursor(NULL, IDC_WAIT));
 657     SendMessage(hwndTV, WM_SETREDRAW, FALSE, 0);
 658
 659     keyPath = GetItemPath(hwndTV, hItem, &hRoot);
 660     if (!keyPath) goto done;
 661
 662     if (*keyPath) {
 663         errCode = RegOpenKeyEx(hRoot, keyPath, 0, KEY_READ, &hNewKey);
 664         if (errCode != ERROR_SUCCESS) goto done;
 665     } else {
 666         hNewKey = hRoot;
 667     }
 668
 669     errCode = RegQueryInfoKey(hNewKey, 0, 0, 0, &dwCount, &dwMaxSubKeyLen, 0, 0, 0, 0, 0, 0);
 670     if (errCode != ERROR_SUCCESS) goto done;
 671     dwMaxSubKeyLen++; /* account for the \0 terminator */
 672     Name = HeapAlloc(GetProcessHeap(), 0, dwMaxSubKeyLen * sizeof(TCHAR));
 673     if (!Name) goto done;
 674
 675     for (dwIndex = 0; dwIndex < dwCount; dwIndex++) {
 676         DWORD cName = dwMaxSubKeyLen, dwSubCount;
 677
 678         errCode = RegEnumKeyEx(hNewKey, dwIndex, Name, &cName, 0, 0, 0, 0);
 679         if (errCode != ERROR_SUCCESS) continue;
 680         errCode = RegOpenKeyEx(hNewKey, Name, 0, KEY_QUERY_VALUE, &hKey);
 681         if (errCode == ERROR_SUCCESS) {
 682             errCode = RegQueryInfoKey(hKey, 0, 0, 0, &dwSubCount, 0, 0, 0, 0, 0, 0, 0);
 683             RegCloseKey(hKey);
 684         }
 685         if (errCode != ERROR_SUCCESS) dwSubCount = 0;
 686         AddEntryToTree(hwndTV, hItem, Name, NULL, dwSubCount);
 687     }
 688     RegCloseKey(hNewKey);
 689     HeapFree(GetProcessHeap(), 0, Name);
 690
 691 done:
 692     TreeView_SetItemState(hwndTV, hItem, TVIS_EXPANDEDONCE, TVIS_EXPANDEDONCE);
 693     SendMessage(hwndTV, WM_SETREDRAW, TRUE, 0);
 694     SetCursor(hcursorOld);
 695     expanding = FALSE;
 696     HeapFree(GetProcessHeap(), 0, keyPath);
 697
 698     return TRUE;
 699 }
 700
 701 BOOL OnTreeExpanding(HWND hwndTV, NMTREEVIEW* pnmtv)
 702 {
 703     return UpdateExpandingTree(hwndTV, pnmtv->itemNew.hItem, pnmtv->itemNew.state);
 704 }
 705
 706
 707 /*
 708  * CreateTreeView - creates a tree view control.
 709  * Returns the handle to the new control if successful, or NULL otherwise.
 710  * hwndParent - handle to the control's parent window.
 711  */
 712 HWND CreateTreeView(HWND hwndParent, LPTSTR pHostName, UINT id)
 713 {
 714     RECT rcClient;
 715     HWND hwndTV;
 716
 717     /* Get the dimensions of the parent window's client area, and create the tree view control.  */
 718     GetClientRect(hwndParent, &rcClient);
 719     hwndTV = CreateWindowEx(WS_EX_CLIENTEDGE, WC_TREEVIEW, _T("Tree View"),
 720                             WS_VISIBLE | WS_CHILD | WS_TABSTOP | TVS_HASLINES | TVS_HASBUTTONS | TVS_LINESATROOT,
 721                             0, 0, rcClient.right, rcClient.bottom,
 722                             hwndParent, (HMENU)ULongToHandle(id), hInst, NULL);
 723     /* Initialize the image list, and add items to the control.  */
 724     if (!InitTreeViewImageLists(hwndTV) || !InitTreeViewItems(hwndTV, pHostName)) {
 725         DestroyWindow(hwndTV);
 726         return NULL;
 727     }
 728     return hwndTV;
 729 }