UpsilonNumworks/Upsilon
1
0
Fork 0
mirror of https://github.com/UpsilonNumworks/Upsilon.git synced 2026-03-24 00:00:44 +01:00
Code Issues Packages Projects Releases Wiki Activity

AllocationFail

Browse Source
This commit is contained in:
Léa Saviot
2018-06-27 16:14:52 +02:00
parent 2248a257c8
commit 170ce95041
4 changed files with 51 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
test.cpp
View File

@@ -1,8 +1,4 @@
#include "float_node.h"
#include "char_layout_node.h"
#include "horizontal_layout_node.h"
#include "addition_node.h"
#include "layout_cursor.h"
#include "refs.h"
#include <stdio.h>
AdditionRef buildAddition() {
@@ -98,6 +94,20 @@ void testCursorMoveLeft() {
assert(aChar.nodeRetainCount() == 3);
}
void testPoolAllocationFail() {
printf("Pool allocation fail test\n");
// Fill the pool for size 256
// Allocation fail
assert(TreePool::sharedPool()->numberOfNodes() == 0);
AllocationFailedExpressionRef a;
assert(TreePool::sharedPool()->numberOfNodes() == 1);
/*Expression e = ;
e.simplify*/
}
typedef void (test)();
void runTest(test t) {
assert(TreePool::sharedPool()->numberOfNodes() == 0);
@@ -106,9 +116,12 @@ void runTest(test t) {
}
int main() {
printf("\n*******************\nStart running tests\n*******************\n\n");
runTest(testAddition);
runTest(testPoolEmpties);
runTest(testCursorCreateAndRetain);
runTest(testCursorMoveLeft);
runTest(testPoolAllocationFail);
printf("\n*******************\nEnd of tests\n*******************\n\n");
return 0;
}