Branch Coverage

third_party/modest/source/mycore/utils/mctree.c

Criterion	Covered	Total	%
branch	31	82	37.8

line	true	false	branch
28	0	145	if(mctree == NULL)
35	0	145	if(mctree->nodes == NULL) {
53	0	144	if(mctree == NULL)
56	144	0	if(mctree->nodes)
68	11	3	while (idx)
70	8	3	if(key_size == nodes[idx].str_size) {
71	5	3	if(mycore_strncasecmp(key, nodes[idx].str, key_size) == 0) {
77	3	0	else if(key_size > nodes[idx].str_size)
79	0	3	if(key_size < nodes[ nodes[idx].next ].str_size) {
86	0	0	if(key_size > nodes[ nodes[idx].prev ].str_size) {
101	0	0	while (idx)
103	0	0	if(key_size == nodes[idx].str_size) {
104	0	0	if(memcmp((const void *)key, (const void *)(nodes[idx].str), key_size) == 0) {
110	0	0	else if(key_size > nodes[idx].str_size)
112	0	0	if(key_size < nodes[ nodes[idx].next ].str_size) {
119	0	0	if(key_size > nodes[ nodes[idx].prev ].str_size) {
141	0	21	mctree_node_add(mctree);
151	0	1	if(nodes[idx].next) {
163	0	1	mctree_node_add(mctree);
173	0	0	if(nodes[idx].prev) {
185	0	0	mctree_node_add(mctree);
194	2	0	while (idx)
196	1	1	if(key_size == nodes[idx].str_size) {
197	0	1	if(memcmp((const void *)key, (const void *)nodes[idx].str, key_size) == 0)
199	0	0	if(value)
205	1	0	if(nodes[idx].child == 0) {
206	0	1	if(b_insert)
214	1	0	else if(key_size > nodes[idx].str_size)
216	0	1	if(nodes[idx].next == 0 || key_size < nodes[ nodes[idx].next ].str_size) {
	0	0	if(nodes[idx].next == 0 || key_size < nodes[ nodes[idx].next ].str_size) {
217	0	1	if(b_insert)
226	0	0	if(nodes[idx].prev == 0 || key_size > nodes[ nodes[idx].prev ].str_size) {
	0	0	if(nodes[idx].prev == 0 || key_size > nodes[ nodes[idx].prev ].str_size) {
227	0	0	if(b_insert)
244	22	0	if(key_size > 0) {
247	2	20	if(start[idx].child) {
251	0	20	if(b_insert)
265	0	0	if(key_size > 0) {
268	0	0	if(start[idx].child) {
280	96	0	if(key_size > 0) {
283	8	88	if(start[idx].child) {