mirror of
https://github.com/LadybirdBrowser/ladybird.git
synced 2024-11-26 01:20:25 +00:00
1682f0b760
SPDX License Identifiers are a more compact / standardized way of representing file license information. See: https://spdx.dev/resources/use/#identifiers This was done with the `ambr` search and replace tool. ambr --no-parent-ignore --key-from-file --rep-from-file key.txt rep.txt *
110 lines
2.3 KiB
C++
110 lines
2.3 KiB
C++
/*
|
|
* Copyright (c) 2018-2020, Andreas Kling <kling@serenityos.org>
|
|
*
|
|
* SPDX-License-Identifier: BSD-2-Clause
|
|
*/
|
|
|
|
#include <AK/Optional.h>
|
|
#include <AK/String.h>
|
|
#include <LibCore/ElapsedTimer.h>
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
#include <unistd.h>
|
|
|
|
static void usage()
|
|
{
|
|
printf("usage: allocate [number [unit (B/KiB/MiB)]]\n");
|
|
exit(1);
|
|
}
|
|
|
|
enum class Unit {
|
|
Bytes,
|
|
KiB,
|
|
MiB,
|
|
};
|
|
|
|
int main(int argc, char** argv)
|
|
{
|
|
int count = 50;
|
|
auto unit = Unit::MiB;
|
|
|
|
if (argc >= 2) {
|
|
auto number = String(argv[1]).to_uint();
|
|
if (!number.has_value()) {
|
|
usage();
|
|
}
|
|
count = number.value();
|
|
}
|
|
|
|
if (argc >= 3) {
|
|
if (strcmp(argv[2], "B") == 0)
|
|
unit = Unit::Bytes;
|
|
else if (strcmp(argv[2], "KiB") == 0)
|
|
unit = Unit::KiB;
|
|
else if (strcmp(argv[2], "MiB") == 0)
|
|
unit = Unit::MiB;
|
|
else
|
|
usage();
|
|
}
|
|
|
|
switch (unit) {
|
|
case Unit::Bytes:
|
|
break;
|
|
case Unit::KiB:
|
|
count *= KiB;
|
|
break;
|
|
case Unit::MiB:
|
|
count *= MiB;
|
|
break;
|
|
}
|
|
|
|
Core::ElapsedTimer timer;
|
|
|
|
printf("allocating memory (%d bytes)...\n", count);
|
|
timer.start();
|
|
char* ptr = (char*)malloc(count);
|
|
if (!ptr) {
|
|
printf("failed.\n");
|
|
return 1;
|
|
}
|
|
printf("done in %dms\n", timer.elapsed());
|
|
|
|
auto pages = count / PAGE_SIZE;
|
|
auto step = pages / 10;
|
|
|
|
Core::ElapsedTimer timer2;
|
|
|
|
printf("writing one byte to each page of allocated memory...\n");
|
|
timer.start();
|
|
timer2.start();
|
|
for (int i = 0; i < pages; ++i) {
|
|
ptr[i * PAGE_SIZE] = 1;
|
|
|
|
if (i != 0 && (i % step) == 0) {
|
|
auto ms = timer2.elapsed();
|
|
if (ms == 0)
|
|
ms = 1;
|
|
|
|
auto bps = double(step * PAGE_SIZE) / (double(ms) / 1000);
|
|
|
|
printf("step took %dms (%fMiB/s)\n", ms, bps / MiB);
|
|
|
|
timer2.start();
|
|
}
|
|
}
|
|
printf("done in %dms\n", timer.elapsed());
|
|
|
|
printf("sleeping for ten seconds...\n");
|
|
for (int i = 0; i < 10; i++) {
|
|
printf("%d\n", i);
|
|
sleep(1);
|
|
}
|
|
printf("done.\n");
|
|
|
|
printf("freeing memory...\n");
|
|
timer.start();
|
|
free(ptr);
|
|
printf("done in %dms\n", timer.elapsed());
|
|
|
|
return 0;
|
|
}
|