implement con_id for matching containers, extend testcase
This commit is contained in:
@ -95,11 +95,14 @@ none { return TOK_NONE; }
|
||||
mode { return TOK_MODE; }
|
||||
tiling { return TOK_TILING; }
|
||||
floating { return TOK_FLOATING; }
|
||||
workspace { return TOK_WORKSPACE; }
|
||||
workspace { BEGIN(WANT_WS_STRING); return TOK_WORKSPACE; }
|
||||
focus { return TOK_FOCUS; }
|
||||
move { return TOK_MOVE; }
|
||||
open { return TOK_OPEN; }
|
||||
|
||||
class { BEGIN(WANT_QSTRING); return TOK_CLASS; }
|
||||
id { BEGIN(WANT_QSTRING); return TOK_ID; }
|
||||
con_id { BEGIN(WANT_QSTRING); return TOK_CON_ID; }
|
||||
|
||||
. { return (int)yytext[0]; }
|
||||
|
||||
|
@ -109,8 +109,11 @@ void parse_cmd(const char *new) {
|
||||
%token TOK_WORKSPACE "workspace"
|
||||
%token TOK_FOCUS "focus"
|
||||
%token TOK_MOVE "move"
|
||||
%token TOK_OPEN "open"
|
||||
|
||||
%token TOK_CLASS "class"
|
||||
%token TOK_ID "id"
|
||||
%token TOK_CON_ID "con_id"
|
||||
|
||||
%token WHITESPACE "<whitespace>"
|
||||
%token STR "<string>"
|
||||
@ -156,9 +159,6 @@ matchstart:
|
||||
/* copy all_cons */
|
||||
Con *con;
|
||||
TAILQ_FOREACH(con, &all_cons, all_cons) {
|
||||
if (con->window == NULL)
|
||||
continue;
|
||||
|
||||
owindow *ow = smalloc(sizeof(owindow));
|
||||
ow->con = con;
|
||||
TAILQ_INSERT_TAIL(&owindows, ow, owindows);
|
||||
@ -184,12 +184,22 @@ matchend:
|
||||
next = TAILQ_NEXT(next, owindows);
|
||||
|
||||
printf("checking if con %p / %s matches\n", current->con, current->con->name);
|
||||
if (match_matches_window(¤t_match, current->con->window)) {
|
||||
printf("matches!\n");
|
||||
TAILQ_INSERT_TAIL(&owindows, current, owindows);
|
||||
if (current_match.con_id != NULL) {
|
||||
if (current_match.con_id == current->con) {
|
||||
printf("matches container!\n");
|
||||
TAILQ_INSERT_TAIL(&owindows, current, owindows);
|
||||
|
||||
}
|
||||
} else {
|
||||
printf("doesnt match\n");
|
||||
free(current);
|
||||
if (current->con->window == NULL)
|
||||
continue;
|
||||
if (match_matches_window(¤t_match, current->con->window)) {
|
||||
printf("matches window!\n");
|
||||
TAILQ_INSERT_TAIL(&owindows, current, owindows);
|
||||
} else {
|
||||
printf("doesnt match\n");
|
||||
free(current);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
@ -206,6 +216,13 @@ criteria:
|
||||
printf("criteria: class = %s\n", $<string>3);
|
||||
current_match.class = $<string>3;
|
||||
}
|
||||
| TOK_CON_ID '=' STR
|
||||
{
|
||||
printf("criteria: id = %s\n", $<string>3);
|
||||
/* TODO: correctly parse number */
|
||||
current_match.con_id = atoi($<string>3);
|
||||
printf("id as int = %d\n", current_match.con_id);
|
||||
}
|
||||
;
|
||||
|
||||
operations:
|
||||
@ -226,9 +243,11 @@ operation:
|
||||
| mode
|
||||
| workspace
|
||||
| move*/
|
||||
| workspace
|
||||
| attach
|
||||
| focus
|
||||
| kill
|
||||
| open
|
||||
;
|
||||
|
||||
exec:
|
||||
@ -265,10 +284,32 @@ kill:
|
||||
owindow *current;
|
||||
|
||||
printf("killing!\n");
|
||||
/* TODO: check if the match is empty, not if the result is empty */
|
||||
if (TAILQ_EMPTY(&owindows))
|
||||
tree_close(focused);
|
||||
else {
|
||||
TAILQ_FOREACH(current, &owindows, owindows) {
|
||||
printf("matching: %p / %s\n", current->con, current->con->name);
|
||||
tree_close(current->con);
|
||||
}
|
||||
}
|
||||
|
||||
}
|
||||
;
|
||||
|
||||
workspace:
|
||||
TOK_WORKSPACE WHITESPACE STR
|
||||
{
|
||||
printf("should switch to workspace %s\n", $<string>3);
|
||||
workspace_show($<string>3);
|
||||
free($<string>3);
|
||||
}
|
||||
;
|
||||
|
||||
open:
|
||||
TOK_OPEN
|
||||
{
|
||||
printf("opening new container\n");
|
||||
tree_open_con(NULL);
|
||||
}
|
||||
;
|
||||
|
@ -114,7 +114,7 @@ IPC_HANDLER(command) {
|
||||
* message_size bytes out of the buffer */
|
||||
char *command = scalloc(message_size);
|
||||
strncpy(command, (const char*)message, message_size);
|
||||
parse_command((const char*)command);
|
||||
parse_cmd((const char*)command);
|
||||
free(command);
|
||||
|
||||
/* For now, every command gets a positive acknowledge
|
||||
|
Reference in New Issue
Block a user