Many hyperlinks are disabled.
Use anonymous login
to enable hyperlinks.
Overview
Comment: | Bugfix [6e8afe516d]: rework of tkBind.c. |
---|---|
Downloads: | Tarball | ZIP archive | SQL archive |
Timelines: | family | ancestors | descendants | both | bug6e8afe516d | tip-532 |
Files: | files | file ages | folders |
SHA3-256: |
67dd75c73160be69a4855394a2179998 |
User & Date: | gcramer 2018-10-21 13:00:53 |
Original Comment: | Bugfix 6e8afe516d: rework of tkBind.c. |
Context
2018-10-22
| ||
12:40 | A few fixes, especially for compile problems with Mac. Some more fixes for Windows will come soon. check-in: 9a4335e7 user: gcramer tags: bug6e8afe516d, tip-532 | |
2018-10-21
| ||
13:00 | Bugfix [6e8afe516d]: rework of tkBind.c. check-in: 67dd75c7 user: gcramer tags: bug6e8afe516d, tip-532 | |
2018-09-08
| ||
17:08 | Fix [6fcaaa6f80]: ttk::entry insertion cursor not visible. Patch from Csaba Nemethi. check-in: 4c6cdfa4 user: fvogel tags: core-8-6-branch | |
Changes
Changes to doc/event.n.
︙ | ︙ | |||
235 236 237 238 239 240 241 | as a path name for a Tk widget or as an integer window identifier. Valid for \fBKeyPress\fR, \fBKeyRelease\fR, \fBButtonPress\fR, \fBButtonRelease\fR, \fBEnter\fR, \fBLeave\fR, and \fBMotion\fR events. Similar to \fB%S\fR substitution for binding scripts. .TP \fB\-time\fI integer\fR \fIInteger\fR must be an integer value; it specifies the \fItime\fR field | | > | 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 | as a path name for a Tk widget or as an integer window identifier. Valid for \fBKeyPress\fR, \fBKeyRelease\fR, \fBButtonPress\fR, \fBButtonRelease\fR, \fBEnter\fR, \fBLeave\fR, and \fBMotion\fR events. Similar to \fB%S\fR substitution for binding scripts. .TP \fB\-time\fI integer\fR \fIInteger\fR must be an integer value; it specifies the \fItime\fR field for the event. Additonally the special value \fBcurrent\fR is allowed, this value will be substituted by the current event time. Valid for \fBKeyPress\fR, \fBKeyRelease\fR, \fBButtonPress\fR, \fBButtonRelease\fR, \fBEnter\fR, \fBLeave\fR, \fBMotion\fR, and \fBProperty\fR events. Corresponds to the \fB%t\fR substitution for binding scripts. .TP \fB\-warp\fI boolean\fR \fIboolean\fR must be a boolean value; it specifies whether |
︙ | ︙ |
Added generic/tkArray.h.
> > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 | /* * tkArray.h -- * * An array is a sequence of items, stored in a contiguous memory region. * Random access to any item is very fast. New items can be either appended * or prepended. An array may be traversed in the forward or backward direction. * * Copyright (c) 2018 by Gregor Cramer. * * See the file "license.terms" for information on usage and redistribution of * this file, and for a DISCLAIMER OF ALL WARRANTIES. */ /* * Note that this file will not be included in header files, it is the purpose * of this file to be included in source files only. Thus we are not using the * prefix "Tk_" here for functions, because all the functions have private scope. */ /* * Use the array in the following way: * ------------------------------------------------------------------------------- * typedef struct { int key, value; } Pair; * TK_PTR_ARRAY_DEFINE(MyArray, Pair); * MyArray *arr = NULL; * if (MyArray_IsEmpty(arr)) { * MyArray_Append(&arr, MakePair(1, 2)); * MyArray_Append(&arr, MakePair(2, 3)); * for (i = 0; i < MyArray_Size(arr); ++i) { * const Pair *p = MyArray_Get(arr, i); * printf("%d -> %d\n", p->key, p->value); * ckfree(p); * } * MyArray_Free(&arr); * assert(arr == NULL); * } * ------------------------------------------------------------------------------- */ /*************************************************************************/ /* * Two array types will be provided: * Use TK_ARRAY_DEFINE if your array is aggregating the elements. Use * TK_PTR_ARRAY_DEFINE if your array contains pointers to elements. But * in latter case the array is not responsible for the lifetime of the * elements. */ /*************************************************************************/ /* * Array_ElemSize: Returns the memory size for one array element. */ /*************************************************************************/ /* * Array_BufferSize: Returns the memory size for given number of elements. */ /*************************************************************************/ /* * Array_IsEmpty: Array is empty? */ /*************************************************************************/ /* * Array_Size: Number of elements in array. */ /*************************************************************************/ /* * Array_Capacity: Capacity of given array. This is the maximal number of * elements fitting into current array memory without resizing the buffer. */ /*************************************************************************/ /* * Array_SetSize: Set array size, new size must not exceed the capacity of * the array. This function has to be used with care when increasing the * array size. */ /*************************************************************************/ /* * Array_First: Returns position of first element in array. Given array * may be NULL. */ /*************************************************************************/ /* * Array_Last: Returns position after last element in array. Given array * may be empty. */ /*************************************************************************/ /* * Array_Front: Returns first element in array. Given array must not be * empty. */ /*************************************************************************/ /* * Array_Back: Returns last element in array. Given array must not be * empty. */ /*************************************************************************/ /* * Array_Resize: Resize buffer of array for given number of elements. The * array may grow or shrink. Note that this function is not initializing * the increased buffer. */ /*************************************************************************/ /* * Array_ResizeAndClear: Resize buffer of array for given number of * elements. The array may grow or shrink. The increased memory will be * filled with zeroes. */ /*************************************************************************/ /* * Array_Clear: Fill specified range with zeroes. */ /*************************************************************************/ /* * Array_Free: Resize array to size zero. This function will release the * array buffer. */ /*************************************************************************/ /* * Array_Append: Insert given element after end of array. */ /*************************************************************************/ /* * Array_PopBack: Shrink array by one element. Given array must not be * empty. */ /*************************************************************************/ /* * Array_Get: Random access to array element at given position. The given * index must not exceed current array size. */ /*************************************************************************/ /* * Array_Set: Replace array element at given position with new value. The * given index must not exceed current array size. */ /*************************************************************************/ /* * Array_Find: Return index position of element which matches given * argument. If not found then -1 will be returned. */ /*************************************************************************/ #ifndef TK_ARRAY_DEFINED #define TK_ARRAY_DEFINED #include <stddef.h> #include <string.h> #include <assert.h> #if defined(__GNUC__) || defined(__clang__) # define __TK_ARRAY_UNUSED __attribute__((unused)) #else # define __TK_ARRAY_UNUSED #endif #define TK_ARRAY_DEFINE(AT, ElemType) /* AT = type of array */ \ /* ------------------------------------------------------------------------- */ \ typedef struct AT { \ size_t size; \ size_t capacity; \ ElemType buf[1]; \ } AT; \ \ __TK_ARRAY_UNUSED \ static size_t \ AT##_ElemSize() \ { \ return sizeof(ElemType); \ } \ \ __TK_ARRAY_UNUSED \ static size_t \ AT##_BufferSize(size_t numElems) \ { \ return numElems*sizeof(ElemType); \ } \ \ __TK_ARRAY_UNUSED \ static int \ AT##_IsEmpty(struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ return !arr || arr->size == 0; \ } \ \ __TK_ARRAY_UNUSED \ static int \ AT##_Size(const struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ return arr ? arr->size : 0; \ } \ \ __TK_ARRAY_UNUSED \ static int \ AT##_Capacity(const struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ return arr ? arr->capacity : 0; \ } \ \ __TK_ARRAY_UNUSED \ static ElemType * \ AT##_First(struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ return arr ? arr->buf : NULL; \ } \ \ __TK_ARRAY_UNUSED \ static ElemType * \ AT##_Last(struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ return arr ? arr->buf + arr->size : NULL; \ } \ \ __TK_ARRAY_UNUSED \ static ElemType * \ AT##_Front(struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ assert(!AT##_IsEmpty(arr)); \ return &arr->buf[0]; \ } \ \ __TK_ARRAY_UNUSED \ static ElemType * \ AT##_Back(struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ assert(!AT##_IsEmpty(arr)); \ return &arr->buf[arr->size - 1]; \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_Resize(struct AT **arrp, size_t newSize) \ { \ assert(arrp); \ assert(!*arrp || (*arrp)->size != 0xdeadbeef); \ if (newSize == 0) { \ assert(!*arrp || ((*arrp)->size = 0xdeadbeef)); \ ckfree(*arrp); \ *arrp = NULL; \ } else { \ int init = *arrp == NULL; \ *arrp = ckrealloc(*arrp, sizeof(AT) + (newSize - 1)*sizeof(ElemType)); \ if (init) { \ (*arrp)->size = 0; \ } else if (newSize < (*arrp)->size) { \ (*arrp)->size = newSize; \ } \ (*arrp)->capacity = newSize; \ } \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_Clear(struct AT *arr, size_t from, size_t to) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ assert(to <= AT##_Size(arr)); \ assert(from <= to); \ memset(arr->buf + from, 0, AT##_BufferSize(to - from)); \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_ResizeAndClear(struct AT **arrp, size_t newSize) \ { \ size_t oldCapacity; \ assert(arrp); \ oldCapacity = *arrp ? (*arrp)->capacity : 0; \ AT##_Resize(arrp, newSize); \ if (newSize > oldCapacity) { \ size_t memSize = AT##_BufferSize(newSize - oldCapacity); \ memset((*arrp)->buf + oldCapacity, 0, memSize); \ } \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_SetSize(struct AT *arr, size_t newSize) \ { \ assert(arr); \ assert(newSize <= AT##_Capacity(arr)); \ assert(!arr || arr->size != 0xdeadbeef); \ arr->size = newSize; \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_Append(struct AT **arrp, ElemType *elem) \ { \ assert(arrp); \ if (!*arrp) { \ AT##_Resize(arrp, 1); \ } else if ((*arrp)->size == (*arrp)->capacity) { \ AT##_Resize(arrp, (*arrp)->capacity + ((*arrp)->capacity + 1)/2); \ } \ (*arrp)->buf[(*arrp)->size++] = *elem; \ } \ \ __TK_ARRAY_UNUSED \ static size_t \ AT##_PopBack(struct AT *arr) \ { \ assert(!AT##_IsEmpty(arr)); \ return arr->size -= 1; \ } \ \ __TK_ARRAY_UNUSED \ static ElemType * \ AT##_Get(struct AT *arr, size_t at) \ { \ assert(at < AT##_Size(arr)); \ return &arr->buf[at]; \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_Set(struct AT *arr, size_t at, ElemType *elem) \ { \ assert(at < AT##_Size(arr)); \ arr->buf[at] = *elem; \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_Free(struct AT **arrp) \ { \ AT##_Resize(arrp, 0); \ } \ /* ------------------------------------------------------------------------- */ #define TK_PTR_ARRAY_DEFINE(AT, ElemType) /* AT = type of array */ \ /* ------------------------------------------------------------------------- */ \ typedef struct AT { \ size_t size; \ size_t capacity; \ ElemType *buf[1]; \ } AT; \ \ __TK_ARRAY_UNUSED \ static size_t \ AT##_ElemSize() \ { \ return sizeof(ElemType); \ } \ \ __TK_ARRAY_UNUSED \ static size_t \ AT##_BufferSize(size_t numElems) \ { \ return numElems*sizeof(ElemType *); \ } \ \ __TK_ARRAY_UNUSED \ static int \ AT##_IsEmpty(struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ return !arr || arr->size == 0; \ } \ \ __TK_ARRAY_UNUSED \ static ElemType ** \ AT##_First(struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ return arr ? arr->buf : NULL; \ } \ \ __TK_ARRAY_UNUSED \ static ElemType ** \ AT##_Last(struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ return arr ? arr->buf + arr->size : NULL; \ } \ \ __TK_ARRAY_UNUSED \ static ElemType * \ AT##_Front(struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ assert(!AT##_IsEmpty(arr)); \ return arr->buf[0]; \ } \ \ __TK_ARRAY_UNUSED \ static ElemType * \ AT##_Back(struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ assert(!AT##_IsEmpty(arr)); \ return arr->buf[arr->size - 1]; \ } \ \ __TK_ARRAY_UNUSED \ static int \ AT##_Size(const struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ return arr ? arr->size : 0; \ } \ \ __TK_ARRAY_UNUSED \ static int \ AT##_Capacity(const struct AT *arr) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ return arr ? arr->capacity : 0; \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_Resize(struct AT **arrp, size_t newCapacity) \ { \ assert(arrp); \ assert(!*arrp || (*arrp)->size != 0xdeadbeef); \ if (newCapacity == 0) { \ assert(!*arrp || ((*arrp)->size = 0xdeadbeef)); \ ckfree(*arrp); \ *arrp = NULL; \ } else { \ int init = *arrp == NULL; \ unsigned memSize = sizeof(AT) + (newCapacity - 1)*sizeof(ElemType *); \ *arrp = ckrealloc(*arrp, memSize); \ if (init) { \ (*arrp)->size = 0; \ } else if (newCapacity < (*arrp)->size) { \ (*arrp)->size = newCapacity; \ } \ (*arrp)->capacity = newCapacity; \ } \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_Clear(struct AT *arr, size_t from, size_t to) \ { \ assert(to <= AT##_Size(arr)); \ assert(from <= to); \ memset(arr->buf + from, 0, PromArr_BufferSize(to - from)); \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_ResizeAndClear(struct AT **arrp, size_t newCapacity) \ { \ size_t oldCapacity; \ assert(arrp); \ oldCapacity = *arrp ? (*arrp)->capacity : 0; \ AT##_Resize(arrp, newCapacity); \ if (newCapacity > oldCapacity) { \ size_t memSize = PromArr_BufferSize(newCapacity - oldCapacity); \ memset((*arrp)->buf + oldCapacity, 0, memSize); \ } \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_SetSize(struct AT *arr, size_t newSize) \ { \ assert(arr); \ assert(newSize <= AT##_Capacity(arr)); \ arr->size = newSize; \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_Append(struct AT **arrp, ElemType *elem) \ { \ assert(arrp); \ if (!*arrp) { \ AT##_Resize(arrp, 1); \ } else if ((*arrp)->size == (*arrp)->capacity) { \ AT##_Resize(arrp, (*arrp)->capacity + ((*arrp)->capacity + 1)/2); \ } \ (*arrp)->buf[(*arrp)->size++] = elem; \ } \ \ __TK_ARRAY_UNUSED \ static size_t \ AT##_PopBack(struct AT *arr) \ { \ assert(!AT##_IsEmpty(arr)); \ return arr->size -= 1; \ } \ \ __TK_ARRAY_UNUSED \ static ElemType * \ AT##_Get(const struct AT *arr, size_t at) \ { \ assert(at < AT##_Size(arr)); \ return arr->buf[at]; \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_Set(struct AT *arr, size_t at, ElemType *elem) \ { \ assert(at < AT##_Size(arr)); \ arr->buf[at] = elem; \ } \ \ __TK_ARRAY_UNUSED \ static void \ AT##_Free(struct AT **arrp) \ { \ AT##_Resize(arrp, 0); \ } \ \ __TK_ARRAY_UNUSED \ static int \ AT##_Find(const struct AT *arr, const ElemType *elem) \ { \ assert(!arr || arr->size != 0xdeadbeef); \ if (arr) { \ ElemType * const * buf = arr->buf; \ size_t i; \ for (i = 0; i < arr->size; ++i) { \ if (buf[i] == elem) { \ return i; \ } \ } \ } \ return -1; \ } \ /* ------------------------------------------------------------------------- */ #endif /* TK_ARRAY_DEFINED */ /* * Local Variables: * mode: c * c-basic-offset: 4 * fill-column: 105 * End: * vi:set ts=8 sw=4: */ |
Changes to generic/tkBind.c.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 | /* * tkBind.c -- * * This file provides functions that associate Tcl commands with X events * or sequences of X events. * * Copyright (c) 1989-1994 The Regents of the University of California. * Copyright (c) 1994-1997 Sun Microsystems, Inc. * Copyright (c) 1998 by Scriptics Corporation. * * See the file "license.terms" for information on usage and redistribution of * this file, and for a DISCLAIMER OF ALL WARRANTIES. */ #include "tkInt.h" #ifdef _WIN32 #include "tkWinInt.h" #elif defined(MAC_OSX_TK) #include "tkMacOSXInt.h" #else #include "tkUnixInt.h" #endif /* * File structure: * * Structure definitions and static variables. * * Init/Free this package. * | > > > > > > > > > > > > > > > > > > > > > > > > > > > > | < > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | < > | < < < < > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | | | | < < < < < < | | < < < < | | < < < < > | > | < | | < | < < < | < | | < | < | | | | < | | | | > | < | < | | < | | | > > > > > > > > | > > > | > | < < > | | | < | < | < > | | | | < | | > | | < | | < < < < < < < < < < < < < | | | < < > > | | | > > | > | > > > > > | > | < | < < < | < | < | < | < | | | > > | | | < < < < < < < < | | < | < | < | < | < | | | | | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 | /* * tkBind.c -- * * This file provides functions that associate Tcl commands with X events * or sequences of X events. * * Copyright (c) 1989-1994 The Regents of the University of California. * Copyright (c) 1994-1997 Sun Microsystems, Inc. * Copyright (c) 1998 by Scriptics Corporation. * Copyright (c) 2018 by Gregor Cramer. * * See the file "license.terms" for information on usage and redistribution of * this file, and for a DISCLAIMER OF ALL WARRANTIES. */ #include "tkInt.h" #include "tkDList.h" #include "tkArray.h" #ifdef _WIN32 #include "tkWinInt.h" #elif defined(MAC_OSX_TK) #include "tkMacOSXInt.h" #else #include "tkUnixInt.h" #endif #include <assert.h> #if NDEBUG # define DEBUG(expr) #else # define DEBUG(expr) expr #endif #ifdef _MSC_VER /* * Earlier versions of MSVC don't know snprintf, but _snprintf is compatible. * Note that sprintf is deprecated. */ # define snprintf _snprintf #endif #define SIZE_OF_ARRAY(arr) sizeof(arr)/sizeof(arr[0]) /* * Simple boolean type support. */ #define bool int enum { true = (bool) 1, false = (bool) 0 }; /* * File structure: * * Structure definitions and static variables. * * Init/Free this package. * * Tcl "bind" command (actually located in tkCmds.c) core implementation, plus helpers. * * Tcl "event" command implementation, plus helpers. * * Package-specific common helpers. * * Non-package-specific helpers. */ /* * In old implementation <Double-1> and <1><1> are equivalent sequences. This is not logical, * in my opinion <Double-1> should have higher precedence, but we will keep the new implementation * conform. If the decision about this point will change then PREFER_MOST_SPECIALIZED_EVENT * should be set to 1. */ #ifndef PREFER_MOST_SPECIALIZED_EVENT # define PREFER_MOST_SPECIALIZED_EVENT 0 #endif /* * Traditionally motion events can be combined with buttons in this way: <B1-B2-Motion>. * I think it should be allowed to express this as <Motion-1-2>. The latter syntax form * is already implemented, but still commented out. */ #ifndef SUPPORT_ADDITIONAL_MOTION_SYNTAX # define SUPPORT_ADDITIONAL_MOTION_SYNTAX 0 /* set to 1 if wanted */ #endif #ifndef PRINT_SHORT_MOTION_SYNTAX # define PRINT_SHORT_MOTION_SYNTAX 0 /* set to 1 if wanted */ #endif #if !SUPPORT_ADDITIONAL_MOTION_SYNTAX # undef PRINT_SHORT_MOTION_SYNTAX # define PRINT_SHORT_MOTION_SYNTAX 0 #endif /* * For debugging only, normally set to zero. */ #ifdef SUPPORT_DEBUGGING # undef SUPPORT_DEBUGGING #endif #define SUPPORT_DEBUGGING 0 /* * The following union is used to hold the detail information from an XEvent * (including Tk's XVirtualEvent extension). */ typedef union { unsigned long info; /* This either corresponds to xkey.keycode, or to xbutton.button, * or is meaningless, depending on event type. */ Tk_Uid name; /* Tk_Uid of virtual event. */ } Detail; /* * We need an extended event definition. */ typedef struct { XEvent xev; /* The original event from server. */ Detail detail; /* Additional information (for hashing). */ unsigned countAny; /* Count of multi-events, like multi-clicks, or repeated key pressing, * this count does not depend on detail (keySym or button). */ unsigned countDetailed; /* Count of multi-events, like multi-clicks, or repeated key pressing, * this count considers the detail (keySym or button). */ } Event; /* * We need a structure providing a list of pattern sequences. */ struct PatSeq; /* forward declaration */ typedef struct PSEntry { TK_DLIST_LINKS(PSEntry); /* Makes this struct a double linked list; must be first entry. */ struct PatSeq* psPtr; /* Pointer to pattern sequence. */ Window window; /* Window of last match. */ unsigned expired:1; /* Whether this entry is expired, this means it has to be removed * from promotion list. */ unsigned isNew:1; /* Whether this entry is recently created. */ } PSEntry; TK_DLIST_DEFINE(PSList, PSEntry);/* defining the whole PSList_* stuff (list of PSEntry items) */ /* * Maps and lookup tables from an event to a list of patterns that match that event. */ typedef struct { Tcl_HashTable patternTable; /* Keys are PatternTableKey structs, values are (PatSeq *). */ Tcl_HashTable listTable; /* Keys are PatternTableKey structs, values are (PSList *). */ PSList entryPool; /* Contains free (unused) list items. */ unsigned number; /* Needed for enumeration of pattern sequences. */ } LookupTables; /* * The structure below represents a binding table. A binding table represents * a domain in which event bindings may occur. It includes a space of objects * relative to which events occur (usually windows, but not always), a history * of recent events in the domain, and a set of mappings that associate * particular Tcl commands with sequences of events in the domain. Multiple * binding tables may exist at once, either because there are multiple * applications open, or because there are multiple domains within an * application with separate event bindings for each (for example, each canvas * widget has a separate binding table for associating events with the items * in the canvas). */ /* defining the whole Promotion_* stuff (array of PSList entries) */ TK_ARRAY_DEFINE(PromArr, PSList); typedef struct Tk_BindingTable_ { Event eventInfo[TK_LASTEVENT]; /* Containing the most recent event for every event type. */ PromArr *promArr; /* Contains the promoted pattern sequences. */ Event *curEvent; /* Pointing to most recent event. */ unsigned long curModStateMask; /* Containing the current modifier mask. */ LookupTables lookupTables; /* Containing hash tables for fast lookup. */ Tcl_HashTable objectTable; /* Used to map from an object to a list of patterns associated with * that object. Keys are ClientData, values are (PatSeq *). */ Tcl_Interp *interp; /* Interpreter in which commands are executed. */ } BindingTable; /* * The following structure represents virtual event table. A virtual event * table provides a way to map from platform-specific physical events such as * button clicks or key presses to virtual events such as <<Paste>>, * <<Close>>, or <<ScrollWindow>>. * * A virtual event is usually never part of the event stream, but instead is * synthesized inline by matching low-level events. However, a virtual event * may be generated by platform-specific code or by Tcl commands. In that case, * no lookup of the virtual event will need to be done using this table, * because the virtual event is actually in the event stream. */ typedef struct { LookupTables lookupTables; /* Providing fast lookup tables to lists of pattern sequences. */ Tcl_HashTable nameTable; /* Used to map a virtual event name to the array of physical events * that can trigger it. Keys are the Tk_Uid names of the virtual * events, values are PhysOwned structs. */ } VirtualEventTable; /* * The following structure is used as a key in a patternTable for both binding * tables and a virtual event tables. * * In a binding table, the object field corresponds to the binding tag for the * widget whose bindings are being accessed. * * In a virtual event table, the object field is always NULL. Virtual events * are a global definiton and are not tied to a particular binding tag. * * The same key is used for both types of pattern tables so that the helper * functions that traverse and match patterns will work for both binding * tables and virtual event tables. */ typedef struct { ClientData object; /* For binding table, identifies the binding tag of the object * (or class of objects) relative to which the event occurred. * For virtual event table, always NULL. */ unsigned type; /* Type of event (from X). */ Detail detail; /* Additional information, such as keysym, button, Tk_Uid, or zero * if nothing additional. */ } PatternTableKey; /* * The following structure defines a pattern, which is matched against X * events as part of the process of converting X events into Tcl commands. */ typedef struct { unsigned eventType; /* Type of X event, e.g. ButtonPress. */ unsigned long modStateMask; /* Mask of modifiers that must be present (zero means no modifiers * are required). */ unsigned count; /* Multi-event count, e.g. double-clicks, triple-clicks, etc. */ unsigned long info; /* Additional information that must match event. Normally this is zero, * meaning no additional information must match. For KeyPress and * KeyRelease events, it may be specified to select a particular * keystroke (zero means any keystrokes). For button events, specifies * a particular button (zero means any buttons are OK). */ Tk_Uid name; /* Specifies the Tk_Uid of the virtual event name. NULL if not a * virtual event. */ } TkPattern; /* * The following structure keeps track of all the virtual events that are * associated with a particular physical event. It is pointed to by the 'owners' * field in a PatSeq in the patternTable of a virtual event table. */ TK_PTR_ARRAY_DEFINE(VirtOwners, Tcl_HashEntry); /* define array of hash entries */ /* * The following structure defines a pattern sequence, which consists of one * or more patterns. In order to trigger, a pattern sequence must match the * most recent X events (first pattern to most recent event, next pattern to * next event, and so on). It is used as the hash value in a patternTable for * both binding tables and virtual event tables. * * In a binding table, it is the sequence of physical events that make up a * binding for an object. * * In a virtual event table, it is the sequence of physical events that define * a virtual event. * * The same structure is used for both types of pattern tables so that the * helper functions that traverse and match patterns will work for both * binding tables and virtual event tables. */ typedef struct PatSeq { unsigned numPats; /* Number of patterns in sequence (usually 1). */ unsigned count; /* Total number of repetition counts, summed over count in TkPattern. */ unsigned number; /* Needed for the decision whether a binding is later than another, * it is guaranteed that the most recently bound event has the * highest number. */ bool added; /* Is this pattern sequence already added to lookup table? */ char *script; /* Binding script to evaluate when sequence matches (ckalloc()ed) */ Tcl_Obj* object; /* Token for object with which binding is associated. For virtual * event table this is NULL. */ struct PatSeq *nextSeqPtr; /* Next in list of all pattern sequences that have the same initial * pattern. NULL means end of list. */ Tcl_HashEntry *hPtr; /* Pointer to hash table entry for the initial pattern. This is the * head of the list of which nextSeqPtr forms a part. */ union { VirtOwners *owners; /* In a binding table it has no meaning. In a virtual event table, * identifies the array of virtual events that can be triggered * by this event. */ struct PatSeq *nextObj; /* In a binding table, next in list of all pattern sequences for * the same object (NULL for end of list). Needed to implement * Tk_DeleteAllBindings. In a virtual event table it has no meaning. */ } ptr; DEBUG(bool owned); /* For debugging purposes. */ TkPattern pats[1]; /* Array of "numPats" patterns. Only one element is declared here * but in actuality enough space will be allocated for "numPats" * patterns (but usually 1). */ } PatSeq; /* * Constants that define how close together two events must be in milliseconds * or pixels to meet the PAT_NEARBY constraint: */ #define NEARBY_PIXELS 5 #define NEARBY_MS 500 /* * Constants for access to appropriate slot container. */ #define PRESS 0 /* for ButtonPress */ #define RELEASE 1 /* for ButtonRelease */ #define PRESSED 2 /* for MotionNotify */ /* * Constant for any (non-zero) button. */ #define ALL_BUTTONS_MASK (Button1Mask|Button2Mask|Button3Mask|Button4Mask|Button5Mask) /* * Needed as "no-number" constant for integers. The value of this constant is * outside of integer range (type "int"). (Unfortunatly current version of * Tcl/Tk does not support C99 integer support.) */ #define NO_NUMBER (((Tcl_WideUInt) 1) << (8*sizeof(Tcl_WideInt) - 1)) /* * The following structure is used in the nameTable of a virtual event table * to associate a virtual event with all the physical events that can trigger * it. */ TK_PTR_ARRAY_DEFINE(PhysOwned, PatSeq); /* define array of pattern seqs */ /* * One of the following structures exists for each interpreter. This structure * keeps track of the current display and screen in the interpreter, so that a * command can be invoked whenever the display/screen changes (the command does * things like point tk::Priv at a display-specific structure). */ typedef struct { TkDisplay *curDispPtr; /* Display for last binding command invoked in this application. */ int curScreenIndex; /* Index of screen for last binding command */ unsigned bindingDepth; /* Number of active instances of Tk_BindEvent in this application. */ } ScreenInfo; /* * The following structure keeps track of all the information local to the * binding package on a per interpreter basis. */ typedef struct TkBindInfo_ { VirtualEventTable virtualEventTable; /* The virtual events that exist in this interpreter. */ ScreenInfo screenInfo; /* Keeps track of the current display and screen, so it can be * restored after a binding has executed. */ bool deleted; /* True if the application has been deleted but the structure has been * preserved. */ Time lastEventTime; /* Needed for time measurement. */ Time lastCurrentTime; /* Needed for time measurement. */ } BindInfo; /* * In X11R4 and earlier versions, XStringToKeysym is ridiculously slow. The * data structure and hash table below, along with the code that uses them, * implement a fast mapping from strings to keysyms. In X11R5 and later * releases XStringToKeysym is plenty fast so this stuff isn't needed. The * #define REDO_KEYSYM_LOOKUP is normally undefined, so that XStringToKeysym * gets used. It can be set in the Makefile to enable the use of the hash * table below. */ #ifdef REDO_KEYSYM_LOOKUP typedef struct { const char *name; /* Name of keysym. */ KeySym value; /* Numeric identifier for keysym. */ } KeySymInfo; static const KeySymInfo keyArray[] = { #ifndef lint #include "ks_names.h" #endif {NULL, 0} }; static Tcl_HashTable keySymTable; /* keyArray hashed by keysym value. */ static Tcl_HashTable nameTable; /* keyArray hashed by keysym name. */ #endif /* REDO_KEYSYM_LOOKUP */ /* * A hash table is kept to map from the string names of event modifiers to * information about those modifiers. The structure for storing this * information, and the hash table built at initialization time, are defined * below. */ typedef struct { const char *name; /* Name of modifier. */ unsigned mask; /* Button/modifier mask value, such as Button1Mask. */ unsigned flags; /* Various flags; see below for definitions. */ } ModInfo; /* * Flags for ModInfo structures: * * DOUBLE - Non-zero means duplicate this event, e.g. for double-clicks. * TRIPLE - Non-zero means triplicate this event, e.g. for triple-clicks. * QUADRUPLE - Non-zero means quadruple this event, e.g. for 4-fold-clicks. * MULT_CLICKS - Combination of all of above. */ #define DOUBLE (1<<0) #define TRIPLE (1<<1) #define QUADRUPLE (1<<2) #define MULT_CLICKS (DOUBLE|TRIPLE|QUADRUPLE) static const ModInfo modArray[] = { {"Control", ControlMask, 0}, {"Shift", ShiftMask, 0}, {"Lock", LockMask, 0}, {"Meta", META_MASK, 0}, {"M", META_MASK, 0}, |
︙ | ︙ | |||
399 400 401 402 403 404 405 | * This module also keeps a hash table mapping from event names to information * about those events. The structure, an array to use to initialize the hash * table, and the hash table are all defined below. */ typedef struct { const char *name; /* Name of event. */ | | | < | < | < | 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 | * This module also keeps a hash table mapping from event names to information * about those events. The structure, an array to use to initialize the hash * table, and the hash table are all defined below. */ typedef struct { const char *name; /* Name of event. */ unsigned type; /* Event type for X, such as ButtonPress. */ unsigned eventMask; /* Mask bits (for XSelectInput) for this event type. */ } EventInfo; /* * Note: some of the masks below are an OR-ed combination of several masks. * This is necessary because X doesn't report up events unless you also ask * for down events. Also, X doesn't report button state in motion events * unless you've asked about button events. */ static const EventInfo eventArray[] = { {"Key", KeyPress, KeyPressMask}, {"KeyPress", KeyPress, KeyPressMask}, {"KeyRelease", KeyRelease, KeyPressMask|KeyReleaseMask}, {"Button", ButtonPress, ButtonPressMask}, {"ButtonPress", ButtonPress, ButtonPressMask}, {"ButtonRelease", ButtonRelease, ButtonPressMask|ButtonReleaseMask}, {"Motion", MotionNotify, ButtonPressMask|PointerMotionMask}, {"Enter", EnterNotify, EnterWindowMask}, {"Leave", LeaveNotify, LeaveWindowMask}, {"FocusIn", FocusIn, FocusChangeMask}, {"FocusOut", FocusOut, FocusChangeMask}, {"Expose", Expose, ExposureMask}, {"Visibility", VisibilityNotify, VisibilityChangeMask}, {"Destroy", DestroyNotify, StructureNotifyMask}, |
︙ | ︙ | |||
448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 | {"Create", CreateNotify, SubstructureNotifyMask}, {"MapRequest", MapRequest, SubstructureRedirectMask}, {"ResizeRequest", ResizeRequest, ResizeRedirectMask}, {NULL, 0, 0} }; static Tcl_HashTable eventTable; /* * The defines and table below are used to classify events into various * groups. The reason for this is that logically identical fields (e.g. * "state") appear at different places in different types of events. The * classification masks can be used to figure out quickly where to extract * information from events. */ | > > | | | | | | | | | | | | | | | | | | | | | | | | 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 | {"Create", CreateNotify, SubstructureNotifyMask}, {"MapRequest", MapRequest, SubstructureRedirectMask}, {"ResizeRequest", ResizeRequest, ResizeRedirectMask}, {NULL, 0, 0} }; static Tcl_HashTable eventTable; static int eventArrayIndex[TK_LASTEVENT]; /* * The defines and table below are used to classify events into various * groups. The reason for this is that logically identical fields (e.g. * "state") appear at different places in different types of events. The * classification masks can be used to figure out quickly where to extract * information from events. */ #define KEY (1<<0) #define BUTTON (1<<1) #define MOTION (1<<2) #define CROSSING (1<<3) #define FOCUS (1<<4) #define EXPOSE (1<<5) #define VISIBILITY (1<<6) #define CREATE (1<<7) #define DESTROY (1<<8) #define UNMAP (1<<9) #define MAP (1<<10) #define REPARENT (1<<11) #define CONFIG (1<<12) #define GRAVITY (1<<13) #define CIRC (1<<14) #define PROP (1<<15) #define COLORMAP (1<<16) #define VIRTUAL (1<<17) #define ACTIVATE (1<<18) #define MAPREQ (1<<19) #define CONFIGREQ (1<<20) #define RESIZEREQ (1<<21) #define CIRCREQ (1<<22) #define KEY_BUTTON_MOTION_VIRTUAL (KEY|BUTTON|MOTION|VIRTUAL) #define KEY_BUTTON_MOTION_CROSSING (KEY|BUTTON|MOTION|VIRTUAL|CROSSING) static const int flagArray[TK_LASTEVENT] = { /* Not used */ 0, /* Not used */ 0, |
︙ | ︙ | |||
531 532 533 534 535 536 537 | /* * The following table is used to map between the location where an generated * event should be queued and the string used to specify the location. */ static const TkStateMap queuePosition[] = { | | | | | | | 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 | /* * The following table is used to map between the location where an generated * event should be queued and the string used to specify the location. */ static const TkStateMap queuePosition[] = { {-1, "now"}, {TCL_QUEUE_HEAD, "head"}, {TCL_QUEUE_MARK, "mark"}, {TCL_QUEUE_TAIL, "tail"}, {-2, NULL} }; /* * The following tables are used as a two-way map between X's internal numeric * values for fields in an XEvent and the strings used in Tcl. The tables are * used both when constructing an XEvent from user input and when providing * data from an XEvent to the user. |
︙ | ︙ | |||
566 567 568 569 570 571 572 | {NotifyPointer, "NotifyPointer"}, {NotifyPointerRoot, "NotifyPointerRoot"}, {NotifyDetailNone, "NotifyDetailNone"}, {-1, NULL} }; static const TkStateMap circPlace[] = { | | | | | | | | | | < | < | | < | | < | | < | | | < | | | | | < | < < > | | | < | > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 | {NotifyPointer, "NotifyPointer"}, {NotifyPointerRoot, "NotifyPointerRoot"}, {NotifyDetailNone, "NotifyDetailNone"}, {-1, NULL} }; static const TkStateMap circPlace[] = { {PlaceOnTop, "PlaceOnTop"}, {PlaceOnBottom, "PlaceOnBottom"}, {-1, NULL} }; static const TkStateMap visNotify[] = { {VisibilityUnobscured, "VisibilityUnobscured"}, {VisibilityPartiallyObscured, "VisibilityPartiallyObscured"}, {VisibilityFullyObscured, "VisibilityFullyObscured"}, {-1, NULL} }; static const TkStateMap configureRequestDetail[] = { {None, "None"}, {Above, "Above"}, {Below, "Below"}, {BottomIf, "BottomIf"}, {TopIf, "TopIf"}, {Opposite, "Opposite"}, {-1, NULL} }; static const TkStateMap propNotify[] = { {PropertyNewValue, "NewValue"}, {PropertyDelete, "Delete"}, {-1, NULL} }; /* * Prototypes for local functions defined in this file: */ static void ChangeScreen(Tcl_Interp *interp, char *dispName, int screenIndex); static bool CreateVirtualEvent(Tcl_Interp *interp, VirtualEventTable *vetPtr, char *virtString, const char *eventString); static int DeleteVirtualEvent(Tcl_Interp *interp, VirtualEventTable *vetPtr, char *virtString, const char *eventString); static void DeleteVirtualEventTable(VirtualEventTable *vetPtr); static void ExpandPercents(TkWindow *winPtr, const char *before, Event *eventPtr, unsigned scriptCount, Tcl_DString *dsPtr); static PatSeq * FindSequence(Tcl_Interp *interp, LookupTables *lookupTables, ClientData object, const char *eventString, bool create, bool allowVirtual, unsigned long *maskPtr); static void GetAllVirtualEvents(Tcl_Interp *interp, VirtualEventTable *vetPtr); static const char * GetField(const char *p, char *copy, unsigned size); static Tcl_Obj * GetPatternObj(const PatSeq *psPtr); static int GetVirtualEvent(Tcl_Interp *interp, VirtualEventTable *vetPtr, Tcl_Obj *virtName); static Tk_Uid GetVirtualEventUid(Tcl_Interp *interp, char *virtString); static int HandleEventGenerate(Tcl_Interp *interp, Tk_Window main, int objc, Tcl_Obj *const objv[]); static void InitVirtualEventTable(VirtualEventTable *vetPtr); static PatSeq * MatchPatterns(TkDisplay *dispPtr, Tk_BindingTable bindPtr, PSList *psList, PSList *psSuccList, unsigned patIndex, const Event *eventPtr, ClientData object, PatSeq **physPtrPtr); static bool NameToWindow(Tcl_Interp *interp, Tk_Window main, Tcl_Obj *objPtr, Tk_Window *tkwinPtr); static unsigned ParseEventDescription(Tcl_Interp *interp, const char **eventStringPtr, TkPattern *patPtr, unsigned long *eventMaskPtr); static void DoWarp(ClientData clientData); static PSList * GetLookupForEvent(LookupTables* lookupPtr, const Event *eventPtr, Tcl_Obj *object, bool onlyConsiderDetailedEvents); static void ClearLookupTable(LookupTables *lookupTables, ClientData object); static void ClearPromotionLists(Tk_BindingTable bindPtr, ClientData object); static PSEntry * MakeListEntry(PSList *pool, PatSeq *psPtr); static void RemovePatSeqFromLookup(LookupTables *lookupTables, PatSeq *psPtr); static void RemovePatSeqFromPromotionLists(Tk_BindingTable bindPtr, PatSeq *psPtr); static PatSeq * DeletePatSeq(PatSeq *psPtr); static void InsertPatSeq(LookupTables *lookupTables, PatSeq *psPtr); /* * Some useful helper functions. */ #ifdef SUPPORT_DEBUGGING static int N = 0; #endif static unsigned Max(unsigned a, unsigned b) { return a < b ? b : a; } static int Abs(int n) { return n < 0 ? -n : n; } static bool IsOdd(int n) { return n & 1; } static const char* SkipSpaces( const char* s) { assert(s); while (isspace(UCHAR(*s))) ++s; return s; } static const char* SkipFieldDelims( const char* s) { assert(s); while (*s == '-' || isspace(UCHAR(*s))) { ++s; } return s; } static unsigned GetButtonNumber( const char *field) { assert(field); if (field[0] >= '1' && field[0] <= '5' && field[1] == '\0') { return field[0] - '0'; } return 0; } static Time CurrentTimeInMilliSecs() { Tcl_Time now; Tcl_GetTime(&now); return ((Time) now.sec)*1000 + ((Time) now.usec)/1000; } #if PREFER_MOST_SPECIALIZED_EVENT static unsigned GetCount( const PatSeq *psPtr, unsigned index) { assert(psPtr); assert(psPtr->numPats >= 1); assert(index < psPtr->numPats); return psPtr->pats[index].count; } #endif static bool MatchEventNearby( const XEvent *lhs, const XEvent *rhs) { assert(lhs); assert(rhs); assert(lhs->type == ButtonPress || lhs->type == ButtonRelease || lhs->type == MotionNotify); assert(lhs->type == rhs->type); /* assert: lhs->xbutton.time <= rhs->xbutton.time */ return rhs->xbutton.time - lhs->xbutton.time <= NEARBY_MS && Abs(rhs->xbutton.x_root - lhs->xbutton.x_root) <= NEARBY_PIXELS && Abs(rhs->xbutton.y_root - lhs->xbutton.y_root) <= NEARBY_PIXELS; } static void FreePatSeq( PatSeq *psPtr) { assert(psPtr); assert(!psPtr->owned); DEBUG(psPtr->added = 0xdeadbeef); ckfree(psPtr->script); if (!psPtr->object) { VirtOwners_Free(&psPtr->ptr.owners); } ckfree(psPtr); } static void RemoveListEntry( PSList *pool, PSEntry *psEntry) { assert(pool); assert(psEntry); PSList_Remove(psEntry); PSList_Append(pool, psEntry); } static void ClearList( PSList *psList, PSList *pool, ClientData object) { assert(psList); assert(pool); if (object) { PSEntry *psEntry; PSEntry *psNext; for (psEntry = PSList_First(psList); psEntry; psEntry = psNext) { psNext = PSList_Next(psEntry); if (psEntry->psPtr->object == object) { RemoveListEntry(pool, psEntry); } } } else { PSList_Move(pool, psList); } } static unsigned ResolveModifiers( TkDisplay *dispPtr, unsigned modMask) { assert(dispPtr); if (dispPtr->metaModMask) { if (modMask & META_MASK) { modMask |= dispPtr->metaModMask; modMask &= ~META_MASK; } } if (dispPtr->altModMask) { if (modMask & ALT_MASK) { modMask |= dispPtr->altModMask; modMask &= ~ALT_MASK; } } return modMask; } static unsigned ButtonNumberFromState( unsigned state) { if (!(state & ALL_BUTTONS_MASK)) { return 0; } if (state & Button1Mask) { return 1; } if (state & Button2Mask) { return 2; } if (state & Button3Mask) { return 3; } if (state & Button4Mask) { return 4; } return 5; } #if SUPPORT_ADDITIONAL_MOTION_SYNTAX static unsigned ButtonNumberToMask( unsigned button) { assert(button > 0); return Button1Mask << (button - 1); } #endif static void SetupPatternKey( PatternTableKey *key, const PatSeq *psPtr) { const TkPattern *patPtr; assert(key); assert(psPtr); patPtr = psPtr->pats; key->object = psPtr->object; key->type = patPtr->eventType; key->detail.name = patPtr->name; if (patPtr->info) { key->detail.info = patPtr->info; } } /* *-------------------------------------------------------------- * * MakeListEntry -- * * Makes new entry item for lookup table. We are using a * pool of items, this avoids superfluous memory allocation/ * deallocation. * * Results: * New entry item. * * Side effects: * Memory allocated. * *-------------------------------------------------------------- */ static PSEntry * MakeListEntry( PSList *pool, PatSeq *psPtr) { PSEntry *newEntry = NULL; assert(pool); assert(psPtr); assert(psPtr->added != 0xdeadbeef); if (PSList_IsEmpty(pool)) { newEntry = ckalloc(sizeof(PSEntry)); } else { newEntry = PSList_First(pool); PSList_RemoveHead(pool); } newEntry->psPtr = psPtr; newEntry->window = None; newEntry->expired = false; newEntry->isNew = true; DEBUG(psPtr->owned = false); return newEntry; } /* *-------------------------------------------------------------- * * GetLookupForEvent -- * * Get specific pattern sequence table for given event. * * Results: * Specific pattern sequence table for given event. * * Side effects: * None. * *-------------------------------------------------------------- */ static PSList * GetLookupForEvent( LookupTables* lookupTables, const Event *eventPtr, Tcl_Obj *object, bool onlyConsiderDetailedEvents) { PatternTableKey key; Tcl_HashEntry *hPtr; assert(lookupTables); assert(eventPtr); key.detail.name = NULL; key.detail.info = 0; if (onlyConsiderDetailedEvents) { switch (eventPtr->xev.type) { case ButtonPress: case ButtonRelease: key.detail.info = eventPtr->xev.xbutton.button; break; case MotionNotify: key.detail.info = ButtonNumberFromState(eventPtr->xev.xmotion.state); break; case KeyPress: case KeyRelease: key.detail.info = eventPtr->detail.info; break; case VirtualEvent: key.detail.name = eventPtr->detail.name; break; } if (!key.detail.name) { return NULL; } } key.object = object; key.type = eventPtr->xev.type; hPtr = Tcl_FindHashEntry(&lookupTables->listTable, (char *) &key); return hPtr ? Tcl_GetHashValue(hPtr) : NULL; } /* *-------------------------------------------------------------- * * ClearLookupTable -- * * Clear lookup table in given binding table, but only those * bindings associated to given object. If object is NULL * then remove all entries. * * Results: * None. * * Side effects: * None. * *-------------------------------------------------------------- */ static void ClearLookupTable( LookupTables *lookupTables, ClientData object) { Tcl_HashSearch search; Tcl_HashEntry *hPtr; Tcl_HashEntry *nextPtr; PSList *pool = &lookupTables->entryPool; assert(lookupTables); for (hPtr = Tcl_FirstHashEntry(&lookupTables->listTable, &search); hPtr; hPtr = nextPtr) { PSList *psList; nextPtr = Tcl_NextHashEntry(&search); if (object) { const PatternTableKey *key = Tcl_GetHashKey(&lookupTables->listTable, hPtr); if (key->object != object) { continue; } Tcl_DeleteHashEntry(hPtr); } psList = Tcl_GetHashValue(hPtr); PSList_Move(pool, psList); ckfree(psList); } } /* *-------------------------------------------------------------- * * ClearPromotionLists -- * * Clear all the lists holding the promoted pattern * sequences, which belongs to given object. If object * is NULL then remove all patterns. * * Results: * None. * * Side effects: * None. * *-------------------------------------------------------------- */ static void ClearPromotionLists( Tk_BindingTable bindPtr, ClientData object) { unsigned newArraySize = 0; unsigned i; assert(bindPtr); for (i = 0; i < PromArr_Size(bindPtr->promArr); ++i) { PSList *psList = PromArr_Get(bindPtr->promArr, i); ClearList(psList, &bindPtr->lookupTables.entryPool, object); if (!PSList_IsEmpty(psList)) { newArraySize = Max(newArraySize, i + 1); } } PromArr_SetSize(bindPtr->promArr, newArraySize); } /* *--------------------------------------------------------------------------- * * TkBindInit -- * * This function is called when an application is created. It initializes |
︙ | ︙ | |||
658 659 660 661 662 663 664 665 666 | *--------------------------------------------------------------------------- */ void TkBindInit( TkMainInfo *mainPtr) /* The newly created application. */ { BindInfo *bindInfoPtr; | > > > > | | > | > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | > | | < > > > > > > > > > > > | | > | | > > | 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 | *--------------------------------------------------------------------------- */ void TkBindInit( TkMainInfo *mainPtr) /* The newly created application. */ { TCL_DECLARE_MUTEX(bindMutex); static bool initialized = false; BindInfo *bindInfoPtr; assert(mainPtr); /* otherwise virtual events can't be supported */ assert(sizeof(XEvent) >= sizeof(XVirtualEvent)); /* type of TkPattern.info is well defined? */ assert(sizeof(unsigned long) >= sizeof(KeySym)); /* ensure that our matching algorithm is working (when testing detail) */ assert(sizeof(Detail) == sizeof(Tk_Uid)); /* test expected indices of Button1..Button5, otherwise our button handling is not working */ assert(Button1 == 1 && Button2 == 2 && Button3 == 3 && Button4 == 4 && Button5 == 5); assert(Button2Mask == (Button1Mask << 1)); assert(Button2Mask == (Button1Mask << 2)); assert(Button3Mask == (Button1Mask << 3)); assert(Button4Mask == (Button1Mask << 4)); assert(Button5Mask == (Button1Mask << 5)); /* test expected values of button motion masks, otherwise our button handling is not working */ assert(Button1MotionMask == Button1Mask); assert(Button2MotionMask == Button2Mask); assert(Button3MotionMask == Button3Mask); assert(Button4MotionMask == Button4Mask); assert(Button5MotionMask == Button5Mask); /* because we expect zero if keySym is empty */ assert(NoSymbol == 0L); /* we use some constraints about X*Event */ assert(Tk_Offset(XButtonEvent, time) == Tk_Offset(XMotionEvent, time)); assert(Tk_Offset(XButtonEvent, x_root) == Tk_Offset(XMotionEvent, x_root)); assert(Tk_Offset(XButtonEvent, y_root) == Tk_Offset(XMotionEvent, y_root)); assert(Tk_Offset(XCreateWindowEvent, border_width) == Tk_Offset(XConfigureEvent, border_width)); assert(Tk_Offset(XCreateWindowEvent, width) == Tk_Offset(XConfigureEvent, width)); assert(Tk_Offset(XCreateWindowEvent, window) == Tk_Offset(XCirculateRequestEvent, window)); assert(Tk_Offset(XCreateWindowEvent, window) == Tk_Offset(XConfigureEvent, window)); assert(Tk_Offset(XCreateWindowEvent, window) == Tk_Offset(XGravityEvent, window)); assert(Tk_Offset(XCreateWindowEvent, window) == Tk_Offset(XMapEvent, window)); assert(Tk_Offset(XCreateWindowEvent, window) == Tk_Offset(XReparentEvent, window)); assert(Tk_Offset(XCreateWindowEvent, window) == Tk_Offset(XUnmapEvent, window)); assert(Tk_Offset(XCreateWindowEvent, x) == Tk_Offset(XConfigureEvent, x)); assert(Tk_Offset(XCreateWindowEvent, x) == Tk_Offset(XGravityEvent, x)); assert(Tk_Offset(XCreateWindowEvent, y) == Tk_Offset(XConfigureEvent, y)); assert(Tk_Offset(XCreateWindowEvent, y) == Tk_Offset(XGravityEvent, y)); assert(Tk_Offset(XKeyEvent, root) == Tk_Offset(XButtonEvent, root)); assert(Tk_Offset(XKeyEvent, root) == Tk_Offset(XCrossingEvent, root)); assert(Tk_Offset(XKeyEvent, root) == Tk_Offset(XMotionEvent, root)); assert(Tk_Offset(XKeyEvent, state) == Tk_Offset(XButtonEvent, state)); assert(Tk_Offset(XKeyEvent, state) == Tk_Offset(XMotionEvent, state)); assert(Tk_Offset(XKeyEvent, subwindow) == Tk_Offset(XButtonEvent, subwindow)); assert(Tk_Offset(XKeyEvent, subwindow) == Tk_Offset(XCrossingEvent, subwindow)); assert(Tk_Offset(XKeyEvent, subwindow) == Tk_Offset(XMotionEvent, subwindow)); assert(Tk_Offset(XKeyEvent, time) == Tk_Offset(XButtonEvent, time)); assert(Tk_Offset(XKeyEvent, time) == Tk_Offset(XCrossingEvent, time)); assert(Tk_Offset(XKeyEvent, time) == Tk_Offset(XMotionEvent, time)); assert(Tk_Offset(XKeyEvent, x) == Tk_Offset(XButtonEvent, x)); assert(Tk_Offset(XKeyEvent, x) == Tk_Offset(XCrossingEvent, x)); assert(Tk_Offset(XKeyEvent, x) == Tk_Offset(XMotionEvent, x)); assert(Tk_Offset(XKeyEvent, x_root) == Tk_Offset(XButtonEvent, x_root)); assert(Tk_Offset(XKeyEvent, x_root) == Tk_Offset(XCrossingEvent, x_root)); assert(Tk_Offset(XKeyEvent, x_root) == Tk_Offset(XMotionEvent, x_root)); assert(Tk_Offset(XKeyEvent, y) == Tk_Offset(XButtonEvent, y)); assert(Tk_Offset(XKeyEvent, y) == Tk_Offset(XCrossingEvent, y)); assert(Tk_Offset(XKeyEvent, y) == Tk_Offset(XMotionEvent, y)); assert(Tk_Offset(XKeyEvent, y_root) == Tk_Offset(XButtonEvent, y_root)); assert(Tk_Offset(XKeyEvent, y_root) == Tk_Offset(XCrossingEvent, y_root)); assert(Tk_Offset(XKeyEvent, y_root) == Tk_Offset(XMotionEvent, y_root)); /* * Initialize the static data structures used by the binding package. They * are only initialized once, no matter how many interps are created. */ if (!initialized) { Tcl_MutexLock(&bindMutex); if (!initialized) { Tcl_HashEntry *hPtr; const ModInfo *modPtr; const EventInfo *eiPtr; bool newEntry; unsigned i; #ifdef REDO_KEYSYM_LOOKUP const KeySymInfo *kPtr; Tcl_InitHashTable(&keySymTable, TCL_STRING_KEYS); Tcl_InitHashTable(&nameTable, TCL_ONE_WORD_KEYS); for (kPtr = keyArray; kPtr->name; ++kPtr) { hPtr = Tcl_CreateHashEntry(&keySymTable, kPtr->name, &newEntry); Tcl_SetHashValue(hPtr, kPtr->value); hPtr = Tcl_CreateHashEntry(&nameTable, (char *) kPtr->value, &newEntry); if (newEntry) { Tcl_SetHashValue(hPtr, kPtr->name); } } #endif /* REDO_KEYSYM_LOOKUP */ for (i = 0; i < SIZE_OF_ARRAY(eventArrayIndex); ++i) { eventArrayIndex[i] = -1; } for (i = 0; i < SIZE_OF_ARRAY(eventArray); ++i) { unsigned type = eventArray[i].type; assert(type < TK_LASTEVENT); if (type > 0 && eventArrayIndex[type] == -1) { eventArrayIndex[type] = i; } } Tcl_InitHashTable(&modTable, TCL_STRING_KEYS); for (modPtr = modArray; modPtr->name; ++modPtr) { hPtr = Tcl_CreateHashEntry(&modTable, modPtr->name, &newEntry); Tcl_SetHashValue(hPtr, modPtr); } Tcl_InitHashTable(&eventTable, TCL_STRING_KEYS); for (eiPtr = eventArray; eiPtr->name; ++eiPtr) { hPtr = Tcl_CreateHashEntry(&eventTable, eiPtr->name, &newEntry); Tcl_SetHashValue(hPtr, eiPtr); } initialized = true; } Tcl_MutexUnlock(&bindMutex); } mainPtr->bindingTable = Tk_CreateBindingTable(mainPtr->interp); bindInfoPtr = ckalloc(sizeof(BindInfo)); InitVirtualEventTable(&bindInfoPtr->virtualEventTable); bindInfoPtr->screenInfo.curDispPtr = NULL; bindInfoPtr->screenInfo.curScreenIndex = -1; bindInfoPtr->screenInfo.bindingDepth = 0; bindInfoPtr->deleted = false; bindInfoPtr->lastCurrentTime = CurrentTimeInMilliSecs(); bindInfoPtr->lastEventTime = 0; mainPtr->bindInfo = bindInfoPtr; TkpInitializeMenuBindings(mainPtr->interp, mainPtr->bindingTable); } /* *--------------------------------------------------------------------------- |
︙ | ︙ | |||
743 744 745 746 747 748 749 750 751 752 | */ void TkBindFree( TkMainInfo *mainPtr) /* The newly created application. */ { BindInfo *bindInfoPtr; Tk_DeleteBindingTable(mainPtr->bindingTable); mainPtr->bindingTable = NULL; | > > < | | 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 | */ void TkBindFree( TkMainInfo *mainPtr) /* The newly created application. */ { BindInfo *bindInfoPtr; assert(mainPtr); Tk_DeleteBindingTable(mainPtr->bindingTable); mainPtr->bindingTable = NULL; bindInfoPtr = mainPtr->bindInfo; DeleteVirtualEventTable(&bindInfoPtr->virtualEventTable); bindInfoPtr->deleted = true; Tcl_EventuallyFree(bindInfoPtr, TCL_DYNAMIC); mainPtr->bindInfo = NULL; } /* *-------------------------------------------------------------- * |
︙ | ︙ | |||
773 774 775 776 777 778 779 | * Memory is allocated for the new table. * *-------------------------------------------------------------- */ Tk_BindingTable Tk_CreateBindingTable( | | | < | > > > | | | > > | | | 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 | * Memory is allocated for the new table. * *-------------------------------------------------------------- */ Tk_BindingTable Tk_CreateBindingTable( Tcl_Interp *interp) /* Interpreter to associate with the binding table: commands are * executed in this interpreter. */ { BindingTable *bindPtr = ckalloc(sizeof(BindingTable)); unsigned i; assert(interp); /* * Create and initialize a new binding table. */ memset(bindPtr, 0, sizeof(BindingTable)); for (i = 0; i < SIZE_OF_ARRAY(bindPtr->eventInfo); ++i) { bindPtr->eventInfo[i].xev.type = -1; } bindPtr->curEvent = bindPtr->eventInfo; /* do not assign NULL */ bindPtr->lookupTables.number = 0; PromArr_ResizeAndClear(&bindPtr->promArr, 2); Tcl_InitHashTable(&bindPtr->lookupTables.listTable, sizeof(PatternTableKey)/sizeof(int)); Tcl_InitHashTable(&bindPtr->lookupTables.patternTable, sizeof(PatternTableKey)/sizeof(int)); Tcl_InitHashTable(&bindPtr->objectTable, TCL_ONE_WORD_KEYS); bindPtr->interp = interp; return bindPtr; } /* *-------------------------------------------------------------- |
︙ | ︙ | |||
816 817 818 819 820 821 822 | *-------------------------------------------------------------- */ void Tk_DeleteBindingTable( Tk_BindingTable bindPtr) /* Token for the binding table to destroy. */ { | < > > | | > > > | | | > > > > > > > > > > | > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 | *-------------------------------------------------------------- */ void Tk_DeleteBindingTable( Tk_BindingTable bindPtr) /* Token for the binding table to destroy. */ { Tcl_HashEntry *hPtr; Tcl_HashSearch search; assert(bindPtr); /* * Find and delete all of the patterns associated with the binding table. */ hPtr = Tcl_FirstHashEntry(&bindPtr->lookupTables.patternTable, &search); for ( ; hPtr; hPtr = Tcl_NextHashEntry(&search)) { PatSeq *nextPtr; PatSeq *psPtr; for (psPtr = Tcl_GetHashValue(hPtr); psPtr; psPtr = nextPtr) { nextPtr = psPtr->nextSeqPtr; assert(psPtr->added != 0xdeadbeef); FreePatSeq(psPtr); } } /* * Don't forget to release lookup elements. */ ClearLookupTable(&bindPtr->lookupTables, NULL); ClearPromotionLists(bindPtr, NULL); PromArr_Free(&bindPtr->promArr); PSList_Clear(&bindPtr->lookupTables.entryPool); /* * Clean up the rest of the information associated with the binding table. */ Tcl_DeleteHashTable(&bindPtr->lookupTables.patternTable); Tcl_DeleteHashTable(&bindPtr->lookupTables.listTable); Tcl_DeleteHashTable(&bindPtr->objectTable); ckfree(bindPtr); } /* *-------------------------------------------------------------- * * InsertPatSeq -- * * Insert given pattern sequence into lookup table for fast * access. * * Results: * None. * * Side effects: * Memory allocated. * *-------------------------------------------------------------- */ static void InsertPatSeq( LookupTables *lookupTables, PatSeq *psPtr) { assert(lookupTables); assert(psPtr); assert(psPtr->numPats >= 1); assert(psPtr->added != 0xdeadbeef); if (!(psPtr->added)) { PatternTableKey key; Tcl_HashEntry *hPtr; bool isNew; PSList *psList; PSEntry *psEntry; SetupPatternKey(&key, psPtr); hPtr = Tcl_CreateHashEntry(&lookupTables->listTable, (char *) &key, &isNew); if (isNew) { psList = ckalloc(sizeof(PSList)); PSList_Init(psList); Tcl_SetHashValue(hPtr, psList); } else { psList = Tcl_GetHashValue(hPtr); } psEntry = MakeListEntry(&lookupTables->entryPool, psPtr); PSList_Append(psList, psEntry); psPtr->added = true; } } /* *-------------------------------------------------------------- * * Tk_CreateBinding -- * * Add a binding to a binding table, so that future calls to Tk_BindEvent * may execute the command in the binding. |
︙ | ︙ | |||
870 871 872 873 874 875 876 | *-------------------------------------------------------------- */ unsigned long Tk_CreateBinding( Tcl_Interp *interp, /* Used for error reporting. */ Tk_BindingTable bindPtr, /* Table in which to create binding. */ | | < | < | < | < | | | < > | > > > > > | < | > | > > > > > > > > > | > > | < < < < | < > | | > | | < | < | 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 | *-------------------------------------------------------------- */ unsigned long Tk_CreateBinding( Tcl_Interp *interp, /* Used for error reporting. */ Tk_BindingTable bindPtr, /* Table in which to create binding. */ ClientData object, /* Token for object with which binding is associated. */ const char *eventString, /* String describing event sequence that triggers binding. */ const char *script, /* Contains Tcl script to execute when binding triggers. */ bool append) /* False means replace any existing binding for eventString; * True means append to that binding. If the existing binding is * for a callback function and not a Tcl command string, the * existing binding will always be replaced. */ { PatSeq *psPtr; unsigned long eventMask; char *oldStr; char *newStr; assert(bindPtr); assert(object); assert(eventString); assert(script); if (!*script) { /* Silently ignore empty scripts -- see SF#3006842 */ return 1; } psPtr = FindSequence(interp, &bindPtr->lookupTables, object, eventString, true, true, &eventMask); if (!psPtr) { return 0; } assert(psPtr->added != 0xdeadbeef); if (psPtr->numPats > PromArr_Capacity(bindPtr->promArr)) { /* * We have to increase the size of array containing the lists of promoted sequences. * Normally the maximal size is 2, only in very seldom cases a bigger size is needed. * Note that for technical reasons the capacity should be one higher than the expected * maximal size. */ PromArr_ResizeAndClear(&bindPtr->promArr, psPtr->numPats); } if (!psPtr->script) { Tcl_HashEntry *hPtr; bool isNew; /* * This pattern sequence was just created. Link the pattern into the * list associated with the object, so that if the object goes away, * these bindings will all automatically be deleted. */ hPtr = Tcl_CreateHashEntry(&bindPtr->objectTable, (char *) object, &isNew); psPtr->ptr.nextObj = isNew ? NULL : Tcl_GetHashValue(hPtr); Tcl_SetHashValue(hPtr, psPtr); InsertPatSeq(&bindPtr->lookupTables, psPtr); } oldStr = psPtr->script; if (append && oldStr) { size_t length1 = strlen(oldStr); size_t length2 = strlen(script); newStr = ckalloc(length1 + length2 + 2); memcpy(newStr, oldStr, length1); newStr[length1] = '\n'; memcpy(newStr+length1 + 1, script, length2 + 1); } else { size_t length = strlen(script); newStr = ckalloc(length + 1); memcpy(newStr, script, length + 1); } ckfree(oldStr); psPtr->script = newStr; return eventMask; } /* *-------------------------------------------------------------- * |
︙ | ︙ | |||
959 960 961 962 963 964 965 | *-------------------------------------------------------------- */ int Tk_DeleteBinding( Tcl_Interp *interp, /* Used for error reporting. */ Tk_BindingTable bindPtr, /* Table in which to delete binding. */ | | < | < | | | > > | < | > > | | > | | < | | < | | | | | | | | | | < < < < < < < | < < < < < < < < < < < | | | | | > > | > | | 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 | *-------------------------------------------------------------- */ int Tk_DeleteBinding( Tcl_Interp *interp, /* Used for error reporting. */ Tk_BindingTable bindPtr, /* Table in which to delete binding. */ ClientData object, /* Token for object with which binding is associated. */ const char *eventString) /* String describing event sequence that triggers binding. */ { PatSeq *psPtr; assert(bindPtr); assert(object); assert(eventString); psPtr = FindSequence(interp, &bindPtr->lookupTables, object, eventString, false, true, NULL); if (!psPtr) { Tcl_ResetResult(interp); } else { Tcl_HashEntry *hPtr; PatSeq *prevPtr; assert(psPtr->added != 0xdeadbeef); /* * Unlink the binding from the list for its object. */ if (!(hPtr = Tcl_FindHashEntry(&bindPtr->objectTable, (char *) object))) { Tcl_Panic("Tk_DeleteBinding couldn't find object table entry"); } prevPtr = Tcl_GetHashValue(hPtr); if (prevPtr == psPtr) { Tcl_SetHashValue(hPtr, psPtr->ptr.nextObj); } else { for ( ; ; prevPtr = prevPtr->ptr.nextObj) { if (!prevPtr) { Tcl_Panic("Tk_DeleteBinding couldn't find on object list"); } if (prevPtr->ptr.nextObj == psPtr) { prevPtr->ptr.nextObj = psPtr->ptr.nextObj; break; } } } RemovePatSeqFromLookup(&bindPtr->lookupTables, psPtr); RemovePatSeqFromPromotionLists(bindPtr, psPtr); DeletePatSeq(psPtr); } return TCL_OK; } /* *-------------------------------------------------------------- * * Tk_GetBinding -- |
︙ | ︙ | |||
1047 1048 1049 1050 1051 1052 1053 | *-------------------------------------------------------------- */ const char * Tk_GetBinding( Tcl_Interp *interp, /* Interpreter for error reporting. */ Tk_BindingTable bindPtr, /* Table in which to look for binding. */ | | < | < | < | > | < < | > > | | 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 | *-------------------------------------------------------------- */ const char * Tk_GetBinding( Tcl_Interp *interp, /* Interpreter for error reporting. */ Tk_BindingTable bindPtr, /* Table in which to look for binding. */ ClientData object, /* Token for object with which binding is associated. */ const char *eventString) /* String describing event sequence that triggers binding. */ { const PatSeq *psPtr; assert(bindPtr); assert(object); assert(eventString); psPtr = FindSequence(interp, &bindPtr->lookupTables, object, eventString, false, true, NULL); assert(!psPtr || psPtr->added != 0xdeadbeef); return psPtr ? psPtr->script : NULL; } /* *-------------------------------------------------------------- * * Tk_GetAllBindings -- * |
︙ | ︙ | |||
1089 1090 1091 1092 1093 1094 1095 | void Tk_GetAllBindings( Tcl_Interp *interp, /* Interpreter returning result or error. */ Tk_BindingTable bindPtr, /* Table in which to look for bindings. */ ClientData object) /* Token for object. */ { | > > > > > > | > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | > > > > | > > | > > > > | | > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | | > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | | > | | > | | | > > > > | > > > > > > > > > > > | > > | 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 | void Tk_GetAllBindings( Tcl_Interp *interp, /* Interpreter returning result or error. */ Tk_BindingTable bindPtr, /* Table in which to look for bindings. */ ClientData object) /* Token for object. */ { Tcl_HashEntry *hPtr; assert(bindPtr); assert(object); if ((hPtr = Tcl_FindHashEntry(&bindPtr->objectTable, (char *) object))) { const PatSeq *psPtr; Tcl_Obj *resultObj = Tcl_NewObj(); /* * For each binding, output information about each of the patterns in its sequence. */ for (psPtr = Tcl_GetHashValue(hPtr); psPtr; psPtr = psPtr->ptr.nextObj) { assert(psPtr->added != 0xdeadbeef); Tcl_ListObjAppendElement(NULL, resultObj, GetPatternObj(psPtr)); } Tcl_SetObjResult(interp, resultObj); } } /* *-------------------------------------------------------------- * * RemovePatSeqFromLookup -- * * Remove given pattern sequence from lookup tables. This * can be required before deleting the pattern sequence. * * Results: * None. * * Side effects: * None. * *-------------------------------------------------------------- */ static void RemovePatSeqFromLookup( LookupTables *lookupTables, /* Remove from this lookup tables. */ PatSeq *psPtr) /* Remove this pattern sequence. */ { PatternTableKey key; Tcl_HashEntry *hPtr; assert(lookupTables); assert(psPtr); SetupPatternKey(&key, psPtr); if ((hPtr = Tcl_FindHashEntry(&lookupTables->listTable, (char *) &key))) { PSList *psList = Tcl_GetHashValue(hPtr); PSEntry *psEntry; TK_DLIST_FOREACH(psEntry, psList) { if (psEntry->psPtr == psPtr) { psPtr->added = false; RemoveListEntry(&lookupTables->entryPool, psEntry); return; } } } assert(!"couldn't find pattern sequence in lookup"); } /* *-------------------------------------------------------------- * * RemovePatSeqFromPromotionLists -- * * Remove given pattern sequence from promotion lists. This * can be required before deleting the pattern sequence. * * Results: * None. * * Side effects: * None. * *-------------------------------------------------------------- */ static void RemovePatSeqFromPromotionLists( Tk_BindingTable bindPtr, /* Table in which to look for bindings. */ PatSeq *psPtr) /* Remove this pattern sequence. */ { unsigned i; assert(bindPtr); assert(psPtr); for (i = 0; i < PromArr_Size(bindPtr->promArr); ++i) { PSList *psList = PromArr_Get(bindPtr->promArr, i); PSEntry *psEntry; TK_DLIST_FOREACH(psEntry, psList) { if (psEntry->psPtr == psPtr) { RemoveListEntry(&bindPtr->lookupTables.entryPool, psEntry); break; } } } } /* *-------------------------------------------------------------- * * DeletePatSeq -- * * Delete given pattern sequence. Possibly it is required * to invoke RemovePatSeqFromLookup(), and RemovePatSeqFromPromotionLists() * before. * * Results: * Pointer to succeeding pattern sequence. * * Side effects: * Deallocation of memory. * *-------------------------------------------------------------- */ static PatSeq * DeletePatSeq( PatSeq *psPtr) /* Delete this pattern sequence. */ { PatSeq *prevPtr; PatSeq *nextPtr; assert(psPtr); assert(!psPtr->added); assert(!psPtr->owned); prevPtr = Tcl_GetHashValue(psPtr->hPtr); nextPtr = psPtr->ptr.nextObj; /* * Be sure to remove each binding from its hash chain in the pattern * table. If this is the last pattern in the chain, then delete the * hash entry too. */ if (prevPtr == psPtr) { if (!psPtr->nextSeqPtr) { Tcl_DeleteHashEntry(psPtr->hPtr); } else { Tcl_SetHashValue(psPtr->hPtr, psPtr->nextSeqPtr); } } else { for ( ; ; prevPtr = prevPtr->nextSeqPtr) { if (!prevPtr) { Tcl_Panic("DeletePatSeq couldn't find on hash chain"); } if (prevPtr->nextSeqPtr == psPtr) { prevPtr->nextSeqPtr = psPtr->nextSeqPtr; break; } } } FreePatSeq(psPtr); return nextPtr; } /* *-------------------------------------------------------------- * * Tk_DeleteAllBindings -- * |
︙ | ︙ | |||
1133 1134 1135 1136 1137 1138 1139 | */ void Tk_DeleteAllBindings( Tk_BindingTable bindPtr, /* Table in which to delete bindings. */ ClientData object) /* Token for object. */ { | | > > > | < < < < | < < < > | | | < < < < | < | | < < | | < | | < < < < | 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 | */ void Tk_DeleteAllBindings( Tk_BindingTable bindPtr, /* Table in which to delete bindings. */ ClientData object) /* Token for object. */ { PatSeq *psPtr; PatSeq *nextPtr; Tcl_HashEntry *hPtr; assert(bindPtr); assert(object); if (!(hPtr = Tcl_FindHashEntry(&bindPtr->objectTable, (char *) object))) { return; } /* * Don't forget to clear lookup tables. */ ClearLookupTable(&bindPtr->lookupTables, object); ClearPromotionLists(bindPtr, object); for (psPtr = Tcl_GetHashValue(hPtr); psPtr; psPtr = nextPtr) { assert(psPtr->added != 0xdeadbeef); DEBUG(psPtr->added = false); nextPtr = DeletePatSeq(psPtr); } Tcl_DeleteHashEntry(hPtr); } /* *--------------------------------------------------------------------------- * * Tk_BindEvent -- |
︙ | ︙ | |||
1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 | * All Tcl binding scripts for each object are accumulated before the * first binding is evaluated. If the action of a Tcl binding is to * change or delete a binding, or delete the window associated with the * binding, all the original Tcl binding scripts will still fire. * *--------------------------------------------------------------------------- */ void Tk_BindEvent( Tk_BindingTable bindPtr, /* Table in which to look for bindings. */ XEvent *eventPtr, /* What actually happened. */ | > > > > > > > > > > > > > > > > > > > > | < | | | < | | | < > | < | > > > > > < < | > > > > > > > | > > | | > > > > > > > > > > > > > > > > > > > > > > > | > > > > > > < > > | > > > > > > | | < < < < < | | | | | < > | | < < < < < | < | > | | > | | | | < | | < < < < | < > > | > > > | | < | < | | | < < < < | | | < < > > > | > > | | > > | > | > | < | | > | < > > > | | | | > | | < < < < | < | | > | | > | | | > > > > | | < < | < | < < | | | < < | < | < | < < < | | | | < < < > | | > < < < | > > > > > > > > > > > > > > | > | > > | > > > > | < | < < < > > > > | > > > > > > > > > > > | > > > | > > > > | | | | | < > > | > < | > | > > > > > > > > > | < < > > | | | > > > | > > > > | > > > > | | < | > > > > > > > > | > > > > > | > > | > > | | > | < | < < | < < < > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | | 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 | * All Tcl binding scripts for each object are accumulated before the * first binding is evaluated. If the action of a Tcl binding is to * change or delete a binding, or delete the window associated with the * binding, all the original Tcl binding scripts will still fire. * *--------------------------------------------------------------------------- */ /* helper function */ static bool IsBetterMatch( const PatSeq *fstMatchPtr, const PatSeq *sndMatchPtr, /* this is a better match? */ unsigned patIndex) { if (!sndMatchPtr) { return false; } if (!fstMatchPtr) { return true; } if (sndMatchPtr->count > fstMatchPtr->count) { return true; } if (sndMatchPtr->count < fstMatchPtr->count) { return false; } #if PREFER_MOST_SPECIALIZED_EVENT if (GetCount(sndMatchPtr, patIndex) > GetCount(fstMatchPtr, patIndex)) { return true; } if (GetCount(sndMatchPtr, patIndex) < GetCount(fstMatchPtr, patIndex)) { return false; } if (fstMatchPtr->numPats > sndMatchPtr->numPats) { return true; } if (fstMatchPtr->numPats < sndMatchPtr->numPats) { return false; } #endif return sndMatchPtr->number > fstMatchPtr->number; } void Tk_BindEvent( Tk_BindingTable bindPtr, /* Table in which to look for bindings. */ XEvent *eventPtr, /* What actually happened. */ Tk_Window tkwin, /* Window on display where event occurred (needed in order to * locate display information). */ int numObjects, /* Number of objects at *objArr. */ ClientData *objArr) /* Array of one or more objects to check for a matching binding. */ { Tcl_Interp *interp; ScreenInfo *screenPtr; TkDisplay *dispPtr; TkDisplay *oldDispPtr; Event *curEvent; TkWindow *winPtr = (TkWindow *) tkwin; BindInfo *bindInfoPtr; Tcl_InterpState interpState; LookupTables *physTables; PatSeq *psPtr[2]; PatSeq *matchPtrBuf[32]; PatSeq **matchPtrArr = matchPtrBuf; PSList *psl[2]; Tcl_DString scripts; const char *p; const char *end; unsigned scriptCount; unsigned oldScreen; unsigned flags; unsigned arraySize; unsigned newArraySize; unsigned i, k; assert(bindPtr); assert(eventPtr); assert(tkwin); /* * Ignore events on windows that don't have names: these are windows like * wrapper windows that shouldn't be visible to the application. */ if (!winPtr->pathName) { return; } flags = flagArray[eventPtr->type]; /* * Ignore event types which are not in flagArray and all zeroes there. */ if (eventPtr->type >= TK_LASTEVENT || !flags) { return; } if (flags & KEY_BUTTON_MOTION_VIRTUAL) { bindPtr->curModStateMask = eventPtr->xkey.state; } else if (flags & CROSSING) { bindPtr->curModStateMask = eventPtr->xcrossing.state; } dispPtr = ((TkWindow *) tkwin)->dispPtr; bindInfoPtr = winPtr->mainPtr->bindInfo; /* * Ignore the event completely if it is an Enter, Leave, FocusIn, or * FocusOut event with detail NotifyInferior. The reason for ignoring * these events is that we don't want transitions between a window and its * children to visible to bindings on the parent: this would cause * problems for mega-widgets, since the internal structure of a * mega-widget isn't supposed to be visible to people watching the parent. * * Also ignore modifier key events, these events cannot be bound. * * Furthermore we have to compute current time, needed for "event generate". */ switch (eventPtr->type) { case EnterNotify: case LeaveNotify: if (eventPtr->xcrossing.time) { bindInfoPtr->lastCurrentTime = CurrentTimeInMilliSecs(); bindInfoPtr->lastEventTime = eventPtr->xcrossing.time; } if (eventPtr->xcrossing.detail == NotifyInferior) { return; } break; case FocusIn: case FocusOut: if (eventPtr->xfocus.detail == NotifyInferior) { return; } break; case KeyPress: case KeyRelease: { if (eventPtr->xkey.time) { bindInfoPtr->lastCurrentTime = CurrentTimeInMilliSecs(); bindInfoPtr->lastEventTime = eventPtr->xkey.time; } /* modifier keys are not influencing button events */ for (i = 0; i < dispPtr->numModKeyCodes; ++i) { if (dispPtr->modKeyCodes[i] == eventPtr->xkey.keycode) { return; } } /* reset repetition count for button events */ bindPtr->eventInfo[ButtonPress].countAny = 0; bindPtr->eventInfo[ButtonPress].countDetailed = 0; bindPtr->eventInfo[ButtonRelease].countAny = 0; bindPtr->eventInfo[ButtonRelease].countDetailed = 0; break; case ButtonPress: case ButtonRelease: /* reset repetition count for key events */ bindPtr->eventInfo[KeyPress].countAny = 0; bindPtr->eventInfo[KeyPress].countDetailed = 0; bindPtr->eventInfo[KeyRelease].countAny = 0; bindPtr->eventInfo[KeyRelease].countDetailed = 0; // fallthru case MotionNotify: if (eventPtr->xmotion.time) { bindInfoPtr->lastCurrentTime = CurrentTimeInMilliSecs(); bindInfoPtr->lastEventTime = eventPtr->xmotion.time; } break; case PropertyNotify: if (eventPtr->xproperty.time) { bindInfoPtr->lastCurrentTime = CurrentTimeInMilliSecs(); bindInfoPtr->lastEventTime = eventPtr->xproperty.time; } break; } } curEvent = bindPtr->eventInfo + eventPtr->type; /* * Now check whether this is a repeating event (multi-click, repeated key press, and so on). */ /* NOTE: if curEvent is not yet set, then the following cannot match: */ if (curEvent->xev.xany.window == eventPtr->xany.window) { switch (eventPtr->type) { case KeyPress: case KeyRelease: if (eventPtr->xkey.time - curEvent->xev.xkey.time <= NEARBY_MS) { if (curEvent->xev.xkey.keycode == eventPtr->xkey.keycode) { ++curEvent->countDetailed; } else { curEvent->countDetailed = 1; } ++curEvent->countAny; } else { curEvent->countAny = curEvent->countDetailed = 1; } break; case ButtonPress: case ButtonRelease: if (MatchEventNearby(&curEvent->xev, eventPtr)) { if (curEvent->xev.xbutton.button == eventPtr->xbutton.button) { ++curEvent->countDetailed; } else { curEvent->countDetailed = 1; } ++curEvent->countAny; } else { curEvent->countAny = curEvent->countDetailed = 1; } break; case MotionNotify: if (MatchEventNearby(&curEvent->xev, eventPtr)) { ++curEvent->countAny; } else { curEvent->countAny = 1; } break; case EnterNotify: case LeaveNotify: if (eventPtr->xcrossing.time - curEvent->xev.xcrossing.time <= NEARBY_MS) { ++curEvent->countAny; } else { curEvent->countAny = 1; } break; case PropertyNotify: if (eventPtr->xproperty.time - curEvent->xev.xproperty.time <= NEARBY_MS) { ++curEvent->countAny; } else { curEvent->countAny = 1; } break; default: ++curEvent->countAny; break; } } else { curEvent->countAny = curEvent->countDetailed = 1; } /* * Now update the details. */ curEvent->xev = *eventPtr; if (flags & KEY) { curEvent->detail.info = TkpGetKeySym(dispPtr, eventPtr); } else if (flags & BUTTON) { curEvent->detail.info = eventPtr->xbutton.button; } else if (flags & MOTION) { curEvent->detail.info = ButtonNumberFromState(eventPtr->xmotion.state); } else if (flags & VIRTUAL) { curEvent->detail.name = ((XVirtualEvent *) eventPtr)->name; } bindPtr->curEvent = curEvent; physTables = &bindPtr->lookupTables; scriptCount = 0; arraySize = 0; Tcl_DStringInit(&scripts); if (numObjects > SIZE_OF_ARRAY(matchPtrBuf)) { /* it's unrealistic that the buffer size is too small, but who knows? */ matchPtrArr = ckalloc(numObjects*sizeof(matchPtrArr[0])); } memset(matchPtrArr, 0, numObjects*sizeof(matchPtrArr[0])); if (!PromArr_IsEmpty(bindPtr->promArr)) { for (k = 0; k < numObjects; ++k) { psl[1] = PromArr_Last(bindPtr->promArr); psl[0] = psl[1] - 1; /* * Loop over all promoted bindings, finding the longest matching one. * * Note that we must process all lists, because all matching patterns * have to be promoted. Normally at most one list will be processed, and * usually this list only contains one or two patterns. */ for (i = PromArr_Size(bindPtr->promArr); i > 0; --i, --psl[0], --psl[1]) { psPtr[0] = MatchPatterns(dispPtr, bindPtr, psl[0], psl[1], i, curEvent, objArr[k], NULL); if (IsBetterMatch(matchPtrArr[k], psPtr[0], i)) { /* we will process it later, because we still may find a pattern with better match */ matchPtrArr[k] = psPtr[0]; } if (!PSList_IsEmpty(psl[1])) { /* we have promoted sequences, adjust array size */ arraySize = Max(i + 1, arraySize); } } } } /* * 1. Look for bindings for the specific detail (button and key events). * 2. Look for bindings without detail. */ for (k = 0; k < numObjects; ++k) { PSList *psSuccList = PromArr_First(bindPtr->promArr); PatSeq *bestPtr; psl[0] = GetLookupForEvent(physTables, curEvent, objArr[k], true); psl[1] = GetLookupForEvent(physTables, curEvent, objArr[k], false); assert(psl[0] == NULL || psl[0] != psl[1]); psPtr[0] = MatchPatterns(dispPtr, bindPtr, psl[0], psSuccList, 0, curEvent, objArr[k], NULL); psPtr[1] = MatchPatterns(dispPtr, bindPtr, psl[1], psSuccList, 0, curEvent, objArr[k], NULL); if (!PSList_IsEmpty(psSuccList)) { /* we have promoted sequences, adjust array size */ arraySize = Max(1, arraySize); } bestPtr = psPtr[0] ? psPtr[0] : psPtr[1]; if (matchPtrArr[k]) { if (IsBetterMatch(matchPtrArr[k], bestPtr, 0)) { matchPtrArr[k] = bestPtr; } else { /* * We've already found a higher level match, nevertheless it was required to * process the level zero patterns because of possible promotions. */ } /* * Now we have to catch up the processing of the script. */ ExpandPercents(winPtr, matchPtrArr[k]->script, curEvent, scriptCount++, &scripts); Tcl_DStringAppend(&scripts, "", 1); continue; } /* * We have to look whether we can find a better match in virtual table, provided that we * don't have a higher level match. */ matchPtrArr[k] = bestPtr; if (eventPtr->type != VirtualEvent) { LookupTables *virtTables = &bindInfoPtr->virtualEventTable.lookupTables; PatSeq *matchPtr = matchPtrArr[k]; PatSeq *mPtr; PSList *psl[2]; /* * Note that virtual events cannot promote. */ psl[0] = GetLookupForEvent(virtTables, curEvent, NULL, true); psl[1] = GetLookupForEvent(virtTables, curEvent, NULL, false); assert(psl[0] == NULL || psl[0] != psl[1]); mPtr = MatchPatterns(dispPtr, bindPtr, psl[0], NULL, 0, curEvent, objArr[k], &matchPtr); if (mPtr) { matchPtrArr[k] = matchPtr; matchPtr = mPtr; } if (MatchPatterns(dispPtr, bindPtr, psl[1], NULL, 0, curEvent, objArr[k], &matchPtr)) { matchPtrArr[k] = matchPtr; } } if (matchPtrArr[k]) { ExpandPercents(winPtr, matchPtrArr[k]->script, curEvent, scriptCount++, &scripts); /* nul is added to the scripts string to separate the various scripts */ Tcl_DStringAppend(&scripts, "", 1); } } PromArr_SetSize(bindPtr->promArr, arraySize); /* * Remove expired pattern sequences. */ for (i = 0, newArraySize = 0; i < arraySize; ++i) { PSList *psList = PromArr_Get(bindPtr->promArr, i); PSEntry *psEntry; PSEntry *psNext; for (psEntry = PSList_First(psList); psEntry; psEntry = psNext) { const TkPattern *patPtr; assert(i + 1 < psEntry->psPtr->numPats); psNext = PSList_Next(psEntry); patPtr = &psEntry->psPtr->pats[i + 1]; /* * We have to remove the following entries from promotion list (but * only if it is not added recently): * ------------------------------------------------------------------ * 1) It is marked as expired (see MatchPatterns()). * 2) If we have a Key event, and current entry is matching a Button. * 3) If we have a Button event, and current entry is matching a Key. * 4) If we have a detailed event, current entry it is also detailed, * we have matching event types, but the details are different. * 5) Current entry has been matched with a different window. */ if (psEntry->isNew) { /* this pattern has been added recently */ assert(!psEntry->expired); psEntry->isNew = false; } else if (psEntry->expired || psEntry->window != curEvent->xev.xany.window || (patPtr->info && curEvent->detail.info && patPtr->eventType == curEvent->xev.type && patPtr->info != curEvent->detail.info)) { RemoveListEntry(&bindPtr->lookupTables.entryPool, psEntry); } else { switch (patPtr->eventType) { case ButtonPress: case ButtonRelease: if (curEvent->xev.type == KeyPress || curEvent->xev.type == KeyRelease) { RemoveListEntry(&bindPtr->lookupTables.entryPool, psEntry); } break; case KeyPress: case KeyRelease: if (curEvent->xev.type == ButtonPress || curEvent->xev.type == ButtonRelease) { RemoveListEntry(&bindPtr->lookupTables.entryPool, psEntry); } break; } } } if (!PSList_IsEmpty(psList)) { /* we still have promoted sequences, adjust array size */ newArraySize = Max(i + 1, newArraySize); } } PromArr_SetSize(bindPtr->promArr, newArraySize); if (matchPtrArr != matchPtrBuf) { ckfree(matchPtrArr); } if (Tcl_DStringLength(&scripts) == 0) { return; /* nothing to do */ } /* * Now go back through and evaluate the binding for each object, in order, * dealing with "break" and "continue" exceptions appropriately. * * There are two tricks here: |
︙ | ︙ | |||
1472 1473 1474 1475 1476 1477 1478 | * screen has changed. */ interpState = Tcl_SaveInterpState(interp, TCL_OK); screenPtr = &bindInfoPtr->screenInfo; oldDispPtr = screenPtr->curDispPtr; oldScreen = screenPtr->curScreenIndex; | | | < < < | > | | | | < < < < | < < < > | | | < | < | | < < < < < < < < < < < < < | | < | | < < > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | < | < | | < < | | < | < | < | < < | < < < | < | | < < | < < < < < | | < > < < < | < < | | | | < < < < < < < < < < < < < < < < < | < < < < < | < < < < < < < > | | | < < < | | | < < < < < < < < < > | | | | < < < < < | | | < < < < < < | | > | < | < < < < | < | < > | < < < | | < | < < < < | < | < < < < | < < | < | > > | | | | < < < < < < < < < < < < < < < < < < < < < < < < < | < < | < < < < > | | < < | | < | < < < < | < < > | < < > | < < < > > | < < | | < | | < < < < > < < < | < < < < | < < < | < < < < < | | | | | < < < | | | < < < < < > | < > | < > > > < < < < < < < | > > > > > | | | < < < < < < < < < < < < < < < < | < < < < | < < | > > | < | 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 | * screen has changed. */ interpState = Tcl_SaveInterpState(interp, TCL_OK); screenPtr = &bindInfoPtr->screenInfo; oldDispPtr = screenPtr->curDispPtr; oldScreen = screenPtr->curScreenIndex; if (dispPtr != screenPtr->curDispPtr || Tk_ScreenNumber(tkwin) != screenPtr->curScreenIndex) { screenPtr->curDispPtr = dispPtr; screenPtr->curScreenIndex = Tk_ScreenNumber(tkwin); ChangeScreen(interp, dispPtr->name, screenPtr->curScreenIndex); } /* * Be careful when dereferencing screenPtr or bindInfoPtr. If we evaluate * something that destroys ".", bindInfoPtr would have been freed, but we * can tell that by first checking to see if winPtr->mainPtr == NULL. */ Tcl_Preserve(bindInfoPtr); for (p = Tcl_DStringValue(&scripts), end = p + Tcl_DStringLength(&scripts); p < end; ) { unsigned len = strlen(p); int code; if (!bindInfoPtr->deleted) { ++screenPtr->bindingDepth; } Tcl_AllowExceptions(interp); code = Tcl_EvalEx(interp, p, len, TCL_EVAL_GLOBAL); p += len + 1; if (!bindInfoPtr->deleted) { --screenPtr->bindingDepth; } if (code != TCL_OK && code != TCL_CONTINUE) { if (code != TCL_BREAK) { Tcl_AddErrorInfo(interp, "\n (command bound to event)"); Tcl_BackgroundException(interp, code); } break; } } if (!bindInfoPtr->deleted && screenPtr->bindingDepth > 0 && (oldDispPtr != screenPtr->curDispPtr || oldScreen != screenPtr->curScreenIndex)) { /* * Some other binding script is currently executing, but its screen is * no longer current. Change the current display back again. */ screenPtr->curDispPtr = oldDispPtr; screenPtr->curScreenIndex = oldScreen; ChangeScreen(interp, oldDispPtr->name, oldScreen); } Tcl_RestoreInterpState(interp, interpState); Tcl_DStringFree(&scripts); Tcl_Release(bindInfoPtr); } /* *---------------------------------------------------------------------- * * MatchPatterns -- * * Given a list of pattern sequences and the recent event, return * the pattern sequence that best matches this event, if there is * one. * * Results: * * The return value is NULL if no match is found. Otherwise the * return value is the most specific pattern sequence among all * those that match the event table. * * Side effects: * None. * *---------------------------------------------------------------------- */ /* helper function */ static bool VirtPatIsBound( Tk_BindingTable bindPtr, /* Table in which to look for bindings. */ PatSeq *psPtr, /* Test this pattern. */ ClientData object, /* Check for this binding tag. */ PatSeq **physPtrPtr) /* Input: the best physical event. * Output: the physical event associated with matching virtual event. */ { PatternTableKey key; const struct VirtOwners *owners; unsigned i; assert(bindPtr); assert(psPtr); assert(!psPtr->object); assert(physPtrPtr); if (*physPtrPtr) { const TkPattern *physPatPtr = (*physPtrPtr)->pats; const TkPattern *virtPatPtr = psPtr->pats; if (physPatPtr->info || !virtPatPtr->info) { unsigned long physModMask = physPatPtr->modStateMask; unsigned long virtModMask = virtPatPtr->modStateMask; if (physModMask == 0 || virtModMask == physModMask || (virtModMask & physModMask) != physModMask) { return false; // we cannot surpass this match } } } memset(&key, 0, sizeof(key)); key.object = object; key.type = VirtualEvent; owners = psPtr->ptr.owners; for (i = 0; i < VirtOwners_Size(owners); ++i) { Tcl_HashEntry *hPtr = VirtOwners_Get(owners, i); key.detail.name = (Tk_Uid) Tcl_GetHashKey(hPtr->tablePtr, hPtr); if ((hPtr = Tcl_FindHashEntry(&bindPtr->lookupTables.patternTable, (char *) &key))) { /* The physical event matches this virtual event's definition. */ *physPtrPtr = (PatSeq *) Tcl_GetHashValue(hPtr); return true; } } return false; } static PatSeq * MatchPatterns( TkDisplay *dispPtr, /* Display from which the event came. */ Tk_BindingTable bindPtr, /* Table in which to look for bindings. */ PSList *psList, /* List of potentially matching patterns, can be NULL. */ PSList *psSuccList, /* Add all matching higher-level pattern sequences to this list. * Can be NULL. */ unsigned patIndex, /* Match only this tag in sequence. */ const Event *curEvent, /* Match this event. */ ClientData object, /* Check for this binding tag. */ PatSeq **physPtrPtr) /* Input: the best physical event; NULL if we test physical events. * Output: the associated physical event for the best matching virtual * event; NULL when we match physical events. */ { Window window; PSEntry *psEntry; PatSeq *bestPtr; PatSeq *bestPhysPtr; unsigned bestCount; unsigned long bestModStateMask; unsigned long bestInfo; assert(dispPtr); assert(bindPtr); assert(curEvent); if (!psList) { return NULL; } bestModStateMask = 0; bestCount = 0; bestInfo = 0; bestPtr = NULL; bestPhysPtr = NULL; window = curEvent->xev.xany.window; for (psEntry = PSList_First(psList); psEntry; psEntry = PSList_Next(psEntry)) { if (patIndex == 0 || psEntry->window == window) { PatSeq* psPtr = psEntry->psPtr; assert(psPtr->added != 0xdeadbeef); assert((psPtr->object == NULL) == (physPtrPtr != NULL)); assert(psPtr->object || patIndex == 0); assert(psPtr->numPats > patIndex); if (psPtr->object ? psPtr->object == object : VirtPatIsBound(bindPtr, psPtr, object, physPtrPtr)) { TkPattern *patPtr = psPtr->pats + patIndex; if (patPtr->eventType == curEvent->xev.type && (curEvent->xev.type != CreateNotify || curEvent->xev.xcreatewindow.parent == window) && (!patPtr->name || patPtr->name == curEvent->detail.name) && (patPtr->info == 0 ? patPtr->count <= curEvent->countAny : patPtr->info == curEvent->detail.info && patPtr->count <= curEvent->countDetailed)) { unsigned long modStateMask = patPtr->modStateMask; unsigned long curModStateMask = bindPtr->curModStateMask; if (modStateMask) { /* * Resolve the modifier mask for Alt and Mod keys. Unfortunately this * cannot be done in ParseEventDescription, otherwise this function would * be the better place. */ modStateMask = ResolveModifiers(dispPtr, modStateMask); curModStateMask = ResolveModifiers(dispPtr, curModStateMask); } if ((modStateMask & ~curModStateMask) == 0) { /* * This pattern is finally matching. */ if (psPtr->numPats == patIndex + 1) { /* * This is also a final pattern. * We always prefer the pattern with higher repetition count. * * In case of same repetition count: * 1. Choose pattern with more specialized info (Key or Button). * 2. Choose pattern with more specialized modifier state. * 3. Best match don't has modifier states, or this pattern has one, * and it is not a real subset. */ if (bestCount < patPtr->count || (bestCount == patPtr->count && (!curEvent->detail.info || !bestInfo || patPtr->info) && (!bestModStateMask || (modStateMask && (modStateMask != bestModStateMask && (bestModStateMask & modStateMask) != modStateMask))))) { bestPtr = psPtr; bestCount = patPtr->count; bestInfo = patPtr->info; bestModStateMask = modStateMask; if (physPtrPtr) { bestPhysPtr = *physPtrPtr; } } psEntry->expired = true; /* remove it from promotion list */ } else if (psSuccList) { PSEntry *psEntry; /* * Not a final pattern, but matching, so promote it to next level. */ assert(!patPtr->name); psEntry = MakeListEntry(&bindPtr->lookupTables.entryPool, psPtr); assert(psEntry->isNew); PSList_Append(psSuccList, psEntry); psEntry->window = window; /* bind to current window */ } } } } } } if (bestPhysPtr) { *physPtrPtr = bestPhysPtr; } return bestPtr; } /* *-------------------------------------------------------------- * * ExpandPercents -- |
︙ | ︙ | |||
1905 1906 1907 1908 1909 1910 1911 | * None. * *-------------------------------------------------------------- */ static void ExpandPercents( | | < | < | < < < | | | < < < | < < > | > > > > | | < < < | > > > > < | < < > | | | > | | | | | < | | < | < < < | < | | | < | < < | < < | < | | < | | | | | | < < | | | < | | | | | < | < | < | | | | | | < < | | < | < | | < | < | < | < | | | | < < | | | | | | | | < < | | | | | | | | < < | | | | | | | | < < | | | | | | | < < | < | | < | | | | | < | | | | | < | | < | | | | | | | | < < < < | | < < < < | < < < | < | < < < | | | | | | > | | | > | | | < | | | > > | 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 | * None. * *-------------------------------------------------------------- */ static void ExpandPercents( TkWindow *winPtr, /* Window where event occurred: needed to get input context. */ const char *before, /* Command containing percent expressions to be replaced. */ Event *eventPtr, /* Event containing information to be used in % replacements. */ unsigned scriptCount, /* The number of script-based binding patterns matched so far for * this event. */ Tcl_DString *dsPtr) /* Dynamic string in which to append new command. */ { unsigned flags; Tcl_DString buf; XEvent *evPtr; assert(winPtr); assert(before); assert(eventPtr); assert(dsPtr); Tcl_DStringInit(&buf); evPtr = &eventPtr->xev; flags = (evPtr->type < TK_LASTEVENT) ? flagArray[evPtr->type] : 0; while (true) { char numStorage[TCL_INTEGER_SPACE]; const char *string; Tcl_WideInt number; /* * Find everything up to the next % character and append it to the * result string. */ for (string = before; *string && *string != '%'; ++string) ; if (string != before) { Tcl_DStringAppend(dsPtr, before, string - before); before = string; } if (!*before) { break; } /* * There's a percent sequence here. Process it. */ number = NO_NUMBER; string = "??"; switch (before[1]) { case '#': number = evPtr->xany.serial; break; case 'a': if (flags & CONFIG) { TkpPrintWindowId(numStorage, evPtr->xconfigure.above); string = numStorage; } break; case 'b': if (flags & BUTTON) { number = evPtr->xbutton.button; } break; case 'c': if (flags & EXPOSE) { number = evPtr->xexpose.count; } break; case 'd': if (flags & (CROSSING|FOCUS)) { int detail = (flags & FOCUS) ? evPtr->xfocus.detail : evPtr->xcrossing.detail; string = TkFindStateString(notifyDetail, detail); } else if (flags & CONFIGREQ) { if (evPtr->xconfigurerequest.value_mask & CWStackMode) { string = TkFindStateString(configureRequestDetail, evPtr->xconfigurerequest.detail); } else { string = ""; } } else if (flags & VIRTUAL) { XVirtualEvent *vePtr = (XVirtualEvent *) evPtr; string = vePtr->user_data ? Tcl_GetString(vePtr->user_data) : ""; } break; case 'f': if (flags & CROSSING) { number = evPtr->xcrossing.focus; } break; case 'h': if (flags & EXPOSE) { number = evPtr->xexpose.height; } else if (flags & CONFIG) { number = evPtr->xconfigure.height; } else if (flags & CREATE) { number = evPtr->xcreatewindow.height; } else if (flags & CONFIGREQ) { number = evPtr->xconfigurerequest.height; } else if (flags & RESIZEREQ) { number = evPtr->xresizerequest.height; } break; case 'i': if (flags & CREATE) { TkpPrintWindowId(numStorage, evPtr->xcreatewindow.window); } else if (flags & CONFIGREQ) { TkpPrintWindowId(numStorage, evPtr->xconfigurerequest.window); } else if (flags & MAPREQ) { TkpPrintWindowId(numStorage, evPtr->xmaprequest.window); } else { TkpPrintWindowId(numStorage, evPtr->xany.window); } string = numStorage; break; case 'k': if ((flags & KEY) && evPtr->type != MouseWheelEvent) { number = evPtr->xkey.keycode; } break; case 'm': if (flags & CROSSING) { string = TkFindStateString(notifyMode, evPtr->xcrossing.mode); } else if (flags & FOCUS) { string = TkFindStateString(notifyMode, evPtr->xfocus.mode); } break; case 'o': if (flags & CREATE) { number = evPtr->xcreatewindow.override_redirect; } else if (flags & MAP) { number = evPtr->xmap.override_redirect; } else if (flags & REPARENT) { number = evPtr->xreparent.override_redirect; } else if (flags & CONFIG) { number = evPtr->xconfigure.override_redirect; } break; case 'p': if (flags & CIRC) { string = TkFindStateString(circPlace, evPtr->xcirculate.place); } else if (flags & CIRCREQ) { string = TkFindStateString(circPlace, evPtr->xcirculaterequest.place); } break; case 's': if (flags & KEY_BUTTON_MOTION_VIRTUAL) { number = evPtr->xkey.state; } else if (flags & CROSSING) { number = evPtr->xcrossing.state; } else if (flags & PROP) { string = TkFindStateString(propNotify, evPtr->xproperty.state); } else if (flags & VISIBILITY) { string = TkFindStateString(visNotify, evPtr->xvisibility.state); } break; case 't': if (flags & KEY_BUTTON_MOTION_VIRTUAL) { number = (int) evPtr->xkey.time; } else if (flags & CROSSING) { number = (int) evPtr->xcrossing.time; } else if (flags & PROP) { number = (int) evPtr->xproperty.time; } break; case 'v': number = evPtr->xconfigurerequest.value_mask; break; case 'w': if (flags & EXPOSE) { number = evPtr->xexpose.width; } else if (flags & CONFIG) { number = evPtr->xconfigure.width; } else if (flags & CREATE) { number = evPtr->xcreatewindow.width; } else if (flags & CONFIGREQ) { number = evPtr->xconfigurerequest.width; } else if (flags & RESIZEREQ) { number = evPtr->xresizerequest.width; } break; case 'x': if (flags & KEY_BUTTON_MOTION_VIRTUAL) { number = evPtr->xkey.x; } else if (flags & CROSSING) { number = evPtr->xcrossing.x; } else if (flags & EXPOSE) { number = evPtr->xexpose.x; } else if (flags & (CREATE|CONFIG|GRAVITY)) { number = evPtr->xcreatewindow.x; } else if (flags & REPARENT) { number = evPtr->xreparent.x; } else if (flags & CREATE) { number = evPtr->xcreatewindow.x; } else if (flags & CONFIGREQ) { number = evPtr->xconfigurerequest.x; } break; case 'y': if (flags & KEY_BUTTON_MOTION_VIRTUAL) { number = evPtr->xkey.y; } else if (flags & EXPOSE) { number = evPtr->xexpose.y; } else if (flags & (CREATE|CONFIG|GRAVITY)) { number = evPtr->xcreatewindow.y; } else if (flags & REPARENT) { number = evPtr->xreparent.y; } else if (flags & CROSSING) { number = evPtr->xcrossing.y; } else if (flags & CREATE) { number = evPtr->xcreatewindow.y; } else if (flags & CONFIGREQ) { number = evPtr->xconfigurerequest.y; } break; case 'A': if ((flags & KEY) && evPtr->type != MouseWheelEvent) { Tcl_DStringFree(&buf); string = TkpGetString(winPtr, evPtr, &buf); } break; case 'B': if (flags & CREATE) { number = evPtr->xcreatewindow.border_width; } else if (flags & CONFIGREQ) { number = evPtr->xconfigurerequest.border_width; } else if (flags & CONFIG) { number = evPtr->xconfigure.border_width; } break; case 'D': /* * This is used only by the MouseWheel event. */ if ((flags & KEY) && evPtr->type == MouseWheelEvent) { number = evPtr->xkey.keycode; } break; case 'E': number = (int) evPtr->xany.send_event; break; case 'K': if ((flags & KEY) && evPtr->type != MouseWheelEvent) { const char *name = TkKeysymToString(eventPtr->detail.info); if (name) { string = name; } } break; case 'M': number = scriptCount; break; case 'N': if ((flags & KEY) && evPtr->type != MouseWheelEvent) { number = (int) eventPtr->detail.info; } break; case 'P': if (flags & PROP) { string = Tk_GetAtomName((Tk_Window) winPtr, evPtr->xproperty.atom); } break; case 'R': if (flags & KEY_BUTTON_MOTION_CROSSING) { TkpPrintWindowId(numStorage, evPtr->xkey.root); string = numStorage; } break; case 'S': if (flags & KEY_BUTTON_MOTION_CROSSING) { TkpPrintWindowId(numStorage, evPtr->xkey.subwindow); string = numStorage; } break; case 'T': number = evPtr->type; break; case 'W': { Tk_Window tkwin = Tk_IdToWindow(evPtr->xany.display, evPtr->xany.window); string = tkwin ? Tk_PathName(tkwin) : "??"; break; } case 'X': if (flags & KEY_BUTTON_MOTION_CROSSING) { number = evPtr->xkey.x_root; } break; case 'Y': if (flags & KEY_BUTTON_MOTION_CROSSING) { number = evPtr->xkey.y_root; } break; default: numStorage[0] = before[1]; numStorage[1] = '\0'; string = numStorage; break; } if (number != NO_NUMBER) { snprintf(numStorage, sizeof(numStorage), "%d", (int) number); string = numStorage; } { /* local scope */ int cvtFlags; unsigned spaceNeeded = Tcl_ScanElement(string, &cvtFlags); unsigned length = Tcl_DStringLength(dsPtr); Tcl_DStringSetLength(dsPtr, length + spaceNeeded); spaceNeeded = Tcl_ConvertElement( string, Tcl_DStringValue(dsPtr) + length, cvtFlags | TCL_DONT_USE_BRACES); Tcl_DStringSetLength(dsPtr, length + spaceNeeded); before += 2; } } Tcl_DStringFree(&buf); } /* *---------------------------------------------------------------------- * * ChangeScreen -- |
︙ | ︙ | |||
2307 2308 2309 2310 2311 2312 2313 | static void ChangeScreen( Tcl_Interp *interp, /* Interpreter in which to invoke command. */ char *dispName, /* Name of new display. */ int screenIndex) /* Index of new screen. */ { | | < | < | 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 | static void ChangeScreen( Tcl_Interp *interp, /* Interpreter in which to invoke command. */ char *dispName, /* Name of new display. */ int screenIndex) /* Index of new screen. */ { Tcl_Obj *cmdObj = Tcl_ObjPrintf("::tk::ScreenChanged %s.%d", dispName, screenIndex); int code; Tcl_IncrRefCount(cmdObj); code = Tcl_EvalObjEx(interp, cmdObj, TCL_EVAL_GLOBAL); if (code != TCL_OK) { Tcl_AddErrorInfo(interp, "\n (changing screen in event binding)"); Tcl_BackgroundException(interp, code); } Tcl_DecrRefCount(cmdObj); } /* *---------------------------------------------------------------------- |
︙ | ︙ | |||
2348 2349 2350 2351 2352 2353 2354 | Tcl_Interp *interp, /* Current interpreter. */ int objc, /* Number of arguments. */ Tcl_Obj *const objv[]) /* Argument objects. */ { int index, i; char *name; const char *event; | | | | > | < < < | < < > | | > > > > > > > > > > > > > > | < | | | | < > | < > | | < | 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 | Tcl_Interp *interp, /* Current interpreter. */ int objc, /* Number of arguments. */ Tcl_Obj *const objv[]) /* Argument objects. */ { int index, i; char *name; const char *event; Tk_Window tkwin; TkBindInfo bindInfo; VirtualEventTable *vetPtr; static const char *const optionStrings[] = { "add", "delete", "generate", "info", NULL }; enum options { EVENT_ADD, EVENT_DELETE, EVENT_GENERATE, EVENT_INFO }; assert(clientData); if (objc < 2) { Tcl_WrongNumArgs(interp, 1, objv, "option ?arg?"); return TCL_ERROR; } if (Tcl_GetIndexFromObjStruct( interp, objv[1], optionStrings, sizeof(char *), "option", 0, &index) != TCL_OK) { #ifdef SUPPORT_DEBUGGING if (strcmp(Tcl_GetString(objv[1]), "debug") == 0) { if (objc < 3) { Tcl_WrongNumArgs(interp, 1, objv, "debug number"); return TCL_ERROR; } Tcl_GetIntFromObj(interp, objv[2], &N); return TCL_OK; } #endif return TCL_ERROR; } tkwin = (Tk_Window) clientData; bindInfo = ((TkWindow *) tkwin)->mainPtr->bindInfo; vetPtr = &bindInfo->virtualEventTable; switch ((enum options) index) { case EVENT_ADD: if (objc < 4) { Tcl_WrongNumArgs(interp, 2, objv, "virtual sequence ?sequence ...?"); return TCL_ERROR; } name = Tcl_GetString(objv[2]); for (i = 3; i < objc; ++i) { event = Tcl_GetString(objv[i]); if (!CreateVirtualEvent(interp, vetPtr, name, event)) { return TCL_ERROR; } } break; case EVENT_DELETE: if (objc < 3) { Tcl_WrongNumArgs(interp, 2, objv, "virtual ?sequence ...?"); return TCL_ERROR; } name = Tcl_GetString(objv[2]); if (objc == 3) { return DeleteVirtualEvent(interp, vetPtr, name, NULL); } for (i = 3; i < objc; ++i) { event = Tcl_GetString(objv[i]); if (DeleteVirtualEvent(interp, vetPtr, name, event) != TCL_OK) { return TCL_ERROR; } } break; case EVENT_GENERATE: if (objc < 4) { Tcl_WrongNumArgs(interp, 2, objv, "window event ?-option value ...?"); return TCL_ERROR; } return HandleEventGenerate(interp, tkwin, objc - 2, objv + 2); case EVENT_INFO: if (objc == 2) { GetAllVirtualEvents(interp, vetPtr); return TCL_OK; } if (objc == 3) { return GetVirtualEvent(interp, vetPtr, objv[2]); } Tcl_WrongNumArgs(interp, 2, objv, "?virtual?"); return TCL_ERROR; } return TCL_OK; } /* *--------------------------------------------------------------------------- * |
︙ | ︙ | |||
2440 2441 2442 2443 2444 2445 2446 | * *vetPtr is now initialized. * *--------------------------------------------------------------------------- */ static void InitVirtualEventTable( | | < > > | | > | 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 | * *vetPtr is now initialized. * *--------------------------------------------------------------------------- */ static void InitVirtualEventTable( VirtualEventTable *vetPtr) /* Pointer to virtual event table. Memory is supplied by the caller. */ { assert(vetPtr); memset(vetPtr, 0, sizeof(*vetPtr)); Tcl_InitHashTable(&vetPtr->lookupTables.patternTable, sizeof(PatternTableKey)/sizeof(int)); Tcl_InitHashTable(&vetPtr->lookupTables.listTable, sizeof(PatternTableKey)/sizeof(int)); Tcl_InitHashTable(&vetPtr->nameTable, TCL_ONE_WORD_KEYS); PSList_Init(&vetPtr->lookupTables.entryPool); } /* *--------------------------------------------------------------------------- * * DeleteVirtualEventTable -- * |
︙ | ︙ | |||
2471 2472 2473 2474 2475 2476 2477 | static void DeleteVirtualEventTable( VirtualEventTable *vetPtr) /* The virtual event table to delete. */ { Tcl_HashEntry *hPtr; Tcl_HashSearch search; | | > | | > > > | < > | | | | > > > > | 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 | static void DeleteVirtualEventTable( VirtualEventTable *vetPtr) /* The virtual event table to delete. */ { Tcl_HashEntry *hPtr; Tcl_HashSearch search; assert(vetPtr); hPtr = Tcl_FirstHashEntry(&vetPtr->lookupTables.patternTable, &search); for ( ; hPtr; hPtr = Tcl_NextHashEntry(&search)) { PatSeq *nextPtr; PatSeq *psPtr; for (psPtr = Tcl_GetHashValue(hPtr); psPtr; psPtr = nextPtr) { nextPtr = psPtr->nextSeqPtr; assert(psPtr->added != 0xdeadbeef); DEBUG(psPtr->owned = false); FreePatSeq(psPtr); } } Tcl_DeleteHashTable(&vetPtr->lookupTables.patternTable); hPtr = Tcl_FirstHashEntry(&vetPtr->nameTable, &search); for ( ; hPtr; hPtr = Tcl_NextHashEntry(&search)) { ckfree(Tcl_GetHashValue(hPtr)); } Tcl_DeleteHashTable(&vetPtr->nameTable); ClearLookupTable(&vetPtr->lookupTables, NULL); Tcl_DeleteHashTable(&vetPtr->lookupTables.listTable); PSList_Clear(&vetPtr->lookupTables.entryPool); } /* *---------------------------------------------------------------------- * * CreateVirtualEvent -- * |
︙ | ︙ | |||
2511 2512 2513 2514 2515 2516 2517 | * Side effects: * The virtual event may cause future calls to Tk_BindEvent to behave * differently than they did previously. * *---------------------------------------------------------------------- */ | | | < < | < > > > > | < | | < < | > | < < < < < < < < < | < | < < < < < < | < | | < | < | < < < < < < < < < < | | 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 | * Side effects: * The virtual event may cause future calls to Tk_BindEvent to behave * differently than they did previously. * *---------------------------------------------------------------------- */ static bool CreateVirtualEvent( Tcl_Interp *interp, /* Used for error reporting. */ VirtualEventTable *vetPtr, /* Table in which to augment virtual event. */ char *virtString, /* Name of new virtual event. */ const char *eventString) /* String describing physical event that triggers virtual event. */ { PatSeq *psPtr; int dummy; Tcl_HashEntry *vhPtr; PhysOwned *owned; Tk_Uid virtUid; assert(vetPtr); assert(virtString); assert(eventString); if (!(virtUid = GetVirtualEventUid(interp, virtString))) { return false; } /* * Find/create physical event */ if (!(psPtr = FindSequence(interp, &vetPtr->lookupTables, NULL, eventString, true, false, NULL))) { return false; } assert(psPtr->added != 0xdeadbeef); /* * Find/create virtual event. */ vhPtr = Tcl_CreateHashEntry(&vetPtr->nameTable, virtUid, &dummy); /* * Make virtual event own the physical event. */ owned = Tcl_GetHashValue(vhPtr); if (PhysOwned_Find(owned, psPtr) == -1) { PhysOwned_Append(&owned, psPtr); Tcl_SetHashValue(vhPtr, owned); DEBUG(psPtr->owned = true); InsertPatSeq(&vetPtr->lookupTables, psPtr); /* Make physical event so it can trigger the virtual event. */ VirtOwners_Append(&psPtr->ptr.owners, vhPtr); } return true; } /* *-------------------------------------------------------------- * * DeleteVirtualEvent -- * |
︙ | ︙ | |||
2622 2623 2624 2625 2626 2627 2628 | *-------------------------------------------------------------- */ static int DeleteVirtualEvent( Tcl_Interp *interp, /* Used for error reporting. */ VirtualEventTable *vetPtr, /* Table in which to delete event. */ | | < | < | | | > > > > | < | < | | < > | < | < | | | | < < < < < < | | | < < | < | | < | | | | < | < < < < < < < < < < < < < < < < < < < < < | > > > > > > > | > > | | > > > | < | | < | 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 | *-------------------------------------------------------------- */ static int DeleteVirtualEvent( Tcl_Interp *interp, /* Used for error reporting. */ VirtualEventTable *vetPtr, /* Table in which to delete event. */ char *virtString, /* String describing event sequence that triggers binding. */ const char *eventString) /* The event sequence that should be deleted, or NULL to delete * all event sequences for the entire virtual event. */ { int iPhys; Tk_Uid virtUid; Tcl_HashEntry *vhPtr; PhysOwned *owned; const PatSeq *eventPSPtr; PatSeq *lastElemPtr; assert(vetPtr); assert(virtString); if (!(virtUid = GetVirtualEventUid(interp, virtString))) { return TCL_ERROR; } if (!(vhPtr = Tcl_FindHashEntry(&vetPtr->nameTable, virtUid))) { return TCL_OK; } owned = Tcl_GetHashValue(vhPtr); eventPSPtr = NULL; if (eventString) { LookupTables *lookupTables = &vetPtr->lookupTables; /* * Delete only the specific physical event associated with the virtual * event. If the physical event doesn't already exist, or the virtual * event doesn't own that physical event, return w/o doing anything. */ eventPSPtr = FindSequence(interp, lookupTables, NULL, eventString, false, false, NULL); if (!eventPSPtr) { const char *string = Tcl_GetString(Tcl_GetObjResult(interp)); return string[0] ? TCL_ERROR : TCL_OK; } } for (iPhys = PhysOwned_Size(owned); --iPhys >= 0; ) { PatSeq *psPtr = PhysOwned_Get(owned, iPhys); assert(psPtr->added != 0xdeadbeef); if (!eventPSPtr || psPtr == eventPSPtr) { VirtOwners *owners = psPtr->ptr.owners; int iVirt = VirtOwners_Find(owners, vhPtr); if (iVirt == -1) { Tcl_Panic("DeleteVirtualEvent: couldn't find owner"); } /* * Remove association between this physical event and the given * virtual event that it triggers. */ if (VirtOwners_Size(owners) > 1) { /* * This physical event still triggers some other virtual * event(s). Consolidate the list of virtual owners for this * physical event so it no longer triggers the given virtual * event. */ VirtOwners_Set(owners, iVirt, VirtOwners_Back(owners)); VirtOwners_PopBack(owners); } else { /* * Removed last reference to this physical event, so remove it * from physical->virtual map. And don't forget to remove it * from lookup tables. */ DEBUG(psPtr->owned = false); RemovePatSeqFromLookup(&vetPtr->lookupTables, psPtr); DeletePatSeq(psPtr); } /* * Now delete the virtual event's reference to the physical event. */ lastElemPtr = PhysOwned_Back(owned); if (PhysOwned_PopBack(owned) > 0 && eventPSPtr) { /* * Just deleting this one physical event. Consolidate list of * owned physical events and return. */ if (iPhys < PhysOwned_Size(owned)) { PhysOwned_Set(owned, iPhys, lastElemPtr); } return TCL_OK; } } } if (PhysOwned_IsEmpty(owned)) { /* * All the physical events for this virtual event were deleted, either * because there was only one associated physical event or because the * caller was deleting the entire virtual event. Now the virtual event * itself should be deleted. */ PhysOwned_Free(&owned); Tcl_DeleteHashEntry(vhPtr); } return TCL_OK; } /* *--------------------------------------------------------------------------- |
︙ | ︙ | |||
2785 2786 2787 2788 2789 2790 2791 | static int GetVirtualEvent( Tcl_Interp *interp, /* Interpreter for reporting. */ VirtualEventTable *vetPtr, /* Table in which to look for event. */ Tcl_Obj *virtName) /* String describing virtual event. */ { Tcl_HashEntry *vhPtr; | | | > > > | < | < | | | < | 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 | static int GetVirtualEvent( Tcl_Interp *interp, /* Interpreter for reporting. */ VirtualEventTable *vetPtr, /* Table in which to look for event. */ Tcl_Obj *virtName) /* String describing virtual event. */ { Tcl_HashEntry *vhPtr; unsigned iPhys; const PhysOwned *owned; Tk_Uid virtUid; Tcl_Obj *resultObj; assert(vetPtr); assert(virtName); if (!(virtUid = GetVirtualEventUid(interp, Tcl_GetString(virtName)))) { return TCL_ERROR; } if (!(vhPtr = Tcl_FindHashEntry(&vetPtr->nameTable, virtUid))) { return TCL_OK; } resultObj = Tcl_NewObj(); owned = Tcl_GetHashValue(vhPtr); for (iPhys = 0; iPhys < PhysOwned_Size(owned); ++iPhys) { Tcl_ListObjAppendElement(NULL, resultObj, GetPatternObj(PhysOwned_Get(owned, iPhys))); } Tcl_SetObjResult(interp, resultObj); return TCL_OK; } /* |
︙ | ︙ | |||
2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 | GetAllVirtualEvents( Tcl_Interp *interp, /* Interpreter returning result. */ VirtualEventTable *vetPtr) /* Table containing events. */ { Tcl_HashEntry *hPtr; Tcl_HashSearch search; Tcl_Obj *resultObj; resultObj = Tcl_NewObj(); hPtr = Tcl_FirstHashEntry(&vetPtr->nameTable, &search); | > > | > | < | 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 | GetAllVirtualEvents( Tcl_Interp *interp, /* Interpreter returning result. */ VirtualEventTable *vetPtr) /* Table containing events. */ { Tcl_HashEntry *hPtr; Tcl_HashSearch search; Tcl_Obj *resultObj; assert(vetPtr); resultObj = Tcl_NewObj(); hPtr = Tcl_FirstHashEntry(&vetPtr->nameTable, &search); for ( ; hPtr; hPtr = Tcl_NextHashEntry(&search)) { Tcl_Obj* msg = Tcl_ObjPrintf("<<%s>>", (char *) Tcl_GetHashKey(hPtr->tablePtr, hPtr)); Tcl_ListObjAppendElement(NULL, resultObj, msg); } Tcl_SetObjResult(interp, resultObj); } /* *--------------------------------------------------------------------------- * |
︙ | ︙ | |||
2889 2890 2891 2892 2893 2894 2895 | static int HandleEventGenerate( Tcl_Interp *interp, /* Interp for errors return and name lookup. */ Tk_Window mainWin, /* Main window associated with interp. */ int objc, /* Number of arguments. */ Tcl_Obj *const objv[]) /* Argument objects. */ { | | > | < > | > > > > > > > | > > | < | | < < | < | < | | < < | < | | | | | | < | < | > > | | | < | < < < | | | | | | < | | | | < | | | < | | | | < | < | < | < < | | | < | | | < | | | | | | | < > > > > | > > > | | | < | | < < | | | | > > > > | | > | | | | | | 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 3612 3613 3614 3615 3616 3617 3618 3619 3620 3621 3622 3623 3624 3625 3626 3627 3628 3629 3630 3631 3632 3633 3634 3635 3636 3637 3638 3639 3640 3641 3642 3643 3644 3645 3646 3647 3648 3649 3650 3651 3652 3653 3654 3655 3656 3657 3658 3659 3660 3661 3662 3663 3664 3665 3666 3667 3668 3669 3670 3671 3672 3673 3674 3675 3676 3677 3678 3679 3680 3681 3682 3683 3684 3685 3686 3687 3688 3689 3690 3691 3692 3693 3694 3695 3696 3697 3698 3699 3700 3701 3702 3703 3704 3705 3706 3707 3708 3709 3710 3711 3712 3713 3714 3715 3716 3717 3718 3719 3720 3721 3722 3723 3724 3725 3726 3727 3728 3729 3730 3731 3732 3733 3734 3735 3736 3737 3738 3739 3740 3741 3742 3743 3744 3745 3746 3747 3748 3749 3750 3751 3752 3753 3754 3755 3756 3757 3758 3759 3760 3761 3762 3763 3764 3765 3766 3767 3768 3769 3770 3771 3772 3773 3774 3775 3776 3777 3778 3779 3780 3781 3782 3783 3784 3785 3786 3787 3788 3789 3790 3791 3792 3793 3794 3795 3796 3797 3798 3799 3800 3801 3802 3803 3804 3805 3806 3807 3808 3809 3810 3811 3812 3813 3814 3815 3816 3817 3818 3819 3820 3821 3822 3823 3824 3825 3826 3827 3828 3829 3830 3831 3832 3833 3834 3835 3836 3837 3838 3839 3840 3841 3842 3843 3844 3845 3846 3847 3848 3849 3850 3851 3852 3853 3854 3855 3856 3857 3858 3859 3860 3861 3862 3863 3864 3865 3866 3867 3868 3869 3870 3871 3872 3873 3874 3875 3876 3877 3878 3879 3880 3881 3882 3883 3884 3885 3886 3887 3888 3889 3890 3891 3892 3893 3894 3895 3896 3897 3898 3899 3900 3901 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 3917 3918 3919 3920 3921 3922 3923 3924 3925 3926 3927 3928 3929 3930 3931 3932 3933 3934 3935 3936 3937 3938 3939 3940 3941 3942 3943 3944 3945 3946 3947 3948 3949 3950 3951 3952 3953 3954 3955 3956 3957 3958 3959 3960 3961 3962 3963 3964 3965 3966 3967 3968 3969 3970 3971 3972 3973 3974 3975 3976 3977 3978 3979 3980 3981 3982 3983 3984 3985 3986 3987 3988 3989 3990 3991 3992 3993 3994 3995 3996 3997 3998 3999 4000 4001 4002 4003 4004 4005 4006 4007 4008 4009 4010 4011 4012 4013 4014 4015 4016 4017 4018 4019 4020 4021 4022 4023 4024 4025 4026 4027 4028 4029 4030 4031 4032 4033 4034 4035 4036 4037 | static int HandleEventGenerate( Tcl_Interp *interp, /* Interp for errors return and name lookup. */ Tk_Window mainWin, /* Main window associated with interp. */ int objc, /* Number of arguments. */ Tcl_Obj *const objv[]) /* Argument objects. */ { union { XEvent general; XVirtualEvent virtual; } event; const char *p; const char *name; const char *windowName; Tcl_QueuePosition pos; TkPattern pat; Tk_Window tkwin; Tk_Window tkwin2; TkWindow *mainPtr; unsigned long eventMask; Tcl_Obj *userDataObj; bool synch; bool warp; unsigned count; unsigned flags; int number; unsigned i; static const char *const fieldStrings[] = { "-when", "-above", "-borderwidth", "-button", "-count", "-data", "-delta", "-detail", "-focus", "-height", "-keycode", "-keysym", "-mode", "-override", "-place", "-root", "-rootx", "-rooty", "-sendevent", "-serial", "-state", "-subwindow", "-time", "-warp", "-width", "-window", "-x", "-y", NULL }; enum field { EVENT_WHEN, EVENT_ABOVE, EVENT_BORDER, EVENT_BUTTON, EVENT_COUNT, EVENT_DATA, EVENT_DELTA, EVENT_DETAIL, EVENT_FOCUS, EVENT_HEIGHT, EVENT_KEYCODE, EVENT_KEYSYM, EVENT_MODE, EVENT_OVERRIDE, EVENT_PLACE, EVENT_ROOT, EVENT_ROOTX, EVENT_ROOTY, EVENT_SEND, EVENT_SERIAL, EVENT_STATE, EVENT_SUBWINDOW, EVENT_TIME, EVENT_WARP, EVENT_WIDTH, EVENT_WINDOW, EVENT_X, EVENT_Y }; assert(mainWin); windowName = Tcl_GetString(objv[0]); if (!windowName[0]) { tkwin = mainWin; } else if (!NameToWindow(interp, mainWin, objv[0], &tkwin)) { return TCL_ERROR; } mainPtr = (TkWindow *) mainWin; if (!tkwin || mainPtr->mainPtr != ((TkWindow *) tkwin)->mainPtr) { Tcl_SetObjResult(interp, Tcl_ObjPrintf( "window id \"%s\" doesn't exist in this application", Tcl_GetString(objv[0]))); Tcl_SetErrorCode(interp, "TK", "LOOKUP", "WINDOW", Tcl_GetString(objv[0]), NULL); return TCL_ERROR; } name = Tcl_GetString(objv[1]); p = name; eventMask = 0; userDataObj = NULL; if ((count = ParseEventDescription(interp, &p, &pat, &eventMask)) == 0) { return TCL_ERROR; } if (count != 1) { Tcl_SetObjResult(interp, Tcl_NewStringObj("Double or Triple modifier not allowed", -1)); Tcl_SetErrorCode(interp, "TK", "EVENT", "BAD_MODIFIER", NULL); return TCL_ERROR; } if (*p) { Tcl_SetObjResult(interp, Tcl_NewStringObj("only one event specification allowed", -1)); Tcl_SetErrorCode(interp, "TK", "EVENT", "MULTIPLE", NULL); return TCL_ERROR; } memset(&event, 0, sizeof(event)); event.general.xany.type = pat.eventType; event.general.xany.serial = NextRequest(Tk_Display(tkwin)); event.general.xany.send_event = False; if (windowName[0]) { event.general.xany.window = Tk_WindowId(tkwin); } else { event.general.xany.window = RootWindow(Tk_Display(tkwin), Tk_ScreenNumber(tkwin)); } event.general.xany.display = Tk_Display(tkwin); flags = flagArray[event.general.xany.type]; if (flags & DESTROY) { /* * Event DestroyNotify should be generated by destroying the window. */ Tk_DestroyWindow(tkwin); return TCL_OK; } if (flags & KEY_BUTTON_MOTION_VIRTUAL) { event.general.xkey.state = pat.modStateMask; if ((flags & KEY) && event.general.xany.type != MouseWheelEvent) { TkpSetKeycodeAndState(tkwin, pat.info, &event.general); } else if (flags & BUTTON) { event.general.xbutton.button = pat.info; } else if (flags & VIRTUAL) { event.virtual.name = pat.name; } } if (flags & (CREATE|UNMAP|MAP|REPARENT|CONFIG|GRAVITY|CIRC)) { event.general.xcreatewindow.window = event.general.xany.window; } if (flags & KEY_BUTTON_MOTION_CROSSING) { event.general.xkey.x_root = -1; event.general.xkey.y_root = -1; } if (event.general.xany.type == FocusIn || event.general.xany.type == FocusOut) { event.general.xany.send_event = GENERATED_FOCUS_EVENT_MAGIC; } /* * Process the remaining arguments to fill in additional fields of the event. */ synch = true; warp = 0; pos = TCL_QUEUE_TAIL; for (i = 2; i < objc; i += 2) { Tcl_Obj *optionPtr, *valuePtr; bool badOpt = false; int index; optionPtr = objv[i]; valuePtr = objv[i + 1]; if (Tcl_GetIndexFromObjStruct(interp, optionPtr, fieldStrings, sizeof(char *), "option", TCL_EXACT, &index) != TCL_OK) { return TCL_ERROR; } if (IsOdd(objc)) { /* * This test occurs after Tcl_GetIndexFromObj() so that "event * generate <Button> -xyz" will return the error message that * "-xyz" is a bad option, rather than that the value for "-xyz" * is missing. */ Tcl_SetObjResult(interp, Tcl_ObjPrintf( "value for \"%s\" missing", Tcl_GetString(optionPtr))); Tcl_SetErrorCode(interp, "TK", "EVENT", "MISSING_VALUE", NULL); return TCL_ERROR; } switch ((enum field) index) { case EVENT_WARP: if (Tcl_GetBooleanFromObj(interp, valuePtr, &warp) != TCL_OK) { return TCL_ERROR; } if (!(flags & KEY_BUTTON_MOTION_VIRTUAL)) { badOpt = true; } break; case EVENT_WHEN: pos = (Tcl_QueuePosition) TkFindStateNumObj(interp, optionPtr, queuePosition, valuePtr); if ((int) pos < -1) { return TCL_ERROR; } synch = (pos == -1); break; case EVENT_ABOVE: if (!NameToWindow(interp, tkwin, valuePtr, &tkwin2)) { return TCL_ERROR; } if (flags & CONFIG) { event.general.xconfigure.above = Tk_WindowId(tkwin2); } else { badOpt = true; } break; case EVENT_BORDER: if (Tk_GetPixelsFromObj(interp, tkwin, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & (CREATE|CONFIG)) { event.general.xcreatewindow.border_width = number; } else { badOpt = true; } break; case EVENT_BUTTON: if (Tcl_GetIntFromObj(interp, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & BUTTON) { event.general.xbutton.button = number; } else { badOpt = true; } break; case EVENT_COUNT: if (Tcl_GetIntFromObj(interp, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & EXPOSE) { event.general.xexpose.count = number; } else { badOpt = true; } break; case EVENT_DATA: if (flags & VIRTUAL) { /* * Do not increment reference count until after parsing * completes and we know that the event generation is really * going to happen. */ userDataObj = valuePtr; } else { badOpt = true; } break; case EVENT_DELTA: if (Tcl_GetIntFromObj(interp, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if ((flags & KEY) && event.general.xkey.type == MouseWheelEvent) { event.general.xkey.keycode = number; } else { badOpt = true; } break; case EVENT_DETAIL: number = TkFindStateNumObj(interp, optionPtr, notifyDetail, valuePtr); if (number < 0) { return TCL_ERROR; } if (flags & FOCUS) { event.general.xfocus.detail = number; } else if (flags & CROSSING) { event.general.xcrossing.detail = number; } else { badOpt = true; } break; case EVENT_FOCUS: if (Tcl_GetBooleanFromObj(interp, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & CROSSING) { event.general.xcrossing.focus = number; } else { badOpt = true; } break; case EVENT_HEIGHT: if (Tk_GetPixelsFromObj(interp, tkwin, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & EXPOSE) { event.general.xexpose.height = number; } else if (flags & CONFIG) { event.general.xconfigure.height = number; } else { badOpt = true; } break; case EVENT_KEYCODE: if (Tcl_GetIntFromObj(interp, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if ((flags & KEY) && event.general.xkey.type != MouseWheelEvent) { event.general.xkey.keycode = number; } else { badOpt = true; } break; case EVENT_KEYSYM: { KeySym keysym; const char *value; value = Tcl_GetString(valuePtr); keysym = TkStringToKeysym(value); if (keysym == NoSymbol) { Tcl_SetObjResult(interp, Tcl_ObjPrintf("unknown keysym \"%s\"", value)); Tcl_SetErrorCode(interp, "TK", "LOOKUP", "KEYSYM", value, NULL); return TCL_ERROR; } TkpSetKeycodeAndState(tkwin, keysym, &event.general); if (event.general.xkey.keycode == 0) { Tcl_SetObjResult(interp, Tcl_ObjPrintf("no keycode for keysym \"%s\"", value)); Tcl_SetErrorCode(interp, "TK", "LOOKUP", "KEYCODE", value, NULL); return TCL_ERROR; } if (!(flags & KEY) || (event.general.xkey.type == MouseWheelEvent)) { badOpt = true; } break; } case EVENT_MODE: if ((number = TkFindStateNumObj(interp,optionPtr,notifyMode,valuePtr)) < 0) { return TCL_ERROR; } if (flags & CROSSING) { event.general.xcrossing.mode = number; } else if (flags & FOCUS) { event.general.xfocus.mode = number; } else { badOpt = true; } break; case EVENT_OVERRIDE: if (Tcl_GetBooleanFromObj(interp, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & CREATE) { event.general.xcreatewindow.override_redirect = number; } else if (flags & MAP) { event.general.xmap.override_redirect = number; } else if (flags & REPARENT) { event.general.xreparent.override_redirect = number; } else if (flags & CONFIG) { event.general.xconfigure.override_redirect = number; } else { badOpt = true; } break; case EVENT_PLACE: if ((number = TkFindStateNumObj(interp, optionPtr, circPlace, valuePtr)) < 0) { return TCL_ERROR; } if (flags & CIRC) { event.general.xcirculate.place = number; } else { badOpt = true; } break; case EVENT_ROOT: if (!NameToWindow(interp, tkwin, valuePtr, &tkwin2)) { return TCL_ERROR; } if (flags & KEY_BUTTON_MOTION_CROSSING) { event.general.xkey.root = Tk_WindowId(tkwin2); } else { badOpt = true; } break; case EVENT_ROOTX: if (Tk_GetPixelsFromObj(interp, tkwin, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & KEY_BUTTON_MOTION_CROSSING) { event.general.xkey.x_root = number; } else { badOpt = true; } break; case EVENT_ROOTY: if (Tk_GetPixelsFromObj(interp, tkwin, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & KEY_BUTTON_MOTION_CROSSING) { event.general.xkey.y_root = number; } else { badOpt = true; } break; case EVENT_SEND: { const char *value; value = Tcl_GetString(valuePtr); if (isdigit(UCHAR(value[0]))) { /* * Allow arbitrary integer values for the field; they are * needed by a few of the tests in the Tk test suite. */ if (Tcl_GetIntFromObj(interp, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (number) { /* * send_event only expects True or False. We cannot allow arbitrary non-zero * values, otherwise the thing with GENERATED_FOCUS_EVENT_MAGIC will not * work. */ number = True; } } else if (Tcl_GetBooleanFromObj(interp, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } event.general.xany.send_event |= number; break; } case EVENT_SERIAL: if (Tcl_GetIntFromObj(interp, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } event.general.xany.serial = number; break; case EVENT_STATE: if (flags & KEY_BUTTON_MOTION_CROSSING) { if (Tcl_GetIntFromObj(interp, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & KEY_BUTTON_MOTION_VIRTUAL) { event.general.xkey.state = number; } else { event.general.xcrossing.state = number; } } else if (flags & VISIBILITY) { if ((number = TkFindStateNumObj(interp, optionPtr, visNotify, valuePtr)) < 0) { return TCL_ERROR; } event.general.xvisibility.state = number; } else { badOpt = true; } break; case EVENT_SUBWINDOW: if (!NameToWindow(interp, tkwin, valuePtr, &tkwin2)) { return TCL_ERROR; } if (flags & KEY_BUTTON_MOTION_CROSSING) { event.general.xkey.subwindow = Tk_WindowId(tkwin2); } else { badOpt = true; } break; case EVENT_TIME: { if (strcmp(Tcl_GetString(valuePtr), "current") == 0) { TkDisplay *dispPtr = ((TkWindow *) tkwin)->dispPtr; BindInfo *biPtr = mainPtr->mainPtr->bindInfo; number = dispPtr->lastEventTime + (CurrentTimeInMilliSecs() - biPtr->lastCurrentTime); } else if (Tcl_GetIntFromObj(interp, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & KEY_BUTTON_MOTION_CROSSING) { event.general.xkey.time = number; } else if (flags & PROP) { event.general.xproperty.time = number; } else { badOpt = true; } break; } case EVENT_WIDTH: if (Tk_GetPixelsFromObj(interp, tkwin, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & EXPOSE) { event.general.xexpose.width = number; } else if (flags & (CREATE|CONFIG)) { event.general.xcreatewindow.width = number; } else { badOpt = true; } break; case EVENT_WINDOW: if (!NameToWindow(interp, tkwin, valuePtr, &tkwin2)) { return TCL_ERROR; } if (flags & (CREATE|UNMAP|MAP|REPARENT|CONFIG|GRAVITY|CIRC)) { event.general.xcreatewindow.window = Tk_WindowId(tkwin2); } else { badOpt = true; } break; case EVENT_X: if (Tk_GetPixelsFromObj(interp, tkwin, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & KEY_BUTTON_MOTION_CROSSING) { event.general.xkey.x = number; /* * Only modify rootx as well if it hasn't been changed. |
︙ | ︙ | |||
3383 3384 3385 3386 3387 3388 3389 | } else if (flags & EXPOSE) { event.general.xexpose.x = number; } else if (flags & (CREATE|CONFIG|GRAVITY)) { event.general.xcreatewindow.x = number; } else if (flags & REPARENT) { event.general.xreparent.x = number; } else { | | | | 4046 4047 4048 4049 4050 4051 4052 4053 4054 4055 4056 4057 4058 4059 4060 4061 4062 4063 4064 | } else if (flags & EXPOSE) { event.general.xexpose.x = number; } else if (flags & (CREATE|CONFIG|GRAVITY)) { event.general.xcreatewindow.x = number; } else if (flags & REPARENT) { event.general.xreparent.x = number; } else { badOpt = true; } break; case EVENT_Y: if (Tk_GetPixelsFromObj(interp, tkwin, valuePtr, &number) != TCL_OK) { return TCL_ERROR; } if (flags & KEY_BUTTON_MOTION_CROSSING) { event.general.xkey.y = number; /* * Only modify rooty as well if it hasn't been changed. |
︙ | ︙ | |||
3410 3411 3412 3413 3414 3415 3416 | } else if (flags & EXPOSE) { event.general.xexpose.y = number; } else if (flags & (CREATE|CONFIG|GRAVITY)) { event.general.xcreatewindow.y = number; } else if (flags & REPARENT) { event.general.xreparent.y = number; } else { | | < | | | < | | > | < < < | < | | | | | | < | | | | | | | | | | | | | | | | | | < | | | | | | | | | | | | | | | | | | | > > | > > > > > > > > > > > > > > | | > > > > > > | < | > > | | < < | < < | | > > | | > | < | < > | | 4073 4074 4075 4076 4077 4078 4079 4080 4081 4082 4083 4084 4085 4086 4087 4088 4089 4090 4091 4092 4093 4094 4095 4096 4097 4098 4099 4100 4101 4102 4103 4104 4105 4106 4107 4108 4109 4110 4111 4112 4113 4114 4115 4116 4117 4118 4119 4120 4121 4122 4123 4124 4125 4126 4127 4128 4129 4130 4131 4132 4133 4134 4135 4136 4137 4138 4139 4140 4141 4142 4143 4144 4145 4146 4147 4148 4149 4150 4151 4152 4153 4154 4155 4156 4157 4158 4159 4160 4161 4162 4163 4164 4165 4166 4167 4168 4169 4170 4171 4172 4173 4174 4175 4176 4177 4178 4179 4180 4181 4182 4183 4184 4185 4186 4187 4188 4189 4190 4191 4192 4193 4194 4195 4196 4197 4198 4199 4200 4201 4202 4203 4204 4205 4206 4207 4208 4209 4210 4211 4212 4213 4214 4215 4216 4217 4218 4219 | } else if (flags & EXPOSE) { event.general.xexpose.y = number; } else if (flags & (CREATE|CONFIG|GRAVITY)) { event.general.xcreatewindow.y = number; } else if (flags & REPARENT) { event.general.xreparent.y = number; } else { badOpt = true; } break; } if (badOpt) { Tcl_SetObjResult(interp, Tcl_ObjPrintf( "%s event doesn't accept \"%s\" option", name, Tcl_GetString(optionPtr))); Tcl_SetErrorCode(interp, "TK", "EVENT", "BAD_OPTION", NULL); return TCL_ERROR; } } /* * Don't generate events for windows that don't exist yet. */ if (event.general.xany.window) { if (userDataObj) { /* * Must be virtual event to set that variable to non-NULL. Now we want * to install the object into the event. Note that we must incr the * refcount before firing it into the low-level event subsystem; the * refcount will be decremented once the event has been processed. */ event.virtual.user_data = userDataObj; Tcl_IncrRefCount(userDataObj); } /* * Now we have constructed the event, inject it into the event handling * code. */ if (synch) { Tk_HandleEvent(&event.general); } else { Tk_QueueWindowEvent(&event.general, pos); } /* * We only allow warping if the window is mapped. */ if (warp && Tk_IsMapped(tkwin)) { TkDisplay *dispPtr = TkGetDisplay(event.general.xmotion.display); Tk_Window warpWindow = Tk_IdToWindow(dispPtr->display, event.general.xmotion.window); if (!(dispPtr->flags & TK_DISPLAY_IN_WARP)) { Tcl_DoWhenIdle(DoWarp, dispPtr); dispPtr->flags |= TK_DISPLAY_IN_WARP; } if (warpWindow != dispPtr->warpWindow) { if (warpWindow) { Tcl_Preserve(warpWindow); } if (dispPtr->warpWindow) { Tcl_Release(dispPtr->warpWindow); } dispPtr->warpWindow = warpWindow; } dispPtr->warpMainwin = mainWin; dispPtr->warpX = event.general.xmotion.x; dispPtr->warpY = event.general.xmotion.y; } } Tcl_ResetResult(interp); return TCL_OK; } /* *--------------------------------------------------------------------------- * * NameToWindow -- * * Helper function for lookup of a window given its path name. Our * version is able to handle window id's. * * Results: * None. * * Side effects: * None. * *--------------------------------------------------------------------------- */ static bool NameToWindow( Tcl_Interp *interp, /* Interp for error return and name lookup. */ Tk_Window mainWin, /* Main window of application. */ Tcl_Obj *objPtr, /* Contains name or id string of window. */ Tk_Window *tkwinPtr) /* Filled with token for window. */ { const char *name; Tk_Window tkwin; assert(mainWin); assert(objPtr); assert(tkwinPtr); name = Tcl_GetString(objPtr); if (name[0] == '.') { if (!(tkwin = Tk_NameToWindow(interp, name, mainWin))) { return false; } } else { Window id; tkwin = NULL; /* * Check for the winPtr being valid, even if it looks okay to * TkpScanWindowId. [Bug #411307] */ if (TkpScanWindowId(NULL, name, &id) == TCL_OK) { tkwin = Tk_IdToWindow(Tk_Display(mainWin), id); } if (!tkwin) { Tcl_SetObjResult(interp, Tcl_ObjPrintf("bad window name/identifier \"%s\"", name)); Tcl_SetErrorCode(interp, "TK", "LOOKUP", "WINDOW_ID", name, NULL); return false; } } assert(tkwin); *tkwinPtr = tkwin; return true; } /* *------------------------------------------------------------------------- * * DoWarp -- * |
︙ | ︙ | |||
3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 | static void DoWarp( ClientData clientData) { TkDisplay *dispPtr = clientData; /* * DoWarp was scheduled only if the window was mapped. It needs to be * still mapped at the time the present idle callback is executed. Also * one needs to guard against window destruction in the meantime. * Finally, the case warpWindow == NULL is special in that it means * the whole screen. */ | > > | | < | 4230 4231 4232 4233 4234 4235 4236 4237 4238 4239 4240 4241 4242 4243 4244 4245 4246 4247 4248 4249 4250 4251 4252 4253 4254 4255 | static void DoWarp( ClientData clientData) { TkDisplay *dispPtr = clientData; assert(clientData); /* * DoWarp was scheduled only if the window was mapped. It needs to be * still mapped at the time the present idle callback is executed. Also * one needs to guard against window destruction in the meantime. * Finally, the case warpWindow == NULL is special in that it means * the whole screen. */ if (!dispPtr->warpWindow || (Tk_IsMapped(dispPtr->warpWindow) && Tk_WindowId(dispPtr->warpWindow) != None)) { TkpWarpPointer(dispPtr); XForceScreenSaver(dispPtr->display, ScreenSaverReset); } if (dispPtr->warpWindow) { Tcl_Release(dispPtr->warpWindow); dispPtr->warpWindow = None; |
︙ | ︙ | |||
3602 3603 3604 3605 3606 3607 3608 3609 3610 3611 | static Tk_Uid GetVirtualEventUid( Tcl_Interp *interp, char *virtString) { Tk_Uid uid; size_t length; length = strlen(virtString); | > > | > > > | | < | 4280 4281 4282 4283 4284 4285 4286 4287 4288 4289 4290 4291 4292 4293 4294 4295 4296 4297 4298 4299 4300 4301 4302 4303 4304 | static Tk_Uid GetVirtualEventUid( Tcl_Interp *interp, char *virtString) { Tk_Uid uid; size_t length; assert(virtString); length = strlen(virtString); if (length < 5 || virtString[0] != '<' || virtString[1] != '<' || virtString[length - 2] != '>' || virtString[length - 1] != '>') { Tcl_SetObjResult(interp, Tcl_ObjPrintf("virtual event \"%s\" is badly formed", virtString)); Tcl_SetErrorCode(interp, "TK", "EVENT", "VIRTUAL", "MALFORMED", NULL); return NULL; } virtString[length - 2] = '\0'; uid = Tk_GetUid(virtString + 2); virtString[length - 2] = '>'; |
︙ | ︙ | |||
3646 3647 3648 3649 3650 3651 3652 | * *---------------------------------------------------------------------- */ static PatSeq * FindSequence( Tcl_Interp *interp, /* Interpreter to use for error reporting. */ | < | | | < | | | < | | | | | | > > | | | | > | > > > > > | | < < | | | | | | | < < < < < | < | | > | | < | | | < < < > > | < < < < < | > | | | | | < > | | < | | | > | < < | > | > | | < | | > > > | < > | > > > < | > | < | < | > | 4328 4329 4330 4331 4332 4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 4350 4351 4352 4353 4354 4355 4356 4357 4358 4359 4360 4361 4362 4363 4364 4365 4366 4367 4368 4369 4370 4371 4372 4373 4374 4375 4376 4377 4378 4379 4380 4381 4382 4383 4384 4385 4386 4387 4388 4389 4390 4391 4392 4393 4394 4395 4396 4397 4398 4399 4400 4401 4402 4403 4404 4405 4406 4407 4408 4409 4410 4411 4412 4413 4414 4415 4416 4417 4418 4419 4420 4421 4422 4423 4424 4425 4426 4427 4428 4429 4430 4431 4432 4433 4434 4435 4436 4437 4438 4439 4440 4441 4442 4443 4444 4445 4446 4447 4448 4449 4450 4451 4452 4453 4454 4455 4456 4457 4458 4459 4460 4461 4462 4463 4464 4465 4466 4467 4468 4469 4470 4471 4472 4473 4474 4475 4476 4477 4478 4479 4480 4481 | * *---------------------------------------------------------------------- */ static PatSeq * FindSequence( Tcl_Interp *interp, /* Interpreter to use for error reporting. */ LookupTables *lookupTables, /* Tables used for lookup. */ ClientData object, /* For binding table, token for object with which binding is * associated. For virtual event table, NULL. */ const char *eventString, /* String description of pattern to match on. See user * documentation for details. */ bool create, /* False means don't create the entry if it doesn't already exist. * True means create. */ bool allowVirtual, /* False means that virtual events are not allowed in the sequence. * True otherwise. */ unsigned long *maskPtr) /* *maskPtr is filled in with the event types on which this * pattern sequence depends. */ { unsigned patsBufSize = 1; unsigned numPats; unsigned totalCount = 0; bool virtualFound = false; const char *p = eventString; TkPattern *patPtr; PatSeq *psPtr; Tcl_HashEntry *hPtr; bool isNew; unsigned count; unsigned maxCount = 0; unsigned long eventMask = 0; PatternTableKey key; assert(lookupTables); assert(eventString); psPtr = ckalloc(sizeof(PatSeq) + (patsBufSize - 1)*sizeof(TkPattern)); /* *------------------------------------------------------------------ * Step 1: parse the pattern string to produce an array of Patterns. *------------------------------------------------------------------ */ for (patPtr = psPtr->pats, numPats = 0; *(p = SkipSpaces(p)); ++patPtr, ++numPats) { if (numPats >= patsBufSize) { unsigned pos = patPtr - psPtr->pats; patsBufSize *= 2; psPtr = ckrealloc(psPtr, sizeof(PatSeq) + (patsBufSize - 1)*sizeof(TkPattern)); patPtr = psPtr->pats + pos; } if ((count = ParseEventDescription(interp, &p, patPtr, &eventMask)) == 0) { /* error encountered */ ckfree(psPtr); return NULL; } if (eventMask & VirtualEventMask) { if (!allowVirtual) { Tcl_SetObjResult(interp, Tcl_NewStringObj( "virtual event not allowed in definition of another virtual event", -1)); Tcl_SetErrorCode(interp, "TK", "EVENT", "VIRTUAL", "INNER", NULL); ckfree(psPtr); return NULL; } virtualFound = true; } if (count > 1) { maxCount = Max(count, maxCount); } totalCount += count; } /* *------------------------------------------------------------------ * Step 2: find the sequence in the binding table if it exists, and * add a new sequence to the table if it doesn't. *------------------------------------------------------------------ */ if (numPats == 0) { Tcl_SetObjResult(interp, Tcl_NewStringObj("no events specified in binding", -1)); Tcl_SetErrorCode(interp, "TK", "EVENT", "NO_EVENTS", NULL); ckfree(psPtr); return NULL; } if (numPats > 1 && virtualFound) { Tcl_SetObjResult(interp, Tcl_NewStringObj("virtual events may not be composed", -1)); Tcl_SetErrorCode(interp, "TK", "EVENT", "VIRTUAL", "COMPOSITION", NULL); ckfree(psPtr); return NULL; } patPtr = psPtr->pats; psPtr->object = object; memset(&key, 0, sizeof(key)); SetupPatternKey(&key, psPtr); hPtr = Tcl_CreateHashEntry(&lookupTables->patternTable, (char *) &key, &isNew); if (!isNew) { unsigned sequenceSize = numPats*sizeof(TkPattern); PatSeq *psPtr2; for (psPtr2 = Tcl_GetHashValue(hPtr); psPtr2; psPtr2 = psPtr2->nextSeqPtr) { if (numPats == psPtr2->numPats && memcmp(patPtr, psPtr2->pats, sequenceSize) == 0) { ckfree(psPtr); if (maskPtr) { *maskPtr = eventMask; } return psPtr2; } } } if (!create) { if (isNew) { Tcl_DeleteHashEntry(hPtr); } /* * No binding exists for the sequence, so return an empty error. This * is a special error that the caller will check for in order to * silently ignore this case. This is a hack that maintains backward * compatibility for Tk_GetBinding but the various "bind" commands * silently ignore missing bindings. */ ckfree(psPtr); return NULL; } psPtr->numPats = numPats; psPtr->count = totalCount; psPtr->number = lookupTables->number++; psPtr->added = false; psPtr->script = NULL; psPtr->nextSeqPtr = Tcl_GetHashValue(hPtr); psPtr->hPtr = hPtr; psPtr->ptr.nextObj = NULL; assert(psPtr->ptr.owners == NULL); DEBUG(psPtr->owned = false); Tcl_SetHashValue(hPtr, psPtr); if (maskPtr) { *maskPtr = eventMask; } return psPtr; } /* *--------------------------------------------------------------------------- * * ParseEventDescription -- |
︙ | ︙ | |||
3814 3815 3816 3817 3818 3819 3820 | * On exit, eventStringPtr points to rest of event string (after the * closing '>', so that this function can be called repeatedly to parse * all the events in the entire sequence. * *--------------------------------------------------------------------------- */ | > | > > > > > > > > > > > > > > > > > > > | < | | < | | | | < < | > > < | | | | < < | | | | > > | < < | < < < > | < < | | | < | | | | | | | | | | | | | | < | | | | | | < | | > > > | | > | > | < < < < | | > | < < < < < < < | > > > > > > > > > | > | | > | | | > > > | < | | | | | | | | | | | | < | | | | | | | | | | | < < > | | < | | < | | | | < < < | | | > | > | > > > > > > > > > > | | < < < < < < < < < | < | > > > | | | < < | < < < < | | | | > | > > | > | | > > > > > > > > | | > | > | > > > > > > > > > | > | > | < < < > > | > | < < | | | | | > | > | | < < | | > | > | < < < | | | > | | < < | | 4492 4493 4494 4495 4496 4497 4498 4499 4500 4501 4502 4503 4504 4505 4506 4507 4508 4509 4510 4511 4512 4513 4514 4515 4516 4517 4518 4519 4520 4521 4522 4523 4524 4525 4526 4527 4528 4529 4530 4531 4532 4533 4534 4535 4536 4537 4538 4539 4540 4541 4542 4543 4544 4545 4546 4547 4548 4549 4550 4551 4552 4553 4554 4555 4556 4557 4558 4559 4560 4561 4562 4563 4564 4565 4566 4567 4568 4569 4570 4571 4572 4573 4574 4575 4576 4577 4578 4579 4580 4581 4582 4583 4584 4585 4586 4587 4588 4589 4590 4591 4592 4593 4594 4595 4596 4597 4598 4599 4600 4601 4602 4603 4604 4605 4606 4607 4608 4609 4610 4611 4612 4613 4614 4615 4616 4617 4618 4619 4620 4621 4622 4623 4624 4625 4626 4627 4628 4629 4630 4631 4632 4633 4634 4635 4636 4637 4638 4639 4640 4641 4642 4643 4644 4645 4646 4647 4648 4649 4650 4651 4652 4653 4654 4655 4656 4657 4658 4659 4660 4661 4662 4663 4664 4665 4666 4667 4668 4669 4670 4671 4672 4673 4674 4675 4676 4677 4678 4679 4680 4681 4682 4683 4684 4685 4686 4687 4688 4689 4690 4691 4692 4693 4694 4695 4696 4697 4698 4699 4700 4701 4702 4703 4704 4705 4706 4707 4708 4709 4710 4711 4712 4713 4714 4715 4716 4717 4718 4719 4720 4721 4722 4723 4724 4725 4726 4727 4728 4729 4730 4731 4732 4733 4734 4735 4736 4737 4738 4739 4740 4741 4742 4743 4744 4745 4746 4747 4748 4749 4750 4751 4752 4753 4754 4755 4756 4757 4758 4759 4760 4761 4762 4763 4764 4765 4766 | * On exit, eventStringPtr points to rest of event string (after the * closing '>', so that this function can be called repeatedly to parse * all the events in the entire sequence. * *--------------------------------------------------------------------------- */ /* helper function */ static unsigned FinalizeParseEventDescription( Tcl_Interp *interp, TkPattern *patPtr, unsigned count, Tcl_Obj* errorObj, const char* errCode) { assert(patPtr); assert(copy); if (errorObj) { Tcl_SetObjResult(interp, errorObj); Tcl_SetErrorCode(interp, "TK", "EVENT", errCode, NULL); } patPtr->count = count; return count; } static unsigned ParseEventDescription( Tcl_Interp *interp, /* For error messages. */ const char **eventStringPtr,/* On input, holds a pointer to start of event string. On exit, * gets pointer to rest of string after parsed event. */ TkPattern *patPtr, /* Filled with the pattern parsed from the event string. */ unsigned long *eventMaskPtr)/* Filled with event mask of matched event. */ { const char *p; unsigned long eventMask = 0; unsigned count = 1; assert(eventStringPtr); assert(patPtr); assert(eventMaskPtr); p = *eventStringPtr; patPtr->eventType = -1; patPtr->modStateMask = 0; patPtr->info = 0; patPtr->name = NULL; /* * Handle simple ASCII characters. */ if (*p != '<') { char string[2]; patPtr->eventType = KeyPress; eventMask = KeyPressMask; string[0] = *p; string[1] = '\0'; patPtr->info = TkStringToKeysym(string); if (patPtr->info == NoSymbol) { if (!isprint(UCHAR(*p))) { return FinalizeParseEventDescription( interp, patPtr, 0, Tcl_ObjPrintf("bad ASCII character 0x%x", UCHAR(*p)), "BAD_CHAR"); } patPtr->info = *p; } ++p; } else { /* * A fancier event description. This can be either a virtual event or a physical event. * * A virtual event description consists of: * * 1. double open angle brackets. * 2. virtual event name. * 3. double close angle brackets. * * A physical event description consists of: * * 1. open angle bracket. * 2. any number of modifiers, each followed by spaces or dashes. * 3. an optional event name. * 4. an option button or keysym name. Either this or item 3 *must* be present; if both * are present then they are separated by spaces or dashes. * 5. a close angle bracket. */ ++p; if (*p == '<') { /* * This is a virtual event: soak up all the characters up to the next '>'. */ const char *field = p + 1; char buf[256]; char* bufPtr = buf; unsigned size; p = strchr(field, '>'); if (p == field) { return FinalizeParseEventDescription( interp, patPtr, 0, Tcl_NewStringObj("virtual event \"<<>>\" is badly formed", -1), "MALFORMED"); } if (!p || p[1] != '>') { return FinalizeParseEventDescription( interp, patPtr, 0, Tcl_NewStringObj("missing \">\" in virtual binding", -1), "MALFORMED"); } size = p - field; if (size >= sizeof(buf)) { bufPtr = ckalloc(size + 1); } strncpy(bufPtr, field, size); bufPtr[size] = '\0'; eventMask = VirtualEventMask; patPtr->eventType = VirtualEvent; patPtr->name = Tk_GetUid(bufPtr); if (bufPtr != buf) { ckfree(bufPtr); } p += 2; } else { unsigned eventFlags; char field[512]; Tcl_HashEntry *hPtr; while (true) { ModInfo *modPtr; p = GetField(p, field, sizeof(field)); if (*p == '>') { /* * This solves the problem of, e.g., <Control-M> being * misinterpreted as Control + Meta + missing keysym instead of * Control + KeyPress + M. */ break; } if (!(hPtr = Tcl_FindHashEntry(&modTable, field))) { break; } modPtr = Tcl_GetHashValue(hPtr); patPtr->modStateMask |= modPtr->mask; if (modPtr->flags & MULT_CLICKS) { unsigned i = modPtr->flags & MULT_CLICKS; count = 2; while (i >>= 1) { ++count; } } p = SkipFieldDelims(p); } eventFlags = 0; if ((hPtr = Tcl_FindHashEntry(&eventTable, field))) { const EventInfo *eiPtr = Tcl_GetHashValue(hPtr); patPtr->eventType = eiPtr->type; eventFlags = flagArray[eiPtr->type]; eventMask = eiPtr->eventMask; p = GetField(SkipFieldDelims(p), field, sizeof(field)); } if (*field) { unsigned button = GetButtonNumber(field); if ((eventFlags & BUTTON) || (button && eventFlags == 0) || (SUPPORT_ADDITIONAL_MOTION_SYNTAX && (eventFlags & MOTION) && button == 0)) { /* This must be a button (or bad motion) event */ if (button == 0) { return FinalizeParseEventDescription( interp, patPtr, 0, Tcl_ObjPrintf("bad button number \"%s\"", field), "BUTTON"); } patPtr->info = button; if (!(eventFlags & BUTTON)) { patPtr->eventType = ButtonPress; eventMask = ButtonPressMask; } } else if ((eventFlags & KEY) || eventFlags == 0) { /* This must be a key event */ patPtr->info = TkStringToKeysym(field); if (patPtr->info == NoSymbol) { return FinalizeParseEventDescription( interp, patPtr, 0, Tcl_ObjPrintf("bad event type or keysym \"%s\"", field), "KEYSYM"); } if (!(eventFlags & KEY)) { patPtr->eventType = KeyPress; eventMask = KeyPressMask; } } else if (button) { if (!SUPPORT_ADDITIONAL_MOTION_SYNTAX || patPtr->eventType != MotionNotify) { return FinalizeParseEventDescription( interp, patPtr, 0, Tcl_ObjPrintf("specified button \"%s\" for non-button event", field), "NON_BUTTON"); } #if SUPPORT_ADDITIONAL_MOTION_SYNTAX patPtr->modStateMask |= ButtonNumberToMask(button); p = SkipFieldDelims(p); while (*p && *p != '>') { p = SkipFieldDelims(GetField(p, field, sizeof(field))); if ((button = GetButtonNumber(field)) == 0) { return FinalizeParseEventDescription( interp, patPtr, 0, Tcl_ObjPrintf("bad button number \"%s\"", field), "BUTTON"); } patPtr->modStateMask |= ButtonNumberToMask(button); } patPtr->info = ButtonNumberFromState(patPtr->modStateMask); #endif } else { return FinalizeParseEventDescription( interp, patPtr, 0, Tcl_ObjPrintf("specified keysym \"%s\" for non-key event", field), "NON_KEY"); } } else if (eventFlags == 0) { return FinalizeParseEventDescription( interp, patPtr, 0, Tcl_NewStringObj("no event type or button # or keysym", -1), "UNMODIFIABLE"); } else if (patPtr->eventType == MotionNotify) { patPtr->info = ButtonNumberFromState(patPtr->modStateMask); } p = SkipFieldDelims(p); if (*p != '>') { while (*p) { ++p; if (*p == '>') { return FinalizeParseEventDescription( interp, patPtr, 0, Tcl_NewStringObj("extra characters after detail in binding", -1), "PAST_DETAIL"); } } return FinalizeParseEventDescription( interp, patPtr, 0, Tcl_NewStringObj("missing \">\" in binding", -1), "MALFORMED"); } ++p; } } *eventStringPtr = p; *eventMaskPtr |= eventMask; return FinalizeParseEventDescription(interp, patPtr, count, NULL, NULL); } /* *---------------------------------------------------------------------- * * GetField -- * |
︙ | ︙ | |||
4069 4070 4071 4072 4073 4074 4075 | * * Side effects: * None. * *---------------------------------------------------------------------- */ | | | | | | < | | > | < | 4776 4777 4778 4779 4780 4781 4782 4783 4784 4785 4786 4787 4788 4789 4790 4791 4792 4793 4794 4795 4796 4797 4798 4799 4800 | * * Side effects: * None. * *---------------------------------------------------------------------- */ static const char * GetField( const char *p, /* Pointer to part of pattern. */ char *copy, /* Place to copy field. */ unsigned size) /* Maximum number of characters to copy. */ { assert(p); assert(copy); for ( ; *p && !isspace(UCHAR(*p)) && *p != '>' && *p != '-' && size > 1; --size) { *copy++ = *p++; } *copy = '\0'; return p; } /* *--------------------------------------------------------------------------- |
︙ | ︙ | |||
4106 4107 4108 4109 4110 4111 4112 | * released; it starts with a refCount of zero. * *--------------------------------------------------------------------------- */ static Tcl_Obj * GetPatternObj( | | < < < < > < < < < > | > | < | | | | | | | | < < < < < < < < | > | < | > > | | | | | | < < < | < < < < < < < < | < | > | < < | > > > > | > | < | | | | | < | < | | | < < < < | | > | | < | > | | > > | > > > > > > > > > | > | > | > | > > | > | 4812 4813 4814 4815 4816 4817 4818 4819 4820 4821 4822 4823 4824 4825 4826 4827 4828 4829 4830 4831 4832 4833 4834 4835 4836 4837 4838 4839 4840 4841 4842 4843 4844 4845 4846 4847 4848 4849 4850 4851 4852 4853 4854 4855 4856 4857 4858 4859 4860 4861 4862 4863 4864 4865 4866 4867 4868 4869 4870 4871 4872 4873 4874 4875 4876 4877 4878 4879 4880 4881 4882 4883 4884 4885 4886 4887 4888 4889 4890 4891 4892 4893 4894 4895 4896 4897 4898 4899 4900 4901 4902 4903 4904 4905 4906 4907 4908 4909 4910 4911 4912 4913 4914 4915 4916 4917 4918 | * released; it starts with a refCount of zero. * *--------------------------------------------------------------------------- */ static Tcl_Obj * GetPatternObj( const PatSeq *psPtr) { Tcl_Obj *patternObj = Tcl_NewObj(); unsigned i; assert(psPtr); for (i = 0; i < psPtr->numPats; ++i) { const TkPattern *patPtr = psPtr->pats + i; /* * Check for simple case of an ASCII character. */ if (patPtr->eventType == KeyPress && patPtr->count == 1 && patPtr->modStateMask == 0 && patPtr->info < 128 && isprint(UCHAR(patPtr->info)) && patPtr->info != '<' && patPtr->info != ' ') { char c = (char) patPtr->info; Tcl_AppendToObj(patternObj, &c, 1); } else if (patPtr->eventType == VirtualEvent) { assert(patPtr->name); Tcl_AppendPrintfToObj(patternObj, "<<%s>>", patPtr->name); } else { unsigned modStateMask; const ModInfo *modPtr; /* * It's a more general event specification. First check for "Double", * "Triple", "Quadruple", then modifiers, then event type, then keysym * or button detail. */ Tcl_AppendToObj(patternObj, "<", 1); switch (patPtr->count) { case 2: Tcl_AppendToObj(patternObj, "Double-", 7); break; case 3: Tcl_AppendToObj(patternObj, "Triple-", 7); break; case 4: Tcl_AppendToObj(patternObj, "Quadruple-", 10); break; } modStateMask = patPtr->modStateMask; #if PRINT_SHORT_MOTION_SYNTAX if (patPtr->eventType == MotionNotify) { modStateMask &= ~ALL_BUTTONS_MASK; } #endif for (modPtr = modArray; modStateMask; ++modPtr) { if (modPtr->mask & modStateMask) { modStateMask &= ~modPtr->mask; Tcl_AppendPrintfToObj(patternObj, "%s-", modPtr->name); } } assert(patPtr->eventType < TK_LASTEVENT); assert(((unsigned) eventArrayIndex[patPtr->eventType]) < SIZE_OF_ARRAY(eventArray)); Tcl_AppendToObj(patternObj, eventArray[eventArrayIndex[patPtr->eventType]].name, -1); if (patPtr->info) { switch (patPtr->eventType) { case KeyPress: case KeyRelease: { const char *string = TkKeysymToString(patPtr->info); if (string) { Tcl_AppendToObj(patternObj, "-", 1); Tcl_AppendToObj(patternObj, string, -1); } break; } case ButtonPress: case ButtonRelease: assert(patPtr->info <= Button5); Tcl_AppendPrintfToObj(patternObj, "-%d", (int) patPtr->info); break; #if PRINT_SHORT_MOTION_SYNTAX case MotionNotify: { unsigned mask = patPtr->modStateMask; while (mask & ALL_BUTTONS_MASK) { unsigned button = ButtonNumberFromState(mask); Tcl_AppendPrintfToObj(patternObj, "-%u", button); mask &= ~ButtonNumberToMask(button); } break; } #endif } } Tcl_AppendToObj(patternObj, ">", 1); } } return patternObj; } /* *---------------------------------------------------------------------- |
︙ | ︙ | |||
4237 4238 4239 4240 4241 4242 4243 | KeySym TkStringToKeysym( const char *name) /* Name of a keysym. */ { #ifdef REDO_KEYSYM_LOOKUP Tcl_HashEntry *hPtr = Tcl_FindHashEntry(&keySymTable, name); | | > | > | 4934 4935 4936 4937 4938 4939 4940 4941 4942 4943 4944 4945 4946 4947 4948 4949 4950 4951 4952 4953 4954 4955 4956 4957 4958 4959 4960 | KeySym TkStringToKeysym( const char *name) /* Name of a keysym. */ { #ifdef REDO_KEYSYM_LOOKUP Tcl_HashEntry *hPtr = Tcl_FindHashEntry(&keySymTable, name); if (hPtr) { return (KeySym) Tcl_GetHashValue(hPtr); } assert(name); if (strlen(name) == 1) { KeySym keysym = (KeySym) (unsigned char) name[0]; if (TkKeysymToString(keysym)) { return keysym; } } #endif /* REDO_KEYSYM_LOOKUP */ assert(name); return XStringToKeysym(name); } /* *---------------------------------------------------------------------- * * TkKeysymToString -- |
︙ | ︙ | |||
4275 4276 4277 4278 4279 4280 4281 | const char * TkKeysymToString( KeySym keysym) { #ifdef REDO_KEYSYM_LOOKUP Tcl_HashEntry *hPtr = Tcl_FindHashEntry(&nameTable, (char *)keysym); | | | 4974 4975 4976 4977 4978 4979 4980 4981 4982 4983 4984 4985 4986 4987 4988 | const char * TkKeysymToString( KeySym keysym) { #ifdef REDO_KEYSYM_LOOKUP Tcl_HashEntry *hPtr = Tcl_FindHashEntry(&nameTable, (char *)keysym); if (hPtr) { return Tcl_GetHashValue(hPtr); } #endif /* REDO_KEYSYM_LOOKUP */ return XKeysymToString(keysym); } |
︙ | ︙ | |||
4309 4310 4311 4312 4313 4314 4315 | XEvent * TkpGetBindingXEvent( Tcl_Interp *interp) /* Interpreter. */ { TkWindow *winPtr = (TkWindow *) Tk_MainWindow(interp); BindingTable *bindPtr = winPtr->mainPtr->bindingTable; | | | 5008 5009 5010 5011 5012 5013 5014 5015 5016 5017 5018 5019 5020 5021 5022 | XEvent * TkpGetBindingXEvent( Tcl_Interp *interp) /* Interpreter. */ { TkWindow *winPtr = (TkWindow *) Tk_MainWindow(interp); BindingTable *bindPtr = winPtr->mainPtr->bindingTable; return &bindPtr->curEvent->xev; } /* *---------------------------------------------------------------------- * * TkpCancelWarp -- * |
︙ | ︙ | |||
4333 4334 4335 4336 4337 4338 4339 4340 4341 4342 4343 4344 4345 4346 4347 4348 4349 | *---------------------------------------------------------------------- */ void TkpCancelWarp( TkDisplay *dispPtr) { if (dispPtr->flags & TK_DISPLAY_IN_WARP) { Tcl_CancelIdleCall(DoWarp, dispPtr); dispPtr->flags &= ~TK_DISPLAY_IN_WARP; } } /* * Local Variables: * mode: c * c-basic-offset: 4 | > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | > | 5032 5033 5034 5035 5036 5037 5038 5039 5040 5041 5042 5043 5044 5045 5046 5047 5048 5049 5050 5051 5052 5053 5054 5055 5056 5057 5058 5059 5060 5061 5062 5063 5064 5065 5066 5067 5068 5069 5070 5071 5072 5073 5074 5075 5076 5077 5078 5079 5080 5081 5082 5083 5084 5085 5086 5087 5088 5089 5090 5091 5092 5093 5094 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 5116 5117 5118 5119 5120 5121 5122 5123 5124 5125 | *---------------------------------------------------------------------- */ void TkpCancelWarp( TkDisplay *dispPtr) { assert(dispPtr); if (dispPtr->flags & TK_DISPLAY_IN_WARP) { Tcl_CancelIdleCall(DoWarp, dispPtr); dispPtr->flags &= ~TK_DISPLAY_IN_WARP; } } /* *---------------------------------------------------------------------- * * TkpDumpPS -- * * Dump given pattern sequence to stdout. * * Results: * None. * * Side effects: * None. * *---------------------------------------------------------------------- */ #if !NDEBUG void TkpDumpPS( const PatSeq *psPtr) { if (!psPtr) { fprintf(stdout, "<null>\n"); } else { Tcl_Obj* result = GetPatternObj(psPtr); Tcl_IncrRefCount(result); fprintf(stdout, "%s", Tcl_GetString(result)); if (psPtr->object) { fprintf(stdout, " (%s)", (char *) psPtr->object); } fprintf(stdout, "\n"); Tcl_DecrRefCount(result); } } #endif /* *---------------------------------------------------------------------- * * TkpDumpPSList -- * * Dump given pattern sequence list to stdout. * * Results: * None. * * Side effects: * None. * *---------------------------------------------------------------------- */ #if !NDEBUG void TkpDumpPSList( const PSList *psList) { if (!psList) { fprintf(stdout, "<null>\n"); } else { const PSEntry *psEntry; fprintf(stdout, "Dump PSList ========================================\n"); TK_DLIST_FOREACH(psEntry, psList) { TkpDumpPS(psEntry->psPtr); } fprintf(stdout, "====================================================\n"); } } #endif /* * Local Variables: * mode: c * c-basic-offset: 4 * fill-column: 105 * End: * vi:set ts=8 sw=4: */ |
Added generic/tkDList.h.
> > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 | /* * tkDList.h -- * * A list is headed by pointers to first and last element. The elements * are doubly linked so that an arbitrary element can be removed without * a need to traverse the list. New elements can be added to the list * before or after an existing element or at the head/tail of the list. * A list may be traversed in the forward or backward direction. * * Copyright (c) 2018 by Gregor Cramer. * * See the file "license.terms" for information on usage and redistribution of * this file, and for a DISCLAIMER OF ALL WARRANTIES. */ /* * Note that this file will not be included in header files, it is the purpose * of this file to be included in source files only. Thus we are not using the * prefix "Tk_" here for functions, because all the functions have private scope. */ /* * Use the double linked list in the following way: * ------------------------------------------------------------------------------- * typedef struct MyListEntry { TK_DLIST_LINKS(MyListEntry); int value; } MyListEntry; * TK_DLIST_DEFINE(MyList, MyListEntry); * MyList listHdr = TK_DLIST_LIST_INITIALIZER; // or MyList_Init(&listHdr) * MyListEntry *p; * int i = 0; * MyList_Append(&listHdr, ckalloc(sizeof(MyListEntry))); * MyList_Append(&listHdr, ckalloc(sizeof(MyListEntry))); * TK_DLIST_FOREACH(p, &listHdr) { p->value = i++; } * // ... * MyList_RemoveHead(&listHdr); * MyList_RemoveHead(&listHdr); * MyList_Clear(MyListEntry, &listHdr); // invokes ckfree() for each element * ------------------------------------------------------------------------------- * IMPORTANT NOTE: TK_DLIST_LINKS must be used at start of struct! */ #ifndef TK_DLIST_DEFINED #define TK_DLIST_DEFINED #include <stddef.h> #include <assert.h> /* * List definitions. */ #define TK_DLIST_LINKS(ElemType) \ struct { \ struct ElemType *prev; /* previous element */ \ struct ElemType *next; /* next element */ \ } _dl_ #define TK_DLIST_LIST_INITIALIZER { NULL, NULL } #define TK_DLIST_ELEM_INITIALIZER { NULL, NULL } /*************************************************************************/ /* * DList_Init: Initialize list header. This can also be used to clear the * list. * * See also: DList_Clear() */ /*************************************************************************/ /* * DList_ElemInit: Initialize a list element. */ /*************************************************************************/ /* * DList_InsertAfter: Insert 'elem' after 'listElem'. 'elem' must not * be linked, but 'listElem' must be linked. */ /*************************************************************************/ /* * DList_InsertBefore: Insert 'elem' before 'listElem'. 'elem' must not * be linked, but 'listElem' must be linked. */ /*************************************************************************/ /* * DList_Prepend: Insert 'elem' at start of list. This element must not * be linked. * * See also: DList_Append() */ /*************************************************************************/ /* * DList_Append: Append 'elem' to end of list. This element must not * be linked. * * See also: DList_Prepend() */ /*************************************************************************/ /* * DList_Move: Append all list items of 'src' to end of 'dst'. */ /*************************************************************************/ /* * DList_Remove: Remove 'elem' from list. This element must be linked. * * See also: DList_Free() */ /*************************************************************************/ /* * DList_Free: Remove 'elem' from list and free it. This element must * be linked. * * See also: DList_Remove() */ /*************************************************************************/ /* * DList_RemoveHead: Remove first element from list. The list must * not be empty. * * See also: DList_FreeHead() */ /*************************************************************************/ /* * DList_RemoveTail: Remove last element from list. The list must * not be empty. * * See also: DList_FreeTail() */ /*************************************************************************/ /* * DList_FreeHead: Remove first element from list and free it. * The list must not be empty. * * See also: DList_RemoveHead() */ /*************************************************************************/ /* * DList_FreeTail: Remove last element from list and free it. * The list must not be empty. * * See also: DList_RemoveTail() */ /*************************************************************************/ /* * DList_SwapElems: Swap positions of given elements 'lhs' and 'rhs'. * Both elements must be linked, and must belong to same list. */ /*************************************************************************/ /* * DList_Clear: Clear whole list and free all elements. * * See also: DList_Init */ /*************************************************************************/ /* * DList_Traverse: Iterate over all elements in list from first to last. * Call given function func(head, elem) for each element. The function has * to return the next element in list to traverse, normally this is * DList_Next(elem). * * See also: TK_DLIST_FOREACH, TK_DLIST_FOREACH_REVERSE */ /*************************************************************************/ /* * DList_First: Return pointer of first element in list, maybe it's NULL. */ /*************************************************************************/ /* * DList_Last: Return pointer of last element in list, maybe it's NULL. */ /*************************************************************************/ /* * DList_Next: Return pointer of next element after 'elem', maybe it's NULL. * * See also: DList_Prev() */ /*************************************************************************/ /* * DList_Prev: Return pointer of previous element before 'elem', maybe it's * NULL. * * See also: DList_Next() */ /*************************************************************************/ /* * DList_IsEmpty: Test whether given list is empty. */ /*************************************************************************/ /* * DList_IsLinked: Test whether given element is linked. */ /*************************************************************************/ /* * DList_IsFirst: Test whether given element is first element in list. * Note that 'elem' must be linked. * * See also: DList_IsLast(), DList_IsLinked() */ /*************************************************************************/ /* * DList_IsLast: Test whether given element is last element in list. * Note that 'elem' must be linked. * * See also: DList_IsFirst(), DList_IsLinked() */ /*************************************************************************/ /* * DList_Size: Count number of elements in given list. */ /*************************************************************************/ /* * TK_DLIST_FOREACH: Iterate over all elements in list from first to last. * 'var' is the name of the variable which points to current element. * * See also: TK_DLIST_FOREACH_REVERSE, DList_Traverse() */ /*************************************************************************/ /* * TK_DLIST_FOREACH_REVERSE: Iterate over all elements in list from last * to first (backwards). 'var' is the name of the variable which points to * current element. */ /*************************************************************************/ #if defined(__GNUC__) || defined(__clang__) # define __TK_DLIST_UNUSED __attribute__((unused)) #else # define __TK_DLIST_UNUSED #endif #define TK_DLIST_DEFINE(LT, ElemType) /* LT = type of head/list */ \ /* ------------------------------------------------------------------------- */ \ typedef struct LT { \ struct ElemType *first; /* first element */ \ struct ElemType *last; /* last element */ \ } LT; \ \ typedef ElemType *(LT##_Func)(struct LT *head, struct ElemType *elem); \ \ __TK_DLIST_UNUSED \ static void \ LT##_Init(struct LT *head) \ { \ assert(head); \ head->first = NULL; \ head->last = NULL; \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_ElemInit(struct ElemType *elem) \ { \ assert(elem); \ elem->_dl_.next = NULL; \ elem->_dl_.prev = NULL; \ } \ \ __TK_DLIST_UNUSED \ static int \ LT##_IsEmpty(struct LT *head) \ { \ assert(head); \ return head->first == NULL; \ } \ \ __TK_DLIST_UNUSED \ static int \ LT##_IsLinked(struct ElemType *elem) \ { \ assert(elem); \ return elem->_dl_.next && elem->_dl_.prev; \ } \ \ __TK_DLIST_UNUSED \ static int \ LT##_IsFirst(struct ElemType *elem) \ { \ assert(LT##_IsLinked(elem)); \ return elem->_dl_.prev->_dl_.prev == elem; \ } \ \ __TK_DLIST_UNUSED \ static int \ LT##_IsLast(struct ElemType *elem) \ { \ assert(LT##_IsLinked(elem)); \ return elem->_dl_.next->_dl_.next == elem; \ } \ \ __TK_DLIST_UNUSED \ static ElemType * \ LT##_First(struct LT *head) \ { \ assert(head); \ return head->first; \ } \ \ __TK_DLIST_UNUSED \ static ElemType * \ LT##_Last(struct LT *head) \ { \ assert(head); \ return head->last; \ } \ \ __TK_DLIST_UNUSED \ static ElemType * \ LT##_Next(struct ElemType *elem) \ { \ assert(elem); \ return LT##_IsLast(elem) ? NULL : elem->_dl_.next; \ } \ \ __TK_DLIST_UNUSED \ static ElemType * \ LT##_Prev(struct ElemType *elem) \ { \ assert(elem); \ return LT##_IsFirst(elem) ? NULL : elem->_dl_.prev; \ } \ \ __TK_DLIST_UNUSED \ static int \ LT##_Size(const struct LT *head) \ { \ const struct ElemType *elem; \ int size = 0; \ assert(head); \ if ((elem = head->first)) { \ for ( ; elem != (void *) head; elem = elem->_dl_.next) { \ ++size; \ } \ } \ return size; \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_InsertAfter(struct ElemType *listElem, struct ElemType *elem) \ { \ assert(listElem); \ assert(elem); \ elem->_dl_.next = (listElem)->_dl_.next; \ elem->_dl_.prev = (listElem); \ listElem->_dl_.next->_dl_.prev = (elem); \ listElem->_dl_.next = (elem); \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_InsertBefore(struct ElemType *listElem, struct ElemType *elem) \ { \ assert(listElem); \ assert(elem); \ elem->_dl_.next = listElem; \ elem->_dl_.prev = listElem->_dl_.prev;; \ listElem->_dl_.prev->_dl_.next = elem; \ listElem->_dl_.prev = elem; \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_Prepend(struct LT *head, struct ElemType *elem) \ { \ assert(head); \ assert(elem); \ elem->_dl_.prev = (void *) head; \ if (head->first == NULL) { \ elem->_dl_.next = (void *) head; \ head->last = elem; \ } else { \ elem->_dl_.next = head->first; \ head->first->_dl_.prev = elem; \ } \ head->first = elem; \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_Append(struct LT *head, struct ElemType *elem) \ { \ assert(head); \ assert(elem); \ elem->_dl_.next = (void *) head; \ if (head->first == NULL) { \ elem->_dl_.prev = (void *) head; \ head->first = elem; \ } else { \ elem->_dl_.prev = head->last; \ head->last->_dl_.next = elem; \ } \ head->last = elem; \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_Move(struct LT *dst, struct LT *src) \ { \ assert(dst); \ assert(src); \ if (src->first) { \ if (dst->first) { \ dst->last->_dl_.next = src->first; \ src->first->_dl_.prev = dst->last; \ dst->last = src->last; \ } else { \ *dst = *src; \ dst->first->_dl_.prev = (void *) dst; \ } \ dst->last->_dl_.next = (void *) dst; \ LT##_Init(src); \ } \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_Remove(struct ElemType *elem) \ { \ int isFirst, isLast; \ assert(LT##_IsLinked(elem)); \ isFirst = LT##_IsFirst(elem); \ isLast = LT##_IsLast(elem); \ if (isFirst && isLast) { \ ((LT *) elem->_dl_.prev)->first = NULL; \ ((LT *) elem->_dl_.next)->last = NULL; \ } else { \ if (isFirst) { \ ((LT *) elem->_dl_.prev)->first = elem->_dl_.next; \ } else { \ elem->_dl_.prev->_dl_.next = elem->_dl_.next; \ } \ if (isLast) { \ ((LT *) elem->_dl_.next)->last = elem->_dl_.prev; \ } else { \ elem->_dl_.next->_dl_.prev = elem->_dl_.prev; \ } \ } \ LT##_ElemInit(elem); \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_Free(struct ElemType *elem) \ { \ LT##_Remove(elem); \ ckfree((void *) elem); \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_RemoveHead(struct LT *head) \ { \ assert(!LT##_IsEmpty(head)); \ LT##_Remove(head->first); \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_RemoveTail(struct LT *head) \ { \ assert(!LT##_IsEmpty(head)); \ LT##_Remove(head->last); \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_FreeHead(struct LT *head) \ { \ assert(!LT##_IsEmpty(head)); \ LT##_Free(head->first); \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_FreeTail(struct LT *head) \ { \ assert(!LT##_IsEmpty(head)); \ LT##_Free(head->last); \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_SwapElems(struct ElemType *lhs, struct ElemType *rhs) \ { \ assert(lhs); \ assert(rhs); \ if (lhs != rhs) { \ struct ElemType tmp; \ if (LT##_IsFirst(lhs)) { \ ((LT *) lhs->_dl_.prev)->first = rhs; \ } else if (LT##_IsFirst(rhs)) { \ ((LT *) rhs->_dl_.prev)->first = lhs; \ } \ if (LT##_IsLast(lhs)) { \ ((LT *) lhs->_dl_.next)->last = rhs; \ } else if (LT##_IsLast(rhs)) { \ ((LT *) rhs->_dl_.next)->last = lhs; \ } \ tmp._dl_ = lhs->_dl_; \ lhs->_dl_ = rhs->_dl_; \ rhs->_dl_ = tmp._dl_; \ } \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_Clear(struct LT *head) \ { \ struct ElemType *p; \ struct ElemType *next; \ assert(head); \ for (p = head->first; p; p = next) { \ next = LT##_Next(p); \ ckfree((void *) p); \ } \ LT##_Init(head); \ } \ \ __TK_DLIST_UNUSED \ static void \ LT##_Traverse(struct LT *head, LT##_Func func) \ { \ struct ElemType *next; \ struct ElemType *p; \ assert(head); \ for (p = head->first; p; p = next) { \ next = func(head, p); \ } \ } \ /* ------------------------------------------------------------------------- */ #define TK_DLIST_FOREACH(var, head) \ assert(head); \ for (var = head->first ? head->first : (void *) head; var != (void *) head; var = var->_dl_.next) #define TK_DLIST_FOREACH_REVERSE(var, head) \ assert(head); \ for (var = head->last ? head->last : (void *) head; var != (void *) head; var = var->_dl_.prev) #endif /* TK_DLIST_DEFINED */ /* * Local Variables: * mode: c * c-basic-offset: 4 * fill-column: 105 * End: * vi:set ts=8 sw=4: */ |
Changes to generic/tkFocus.c.
︙ | ︙ | |||
275 276 277 278 279 280 281 | int retValue, delta; /* * If this was a generated event, just turn off the generated flag and * pass the event through to Tk bindings. */ | | | | 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 | int retValue, delta; /* * If this was a generated event, just turn off the generated flag and * pass the event through to Tk bindings. */ if ((eventPtr->xfocus.send_event & GENERATED_FOCUS_EVENT_MAGIC) == GENERATED_FOCUS_EVENT_MAGIC) { eventPtr->xfocus.send_event &= ~GENERATED_FOCUS_EVENT_MAGIC; return 1; } /* * Check for special events generated by embedded applications to request * the input focus. If this is one of those events, make the change in * focus and return without any additional processing of the event (note: |
︙ | ︙ |
Changes to tests/bind.test.
︙ | ︙ | |||
18 19 20 21 22 23 24 | update idletasks foreach p [event info] {event delete $p} foreach event [bind Test] { bind Test $event {} } foreach event [bind all] { | | < < < < < < < < < < < < < | 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 | update idletasks foreach p [event info] {event delete $p} foreach event [bind Test] { bind Test $event {} } foreach event [bind all] { bind all $event {} } proc unsetBindings {} { bind all <Enter> {} bind Test <Enter> {} bind Toplevel <Enter> {} bind xyz <Enter> {} bind {a b} <Enter> {} bind .t <Enter> {} } # move the mouse pointer away of the testing area # otherwise some spurious events may pollute the tests toplevel .top wm geometry .top 50x50-50-50 update event generate .top <Button-1> -warp 1 update |
︙ | ︙ | |||
351 352 353 354 355 356 357 | destroy .t.f } -returnCodes ok test bind-9.2 {Tk_DeleteBinding procedure} -setup { set result {} } -body { frame .t.f -class Test -width 150 -height 100 foreach i {a b c d} { | | | | | | | | 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 | destroy .t.f } -returnCodes ok test bind-9.2 {Tk_DeleteBinding procedure} -setup { set result {} } -body { frame .t.f -class Test -width 150 -height 100 foreach i {a b c d} { bind .t.f $i "binding for $i" } foreach i {b d a c} { bind .t.f $i {} lappend result [lsort [bind .t.f]] } return $result } -cleanup { destroy .t.f } -result {{a c d} {a c} c {}} test bind-9.3 {Tk_DeleteBinding procedure} -setup { set result {} } -body { frame .t.f -class Test -width 150 -height 100 foreach i {<1> <Meta-1> <Control-1> <Double-Alt-1>} { bind .t.f $i "binding for $i" } foreach i {<Control-1> <Double-Alt-1> <1> <Meta-1>} { bind .t.f $i {} lappend result [lsort [bind .t.f]] } return $result } -cleanup { destroy .t.f } -result {{<Button-1> <Double-Alt-Button-1> <Meta-Button-1>} {<Button-1> <Meta-Button-1>} <Meta-Button-1> {}} test bind-10.1 {Tk_GetBinding procedure} -body { |
︙ | ︙ | |||
394 395 396 397 398 399 400 | } -cleanup { destroy .t.c } -result {Test} test bind-11.1 {Tk_GetAllBindings procedure} -body { frame .t.f foreach i "! a \\\{ ~ <Delete> <space> <<Paste>> <Tab> <Linefeed> <less> <Meta-a> <Acircumflex>" { | | | | | | 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 | } -cleanup { destroy .t.c } -result {Test} test bind-11.1 {Tk_GetAllBindings procedure} -body { frame .t.f foreach i "! a \\\{ ~ <Delete> <space> <<Paste>> <Tab> <Linefeed> <less> <Meta-a> <Acircumflex>" { bind .t.f $i Test } lsort [bind .t.f] } -cleanup { destroy .t.f } -result {! <<Paste>> <Key-Acircumflex> <Key-Delete> <Key-Linefeed> <Key-Tab> <Key-less> <Key-space> <Meta-Key-a> a \{ ~} test bind-11.2 {Tk_GetAllBindings procedure} -body { frame .t.f foreach i "<Double-1> <Triple-1> <Meta-Control-a> <Double-Alt-Enter> <1>" { bind .t.f $i Test } lsort [bind .t.f] } -cleanup { destroy .t.f } -result {<Button-1> <Control-Meta-Key-a> <Double-Alt-Enter> <Double-Button-1> <Triple-Button-1>} test bind-11.3 {Tk_GetAllBindings procedure} -body { frame .t.f foreach i "<Double-Triple-1> abcd a<Leave>b" { bind .t.f $i Test } lsort [bind .t.f] } -cleanup { destroy .t.f } -result {<Triple-Button-1> a<Leave>b abcd} test bind-12.1 {Tk_DeleteAllBindings procedure} -body { frame .t.f -class Test -width 150 -height 100 destroy .t.f } -result {} test bind-12.2 {Tk_DeleteAllBindings procedure} -body { frame .t.f -class Test -width 150 -height 100 foreach i "a b c <Meta-1> <Alt-a> <Control-a>" { bind .t.f $i x } destroy .t.f } -result {} test bind-13.1 {Tk_BindEvent procedure} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f |
︙ | ︙ | |||
944 945 946 947 948 949 950 | frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update set x {} } -body { bindtags .t.f {a b c d e f g h i j k l m n o p} | | | 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 | frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update set x {} } -body { bindtags .t.f {a b c d e f g h i j k l m n o p} foreach p [bindtags .t.f] { bind $p <1> "lappend x $p" } event generate .t.f <1> return $x } -cleanup { foreach p [bindtags .t.f] {bind $p <1> {}} destroy .t.f |
︙ | ︙ | |||
1391 1392 1393 1394 1395 1396 1397 | destroy .t.f } -result {0} test bind-15.22 {MatchPatterns procedure, time wrap-around} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update | < < < < < | 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 | destroy .t.f } -result {0} test bind-15.22 {MatchPatterns procedure, time wrap-around} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Double-1> {set x 1} set x 0 event generate .t.f <Button-1> -time -100 event generate .t.f <Button-1> -time 200 event generate .t.f <ButtonRelease-1> return $x } -cleanup { destroy .t.f } -result {1} test bind-15.23 {MatchPatterns procedure, time wrap-around} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Double-1> {set x 1} set x 0 event generate .t.f <Button-1> -time -100 event generate .t.f <Button-1> -time 500 event generate .t.f <ButtonRelease-1> return $x } -cleanup { destroy .t.f } -result {0} test bind-15.24 {MatchPatterns procedure, virtual event} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update set x {} } -body { event add <<Paste>> <Button-1> bind .t.f <<Paste>> {lappend x paste} event generate .t.f <Button-1> event generate .t.f <ButtonRelease-1> set x } -cleanup { destroy .t.f event delete <<Paste>> <Button-1> } -result {paste} test bind-15.25 {MatchPatterns procedure, reject a virtual event} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update set x {} } -body { event add <<Paste>> <Shift-Button-1> bind .t.f <<Paste>> {lappend x paste} event generate .t.f <Button-1> event generate .t.f <ButtonRelease-1> set x } -cleanup { destroy .t.f event delete <<Paste>> <Shift-Button-1> } -result {} test bind-15.26 {MatchPatterns procedure, reject a virtual event} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update set x {} } -body { event add <<V1>> <Button> event add <<V2>> <Button-1> event add <<V3>> <Shift-Button-1> bind .t.f <<V2>> "lappend x V2%#" event generate .t.f <Button> -serial 101 event generate .t.f <Button-1> -serial 102 |
︙ | ︙ | |||
1485 1486 1487 1488 1489 1490 1491 | event delete <<V3>> <Shift-Button-1> } -result {V2102 V2103 V2105 Shift-Button-1} test bind-15.27 {MatchPatterns procedure, conflict resolution} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update | < < < < < < < | 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 | event delete <<V3>> <Shift-Button-1> } -result {V2102 V2103 V2105 Shift-Button-1} test bind-15.27 {MatchPatterns procedure, conflict resolution} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <KeyPress> {set x 0} bind .t.f 1 {set x 1} set x none event generate .t.f <Key-1> return $x } -cleanup { destroy .t.f } -result {1} test bind-15.28 {MatchPatterns procedure, conflict resolution} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <KeyPress> {set x 0} bind .t.f 1 {set x 1} set x none event generate .t.f <Key-2> return $x } -cleanup { destroy .t.f } -result {0} test bind-15.29 {MatchPatterns procedure, conflict resolution} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <KeyPress> {lappend x 0} bind .t.f 1 {lappend x 1} bind .t.f 21 {lappend x 2} set x none event generate .t.f <Key-2> event generate .t.f <KeyRelease-2> event generate .t.f <Key-1> set x } -cleanup { destroy .t.f } -result {none 0 2} test bind-15.30 {MatchPatterns procedure, conflict resolution} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <ButtonPress> {set x 0} bind .t.f <1> {set x 1} set x none event generate .t.f <Button-1> event generate .t.f <ButtonRelease-1> return $x } -cleanup { destroy .t.f } -result {1} test bind-15.31 {MatchPatterns procedure, conflict resolution} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update set x {} } -body { bind .t.f <M1-Key> {set x 0} bind .t.f <M2-Key> {set x 1} event generate .t.f <Key-a> -state 0x18 return $x } -cleanup { destroy .t.f } -result {1} test bind-15.32 {MatchPatterns procedure, conflict resolution} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <M2-Key> {set x 0} bind .t.f <M1-Key> {set x 1} set x none event generate .t.f <Key-a> -state 0x18 return $x } -cleanup { destroy .t.f } -result {1} test bind-15.33 {MatchPatterns procedure, conflict resolution} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update set x {} } -body { bind .t.f <1> {lappend x single} bind Test <1> {lappend x single(Test)} bind Test <Double-1> {lappend x double(Test)} event generate .t.f <Button-1> event generate .t.f <Button-1> event generate .t.f <Button-1> |
︙ | ︙ | |||
2228 2229 2230 2231 2232 2233 2234 | set savedBind(All) [bind all <Key>] set savedBind(Entry) [bind Entry <Key>] entry .t.e pack .t.e focus -force .t.e foreach p [event info] {event delete $p} update | < | 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 | set savedBind(All) [bind all <Key>] set savedBind(Entry) [bind Entry <Key>] entry .t.e pack .t.e focus -force .t.e foreach p [event info] {event delete $p} update } -body { bind all <Key> {set z "%M"} bind Entry <Key> {set y "%M"} bind .t.e <Key> {set x "%M"} set x none; set y none; set z none event gen .t.e <Key-a> list $x $y $z |
︙ | ︙ | |||
2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 | } -returnCodes error -result {wrong # args: should be "event delete virtual ?sequence ...?"} test bind-17.9 {event command: delete many} -body { event delete <<Paste>> event add <<Paste>> <3> <1> <2> t event delete <<Paste>> <1> <2> lsort [event info <<Paste>>] } -cleanup { event delete <<Paste>> <3> t } -result {<Button-3> t} test bind-17.10 {event command: delete all} -body { event add <<Paste>> a b event delete <<Paste>> event info <<Paste>> } -cleanup { | > | 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 | } -returnCodes error -result {wrong # args: should be "event delete virtual ?sequence ...?"} test bind-17.9 {event command: delete many} -body { event delete <<Paste>> event add <<Paste>> <3> <1> <2> t event delete <<Paste>> <1> <2> lsort [event info <<Paste>>] } -cleanup { event delete <<Paste>> event delete <<Paste>> <3> t } -result {<Button-3> t} test bind-17.10 {event command: delete all} -body { event add <<Paste>> a b event delete <<Paste>> event info <<Paste>> } -cleanup { |
︙ | ︙ | |||
2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 | event delete <<def>> event delete <<abc>> } -result {{xyz abc def abc def} {} <Control-Button-2> <Shift-Button-2>} test bind-19.15 {DeleteVirtualEvent procedure: owned by many, first} -setup { pack [frame .t.f -class Test -width 150 -height 100] pack [frame .t.g -class Test -width 150 -height 100] pack [frame .t.h -class Test -width 150 -height 100] focus -force .t.f update set x {} event delete <<def>> event delete <<xyz>> event delete <<abc>> } -body { | > | 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 | event delete <<def>> event delete <<abc>> } -result {{xyz abc def abc def} {} <Control-Button-2> <Shift-Button-2>} test bind-19.15 {DeleteVirtualEvent procedure: owned by many, first} -setup { pack [frame .t.f -class Test -width 150 -height 100] pack [frame .t.g -class Test -width 150 -height 100] pack [frame .t.h -class Test -width 150 -height 100] after 250 ;# we need a bit time to ensure that .t.h is mapped focus -force .t.f update set x {} event delete <<def>> event delete <<xyz>> event delete <<abc>> } -body { |
︙ | ︙ | |||
2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 | event delete <<def>> event delete <<abc>> } -result {{xyz abc def abc def} {} <Button-2> <Button-2>} test bind-19.16 {DeleteVirtualEvent procedure: owned by many, middle} -setup { pack [frame .t.f -class Test -width 150 -height 100] pack [frame .t.g -class Test -width 150 -height 100] pack [frame .t.h -class Test -width 150 -height 100] focus -force .t.f update set x {} event delete <<def>> event delete <<xyz>> event delete <<abc>> } -body { | > | 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 | event delete <<def>> event delete <<abc>> } -result {{xyz abc def abc def} {} <Button-2> <Button-2>} test bind-19.16 {DeleteVirtualEvent procedure: owned by many, middle} -setup { pack [frame .t.f -class Test -width 150 -height 100] pack [frame .t.g -class Test -width 150 -height 100] pack [frame .t.h -class Test -width 150 -height 100] after 250 ;# we need a bit time to ensure that .t.h is mapped focus -force .t.f update set x {} event delete <<def>> event delete <<xyz>> event delete <<abc>> } -body { |
︙ | ︙ | |||
2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 | event delete <<def>> event delete <<xyz>> } -result {{xyz abc def xyz def} <Button-2> {} <Button-2>} test bind-19.17 {DeleteVirtualEvent procedure: owned by many, last} -setup { pack [frame .t.f -class Test -width 150 -height 100] pack [frame .t.g -class Test -width 150 -height 100] pack [frame .t.h -class Test -width 150 -height 100] focus -force .t.f update set x {} event delete <<def>> event delete <<xyz>> event delete <<abc>> } -body { | > | 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 | event delete <<def>> event delete <<xyz>> } -result {{xyz abc def xyz def} <Button-2> {} <Button-2>} test bind-19.17 {DeleteVirtualEvent procedure: owned by many, last} -setup { pack [frame .t.f -class Test -width 150 -height 100] pack [frame .t.g -class Test -width 150 -height 100] pack [frame .t.h -class Test -width 150 -height 100] after 250 ;# we need a bit time to ensure that .t.h is mapped focus -force .t.f update set x {} event delete <<def>> event delete <<xyz>> event delete <<abc>> } -body { |
︙ | ︙ | |||
3924 3925 3926 3927 3928 3929 3930 | set x {} } -body { bind .t.f <Key> "lappend x %E" event generate .t.f <Key> -sendevent 43 return $x } -cleanup { destroy .t.f | | | 3902 3903 3904 3905 3906 3907 3908 3909 3910 3911 3912 3913 3914 3915 3916 | set x {} } -body { bind .t.f <Key> "lappend x %E" event generate .t.f <Key> -sendevent 43 return $x } -cleanup { destroy .t.f } -result {1} test bind-22.93 {HandleEventGenerate: options <Key> -serial xyz} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update set x {} |
︙ | ︙ | |||
4938 4939 4940 4941 4942 4943 4944 | set x {} } -body { bind .t.f <<Paste>> test } -cleanup { destroy .t.f } -result {} test bind-24.4 {FindSequence procedure: virtual not allowed} -body { | | | 4916 4917 4918 4919 4920 4921 4922 4923 4924 4925 4926 4927 4928 4929 4930 | set x {} } -body { bind .t.f <<Paste>> test } -cleanup { destroy .t.f } -result {} test bind-24.4 {FindSequence procedure: virtual not allowed} -body { event add <<Paste>> <<Alive>> } -returnCodes error -result {virtual event not allowed in definition of another virtual event} test bind-24.5 {FindSequence procedure, multiple bindings} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { |
︙ | ︙ | |||
5117 5118 5119 5120 5121 5122 5123 | frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <a---> {nothing} bind .t.f } -cleanup { destroy .t.f } -result a | | > > | | > > | 5095 5096 5097 5098 5099 5100 5101 5102 5103 5104 5105 5106 5107 5108 5109 5110 5111 5112 5113 5114 5115 | frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <a---> {nothing} bind .t.f } -cleanup { destroy .t.f } -result a test bind-25.4 {ParseEventDescription} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <<Shift-Paste>> {puts hi} bind .t.f } -cleanup { destroy .t.f } -result {<<Shift-Paste>>} # Assorted error cases in event sequence parsing test bind-25.5 {ParseEventDescription procedure error cases} -body { bind .t \x7 {puts hi} } -returnCodes error -result {bad ASCII character 0x7} test bind-25.6 {ParseEventDescription procedure error cases} -body { |
︙ | ︙ | |||
5166 5167 5168 5169 5170 5171 5172 | test bind-25.17 {ParseEventDescription} -body { event add <<xyz>> <<abc>> } -returnCodes error -result {virtual event not allowed in definition of another virtual event} # Modifier canonicalization tests test bind-25.18 {modifier names} -setup { | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 5148 5149 5150 5151 5152 5153 5154 5155 5156 5157 5158 5159 5160 5161 5162 5163 5164 5165 5166 5167 5168 5169 5170 5171 5172 5173 5174 5175 5176 5177 5178 5179 5180 5181 5182 5183 5184 5185 5186 5187 5188 5189 5190 5191 5192 5193 5194 5195 5196 5197 5198 5199 5200 5201 5202 5203 5204 5205 5206 5207 5208 5209 5210 5211 5212 5213 5214 5215 5216 5217 5218 5219 5220 5221 5222 5223 5224 5225 5226 5227 5228 5229 5230 5231 5232 5233 5234 5235 5236 5237 5238 5239 5240 5241 5242 5243 5244 5245 5246 5247 5248 5249 5250 5251 5252 5253 5254 5255 5256 5257 5258 5259 5260 5261 5262 5263 5264 5265 5266 5267 5268 5269 5270 5271 5272 5273 5274 5275 5276 5277 5278 5279 5280 5281 5282 5283 5284 5285 5286 5287 5288 5289 5290 5291 5292 5293 5294 5295 5296 5297 5298 5299 5300 5301 5302 5303 5304 5305 5306 5307 5308 5309 5310 5311 5312 5313 5314 5315 5316 5317 5318 5319 5320 5321 5322 5323 5324 5325 5326 5327 5328 5329 5330 5331 5332 5333 5334 5335 5336 5337 5338 5339 5340 5341 5342 5343 5344 5345 5346 5347 5348 5349 5350 5351 5352 5353 5354 5355 5356 5357 5358 5359 5360 5361 5362 5363 5364 5365 5366 5367 5368 5369 5370 5371 5372 5373 5374 5375 5376 5377 5378 5379 5380 5381 5382 5383 5384 5385 5386 5387 5388 5389 5390 5391 5392 5393 5394 5395 5396 5397 5398 5399 5400 5401 5402 5403 5404 5405 5406 5407 5408 5409 5410 5411 5412 5413 5414 5415 5416 5417 5418 5419 5420 5421 5422 5423 5424 5425 5426 5427 5428 5429 5430 5431 5432 5433 5434 5435 5436 5437 5438 5439 5440 5441 5442 5443 5444 5445 5446 5447 5448 5449 5450 5451 5452 5453 5454 5455 5456 5457 5458 5459 5460 5461 5462 5463 5464 5465 | test bind-25.17 {ParseEventDescription} -body { event add <<xyz>> <<abc>> } -returnCodes error -result {virtual event not allowed in definition of another virtual event} # Modifier canonicalization tests test bind-25.18 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f {<Control- a>} foo bind .t.f } -cleanup { destroy .t.f } -result <Control-Key-a> test bind-25.19 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Shift-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Shift-Key-a> test bind-25.20 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Lock-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Lock-Key-a> test bind-25.21 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Meta---a> foo bind .t.f } -cleanup { destroy .t.f } -result <Meta-Key-a> test bind-25.22 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <M-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Meta-Key-a> test bind-25.23 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Alt-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Alt-Key-a> test bind-25.24 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <B1-a> foo bind .t.f } -cleanup { destroy .t.f } -result <B1-Key-a> test bind-25.25 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <B2-a> foo bind .t.f } -cleanup { destroy .t.f } -result <B2-Key-a> test bind-25.26 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <B3-a> foo bind .t.f } -cleanup { destroy .t.f } -result <B3-Key-a> test bind-25.27 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <B4-a> foo bind .t.f } -cleanup { destroy .t.f } -result <B4-Key-a> test bind-25.28 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <B5-a> foo bind .t.f } -cleanup { destroy .t.f } -result <B5-Key-a> test bind-25.29 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Button1-a> foo bind .t.f } -cleanup { destroy .t.f } -result <B1-Key-a> test bind-25.30 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Button2-a> foo bind .t.f } -cleanup { destroy .t.f } -result <B2-Key-a> test bind-25.31 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Button3-a> foo bind .t.f } -cleanup { destroy .t.f } -result <B3-Key-a> test bind-25.32 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Button4-a> foo bind .t.f } -cleanup { destroy .t.f } -result <B4-Key-a> test bind-25.33 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Button5-a> foo bind .t.f } -cleanup { destroy .t.f } -result <B5-Key-a> test bind-25.34 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <M1-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Mod1-Key-a> test bind-25.35 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <M2-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Mod2-Key-a> test bind-25.36 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <M3-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Mod3-Key-a> test bind-25.37 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <M4-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Mod4-Key-a> test bind-25.38 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <M5-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Mod5-Key-a> test bind-25.39 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Mod1-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Mod1-Key-a> test bind-25.40 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Mod2-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Mod2-Key-a> test bind-25.41 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Mod3-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Mod3-Key-a> test bind-25.42 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Mod4-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Mod4-Key-a> test bind-25.43 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Mod5-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Mod5-Key-a> test bind-25.44 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Double-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Double-Key-a> test bind-25.45 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Triple-a> foo bind .t.f } -cleanup { destroy .t.f } -result <Triple-Key-a> test bind-25.46 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f {<Double 1>} foo bind .t.f } -cleanup { destroy .t.f } -result <Double-Button-1> test bind-25.47 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Triple-1> foo bind .t.f } -cleanup { destroy .t.f } -result <Triple-Button-1> test bind-25.48 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f {<M1-M2 M3-M4 B1-Control-a>} foo bind .t.f } -cleanup { destroy .t.f } -result <Control-B1-Mod1-Mod2-Mod3-Mod4-Key-a> test bind-25.49 {modifier names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <Extended-Return> foo bind .t.f } -cleanup { destroy .t.f } -result <Extended-Key-Return> test bind-26.1 {event names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <FocusIn> {nothing} bind .t.f } -cleanup { destroy .t.f } -result <FocusIn> test bind-26.2 {event names} -setup { frame .t.f -class Test -width 150 -height 100 } -body { bind .t.f <FocusOut> {nothing} bind .t.f } -cleanup { destroy .t.f } -result <FocusOut> test bind-26.3 {event names} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { |
︙ | ︙ | |||
5491 5492 5493 5494 5495 5496 5497 | test bind-26.4 {event names: Motion} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | | 5473 5474 5475 5476 5477 5478 5479 5480 5481 5482 5483 5484 5485 5486 5487 5488 5489 5490 5491 5492 5493 5494 5495 5496 5497 5498 5499 5500 5501 5502 5503 5504 5505 5506 5507 5508 5509 5510 5511 5512 5513 5514 5515 5516 5517 5518 5519 5520 5521 5522 5523 5524 5525 5526 5527 5528 5529 5530 5531 5532 5533 5534 5535 5536 5537 5538 5539 5540 5541 5542 5543 5544 5545 5546 5547 5548 5549 5550 5551 5552 5553 5554 5555 5556 5557 5558 5559 5560 5561 5562 5563 5564 5565 5566 5567 5568 5569 5570 5571 5572 5573 5574 5575 5576 5577 5578 5579 5580 5581 5582 5583 5584 5585 5586 5587 5588 5589 5590 5591 5592 5593 5594 5595 5596 5597 5598 5599 5600 5601 5602 5603 5604 5605 5606 5607 5608 5609 5610 5611 5612 5613 5614 5615 5616 5617 5618 5619 5620 5621 5622 5623 5624 5625 5626 5627 5628 5629 5630 5631 5632 5633 5634 5635 5636 5637 5638 5639 5640 5641 5642 5643 5644 5645 5646 5647 5648 5649 5650 5651 5652 5653 5654 5655 5656 5657 5658 5659 5660 5661 5662 5663 5664 5665 5666 5667 5668 5669 5670 5671 5672 5673 5674 5675 5676 5677 5678 5679 5680 5681 5682 5683 5684 5685 5686 5687 5688 5689 5690 5691 5692 5693 5694 5695 5696 5697 5698 5699 5700 5701 5702 5703 5704 5705 5706 5707 5708 5709 5710 5711 5712 5713 5714 5715 5716 5717 5718 5719 5720 5721 5722 5723 5724 5725 5726 5727 5728 5729 5730 5731 5732 5733 5734 5735 5736 5737 5738 5739 5740 5741 5742 5743 5744 5745 5746 5747 5748 5749 5750 5751 5752 5753 5754 5755 5756 5757 5758 5759 5760 5761 5762 5763 5764 5765 5766 5767 5768 5769 5770 5771 5772 5773 5774 5775 5776 5777 5778 5779 5780 5781 5782 5783 | test bind-26.4 {event names: Motion} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Motion> "set x {event Motion}" set x xyzzy event generate .t.f <Motion> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Motion} <Motion>} test bind-26.5 {event names: Button} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Button> "set x {event Button}" set x xyzzy event generate .t.f <Button> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Button} <Button>} test bind-26.6 {event names: ButtonPress} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <ButtonPress> "set x {event ButtonPress}" set x xyzzy event generate .t.f <ButtonPress> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event ButtonPress} <Button>} test bind-26.7 {event names: ButtonRelease} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <ButtonRelease> "set x {event ButtonRelease}" set x xyzzy event generate .t.f <ButtonRelease> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event ButtonRelease} <ButtonRelease>} test bind-26.8 {event names: Colormap} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Colormap> "set x {event Colormap}" set x xyzzy event generate .t.f <Colormap> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Colormap} <Colormap>} test bind-26.9 {event names: Enter} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Enter> "set x {event Enter}" set x xyzzy event generate .t.f <Enter> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Enter} <Enter>} test bind-26.10 {event names: Leave} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Leave> "set x {event Leave}" set x xyzzy event generate .t.f <Leave> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Leave} <Leave>} test bind-26.11 {event names: Expose} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Expose> "set x {event Expose}" set x xyzzy event generate .t.f <Expose> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Expose} <Expose>} test bind-26.12 {event names: Key} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Key> "set x {event Key}" set x xyzzy event generate .t.f <Key> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Key} <Key>} test bind-26.13 {event names: KeyPress} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <KeyPress> "set x {event KeyPress}" set x xyzzy event generate .t.f <KeyPress> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event KeyPress} <Key>} test bind-26.14 {event names: KeyRelease} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <KeyRelease> "set x {event KeyRelease}" set x xyzzy event generate .t.f <KeyRelease> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event KeyRelease} <KeyRelease>} test bind-26.15 {event names: Property} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Property> "set x {event Property}" set x xyzzy event generate .t.f <Property> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Property} <Property>} test bind-26.16 {event names: Visibility} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Visibility> "set x {event Visibility}" set x xyzzy event generate .t.f <Visibility> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Visibility} <Visibility>} test bind-26.17 {event names: Activate} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Activate> "set x {event Activate}" set x xyzzy event generate .t.f <Activate> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Activate} <Activate>} test bind-26.18 {event names: Deactivate} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Deactivate> "set x {event Deactivate}" set x xyzzy event generate .t.f <Deactivate> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Deactivate} <Deactivate>} # These events require an extra argument to [event generate] test bind-26.19 {event names: Circulate} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Circulate> "set x {event Circulate}" set x xyzzy event generate .t.f <Circulate> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Circulate} <Circulate>} test bind-26.20 {event names: Configure} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Configure> "set x {event Configure}" set x xyzzy event generate .t.f <Configure> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Configure} <Configure>} test bind-26.21 {event names: Gravity} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Gravity> "set x {event Gravity}" set x xyzzy event generate .t.f <Gravity> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Gravity} <Gravity>} test bind-26.22 {event names: Map} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Map> "set x {event Map}" set x xyzzy event generate .t.f <Map> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Map} <Map>} test bind-26.23 {event names: Reparent} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Reparent> "set x {event Reparent}" set x xyzzy event generate .t.f <Reparent> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Reparent} <Reparent>} test bind-26.24 {event names: Unmap} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Unmap> "set x {event Unmap}" set x xyzzy event generate .t.f <Unmap> list $x [bind .t.f] } -cleanup { destroy .t.f } -result {{event Unmap} <Unmap>} test bind-27.1 {button names} -body { bind .t <Expose-1> foo } -returnCodes error -result {specified button "1" for non-button event} test bind-27.2 {button names} -body { bind .t <Button-6> foo } -returnCodes error -result {bad button number "6"} test bind-27.3 {button names} -setup { frame .t.f -class Test -width 150 -height 100 pack .t.f focus -force .t.f update } -body { bind .t.f <Button-1> {lappend x "button 1"} |
︙ | ︙ | |||
6122 6123 6124 6125 6126 6127 6128 | bind .t.f <<TestUserData>> {set x "TestUserData >%d<"} event generate .t.f <<TestUserData>> -data [string index abc 1] -when head list $x [update] $x } -cleanup { destroy .t.f } -result {{} {} {TestUserData >b<}} | | > > > > > > > > > > > > > > | > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > | 6104 6105 6106 6107 6108 6109 6110 6111 6112 6113 6114 6115 6116 6117 6118 6119 6120 6121 6122 6123 6124 6125 6126 6127 6128 6129 6130 6131 6132 6133 6134 6135 6136 6137 6138 6139 6140 6141 6142 6143 6144 6145 6146 6147 6148 6149 6150 6151 6152 6153 6154 6155 6156 6157 6158 6159 6160 6161 6162 6163 6164 6165 6166 6167 6168 6169 6170 6171 6172 6173 6174 6175 6176 6177 6178 6179 6180 6181 6182 6183 6184 6185 6186 6187 6188 6189 6190 6191 6192 6193 6194 6195 6196 6197 6198 6199 6200 6201 6202 6203 6204 6205 6206 6207 6208 6209 6210 6211 6212 6213 6214 6215 6216 6217 6218 6219 6220 6221 6222 6223 6224 6225 6226 6227 6228 6229 6230 6231 6232 6233 6234 6235 6236 6237 6238 6239 6240 6241 6242 6243 6244 | bind .t.f <<TestUserData>> {set x "TestUserData >%d<"} event generate .t.f <<TestUserData>> -data [string index abc 1] -when head list $x [update] $x } -cleanup { destroy .t.f } -result {{} {} {TestUserData >b<}} test bind-32.1 {-warp, window was destroyed before the idle callback DoWarp} -setup { frame .t.f pack .t.f focus -force .t.f update } -body { event generate .t.f <Button-1> -warp 1 event generate .t.f <ButtonRelease-1> destroy .t.f update ; # shall simply not crash } -cleanup { } -result {} test bind-32.2 {detection of double click should not fail} -setup { pack [frame .t.f] focus -force .t.f bind .t.f <Double-Button-1> { set x "Double" } update set x {} } -body { event generate .t.f <ButtonPress-1> event generate .t.f <ButtonRelease-1> # Simulate a lot of intervening exposure events, with old implementation # the event loop overflows, and the double click will not be detected. # But new implementation should work properly. for {set i 0} {$i < 1000} {incr i} { event generate .t.f <Expose> } event generate .t.f <ButtonPress-1> event generate .t.f <ButtonRelease-1> set x } -cleanup { destroy .t.f } -result {Double} test bind-32.3 {should trigger best match of modifier states} -setup { pack [frame .t.f] focus -force .t.f update } -body { bind .t.f <Alt-Control-Key-A> { set x "Alt-Control" } bind .t.f <Shift-Control-Key-A> { set x "Shift-Control" } bind .t.f <Shift-Key-A> { set x "Shift" } event generate .t.f <Alt-Control-Key-A> set x } -cleanup { destroy .t.f } -result {Shift-Control} test bind-32.4 {should not trigger Double-1} -setup { pack [frame .t.f] focus -force .t.f update set x {} } -body { bind .t.f <Double-1> { set x "Double" } event generate .t.f <1> -time current after 1000 event generate .t.f <1> -time current set x } -cleanup { destroy .t.f } -result {} test bind-32.5 {should trigger Quadruple-1} -setup { pack [frame .t.f] focus -force .t.f update set x {} } -body { bind .t.f <Quadruple-1> { set x "Quadruple" } # Old implementation triggers "Double", but new implementation # will trigger "Quadruple", the latter behavior conforms to other # toolkits. event generate .t.f <Button-1> -time 0 event generate .t.f <Button-1> -time 400 event generate .t.f <Button-1> -time 800 event generate .t.f <Button-1> -time 1200 set x } -cleanup { destroy .t.f } -result {Quadruple} test bind-32.6 {problem with sendevent} -setup { pack [frame .t.f] focus -force .t.f update set x {} } -body { # old implementation is losing sendevent value bind .t.f <FocusIn> { set x "sendevent=%E" } event generate .t.f <FocusIn> -sendevent 1 set x } -cleanup { destroy .t.f } -result {sendevent=1} test bind-33.1 {prefer longest match} -setup { pack [frame .t.f] focus -force .t.f update set x {} } -body { bind .t.f <a><1><1> { set x "a11" } bind .t.f <Double-1> { set x "Double" } event generate .t.f <a> event generate .t.f <1> event generate .t.f <1> set x } -cleanup { destroy .t.f } -result {a11} test bind-33.2 {don't prefer more specialized event} -setup { pack [frame .t.f] focus -force .t.f update set x {} } -body { bind .t.f <Double-1> { set x "Double" } bind .t.f <1><1> { set x "11" } event generate .t.f <1> event generate .t.f <1> set x } -cleanup { destroy .t.f # This test case shows that old implementation has an issue, because # in my opinion it is expected that <Double-1> is matching, because # this binding is more specialized. But new implementation will be # conform to old, and so "11" is the correct result. } -result {11} # cleanup cleanupTests return # Local Variables: # mode: tcl # End: |