Lines Matching refs:order
212 // Test that two tasks with different delays run in the right order.
233 // Test that two tasks with the same delay run in the order in which they
608 // Saves the order in which the tasks executed.
652 // Saves the order the tasks ran.
655 OrderedTasks(TaskList* order, int cookie)
656 : order_(order),
660 OrderedTasks(TaskList* order, TaskType type, int cookie)
661 : order_(order),
683 TaskList* order() const {
704 MessageBoxTask(TaskList* order, int cookie, bool is_reentrant)
705 : OrderedTasks(order, MESSAGEBOX, cookie),
724 EndDialogTask(TaskList* order, int cookie)
725 : OrderedTasks(order, ENDDIALOG, cookie) {
744 RecursiveTask(int depth, TaskList* order, int cookie, bool is_reentrant)
745 : OrderedTasks(order, RECURSIVE, cookie),
756 new RecursiveTask(depth_ - 1, order(), cookie(), is_reentrant_));
768 QuitTask(TaskList* order, int cookie)
769 : OrderedTasks(order, QUITMESSAGELOOP, cookie) {
781 SleepTask(TaskList* order, int cookie, int ms)
782 : OrderedTasks(order, SLEEP, cookie), ms_(ms) {
802 TaskList* order,
807 order_(order),
864 TaskList order;
866 new RecursiveTask(2, &order, 1, false));
868 new RecursiveTask(2, &order, 2, false));
869 MessageLoop::current()->PostTask(FROM_HERE, new QuitTask(&order, 3));
873 // FIFO order.
874 ASSERT_EQ(14U, order.size());
875 EXPECT_EQ(order[ 0], TaskItem(RECURSIVE, 1, true));
876 EXPECT_EQ(order[ 1], TaskItem(RECURSIVE, 1, false));
877 EXPECT_EQ(order[ 2], TaskItem(RECURSIVE, 2, true));
878 EXPECT_EQ(order[ 3], TaskItem(RECURSIVE, 2, false));
879 EXPECT_EQ(order[ 4], TaskItem(QUITMESSAGELOOP, 3, true));
880 EXPECT_EQ(order[ 5], TaskItem(QUITMESSAGELOOP, 3, false));
881 EXPECT_EQ(order[ 6], TaskItem(RECURSIVE, 1, true));
882 EXPECT_EQ(order[ 7], TaskItem(RECURSIVE, 1, false));
883 EXPECT_EQ(order[ 8], TaskItem(RECURSIVE, 2, true));
884 EXPECT_EQ(order[ 9], TaskItem(RECURSIVE, 2, false));
885 EXPECT_EQ(order[10], TaskItem(RECURSIVE, 1, true));
886 EXPECT_EQ(order[11], TaskItem(RECURSIVE, 1, false));
887 EXPECT_EQ(order[12], TaskItem(RECURSIVE, 2, true));
888 EXPECT_EQ(order[13], TaskItem(RECURSIVE, 2, false));
894 TaskList order;
896 new RecursiveTask(2, &order, 1, true));
898 new RecursiveTask(2, &order, 2, true));
900 new QuitTask(&order, 3));
904 // FIFO order.
905 ASSERT_EQ(14U, order.size());
906 EXPECT_EQ(order[ 0], TaskItem(RECURSIVE, 1, true));
907 EXPECT_EQ(order[ 1], TaskItem(RECURSIVE, 1, false));
908 EXPECT_EQ(order[ 2], TaskItem(RECURSIVE, 2, true));
909 EXPECT_EQ(order[ 3], TaskItem(RECURSIVE, 2, false));
910 EXPECT_EQ(order[ 4], TaskItem(QUITMESSAGELOOP, 3, true));
911 EXPECT_EQ(order[ 5], TaskItem(QUITMESSAGELOOP, 3, false));
912 EXPECT_EQ(order[ 6], TaskItem(RECURSIVE, 1, true));
913 EXPECT_EQ(order[ 7], TaskItem(RECURSIVE, 1, false));
914 EXPECT_EQ(order[ 8], TaskItem(RECURSIVE, 2, true));
915 EXPECT_EQ(order[ 9], TaskItem(RECURSIVE, 2, false));
916 EXPECT_EQ(order[10], TaskItem(RECURSIVE, 1, true));
917 EXPECT_EQ(order[11], TaskItem(RECURSIVE, 1, false));
918 EXPECT_EQ(order[12], TaskItem(RECURSIVE, 2, true));
919 EXPECT_EQ(order[13], TaskItem(RECURSIVE, 2, false));
934 TaskList order;
940 &order,
946 ASSERT_EQ(order.size(), 17);
947 EXPECT_EQ(order[ 0], TaskItem(RECURSIVE, 1, true));
948 EXPECT_EQ(order[ 1], TaskItem(RECURSIVE, 1, false));
949 EXPECT_EQ(order[ 2], TaskItem(MESSAGEBOX, 2, true));
950 EXPECT_EQ(order[ 3], TaskItem(MESSAGEBOX, 2, false));
951 EXPECT_EQ(order[ 4], TaskItem(RECURSIVE, 3, true));
952 EXPECT_EQ(order[ 5], TaskItem(RECURSIVE, 3, false));
955 EXPECT_EQ(order[ 6], TaskItem(ENDDIALOG, 4, true));
956 EXPECT_EQ(order[ 7], TaskItem(QUITMESSAGELOOP, 5, true));
957 EXPECT_EQ(order[ 8], TaskItem(QUITMESSAGELOOP, 5, false));
958 EXPECT_EQ(order[ 9], TaskItem(RECURSIVE, 1, true));
959 EXPECT_EQ(order[10], TaskItem(RECURSIVE, 1, false));
960 EXPECT_EQ(order[11], TaskItem(RECURSIVE, 3, true));
961 EXPECT_EQ(order[12], TaskItem(RECURSIVE, 3, false));
962 EXPECT_EQ(order[13], TaskItem(RECURSIVE, 1, true));
963 EXPECT_EQ(order[14], TaskItem(RECURSIVE, 1, false));
964 EXPECT_EQ(order[15], TaskItem(RECURSIVE, 3, true));
965 EXPECT_EQ(order[16], TaskItem(RECURSIVE, 3, false));
977 TaskList order;
983 &order,
989 ASSERT_EQ(order.size(), 18);
990 EXPECT_EQ(order[ 0], TaskItem(RECURSIVE, 1, true));
991 EXPECT_EQ(order[ 1], TaskItem(RECURSIVE, 1, false));
992 EXPECT_EQ(order[ 2], TaskItem(MESSAGEBOX, 2, true));
994 EXPECT_EQ(order[ 3], TaskItem(RECURSIVE, 3, true));
995 EXPECT_EQ(order[ 4], TaskItem(RECURSIVE, 3, false));
996 EXPECT_EQ(order[ 5], TaskItem(ENDDIALOG, 4, true));
997 EXPECT_EQ(order[ 6], TaskItem(ENDDIALOG, 4, false));
998 EXPECT_EQ(order[ 7], TaskItem(MESSAGEBOX, 2, false));
999 /* The order can subtly change here. The reason is that when RecursiveTask(1)
1001 PostTask(FROM_HERE, QuitTask) execution, the order of task execution can
1002 change. We don't care anyway that the order isn't correct.
1003 EXPECT_EQ(order[ 8], TaskItem(QUITMESSAGELOOP, 5, true));
1004 EXPECT_EQ(order[ 9], TaskItem(QUITMESSAGELOOP, 5, false));
1005 EXPECT_EQ(order[10], TaskItem(RECURSIVE, 1, true));
1006 EXPECT_EQ(order[11], TaskItem(RECURSIVE, 1, false));
1008 EXPECT_EQ(order[12], TaskItem(RECURSIVE, 3, true));
1009 EXPECT_EQ(order[13], TaskItem(RECURSIVE, 3, false));
1010 EXPECT_EQ(order[14], TaskItem(RECURSIVE, 1, true));
1011 EXPECT_EQ(order[15], TaskItem(RECURSIVE, 1, false));
1012 EXPECT_EQ(order[16], TaskItem(RECURSIVE, 3, true));
1013 EXPECT_EQ(order[17], TaskItem(RECURSIVE, 3, false));
1020 TaskThatPumps(TaskList* order, int cookie)
1021 : OrderedTasks(order, PUMPS, cookie) {
1038 TaskList order;
1040 Task* task = new OrderedTasks(&order, 1);
1042 MessageLoop::current()->PostTask(FROM_HERE, new OrderedTasks(&order, 2));
1043 MessageLoop::current()->PostTask(FROM_HERE, new QuitTask(&order, 3));
1046 // FIFO order.
1047 ASSERT_EQ(6U, order.size());
1048 EXPECT_EQ(order[ 0], TaskItem(ORDERERD, 1, true));
1049 EXPECT_EQ(order[ 1], TaskItem(ORDERERD, 1, false));
1050 EXPECT_EQ(order[ 2], TaskItem(ORDERERD, 2, true));
1051 EXPECT_EQ(order[ 3], TaskItem(ORDERERD, 2, false));
1052 EXPECT_EQ(order[ 4], TaskItem(QUITMESSAGELOOP, 3, true));
1053 EXPECT_EQ(order[ 5], TaskItem(QUITMESSAGELOOP, 3, false));
1061 TaskList order;
1064 new TaskThatPumps(&order, 1));
1065 Task* task = new OrderedTasks(&order, 2);
1071 MessageLoop::current()->PostTask(FROM_HERE, new OrderedTasks(&order, 3));
1072 MessageLoop::current()->PostTask(FROM_HERE, new SleepTask(&order, 4, 50));
1073 MessageLoop::current()->PostTask(FROM_HERE, new OrderedTasks(&order, 5));
1074 Task* non_nestable_quit = new QuitTask(&order, 6);
1085 // FIFO order.
1086 ASSERT_EQ(12U, order.size());
1087 EXPECT_EQ(order[ 0], TaskItem(PUMPS, 1, true));
1088 EXPECT_EQ(order[ 1], TaskItem(ORDERERD, 3, true));
1089 EXPECT_EQ(order[ 2], TaskItem(ORDERERD, 3, false));
1090 EXPECT_EQ(order[ 3], TaskItem(SLEEP, 4, true));
1091 EXPECT_EQ(order[ 4], TaskItem(SLEEP, 4, false));
1092 EXPECT_EQ(order[ 5], TaskItem(ORDERERD, 5, true));
1093 EXPECT_EQ(order[ 6], TaskItem(ORDERERD, 5, false));
1094 EXPECT_EQ(order[ 7], TaskItem(PUMPS, 1, false));
1095 EXPECT_EQ(order[ 8], TaskItem(ORDERERD, 2, true));
1096 EXPECT_EQ(order[ 9], TaskItem(ORDERERD, 2, false));
1097 EXPECT_EQ(order[10], TaskItem(QUITMESSAGELOOP, 6, true));
1098 EXPECT_EQ(order[11], TaskItem(QUITMESSAGELOOP, 6, false));
