зеркало из https://github.com/mozilla/pjs.git
4746 строки
135 KiB
C++
4746 строки
135 KiB
C++
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*-
|
|
*
|
|
* The contents of this file are subject to the Netscape Public
|
|
* License Version 1.1 (the "License"); you may not use this file
|
|
* except in compliance with the License. You may obtain a copy of
|
|
* the License at http://www.mozilla.org/NPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS
|
|
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
|
|
* implied. See the License for the specific language governing
|
|
* rights and limitations under the License.
|
|
*
|
|
* The Original Code is mozilla.org code.
|
|
*
|
|
* The Initial Developer of the Original Code is Netscape
|
|
* Communications Corporation. Portions created by Netscape are
|
|
* Copyright (C) 1998 Netscape Communications Corporation. All
|
|
* Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
*/
|
|
|
|
#include <stdlib.h>
|
|
#include "nsITransactionManager.h"
|
|
#include "nsTransactionManagerCID.h"
|
|
#include "nsIComponentManager.h"
|
|
|
|
static PRInt32 sConstructorCount = 0;
|
|
static PRInt32 sDestructorCount = 0;
|
|
static PRInt32 *sDestructorOrderArr = 0;
|
|
static PRInt32 sDoCount = 0;
|
|
static PRInt32 *sDoOrderArr = 0;
|
|
static PRInt32 sUndoCount = 0;
|
|
static PRInt32 *sUndoOrderArr = 0;
|
|
static PRInt32 sRedoCount = 0;
|
|
static PRInt32 *sRedoOrderArr = 0;
|
|
|
|
// #define ENABLE_DEBUG_PRINTFS 1
|
|
|
|
PRInt32 sSimpleTestDestructorOrderArr[] = {
|
|
2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
|
|
16, 17, 18, 19, 20, 21, 1, 22, 23, 24, 25, 26, 27, 28,
|
|
29, 30, 31, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52,
|
|
53, 54, 55, 56, 57, 58, 59, 60, 61, 41, 40, 62, 39, 38,
|
|
37, 36, 35, 34, 33, 32, 68, 63, 64, 65, 66, 67, 69, 71,
|
|
70, 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, 111, 110, 109, 108, 107, 106, 105, 104, 103, 102, 131,
|
|
130, 129, 128, 127, 126, 125, 124, 123, 122, 121, 120, 119, 118, 117,
|
|
116, 115, 114, 113, 112 };
|
|
|
|
PRInt32 sSimpleTestDoOrderArr[] = {
|
|
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 };
|
|
|
|
PRInt32 sSimpleTestUndoOrderArr[] = {
|
|
41, 40, 39, 38, 62, 39, 38, 37, 69, 71, 70, 111, 110, 109,
|
|
108, 107, 106, 105, 104, 103, 102, 131, 130, 129, 128, 127, 126, 125,
|
|
124, 123, 122 };
|
|
|
|
static PRInt32 sSimpleTestRedoOrderArr[] = {
|
|
38, 39, 70 };
|
|
|
|
PRInt32 sAggregateTestDestructorOrderArr[] = {
|
|
14, 13, 12, 11, 10, 9, 8, 21, 20, 19, 18, 17, 16, 15,
|
|
28, 27, 26, 25, 24, 23, 22, 35, 34, 33, 32, 31, 30, 29,
|
|
42, 41, 40, 39, 38, 37, 36, 49, 48, 47, 46, 45, 44, 43,
|
|
56, 55, 54, 53, 52, 51, 50, 63, 62, 61, 60, 59, 58, 57,
|
|
70, 69, 68, 67, 66, 65, 64, 77, 76, 75, 74, 73, 72, 71,
|
|
84, 83, 82, 81, 80, 79, 78, 91, 90, 89, 88, 87, 86, 85,
|
|
98, 97, 96, 95, 94, 93, 92, 105, 104, 103, 102, 101, 100, 99,
|
|
112, 111, 110, 109, 108, 107, 106, 119, 118, 117, 116, 115, 114, 113,
|
|
126, 125, 124, 123, 122, 121, 120, 133, 132, 131, 130, 129, 128, 127,
|
|
140, 139, 138, 137, 136, 135, 134, 147, 146, 145, 144, 143, 142, 141,
|
|
7, 6, 5, 4, 3, 2, 1, 154, 153, 152, 151, 150, 149, 148,
|
|
161, 160, 159, 158, 157, 156, 155, 168, 167, 166, 165, 164, 163, 162,
|
|
175, 174, 173, 172, 171, 170, 169, 182, 181, 180, 179, 178, 177, 176,
|
|
189, 188, 187, 186, 185, 184, 183, 196, 195, 194, 193, 192, 191, 190,
|
|
203, 202, 201, 200, 199, 198, 197, 210, 209, 208, 207, 206, 205, 204,
|
|
217, 216, 215, 214, 213, 212, 211, 294, 293, 292, 291, 290, 289, 288,
|
|
301, 300, 299, 298, 297, 296, 295, 308, 307, 306, 305, 304, 303, 302,
|
|
315, 314, 313, 312, 311, 310, 309, 322, 321, 320, 319, 318, 317, 316,
|
|
329, 328, 327, 326, 325, 324, 323, 336, 335, 334, 333, 332, 331, 330,
|
|
343, 342, 341, 340, 339, 338, 337, 350, 349, 348, 347, 346, 345, 344,
|
|
357, 356, 355, 354, 353, 352, 351, 364, 363, 362, 361, 360, 359, 358,
|
|
371, 370, 369, 368, 367, 366, 365, 378, 377, 376, 375, 374, 373, 372,
|
|
385, 384, 383, 382, 381, 380, 379, 392, 391, 390, 389, 388, 387, 386,
|
|
399, 398, 397, 396, 395, 394, 393, 406, 405, 404, 403, 402, 401, 400,
|
|
413, 412, 411, 410, 409, 408, 407, 420, 419, 418, 417, 416, 415, 414,
|
|
427, 426, 425, 424, 423, 422, 421, 287, 286, 285, 284, 283, 282, 281,
|
|
280, 279, 278, 277, 276, 275, 274, 434, 433, 432, 431, 430, 429, 428,
|
|
273, 272, 271, 270, 269, 268, 267, 266, 265, 264, 263, 262, 261, 260,
|
|
259, 258, 257, 256, 255, 254, 253, 252, 251, 250, 249, 248, 247, 246,
|
|
245, 244, 243, 242, 241, 240, 239, 238, 237, 236, 235, 234, 233, 232,
|
|
231, 230, 229, 228, 227, 226, 225, 224, 223, 222, 221, 220, 219, 218,
|
|
472, 471, 470, 441, 440, 439, 438, 437, 436, 435, 448, 447, 446, 445,
|
|
444, 443, 442, 455, 454, 453, 452, 451, 450, 449, 462, 461, 460, 459,
|
|
458, 457, 456, 469, 468, 467, 466, 465, 464, 463, 479, 478, 477, 476,
|
|
475, 474, 473, 493, 492, 491, 490, 489, 488, 487, 486, 485, 484, 483,
|
|
482, 481, 480, 496, 497, 495, 499, 500, 498, 494, 503, 504, 502, 506,
|
|
507, 505, 501, 510, 511, 509, 513, 514, 512, 508, 517, 518, 516, 520,
|
|
521, 519, 515, 524, 525, 523, 527, 528, 526, 522, 531, 532, 530, 534,
|
|
535, 533, 529, 538, 539, 537, 541, 542, 540, 536, 545, 546, 544, 548,
|
|
549, 547, 543, 552, 553, 551, 555, 556, 554, 550, 559, 560, 558, 562,
|
|
563, 561, 557, 566, 567, 565, 569, 570, 568, 564, 573, 574, 572, 576,
|
|
577, 575, 571, 580, 581, 579, 583, 584, 582, 578, 587, 588, 586, 590,
|
|
591, 589, 585, 594, 595, 593, 597, 598, 596, 592, 601, 602, 600, 604,
|
|
605, 603, 599, 608, 609, 607, 611, 612, 610, 606, 615, 616, 614, 618,
|
|
619, 617, 613, 622, 623, 621, 625, 626, 624, 620, 629, 630, 628, 632,
|
|
633, 631, 627, 640, 639, 638, 637, 636, 635, 634, 647, 646, 645, 644,
|
|
643, 642, 641, 654, 653, 652, 651, 650, 649, 648, 661, 660, 659, 658,
|
|
657, 656, 655, 668, 667, 666, 665, 664, 663, 662, 675, 674, 673, 672,
|
|
671, 670, 669, 682, 681, 680, 679, 678, 677, 676, 689, 688, 687, 686,
|
|
685, 684, 683, 696, 695, 694, 693, 692, 691, 690, 703, 702, 701, 700,
|
|
699, 698, 697, 773, 772, 771, 770, 769, 768, 767, 766, 765, 764, 763,
|
|
762, 761, 760, 759, 758, 757, 756, 755, 754, 753, 752, 751, 750, 749,
|
|
748, 747, 746, 745, 744, 743, 742, 741, 740, 739, 738, 737, 736, 735,
|
|
734, 733, 732, 731, 730, 729, 728, 727, 726, 725, 724, 723, 722, 721,
|
|
720, 719, 718, 717, 716, 715, 714, 713, 712, 711, 710, 709, 708, 707,
|
|
706, 705, 704, 913, 912, 911, 910, 909, 908, 907, 906, 905, 904, 903,
|
|
902, 901, 900, 899, 898, 897, 896, 895, 894, 893, 892, 891, 890, 889,
|
|
888, 887, 886, 885, 884, 883, 882, 881, 880, 879, 878, 877, 876, 875,
|
|
874, 873, 872, 871, 870, 869, 868, 867, 866, 865, 864, 863, 862, 861,
|
|
860, 859, 858, 857, 856, 855, 854, 853, 852, 851, 850, 849, 848, 847,
|
|
846, 845, 844, 843, 842, 841, 840, 839, 838, 837, 836, 835, 834, 833,
|
|
832, 831, 830, 829, 828, 827, 826, 825, 824, 823, 822, 821, 820, 819,
|
|
818, 817, 816, 815, 814, 813, 812, 811, 810, 809, 808, 807, 806, 805,
|
|
804, 803, 802, 801, 800, 799, 798, 797, 796, 795, 794, 793, 792, 791,
|
|
790, 789, 788, 787, 786, 785, 784, 783, 782, 781, 780, 779, 778, 777,
|
|
776, 775, 774 };
|
|
|
|
PRInt32 sAggregateTestDoOrderArr[] = {
|
|
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,
|
|
547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560,
|
|
561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574,
|
|
575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588,
|
|
589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602,
|
|
603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616,
|
|
617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630,
|
|
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 };
|
|
|
|
PRInt32 sAggregateTestUndoOrderArr[] = {
|
|
287, 286, 285, 284, 283, 282, 281, 280, 279, 278, 277, 276, 275, 274,
|
|
273, 272, 271, 270, 269, 268, 267, 266, 265, 264, 263, 262, 261, 260,
|
|
434, 433, 432, 431, 430, 429, 428, 273, 272, 271, 270, 269, 268, 267,
|
|
266, 265, 264, 263, 262, 261, 260, 259, 258, 257, 256, 255, 254, 253,
|
|
479, 478, 477, 476, 475, 493, 492, 491, 490, 489, 488, 487, 486, 485,
|
|
484, 483, 482, 481, 480, 485, 484, 483, 482, 481, 480, 773, 772, 771,
|
|
770, 769, 768, 767, 766, 765, 764, 763, 762, 761, 760, 759, 758, 757,
|
|
756, 755, 754, 753, 752, 751, 750, 749, 748, 747, 746, 745, 744, 743,
|
|
742, 741, 740, 739, 738, 737, 736, 735, 734, 733, 732, 731, 730, 729,
|
|
728, 727, 726, 725, 724, 723, 722, 721, 720, 719, 718, 717, 716, 715,
|
|
714, 713, 712, 711, 710, 709, 708, 707, 706, 705, 704, 913, 912, 911,
|
|
910, 909, 908, 907, 906, 905, 904, 903, 902, 901, 900, 899, 898, 897,
|
|
896, 895, 894, 893, 892, 891, 890, 889, 888, 887, 886, 885, 884, 883,
|
|
882, 881, 880, 879, 878, 877, 876, 875, 874, 873, 872, 871, 870, 869,
|
|
868, 867, 866, 865, 864, 863, 862, 861, 860, 859, 858, 857, 856, 855,
|
|
854, 853, 852, 851, 850, 849, 848, 847, 846, 845, 844 };
|
|
|
|
PRInt32 sAggregateTestRedoOrderArr[] = {
|
|
260, 261, 262, 263, 264, 265, 266, 267, 268, 269, 270, 271, 272, 273,
|
|
476, 477, 478, 479, 480, 481, 482, 483, 484, 485, 486 };
|
|
|
|
PRInt32 sSimpleBatchTestDestructorOrderArr[] = {
|
|
21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34,
|
|
35, 36, 37, 38, 39, 40, 43, 42, 41, 64, 63, 62, 61, 60,
|
|
59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 49, 48, 47, 46,
|
|
45, 44, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9,
|
|
8, 7, 6, 5, 4, 3, 2, 1, 65, 67, 66, 68, 69, 70,
|
|
71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84,
|
|
85, 86, 87, 107, 106, 105, 104, 103, 102, 101, 100, 99, 98, 97,
|
|
96, 95, 94, 93, 92, 91, 90, 89, 88 };
|
|
|
|
PRInt32 sSimpleBatchTestDoOrderArr[] = {
|
|
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 };
|
|
|
|
PRInt32 sSimpleBatchTestUndoOrderArr[] = {
|
|
43, 42, 41, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10,
|
|
9, 8, 7, 6, 5, 4, 3, 2, 1, 43, 42, 41, 63, 62,
|
|
61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50, 49, 48,
|
|
47, 46, 45, 44, 65, 67, 66, 107, 106, 105, 104, 103, 102, 101,
|
|
100, 99, 98 };
|
|
|
|
PRInt32 sSimpleBatchTestRedoOrderArr[] = {
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14,
|
|
15, 16, 17, 18, 19, 20, 41, 42, 43, 66 };
|
|
|
|
PRInt32 sAggregateBatchTestDestructorOrderArr[] = {
|
|
147, 146, 145, 144, 143, 142, 141, 154, 153, 152, 151, 150, 149, 148,
|
|
161, 160, 159, 158, 157, 156, 155, 168, 167, 166, 165, 164, 163, 162,
|
|
175, 174, 173, 172, 171, 170, 169, 182, 181, 180, 179, 178, 177, 176,
|
|
189, 188, 187, 186, 185, 184, 183, 196, 195, 194, 193, 192, 191, 190,
|
|
203, 202, 201, 200, 199, 198, 197, 210, 209, 208, 207, 206, 205, 204,
|
|
217, 216, 215, 214, 213, 212, 211, 224, 223, 222, 221, 220, 219, 218,
|
|
231, 230, 229, 228, 227, 226, 225, 238, 237, 236, 235, 234, 233, 232,
|
|
245, 244, 243, 242, 241, 240, 239, 252, 251, 250, 249, 248, 247, 246,
|
|
259, 258, 257, 256, 255, 254, 253, 266, 265, 264, 263, 262, 261, 260,
|
|
273, 272, 271, 270, 269, 268, 267, 280, 279, 278, 277, 276, 275, 274,
|
|
301, 300, 299, 298, 297, 296, 295, 294, 293, 292, 291, 290, 289, 288,
|
|
287, 286, 285, 284, 283, 282, 281, 444, 443, 442, 441, 440, 439, 438,
|
|
437, 436, 435, 434, 433, 432, 431, 430, 429, 428, 427, 426, 425, 424,
|
|
423, 422, 421, 420, 419, 418, 417, 416, 415, 414, 413, 412, 411, 410,
|
|
409, 408, 407, 406, 405, 404, 403, 402, 401, 400, 399, 398, 397, 396,
|
|
395, 394, 393, 392, 391, 390, 389, 388, 387, 386, 385, 384, 383, 382,
|
|
381, 380, 379, 378, 377, 376, 375, 374, 373, 372, 371, 370, 369, 368,
|
|
367, 366, 365, 364, 363, 362, 361, 360, 359, 358, 357, 356, 355, 354,
|
|
353, 352, 351, 350, 349, 348, 347, 346, 345, 344, 343, 342, 341, 340,
|
|
339, 338, 337, 336, 335, 334, 333, 332, 331, 330, 329, 328, 327, 326,
|
|
325, 324, 323, 322, 321, 320, 319, 318, 317, 316, 315, 314, 313, 312,
|
|
311, 310, 309, 308, 307, 306, 305, 304, 303, 302, 140, 139, 138, 137,
|
|
136, 135, 134, 133, 132, 131, 130, 129, 128, 127, 126, 125, 124, 123,
|
|
122, 121, 120, 119, 118, 117, 116, 115, 114, 113, 112, 111, 110, 109,
|
|
108, 107, 106, 105, 104, 103, 102, 101, 100, 99, 98, 97, 96, 95,
|
|
94, 93, 92, 91, 90, 89, 88, 87, 86, 85, 84, 83, 82, 81,
|
|
80, 79, 78, 77, 76, 75, 74, 73, 72, 71, 70, 69, 68, 67,
|
|
66, 65, 64, 63, 62, 61, 60, 59, 58, 57, 56, 55, 54, 53,
|
|
52, 51, 50, 49, 48, 47, 46, 45, 44, 43, 42, 41, 40, 39,
|
|
38, 37, 36, 35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 25,
|
|
24, 23, 22, 21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11,
|
|
10, 9, 8, 7, 6, 5, 4, 3, 2, 1, 451, 450, 449, 448,
|
|
447, 446, 445, 465, 464, 463, 462, 461, 460, 459, 458, 457, 456, 455,
|
|
454, 453, 452, 468, 469, 467, 471, 472, 470, 466, 475, 476, 474, 478,
|
|
479, 477, 473, 482, 483, 481, 485, 486, 484, 480, 489, 490, 488, 492,
|
|
493, 491, 487, 496, 497, 495, 499, 500, 498, 494, 503, 504, 502, 506,
|
|
507, 505, 501, 510, 511, 509, 513, 514, 512, 508, 517, 518, 516, 520,
|
|
521, 519, 515, 524, 525, 523, 527, 528, 526, 522, 531, 532, 530, 534,
|
|
535, 533, 529, 538, 539, 537, 541, 542, 540, 536, 545, 546, 544, 548,
|
|
549, 547, 543, 552, 553, 551, 555, 556, 554, 550, 559, 560, 558, 562,
|
|
563, 561, 557, 566, 567, 565, 569, 570, 568, 564, 573, 574, 572, 576,
|
|
577, 575, 571, 580, 581, 579, 583, 584, 582, 578, 587, 588, 586, 590,
|
|
591, 589, 585, 594, 595, 593, 597, 598, 596, 592, 601, 602, 600, 604,
|
|
605, 603, 599, 745, 744, 743, 742, 741, 740, 739, 738, 737, 736, 735,
|
|
734, 733, 732, 731, 730, 729, 728, 727, 726, 725, 724, 723, 722, 721,
|
|
720, 719, 718, 717, 716, 715, 714, 713, 712, 711, 710, 709, 708, 707,
|
|
706, 705, 704, 703, 702, 701, 700, 699, 698, 697, 696, 695, 694, 693,
|
|
692, 691, 690, 689, 688, 687, 686, 685, 684, 683, 682, 681, 680, 679,
|
|
678, 677, 676, 675, 674, 673, 672, 671, 670, 669, 668, 667, 666, 665,
|
|
664, 663, 662, 661, 660, 659, 658, 657, 656, 655, 654, 653, 652, 651,
|
|
650, 649, 648, 647, 646, 645, 644, 643, 642, 641, 640, 639, 638, 637,
|
|
636, 635, 634, 633, 632, 631, 630, 629, 628, 627, 626, 625, 624, 623,
|
|
622, 621, 620, 619, 618, 617, 616, 615, 614, 613, 612, 611, 610, 609,
|
|
608, 607, 606 };
|
|
|
|
PRInt32 sAggregateBatchTestDoOrderArr[] = {
|
|
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,
|
|
547, 548, 549, 550, 551, 552, 553, 554, 555, 556, 557, 558, 559, 560,
|
|
561, 562, 563, 564, 565, 566, 567, 568, 569, 570, 571, 572, 573, 574,
|
|
575, 576, 577, 578, 579, 580, 581, 582, 583, 584, 585, 586, 587, 588,
|
|
589, 590, 591, 592, 593, 594, 595, 596, 597, 598, 599, 600, 601, 602,
|
|
603, 604, 605, 606, 607, 608, 609, 610, 611, 612, 613, 614, 615, 616,
|
|
617, 618, 619, 620, 621, 622, 623, 624, 625, 626, 627, 628, 629, 630,
|
|
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 };
|
|
|
|
PRInt32 sAggregateBatchTestUndoOrderArr[] = {
|
|
301, 300, 299, 298, 297, 296, 295, 294, 293, 292, 291, 290, 289, 288,
|
|
287, 286, 285, 284, 283, 282, 281, 140, 139, 138, 137, 136, 135, 134,
|
|
133, 132, 131, 130, 129, 128, 127, 126, 125, 124, 123, 122, 121, 120,
|
|
119, 118, 117, 116, 115, 114, 113, 112, 111, 110, 109, 108, 107, 106,
|
|
105, 104, 103, 102, 101, 100, 99, 98, 97, 96, 95, 94, 93, 92,
|
|
91, 90, 89, 88, 87, 86, 85, 84, 83, 82, 81, 80, 79, 78,
|
|
77, 76, 75, 74, 73, 72, 71, 70, 69, 68, 67, 66, 65, 64,
|
|
63, 62, 61, 60, 59, 58, 57, 56, 55, 54, 53, 52, 51, 50,
|
|
49, 48, 47, 46, 45, 44, 43, 42, 41, 40, 39, 38, 37, 36,
|
|
35, 34, 33, 32, 31, 30, 29, 28, 27, 26, 25, 24, 23, 22,
|
|
21, 20, 19, 18, 17, 16, 15, 14, 13, 12, 11, 10, 9, 8,
|
|
7, 6, 5, 4, 3, 2, 1, 301, 300, 299, 298, 297, 296, 295,
|
|
294, 293, 292, 291, 290, 289, 288, 287, 286, 285, 284, 283, 282, 281,
|
|
441, 440, 439, 438, 437, 436, 435, 434, 433, 432, 431, 430, 429, 428,
|
|
427, 426, 425, 424, 423, 422, 421, 420, 419, 418, 417, 416, 415, 414,
|
|
413, 412, 411, 410, 409, 408, 407, 406, 405, 404, 403, 402, 401, 400,
|
|
399, 398, 397, 396, 395, 394, 393, 392, 391, 390, 389, 388, 387, 386,
|
|
385, 384, 383, 382, 381, 380, 379, 378, 377, 376, 375, 374, 373, 372,
|
|
371, 370, 369, 368, 367, 366, 365, 364, 363, 362, 361, 360, 359, 358,
|
|
357, 356, 355, 354, 353, 352, 351, 350, 349, 348, 347, 346, 345, 344,
|
|
343, 342, 341, 340, 339, 338, 337, 336, 335, 334, 333, 332, 331, 330,
|
|
329, 328, 327, 326, 325, 324, 323, 322, 321, 320, 319, 318, 317, 316,
|
|
315, 314, 313, 312, 311, 310, 309, 308, 307, 306, 305, 304, 303, 302,
|
|
451, 450, 449, 448, 447, 465, 464, 463, 462, 461, 460, 459, 458, 457,
|
|
456, 455, 454, 453, 452, 457, 456, 455, 454, 453, 452, 745, 744, 743,
|
|
742, 741, 740, 739, 738, 737, 736, 735, 734, 733, 732, 731, 730, 729,
|
|
728, 727, 726, 725, 724, 723, 722, 721, 720, 719, 718, 717, 716, 715,
|
|
714, 713, 712, 711, 710, 709, 708, 707, 706, 705, 704, 703, 702, 701,
|
|
700, 699, 698, 697, 696, 695, 694, 693, 692, 691, 690, 689, 688, 687,
|
|
686, 685, 684, 683, 682, 681, 680, 679, 678, 677, 676 };
|
|
|
|
PRInt32 sAggregateBatchTestRedoOrderArr[] = {
|
|
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,
|
|
281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294,
|
|
295, 296, 297, 298, 299, 300, 301, 448, 449, 450, 451, 452, 453, 454,
|
|
455, 456, 457, 458 };
|
|
|
|
static NS_DEFINE_IID(kISupportsIID, NS_ISUPPORTS_IID);
|
|
static NS_DEFINE_IID(kITransactionIID, NS_ITRANSACTION_IID);
|
|
static NS_DEFINE_IID(kITransactionManagerIID, NS_ITRANSACTIONMANAGER_IID);
|
|
static NS_DEFINE_IID(kIOutputStreamIID, NS_IOUTPUTSTREAM_IID);
|
|
|
|
static NS_DEFINE_CID(kCTransactionManagerCID, NS_TRANSACTIONMANAGER_CID);
|
|
|
|
|
|
#ifdef XP_PC
|
|
#define TRANSACTION_MANAGER_DLL "txmgr.dll"
|
|
#else
|
|
#ifdef XP_MAC
|
|
#define TRANSACTION_MANAGER_DLL "TRANSACTION_MANAGER_DLL"
|
|
#else // XP_UNIX || XP_BEOS
|
|
#define TRANSACTION_MANAGER_DLL "libtxmgr"MOZ_DLL_SUFFIX
|
|
#endif
|
|
#endif
|
|
|
|
|
|
class ConsoleOutput : public nsIOutputStream
|
|
{
|
|
public:
|
|
ConsoleOutput() {}
|
|
virtual ~ConsoleOutput() {}
|
|
|
|
NS_DECL_ISUPPORTS
|
|
|
|
NS_IMETHOD Close(void) {return NS_OK;}
|
|
NS_IMETHOD Write(const char *str, PRUint32 len, PRUint32 *wcnt)
|
|
{
|
|
*wcnt = fwrite(str, 1, len, stdout);
|
|
fflush(stdout);
|
|
return NS_OK;
|
|
}
|
|
NS_IMETHOD Flush()
|
|
{
|
|
fflush(stdout);
|
|
return NS_OK;
|
|
}
|
|
};
|
|
|
|
NS_IMPL_ADDREF(ConsoleOutput)
|
|
NS_IMPL_RELEASE(ConsoleOutput)
|
|
|
|
nsresult
|
|
ConsoleOutput::QueryInterface(REFNSIID aIID, void** aInstancePtr)
|
|
{
|
|
if (nsnull == aInstancePtr) {
|
|
return NS_ERROR_NULL_POINTER;
|
|
}
|
|
if (aIID.Equals(kISupportsIID)) {
|
|
*aInstancePtr = (void*)(nsISupports*)this;
|
|
NS_ADDREF_THIS();
|
|
return NS_OK;
|
|
}
|
|
if (aIID.Equals(kIOutputStreamIID)) {
|
|
*aInstancePtr = (void*)(nsITransaction*)this;
|
|
NS_ADDREF_THIS();
|
|
return NS_OK;
|
|
}
|
|
*aInstancePtr = 0;
|
|
return NS_NOINTERFACE;
|
|
}
|
|
|
|
ConsoleOutput console;
|
|
|
|
class TestTransaction : public nsITransaction
|
|
{
|
|
public:
|
|
|
|
TestTransaction() : mRefCnt(0) {}
|
|
virtual ~TestTransaction() {}
|
|
|
|
NS_DECL_ISUPPORTS
|
|
};
|
|
|
|
NS_IMPL_ADDREF(TestTransaction)
|
|
NS_IMPL_RELEASE(TestTransaction)
|
|
|
|
nsresult
|
|
TestTransaction::QueryInterface(REFNSIID aIID, void** aInstancePtr)
|
|
{
|
|
if (NULL == aInstancePtr) {
|
|
return NS_ERROR_NULL_POINTER;
|
|
}
|
|
if (aIID.Equals(kISupportsIID)) {
|
|
*aInstancePtr = (void*)(nsISupports*)this;
|
|
NS_ADDREF_THIS();
|
|
return NS_OK;
|
|
}
|
|
if (aIID.Equals(kITransactionIID)) {
|
|
*aInstancePtr = (void*)(nsITransaction*)this;
|
|
NS_ADDREF_THIS();
|
|
return NS_OK;
|
|
}
|
|
*aInstancePtr = 0;
|
|
return NS_NOINTERFACE;
|
|
}
|
|
|
|
class SimpleTransaction : public TestTransaction
|
|
{
|
|
public:
|
|
|
|
#define NONE_FLAG 0
|
|
#define THROWS_DO_ERROR_FLAG 1
|
|
#define THROWS_UNDO_ERROR_FLAG 2
|
|
#define THROWS_REDO_ERROR_FLAG 4
|
|
#define MERGE_FLAG 8
|
|
#define TRANSIENT_FLAG 16
|
|
#define BATCH_FLAG 32
|
|
#define ALL_ERROR_FLAGS (THROWS_DO_ERROR_FLAG|THROWS_UNDO_ERROR_FLAG|THROWS_REDO_ERROR_FLAG)
|
|
|
|
PRInt32 mVal;
|
|
PRInt32 mFlags;
|
|
|
|
SimpleTransaction(PRInt32 aFlags=NONE_FLAG)
|
|
: mVal(++sConstructorCount), mFlags(aFlags)
|
|
{}
|
|
|
|
virtual ~SimpleTransaction()
|
|
{
|
|
//
|
|
// Make sure transactions are being destroyed in the order we expect!
|
|
// Notice that we don't check to see if we go past the end of the array.
|
|
// This is done on purpose since we want to crash if the order array is out
|
|
// of date.
|
|
//
|
|
if (sDestructorOrderArr && mVal != sDestructorOrderArr[sDestructorCount]) {
|
|
printf("ERROR: ~SimpleTransaction expected %d got %d.\n",
|
|
mVal, sDestructorOrderArr[sDestructorCount]);
|
|
exit(NS_ERROR_FAILURE);
|
|
}
|
|
|
|
++sDestructorCount;
|
|
|
|
#ifdef ENABLE_DEBUG_PRINTFS
|
|
printf("\n~SimpleTransaction: %d - 0x%.8x\n", mVal, (PRInt32)this);
|
|
#endif // ENABLE_DEBUG_PRINTFS
|
|
|
|
mVal = -1;
|
|
}
|
|
|
|
NS_IMETHOD Do()
|
|
{
|
|
//
|
|
// Make sure Do() is called in the order we expect!
|
|
// Notice that we don't check to see if we go past the end of the array.
|
|
// This is done on purpose since we want to crash if the order array is out
|
|
// of date.
|
|
//
|
|
if (sDoOrderArr && mVal != sDoOrderArr[sDoCount]) {
|
|
printf("ERROR: ~SimpleTransaction expected %d got %d.\n",
|
|
mVal, sDoOrderArr[sDoCount]);
|
|
exit(NS_ERROR_FAILURE);
|
|
}
|
|
|
|
++sDoCount;
|
|
|
|
#ifdef ENABLE_DEBUG_PRINTFS
|
|
printf("\nSimpleTransaction.Do: %d - 0x%.8x\n", mVal, (PRInt32)this);
|
|
#endif // ENABLE_DEBUG_PRINTFS
|
|
|
|
return (mFlags & THROWS_DO_ERROR_FLAG) ? NS_ERROR_FAILURE : NS_OK;
|
|
}
|
|
|
|
NS_IMETHOD Undo()
|
|
{
|
|
//
|
|
// Make sure Undo() is called in the order we expect!
|
|
// Notice that we don't check to see if we go past the end of the array.
|
|
// This is done on purpose since we want to crash if the order array is out
|
|
// of date.
|
|
//
|
|
if (sUndoOrderArr && mVal != sUndoOrderArr[sUndoCount]) {
|
|
printf("ERROR: ~SimpleTransaction expected %d got %d.\n",
|
|
mVal, sUndoOrderArr[sUndoCount]);
|
|
exit(NS_ERROR_FAILURE);
|
|
}
|
|
|
|
++sUndoCount;
|
|
|
|
#ifdef ENABLE_DEBUG_PRINTFS
|
|
printf("\nSimpleTransaction.Undo: %d - 0x%.8x\n", mVal, (PRInt32)this);
|
|
#endif // ENABLE_DEBUG_PRINTFS
|
|
|
|
return (mFlags & THROWS_UNDO_ERROR_FLAG) ? NS_ERROR_FAILURE : NS_OK;
|
|
}
|
|
|
|
NS_IMETHOD Redo()
|
|
{
|
|
//
|
|
// Make sure Redo() is called in the order we expect!
|
|
// Notice that we don't check to see if we go past the end of the array.
|
|
// This is done on purpose since we want to crash if the order array is out
|
|
// of date.
|
|
//
|
|
if (sRedoOrderArr && mVal != sRedoOrderArr[sRedoCount]) {
|
|
printf("ERROR: ~SimpleTransaction expected %d got %d.\n",
|
|
mVal, sRedoOrderArr[sRedoCount]);
|
|
exit(NS_ERROR_FAILURE);
|
|
}
|
|
|
|
++sRedoCount;
|
|
|
|
#ifdef ENABLE_DEBUG_PRINTFS
|
|
printf("\nSimpleTransaction.Redo: %d - 0x%.8x\n", mVal, (PRInt32)this);
|
|
#endif // ENABLE_DEBUG_PRINTFS
|
|
|
|
return (mFlags & THROWS_REDO_ERROR_FLAG) ? NS_ERROR_FAILURE : NS_OK;
|
|
}
|
|
|
|
NS_IMETHOD GetIsTransient(PRBool *aIsTransient)
|
|
{
|
|
if (aIsTransient)
|
|
*aIsTransient = (mFlags & TRANSIENT_FLAG) ? PR_TRUE : PR_FALSE;
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
NS_IMETHOD Merge(PRBool *aDidMerge, nsITransaction *aTransaction)
|
|
{
|
|
if (aDidMerge)
|
|
*aDidMerge = (mFlags & MERGE_FLAG) ? PR_TRUE : PR_FALSE;
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
NS_IMETHOD Write(nsIOutputStream *aOutputStream)
|
|
{
|
|
char buf[256];
|
|
PRUint32 amt;
|
|
|
|
sprintf(buf, "Transaction: %d - 0x%.8x\n", mVal, (PRInt32)this);
|
|
return aOutputStream->Write(buf, strlen(buf), &amt);
|
|
}
|
|
|
|
NS_IMETHOD GetUndoString(nsString *aString)
|
|
{
|
|
if (aString)
|
|
*aString = "";
|
|
return NS_OK;
|
|
}
|
|
|
|
NS_IMETHOD GetRedoString(nsString *aString)
|
|
{
|
|
if (aString)
|
|
*aString = "";
|
|
return NS_OK;
|
|
}
|
|
|
|
};
|
|
|
|
class AggregateTransaction : public SimpleTransaction
|
|
{
|
|
private:
|
|
|
|
AggregateTransaction(nsITransactionManager *aTXMgr, PRInt32 aLevel,
|
|
PRInt32 aNumber, PRInt32 aMaxLevel,
|
|
PRInt32 aNumChildrenPerNode,
|
|
PRInt32 aFlags)
|
|
{
|
|
mLevel = aLevel;
|
|
mNumber = aNumber;
|
|
mTXMgr = aTXMgr;
|
|
mFlags = aFlags & (~ALL_ERROR_FLAGS);
|
|
mErrorFlags = aFlags & ALL_ERROR_FLAGS;
|
|
mTXMgr = aTXMgr;
|
|
mMaxLevel = aMaxLevel;
|
|
mNumChildrenPerNode = aNumChildrenPerNode;
|
|
}
|
|
|
|
|
|
public:
|
|
nsITransactionManager *mTXMgr;
|
|
|
|
PRInt32 mLevel;
|
|
PRInt32 mNumber;
|
|
PRInt32 mErrorFlags;
|
|
|
|
PRInt32 mMaxLevel;
|
|
PRInt32 mNumChildrenPerNode;
|
|
|
|
AggregateTransaction(nsITransactionManager *aTXMgr,
|
|
PRInt32 aMaxLevel, PRInt32 aNumChildrenPerNode,
|
|
PRInt32 aFlags=NONE_FLAG)
|
|
{
|
|
mLevel = 1;
|
|
mNumber = 1;
|
|
mFlags = aFlags & (~ALL_ERROR_FLAGS);
|
|
mErrorFlags = aFlags & ALL_ERROR_FLAGS;
|
|
mTXMgr = aTXMgr;
|
|
mMaxLevel = aMaxLevel;
|
|
mNumChildrenPerNode = aNumChildrenPerNode;
|
|
}
|
|
|
|
virtual ~AggregateTransaction()
|
|
{
|
|
// printf("~AggregateTransaction(0x%.8x) - %3d (%3d)\n", this, mLevel, mVal);
|
|
}
|
|
|
|
NS_IMETHOD Do()
|
|
{
|
|
if (mLevel >= mMaxLevel) {
|
|
// Only leaf nodes can throw errors!
|
|
mFlags |= mErrorFlags;
|
|
}
|
|
|
|
nsresult result = SimpleTransaction::Do();
|
|
|
|
if (NS_FAILED(result)) {
|
|
// printf("ERROR: QueryInterface() failed for transaction level %d. (%d)\n",
|
|
// mLevel, result);
|
|
return result;
|
|
}
|
|
|
|
if (mLevel >= mMaxLevel)
|
|
return NS_OK;
|
|
|
|
if (mFlags & BATCH_FLAG) {
|
|
result = mTXMgr->BeginBatch();
|
|
if (NS_FAILED(result)) {
|
|
return result;
|
|
}
|
|
}
|
|
|
|
PRInt32 cLevel = mLevel + 1;
|
|
|
|
for (int i = 1; i <= mNumChildrenPerNode; i++) {
|
|
PRInt32 flags = mErrorFlags & THROWS_DO_ERROR_FLAG;
|
|
|
|
if ((mErrorFlags & THROWS_REDO_ERROR_FLAG) && i == mNumChildrenPerNode) {
|
|
// Make the rightmost leaf transaction throw the error!
|
|
flags = THROWS_REDO_ERROR_FLAG;
|
|
mErrorFlags = mErrorFlags & (~THROWS_REDO_ERROR_FLAG);
|
|
}
|
|
else if ((mErrorFlags & THROWS_UNDO_ERROR_FLAG)
|
|
&& i == 1) {
|
|
// Make the leftmost leaf transaction throw the error!
|
|
flags = THROWS_UNDO_ERROR_FLAG;
|
|
mErrorFlags = mErrorFlags & (~THROWS_UNDO_ERROR_FLAG);
|
|
}
|
|
|
|
flags |= mFlags & BATCH_FLAG;
|
|
|
|
AggregateTransaction *tximpl =
|
|
new AggregateTransaction(mTXMgr, cLevel, i, mMaxLevel,
|
|
mNumChildrenPerNode, flags);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate AggregateTransaction %d, level %d. (%d)\n",
|
|
i, mLevel, result);
|
|
|
|
if (mFlags & BATCH_FLAG)
|
|
mTXMgr->EndBatch();
|
|
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
nsITransaction *tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d, level %d. (%d)\n",
|
|
i, mLevel, result);
|
|
|
|
if (mFlags & BATCH_FLAG)
|
|
mTXMgr->EndBatch();
|
|
|
|
return result;
|
|
}
|
|
|
|
result = mTXMgr->Do(tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
// printf("ERROR: Failed to execute transaction %d, level %d. (%d)\n",
|
|
// i, mLevel, result);
|
|
tx->Release();
|
|
|
|
if (mFlags & BATCH_FLAG)
|
|
mTXMgr->EndBatch();
|
|
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
}
|
|
|
|
if (mFlags & BATCH_FLAG)
|
|
mTXMgr->EndBatch();
|
|
|
|
return result;
|
|
}
|
|
};
|
|
|
|
class TestTransactionFactory
|
|
{
|
|
public:
|
|
virtual TestTransaction *create(nsITransactionManager *txmgr, PRInt32 flags) = 0;
|
|
};
|
|
|
|
class SimpleTransactionFactory : public TestTransactionFactory
|
|
{
|
|
public:
|
|
|
|
TestTransaction *create(nsITransactionManager *txmgr, PRInt32 flags)
|
|
{
|
|
return (TestTransaction *)new SimpleTransaction(flags);
|
|
}
|
|
};
|
|
|
|
class AggregateTransactionFactory : public TestTransactionFactory
|
|
{
|
|
public:
|
|
|
|
PRInt32 mMaxLevel;
|
|
PRInt32 mNumChildrenPerNode;
|
|
PRInt32 mFixedFlags;
|
|
|
|
AggregateTransactionFactory(PRInt32 aMaxLevel, PRInt32 aNumChildrenPerNode,
|
|
PRInt32 aFixedFlags=NONE_FLAG)
|
|
: mMaxLevel(aMaxLevel), mNumChildrenPerNode(aNumChildrenPerNode),
|
|
mFixedFlags(aFixedFlags)
|
|
{
|
|
}
|
|
|
|
virtual TestTransaction *create(nsITransactionManager *txmgr, PRInt32 flags)
|
|
{
|
|
return (TestTransaction *)new AggregateTransaction(txmgr, mMaxLevel,
|
|
mNumChildrenPerNode,
|
|
flags | mFixedFlags);
|
|
}
|
|
};
|
|
|
|
void
|
|
reset_globals()
|
|
{
|
|
sConstructorCount = 0;
|
|
|
|
sDestructorCount = 0;
|
|
sDestructorOrderArr = 0;
|
|
|
|
sDoCount = 0;
|
|
sDoOrderArr = 0;
|
|
|
|
sUndoCount = 0;
|
|
sUndoOrderArr = 0;
|
|
|
|
sRedoCount = 0;
|
|
sRedoOrderArr = 0;
|
|
}
|
|
|
|
nsresult
|
|
quick_test(TestTransactionFactory *factory)
|
|
{
|
|
/*******************************************************************
|
|
*
|
|
* Create a transaction manager implementation:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Create transaction manager instance ... ");
|
|
|
|
PRInt32 i, numitems = 0;
|
|
nsITransactionManager *mgr = 0;
|
|
nsITransaction *tx = 0;
|
|
TestTransaction *tximpl = 0;
|
|
nsITransaction *u1 = 0, *u2 = 0;
|
|
nsITransaction *r1 = 0, *r2 = 0;
|
|
nsresult result;
|
|
|
|
result = nsComponentManager::CreateInstance(kCTransactionManagerCID, nsnull,
|
|
kITransactionManagerIID, (void **)&mgr);
|
|
|
|
if (NS_FAILED(result) || !mgr) {
|
|
printf("ERROR: Failed to create Transaction Manager instance.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call Do() with a null transaction:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call Do() with null transaction ... ");
|
|
result = mgr->Do(0);
|
|
|
|
if (NS_FAILED(result)
|
|
&& result != NS_ERROR_NULL_POINTER) {
|
|
printf("ERROR: Do() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call Undo() with an empty undo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call Undo() with empty undo stack ... ");
|
|
result = mgr->Undo();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Undo on empty undo stack failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call Redo() with an empty redo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call Redo() with empty redo stack ... ");
|
|
result = mgr->Redo();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Redo on empty redo stack failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call SetMaxTransactionCount(-1) with empty undo and redo stacks:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call SetMaxTransactionCount(-1) with empty undo and redo stacks ... ");
|
|
result = mgr->SetMaxTransactionCount(-1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransactionCount(-1) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call SetMaxTransactionCount(0) with empty undo and redo stacks:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call SetMaxTransactionCount(0) with empty undo and redo stacks ... ");
|
|
result = mgr->SetMaxTransactionCount(0);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransactionCount(0) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call SetMaxTransactionCount(10) with empty undo and redo stacks:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call SetMaxTransactionCount(10) with empty undo and redo stacks ... ");
|
|
result = mgr->SetMaxTransactionCount(10);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransactionCount(10) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call Clear() with empty undo and redo stacks:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call Clear() with empty undo and redo stack ... ");
|
|
result = mgr->Clear();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Clear on empty undo and redo stack failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call GetNumberOfUndoItems() with an empty undo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
numitems = 0;
|
|
|
|
printf("Call GetNumberOfUndoItems() with empty undo stack ... ");
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call GetNumberOfRedoItems() with an empty redo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call GetNumberOfRedoItems() with empty redo stack ... ");
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call PeekUndoStack() with an empty undo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call PeekUndoStack() with empty undo stack ... ");
|
|
|
|
tx = 0;
|
|
result = mgr->PeekUndoStack(&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: PeekUndoStack() on empty undo stack failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (tx != 0) {
|
|
printf("ERROR: PeekUndoStack() on empty undo stack failed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call PeekRedoStack() with an empty undo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call PeekRedoStack() with empty undo stack ... ");
|
|
|
|
tx = 0;
|
|
result = mgr->PeekRedoStack(&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: PeekRedoStack() on empty redo stack failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (tx != 0) {
|
|
printf("ERROR: PeekRedoStack() on empty redo stack failed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call Write() with a null output stream:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call Write() with null output stream ... ");
|
|
|
|
result = mgr->Write(0);
|
|
|
|
if (NS_FAILED(result)
|
|
&& result != NS_ERROR_NULL_POINTER) {
|
|
printf("ERROR: Write() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call AddListener() with a null listener pointer:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call AddListener() with null listener ... ");
|
|
|
|
result = mgr->AddListener(0);
|
|
|
|
if (NS_FAILED(result)
|
|
&& result != NS_ERROR_NULL_POINTER) {
|
|
printf("ERROR: AddListener() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call RemoveListener() with a null listener pointer:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call RemoveListener() with null listener ... ");
|
|
|
|
result = mgr->RemoveListener(0);
|
|
|
|
if (NS_FAILED(result)
|
|
&& result != NS_ERROR_NULL_POINTER) {
|
|
printf("ERROR: RemoveListener() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Test coalescing by executing a transaction that can merge any
|
|
* command into itself. Then execute 20 transaction. Afterwards,
|
|
* we should still have the first transaction sitting on the undo
|
|
* stack.
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test coalescing of transactions ... ");
|
|
|
|
result = mgr->SetMaxTransactionCount(10);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransactionCount(0) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
|
|
tximpl = factory->create(mgr, MERGE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate initial transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for initial transaction. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute initial transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != tx) {
|
|
printf("ERROR: Top of undo stack is different!. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
for (i = 1; i <= 20; i++) {
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
}
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != u2) {
|
|
printf("ERROR: Top of undo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->Clear();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Clear() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Execute 20 transactions. Afterwards, we should have 10
|
|
* transactions on the undo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Execute 20 transactions ... ");
|
|
|
|
for (i = 1; i <= 20; i++) {
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 10) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Execute 20 transient transactions. Afterwards, we should still
|
|
* have the same 10 transactions on the undo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Execute 20 transient transactions ... ");
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
for (i = 1; i <= 20; i++) {
|
|
tximpl = factory->create(mgr, TRANSIENT_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
}
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != u2) {
|
|
printf("ERROR: Top of undo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 10) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Undo 4 transactions. Afterwards, we should have 6 transactions
|
|
* on the undo stack, and 4 on the redo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Undo 4 transactions ... ");
|
|
|
|
for (i = 1; i <= 4; i++) {
|
|
result = mgr->Undo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 6 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 6) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 6 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 4) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 4 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Redo 2 transactions. Afterwards, we should have 8 transactions
|
|
* on the undo stack, and 2 on the redo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Redo 2 transactions ... ");
|
|
|
|
for (i = 1; i <= 2; ++i) {
|
|
result = mgr->Redo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to redo transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 8 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 8) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 8 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 2 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 2) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 2 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Execute a new transaction. The redo stack should get pruned!
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Check if new transactions prune the redo stack ... ");
|
|
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 9 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 9) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 9 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 0 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Undo 4 transactions then clear the undo and redo stacks.
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Undo 4 transactions then clear the undo and redo stacks ... ");
|
|
|
|
for (i = 1; i <= 4; ++i) {
|
|
result = mgr->Undo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 5 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 5) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 5 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 4 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 4) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 4 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->Clear();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Clear() failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on cleared undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty cleared stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Execute 5 transactions.
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Execute 5 transactions ... ");
|
|
|
|
for (i = 1; i <= 5; i++) {
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 5 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 5) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 5 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Test transaction Do() error:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test transaction Do() error ... ");
|
|
|
|
tximpl = factory->create(mgr, THROWS_DO_ERROR_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
|
|
if (NS_FAILED(result) && result != NS_ERROR_FAILURE) {
|
|
printf("ERROR: Do() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != u2) {
|
|
printf("ERROR: Top of undo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 5 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 5) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 5 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Test transaction Undo() error:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test transaction Undo() error ... ");
|
|
|
|
tximpl = factory->create(mgr, THROWS_UNDO_ERROR_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Do() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Undo();
|
|
|
|
if (NS_FAILED(result) && result != NS_ERROR_FAILURE) {
|
|
printf("ERROR: Undo() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != u2) {
|
|
printf("ERROR: Top of undo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 6 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 6) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 6 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Test transaction Redo() error:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test transaction Redo() error ... ");
|
|
|
|
tximpl = factory->create(mgr, THROWS_REDO_ERROR_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for RedoErrorTransaction. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Do() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
//
|
|
// Execute a normal transaction to be used in a later test:
|
|
//
|
|
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Do() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
//
|
|
// Undo the 2 transactions just executed.
|
|
//
|
|
|
|
for (i = 1; i <= 2; ++i) {
|
|
result = mgr->Undo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
//
|
|
// The RedoErrorTransaction should now be at the top of the redo stack!
|
|
//
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Redo();
|
|
|
|
if (NS_FAILED(result) && result != NS_ERROR_FAILURE) {
|
|
printf("ERROR: Redo() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != u2) {
|
|
printf("ERROR: Top of undo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 6 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 6) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 6 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 2) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 2 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Make sure that setting the transaction manager's max transaction
|
|
* count to zero, clears both the undo and redo stacks, and executes
|
|
* all new commands without pushing them on the undo stack!
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test max transaction count of zero ... ");
|
|
|
|
result = mgr->SetMaxTransactionCount(0);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransactionCount(0) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
for (i = 1; i <= 20; i++) {
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Make sure that setting the transaction manager's max transaction
|
|
* count to something greater than the number of transactions on
|
|
* both the undo and redo stacks causes no pruning of the stacks:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test SetMaxTransactionCount() greater than num stack items ... ");
|
|
|
|
result = mgr->SetMaxTransactionCount(-1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransactionCount(0) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
// Push 20 transactions on the undo stack:
|
|
|
|
for (i = 1; i <= 20; i++) {
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != i) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
}
|
|
|
|
for (i = 1; i <= 10; i++) {
|
|
|
|
result = mgr->Undo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
}
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 10) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 10) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->SetMaxTransactionCount(25);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransacitonCount(25) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != u2) {
|
|
printf("ERROR: Top of undo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 10) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 10) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Test undo stack pruning by setting the transaction
|
|
* manager's max transaction count to a number lower than the
|
|
* number of transactions on both the undo and redo stacks:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test SetMaxTransactionCount() pruning undo stack ... ");
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->SetMaxTransactionCount(15);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransacitonCount(25) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != u2) {
|
|
printf("ERROR: Top of undo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 5) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 10) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Test redo stack pruning by setting the transaction
|
|
* manager's max transaction count to a number lower than the
|
|
* number of transactions on both the undo and redo stacks:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test SetMaxTransactionCount() pruning redo stack ... ");
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->SetMaxTransactionCount(5);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransacitonCount(25) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 == u2 || u2) {
|
|
printf("ERROR: Unexpected item at top of undo stack. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 5 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 5) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 5 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Release the transaction manager. Any transactions on the undo
|
|
* and redo stack should automatically be released:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Release the transaction manager ... ");
|
|
|
|
result = mgr->SetMaxTransactionCount(-1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransactionCount(0) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
// Push 20 transactions on the undo stack:
|
|
|
|
for (i = 1; i <= 20; i++) {
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != i) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
}
|
|
|
|
for (i = 1; i <= 10; i++) {
|
|
|
|
result = mgr->Undo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
}
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 10) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 10) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->Release();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: nsITransactionManager Release() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Make sure number of transactions created matches number of
|
|
* transactions destroyed!
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Number of transactions created and destroyed match ... ");
|
|
|
|
if (sConstructorCount != sDestructorCount) {
|
|
printf("ERROR: Transaction constructor count (%d) != destructor count (%d).\n",
|
|
sConstructorCount, sDestructorCount);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: nsITransactionManager Release() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
printf("%d transactions processed during quick test.\n", sConstructorCount);
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
nsresult
|
|
simple_test()
|
|
{
|
|
/*******************************************************************
|
|
*
|
|
* Initialize globals for test.
|
|
*
|
|
*******************************************************************/
|
|
reset_globals();
|
|
sDestructorOrderArr = sSimpleTestDestructorOrderArr;
|
|
sDoOrderArr = sSimpleTestDoOrderArr;
|
|
sUndoOrderArr = sSimpleTestUndoOrderArr;
|
|
sRedoOrderArr = sSimpleTestRedoOrderArr;
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Run the quick test.
|
|
*
|
|
*******************************************************************/
|
|
|
|
SimpleTransactionFactory factory;
|
|
|
|
printf("\n-----------------------------------------------------\n");
|
|
printf("- Begin Simple Transaction Test:\n");
|
|
printf("-----------------------------------------------------\n");
|
|
|
|
return quick_test(&factory);
|
|
}
|
|
|
|
nsresult
|
|
aggregation_test()
|
|
{
|
|
/*******************************************************************
|
|
*
|
|
* Initialize globals for test.
|
|
*
|
|
*******************************************************************/
|
|
|
|
reset_globals();
|
|
sDestructorOrderArr = sAggregateTestDestructorOrderArr;
|
|
sDoOrderArr = sAggregateTestDoOrderArr;
|
|
sUndoOrderArr = sAggregateTestUndoOrderArr;
|
|
sRedoOrderArr = sAggregateTestRedoOrderArr;
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Run the quick test.
|
|
*
|
|
*******************************************************************/
|
|
|
|
AggregateTransactionFactory factory(3,2);
|
|
|
|
printf("\n-----------------------------------------------------\n");
|
|
printf("- Begin Aggregate Transaction Test:\n");
|
|
printf("-----------------------------------------------------\n");
|
|
|
|
return quick_test(&factory);
|
|
}
|
|
|
|
nsresult
|
|
quick_batch_test(TestTransactionFactory *factory)
|
|
{
|
|
/*******************************************************************
|
|
*
|
|
* Create a transaction manager implementation:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Create transaction manager instance ... ");
|
|
|
|
PRInt32 i, numitems = 0;
|
|
nsITransactionManager *mgr = 0;
|
|
nsITransaction *tx = 0;
|
|
TestTransaction *tximpl = 0;
|
|
nsITransaction *u1 = 0, *u2 = 0;
|
|
nsITransaction *r1 = 0, *r2 = 0;
|
|
nsresult result;
|
|
|
|
result = nsComponentManager::CreateInstance(kCTransactionManagerCID, nsnull,
|
|
kITransactionManagerIID, (void **)&mgr);
|
|
|
|
if (NS_FAILED(result) || !mgr) {
|
|
printf("ERROR: Failed to create Transaction Manager instance.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Make sure an unbalanced call to EndBatch() with empty undo stack
|
|
* throws an error!
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test unbalanced EndBatch() with empty undo stack ... ");
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (result != NS_ERROR_FAILURE) {
|
|
printf("ERROR: EndBatch() returned unexpected status. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Make sure that an empty batch is not added to the undo stack
|
|
* when it is closed.
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test empty batch ... ");
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Execute 20 transactions. Afterwards, we should have 1
|
|
* transaction on the undo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Execute 20 batched transactions ... ");
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
for (i = 1; i <= 20; i++) {
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Execute 20 transient transactions. Afterwards, we should still
|
|
* have the same transaction on the undo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Execute 20 batched transient transactions ... ");
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
for (i = 1; i <= 20; i++) {
|
|
tximpl = factory->create(mgr, TRANSIENT_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
}
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != u2) {
|
|
printf("ERROR: Top of undo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Test nested batching. Afterwards, we should have 2 transactions
|
|
* on the undo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test nested batched transactions ... ");
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 2 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 2) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Undo 2 batch transactions. Afterwards, we should have 0
|
|
* transactions on the undo stack and 2 on the redo stack.
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Undo 2 batch transactions ... ");
|
|
|
|
for (i = 1; i <= 2; ++i) {
|
|
result = mgr->Undo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 2 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 2) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 2 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Redo 2 batch transactions. Afterwards, we should have 2
|
|
* transactions on the undo stack and 0 on the redo stack.
|
|
*
|
|
*******************************************************************/
|
|
|
|
|
|
printf("Redo 2 batch transactions ... ");
|
|
|
|
for (i = 1; i <= 2; ++i) {
|
|
result = mgr->Redo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 2 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 2) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 2 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 2 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call undo. Afterwards, we should have 1 transaction
|
|
* on the undo stack, and 1 on the redo stack:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Undo a batched transaction that was redone ... ");
|
|
|
|
result = mgr->Undo();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Make sure an unbalanced call to EndBatch() throws an error and
|
|
* doesn't affect the undo and redo stacks!
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test effect of unbalanced EndBatch() on undo and redo stacks ... ");
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (result != NS_ERROR_FAILURE) {
|
|
printf("ERROR: EndBatch() returned unexpected status. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Make sure that an empty batch is not added to the undo stack
|
|
* when it is closed, and that it does not affect the undo and redo
|
|
* stacks.
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test effect of empty batch on undo and redo stacks ... ");
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
|
|
printf("passed\n");
|
|
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Execute a new transaction. The redo stack should get pruned!
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Check if new batched transactions prune the redo stack ... ");
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
for (i = 1; i <= 20; i++) {
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 1 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 2 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 2) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 2 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Call undo.
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Call undo ... ");
|
|
|
|
// Move a transaction over to the redo stack, so that we have one
|
|
// transaction on the undo stack, and one on the redo stack!
|
|
|
|
result = mgr->Undo();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 1 item failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 1 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Test transaction Do() error:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test transaction Do() error ... ");
|
|
|
|
|
|
tximpl = factory->create(mgr, THROWS_DO_ERROR_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
|
|
if (NS_FAILED(result) && result != NS_ERROR_FAILURE) {
|
|
printf("ERROR: Do() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != u2) {
|
|
printf("ERROR: Top of undo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 5 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 5 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 1) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Test transaction Undo() error:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test transaction Undo() error ... ");
|
|
|
|
tximpl = factory->create(mgr, THROWS_UNDO_ERROR_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Do() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Undo();
|
|
|
|
if (NS_FAILED(result) && result != NS_ERROR_FAILURE) {
|
|
printf("ERROR: Undo() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != u2) {
|
|
printf("ERROR: Top of undo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 2 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 2) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 2 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Test transaction Redo() error:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test transaction Redo() error ... ");
|
|
|
|
tximpl = factory->create(mgr, THROWS_REDO_ERROR_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for RedoErrorTransaction. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Do() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
//
|
|
// Execute a normal transaction to be used in a later test:
|
|
//
|
|
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Do() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
//
|
|
// Undo the 2 transactions just executed.
|
|
//
|
|
|
|
for (i = 1; i <= 2; ++i) {
|
|
result = mgr->Undo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
//
|
|
// The RedoErrorTransaction should now be at the top of the redo stack!
|
|
//
|
|
|
|
u1 = u2 = r1 = r2 = 0;
|
|
|
|
result = mgr->PeekUndoStack(&u1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Initial PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Redo();
|
|
|
|
if (NS_FAILED(result) && result != NS_ERROR_FAILURE) {
|
|
printf("ERROR: Redo() returned unexpected error. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->PeekUndoStack(&u2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekUndoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (u1 != u2) {
|
|
printf("ERROR: Top of undo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->PeekRedoStack(&r2);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Second PeekRedoStack() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
if (r1 != r2) {
|
|
printf("ERROR: Top of redo stack changed. (%d)\n", result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on undo stack with 2 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 2) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 2 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 2) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 2 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Make sure that setting the transaction manager's max transaction
|
|
* count to zero, clears both the undo and redo stacks, and executes
|
|
* all new commands without pushing them on the undo stack!
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Test max transaction count of zero ... ");
|
|
|
|
result = mgr->SetMaxTransactionCount(0);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransactionCount(0) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
for (i = 1; i <= 20; i++) {
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Release the transaction manager. Any transactions on the undo
|
|
* and redo stack should automatically be released:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Release the transaction manager ... ");
|
|
|
|
result = mgr->SetMaxTransactionCount(-1);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: SetMaxTransactionCount(0) failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
// Push 20 transactions on the undo stack:
|
|
|
|
for (i = 1; i <= 20; i++) {
|
|
tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", i);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->BeginBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: BeginBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
|
|
result = mgr->EndBatch();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: EndBatch() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != i) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 1 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on empty redo stack failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 0) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 0 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
}
|
|
|
|
for (i = 1; i <= 10; i++) {
|
|
|
|
result = mgr->Undo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
}
|
|
result = mgr->GetNumberOfUndoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfUndoItems() on empty undo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 10) {
|
|
printf("ERROR: GetNumberOfUndoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->GetNumberOfRedoItems(&numitems);
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: GetNumberOfRedoItems() on redo stack with 10 items failed. (%d)\n",
|
|
result);
|
|
return result;
|
|
}
|
|
|
|
if (numitems != 10) {
|
|
printf("ERROR: GetNumberOfRedoItems() expected 10 got %d. (%d)\n",
|
|
numitems, result);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
result = mgr->Release();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: nsITransactionManager Release() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Make sure number of transactions created matches number of
|
|
* transactions destroyed!
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Number of transactions created and destroyed match ... ");
|
|
|
|
if (sConstructorCount != sDestructorCount) {
|
|
printf("ERROR: Transaction constructor count (%d) != destructor count (%d).\n",
|
|
sConstructorCount, sDestructorCount);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: nsITransactionManager Release() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
printf("passed\n");
|
|
printf("%d transactions processed during quick batch test.\n",
|
|
sConstructorCount);
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
nsresult
|
|
simple_batch_test()
|
|
{
|
|
/*******************************************************************
|
|
*
|
|
* Initialize globals for test.
|
|
*
|
|
*******************************************************************/
|
|
reset_globals();
|
|
sDestructorOrderArr = sSimpleBatchTestDestructorOrderArr;
|
|
sDoOrderArr = sSimpleBatchTestDoOrderArr;
|
|
sUndoOrderArr = sSimpleBatchTestUndoOrderArr;
|
|
sRedoOrderArr = sSimpleBatchTestRedoOrderArr;
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Run the quick batch test.
|
|
*
|
|
*******************************************************************/
|
|
|
|
SimpleTransactionFactory factory;
|
|
|
|
printf("\n-----------------------------------------------------\n");
|
|
printf("- Begin Batch Transaction Test:\n");
|
|
printf("-----------------------------------------------------\n");
|
|
|
|
return quick_batch_test(&factory);
|
|
}
|
|
|
|
nsresult
|
|
aggregation_batch_test()
|
|
{
|
|
/*******************************************************************
|
|
*
|
|
* Initialize globals for test.
|
|
*
|
|
*******************************************************************/
|
|
|
|
reset_globals();
|
|
sDestructorOrderArr = sAggregateBatchTestDestructorOrderArr;
|
|
sDoOrderArr = sAggregateBatchTestDoOrderArr;
|
|
sUndoOrderArr = sAggregateBatchTestUndoOrderArr;
|
|
sRedoOrderArr = sAggregateBatchTestRedoOrderArr;
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Run the quick batch test.
|
|
*
|
|
*******************************************************************/
|
|
|
|
AggregateTransactionFactory factory(3,2,BATCH_FLAG);
|
|
|
|
printf("\n-----------------------------------------------------\n");
|
|
printf("- Begin Batch Aggregate Transaction Test:\n");
|
|
printf("-----------------------------------------------------\n");
|
|
|
|
return quick_batch_test(&factory);
|
|
}
|
|
|
|
nsresult
|
|
stress_test(TestTransactionFactory *factory, PRInt32 iterations)
|
|
{
|
|
/*******************************************************************
|
|
*
|
|
* Create a transaction manager:
|
|
*
|
|
*******************************************************************/
|
|
|
|
printf("Stress test (may take a while) ... ");
|
|
fflush(stdout);
|
|
|
|
PRInt32 i, j;
|
|
nsITransactionManager *mgr = 0;
|
|
nsITransaction *tx = 0;
|
|
nsresult result;
|
|
|
|
result = nsComponentManager::CreateInstance(kCTransactionManagerCID, nsnull,
|
|
kITransactionManagerIID, (void **)&mgr);
|
|
|
|
if (NS_FAILED(result) || !mgr) {
|
|
printf("ERROR: Failed to create Transaction Manager instance.\n");
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
for (i = 1; i <= iterations; i++) {
|
|
/*******************************************************************
|
|
*
|
|
* Execute a bunch of transactions:
|
|
*
|
|
*******************************************************************/
|
|
|
|
for (j = 1; j <= i; j++) {
|
|
TestTransaction *tximpl = factory->create(mgr, NONE_FLAG);
|
|
|
|
if (!tximpl) {
|
|
printf("ERROR: Failed to allocate transaction %d.\n", j);
|
|
return NS_ERROR_OUT_OF_MEMORY;
|
|
}
|
|
|
|
tx = 0;
|
|
result = tximpl->QueryInterface(kITransactionIID, (void **)&tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: QueryInterface() failed for transaction %d. (%d)\n",
|
|
i, result);
|
|
return result;
|
|
}
|
|
|
|
result = mgr->Do(tx);
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to execute transaction %d. (%d)\n", i, result);
|
|
return result;
|
|
}
|
|
|
|
tx->Release();
|
|
}
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Undo all the transactions:
|
|
*
|
|
*******************************************************************/
|
|
|
|
for (j = 1; j <= i; j++) {
|
|
result = mgr->Undo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction %d-%d. (%d)\n", i, j, result);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Redo all the transactions:
|
|
*
|
|
*******************************************************************/
|
|
|
|
for (j = 1; j <= i; j++) {
|
|
result = mgr->Redo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to redo transaction %d-%d. (%d)\n", i, j, result);
|
|
return result;
|
|
}
|
|
}
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Undo all the transactions again so that they all end up on
|
|
* the redo stack for pruning the next time we execute a new
|
|
* transaction
|
|
*
|
|
*******************************************************************/
|
|
|
|
for (j = 1; j <= i; j++) {
|
|
result = mgr->Undo();
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: Failed to undo transaction %d-%d. (%d)\n", i, j, result);
|
|
return result;
|
|
}
|
|
}
|
|
}
|
|
|
|
result = mgr->Release();
|
|
|
|
if (NS_FAILED(result)) {
|
|
printf("ERROR: nsITransactionManager Release() failed. (%d)\n", result);
|
|
return result;
|
|
}
|
|
|
|
// printf("%d %d - ", sConstructorCount, sDestructorCount);
|
|
|
|
if (sConstructorCount != sDestructorCount) {
|
|
printf("ERROR: Transaction constructor count (%d) != destructor count (%d).\n",
|
|
sConstructorCount, sDestructorCount);
|
|
return NS_ERROR_FAILURE;
|
|
}
|
|
|
|
printf("passed\n");
|
|
|
|
printf("%d transactions processed during stress test.\n", sConstructorCount);
|
|
|
|
return NS_OK;
|
|
}
|
|
|
|
nsresult
|
|
simple_stress_test()
|
|
{
|
|
/*******************************************************************
|
|
*
|
|
* Initialize globals for test.
|
|
*
|
|
*******************************************************************/
|
|
|
|
reset_globals();
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Do the stress test:
|
|
*
|
|
*******************************************************************/
|
|
|
|
SimpleTransactionFactory factory;
|
|
|
|
printf("\n-----------------------------------------------------\n");
|
|
printf("- Simple Transaction Stress Test:\n");
|
|
printf("-----------------------------------------------------\n");
|
|
|
|
//
|
|
// 1500 iterations sends 1,125,750 transactions through the system!!
|
|
//
|
|
return stress_test(&factory, 1500);
|
|
}
|
|
|
|
nsresult
|
|
aggregation_stress_test()
|
|
{
|
|
/*******************************************************************
|
|
*
|
|
* Initialize globals for test.
|
|
*
|
|
*******************************************************************/
|
|
|
|
reset_globals();
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Do the stress test:
|
|
*
|
|
*******************************************************************/
|
|
|
|
AggregateTransactionFactory factory(3,4);
|
|
|
|
printf("\n-----------------------------------------------------\n");
|
|
printf("- Aggregate Transaction Stress Test:\n");
|
|
printf("-----------------------------------------------------\n");
|
|
|
|
//
|
|
// 500 iterations sends 2,630,250 transactions through the system!!
|
|
//
|
|
return stress_test(&factory, 500);
|
|
}
|
|
|
|
nsresult
|
|
aggregation_batch_stress_test()
|
|
{
|
|
/*******************************************************************
|
|
*
|
|
* Initialize globals for test.
|
|
*
|
|
*******************************************************************/
|
|
|
|
reset_globals();
|
|
|
|
/*******************************************************************
|
|
*
|
|
* Do the stress test:
|
|
*
|
|
*******************************************************************/
|
|
|
|
AggregateTransactionFactory factory(3,4,BATCH_FLAG);
|
|
|
|
printf("\n-----------------------------------------------------\n");
|
|
printf("- Aggregate Batch Transaction Stress Test:\n");
|
|
printf("-----------------------------------------------------\n");
|
|
|
|
//
|
|
// 500 iterations sends 2,630,250 transactions through the system!!
|
|
//
|
|
return stress_test(&factory, 500);
|
|
}
|
|
|
|
int
|
|
main (int argc, char *argv[])
|
|
{
|
|
nsresult result;
|
|
|
|
nsComponentManager::RegisterComponent(kCTransactionManagerCID, NULL, NULL,
|
|
TRANSACTION_MANAGER_DLL, PR_FALSE, PR_FALSE);
|
|
|
|
result = simple_test();
|
|
|
|
if (NS_FAILED(result))
|
|
return result;
|
|
|
|
result = simple_batch_test();
|
|
|
|
if (NS_FAILED(result))
|
|
return result;
|
|
|
|
result = aggregation_test();
|
|
|
|
if (NS_FAILED(result))
|
|
return result;
|
|
|
|
result = aggregation_batch_test();
|
|
|
|
if (NS_FAILED(result))
|
|
return result;
|
|
|
|
result = simple_stress_test();
|
|
|
|
if (NS_FAILED(result))
|
|
return result;
|
|
|
|
result = aggregation_stress_test();
|
|
|
|
if (NS_FAILED(result))
|
|
return result;
|
|
|
|
result = aggregation_batch_stress_test();
|
|
|
|
if (NS_FAILED(result))
|
|
return result;
|
|
|
|
return NS_OK;
|
|
}
|