aboutsummaryrefslogtreecommitdiff
path: root/tools/steering_data.cpp
blob: d8e7846af48cf9e48a4474ba3f355830705cf3ff (plain)
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
/*
 *    Copyright (c) 2018, The OpenThread Authors.
 *    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. Neither the name of the copyright holder nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 *
 *    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT HOLDER OR CONTRIBUTORS 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.
 */

/**
 * @file
 *   This file implements a simple tool to compute pskc.
 */

#include <mbedtls/sha256.h>
#include <stdio.h>
#include <stdlib.h>

#include "common/code_utils.hpp"
#include "utils/hex.hpp"
#include "utils/steering_data.hpp"

using namespace ot;

void help(void)
{
    printf("steering-data - compute steering data\n"
           "SYNTAX:\n"
           "    steering-data [LENGTH] <JOINER_ID> ...\n"
           "EXAMPLE:\n"
           "    steering-data 18b4300000000001\n"
           "    steering-data 15 18b4300000000001\n"
           "    steering-data 18b4300000000001 18b4300000000002\n");
}

int ComputeJoinerId(const char *aEui64, uint8_t *aJoinerId)
{
    int ret = -1;

    VerifyOrExit(strlen(aEui64) == SteeringData::kSizeJoinerId * 2);
    VerifyOrExit(ot::Utils::Hex2Bytes(aEui64, aJoinerId, SteeringData::kSizeJoinerId) == SteeringData::kSizeJoinerId);
    ot::SteeringData::ComputeJoinerId(aJoinerId, aJoinerId);
    ret = 0;

exit:
    if (ret != 0)
    {
        fprintf(stderr, "Invalid EUI64: %s", aEui64);
    }

    return ret;
}

int main(int argc, char *argv[])
{
    ot::SteeringData computer;
    int              ret    = -1;
    int              length = 16;
    int              i      = 1;

    if (argc < 2)
    {
        ExitNow(help());
    }

    if (strlen(argv[i]) != SteeringData::kSizeJoinerId * 2)
    {
        length = atoi(argv[i]);
        VerifyOrExit(length > 0 && length <= SteeringData::kMaxSizeOfBloomFilter,
                     fprintf(stderr, "Invalid bloom filter length: %d\n", length));

        ++i;
    }

    computer.Init(length);

    for (; i < argc; ++i)
    {
        uint8_t joinerId[SteeringData::kSizeJoinerId];

        VerifyOrExit(ComputeJoinerId(argv[i], joinerId) == 0, fprintf(stderr, "Invalid EUI64 : %s\n", argv[i]));
        computer.ComputeBloomFilter(joinerId);
    }

    for (i = 0; i < length; i++)
    {
        printf("%02x", computer.GetBloomFilter()[i]);
    }
    printf("\n");

    ret = 0;

exit:
    return ret;
}