strace/tests/request_key.c
Eugene Syromyatnikov d212c95b84 tests: move ARG_STR and similar macros to tests.h
* tests/add_key.c (_STR, ARG_STR): Move ...
* tests/tests.h: ... here.
(ARG_ULL_STR): New macro.
* tests/keyctl.c (ARG_STR): Remove.
* tests/quotactl.h (ARG_STR): Likewise.
* tests/request_key.c (ARG_STR): Likewise.
2016-10-26 04:18:34 +03:00

150 lines
4.1 KiB
C

/*
* Check decoding of request_key syscall.
*
* Copyright (c) 2016 Eugene Syromiatnikov <evgsyr@gmail.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "tests.h"
#include <asm/unistd.h>
#ifdef __NR_request_key
# include <inttypes.h>
# include <stdio.h>
# include <unistd.h>
void
print_val_str(const void *ptr, const char *str)
{
if (str)
printf("%s, ", str);
else
printf("%p, ", ptr);
}
void
do_request_key(const char *type, const char *type_str, const char *desc,
const char *desc_str, const char *info, const char *info_str,
int32_t keyring, const char *keyring_str)
{
long rc = syscall(__NR_request_key, type, desc, info, keyring);
const char *errstr = sprintrc(rc);
printf("request_key(");
print_val_str(type, type_str);
print_val_str(desc, desc_str);
print_val_str(info, info_str);
if (keyring_str)
printf("%s", keyring_str);
else
printf("%d", keyring);
printf(") = %s\n", errstr);
}
int
main(void)
{
static const char unterminated1[] = { '\1', '\2', '\3', '\4', '\5' };
static const char unterminated2[] = { '\6', '\7', '\10', '\11', '\12' };
static const char unterminated3[] =
{ '\16', '\17', '\20', '\21', '\22' };
char *bogus_type = tail_memdup(unterminated1, sizeof(unterminated1));
char *bogus_desc = tail_memdup(unterminated2, sizeof(unterminated2));
char *bogus_info = tail_memdup(unterminated3, sizeof(unterminated3));
unsigned i;
unsigned j;
unsigned k;
unsigned l;
struct {
const char *type;
const char *str;
} types[] = {
{ ARG_STR(NULL) },
{ (const char *) 0xfffffee1fffffbadULL, NULL },
{ bogus_type, NULL },
{ ARG_STR("\20\21\22\23\24") },
{ ARG_STR("user") },
};
struct {
const char *desc;
const char *str;
} descs[] = {
{ ARG_STR(NULL) },
{ (const char *) 0xfffff00dfffffca7ULL, NULL },
{ bogus_desc, NULL },
{ ARG_STR("\25\26\27\30\31") },
{ ARG_STR("desc") },
{ "overly long description", _STR("overly long ") "..." },
};
struct {
const char *info;
const char *str;
} infos[] = {
{ ARG_STR(NULL) },
{ (const char *) 0xfffffacefffff157ULL, NULL },
{ bogus_info, NULL },
{ ARG_STR("\32\33\34\35\36") },
{ ARG_STR("info") },
{ "overly long info", _STR("overly long ") "..." },
};
struct {
uint32_t keyring;
const char *str;
} keyrings[] = {
{ ARG_STR(0) },
{ ARG_STR(1234567890) },
{ ARG_STR(-1234567890) },
{ -1, "KEY_SPEC_THREAD_KEYRING" },
};
for (i = 0; i < ARRAY_SIZE(types); i++)
for (j = 0; j < ARRAY_SIZE(descs); j++)
for (k = 0; k < ARRAY_SIZE(infos); k++)
for (l = 0; l < ARRAY_SIZE(keyrings); l++)
do_request_key(
types[i].type, types[i].str,
descs[j].desc, descs[j].str,
infos[k].info, infos[k].str,
keyrings[l].keyring,
keyrings[l].str);
puts("+++ exited with 0 +++");
return 0;
}
#else
SKIP_MAIN_UNDEFINED("__NR_request_key");
#endif