1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
|
/* $Id$ */
/***
This file is part of avahi.
avahi is free software; you can redistribute it and/or modify it
under the terms of the GNU Lesser General Public License as
published by the Free Software Foundation; either version 2.1 of the
License, or (at your option) any later version.
avahi is distributed in the hope that it will be useful, but WITHOUT
ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General
Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with avahi; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
USA.
***/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include <ctype.h>
#include <avahi-common/malloc.h>
#include "util.h"
void avahi_hexdump(const void* p, size_t size) {
const uint8_t *c = p;
assert(p);
printf("Dumping %lu bytes from %p:\n", (unsigned long) size, p);
while (size > 0) {
unsigned i;
for (i = 0; i < 16; i++) {
if (i < size)
printf("%02x ", c[i]);
else
printf(" ");
}
for (i = 0; i < 16; i++) {
if (i < size)
printf("%c", c[i] >= 32 && c[i] < 127 ? c[i] : '.');
else
printf(" ");
}
printf("\n");
c += 16;
if (size <= 16)
break;
size -= 16;
}
}
char *avahi_format_mac_address(const uint8_t* mac, size_t size) {
char *r, *t;
unsigned i;
static const char hex[] = "0123456789abcdef";
if (!(t = r = avahi_new(char, size > 0 ? size*3 : 1)))
return NULL;
if (size <= 0) {
*r = 0;
return r;
}
for (i = 0; i < size; i++) {
*(t++) = hex[*mac >> 4];
*(t++) = hex[*mac & 0xF];
*(t++) = ':';
mac++;
}
*(--t) = 0;
return r;
}
char *avahi_strdown(char *s) {
char *c;
assert(s);
for (c = s; *c; c++)
*c = (char) tolower(*c);
return s;
}
char *avahi_strup(char *s) {
char *c;
assert(s);
for (c = s; *c; c++)
*c = (char) toupper(*c);
return s;
}
|
