1/*
2 * Copyright 2018 Google, Inc.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
6 * met: redistributions of source code must retain the above copyright
7 * notice, this list of conditions and the following disclaimer;
8 * redistributions in binary form must reproduce the above copyright
--- 92 unchanged lines hidden (view full) ---
101}
102
103void
104Scheduler::initPhase()
105{
106 for (Process *p = toFinalize.getNext(); p; p = toFinalize.getNext()) {
107 p->finalize();
108 p->popListNode();
109 }
110
111 for (Process *p = initList.getNext(); p; p = initList.getNext()) {
112 p->finalize();
113 p->popListNode();
114 p->ready();
115 }
116
--- 301 unchanged lines hidden ---
2 * Copyright 2018 Google, Inc.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions are
6 * met: redistributions of source code must retain the above copyright
7 * notice, this list of conditions and the following disclaimer;
8 * redistributions in binary form must reproduce the above copyright
--- 92 unchanged lines hidden (view full) ---
101}
102
103void
104Scheduler::initPhase()
105{
106 for (Process *p = toFinalize.getNext(); p; p = toFinalize.getNext()) {
107 p->finalize();
108 p->popListNode();
109 }
110
111 for (Process *p = initList.getNext(); p; p = initList.getNext()) {
112 p->finalize();
113 p->popListNode();
114 p->ready();
115 }
116
--- 301 unchanged lines hidden ---