7842 - new directory organization

Baremetal is now the default build target and therefore has its sources
at the top-level. Baremetal programs build using the phase-2 Mu toolchain
that requires a Linux kernel. This phase-2 codebase which used to be at
the top-level is now under the linux/ directory. Finally, the phase-2 toolchain,
while self-hosting, has a way to bootstrap from a C implementation, which
is now stored in linux/bootstrap. The bootstrap C implementation uses some
literate programming tools that are now in linux/bootstrap/tools.

So the whole thing has gotten inverted. Each directory should build one
artifact and include the main sources (along with standard library). Tools
used for building it are relegated to sub-directories, even though those
tools are often useful in their own right, and have had lots of interesting
programs written using them.

A couple of things have gotten dropped in this process:
  - I had old ways to run on just a Linux kernel, or with a Soso kernel.
    No more.
  - I had some old tooling for running a single test at the cursor. I haven't
    used that lately. Maybe I'll bring it back one day.

The reorg isn't done yet. Still to do:
  - redo documentation everywhere. All the README files, all other markdown,
    particularly vocabulary.md.
  - clean up how-to-run comments at the start of programs everywhere
  - rethink what to do with the html/ directory. Do we even want to keep
    supporting it?

In spite of these shortcomings, all the scripts at the top-level, linux/
and linux/bootstrap are working. The names of the scripts also feel reasonable.
This is a good milestone to take stock at.

1 files changed, 0 insertions, 58 deletions

diff --git a/tools/iso/kernel.soso/list.h b/tools/iso/kernel.soso/list.h
deleted file mode 100644
index 4e7831b2..00000000
--- a/tools/iso/kernel.soso/list.h
+++ /dev/null
@@ -1,58 +0,0 @@
-#ifndef LIST_H
-#define LIST_H
-
-#include "common.h"
-
-#define List_Foreach(listNode, list) for (ListNode* listNode = list->head; NULL != listNode ; listNode = listNode->next)
-
-typedef struct ListNode {
-    struct ListNode* previous;
-    struct ListNode* next;
-    void* data;
-} ListNode;
-
-typedef struct List {
-    struct ListNode* head;
-    struct ListNode* tail;
-} List;
-
-List* List_Create();
-void List_Clear(List* list);
-void List_Destroy(List* list);
-List* List_CreateClone(List* list);
-BOOL List_IsEmpty(List* list);
-void List_Append(List* list, void* data);
-void List_Prepend(List* list, void* data);
-ListNode* List_GetFirstNode(List* list);
-ListNode* List_GetLastNode(List* list);
-ListNode* List_FindFirstOccurrence(List* list, void* data);
-int List_FindFirstOccurrenceIndex(List* list, void* data);
-int List_GetCount(List* list);
-void List_RemoveNode(List* list, ListNode* node);
-void List_RemoveFirstNode(List* list);
-void List_RemoveLastNode(List* list);
-void List_RemoveFirstOccurrence(List* list, void* data);
-
-typedef struct Stack {
-    List* list;
-} Stack;
-
-Stack* Stack_Create();
-void Stack_Clear(Stack* stack);
-void Stack_Destroy(Stack* stack);
-BOOL Stack_IsEmpty(Stack* stack);
-void Stack_Push(Stack* stack, void* data);
-void* Stack_Pop(Stack* stack);
-
-typedef struct Queue {
-    List* list;
-} Queue;
-
-Queue* Queue_Create();
-void Queue_Clear(Queue* queue);
-void Queue_Destroy(Queue* queue);
-BOOL Queue_IsEmpty(Queue* queue);
-void Queue_Enqueue(Queue* queue, void* data);
-void* Queue_Dequeue(Queue* stack);
-
-#endif // LIST_H