Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
B
BIRD Internet Routing Daemon
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Labels
Merge Requests
3
Merge Requests
3
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Operations
Operations
Environments
Packages & Registries
Packages & Registries
Container Registry
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Jobs
Commits
Open sidebar
labs
BIRD Internet Routing Daemon
Commits
e87a95d9
Commit
e87a95d9
authored
Dec 16, 2017
by
Ondřej Zajíček
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Minor fixes for debug mode
parent
3013fc57
Changes
4
Hide whitespace changes
Inline
Side-by-side
Showing
4 changed files
with
7 additions
and
12 deletions
+7
-12
nest/iface.c
nest/iface.c
+2
-1
nest/rt-fib.c
nest/rt-fib.c
+3
-9
proto/bfd/io.c
proto/bfd/io.c
+1
-1
proto/ospf/ospf.c
proto/ospf/ospf.c
+1
-1
No files found.
nest/iface.c
View file @
e87a95d9
...
...
@@ -93,7 +93,8 @@ if_dump(struct iface *i)
WALK_LIST
(
a
,
i
->
addrs
)
{
ifa_dump
(
a
);
ASSERT
((
a
!=
i
->
addr
)
==
!
(
a
->
flags
&
IA_PRIMARY
));
ASSERT
(
!!
(
a
->
flags
&
IA_PRIMARY
)
==
((
a
==
i
->
addr4
)
||
(
a
==
i
->
addr6
)
||
(
a
==
i
->
llv6
)));
}
}
...
...
nest/rt-fib.c
View file @
e87a95d9
...
...
@@ -568,22 +568,17 @@ found:
void
fib_check
(
struct
fib
*
f
)
{
#if 0
uint i, ec, lo, nulls;
uint
i
,
ec
,
nulls
;
ec
=
0
;
for
(
i
=
0
;
i
<
f
->
hash_size
;
i
++
)
{
struct
fib_node
*
n
;
lo = 0;
for
(
n
=
f
->
hash_table
[
i
];
n
;
n
=
n
->
next
)
{
struct
fib_iterator
*
j
,
*
j0
;
uint h0 = ipa_hash(n->prefix);
if (h0 < lo)
bug("fib_check: discord in hash chains");
lo = h0;
if ((h0 >> f->hash_shift) != i)
uint
h0
=
fib_hash
(
f
,
n
->
addr
);
if
(
h0
!=
i
)
bug
(
"fib_check: mishashed %x->%x (order %d)"
,
h0
,
i
,
f
->
hash_order
);
j0
=
(
struct
fib_iterator
*
)
n
;
nulls
=
0
;
...
...
@@ -604,7 +599,6 @@ fib_check(struct fib *f)
}
if
(
ec
!=
f
->
entries
)
bug
(
"fib_check: invalid entry count (%d != %d)"
,
ec
,
f
->
entries
);
#endif
return
;
}
...
...
proto/bfd/io.c
View file @
e87a95d9
...
...
@@ -298,7 +298,7 @@ sockets_prepare(struct birdloop *loop)
struct
pollfd
*
pfd
=
loop
->
poll_fd
.
data
;
sock
**
psk
=
loop
->
poll_sk
.
data
;
int
i
=
0
;
u
int
i
=
0
;
node
*
n
;
WALK_LIST
(
n
,
loop
->
sock_list
)
...
...
proto/ospf/ospf.c
View file @
e87a95d9
...
...
@@ -1179,7 +1179,7 @@ ospf_sh_state(struct proto *P, int verbose, int reachable)
/* We store interesting area-scoped LSAs in array hea and
global-scoped (LSA_T_EXT) LSAs in array hex */
int
num
=
p
->
gr
->
hash_entries
;
u
int
num
=
p
->
gr
->
hash_entries
;
struct
top_hash_entry
*
hea
[
num
];
struct
top_hash_entry
*
hex
[
verbose
?
num
:
0
];
struct
top_hash_entry
*
he
;
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment