tree.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685
  1. /*
  2. * OleView (tree.c)
  3. *
  4. * Copyright 2006 Piotr Caban
  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. #include "main.h"
  21. TREE tree;
  22. static const WCHAR wszCLSID[] = { 'C','L','S','I','D','\\','\0' };
  23. static const WCHAR wszInProcServer32[] =
  24. { 'I','n','P','r','o','c','S','e','r','v','e','r','3','2','\0' };
  25. static const WCHAR wszOle32dll[] = { 'o','l','e','3','2','.','d','l','l','\0' };
  26. static const WCHAR wszOleAut32dll[] =
  27. { 'o','l','e','a','u','t','3','2','.','d','l','l','\0' };
  28. static const WCHAR wszImplementedCategories[] =
  29. { 'I','m','p','l','e','m','e','n','t','e','d',' ',
  30. 'C','a','t','e','g','o','r','i','e','s','\0' };
  31. static const WCHAR wszAppID[] = { 'A','p','p','I','D','\\','\0' };
  32. static const WCHAR wszTypeLib[] = { 'T','y','p','e','L','i','b','\\','\0' };
  33. static const WCHAR wszInterface[] = { 'I','n','t','e','r','f','a','c','e','\\','\0' };
  34. static const WCHAR wszComponentCategories[] = { 'C','o','m','p','o','n','e','n','t',
  35. ' ','C','a','t','e','g','o','r','i','e','s','\\','\0' };
  36. static const WCHAR wszGetPath[] = { '0','\\','w','i','n','3','2','\0' };
  37. static LPARAM CreateITEM_INFO(INT flag, const WCHAR *info, const WCHAR *clsid, const WCHAR *path)
  38. {
  39. ITEM_INFO *reg;
  40. reg = HeapAlloc(GetProcessHeap(), HEAP_ZERO_MEMORY, sizeof(ITEM_INFO));
  41. reg->cFlag = flag;
  42. lstrcpyW(reg->info, info);
  43. if(clsid) lstrcpyW(reg->clsid, clsid);
  44. if(path) lstrcpyW(reg->path, path);
  45. return (LPARAM)reg;
  46. }
  47. void CreateInst(HTREEITEM item, WCHAR *wszMachineName)
  48. {
  49. TVITEMW tvi;
  50. HTREEITEM hCur;
  51. TVINSERTSTRUCTW tvis;
  52. WCHAR wszTitle[MAX_LOAD_STRING];
  53. WCHAR wszMessage[MAX_LOAD_STRING];
  54. WCHAR wszFlagName[MAX_LOAD_STRING];
  55. WCHAR wszTreeName[MAX_LOAD_STRING];
  56. WCHAR wszRegPath[MAX_LOAD_STRING];
  57. const WCHAR wszFormat[] = { '\n','%','s',' ','(','$','%','x',')','\n','\0' };
  58. CLSID clsid;
  59. COSERVERINFO remoteInfo;
  60. MULTI_QI qi;
  61. IUnknown *obj, *unk;
  62. HRESULT hRes;
  63. memset(&tvi, 0, sizeof(TVITEMW));
  64. tvi.mask = TVIF_TEXT;
  65. tvi.hItem = item;
  66. tvi.cchTextMax = MAX_LOAD_STRING;
  67. tvi.pszText = wszTreeName;
  68. memset(&tvis, 0, sizeof(TVINSERTSTRUCTW));
  69. U(tvis).item.mask = TVIF_TEXT|TVIF_PARAM;
  70. U(tvis).item.cchTextMax = MAX_LOAD_STRING;
  71. tvis.hInsertAfter = TVI_FIRST;
  72. U(tvis).item.pszText = tvi.pszText;
  73. tvis.hParent = item;
  74. tvis.hInsertAfter = TVI_LAST;
  75. if (!SendMessageW(globals.hTree, TVM_GETITEMW, 0, (LPARAM)&tvi)) return;
  76. if(!tvi.lParam || ((ITEM_INFO *)tvi.lParam)->loaded
  77. || !(((ITEM_INFO *)tvi.lParam)->cFlag&SHOWALL)) return;
  78. if(FAILED(CLSIDFromString(((ITEM_INFO *)tvi.lParam)->clsid, &clsid))) return;
  79. if(wszMachineName)
  80. {
  81. remoteInfo.dwReserved1 = 0;
  82. remoteInfo.dwReserved2 = 0;
  83. remoteInfo.pAuthInfo = NULL;
  84. remoteInfo.pwszName = wszMachineName;
  85. qi.pIID = &IID_IUnknown;
  86. CoCreateInstanceEx(&clsid, NULL, globals.dwClsCtx|CLSCTX_REMOTE_SERVER,
  87. &remoteInfo, 1, &qi);
  88. hRes = qi.hr;
  89. obj = qi.pItf;
  90. }
  91. else hRes = CoCreateInstance(&clsid, NULL, globals.dwClsCtx,
  92. &IID_IUnknown, (void **)&obj);
  93. if(FAILED(hRes))
  94. {
  95. LoadStringW(globals.hMainInst, IDS_CGCOFAIL, wszMessage, ARRAY_SIZE(wszMessage));
  96. LoadStringW(globals.hMainInst, IDS_ABOUT, wszTitle, ARRAY_SIZE(wszTitle));
  97. #define CASE_ERR(i) case i: \
  98. MultiByteToWideChar(CP_ACP, 0, #i, -1, wszFlagName, MAX_LOAD_STRING); \
  99. break
  100. switch(hRes)
  101. {
  102. CASE_ERR(REGDB_E_CLASSNOTREG);
  103. CASE_ERR(E_NOINTERFACE);
  104. CASE_ERR(REGDB_E_READREGDB);
  105. CASE_ERR(REGDB_E_KEYMISSING);
  106. CASE_ERR(CO_E_DLLNOTFOUND);
  107. CASE_ERR(CO_E_APPNOTFOUND);
  108. CASE_ERR(E_ACCESSDENIED);
  109. CASE_ERR(CO_E_ERRORINDLL);
  110. CASE_ERR(CO_E_APPDIDNTREG);
  111. CASE_ERR(CLASS_E_CLASSNOTAVAILABLE);
  112. default:
  113. LoadStringW(globals.hMainInst, IDS_ERROR_UNKN, wszFlagName, ARRAY_SIZE(wszFlagName));
  114. }
  115. wsprintfW(&wszMessage[lstrlenW(wszMessage)], wszFormat,
  116. wszFlagName, (unsigned)hRes);
  117. MessageBoxW(globals.hMainWnd, wszMessage, wszTitle, MB_OK|MB_ICONEXCLAMATION);
  118. return;
  119. }
  120. ((ITEM_INFO *)tvi.lParam)->loaded = 1;
  121. ((ITEM_INFO *)tvi.lParam)->pU = obj;
  122. tvi.mask = TVIF_STATE;
  123. tvi.state = TVIS_BOLD;
  124. tvi.stateMask = TVIS_BOLD;
  125. SendMessageW(globals.hTree, TVM_SETITEMW, 0, (LPARAM)&tvi);
  126. tvi.mask = TVIF_TEXT;
  127. hCur = (HTREEITEM)SendMessageW(globals.hTree, TVM_GETNEXTITEM,
  128. TVGN_CHILD, (LPARAM)tree.hI);
  129. while(hCur)
  130. {
  131. tvi.hItem = hCur;
  132. if(!SendMessageW(globals.hTree, TVM_GETITEMW, 0, (LPARAM)&tvi) || !tvi.lParam)
  133. {
  134. hCur = (HTREEITEM)SendMessageW(globals.hTree, TVM_GETNEXTITEM,
  135. TVGN_NEXT, (LPARAM)hCur);
  136. continue;
  137. }
  138. CLSIDFromString(((ITEM_INFO *)tvi.lParam)->clsid, &clsid);
  139. hRes = IUnknown_QueryInterface(obj, &clsid, (void *)&unk);
  140. if(SUCCEEDED(hRes))
  141. {
  142. IUnknown_Release(unk);
  143. lstrcpyW(wszRegPath, wszInterface);
  144. lstrcpyW(&wszRegPath[lstrlenW(wszRegPath)], ((ITEM_INFO *)tvi.lParam)->clsid);
  145. U(tvis).item.lParam = CreateITEM_INFO(REGTOP|INTERFACE|REGPATH,
  146. wszRegPath, ((ITEM_INFO *)tvi.lParam)->clsid, NULL);
  147. SendMessageW(globals.hTree, TVM_INSERTITEMW, 0, (LPARAM)&tvis);
  148. }
  149. hCur = (HTREEITEM)SendMessageW(globals.hTree, TVM_GETNEXTITEM,
  150. TVGN_NEXT, (LPARAM)hCur);
  151. }
  152. RefreshMenu(item);
  153. RefreshDetails(item);
  154. }
  155. void ReleaseInst(HTREEITEM item)
  156. {
  157. TVITEMW tvi;
  158. HTREEITEM cur;
  159. IUnknown *pU;
  160. memset(&tvi, 0, sizeof(TVITEMW));
  161. tvi.hItem = item;
  162. if(!SendMessageW(globals.hTree, TVM_GETITEMW, 0, (LPARAM)&tvi) || !tvi.lParam) return;
  163. pU = ((ITEM_INFO *)tvi.lParam)->pU;
  164. if(pU) IUnknown_Release(pU);
  165. ((ITEM_INFO *)tvi.lParam)->loaded = 0;
  166. SendMessageW(globals.hTree, TVM_EXPAND, TVE_COLLAPSE, (LPARAM)item);
  167. cur = (HTREEITEM)SendMessageW(globals.hTree, TVM_GETNEXTITEM,
  168. TVGN_CHILD, (LPARAM)item);
  169. while(cur)
  170. {
  171. SendMessageW(globals.hTree, TVM_DELETEITEM, 0, (LPARAM)cur);
  172. cur = (HTREEITEM)SendMessageW(globals.hTree, TVM_GETNEXTITEM,
  173. TVGN_CHILD, (LPARAM)item);
  174. }
  175. tvi.mask = TVIF_CHILDREN|TVIF_STATE;
  176. tvi.state = 0;
  177. tvi.stateMask = TVIS_BOLD;
  178. tvi.cChildren = 1;
  179. SendMessageW(globals.hTree, TVM_SETITEMW, 0, (LPARAM)&tvi);
  180. }
  181. BOOL CreateRegPath(HTREEITEM item, WCHAR *buffer, int bufSize)
  182. {
  183. TVITEMW tvi;
  184. int bufLen;
  185. BOOL ret = FALSE;
  186. memset(buffer, 0, bufSize * sizeof(WCHAR));
  187. memset(&tvi, 0, sizeof(TVITEMW));
  188. tvi.hItem = item;
  189. if (SendMessageW(globals.hTree, TVM_GETITEMW, 0, (LPARAM)&tvi))
  190. ret = (tvi.lParam && ((ITEM_INFO *)tvi.lParam)->cFlag & REGPATH);
  191. while(TRUE)
  192. {
  193. if(!SendMessageW(globals.hTree, TVM_GETITEMW, 0, (LPARAM)&tvi)) break;
  194. if(tvi.lParam && (((ITEM_INFO *)tvi.lParam)->cFlag & (REGPATH|REGTOP)))
  195. {
  196. bufLen = lstrlenW(((ITEM_INFO *)tvi.lParam)->info);
  197. memmove(&buffer[bufLen], buffer, (bufSize - bufLen) * sizeof(WCHAR));
  198. memcpy(buffer, ((ITEM_INFO *)tvi.lParam)->info, bufLen * sizeof(WCHAR));
  199. }
  200. if(tvi.lParam && ((ITEM_INFO *)tvi.lParam)->cFlag & REGTOP) break;
  201. if(!tvi.lParam) return FALSE;
  202. tvi.hItem = (HTREEITEM)SendMessageW(globals.hTree, TVM_GETNEXTITEM,
  203. TVGN_PARENT, (LPARAM)tvi.hItem);
  204. }
  205. return ret;
  206. }
  207. static void AddCOMandAll(void)
  208. {
  209. TVINSERTSTRUCTW tvis;
  210. TVITEMW tvi;
  211. HTREEITEM curSearch;
  212. HKEY hKey, hCurKey, hInfo;
  213. WCHAR valName[MAX_LOAD_STRING];
  214. WCHAR buffer[MAX_LOAD_STRING];
  215. WCHAR wszComp[MAX_LOAD_STRING];
  216. LONG lenBuffer;
  217. int i=-1;
  218. memset(&tvi, 0, sizeof(TVITEMW));
  219. U(tvis).item.mask = TVIF_TEXT|TVIF_PARAM|TVIF_CHILDREN;
  220. U(tvis).item.cchTextMax = MAX_LOAD_STRING;
  221. U(tvis).item.cChildren = 1;
  222. tvis.hInsertAfter = TVI_FIRST;
  223. if(RegOpenKeyW(HKEY_CLASSES_ROOT, wszCLSID, &hKey) != ERROR_SUCCESS) return;
  224. while(TRUE)
  225. {
  226. i++;
  227. if(RegEnumKeyW(hKey, i, valName, ARRAY_SIZE(valName)) != ERROR_SUCCESS) break;
  228. if(RegOpenKeyW(hKey, valName, &hCurKey) != ERROR_SUCCESS) continue;
  229. lenBuffer = sizeof(WCHAR[MAX_LOAD_STRING]);
  230. tvis.hParent = tree.hAO;
  231. if(RegOpenKeyW(hCurKey, wszInProcServer32, &hInfo) == ERROR_SUCCESS)
  232. {
  233. if(RegQueryValueW(hInfo, NULL, buffer, &lenBuffer) == ERROR_SUCCESS
  234. && *buffer)
  235. if(!memcmp(buffer, wszOle32dll, sizeof(WCHAR[9]))
  236. ||!memcmp(buffer, wszOleAut32dll, sizeof(WCHAR[12])))
  237. tvis.hParent = tree.hCLO;
  238. RegCloseKey(hInfo);
  239. }
  240. lenBuffer = sizeof(WCHAR[MAX_LOAD_STRING]);
  241. if(RegQueryValueW(hCurKey, NULL, buffer, &lenBuffer) == ERROR_SUCCESS && *buffer)
  242. U(tvis).item.pszText = buffer;
  243. else U(tvis).item.pszText = valName;
  244. U(tvis).item.lParam = CreateITEM_INFO(REGPATH|SHOWALL, valName, valName, NULL);
  245. if(tvis.hParent) SendMessageW(globals.hTree, TVM_INSERTITEMW, 0, (LPARAM)&tvis);
  246. if(RegOpenKeyW(hCurKey, wszImplementedCategories, &hInfo) == ERROR_SUCCESS)
  247. {
  248. if(RegEnumKeyW(hInfo, 0, wszComp, ARRAY_SIZE(wszComp)) != ERROR_SUCCESS) break;
  249. RegCloseKey(hInfo);
  250. if(tree.hGBCC) curSearch = (HTREEITEM)SendMessageW(globals.hTree,
  251. TVM_GETNEXTITEM, TVGN_CHILD, (LPARAM)tree.hGBCC);
  252. else curSearch = (HTREEITEM)SendMessageW(globals.hTree,
  253. TVM_GETNEXTITEM, TVGN_CHILD, (LPARAM)TVI_ROOT);
  254. while(curSearch)
  255. {
  256. tvi.hItem = curSearch;
  257. if(!SendMessageW(globals.hTree, TVM_GETITEMW, 0, (LPARAM)&tvi)) break;
  258. if(tvi.lParam && !lstrcmpW(((ITEM_INFO *)tvi.lParam)->info, wszComp))
  259. {
  260. tvis.hParent = curSearch;
  261. memmove(&valName[6], valName, sizeof(WCHAR[MAX_LOAD_STRING-6]));
  262. memmove(valName, wszCLSID, sizeof(WCHAR[6]));
  263. U(tvis).item.lParam = CreateITEM_INFO(REGTOP|REGPATH|SHOWALL,
  264. valName, &valName[6], NULL);
  265. SendMessageW(globals.hTree, TVM_INSERTITEMW, 0, (LPARAM)&tvis);
  266. break;
  267. }
  268. curSearch = (HTREEITEM)SendMessageW(globals.hTree,
  269. TVM_GETNEXTITEM, TVGN_NEXT, (LPARAM)curSearch);
  270. }
  271. }
  272. RegCloseKey(hCurKey);
  273. }
  274. RegCloseKey(hKey);
  275. SendMessageW(globals.hTree, TVM_SORTCHILDREN, FALSE, (LPARAM)tree.hCLO);
  276. SendMessageW(globals.hTree, TVM_SORTCHILDREN, FALSE, (LPARAM)tree.hAO);
  277. }
  278. static void AddApplicationID(void)
  279. {
  280. TVINSERTSTRUCTW tvis;
  281. HKEY hKey, hCurKey;
  282. WCHAR valName[MAX_LOAD_STRING];
  283. WCHAR buffer[MAX_LOAD_STRING];
  284. LONG lenBuffer;
  285. int i=-1;
  286. U(tvis).item.mask = TVIF_TEXT|TVIF_PARAM;
  287. U(tvis).item.cchTextMax = MAX_LOAD_STRING;
  288. tvis.hInsertAfter = TVI_FIRST;
  289. tvis.hParent = tree.hAID;
  290. if(RegOpenKeyW(HKEY_CLASSES_ROOT, wszAppID, &hKey) != ERROR_SUCCESS) return;
  291. while(TRUE)
  292. {
  293. i++;
  294. if(RegEnumKeyW(hKey, i, valName, ARRAY_SIZE(valName)) != ERROR_SUCCESS) break;
  295. if(RegOpenKeyW(hKey, valName, &hCurKey) != ERROR_SUCCESS) continue;
  296. lenBuffer = sizeof(WCHAR[MAX_LOAD_STRING]);
  297. if(RegQueryValueW(hCurKey, NULL, buffer, &lenBuffer) == ERROR_SUCCESS && *buffer)
  298. U(tvis).item.pszText = buffer;
  299. else U(tvis).item.pszText = valName;
  300. RegCloseKey(hCurKey);
  301. U(tvis).item.lParam = CreateITEM_INFO(REGPATH, valName, valName, NULL);
  302. SendMessageW(globals.hTree, TVM_INSERTITEMW, 0, (LPARAM)&tvis);
  303. }
  304. RegCloseKey(hKey);
  305. SendMessageW(globals.hTree, TVM_SORTCHILDREN, FALSE, (LPARAM)tree.hAID);
  306. }
  307. static void AddTypeLib(void)
  308. {
  309. TVINSERTSTRUCTW tvis;
  310. HKEY hKey, hCurKey, hInfoKey, hPath;
  311. WCHAR valName[MAX_LOAD_STRING];
  312. WCHAR valParent[MAX_LOAD_STRING];
  313. WCHAR buffer[MAX_LOAD_STRING];
  314. WCHAR wszVer[MAX_LOAD_STRING];
  315. WCHAR wszPath[MAX_LOAD_STRING];
  316. const WCHAR wszFormat[] = { ' ','(','%','s',' ','%','s',')','\0' };
  317. const WCHAR wszFormat2[] = { '%','s','\\','%','s','\0' };
  318. LONG lenBuffer;
  319. int i=-1, j;
  320. U(tvis).item.mask = TVIF_TEXT|TVIF_PARAM;
  321. U(tvis).item.cchTextMax = MAX_LOAD_STRING;
  322. tvis.hInsertAfter = TVI_FIRST;
  323. tvis.hParent = tree.hTL;
  324. if(RegOpenKeyW(HKEY_CLASSES_ROOT, wszTypeLib, &hKey) != ERROR_SUCCESS) return;
  325. while(TRUE)
  326. {
  327. i++;
  328. if(RegEnumKeyW(hKey, i, valParent, ARRAY_SIZE(valParent)) != ERROR_SUCCESS) break;
  329. if(RegOpenKeyW(hKey, valParent, &hCurKey) != ERROR_SUCCESS) continue;
  330. j = -1;
  331. while(TRUE)
  332. {
  333. j++;
  334. if(RegEnumKeyW(hCurKey, j, valName, ARRAY_SIZE(valName)) != ERROR_SUCCESS) break;
  335. if(RegOpenKeyW(hCurKey, valName, &hInfoKey) != ERROR_SUCCESS) continue;
  336. lenBuffer = sizeof(WCHAR[MAX_LOAD_STRING]);
  337. if(RegQueryValueW(hInfoKey, NULL, buffer, &lenBuffer) == ERROR_SUCCESS
  338. && *buffer)
  339. {
  340. LoadStringW(globals.hMainInst, IDS_TL_VER, wszVer, ARRAY_SIZE(wszVer));
  341. wsprintfW(&buffer[lstrlenW(buffer)], wszFormat, wszVer, valName);
  342. U(tvis).item.pszText = buffer;
  343. lenBuffer = MAX_LOAD_STRING;
  344. RegOpenKeyW(hInfoKey, wszGetPath, &hPath);
  345. RegQueryValueW(hPath, NULL, wszPath, &lenBuffer);
  346. RegCloseKey(hPath);
  347. }
  348. else U(tvis).item.pszText = valName;
  349. RegCloseKey(hInfoKey);
  350. wsprintfW(wszVer, wszFormat2, valParent, valName);
  351. U(tvis).item.lParam = CreateITEM_INFO(REGPATH, wszVer, valParent, wszPath);
  352. SendMessageW(globals.hTree, TVM_INSERTITEMW, 0, (LPARAM)&tvis);
  353. }
  354. RegCloseKey(hCurKey);
  355. }
  356. RegCloseKey(hKey);
  357. SendMessageW(globals.hTree, TVM_SORTCHILDREN, FALSE, (LPARAM)tree.hTL);
  358. }
  359. static void AddInterfaces(void)
  360. {
  361. TVINSERTSTRUCTW tvis;
  362. HKEY hKey, hCurKey;
  363. WCHAR valName[MAX_LOAD_STRING];
  364. WCHAR buffer[MAX_LOAD_STRING];
  365. LONG lenBuffer;
  366. int i=-1;
  367. U(tvis).item.mask = TVIF_TEXT|TVIF_PARAM;
  368. U(tvis).item.cchTextMax = MAX_LOAD_STRING;
  369. tvis.hInsertAfter = TVI_FIRST;
  370. tvis.hParent = tree.hI;
  371. if(RegOpenKeyW(HKEY_CLASSES_ROOT, wszInterface, &hKey) != ERROR_SUCCESS) return;
  372. while(TRUE)
  373. {
  374. i++;
  375. if(RegEnumKeyW(hKey, i, valName, ARRAY_SIZE(valName)) != ERROR_SUCCESS) break;
  376. if(RegOpenKeyW(hKey, valName, &hCurKey) != ERROR_SUCCESS) continue;
  377. lenBuffer = sizeof(WCHAR[MAX_LOAD_STRING]);
  378. if(RegQueryValueW(hCurKey, NULL, buffer, &lenBuffer) == ERROR_SUCCESS && *buffer)
  379. U(tvis).item.pszText = buffer;
  380. else U(tvis).item.pszText = valName;
  381. RegCloseKey(hCurKey);
  382. U(tvis).item.lParam = CreateITEM_INFO(REGPATH|INTERFACE, valName, valName, NULL);
  383. SendMessageW(globals.hTree, TVM_INSERTITEMW, 0, (LPARAM)&tvis);
  384. }
  385. RegCloseKey(hKey);
  386. SendMessageW(globals.hTree, TVM_SORTCHILDREN, FALSE, (LPARAM)tree.hI);
  387. }
  388. static void AddComponentCategories(void)
  389. {
  390. TVINSERTSTRUCTW tvis;
  391. HKEY hKey, hCurKey;
  392. WCHAR keyName[MAX_LOAD_STRING];
  393. WCHAR valName[MAX_LOAD_STRING];
  394. WCHAR buffer[MAX_LOAD_STRING];
  395. LONG lenBuffer;
  396. DWORD lenBufferHlp;
  397. DWORD lenValName;
  398. int i=-1;
  399. U(tvis).item.mask = TVIF_TEXT|TVIF_PARAM|TVIF_CHILDREN;
  400. U(tvis).item.cchTextMax = MAX_LOAD_STRING;
  401. tvis.hInsertAfter = TVI_FIRST;
  402. if(tree.hGBCC) tvis.hParent = tree.hGBCC;
  403. else tvis.hParent = TVI_ROOT;
  404. U(tvis).item.cChildren = 1;
  405. if(RegOpenKeyW(HKEY_CLASSES_ROOT, wszComponentCategories, &hKey) != ERROR_SUCCESS)
  406. return;
  407. while(TRUE)
  408. {
  409. i++;
  410. if(RegEnumKeyW(hKey, i, keyName, ARRAY_SIZE(keyName)) != ERROR_SUCCESS) break;
  411. if(RegOpenKeyW(hKey, keyName, &hCurKey) != ERROR_SUCCESS) continue;
  412. lenBuffer = sizeof(WCHAR[MAX_LOAD_STRING]);
  413. lenBufferHlp = sizeof(WCHAR[MAX_LOAD_STRING]);
  414. lenValName = sizeof(WCHAR[MAX_LOAD_STRING]);
  415. if(RegQueryValueW(hCurKey, NULL, buffer, &lenBuffer) == ERROR_SUCCESS && *buffer)
  416. U(tvis).item.pszText = buffer;
  417. else if(RegEnumValueW(hCurKey, 0, valName, &lenValName, NULL, NULL,
  418. (LPBYTE)buffer, &lenBufferHlp) == ERROR_SUCCESS && *buffer)
  419. U(tvis).item.pszText = buffer;
  420. else continue;
  421. RegCloseKey(hCurKey);
  422. U(tvis).item.lParam = CreateITEM_INFO(REGTOP, keyName, keyName, NULL);
  423. SendMessageW(globals.hTree, TVM_INSERTITEMW, 0, (LPARAM)&tvis);
  424. }
  425. RegCloseKey(hKey);
  426. SendMessageW(globals.hTree, TVM_SORTCHILDREN, FALSE, (LPARAM)tree.hGBCC);
  427. }
  428. static void AddBaseEntries(void)
  429. {
  430. TVINSERTSTRUCTW tvis;
  431. WCHAR name[MAX_LOAD_STRING];
  432. U(tvis).item.mask = TVIF_TEXT|TVIF_CHILDREN|TVIF_PARAM;
  433. /* FIXME add TVIF_IMAGE */
  434. U(tvis).item.pszText = name;
  435. U(tvis).item.cchTextMax = MAX_LOAD_STRING;
  436. U(tvis).item.cChildren = 1;
  437. tvis.hInsertAfter = TVI_FIRST;
  438. tvis.hParent = TVI_ROOT;
  439. LoadStringW(globals.hMainInst, IDS_TREE_I, U(tvis).item.pszText,
  440. MAX_LOAD_STRING);
  441. U(tvis).item.lParam = CreateITEM_INFO(REGTOP, wszInterface, NULL, NULL);
  442. tree.hI = TreeView_InsertItemW(globals.hTree, &tvis);
  443. LoadStringW(globals.hMainInst, IDS_TREE_TL, U(tvis).item.pszText,
  444. MAX_LOAD_STRING);
  445. U(tvis).item.lParam = CreateITEM_INFO(REGTOP, wszTypeLib, NULL, NULL);
  446. tree.hTL = TreeView_InsertItemW(globals.hTree, &tvis);
  447. LoadStringW(globals.hMainInst, IDS_TREE_AID, U(tvis).item.pszText,
  448. MAX_LOAD_STRING);
  449. U(tvis).item.lParam = CreateITEM_INFO(REGTOP|REGPATH, wszAppID, NULL, NULL);
  450. tree.hAID = TreeView_InsertItemW(globals.hTree, &tvis);
  451. LoadStringW(globals.hMainInst, IDS_TREE_OC, U(tvis).item.pszText,
  452. MAX_LOAD_STRING);
  453. U(tvis).item.lParam = 0;
  454. tree.hOC = TreeView_InsertItemW(globals.hTree, &tvis);
  455. tvis.hParent = tree.hOC;
  456. LoadStringW(globals.hMainInst, IDS_TREE_AO, U(tvis).item.pszText,
  457. MAX_LOAD_STRING);
  458. U(tvis).item.lParam = CreateITEM_INFO(REGTOP, wszCLSID, NULL, NULL);
  459. tree.hAO = TreeView_InsertItemW(globals.hTree, &tvis);
  460. LoadStringW(globals.hMainInst, IDS_TREE_CLO, U(tvis).item.pszText,
  461. MAX_LOAD_STRING);
  462. tree.hCLO = TreeView_InsertItemW(globals.hTree, &tvis);
  463. LoadStringW(globals.hMainInst, IDS_TREE_O1O, U(tvis).item.pszText,
  464. MAX_LOAD_STRING);
  465. U(tvis).item.lParam = 0;
  466. tree.hO1O = TreeView_InsertItemW(globals.hTree, &tvis);
  467. LoadStringW(globals.hMainInst, IDS_TREE_GBCC, U(tvis).item.pszText,
  468. MAX_LOAD_STRING);
  469. U(tvis).item.lParam = CreateITEM_INFO(REGTOP|REGPATH,
  470. wszComponentCategories, NULL, NULL);
  471. tree.hGBCC = TreeView_InsertItemW(globals.hTree, &tvis);
  472. SendMessageW(globals.hTree, TVM_EXPAND, TVE_EXPAND, (LPARAM)tree.hOC);
  473. }
  474. void EmptyTree(void)
  475. {
  476. SendMessageW(globals.hTree, TVM_DELETEITEM, 0, (LPARAM)TVI_ROOT);
  477. }
  478. void AddTreeEx(void)
  479. {
  480. AddBaseEntries();
  481. AddComponentCategories();
  482. AddCOMandAll();
  483. AddApplicationID();
  484. AddTypeLib();
  485. AddInterfaces();
  486. }
  487. void AddTree(void)
  488. {
  489. memset(&tree, 0, sizeof(TREE));
  490. AddComponentCategories();
  491. AddCOMandAll();
  492. }
  493. static LRESULT CALLBACK TreeProc(HWND hWnd, UINT uMsg, WPARAM wParam, LPARAM lParam)
  494. {
  495. switch(uMsg)
  496. {
  497. case WM_CREATE:
  498. globals.hTree = CreateWindowW(WC_TREEVIEWW, NULL,
  499. WS_CHILD|WS_VISIBLE|TVS_HASLINES|TVS_HASBUTTONS|TVS_LINESATROOT,
  500. 0, 0, 0, 0, hWnd, (HMENU)TREE_WINDOW, globals.hMainInst, NULL);
  501. AddTreeEx();
  502. break;
  503. case WM_NOTIFY:
  504. if((int)wParam != TREE_WINDOW) break;
  505. switch(((LPNMHDR)lParam)->code)
  506. {
  507. case TVN_ITEMEXPANDINGW:
  508. CreateInst(((NMTREEVIEWW *)lParam)->itemNew.hItem, NULL);
  509. break;
  510. case TVN_SELCHANGEDW:
  511. RefreshMenu(((NMTREEVIEWW *)lParam)->itemNew.hItem);
  512. RefreshDetails(((NMTREEVIEWW *)lParam)->itemNew.hItem);
  513. break;
  514. case TVN_DELETEITEMW:
  515. {
  516. NMTREEVIEWW *nm = (NMTREEVIEWW*)lParam;
  517. ITEM_INFO *info = (ITEM_INFO*)nm->itemOld.lParam;
  518. if (info)
  519. {
  520. if (info->loaded)
  521. ReleaseInst(nm->itemOld.hItem);
  522. HeapFree(GetProcessHeap(), 0, info);
  523. }
  524. break;
  525. }
  526. }
  527. break;
  528. case WM_SIZE:
  529. MoveWindow(globals.hTree, 0, 0, LOWORD(lParam), HIWORD(lParam), TRUE);
  530. break;
  531. default:
  532. return DefWindowProcW(hWnd, uMsg, wParam, lParam);
  533. }
  534. return 0;
  535. }
  536. HWND CreateTreeWindow(HINSTANCE hInst)
  537. {
  538. WNDCLASSW wct;
  539. const WCHAR wszTreeClass[] = { 'T','R','E','E','\0' };
  540. memset(&wct, 0, sizeof(WNDCLASSW));
  541. wct.lpfnWndProc = TreeProc;
  542. wct.lpszClassName = wszTreeClass;
  543. wct.hbrBackground = (HBRUSH)(COLOR_WINDOW+1);
  544. wct.hCursor = LoadCursorW(0, (LPCWSTR)IDC_ARROW);
  545. if(!RegisterClassW(&wct)) return NULL;
  546. return CreateWindowExW(WS_EX_CLIENTEDGE, wszTreeClass, NULL, WS_CHILD|WS_VISIBLE,
  547. 0, 0, 0, 0, globals.hPaneWnd, NULL, hInst, NULL);
  548. }