[GOOD] BUILD 0.1.0.590 DATE 9/05/2011 AT 2:40 PM

====================================================
Mainly changed: FS.Initrd
+ (kind of) refractored VFS, bugfixed
+ Rewrote 'initrd' file system, fixed many problems
+ Working 'cat' and 'dir' console commands
+ Wrote 'initrd' image write application (for windows), however it may
be bugged

Kernel/library/stdlib/ord_arr.c

@@ -1,112 +0,0 @@
-/*
- * ord-arr.c
- *
- *  Created on: Aug 25, 2011
- *      Author: Tiberiu
- */
-
-
-/*
- * memory.c
- *
- *  Created on: Aug 24, 2011
- *      Author: Tiberiu
- */
-
-#include <stdlib.h>
-#include <memory.h>
-
-int StandardComparePredicate (uint32 a, uint32 b)
-{
-	if (a > b) return 1;
-	else if (a == b) return 0;
-	return -1;
-}
-
-OrderedArray OrderedArrayCreate (uint32 maxSize, ComparePredicate p)
-{
-	OrderedArray ret;
-	ret.Data = (unsigned*) kmalloc(maxSize);
-	memset(ret.Data, 0, maxSize);
-	ret.Size = 0;
-	ret.SizeLimit = maxSize;
-	ret.Compare = (p == 0) ? StandardComparePredicate : p;
-
-	return ret;
-}
-
-OrderedArray OrderedArrayPlace (uint32 addr, uint32 maxSize, ComparePredicate p)
-{
-	OrderedArray ret;
-	ret.Data = (unsigned*)addr;
-	memset(ret.Data, 0, maxSize);
-	ret.Size = 0;
-	ret.SizeLimit = maxSize;
-	ret.Compare = (p == 0) ? StandardComparePredicate : p;
-
-	return ret;
-}
-
-void OrderedArrayDispose (OrderedArray* arr)
-{
-	kfree(arr->Data);
-}
-
-uint32 OrderedArrayBinarySearch (uint32 key, uint32* array, uint32 length, ComparePredicate predicate)
-{
-	if (!predicate) return 0;
-
-	uint32 left = 0, right = length, mid;
-
-	while (left < right)
-	{
-		mid = left + (right-left) / 2;
-
-		int r = (*predicate)(key, array[mid]);
-
-		if (r > 0) left = mid + 1;
-		else if (r < 0) right = mid;
-		else return mid;
-	}
-	mid = left + (right-left) / 2;
-
-	return mid;
-}
-
-uint32 OrderedArraySearch (uint32 key, OrderedArray* arr, ComparePredicate predicate)
-{
-	uint32 r = OrderedArrayBinarySearch(key,arr->Data,arr->Size,predicate);
-
-	if (arr->Data[r] != key) return 0xffffffff;
-	return r;
-}
-
-void OrderedArrayInsert (uint32 item, OrderedArray* arr)
-{
-	if (arr->Size >= arr->SizeLimit) return;
-
-	uint32 location = OrderedArrayBinarySearch(item, arr->Data, arr->Size, arr->Compare);
-
-	uint32 i;
-	for (i = arr->Size; i > location && arr->Size > 0; i--)
-		arr->Data[i] = arr->Data[i-1];
-
-	arr->Data[location] = item;
-	arr->Size++;
-}
-
-uint32 OrderedArrayLookup (uint32 index, OrderedArray* arr)
-{
-	if (index >= arr->Size) return 0;
-	return arr->Data[index];
-}
-
-void OrderedArrayDeleteIndex (uint32 index, OrderedArray* arr)
-{
-	if (index >= arr->Size) return;
-
-	uint32 i;
-	for (i = index + 1; i < arr->Size; i++)
-		arr->Data[i - 1] = arr->Data[i];
-	arr->Size--;
-}

Kernel/library/stdlib/str_ops.c

@@ -29,6 +29,21 @@ int32 strcmp (string a, string b)
 	return ((c1 < c2) ? -1 : (c1 > c2));
 }
 
+int32 strncmp (string a, string b, uint32 n)
+{
+	unsigned char uc1, uc2;
+	if (!n) return 0;
+
+	while (n-- > 0 && *a == *b) {
+		if (n == 0 || (*a == *b  && *a == '\0')) return 0;
+		a++; b++;
+	}
+
+	uc1 = (* (unsigned char*)a);
+	uc2 = (* (unsigned char*)b);
+	return ((uc1 < uc2) ? -1 : (uc1 > uc2));
+}
+
 int32 strcasecmp (string a, string b)
 {
 	unsigned char c1, c2;