2020-02-10 21:59:51 +08:00
|
|
|
#include "pch.h"
|
|
|
|
#include "util.h"
|
|
|
|
|
2020-04-30 18:16:08 +08:00
|
|
|
#include <common/common.h>
|
2020-02-10 21:59:51 +08:00
|
|
|
#include <common/dpi_aware.h>
|
|
|
|
|
|
|
|
typedef BOOL(WINAPI* GetDpiForMonitorInternalFunc)(HMONITOR, UINT, UINT*, UINT*);
|
|
|
|
UINT GetDpiForMonitor(HMONITOR monitor) noexcept
|
|
|
|
{
|
|
|
|
UINT dpi{};
|
|
|
|
if (wil::unique_hmodule user32{ LoadLibrary(L"user32.dll") })
|
|
|
|
{
|
|
|
|
if (auto func = reinterpret_cast<GetDpiForMonitorInternalFunc>(GetProcAddress(user32.get(), "GetDpiForMonitorInternal")))
|
|
|
|
{
|
|
|
|
func(monitor, 0, &dpi, &dpi);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
if (dpi == 0)
|
|
|
|
{
|
|
|
|
if (wil::unique_hdc hdc{ GetDC(nullptr) })
|
|
|
|
{
|
|
|
|
dpi = GetDeviceCaps(hdc.get(), LOGPIXELSX);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return (dpi == 0) ? DPIAware::DEFAULT_DPI : dpi;
|
|
|
|
}
|
2020-03-25 01:50:26 +08:00
|
|
|
|
|
|
|
void OrderMonitors(std::vector<std::pair<HMONITOR, RECT>>& monitorInfo)
|
|
|
|
{
|
|
|
|
const size_t nMonitors = monitorInfo.size();
|
|
|
|
// blocking[i][j] - whether monitor i blocks monitor j in the ordering, i.e. monitor i should go before monitor j
|
|
|
|
std::vector<std::vector<bool>> blocking(nMonitors, std::vector<bool>(nMonitors, false));
|
|
|
|
|
|
|
|
// blockingCount[j] - the number of monitors which block monitor j
|
|
|
|
std::vector<size_t> blockingCount(nMonitors, 0);
|
|
|
|
|
|
|
|
for (size_t i = 0; i < nMonitors; i++)
|
|
|
|
{
|
|
|
|
RECT rectI = monitorInfo[i].second;
|
|
|
|
for (size_t j = 0; j < nMonitors; j++)
|
|
|
|
{
|
|
|
|
RECT rectJ = monitorInfo[j].second;
|
|
|
|
blocking[i][j] = rectI.top < rectJ.bottom && rectI.left < rectJ.right && i != j;
|
|
|
|
if (blocking[i][j])
|
|
|
|
{
|
|
|
|
blockingCount[j]++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// used[i] - whether the sorting algorithm has used monitor i so far
|
|
|
|
std::vector<bool> used(nMonitors, false);
|
|
|
|
|
|
|
|
// the sorted sequence of monitors
|
|
|
|
std::vector<std::pair<HMONITOR, RECT>> sortedMonitorInfo;
|
|
|
|
|
|
|
|
for (size_t iteration = 0; iteration < nMonitors; iteration++)
|
|
|
|
{
|
|
|
|
// Indices of candidates to become the next monitor in the sequence
|
|
|
|
std::vector<size_t> candidates;
|
|
|
|
|
|
|
|
// First, find indices of all unblocked monitors
|
|
|
|
for (size_t i = 0; i < nMonitors; i++)
|
|
|
|
{
|
|
|
|
if (blockingCount[i] == 0 && !used[i])
|
|
|
|
{
|
|
|
|
candidates.push_back(i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// In the unlikely event that there are no unblocked monitors, declare all unused monitors as candidates.
|
|
|
|
if (candidates.empty())
|
|
|
|
{
|
|
|
|
for (size_t i = 0; i < nMonitors; i++)
|
|
|
|
{
|
|
|
|
if (!used[i])
|
|
|
|
{
|
|
|
|
candidates.push_back(i);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Pick the lexicographically smallest monitor as the next one
|
|
|
|
size_t smallest = candidates[0];
|
|
|
|
for (size_t j = 1; j < candidates.size(); j++)
|
|
|
|
{
|
|
|
|
size_t current = candidates[j];
|
|
|
|
|
|
|
|
// Compare (top, left) lexicographically
|
2020-05-13 01:33:42 +08:00
|
|
|
if (std::tie(monitorInfo[current].second.top, monitorInfo[current].second.left) <
|
|
|
|
std::tie(monitorInfo[smallest].second.top, monitorInfo[smallest].second.left))
|
2020-03-25 01:50:26 +08:00
|
|
|
{
|
|
|
|
smallest = current;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
used[smallest] = true;
|
|
|
|
sortedMonitorInfo.push_back(monitorInfo[smallest]);
|
|
|
|
for (size_t i = 0; i < nMonitors; i++)
|
|
|
|
{
|
|
|
|
if (blocking[smallest][i])
|
|
|
|
{
|
|
|
|
blockingCount[i]--;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
monitorInfo = std::move(sortedMonitorInfo);
|
|
|
|
}
|
2020-04-10 22:09:08 +08:00
|
|
|
|
|
|
|
void SizeWindowToRect(HWND window, RECT rect) noexcept
|
|
|
|
{
|
|
|
|
WINDOWPLACEMENT placement{};
|
|
|
|
::GetWindowPlacement(window, &placement);
|
|
|
|
|
2020-05-13 01:33:42 +08:00
|
|
|
//wait if SW_SHOWMINIMIZED would be removed from window (Issue #1685)
|
2020-04-10 22:09:08 +08:00
|
|
|
for (int i = 0; i < 5 && (placement.showCmd & SW_SHOWMINIMIZED) != 0; i++)
|
|
|
|
{
|
|
|
|
std::this_thread::sleep_for(std::chrono::milliseconds(100));
|
|
|
|
::GetWindowPlacement(window, &placement);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Do not restore minimized windows. We change their placement though so they restore to the correct zone.
|
|
|
|
if ((placement.showCmd & SW_SHOWMINIMIZED) == 0)
|
|
|
|
{
|
|
|
|
placement.showCmd = SW_RESTORE | SW_SHOWNA;
|
|
|
|
}
|
|
|
|
|
2020-05-25 16:15:42 +08:00
|
|
|
// Remove maximized show command to make sure window is moved to the correct zone.
|
|
|
|
if (placement.showCmd & SW_SHOWMAXIMIZED)
|
|
|
|
{
|
|
|
|
placement.showCmd = SW_RESTORE;
|
|
|
|
placement.flags &= ~WPF_RESTORETOMAXIMIZED;
|
|
|
|
}
|
|
|
|
|
2020-04-10 22:09:08 +08:00
|
|
|
placement.rcNormalPosition = rect;
|
|
|
|
placement.flags |= WPF_ASYNCWINDOWPLACEMENT;
|
|
|
|
|
|
|
|
::SetWindowPlacement(window, &placement);
|
|
|
|
// Do it again, allowing Windows to resize the window and set correct scaling
|
|
|
|
// This fixes Issue #365
|
|
|
|
::SetWindowPlacement(window, &placement);
|
|
|
|
}
|
2020-04-30 18:16:08 +08:00
|
|
|
|
|
|
|
bool IsInterestingWindow(HWND window, const std::vector<std::wstring>& excludedApps) noexcept
|
|
|
|
{
|
|
|
|
auto filtered = get_fancyzones_filtered_window(window);
|
|
|
|
if (!filtered.zonable)
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
// Filter out user specified apps
|
|
|
|
CharUpperBuffW(filtered.process_path.data(), (DWORD)filtered.process_path.length());
|
|
|
|
if (find_app_name_in_path(filtered.process_path, excludedApps))
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
2020-05-13 01:33:42 +08:00
|
|
|
if (find_app_name_in_path(filtered.process_path, { L"POWERLAUNCHER.EXE" }))
|
|
|
|
{
|
|
|
|
return false;
|
|
|
|
}
|
2020-04-30 18:16:08 +08:00
|
|
|
return true;
|
|
|
|
}
|