4 #include <arpa/inet.h> /* ntohl */
9 /* Intersects regulatory domains, this will skip any regulatory marked with
10 * an alpha2 of '00', which is used to indicate a regulatory domain */
12 #define BUG_ON(foo) do { \
19 /* Sanity check on a regulatory rule */
20 static int is_valid_reg_rule(const struct ieee80211_reg_rule *rule)
22 const struct ieee80211_freq_range *freq_range = &rule->freq_range;
25 if (freq_range->start_freq_khz == 0 || freq_range->end_freq_khz == 0)
28 if (freq_range->start_freq_khz > freq_range->end_freq_khz)
31 freq_diff = freq_range->end_freq_khz - freq_range->start_freq_khz;
33 if (freq_diff == 0 || freq_range->max_bandwidth_khz > freq_diff)
39 /* Helper for regdom_intersect(), this does the real
40 * mathematical intersection fun */
41 static int reg_rules_intersect(
42 struct ieee80211_reg_rule *rule1,
43 struct ieee80211_reg_rule *rule2,
44 struct ieee80211_reg_rule *intersected_rule)
46 struct ieee80211_freq_range *freq_range1, *freq_range2, *freq_range;
47 struct ieee80211_power_rule *power_rule1, *power_rule2, *power_rule;
50 freq_range1 = &rule1->freq_range;
51 freq_range2 = &rule2->freq_range;
52 freq_range = &intersected_rule->freq_range;
54 power_rule1 = &rule1->power_rule;
55 power_rule2 = &rule2->power_rule;
56 power_rule = &intersected_rule->power_rule;
58 freq_range->start_freq_khz = max(freq_range1->start_freq_khz,
59 freq_range2->start_freq_khz);
60 freq_range->end_freq_khz = min(freq_range1->end_freq_khz,
61 freq_range2->end_freq_khz);
62 freq_range->max_bandwidth_khz = min(freq_range1->max_bandwidth_khz,
63 freq_range2->max_bandwidth_khz);
65 freq_diff = freq_range->end_freq_khz - freq_range->start_freq_khz;
66 if (freq_range->max_bandwidth_khz > freq_diff)
67 freq_range->max_bandwidth_khz = freq_diff;
69 power_rule->max_eirp = min(power_rule1->max_eirp,
70 power_rule2->max_eirp);
71 power_rule->max_antenna_gain = min(power_rule1->max_antenna_gain,
72 power_rule2->max_antenna_gain);
74 intersected_rule->flags = (rule1->flags | rule2->flags);
76 if (!is_valid_reg_rule(intersected_rule))
83 * regdom_intersect - do the intersection between two regulatory domains
84 * @rd1: first regulatory domain
85 * @rd2: second regulatory domain
87 * Use this function to get the intersection between two regulatory domains.
88 * Once completed we will mark the alpha2 for the rd as intersected, "98",
89 * as no one single alpha2 can represent this regulatory domain.
91 * Returns a pointer to the regulatory domain structure which will hold the
92 * resulting intersection of rules between rd1 and rd2. We will
93 * malloc() this structure for you.
95 static struct ieee80211_regdomain *regdom_intersect(
96 struct ieee80211_regdomain *rd1,
97 struct ieee80211_regdomain *rd2)
101 unsigned int num_rules = 0, rule_idx = 0;
102 struct ieee80211_reg_rule *rule1, *rule2, *intersected_rule;
103 struct ieee80211_regdomain *rd;
104 /* This is just a dummy holder to help us count */
105 struct ieee80211_reg_rule irule;
107 /* Uses the stack temporarily for counter arithmetic */
108 intersected_rule = &irule;
110 memset(intersected_rule, 0, sizeof(struct ieee80211_reg_rule));
113 fprintf(stderr, "rd1 or or rd2 is null\n");
117 /* First we get a count of the rules we'll need, then we actually
118 * build them. This is to so we can malloc() and free() a
119 * regdomain once. The reason we use reg_rules_intersect() here
120 * is it will return -EINVAL if the rule computed makes no sense.
121 * All rules that do check out OK are valid. */
123 for (x = 0; x < rd1->n_reg_rules; x++) {
124 rule1 = &rd1->reg_rules[x];
125 for (y = 0; y < rd2->n_reg_rules; y++) {
126 rule2 = &rd2->reg_rules[y];
127 if (!reg_rules_intersect(rule1, rule2,
130 memset(intersected_rule, 0,
131 sizeof(struct ieee80211_reg_rule));
136 fprintf(stderr, "error: num_rules == 0\n");
140 size_of_regd = sizeof(struct ieee80211_regdomain) +
141 ((num_rules + 1) * sizeof(struct ieee80211_reg_rule));
143 rd = malloc(size_of_regd);
145 fprintf(stderr, "no memory left\n");
149 memset(rd, 0, size_of_regd);
151 for (x = 0; x < rd1->n_reg_rules; x++) {
152 rule1 = &rd1->reg_rules[x];
153 for (y = 0; y < rd2->n_reg_rules; y++) {
154 rule2 = &rd2->reg_rules[y];
155 /* This time around instead of using the stack lets
156 * write to the target rule directly saving ourselves
158 intersected_rule = &rd->reg_rules[rule_idx];
159 r = reg_rules_intersect(rule1, rule2,
167 if (rule_idx != num_rules) {
168 fprintf(stderr, "Error while doing regdom interesection :(\n");
173 rd->n_reg_rules = num_rules;
180 int main(int argc, char **argv)
183 struct ieee80211_regdomain *prev_world = NULL, *rd = NULL, *world = NULL;
185 unsigned int idx = 0;
188 fprintf(stderr, "You must specify a file\n");
192 /* We intersect only when we have to rd structures ready */
193 reglib_for_each_country(rd, idx, argv[1]) {
194 if (is_world_regdom((const char *) rd->alpha2))
207 world = regdom_intersect(prev_world, rd);
209 /* Could be something else but we'll live with this */
212 fprintf(stderr, "Could not intersect world "
213 "with country (%.2s)\n",
216 fprintf(stderr, "Could not intersect country (%.2s) "
217 "with country (%.2s)\n",
224 /* Use UTF-8 Intersection symbol ? (0xE2,0x88,0xA9) :) */
225 printf("WW (%d) intersect %c%c (%d) ==> %d rules\n",
226 prev_world->n_reg_rules,
232 printf("%c%c (%d) intersect %c%c (%d) ==> %d rules\n",
233 prev_world->alpha2[0],
234 prev_world->alpha2[1],
235 prev_world->n_reg_rules,
250 printf("%d regulatory domains intersected\n", intersected);
252 printf("Only one intersection completed\n");
255 printf("== World regulatory domain: ==\n");
263 if (intersected > 1) {