// ClientPattern.cc for Fluxbox Window Manager // Copyright (c) 2003 - 2006 Henrik Kinnunen (fluxgen at fluxbox dot org) // and Simon Bowden (rathnor at users.sourceforge.net) // // Permission is hereby granted, free of charge, to any person obtaining a // copy of this software and associated documentation files (the "Software"), // to deal in the Software without restriction, including without limitation // the rights to use, copy, modify, merge, publish, distribute, sublicense, // and/or sell copies of the Software, and to permit persons to whom the // Software is furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL // THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER // DEALINGS IN THE SOFTWARE. #include "ClientPattern.hh" #include "FocusControl.hh" #include "Layer.hh" #include "Screen.hh" #include "WinClient.hh" #include "Workspace.hh" #include "FbTk/StringUtil.hh" #include "FbTk/App.hh" #include "FbTk/stringstream.hh" // use GNU extensions #ifndef _GNU_SOURCE #define _GNU_SOURCE #endif // _GNU_SOURCE #include #include #include #ifdef HAVE_CSTDIO #include #else #include #endif // needed as well for index on some systems (e.g. solaris) #include using std::string; ClientPattern::ClientPattern(): m_matchlimit(0), m_nummatches(0) {} // parse the given pattern (to end of line) ClientPattern::ClientPattern(const char *str, bool default_no_transient): m_matchlimit(0), m_nummatches(0) { /* A rough grammar of a pattern is: PATTERN ::= MATCH+ LIMIT? MATCH ::= '(' word ')' | '(' propertyname '=' word ')' LIMIT ::= '{' number '}' i.e. one or more match definitions, followed by an optional limit on the number of apps to match to Match definitions are enclosed in parentheses, and if no property name is given, then CLASSNAME is assumed. If no limit is specified, no limit is applied (i.e. limit = infinity) */ bool had_error = false; int pos = 0; string match; int err = 1; // for starting first loop while (!had_error && err > 0) { err = FbTk::StringUtil::getStringBetween(match, str + pos, '(', ')', " \t\n", true); if (err > 0) { // need to determine the property used string memstr, expr; WinProperty prop; string::size_type eq = match.find_first_of('='); if (eq == match.npos) { memstr = match; expr = "[current]"; } else { memstr.assign(match, 0, eq); // memstr = our identifier expr.assign(match, eq+1, match.length()); } bool negate = false; if (!memstr.empty() && memstr[memstr.length()-1] == '!') { negate = true; memstr.assign(memstr, 0, memstr.length()-1); } if (strcasecmp(memstr.c_str(), "name") == 0) { prop = NAME; } else if (strcasecmp(memstr.c_str(), "class") == 0) { prop = CLASS; } else if (strcasecmp(memstr.c_str(), "title") == 0) { prop = TITLE; } else if (strcasecmp(memstr.c_str(), "role") == 0) { prop = ROLE; } else if (strcasecmp(memstr.c_str(), "transient") == 0) { prop = TRANSIENT; default_no_transient = false; } else if (strcasecmp(memstr.c_str(), "maximized") == 0) { prop = MAXIMIZED; } else if (strcasecmp(memstr.c_str(), "minimized") == 0) { prop = MINIMIZED; } else if (strcasecmp(memstr.c_str(), "shaded") == 0) { prop = SHADED; } else if (strcasecmp(memstr.c_str(), "stuck") == 0) { prop = STUCK; } else if (strcasecmp(memstr.c_str(), "focushidden") == 0) { prop = FOCUSHIDDEN; } else if (strcasecmp(memstr.c_str(), "iconhidden") == 0) { prop = ICONHIDDEN; } else if (strcasecmp(memstr.c_str(), "workspace") == 0) { prop = WORKSPACE; } else if (strcasecmp(memstr.c_str(), "workspacename") == 0) { prop = WORKSPACENAME; } else if (strcasecmp(memstr.c_str(), "head") == 0) { prop = HEAD; } else if (strcasecmp(memstr.c_str(), "layer") == 0) { prop = LAYER; } else { prop = NAME; expr = match; } had_error = !addTerm(expr, prop, negate); pos += err; } } if (pos == 0 && !had_error) { // no match terms given, this is not allowed had_error = true; } if (default_no_transient) had_error = !addTerm("no", TRANSIENT); if (!had_error) { // otherwise, we check for a number string number; err = FbTk::StringUtil::getStringBetween(number, str+pos, '{', '}'); if (err > 0) { FbTk_istringstream iss(number.c_str()); iss >> m_matchlimit; pos+=err; } // we don't care if there isn't one // there shouldn't be anything else on the line match = str + pos; size_t uerr;// need a special type here uerr = match.find_first_not_of(" \t\n", pos); if (uerr != match.npos) { // found something, not good had_error = true; } } if (had_error) { // delete all the terms while (!m_terms.empty()) { Term * term = m_terms.back(); delete term; m_terms.pop_back(); } } } ClientPattern::~ClientPattern() { // delete all the terms while (!m_terms.empty()) { delete m_terms.back(); m_terms.pop_back(); } } // return a string representation of this pattern string ClientPattern::toString() const { string pat; Terms::const_iterator it = m_terms.begin(); Terms::const_iterator it_end = m_terms.end(); for (; it != it_end; ++it) { pat.append(" ("); switch ((*it)->prop) { case NAME: pat.append("name="); break; case CLASS: pat.append("class="); break; case TITLE: pat.append("title="); break; case ROLE: pat.append("role="); break; case TRANSIENT: pat.append("transient="); break; case MAXIMIZED: pat.append("maximized="); break; case MINIMIZED: pat.append("minimized="); break; case SHADED: pat.append("shaded="); break; case STUCK: pat.append("stuck="); break; case FOCUSHIDDEN: pat.append("focushidden="); break; case ICONHIDDEN: pat.append("iconhidden="); break; case WORKSPACE: pat.append("workspace="); break; case WORKSPACENAME: pat.append("workspacename="); break; case HEAD: pat.append("head="); break; case LAYER: pat.append("layer="); break; } pat.append((*it)->orig); pat.append(")"); } if (m_matchlimit > 0) { char num[20]; sprintf(num, " {%d}", m_matchlimit); pat.append(num); } return pat; } // does this client match this pattern? bool ClientPattern::match(const Focusable &win) const { if (m_matchlimit != 0 && m_nummatches >= m_matchlimit) return false; // already matched out // regmatch everything // currently, we use an "AND" policy for multiple terms // changing to OR would require minor modifications in this function only Terms::const_iterator it = m_terms.begin(); Terms::const_iterator it_end = m_terms.end(); for (; it != it_end; ++it) { if ((*it)->orig == "[current]") { WinClient *focused = FocusControl::focusedWindow(); if ((*it)->prop == WORKSPACE) { char tmpstr[128]; sprintf(tmpstr, "%d", win.screen().currentWorkspaceID()); if (!(*it)->negate ^ (getProperty((*it)->prop, win) == tmpstr)) return false; } else if ((*it)->prop == WORKSPACENAME) { const Workspace *w = win.screen().currentWorkspace(); if (!w || (!(*it)->negate ^ (getProperty((*it)->prop, win) == w->name()))) return false; } else if (!focused || (!(*it)->negate ^ (getProperty((*it)->prop, win) == getProperty((*it)->prop, *focused)))) return false; } else if ((*it)->prop == HEAD && (*it)->orig == "[mouse]") { int mouse_head = win.screen().getCurrHead(); char num[32]; sprintf(num, "%d", mouse_head); if (!(*it)->negate ^ (getProperty((*it)->prop, win) == num)) return false; } else if (!(*it)->negate ^ (*it)->regexp.match(getProperty((*it)->prop, win))) return false; } return true; } bool ClientPattern::dependsOnFocusedWindow() const { Terms::const_iterator it = m_terms.begin(), it_end = m_terms.end(); for (; it != it_end; ++it) { if ((*it)->prop != WORKSPACE && (*it)->prop != WORKSPACENAME && (*it)->orig == "[current]") return true; } return false; } bool ClientPattern::dependsOnCurrentWorkspace() const { Terms::const_iterator it = m_terms.begin(), it_end = m_terms.end(); for (; it != it_end; ++it) { if (((*it)->prop == WORKSPACE || (*it)->prop == WORKSPACENAME) && (*it)->orig == "[current]") return true; } return false; } // add an expression to match against // The first argument is a regular expression, the second is the member // function that we wish to match against. bool ClientPattern::addTerm(const string &str, WinProperty prop, bool negate) { Term *term = new Term(str, true); term->orig = str; term->prop = prop; term->negate = negate; if (term->regexp.error()) { delete term; return false; } m_terms.push_back(term); return true; } string ClientPattern::getProperty(WinProperty prop, const Focusable &client) { // we need this for some of the window properties const FluxboxWindow *fbwin = client.fbwindow(); switch (prop) { case TITLE: return client.title(); break; case CLASS: return client.getWMClassClass(); break; case NAME: return client.getWMClassName(); break; case ROLE: return client.getWMRole(); break; case TRANSIENT: return client.isTransient() ? "yes" : "no"; break; case MAXIMIZED: return (fbwin && fbwin->isMaximized()) ? "yes" : "no"; break; case MINIMIZED: return (fbwin && fbwin->isIconic()) ? "yes" : "no"; break; case SHADED: return (fbwin && fbwin->isShaded()) ? "yes" : "no"; break; case STUCK: return (fbwin && fbwin->isStuck()) ? "yes" : "no"; break; case FOCUSHIDDEN: return (fbwin && fbwin->isFocusHidden()) ? "yes" : "no"; break; case ICONHIDDEN: return (fbwin && fbwin->isIconHidden()) ? "yes" : "no"; break; case WORKSPACE: { if (!fbwin) return ""; char tmpstr[128]; sprintf(tmpstr, "%d", fbwin->workspaceNumber()); return std::string(tmpstr); break; } case WORKSPACENAME: { if (!fbwin) return ""; const Workspace *w = client.screen().getWorkspace(fbwin->workspaceNumber()); return w ? w->name() : ""; break; } case HEAD: { if (!fbwin) return ""; int head = client.screen().getHead(fbwin->fbWindow()); char tmpstr[128]; sprintf(tmpstr, "%d", head); return std::string(tmpstr); break; } case LAYER: return fbwin ? ::Layer::getString(fbwin->layerNum()) : ""; break; } return client.getWMClassName(); } bool ClientPattern::operator ==(const ClientPattern &pat) const { // we require the terms to be identical (order too) Terms::const_iterator it = m_terms.begin(); Terms::const_iterator it_end = m_terms.end(); Terms::const_iterator other_it = pat.m_terms.begin(); Terms::const_iterator other_it_end = pat.m_terms.end(); for (; it != it_end && other_it != other_it_end; ++it, ++other_it) { if ((*it)->orig != (*other_it)->orig || (*it)->negate != (*other_it)->negate) return false; } if (it != it_end || other_it != other_it_end) return false; return true; }