]>
git.cameronkatri.com Git - trustcache.git/blob - info.c
2 * SPDX-License-Identifier: BSD-2-Clause
4 * Copyright (c) 2022 Cameron Katri. All rights reserved.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY CAMERON KATRI AND CONTRIBUTORS ``AS IS'' AND
16 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
17 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
18 * ARE DISCLAIMED. IN NO EVENT SHALL CAMERON KATRI OR CONTRIBUTORS BE LIABLE
19 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
20 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
21 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
22 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
23 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
24 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 #include "trustcache.h"
39 tcinfo(int argc
, char **argv
)
41 struct trust_cache cache
;
42 bool headeronly
= false, onlyhash
= false;
43 uint32_t entrynum
= 0;
44 const char *errstr
= NULL
;
47 while ((ch
= getopt(argc
, argv
, "che:")) != -1) {
53 entrynum
= strtonum(optarg
, 1, UINT32_MAX
, &errstr
);
55 fprintf(stderr
, "entry number is %s: %s\n", errstr
, optarg
);
71 cache
= opentrustcache(argv
[0]);
73 if (entrynum
== 0 && !onlyhash
)
77 for (uint32_t i
= 0; i
< cache
.num_entries
; i
++) {
78 if (cache
.version
== 0)
79 print_hash(cache
.hashes
[i
], true);
81 print_hash(cache
.entries
[i
].cdhash
, true);
86 if (entrynum
> cache
.num_entries
) {
87 fprintf(stderr
, "no entry %i\n", entrynum
);
90 if (cache
.version
== 1) {
91 print_entry(cache
.entries
[entrynum
- 1]);
92 } else if (cache
.version
== 0) {
93 print_hash(cache
.hashes
[entrynum
- 1], true);
107 print_header(struct trust_cache cache
)
109 printf("version = %i\n", cache
.version
);
111 uuid_unparse(cache
.uuid
, out
);
112 printf("uuid = %s\n", out
);
113 printf("entry count = %i\n", cache
.num_entries
);
117 print_entries(struct trust_cache cache
)
119 for (uint32_t i
= 0; i
< cache
.num_entries
; i
++) {
120 if (cache
.version
== 0)
121 print_hash(cache
.hashes
[i
], true);
122 else if (cache
.version
== 1)
123 print_entry(cache
.entries
[i
]);
128 print_entry(struct trust_cache_entry1 entry
)
130 print_hash(entry
.cdhash
, false);
132 switch (entry
.flags
) {
133 case CS_TRUST_CACHE_AMFID
:
134 printf(" CS_TRUST_CACHE_AMFID ");
136 case CS_TRUST_CACHE_ANE
:
137 printf(" CS_TRUST_CACHE_ANE ");
139 case CS_TRUST_CACHE_AMFID
|CS_TRUST_CACHE_ANE
:
140 printf(" CS_TRUST_CACHE_AMFID|CS_TRUST_CACHE_ANE ");
146 printf(" [%i] ", entry
.flags
);
150 printf("[%i]\n", entry
.hash_type
);
154 print_hash(uint8_t cdhash
[CS_CDHASH_LEN
], bool newline
)
156 for (size_t j
= 0; j
< CS_CDHASH_LEN
; j
++) {
157 printf("%02x", cdhash
[j
]);