Add standalone cases (#3536)

This commit is contained in:
Zhang, Yi
2024-06-19 16:40:37 +08:00
committed by GitHub
parent 7f94d183ac
commit 16e70f99aa
129 changed files with 3880 additions and 3 deletions

View File

@ -0,0 +1,31 @@
/*
* Copyright (C) 2019 Intel Corporation. All rights reserved.
* SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
*/
double
foo(double d)
{
return d / 3.0;
}
double
maybe_min(double d, double e)
{
return d < e ? d : e;
}
double
factor(double a, double b, double c)
{
return (a * c) + (b * c);
}
int
echo(int a)
{
double b = foo(14.5);
double c = maybe_min(12.2, 15.4);
double d = factor(a, b, c);
return 2 * a;
}

Binary file not shown.

View File

@ -0,0 +1,52 @@
/*
* Copyright (C) 2019 Intel Corporation. All rights reserved.
* SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
*/
#include <stdio.h>
#include <stdlib.h>
int
recursive(int a)
{
if (a > 0) {
return recursive(a - 1) + 1;
}
else
return 0;
}
int
testFunction(int *input, int length)
{
int sum = 0;
for (int i = 0; i < length; ++i) {
sum += input[i];
}
return sum;
}
int
main(int argc, char **argv)
{
int arr[5] = { 1, 2, 3, 4, 5 };
testFunction(arr, recursive(5));
char *buf;
printf("Hello world!\n");
buf = malloc(1024);
if (!buf) {
printf("malloc buf failed\n");
return -1;
}
printf("buf ptr: %p\n", buf);
snprintf(buf, 1024, "%s", "1234\n");
printf("buf: %s", buf);
free(buf);
return 0;
}

Binary file not shown.