christoph/lecture-operating-system-development
1
Fork 0
Code Activity

delete lists

Browse Source
This commit is contained in:
Christoph Urlacher
2022-07-21 02:43:24 +02:00
parent 48ef1948e4
commit 53cea941f1
7 changed files with 0 additions and 872 deletions
Download Patch File Download Diff File Expand all files Collapse all files

102
c_os/user/demo/ArrayListDemo.cc
View File

@ -1,102 +0,0 @@
#include "user/demo/ArrayListDemo.h"
void ArrayListDemo::run() {
kout.lock();
kout.clear();
kout << "Initial list size: " << dec << this->list.size() << endl;
kout << "Adding elements in order" << endl;
for (unsigned int i = 0; i < 5; ++i) {
this->list.insert_last(i);
}
this->list.print(kout);
kout << "Removing all elements from the front" << endl;
for (unsigned int i = 0; i < 5; ++i) {
this->list.remove_first();
}
this->list.print(kout);
// ============================================================
kout << "Adding elements in order with realloc" << endl;
for (unsigned int i = 0; i < 10; ++i) {
kout << "Add " << dec << i << endl;
this->list.insert_last(i);
}
this->list.print(kout);
kout << "Removing all elements from the back" << endl;
for (unsigned int i = 0; i < 10; ++i) {
this->list.remove_last();
}
this->list.print(kout);
// ============================================================
for (unsigned int i = 0; i < 5; ++i) {
this->list.insert_last(i);
}
this->list.print(kout);
kout << "Adding inside the list (at idx 0, 2, 5)" << endl;
this->list.insert_at(10, 0);
this->list.insert_at(10, 2);
this->list.insert_at(10, 5);
this->list.print(kout);
kout << "Removing inside the list (at idx 0, 2, 5)" << endl;
this->list.remove_at(0);
this->list.remove_at(2);
this->list.remove_at(5);
this->list.print(kout);
for (unsigned int i = 0; i < 5; ++i) {
this->list.remove_first();
}
this->list.print(kout);
// ============================================================
kout << "Mirror scheduling behavior" << endl;
// These are the threads
int active = 0; // Idle thread
this->list.insert_last(1);
this->list.insert_last(2);
this->list.insert_last(3);
this->list.print(kout);
kout << "Starting..." << endl;
for (unsigned int n = 0; n < 10000; ++n) {
this->list.insert_last(active);
active = list.remove_first().value_or(-1);
if (this->list.size() != 3 || active == -1) {
kout << "ERROR: Thread went missing" << endl;
break;
}
if (n < 5) {
this->list.print(kout);
}
}
kout << "Finished." << endl;
this->list.print(kout);
// ============================================================
kout << "Range based for support" << endl;
for (int i : this->list) {
kout << "List contains element: " << dec << i << endl;
}
kout << "Const iterator" << endl;
for (const int i : this->list) {
kout << "List contains element: " << dec << i << endl;
}
kout.unlock();
scheduler.exit();
}

22
c_os/user/demo/ArrayListDemo.h
View File

@ -1,22 +0,0 @@
#ifndef __ArrayListDemo_include__
#define __ArrayListDemo_include__
#include "kernel/Globals.h"
#include "kernel/threads/Thread.h"
#include "user/lib/ArrayList.h"
class ArrayListDemo : public Thread {
private:
ArrayListDemo(const ArrayListDemo& copy) = delete;
ArrayList<int> list;
public:
ArrayListDemo() {
kout << "Initialized ArrayListDemo" << endl;
}
void run() override;
};
#endif

97
c_os/user/demo/LinkedListDemo.cc
View File

@ -1,97 +0,0 @@
#include "user/demo/LinkedListDemo.h"
void LinkedListDemo::run() {
kout.lock();
kout.clear();
kout << "Initial list size: " << dec << this->list.size() << endl;
kout << "Adding elements in order" << endl;
for (unsigned int i = 0; i < 5; ++i) {
this->list.insert_last(i);
}
this->list.print(kout); // BUG: Crash
kout << "Removing all elements from the front" << endl;
for (unsigned int i = 0; i < 5; ++i) {
this->list.remove_first();
}
this->list.print(kout);
// ============================================================
// kout << "Adding elements in order with realloc" << endl;
// for (unsigned int i = 0; i < 10; ++i) {
// kout << "Add " << dec << i << endl;
// this->list.insert_last(i);
// }
// this->list.print(kout);
// kout << "Removing all elements from the back" << endl;
// for (unsigned int i = 0; i < 10; ++i) {
// this->list.remove_last();
// }
// this->list.print(kout);
// ============================================================
for (unsigned int i = 0; i < 5; ++i) {
this->list.insert_last(i);
}
this->list.print(kout);
kout << "Adding inside the list (at idx 0, 2, 5)" << endl;
this->list.insert_at(10, 0);
this->list.insert_at(10, 2);
this->list.insert_at(10, 5);
this->list.print(kout);
kout << "Removing inside the list (at idx 0, 2, 5)" << endl;
this->list.remove_at(0);
this->list.remove_at(2);
this->list.remove_at(5);
this->list.print(kout);
for (unsigned int i = 0; i < 5; ++i) {
this->list.remove_first();
}
this->list.print(kout);
// ============================================================
kout << "Mirror scheduling behavior" << endl;
// These are the threads
int active = 0; // Idle thread
this->list.insert_last(1);
this->list.insert_last(2);
this->list.insert_last(3);
this->list.print(kout);
kout << "Starting..." << endl;
for (unsigned int n = 0; n < 10000; ++n) {
this->list.insert_last(active);
active = list.remove_first().value_or(-1);
if (this->list.size() != 3 || active == -1) {
kout << "ERROR: Thread went missing" << endl;
break;
}
if (n < 5) {
this->list.print(kout);
}
}
kout << "Finished." << endl;
this->list.print(kout);
// ============================================================
kout << "Range based for support" << endl;
for (int i : this->list) {
kout << "List contains element: " << dec << i << endl;
}
kout.unlock();
scheduler.exit();
}

22
c_os/user/demo/LinkedListDemo.h
View File

@ -1,22 +0,0 @@
#ifndef __LinkedListDemo_include__
#define __LinkedListDemo_include__
#include "kernel/Globals.h"
#include "kernel/threads/Thread.h"
#include "user/lib/LinkedList.h"
class LinkedListDemo : public Thread {
private:
LinkedListDemo(const LinkedListDemo& copy) = delete;
LinkedList<int> list;
public:
LinkedListDemo() {
kout << "Initialized LinkedListDemo" << endl;
}
void run() override;
};
#endif