Branch Coverage

third_party/modest/source/modest/finder/thread.c
Criterion Covered Total %
branch 0 116 0.0


line true false branch
50 0 0 if(finder_thread->entry_obj == NULL)
54 0 0 if(mcstatus)
59 0 0 if(finder_thread->declaration_obj == NULL)
63 0 0 if(mcstatus)
67 0 0 if(finder_thread->context_list == NULL)
76 0 0 if(finder_thread->thread == NULL)
80 0 0 if(status) {
88 0 0 for(size_t i = 0; i < finder_thread->thread->entries_size; i++) {
98 0 0 for(size_t i = 1; i < finder_thread->context_list_size; i++) {
106 0 0 if(finder_thread == NULL)
110 0 0 if(finder_thread->thread) {
118 0 0 if(finder_thread->context_list) {
125 0 0 if(self_destroy) {
137 0 0 while(dec) {
138 0 0 if(dec->entry)
207 0 0 if(finder_thread->finder == NULL)
218 0 0 while(node) {
219 0 0 for(size_t i = 0; i < finder_thread->thread->entries_length; i++)
224 0 0 while(entry) {
225 0 0 if(entry->node == node)
227 0 0 if(entry->next)
232 0 0 if(entry->prev)
244 0 0 if(node->child)
247 0 0 while(node != scope_node && node->next == NULL)
0 0 while(node != scope_node && node->next == NULL)
250 0 0 if(node == scope_node)
262 0 0 for (size_t idx = 0; idx < finder_thread->thread->entries_length; idx++) {
263 0 0 while((finder_thread->thread->entries[idx].context.opt & MyTHREAD_OPT_DONE) == 0) {
276 0 0 if(ctx == NULL)
281 0 0 for(size_t i = 0; i < count; i++) {
284 0 0 if(mcstatus) {
285 0 0 while(i) {
295 0 0 for(size_t i = 0; i < count; i++) {
298 0 0 if(mcstatus) {
300 0 0 while(t > 1) {
305 0 0 while(i > 1) {
320 0 0 if(spec_f->x > spec_t->x)
322 0 0 else if(spec_f->x < spec_t->x)
325 0 0 if(spec_f->a > spec_t->a)
327 0 0 else if(spec_f->a < spec_t->a)
330 0 0 if(spec_f->b > spec_t->b)
332 0 0 else if(spec_f->b < spec_t->b)
335 0 0 if(spec_f->c > spec_t->c)
337 0 0 else if(spec_f->c < spec_t->c)
348 0 0 if(entry->declaration == NULL) {
362 0 0 while(thr_dec) {
363 0 0 if(thr_dec->entry->type == dec_entry->type)
365 0 0 if(modest_finder_thread_spec_is_up(raw_spec, &thr_dec->raw_spec)) {
393 0 0 while(dec_entry) {
407 0 0 if(thread_context->entry_last) {
410 0 0 while(entry)
412 0 0 if(entry->node == node) {
428 0 0 if(thread_context->entry_last) {
443 0 0 while(selector_list)
445 0 0 for(size_t i = 0; i < selector_list->entries_list_length; i++) {
469 0 0 while(selector_list) {
470 0 0 for(size_t i = 0; i < selector_list->entries_list_length; i++) {
472 0 0 if(count == counnt_done) {