MONITORED SOURCE FILE : msdos.c
11 0 63 FUNCTION is_extended_partition()
11 67 return ( ( ( * ( & p -> sys_ind ) ) ) == 5 ||..
*** TER 100% ( 2/ 2) of FUNCTION is_extended_partition()
1 1 81 FUNCTION extended_partition()
3 0 96 while (1)
0 3 97 if (++ loopct > 100)
0 98 return
0 3 99 if (( current_minor & mask ) == 0)
0 100 return
0 3 101 if (! ( bh = bread ( dev , 0 , get_ptable_b..
0 102 return
0 3 104 if (( * ( __u16 * ) ( bh -> b_data + 510 ) ..
0 105 goto done
12 3 123 for (;i < 4;)
9 3 124 if (! ( { __typeof__ ( p -> nr_sects ) __..
2 124 !(T) || T
7 124 !(F) || _
3 124 !(T) || F
9 125 continue
0 3 133 if (i >= 2 && ( { __typeof__ ( p -> start..
0 133 T && T && (T || _)
0 133 T && T && (F || T)
0 133 T && T && (F || F)
0 133 T && F && (_ || _)
3 133 F && _ && (_ || _)
0 134 continue
0 3 147 if (( current_minor & mask ) == 0)
0 148 goto done
8 1 161 for (;i < 4;)
2 6 162 if (( { __typeof__ ( p -> nr_sects ) __a ..
2 162 (T) && T
3 162 (T) && F
3 162 (F) && _
2 163 break
1 2 164 if (i == 4)
1 165 goto done
*** TER 62% ( 28/ 45) of FUNCTION extended_partition()
0 0 180 FUNCTION get_partition_table_block()
0 182 return bread ( dev , blocknr , get_ptable_blo..
*** TER 0% ( 0/ 2) of FUNCTION get_partition_table_block()
1 0 355 FUNCTION msdos_partition()
0 1 368 if (! ( bh = bread ( dev , 0 , get_ptable_blo..
0 0 369 if (warn_no_part)
0 370 return - 1
0 1 377 if (* ( unsigned short * ) ( 0x1fe + data ) !..
0 379 return 0
1 0 384 if (! tested_for_xlate ++)
1 0 397 for (;i < 4;)
1 0 399 if (( { __typeof__ ( q -> nr_sects ) __a ..
1 0 401 if (( q -> sector & 63 ) == 1 && ( q ->..
1 401 T && T
0 401 T && F
0 401 F && _
1 403 break
0 1 406 if (( ( * ( & p -> sys_ind ) ) ) == 0x55)
0 0 410 if (ide_xlate_1024 ( dev , - 1 , heads , ..
0 412 goto check_table
0 1 414 else if (( ( * ( & p -> sys_ind ) ) ) == 0x..
0 0 420 if (ide_xlate_1024 ( dev , 1 , heads , " ..
0 422 goto read_mbr
0 1 426 else if (sig <= 0x1ae && data [ sig ] == 0x..
0 426 T && T && T && (T)
0 426 T && T && T && (F)
0 426 T && T && F && (_)
1 426 T && F && _ && (_)
0 426 F && _ && _ && (_)
0 1 430 else if (( ( * ( & p -> sys_ind ) ) ) == 0x..
0 430 T || _
0 430 F || T
1 430 F || F
435 else
4 1 446 for (;i <= 4;)
3 1 447 if (! ( { __typeof__ ( p -> nr_sects ) __a ..
3 448 continue
1 0 456 if (is_extended_partition ( p ))
1 0 470 if (hd -> part [ minor ] . nr_sects > 2)
0 1 478 if (* ( unsigned short * ) ( data + 0xfc ) ==..
0 0 480 for (;i < 16;)
0 0 482 if (( current_minor & mask ) == 0)
0 483 break
0 0 484 if (! ( ( { __typeof__ ( p -> start_sect ..
0 484 !((T) && (F))
0 484 !((F) && (_))
0 484 !((T) && (T))
0 485 continue
4 1 494 for (;i <= 4;)
3 1 495 if (! ( { __typeof__ ( p -> nr_sects ) __a ..
3 496 continue
1 514 return 1
*** TER 41% ( 29/ 71) of FUNCTION msdos_partition()
*** TER 49% ( 59/120) of SOURCE FILE msdos.c
MONITORED SOURCE FILE : dma.c
0 0 68 FUNCTION get_dma_list()
0 0 72 for (;i < 8;)
0 0 73 if (dma_chan_busy [ i ] . lock)
0 79 return len
*** TER 0% ( 0/ 6) of FUNCTION get_dma_list()
1 0 83 FUNCTION request_dma()
0 1 85 if (dmanr >= 8)
0 86 return - 22
0 1 88 if (( ( __typeof__ ( * ( & dma_chan_busy [ dm..
0 89 return - 16
1 94 return 0
*** TER 50% ( 4/ 8) of FUNCTION request_dma()
1 1 98 FUNCTION free_dma()
0 1 100 if (dmanr >= 8)
0 102 return
0 1 105 if (( ( __typeof__ ( * ( & dma_chan_busy [ dm..
0 107 return
*** TER 43% ( 3/ 7) of FUNCTION free_dma()
*** TER 33% ( 7/ 21) of SOURCE FILE dma.c
MONITORED SOURCE FILE : filemap.c
3E5 3E5 58 FUNCTION add_page_to_hash_queue()
8E4 2E5 65 if (next)
0 3E5 67 if (page -> buffers)
68 do
68 do
0 0 68 do-while (0)
0 0 68 do-while (0)
*** TER 44% ( 4/ 9) of FUNCTION add_page_to_hash_queue()
3E5 3E5 72 FUNCTION add_page_to_inode_queue()
*** TER 100% ( 1/ 1) of FUNCTION add_page_to_inode_queue()
3E5 3E5 81 FUNCTION remove_page_from_inode_queue()
*** TER 100% ( 1/ 1) of FUNCTION remove_page_from_inode_queue()
3E5 3E5 90 FUNCTION remove_page_from_hash_queue()
3E4 3E5 95 if (next)
*** TER 100% ( 3/ 3) of FUNCTION remove_page_from_hash_queue()
3E5 3E5 107 FUNCTION __remove_inode_page()
0 3E5 109 if (( __builtin_constant_p ( 4 ) ? constant_t..
109 do
0 0 109 do-while (0)
*** TER 40% ( 2/ 5) of FUNCTION __remove_inode_page()
2E5 2E5 115 FUNCTION remove_inode_page()
0 2E5 117 if (! ( __builtin_constant_p ( 0 ) ? constant..
118 do
118 do
0 0 118 do-while (0)
0 0 118 do-while (0)
122 do
0 2E5 122 do-while (0)
*** TER 33% ( 3/ 9) of FUNCTION remove_inode_page()
1E3 0 125 FUNCTION sync_page()
1E3 0 129 if (mapping && mapping -> a_ops && mapping ->..
1E3 129 T && T && T
0 129 T && T && F
0 129 T && F && _
0 129 F && _ && _
1E3 130 return mapping -> a_ops -> sync_page ( page )
0 131 return 0
*** TER 44% ( 4/ 9) of FUNCTION sync_page()
1E4 1E4 137 FUNCTION __set_page_dirty()
144 do
0 1E4 144 do-while (0)
*** TER 67% ( 2/ 3) of FUNCTION __set_page_dirty()
0 0 157 FUNCTION invalidate_inode_pages()
0 0 168 while (curr != head)
0 0 173 if (( ( & ( page ) -> count ) -> counter ) ..
0 174 continue
0 0 177 if (( __builtin_constant_p ( 4 ) ? constant..
0 178 continue
0 0 181 if (test_and_set_bit ( 0 , & ( page ) -> fl..
0 182 continue
186 do
0 0 186 if (! test_and_clear_bit ( 0 , & ( page )..
186 do
0 0 186 do-while (0)
0 0 186 if (waitqueue_active ( & page -> wait ))
0 0 186 do-while (0)
190 do
0 0 190 do-while (0)
191 do
0 0 191 do-while (0)
*** TER 0% ( 0/ 24) of FUNCTION invalidate_inode_pages()
1E4 1E4 194 FUNCTION truncate_partial_page()
1E4 0 198 if (page -> buffers)
*** TER 67% ( 2/ 3) of FUNCTION truncate_partial_page()
2E5 2E5 203 FUNCTION truncate_complete_page()
2E5 0 206 if (! page -> buffers || block_flushpage ( pa..
5E3 206 T || _
2E5 206 F || T
0 206 F || F
*** TER 67% ( 4/ 6) of FUNCTION truncate_complete_page()
3E5 0 223 FUNCTION truncate_list_pages()
4E7 5E4 229 while (curr != head)
2E5 4E7 237 if (( offset >= start ) || ( * partial && (..
2E5 237 (T) || (_ && _)
1E4 237 (F) || (T && T)
1E5 237 (F) || (T && F)
4E7 237 (F) || (F && _)
0 2E5 238 if (test_and_set_bit ( 0 , & ( page ) -> ..
240 do
0 0 240 do-while (0)
0 243 return 1
246 do
0 2E5 246 do-while (0)
1E4 2E5 248 if (* partial && ( offset + 1 ) == start)
1E4 248 T && T
1E5 248 T && F
1E5 248 F && _
251 else
254 do
0 2E5 254 if (! test_and_clear_bit ( 0 , & ( page..
254 do
0 0 254 do-while (0)
0 2E5 254 if (waitqueue_active ( & page -> wait ))
0 2E5 254 do-while (0)
2E5 256 return 1
5E4 259 return 0
*** TER 68% ( 21/ 31) of FUNCTION truncate_list_pages()
1E4 1E4 272 FUNCTION truncate_inode_pages()
2E5 1E4 279 if (truncate_list_pages ( & mapping -> clean_..
2E5 280 goto repeat
0 1E4 281 if (truncate_list_pages ( & mapping -> dirty_..
0 282 goto repeat
0 1E4 283 if (truncate_list_pages ( & mapping -> locked..
0 284 goto repeat
285 do
0 1E4 285 do-while (0)
*** TER 58% ( 7/ 12) of FUNCTION truncate_inode_pages()
2E6 0 288 FUNCTION __find_page_nolock()
2E6 290 goto inside
2E5 0 292 for (;1;)
7E5 1E6 295 if (! page)
7E5 296 goto not_found
2E5 1E6 297 if (page -> mapping != mapping)
2E5 298 continue
1E6 982 299 if (page -> index == offset)
1E6 300 break
8E3 1E6 308 if (inactive_shortage ( ) > ( ( ( memory_pres..
8E3 308 T && T
2E3 308 T && F
1E6 308 F && _
2E6 311 return page
*** TER 95% ( 18/ 19) of FUNCTION __find_page_nolock()
0 0 320 FUNCTION writeout_one_page()
325 do
0 0 326 if (( ( ( bh ) -> b_state & ( 1UL << 2 ) ) ..
0 326 (T) || !(_) || !(_)
0 326 (F) || !(T) || !(F)
0 326 (F) || !(F) || !(_)
0 326 (F) || !(T) || !(T)
0 327 continue
0 0 331 do-while (( bh = bh -> b_this_page ) != head)
0 332 return 0
*** TER 0% ( 0/ 11) of FUNCTION writeout_one_page()
0 0 335 FUNCTION waitfor_one_page()
341 do
0 0 343 if (( ( ( bh ) -> b_state & ( 1UL << 3 ) ) ..
0 343 (T) && !(F)
0 343 (T) && !(T)
0 343 (F) && !(_)
0 0 345 do-while (( bh = bh -> b_this_page ) != head)
0 346 return error
*** TER 0% ( 0/ 9) of FUNCTION waitfor_one_page()
0 0 349 FUNCTION do_buffer_fdatasync()
0 0 357 while (curr != head)
0 0 360 if (! page -> buffers)
0 361 continue
0 0 362 if (page -> index >= end)
0 363 continue
0 0 364 if (page -> index < start)
0 365 continue
368 do
0 0 368 do-while (0)
0 0 372 if (page -> buffers)
375 do
0 0 375 if (! test_and_clear_bit ( 0 , & ( page )..
375 do
0 0 375 do-while (0)
0 0 375 if (waitqueue_active ( & page -> wait ))
0 0 375 do-while (0)
380 do
0 0 380 do-while (0)
0 382 return retval
*** TER 0% ( 0/ 27) of FUNCTION do_buffer_fdatasync()
0 0 389 FUNCTION generic_buffer_fdatasync()
0 403 return retval
*** TER 0% ( 0/ 2) of FUNCTION generic_buffer_fdatasync()
3E3 3E3 413 FUNCTION filemap_fdatasync()
1E4 3E3 419 while (! list_empty ( & mapping -> dirty_page..
519 1E4 425 if (! ( __builtin_constant_p ( 4 ) ? consta..
519 426 continue
429 do
0 1E4 429 do-while (0)
1E4 0 433 if (( __builtin_constant_p ( 4 ) ? constant..
436 else
437 do
0 0 437 if (! test_and_clear_bit ( 0 , & ( page..
437 do
0 0 437 do-while (0)
0 0 437 if (waitqueue_active ( & page -> wait ))
0 0 437 do-while (0)
442 do
0 3E3 442 do-while (0)
*** TER 45% ( 9/ 20) of FUNCTION filemap_fdatasync()
3E3 3E3 452 FUNCTION filemap_fdatawait()
1E4 3E3 456 while (! list_empty ( & mapping -> locked_pag..
1E4 365 462 if (! ( __builtin_constant_p ( 0 ) ? consta..
1E4 463 continue
466 do
0 365 466 do-while (0)
473 do
0 3E3 473 do-while (0)
*** TER 80% ( 8/ 10) of FUNCTION filemap_fdatawait()
1E3 1E3 482 FUNCTION add_to_page_cache_locked()
0 1E3 484 if (! ( __builtin_constant_p ( 0 ) ? constant..
485 do
0 0 485 do-while (0)
493 do
0 1E3 493 do-while (0)
*** TER 43% ( 3/ 7) of FUNCTION add_to_page_cache_locked()
3E5 3E5 500 FUNCTION __add_to_page_cache()
0 3E5 506 if (( __builtin_constant_p ( 0 ) ? constant_t..
507 do
0 0 507 do-while (0)
*** TER 40% ( 2/ 5) of FUNCTION __add_to_page_cache()
0 0 518 FUNCTION add_to_page_cache()
522 do
0 0 522 do-while (0)
*** TER 0% ( 0/ 3) of FUNCTION add_to_page_cache()
3E5 0 525 FUNCTION add_to_page_cache_unique()
3E5 0 536 if (! alias)
541 do
0 3E5 541 do-while (0)
3E5 542 return err
*** TER 67% ( 4/ 6) of FUNCTION add_to_page_cache_unique()
1E4 0 549 FUNCTION page_cache_read()
558 do
0 1E4 558 do-while (0)
571 1E4 559 if (page)
571 560 return 0
0 1E4 563 if (! page)
0 564 return - 12
1E4 0 566 if (! add_to_page_cache_unique ( page , mappi..
1E4 569 return error
0 576 return 0
*** TER 62% ( 8/ 13) of FUNCTION page_cache_read()
1E3 0 583 FUNCTION read_cluster_nonblocking()
1E4 1E3 589 while (( pages -- > 0 ) && ( offset < filesiz..
1E4 589 (T) && (T)
224 589 (T) && (F)
868 589 (F) && (_)
0 1E4 591 if (error < 0)
0 592 return error
1E3 596 return 0
*** TER 80% ( 8/ 10) of FUNCTION read_cluster_nonblocking()
720 720 606 FUNCTION ___wait_on_page()
612 do
614 do
0 1E3 614 do-while (0)
115 923 615 if (! ( __builtin_constant_p ( 0 ) ? consta..
115 616 break
318 605 619 do-while (( __builtin_constant_p ( 0 ) ? cons..
*** TER 88% ( 7/ 8) of FUNCTION ___wait_on_page()
490 490 628 FUNCTION __lock_page()
789 0 634 for (;1;)
636 do
0 789 636 do-while (0)
299 490 637 if (( __builtin_constant_p ( 0 ) ? constant..
299 640 continue
490 0 642 if (! test_and_set_bit ( 0 , & ( page ) -> ..
490 643 break
*** TER 73% ( 8/ 11) of FUNCTION __lock_page()
6E5 6E5 654 FUNCTION lock_page()
490 6E5 656 if (test_and_set_bit ( 0 , & ( page ) -> flag..
*** TER 100% ( 3/ 3) of FUNCTION lock_page()
5E4 0 664 FUNCTION __find_get_page()
4E4 1E3 675 if (page)
677 do
0 5E4 677 do-while (0)
5E4 678 return page
*** TER 83% ( 5/ 6) of FUNCTION __find_get_page()
8E5 0 684 FUNCTION __find_lock_page()
5E5 3E5 696 if (page)
698 do
0 5E5 698 do-while (0)
5E5 0 703 if (page -> mapping)
5E5 704 return page
707 do
0 0 707 if (! test_and_clear_bit ( 0 , & ( page )..
707 do
0 0 707 do-while (0)
0 0 707 if (waitqueue_active ( & page -> wait ))
0 0 707 do-while (0)
0 709 goto repeat
711 do
0 3E5 711 do-while (0)
3E5 712 return ( ( void * ) 0 )
*** TER 40% ( 8/ 20) of FUNCTION __find_lock_page()
52 8 733 FUNCTION drop_behind()
44 8 742 if (! index)
44 743 return
1 7 745 if (index > file -> f_rawin)
747 else
25 1 757 while (-- index >= start)
7 18 760 if (! page)
7 761 break
764 do
0 8 764 do-while (0)
*** TER 92% ( 12/ 13) of FUNCTION drop_behind()
1E6 0 885 FUNCTION get_max_readahead()
0 1E6 887 if (! inode -> i_dev || ! max_readahead [ ( (..
0 887 T || _
0 887 F || T
1E6 887 F || F
0 888 return 31
1E6 889 return max_readahead [ ( ( unsigned int ) ( (..
*** TER 50% ( 4/ 8) of FUNCTION get_max_readahead()
7E5 0 892 FUNCTION generic_file_readahead()
321 7E5 913 if (( __builtin_constant_p ( 0 ) ? constant_t..
309 12 914 if (! filp -> f_ralen || index >= raend || ..
309 914 T || _ || _
0 914 F || T || _
0 914 F || F || T
12 914 F || F || F
229 80 916 if (raend < end_index)
262 47 920 if (! max_ahead)
70 7E5 935 else if (reada_ok && filp -> f_ramax && raend..
70 935 T && T && T && T && T
16 935 T && T && T && T && F
0 935 T && T && T && F && _
1E4 935 T && T && F && _ && _
2E3 935 T && F && _ && _ && _
7E5 935 F && _ && _ && _ && _
5 65 943 if (raend < end_index)
5 65 946 if (max_ahead)
148 7E5 958 while (ahead < max_ahead)
22 126 960 if (( raend + ahead ) >= end_index)
22 961 break
0 126 962 if (page_cache_read ( filp , raend + ahead ..
0 963 break
52 7E5 976 if (ahead)
5 47 977 if (reada_ok == 2)
0 52 987 if (filp -> f_ramax > max_readahead)
7E5 1001 return
*** TER 85% ( 34/ 40) of FUNCTION generic_file_readahead()
3E5 3E5 1013 FUNCTION do_generic_file_read()
3E5 8E3 1034 if (index > filp -> f_raend || index + filp -..
3E5 1034 T || _
3 1034 F || T
8E3 1034 F || F
1040 else
2E3 3E5 1050 if (! index && offset + desc -> count <= ( ( ..
2E3 1050 T && T
5E3 1050 T && F
3E5 1050 F && _
1052 else
3E5 558 1057 if (filp -> f_ramax < needed)
4E3 3E5 1060 if (reada_ok && filp -> f_ramax < 3)
4E3 1060 T && T
1E3 1060 T && F
3E5 1060 F && _
954 3E5 1062 if (filp -> f_ramax > max_readahead)
7E5 0 1066 for (;1;)
0 7E5 1071 if (index > end_index)
0 1072 break
1E5 6E5 1074 if (index == end_index)
661 1E5 1076 if (nr <= offset)
661 1077 break
2E4 7E5 1089 if (! page)
2E4 1090 goto no_cached_page
1093 do
0 7E5 1093 do-while (0)
1E5 6E5 1095 if (! ( __builtin_constant_p ( 3 ) ? consta..
1E5 1096 goto page_not_up_to_date
0 7E5 1103 if (mapping -> i_mmap_shared != ( ( void * ..
1104 do
0 0 1104 do-while (0)
4E5 3E5 1122 if (nr && desc -> count)
4E5 1122 T && T
3E5 1122 T && F
0 1122 F && _
4E5 1123 continue
3E5 1124 break
0 1E5 1132 if (( __builtin_constant_p ( 3 ) ? constant..
0 1133 goto page_ok
0 1E5 1139 if (! page -> mapping)
1140 do
0 0 1140 if (! test_and_clear_bit ( 0 , & ( page..
1140 do
0 0 1140 do-while (0)
0 0 1140 if (waitqueue_active ( & page -> wait ))
0 0 1140 do-while (0)
0 1142 continue
2 1E5 1146 if (( __builtin_constant_p ( 3 ) ? constant..
1147 do
0 2 1147 if (! test_and_clear_bit ( 0 , & ( page..
1147 do
0 0 1147 do-while (0)
0 2 1147 if (waitqueue_active ( & page -> wait ))
0 2 1147 do-while (0)
2 1148 goto page_ok
1E5 0 1155 if (! error)
1E5 318 1156 if (( __builtin_constant_p ( 3 ) ? consta..
1E5 1157 goto page_ok
318 0 1162 if (( __builtin_constant_p ( 3 ) ? consta..
318 1163 goto page_ok
0 1170 break
2E4 0 1179 if (! cached_page)
1180 do
0 2E4 1180 do-while (0)
0 2E4 1182 if (! cached_page)
0 1184 break
0 2E4 1193 if (page)
0 1194 goto found_page
1202 do
0 2E4 1202 do-while (0)
2E4 1205 goto readpage
0 3E5 1210 if (cached_page)
*** TER 63% ( 62/ 98) of FUNCTION do_generic_file_read()
7E5 0 1215 FUNCTION file_read_actor()
1E5 5E5 1220 if (size > count)
1225 do
0 7E5 1225 do-while (0)
0 7E5 1227 if (left)
7E5 1234 return size
*** TER 75% ( 6/ 8) of FUNCTION file_read_actor()
3E5 0 1241 FUNCTION generic_file_read()
3E5 0 1246 if (( ( { unsigned long flag , sum ;asm ( "ad..
3E5 0 1249 if (count)
136 3E5 1259 if (! retval)
3E5 1263 return retval
*** TER 75% ( 6/ 8) of FUNCTION generic_file_read()
0 0 1266 FUNCTION file_send_actor()
0 0 1274 if (size > count)
1281 do
0 0 1281 do-while (0)
0 0 1283 if (written < 0)
0 1289 return written
*** TER 0% ( 0/ 8) of FUNCTION file_send_actor()
0 0 1292 FUNCTION sys_sendfile()
0 0 1303 if (! in_file)
0 1304 goto out
0 0 1305 if (! ( in_file -> f_mode & 1 ))
0 1306 goto fput_in
0 0 1309 if (! in_inode)
0 1310 goto fput_in
0 0 1311 if (! in_inode -> i_mapping -> a_ops -> readp..
0 1312 goto fput_in
0 0 1314 if (retval)
0 1315 goto fput_in
0 0 1322 if (! out_file)
0 1323 goto fput_in
0 0 1324 if (! ( out_file -> f_mode & 2 ))
0 1325 goto fput_out
0 0 1327 if (! out_file -> f_op || ! out_file -> f_op ..
0 1327 T || _
0 1327 F || T
0 1327 F || F
0 1328 goto fput_out
0 0 1331 if (retval)
0 1332 goto fput_out
0 0 1335 if (count)
0 0 1341 if (offset)
0 0 1342 if (( { int __ret_gu , __val_gu ;switch (..
0 1343 goto fput_out
0 0 1354 if (! retval)
0 0 1356 if (offset)
0 1365 return retval
*** TER 0% ( 0/ 43) of FUNCTION sys_sendfile()
0 0 1373 FUNCTION nopage_sequential_readahead()
0 0 1382 if (vma -> vm_raend == 0)
0 0 1390 if (( pgoff + ( ra_window >> 1 ) ) == vma -> ..
0 0 1394 if (end > ( ( vma -> vm_end >> 12 ) + vma -..
0 0 1396 if (start > end)
0 1397 return
0 0 1399 while (( start < end ) && ( start < filesiz..
0 1399 (T) && (T)
0 1399 (T) && (F)
0 1399 (F) && (_)
0 0 1401 if (read_cluster_nonblocking ( vma -> vm_..
0 1402 break
0 0 1409 if (vma -> vm_raend > ( vma -> vm_pgoff + r..
0 1420 return
*** TER 0% ( 0/ 21) of FUNCTION nopage_sequential_readahead()
4E4 0 1431 FUNCTION filemap_nopage()
0 4E4 1449 if (( pgoff >= size ) && ( area -> vm_mm == g..
0 1449 (T) && (T)
0 1449 (T) && (F)
4E4 1449 (F) && (_)
0 1450 return ( ( void * ) 0 )
1E3 4E4 1458 if (! page)
1E3 1459 goto no_cached_page
408 4E4 1465 if (! ( __builtin_constant_p ( 3 ) ? constant..
408 1466 goto page_not_uptodate
0 4E4 1472 if (( ( area ) -> vm_flags & 0x00008000 ))
2E3 4E4 1480 if (no_share)
2E3 0 1483 if (new_page)
1485 do
0 2E3 1485 do-while (0)
1486 else
2E3 1489 return new_page
1492 do
0 4E4 1492 do-while (0)
4E4 1493 return old_page
1E3 0 1503 if (( pgoff < size ) && ! ( ( area ) -> vm_fl..
1E3 1503 (T) && !(F)
0 1503 (T) && !(T)
0 1503 (F) && !(_)
1505 else
1E3 0 1513 if (error >= 0)
1E3 1514 goto retry_find
0 0 1521 if (error == - 12)
0 1522 return ( ( struct page * ) ( - 1 ) )
0 1523 return ( ( void * ) 0 )
0 408 1529 if (! page -> mapping)
1530 do
0 0 1530 if (! test_and_clear_bit ( 0 , & ( page )..
1530 do
0 0 1530 do-while (0)
0 0 1530 if (waitqueue_active ( & page -> wait ))
0 0 1530 do-while (0)
0 1532 goto retry_all
408 0 1536 if (( __builtin_constant_p ( 3 ) ? constant_t..
1537 do
0 408 1537 if (! test_and_clear_bit ( 0 , & ( page )..
1537 do
0 0 1537 do-while (0)
1 407 1537 if (waitqueue_active ( & page -> wait ))
0 408 1537 do-while (0)
408 1538 goto success
0 0 1541 if (! mapping -> a_ops -> readpage ( file , p..
0 0 1543 if (( __builtin_constant_p ( 3 ) ? constant..
0 1544 goto success
0 0 1556 if (! page -> mapping)
1557 do
0 0 1557 if (! test_and_clear_bit ( 0 , & ( page )..
1557 do
0 0 1557 do-while (0)
0 0 1557 if (waitqueue_active ( & page -> wait ))
0 0 1557 do-while (0)
0 1559 goto retry_all
0 0 1563 if (( __builtin_constant_p ( 3 ) ? constant_t..
1564 do
0 0 1564 if (! test_and_clear_bit ( 0 , & ( page )..
1564 do
0 0 1564 do-while (0)
0 0 1564 if (waitqueue_active ( & page -> wait ))
0 0 1564 do-while (0)
0 1565 goto success
0 0 1568 if (! mapping -> a_ops -> readpage ( file , p..
0 0 1570 if (( __builtin_constant_p ( 3 ) ? constant..
0 1571 goto success
0 1579 return ( ( void * ) 0 )
*** TER 30% ( 28/ 92) of FUNCTION filemap_nopage()
1E4 0 1585 FUNCTION filemap_sync_pte()
9E3 1E3 1590 if (( ( pte ) . pte_low & ( 0x001 | 0x080 ) )..
9E3 1590 (T) && T
0 1590 (T) && F
1E3 1590 (F) && _
1E4 1595 return 0
*** TER 86% ( 6/ 7) of FUNCTION filemap_sync_pte()
14 0 1598 FUNCTION filemap_sync_pte_range()
0 14 1606 if (( ! ( ( * pmd ) . pmd ) ))
0 1607 return 0
0 14 1608 if (( ( ( ( * pmd ) . pmd ) & ( ~ ( ~ ( ( 1UL..
1610 do
0 0 1610 do-while (0)
0 1611 return 0
0 14 1617 if (end > ( 1UL << 22 ))
1620 do
1E4 14 1624 do-while (address && ( address < end ))
1E4 1624 T && (T)
14 1624 T && (F)
0 1624 F && (_)
14 1625 return error
*** TER 53% ( 9/ 17) of FUNCTION filemap_sync_pte_range()
14 0 1628 FUNCTION filemap_sync_pmd_range()
0 14 1636 if (pgd_none ( * pgd ))
0 1637 return 0
0 14 1638 if (pgd_bad ( * pgd ))
1640 do
0 0 1640 do-while (0)
0 1641 return 0
11 3 1647 if (end > ( 1UL << 22 ))
1650 do
0 14 1654 do-while (address && ( address < end ))
0 1654 T && (T)
14 1654 T && (F)
0 1654 F && (_)
14 1655 return error
*** TER 47% ( 8/ 17) of FUNCTION filemap_sync_pmd_range()
3 0 1658 FUNCTION filemap_sync()
1671 do
0 3 1671 do-while (0)
0 3 1672 if (address >= end)
1673 do
0 0 1673 do-while (0)
1674 do
11 3 1678 do-while (address && ( address < end ))
11 1678 T && (T)
3 1678 T && (F)
0 1678 F && (_)
1681 do
0 3 1681 do-while (0)
3 1683 return error
*** TER 60% ( 9/ 15) of FUNCTION filemap_sync()
2E3 0 1707 FUNCTION generic_file_mmap()
3 2E3 1713 if (( vma -> vm_flags & 0x00000008 ) && ( vma..
3 1713 (T) && (T)
0 1713 (T) && (F)
2E3 1713 (F) && (_)
0 3 1714 if (! inode -> i_mapping -> a_ops -> writep..
0 1715 return - 22
0 2E3 1718 if (! inode -> i_sb || ! ( ( ( inode -> i_mod..
0 1718 T || !(_)
0 1718 F || !(F)
2E3 1718 F || !(T)
0 1719 return - 13
0 2E3 1720 if (! inode -> i_mapping -> a_ops -> readpage)
0 1721 return - 8
2E3 1724 return 0
*** TER 53% ( 10/ 19) of FUNCTION generic_file_mmap()
3 0 1731 FUNCTION msync_interval()
3 0 1735 if (file && ( vma -> vm_flags & 0x00000008 ))
3 1735 T && (T)
0 1735 T && (F)
0 1735 F && (_)
3 0 1739 if (! error && ( flags & 4 ))
3 1739 T && (T)
0 1739 T && (F)
0 1739 F && (_)
3 0 1743 if (file -> f_op && file -> f_op -> fsync)
3 1743 T && T
0 1743 T && F
0 1743 F && _
3 1748 return error
0 1750 return 0
*** TER 44% ( 8/ 18) of FUNCTION msync_interval()
3 0 1753 FUNCTION sys_msync()
0 3 1760 if (start & ~ ( ~ ( ( 1UL << 12 ) - 1 ) ))
0 1761 goto out
0 3 1764 if (end < start)
0 1765 goto out
0 3 1766 if (flags & ~ ( 1 | 2 | 4 ))
0 1767 goto out
0 3 1769 if (end == start)
0 1770 goto out
3 0 1777 for (;1;)
0 3 1780 if (! vma)
0 1781 goto out
0 3 1783 if (start < vma -> vm_start)
3 0 1788 if (end <= vma -> vm_end)
3 0 1789 if (start < end)
0 3 1791 if (error)
0 1792 goto out
3 1795 goto out
0 0 1799 if (error)
0 1800 goto out
3 1806 return error
*** TER 41% ( 13/ 32) of FUNCTION sys_msync()
0 0 1809 FUNCTION setup_read_behavior()
1813 switch ( behavior )
0 1814 case 0x2:
0 1816 break
0 1817 case 0x1:
0 1819 break
0 1820 default:
0 1821 break
0 1823 return
*** TER 0% ( 0/ 8) of FUNCTION setup_read_behavior()
0 0 1826 FUNCTION madvise_fixup_start()
0 0 1832 if (! n)
0 1833 return - 11
0 0 1839 if (n -> vm_ops && n -> vm_ops -> open)
0 1839 T && T
0 1839 T && F
0 1839 F && _
1846 do
0 0 1846 do-while (0)
0 1848 return 0
*** TER 0% ( 0/ 12) of FUNCTION madvise_fixup_start()
0 0 1851 FUNCTION madvise_fixup_end()
0 0 1857 if (! n)
0 1858 return - 11
0 0 1865 if (n -> vm_ops && n -> vm_ops -> open)
0 1865 T && T
0 1865 T && F
0 1865 F && _
1871 do
0 0 1871 do-while (0)
0 1873 return 0
*** TER 0% ( 0/ 12) of FUNCTION madvise_fixup_end()
0 0 1876 FUNCTION madvise_fixup_middle()
0 0 1882 if (! left)
0 1883 return - 11
0 0 1885 if (! right)
0 1887 return - 11
0 0 1898 if (vma -> vm_ops && vma -> vm_ops -> open)
0 1898 T && T
0 1898 T && F
0 1898 F && _
1911 do
0 0 1911 do-while (0)
0 1913 return 0
*** TER 0% ( 0/ 15) of FUNCTION madvise_fixup_middle()
0 0 1920 FUNCTION madvise_behavior()
0 0 1926 if (vma -> vm_mm -> map_count > ( 65536 ))
0 1927 return - 12
0 0 1929 if (start == vma -> vm_start)
0 0 1930 if (end == vma -> vm_end)
1933 else
1935 else
0 0 1936 if (end == vma -> vm_end)
1938 else
0 1942 return error
*** TER 0% ( 0/ 11) of FUNCTION madvise_behavior()
0 0 1949 FUNCTION madvise_willneed()
0 0 1957 if (! vma -> vm_file)
0 1958 return error
0 0 1964 if (end > vma -> vm_end)
0 0 1972 if (( vma -> vm_mm -> rss + ( end - start ) )..
0 1973 return error
0 0 1976 if (! ( ( vma ) -> vm_flags & 0x00010000 ))
0 0 1980 while (( start < end ) && ( start < size ))
0 1980 (T) && (T)
0 1980 (T) && (F)
0 1980 (F) && (_)
0 0 1983 if (error < 0)
0 1984 break
1986 else
0 0 1987 while (( start < end ) && ( start < size ))
0 1987 (T) && (T)
0 1987 (T) && (F)
0 1987 (F) && (_)
0 0 1990 if (error < 0)
0 1991 break
0 1998 return error
*** TER 0% ( 0/ 28) of FUNCTION madvise_willneed()
0 0 2020 FUNCTION madvise_dontneed()
0 0 2023 if (vma -> vm_flags & 0x00002000)
0 2024 return - 22
2026 do
0 0 2026 do-while (0)
0 2029 return 0
*** TER 0% ( 0/ 7) of FUNCTION madvise_dontneed()
0 0 2032 FUNCTION madvise_vma()
2037 switch ( behavior )
0 2038 case 0x0:
0 2039 case 0x2:
0 2040 case 0x1:
0 2042 break
0 2044 case 0x3:
0 2046 break
0 2048 case 0x4:
0 2050 break
0 2052 default:
0 2054 break
0 2057 return error
*** TER 0% ( 0/ 12) of FUNCTION madvise_vma()
0 0 2094 FUNCTION sys_madvise()
0 0 2103 if (start & ~ ( ~ ( ( 1UL << 12 ) - 1 ) ))
0 2104 goto out
0 0 2107 if (end < start)
0 2108 goto out
0 0 2111 if (end == start)
0 2112 goto out
0 0 2119 for (;1;)
0 0 2122 if (! vma)
0 2123 goto out
0 0 2126 if (start < vma -> vm_start)
0 0 2132 if (end <= vma -> vm_end)
0 0 2133 if (start < end)
0 0 2136 if (error)
0 2137 goto out
0 2140 goto out
0 0 2145 if (error)
0 2146 goto out
0 2153 return error
*** TER 0% ( 0/ 29) of FUNCTION sys_madvise()
0 0 2162 FUNCTION mincore_page()
0 0 2171 if (( page ) && ( ( __builtin_constant_p ( 3 ..
0 2171 (T) && ((T))
0 2171 (T) && ((F))
0 2171 (F) && ((_))
2173 do
0 0 2173 do-while (0)
0 2175 return present
*** TER 0% ( 0/ 9) of FUNCTION mincore_page()
0 0 2178 FUNCTION mincore_vma()
0 0 2185 if (! vma -> vm_file)
0 2186 return error
0 0 2189 if (end > vma -> vm_end)
0 0 2195 if (! tmp)
0 2196 return error
0 0 2202 for (;remaining > 0;)
0 0 2207 while (j < thispiece)
0 0 2210 if (( __builtin_constant_p ( thispiece ) ? ..
0 2212 break
0 2217 return error
*** TER 0% ( 0/ 17) of FUNCTION mincore_vma()
0 0 2245 FUNCTION sys_mincore()
0 0 2256 if (start & ~ ( ~ ( ( 1UL << 12 ) - 1 ) ))
0 2257 goto out
0 0 2260 if (end < start)
0 2261 goto out
0 0 2264 if (end == start)
0 2265 goto out
0 0 2272 for (;1;)
0 0 2275 if (! vma)
0 2276 goto out
0 0 2279 if (start < vma -> vm_start)
0 0 2285 if (end <= vma -> vm_end)
0 0 2286 if (start < end)
0 0 2289 if (error)
0 2290 goto out
0 2293 goto out
0 0 2298 if (error)
0 2299 goto out
0 2307 return error
*** TER 0% ( 0/ 29) of FUNCTION sys_mincore()
0 0 2311 FUNCTION __read_cache_page()
0 0 2321 if (! page)
0 0 2322 if (! cached_page)
0 0 2324 if (! cached_page)
0 2325 return ERR_PTR ( - 12 )
0 0 2328 if (add_to_page_cache_unique ( page , mappi..
0 2329 goto repeat
0 0 2332 if (err < 0)
0 0 2337 if (cached_page)
0 2339 return page
*** TER 0% ( 0/ 16) of FUNCTION __read_cache_page()
0 0 2346 FUNCTION read_cache_page()
0 0 2356 if (IS_ERR ( page ) || ( __builtin_constant_p..
0 2356 T || (_)
0 2356 F || (T)
0 2356 F || (F)
0 2357 goto out
0 0 2360 if (! page -> mapping)
2361 do
0 0 2361 if (! test_and_clear_bit ( 0 , & ( page )..
2361 do
0 0 2361 do-while (0)
0 0 2361 if (waitqueue_active ( & page -> wait ))
0 0 2361 do-while (0)
0 2363 goto retry
0 0 2365 if (( __builtin_constant_p ( 3 ) ? constant_t..
2366 do
0 0 2366 if (! test_and_clear_bit ( 0 , & ( page )..
2366 do
0 0 2366 do-while (0)
0 0 2366 if (waitqueue_active ( & page -> wait ))
0 0 2366 do-while (0)
0 2367 goto out
0 0 2370 if (err < 0)
0 2375 return page
*** TER 0% ( 0/ 32) of FUNCTION read_cache_page()
8E5 0 2378 FUNCTION __grab_cache_page()
3E5 5E5 2384 if (! page)
3E5 0 2385 if (! * cached_page)
0 3E5 2387 if (! * cached_page)
0 2388 return ( ( void * ) 0 )
0 3E5 2391 if (add_to_page_cache_unique ( page , mappi..
0 2392 goto repeat
8E5 2395 return page
*** TER 58% ( 7/ 12) of FUNCTION __grab_cache_page()
1E4 0 2402 FUNCTION grab_cache_page()
0 1E4 2406 if (cached_page)
1E4 2408 return page
*** TER 75% ( 3/ 4) of FUNCTION grab_cache_page()
4E5 4E5 2411 FUNCTION remove_suid()
0 4E5 2420 if (mode && ! capable ( 4 ))
0 2420 T && T
0 2420 T && F
4E5 2420 F && _
*** TER 50% ( 3/ 6) of FUNCTION remove_suid()
4E5 0 2442 FUNCTION generic_file_write()
0 4E5 2459 if (pos < 0)
0 2460 goto out
0 4E5 2463 if (err)
0 2465 goto out
70 4E5 2470 if (file -> f_flags & 02000)
0 4E5 2477 if (limit != ( ~ 0UL ))
0 0 2478 if (pos >= limit)
0 2480 goto out
0 0 2482 if (count > limit - pos)
4E5 0 2489 if (count)
8E5 4E5 2495 while (count)
3E5 4E5 2507 if (bytes > count)
0 8E5 2525 if (! page)
0 2526 break
0 8E5 2529 if (! ( __builtin_constant_p ( 0 ) ? consta..
2530 do
2530 do
0 0 2530 do-while (0)
0 0 2530 do-while (0)
0 8E5 2534 if (status)
0 2535 goto unlock
2538 do
0 8E5 2538 do-while (0)
0 8E5 2539 if (status)
0 2540 goto fail_write
8E5 0 2542 if (! status)
8E5 0 2545 if (status >= 0)
2553 do
0 8E5 2553 if (! test_and_clear_bit ( 0 , & ( page )..
2553 do
0 0 2553 do-while (0)
0 8E5 2553 if (waitqueue_active ( & page -> wait ))
0 8E5 2553 do-while (0)
4E5 3E5 2554 if (deactivate)
0 8E5 2558 if (status < 0)
0 2559 break
0 4E5 2563 if (cached_page)
27 4E5 2568 if (( status >= 0 ) && ( file -> f_flags & 01..
27 2568 (T) && (T)
4E5 2568 (T) && (F)
0 2568 (F) && (_)
4E5 2575 return err
2579 do
0 0 2579 do-while (0)
0 2580 goto unlock
*** TER 45% ( 30/ 67) of FUNCTION generic_file_write()
1 1 2583 FUNCTION page_cache_init()
4 1 2589 for (;( ( 1UL << 12 ) << order ) < htable_siz..
2592 do
14 1 2596 while (( tmp >>= 1UL ) != 0UL)
0 1 2601 do-while (page_hash_table == ( ( void * ) 0 )..
0 2601 T && T
0 2601 T && F
1 2601 F && _
0 1 2605 if (! page_hash_table)
*** TER 67% ( 8/ 12) of FUNCTION page_cache_init()
*** TER 37% (411/1108) of SOURCE FILE filemap.c
MONITORED SOURCE FILE : neighbour.c
0 0 96 FUNCTION neigh_blackhole()
0 99 return - 100
*** TER 0% ( 0/ 2) of FUNCTION neigh_blackhole()
15 0 108 FUNCTION neigh_rand_reach_time()
15 110 return ( net_random ( ) % base ) + ( base >> ..
*** TER 100% ( 2/ 2) of FUNCTION neigh_rand_reach_time()
0 0 114 FUNCTION neigh_forced_gc()
0 0 119 for (;i <= 0x1F;)
123 do
123 do
0 0 123 do-while (0)
0 0 123 do-while (0)
0 0 124 while (( n = * np ) != ( ( void * ) 0 ))
0 0 139 if (( ( & n -> refcnt ) -> counter ) == 1..
0 139 T && !(F) && (T || _)
0 139 T && !(F) && (F || T)
0 139 T && !(T) && (_ || _)
0 139 T && !(F) && (F || F)
0 139 F && !(_) && (_ || _)
143 do
0 0 143 do-while (0)
0 145 continue
147 do
0 0 147 do-while (0)
150 do
150 do
0 0 150 do-while (0)
150 do
0 0 150 do-while (0)
0 0 150 do-while (0)
0 154 return shrunk
*** TER 0% ( 0/ 28) of FUNCTION neigh_forced_gc()
0 0 157 FUNCTION neigh_del_timer()
0 0 159 if (n -> nud_state & ( 0x01 | 0x08 | 0x10 ))
0 0 160 if (del_timer ( & n -> timer ))
0 162 return 1
0 165 return 0
*** TER 0% ( 0/ 7) of FUNCTION neigh_del_timer()
0 0 168 FUNCTION pneigh_queue_purge()
0 0 172 while (( skb = skb_dequeue ( list ) ) != ( ( ..
*** TER 0% ( 0/ 3) of FUNCTION pneigh_queue_purge()
0 0 178 FUNCTION neigh_ifdown()
182 do
182 do
0 0 182 do-while (0)
0 0 182 do-while (0)
0 0 184 for (;i <= 0x1F;)
0 0 188 while (( n = * np ) != ( ( void * ) 0 ))
0 0 189 if (dev && n -> dev != dev)
0 189 T && T
0 189 T && F
0 189 F && _
0 191 continue
0 0 198 if (( ( & n -> refcnt ) -> counter ) != 1)
0 0 211 if (n -> nud_state & ( 0x80 | 0x40 | 0x..
213 else
215 do
0 0 215 do-while (0)
217 do
0 0 217 do-while (0)
223 do
223 do
0 0 223 do-while (0)
223 do
0 0 223 do-while (0)
0 0 223 do-while (0)
0 227 return 0
*** TER 0% ( 0/ 30) of FUNCTION neigh_ifdown()
0 0 230 FUNCTION neigh_alloc()
0 0 237 if (tbl -> entries > tbl -> gc_thresh3 || ( t..
0 237 T || (_ && _)
0 237 F || (T && T)
0 237 F || (T && F)
0 237 F || (F && _)
0 0 239 if (neigh_forced_gc ( tbl ) == 0 && tbl -> ..
0 239 T && T
0 239 T && F
0 239 F && _
0 240 return ( ( void * ) 0 )
0 0 244 if (n == ( ( void * ) 0 ))
0 245 return ( ( void * ) 0 )
0 264 return n
*** TER 0% ( 0/ 17) of FUNCTION neigh_alloc()
3 0 267 FUNCTION neigh_lookup()
276 do
276 do
0 3 276 do-while (0)
0 3 276 do-while (0)
0 3 277 for (;n;)
0 0 279 if (dev == n -> dev && __builtin_memcmp ( n..
0 279 T && T
0 279 T && F
0 279 F && _
0 281 break
284 do
284 do
0 3 284 do-while (0)
284 do
0 3 284 do-while (0)
0 3 284 do-while (0)
3 285 return n
*** TER 40% ( 8/ 20) of FUNCTION neigh_lookup()
0 0 288 FUNCTION neigh_create()
0 0 297 if (n == ( ( void * ) 0 ))
0 298 return ERR_PTR ( - 105 )
0 0 305 if (tbl -> constructor && ( error = tbl -> co..
0 305 T && T
0 305 T && F
0 305 F && _
0 307 return ERR_PTR ( error )
0 0 312 if (n -> parms && n -> parms -> neigh_setup &..
0 312 T && T && T
0 312 T && T && F
0 312 T && F && _
0 312 F && _ && _
0 314 return ERR_PTR ( error )
321 do
321 do
0 0 321 do-while (0)
0 0 321 do-while (0)
0 0 322 for (;n1;)
0 0 324 if (dev == n1 -> dev && __builtin_memcmp ( ..
0 324 T && T
0 324 T && F
0 324 F && _
326 do
326 do
0 0 326 do-while (0)
326 do
0 0 326 do-while (0)
0 0 326 do-while (0)
0 328 return n1
336 do
336 do
0 0 336 do-while (0)
336 do
0 0 336 do-while (0)
0 0 336 do-while (0)
337 do
0 0 337 do-while (0)
0 338 return n
*** TER 0% ( 0/ 44) of FUNCTION neigh_create()
0 0 341 FUNCTION pneigh_lookup()
354 do
354 do
0 0 354 do-while (0)
0 0 354 do-while (0)
0 0 356 for (;n;)
0 0 358 if (__builtin_memcmp ( n -> key , pkey , ke..
0 358 T && (T || _)
0 358 T && (F || T)
0 358 T && (F || F)
0 358 F && (_ || _)
359 do
359 do
0 0 359 do-while (0)
359 do
0 0 359 do-while (0)
0 0 359 do-while (0)
0 360 return n
363 do
363 do
0 0 363 do-while (0)
363 do
0 0 363 do-while (0)
0 0 363 do-while (0)
0 0 364 if (! creat)
0 365 return ( ( void * ) 0 )
0 0 368 if (n == ( ( void * ) 0 ))
0 369 return ( ( void * ) 0 )
0 0 374 if (tbl -> pconstructor && tbl -> pconstructo..
0 374 T && T
0 374 T && F
0 374 F && _
0 376 return ( ( void * ) 0 )
379 do
379 do
0 0 379 do-while (0)
0 0 379 do-while (0)
382 do
382 do
0 0 382 do-while (0)
382 do
0 0 382 do-while (0)
0 0 382 do-while (0)
0 383 return n
*** TER 0% ( 0/ 49) of FUNCTION pneigh_lookup()
0 0 387 FUNCTION pneigh_delete()
0 0 399 for (;( n = * np ) != ( ( void * ) 0 );)
0 0 400 if (__builtin_memcmp ( n -> key , pkey , ke..
0 400 T && T
0 400 T && F
0 400 F && _
401 do
401 do
0 0 401 do-while (0)
0 0 401 do-while (0)
403 do
403 do
0 0 403 do-while (0)
403 do
0 0 403 do-while (0)
0 0 403 do-while (0)
0 0 404 if (tbl -> pdestructor)
0 407 return 0
0 410 return - 2
*** TER 0% ( 0/ 22) of FUNCTION pneigh_delete()
0 0 413 FUNCTION pneigh_ifdown()
0 0 418 for (;h <= 0xF;)
0 0 420 while (( n = * np ) != ( ( void * ) 0 ))
0 0 421 if (n -> dev == dev || dev == ( ( void * ..
0 421 T || _
0 421 F || T
0 421 F || F
0 0 423 if (tbl -> pdestructor)
0 426 continue
0 431 return - 2
*** TER 0% ( 0/ 14) of FUNCTION pneigh_ifdown()
0 0 439 FUNCTION neigh_destroy()
0 0 443 if (! neigh -> dead)
0 446 return
0 0 449 if (neigh_del_timer ( neigh ))
0 0 452 while (( hh = neigh -> hh ) != ( ( void * ) 0..
455 do
455 do
0 0 455 do-while (0)
0 0 455 do-while (0)
457 do
457 do
0 0 457 do-while (0)
457 do
0 0 457 do-while (0)
0 0 457 do-while (0)
0 0 458 if (atomic_dec_and_test ( & hh -> hh_refcnt..
0 0 462 if (neigh -> ops && neigh -> ops -> destructor)
0 462 T && T
0 462 T && F
0 462 F && _
469 do
0 0 469 do-while (0)
*** TER 0% ( 0/ 27) of FUNCTION neigh_destroy()
0 0 481 FUNCTION neigh_suspect()
485 do
0 0 485 do-while (0)
487 do
0 0 487 do-while (0)
0 0 491 for (;hh;)
*** TER 0% ( 0/ 7) of FUNCTION neigh_suspect()
0 0 500 FUNCTION neigh_connect()
504 do
0 0 504 do-while (0)
506 do
0 0 506 do-while (0)
0 0 510 for (;hh;)
*** TER 0% ( 0/ 7) of FUNCTION neigh_connect()
0 0 527 FUNCTION neigh_sync()
532 do
0 0 532 do-while (0)
0 0 533 if (state & ( 0x40 | 0x80 ))
0 534 return
0 0 535 if (state & 0x02)
0 0 536 if (now - n -> confirmed > n -> parms -> re..
0 0 540 else if (state & ( 0x80 | 0x40 | 0x02 | 0x10 ..
0 0 541 if (now - n -> confirmed < n -> parms -> re..
*** TER 0% ( 0/ 14) of FUNCTION neigh_sync()
42 42 549 FUNCTION neigh_periodic_timer()
4 38 562 if (now - tbl -> last_rand > 300 * 100)
12 4 565 for (;p;)
1E3 42 569 for (;i <= 0x1F;)
0 1E3 573 while (( n = * np ) != ( ( void * ) 0 ))
0 0 579 if (state & ( 0x80 | ( 0x01 | 0x08 | 0x10..
580 do
0 0 580 do-while (0)
0 581 goto next_elt
0 0 584 if (( long ) ( n -> used - n -> confirmed..
0 0 588 if (( ( & n -> refcnt ) -> counter ) == 1..
0 588 T && (T || _)
0 588 T && (F || T)
0 588 T && (F || F)
0 588 F && (_ || _)
591 do
0 0 591 do-while (0)
0 593 continue
0 0 597 if (n -> nud_state & 0x02 && now - n -> c..
0 597 T && T
0 597 T && F
0 597 F && _
601 do
0 0 601 do-while (0)
609 do
0 42 609 do-while (0)
*** TER 26% ( 9/ 34) of FUNCTION neigh_periodic_timer()
0 0 621 FUNCTION neigh_max_probes()
0 624 return p -> ucast_probes + p -> app_probes + ..
*** TER 0% ( 0/ 2) of FUNCTION neigh_max_probes()
0 0 630 FUNCTION neigh_timer_handler()
0 0 641 if (! ( state & ( 0x01 | 0x08 | 0x10 ) ))
0 645 goto out
0 0 649 if (( state & ( 0x80 | 0x40 | 0x02 | 0x10 | 0..
0 649 (T) && T
0 649 (T) && F
0 649 (F) && _
651 do
0 0 651 do-while (0)
0 653 goto out
0 0 655 if (state == 0x08)
656 do
0 0 656 do-while (0)
0 0 661 if (( ( & neigh -> probes ) -> counter ) >= n..
667 do
0 0 667 do-while (0)
0 0 674 while (neigh -> nud_state == 0x20 && ( skb ..
0 674 T && T
0 674 T && F
0 674 F && _
675 do
0 0 675 do-while (0)
0 680 goto out
685 do
0 0 685 do-while (0)
0 689 return
692 do
0 0 692 do-while (0)
*** TER 0% ( 0/ 33) of FUNCTION neigh_timer_handler()
0 0 700 FUNCTION __neigh_event_send()
702 do
702 do
0 0 702 do-while (0)
0 0 702 do-while (0)
0 0 703 if (! ( neigh -> nud_state & ( ( 0x80 | 0x40 ..
0 0 704 if (! ( neigh -> nud_state & ( 0x04 | 0x01 ..
0 0 705 if (neigh -> parms -> mcast_probes + neig..
711 do
711 do
0 0 711 do-while (0)
711 do
0 0 711 do-while (0)
0 0 711 do-while (0)
714 do
714 do
0 0 714 do-while (0)
0 0 714 do-while (0)
715 else
717 do
717 do
0 0 717 do-while (0)
717 do
0 0 717 do-while (0)
0 0 717 do-while (0)
0 0 719 if (skb)
0 721 return 1
0 0 724 if (neigh -> nud_state == 0x01)
0 0 725 if (skb)
0 0 726 if (skb_queue_len ( & neigh -> arp_queu..
734 do
734 do
0 0 734 do-while (0)
734 do
0 0 734 do-while (0)
0 0 734 do-while (0)
0 735 return 1
0 0 737 if (neigh -> nud_state == 0x04)
738 do
0 0 738 do-while (0)
745 do
745 do
0 0 745 do-while (0)
745 do
0 0 745 do-while (0)
0 0 745 do-while (0)
0 746 return 0
*** TER 0% ( 0/ 54) of FUNCTION __neigh_event_send()
0 0 749 FUNCTION neigh_update_hhs()
0 0 755 if (update)
0 0 756 for (;hh;)
757 do
757 do
0 0 757 do-while (0)
0 0 757 do-while (0)
759 do
759 do
0 0 759 do-while (0)
759 do
0 0 759 do-while (0)
0 0 759 do-while (0)
*** TER 0% ( 0/ 15) of FUNCTION neigh_update_hhs()
0 0 775 FUNCTION neigh_update()
782 do
782 do
0 0 782 do-while (0)
0 0 782 do-while (0)
0 0 786 if (arp && ( old & ( 0x40 | 0x80 ) ))
0 786 T && (T)
0 786 T && (F)
0 786 F && (_)
0 787 goto out
0 0 789 if (! ( new & ( 0x80 | 0x40 | 0x02 | 0x10 | 0..
0 0 791 if (old & ( 0x80 | 0x40 | 0x02 ))
0 796 goto out
0 0 800 if (dev -> addr_len == 0)
0 0 803 else if (lladdr)
0 0 809 if (old & ( 0x80 | 0x40 | 0x02 | 0x10 | 0x0..
0 0 810 if (__builtin_memcmp ( lladdr , neigh -> ..
0 0 812 else if (! override)
0 813 goto out
815 else
0 0 820 if (! ( old & ( 0x80 | 0x40 | 0x02 | 0x10 |..
0 821 goto out
0 0 827 if (new & ( 0x80 | 0x40 | 0x02 ))
0 0 835 if (old & ( 0x80 | 0x40 | 0x02 | 0x10 | 0x04 ..
0 0 836 if (lladdr == neigh -> ha)
0 0 837 if (new == old || ( new == 0x04 && ( old ..
0 837 T || (_ && (_))
0 837 F || (T && (T))
0 837 F || (T && (F))
0 837 F || (F && (_))
0 838 goto out
0 0 842 if (lladdr != neigh -> ha)
0 0 845 if (! ( new & ( 0x80 | 0x40 | 0x02 ) ))
0 0 851 if (new == old)
0 852 goto out
0 0 853 if (new & ( 0x80 | 0x40 | 0x02 ))
855 else
0 0 857 if (! ( old & ( 0x80 | 0x40 | 0x02 | 0x10 | 0..
0 0 863 while (neigh -> nud_state & ( 0x80 | 0x40 |..
0 863 T && T
0 863 T && F
0 863 F && _
865 do
865 do
0 0 865 do-while (0)
865 do
0 0 865 do-while (0)
0 0 865 do-while (0)
0 0 867 if (skb -> dst && skb -> dst -> neighbour)
0 867 T && T
0 867 T && F
0 867 F && _
870 do
870 do
0 0 870 do-while (0)
0 0 870 do-while (0)
875 do
875 do
0 0 875 do-while (0)
875 do
0 0 875 do-while (0)
0 0 875 do-while (0)
0 880 return err
*** TER 0% ( 0/ 81) of FUNCTION neigh_update()
0 0 883 FUNCTION neigh_event_ns()
0 0 890 if (neigh)
0 892 return neigh
*** TER 0% ( 0/ 4) of FUNCTION neigh_event_ns()
0 0 895 FUNCTION neigh_hh_init()
0 0 900 for (;hh;)
0 0 901 if (hh -> hh_type == protocol)
0 902 break
0 0 904 if (! hh && ( hh = kmalloc ( sizeof ( * hh ) ..
0 904 T && T
0 904 T && F
0 904 F && _
0 0 910 if (dev -> hard_header_cache ( n , hh ))
913 else
0 0 917 if (n -> nud_state & ( 0x80 | 0x40 | 0x02..
919 else
0 0 923 if (hh)
*** TER 0% ( 0/ 17) of FUNCTION neigh_hh_init()
0 0 934 FUNCTION neigh_compat_output()
0 0 942 if (dev -> hard_header && dev -> hard_header ..
0 942 T && T && T
0 942 T && T && F
0 942 T && F && _
0 942 F && _ && _
0 943 return 0
0 945 return dev_queue_xmit ( skb )
*** TER 0% ( 0/ 9) of FUNCTION neigh_compat_output()
0 0 950 FUNCTION neigh_resolve_output()
0 0 955 if (! dst || ! ( neigh = dst -> neighbour ))
0 955 T || !(_)
0 955 F || !(F)
0 955 F || !(T)
0 956 goto discard
0 0 960 if (neigh_event_send ( neigh , skb ) == 0)
0 0 963 if (dev -> hard_header_cache && dst -> hh =..
0 963 T && T
0 963 T && F
0 963 F && _
964 do
964 do
0 0 964 do-while (0)
0 0 964 do-while (0)
0 0 965 if (dst -> hh == ( ( void * ) 0 ))
968 do
968 do
0 0 968 do-while (0)
968 do
0 0 968 do-while (0)
0 0 968 do-while (0)
969 else
970 do
970 do
0 0 970 do-while (0)
0 0 970 do-while (0)
972 do
972 do
0 0 972 do-while (0)
972 do
0 0 972 do-while (0)
0 0 972 do-while (0)
0 0 974 if (err >= 0)
0 975 return neigh -> ops -> queue_xmit ( skb )
0 977 return - 22
0 979 return 0
0 984 return - 22
*** TER 0% ( 0/ 42) of FUNCTION neigh_resolve_output()
0 0 989 FUNCTION neigh_connected_output()
998 do
998 do
0 0 998 do-while (0)
0 0 998 do-while (0)
1000 do
1000 do
0 0 1000 do-while (0)
1000 do
0 0 1000 do-while (0)
0 0 1000 do-while (0)
0 0 1001 if (err >= 0)
0 1002 return neigh -> ops -> queue_xmit ( skb )
0 1004 return - 22
*** TER 0% ( 0/ 15) of FUNCTION neigh_connected_output()
0 0 1007 FUNCTION neigh_proxy_process()
0 0 1018 while (skb != ( struct sk_buff * ) & tbl -> p..
0 0 1023 if (tdif <= 0)
0 0 1026 if (tbl -> proxy_redo && netif_running ( ..
0 1026 T && T
0 1026 T && F
0 1026 F && _
1028 else
0 0 1032 else if (! sched_next || tdif < sched_next)
0 1032 T || _
0 1032 F || T
0 1032 F || F
0 0 1036 if (sched_next)
1038 do
0 0 1038 do-while (0)
*** TER 0% ( 0/ 19) of FUNCTION neigh_proxy_process()
0 0 1041 FUNCTION pneigh_enqueue()
0 0 1047 if (tbl -> proxy_queue . qlen > p -> proxy_ql..
0 1049 return
0 0 1055 if (del_timer ( & tbl -> proxy_timer ))
0 0 1057 if (tval < sched_next)
1065 do
0 0 1065 do-while (0)
*** TER 0% ( 0/ 10) of FUNCTION pneigh_enqueue()
2 0 1069 FUNCTION neigh_parms_alloc()
2 0 1073 if (p)
0 2 1077 if (dev && dev -> neigh_setup)
0 1077 T && T
2 1077 T && F
0 1077 F && _
0 0 1078 if (dev -> neigh_setup ( dev , p ))
0 1080 return ( ( void * ) 0 )
1083 do
1083 do
0 2 1083 do-while (0)
0 2 1083 do-while (0)
1086 do
1086 do
0 2 1086 do-while (0)
1086 do
0 2 1086 do-while (0)
0 2 1086 do-while (0)
2 1088 return p
*** TER 45% ( 10/ 22) of FUNCTION neigh_parms_alloc()
0 0 1091 FUNCTION neigh_parms_release()
0 0 1095 if (parms == ( ( void * ) 0 ) || parms == & t..
0 1095 T || _
0 1095 F || T
0 1095 F || F
0 1096 return
1097 do
1097 do
0 0 1097 do-while (0)
0 0 1097 do-while (0)
0 0 1098 for (;* p;)
0 0 1099 if (* p == parms)
1101 do
1101 do
0 0 1101 do-while (0)
1101 do
0 0 1101 do-while (0)
0 0 1101 do-while (0)
0 1106 return
1109 do
1109 do
0 0 1109 do-while (0)
1109 do
0 0 1109 do-while (0)
0 0 1109 do-while (0)
*** TER 0% ( 0/ 28) of FUNCTION neigh_parms_release()
1 1 1114 FUNCTION neigh_table_init()
1 0 1120 if (tbl -> kmem_cachep == ( ( void * ) 0 ))
1146 do
0 1 1146 do-while (0)
*** TER 60% ( 3/ 5) of FUNCTION neigh_table_init()
0 0 1149 FUNCTION neigh_table_clear()
0 0 1159 if (tbl -> entries)
0 0 1162 for (;* tp;)
0 0 1163 if (* tp == tbl)
0 1165 break
1168 do
0 0 1168 do-while (0)
0 1172 return 0
*** TER 0% ( 0/ 11) of FUNCTION neigh_table_clear()
3 0 1516 FUNCTION neigh_sysctl_register()
0 3 1522 if (t == ( ( void * ) 0 ))
0 1523 return - 105
2 1 1537 if (dev)
1541 else
0 3 1558 if (t -> sysctl_header == ( ( void * ) 0 ))
0 1560 return - 105
3 1563 return 0
*** TER 60% ( 6/ 10) of FUNCTION neigh_sysctl_register()
0 0 1566 FUNCTION neigh_sysctl_unregister()
0 0 1568 if (p -> sysctl_table)
*** TER 0% ( 0/ 3) of FUNCTION neigh_sysctl_unregister()
*** TER 5% ( 38/707) of SOURCE FILE neighbour.c
MONITORED SOURCE FILE : fib_semantics.c
6 6 106 FUNCTION free_fib_info()
0 6 108 if (fi -> fib_dead == 0)
0 110 return
6 6 112 for (;nhsel < 1;)
6 0 113 if (nh -> nh_dev)
*** TER 63% ( 5/ 8) of FUNCTION free_fib_info()
2 2 121 FUNCTION fib_release_info()
0 2 124 if (fi && -- fi -> fib_treeref == 0)
0 124 T && T
2 124 T && F
0 124 F && _
0 0 125 if (fi -> fib_next)
0 0 127 if (fi -> fib_prev)
0 0 129 if (fi == fib_info_list)
134 do
0 2 134 do-while (0)
*** TER 29% ( 4/ 14) of FUNCTION fib_release_info()
8 0 137 FUNCTION nh_comp()
8 6 141 for (;nhsel < 1;)
2 6 151 if (nh -> nh_oif != onh -> nh_oif || nh -..
0 151 T || _ || _ || (_)
0 151 F || T || _ || (_)
2 151 F || F || T || (_)
0 151 F || F || F || (T)
6 151 F || F || F || (F)
2 152 return - 1
6 155 return 0
*** TER 75% ( 9/ 12) of FUNCTION nh_comp()
11 0 158 FUNCTION fib_find_info()
16 5 160 for (;fi;)
0 16 161 if (fi -> fib_nhs != nfi -> fib_nhs)
0 162 continue
6 10 168 if (nfi -> fib_protocol == fi -> fib_prot..
0 168 T && T && T && T && T && (T || _)
6 168 T && T && T && T && T && (F || T)
2 168 T && T && T && T && T && (F || F)
0 168 T && T && T && T && F && (_ || _)
0 168 T && T && T && F && _ && (_ || _)
0 168 T && T && F && _ && _ && (_ || _)
4 168 T && F && _ && _ && _ && (_ || _)
4 168 F && _ && _ && _ && _ && (_ || _)
6 169 return fi
5 171 return ( ( void * ) 0 )
*** TER 67% ( 12/ 18) of FUNCTION fib_find_info()
0 0 178 FUNCTION ip_fib_check_default()
0 0 181 for (;fi;)
0 0 182 if (fi -> fib_flags & 1)
0 183 continue
0 0 184 for (;nhsel < 1;)
0 0 186 if (nh -> nh_dev == dev && nh -> nh_g..
0 186 T && T && !(F)
0 186 T && T && !(T)
0 186 T && F && !(_)
0 186 F && _ && !(_)
187 do
0 0 187 do-while (0)
0 188 return 0
192 do
0 0 192 do-while (0)
0 193 return - 1
*** TER 0% ( 0/ 20) of FUNCTION ip_fib_check_default()
0 0 250 FUNCTION fib_nh_match()
0 0 259 if (rta -> rta_priority && * rta -> rta_prior..
0 259 T && T
0 259 T && F
0 259 F && _
0 260 return 1
0 0 262 if (rta -> rta_oif || rta -> rta_gw)
0 262 T || _
0 262 F || T
0 262 F || F
0 0 264 if (( ! rta -> rta_oif || * rta -> rta_oif ..
0 264 (T || _) && (T || _)
0 264 (T || _) && (F || T)
0 264 (F || T) && (T || _)
0 264 (F || T) && (F || T)
0 264 (T || _) && (F || F)
0 264 (F || T) && (F || F)
0 264 (F || F) && (_ || _)
0 265 return 0
0 266 return 1
0 296 return 0
*** TER 0% ( 0/ 24) of FUNCTION fib_nh_match()
7 0 344 FUNCTION fib_check_nh()
1 6 348 if (nh -> nh_gw)
0 1 356 if (nh -> nh_flags & 4)
0 0 359 if (r -> rtm_scope >= RT_SCOPE_LINK)
0 360 return - 22
0 0 361 if (inet_addr_type ( nh -> nh_gw ) != RTN..
0 362 return - 22
0 0 363 if (( dev = __dev_get_by_index ( nh -> nh..
0 364 return - 19
0 0 365 if (! ( dev -> flags & 0x1 ))
0 366 return - 100
0 370 return 0
1 0 378 if (key . scope < RT_SCOPE_LINK)
0 1 381 if (( err = fib_lookup ( & key , & res ) ) ..
0 382 return err
1 0 386 if (nh -> nh_dev)
389 else
0 6 392 if (nh -> nh_flags & ( 2 | 4 ))
0 393 return - 22
0 6 396 if (in_dev == ( ( void * ) 0 ))
0 397 return - 19
0 6 398 if (! ( in_dev -> dev -> flags & 0x1 ))
0 400 return - 100
7 407 return 0
*** TER 31% ( 11/ 35) of FUNCTION fib_check_nh()
11 0 411 FUNCTION fib_create_info()
0 11 424 if (fib_props [ r -> rtm_type ] . scope > r -..
0 425 goto err_inval
0 11 437 if (fi == ( ( void * ) 0 ))
0 438 goto failure
1 10 445 if (rta -> rta_priority)
0 11 447 if (rta -> rta_mx)
0 0 451 while (( ( attrlen ) > 0 && ( attr ) -> rta..
0 451 (T && T && T)
0 451 (T && T && F)
0 451 (T && F && _)
0 451 (F && _ && _)
0 0 453 if (flavor)
0 0 454 if (flavor > RTAX_REORDERING)
0 455 goto err_inval
10 1 461 if (rta -> rta_prefsrc)
0 11 464 if (rta -> rta_mp)
0 477 goto err_inval
479 else
11 0 481 if (rta -> rta_oif)
1 10 483 if (rta -> rta_gw)
0 11 504 if (fib_props [ r -> rtm_type ] . error)
0 0 505 if (rta -> rta_gw || rta -> rta_oif || rta ..
0 505 T || _ || _
0 505 F || T || _
0 505 F || F || T
0 505 F || F || F
0 506 goto err_inval
0 507 goto link_it
0 11 510 if (r -> rtm_scope > RT_SCOPE_HOST)
0 511 goto err_inval
4 7 513 if (r -> rtm_scope == RT_SCOPE_HOST)
0 4 517 if (nhs != 1 || nh -> nh_gw)
0 517 T || _
0 517 F || T
4 517 F || F
0 518 goto err_inval
0 4 522 if (nh -> nh_dev == ( ( void * ) 0 ))
0 523 goto failure
524 else
7 7 525 for (;nhsel < 1;)
0 7 526 if (( err = fib_check_nh ( r , fi , nh ..
0 527 goto failure
10 1 531 if (fi -> fib_prefsrc)
7 3 533 if (r -> rtm_type != RTN_LOCAL || rta -> rt..
6 533 T || _ || _
0 533 F || T || _
1 533 F || F || T
3 533 F || F || F
0 7 534 if (inet_addr_type ( fi -> fib_prefsrc ) ..
0 535 goto err_inval
6 5 539 if (( ofi = fib_find_info ( fi ) ) != ( ( voi..
6 543 return ofi
4 1 551 if (fib_info_list)
554 do
0 5 554 do-while (0)
5 555 return fi
0 0 562 if (fi)
0 566 return ( ( void * ) 0 )
*** TER 45% ( 37/ 82) of FUNCTION fib_create_info()
17 0 570 FUNCTION fib_semantic_match()
17 0 574 if (err == 0)
0 17 575 if (fi -> fib_flags & 1)
0 576 return 1
580 switch ( type )
8 587 case RTN_UNICAST:
15 588 case RTN_LOCAL:
17 589 case RTN_BROADCAST:
17 590 case RTN_ANYCAST:
17 591 case RTN_MULTICAST:
17 0 592 for (;nhsel < 1;)
0 17 593 if (nh -> nh_flags & 1)
0 594 continue
17 0 595 if (! key -> oif || key -> oif == nh ..
16 595 T || _
1 595 F || T
0 595 F || F
17 596 break
17 0 605 if (nhsel < 1)
17 607 return 0
0 612 return 1
0 613 default:
0 616 return - 22
0 619 return err
*** TER 55% ( 16/ 29) of FUNCTION fib_semantic_match()
0 0 624 FUNCTION __fib_res_prefsrc()
0 626 return inet_select_addr ( ( ( ( * res ) . fi ..
*** TER 0% ( 0/ 2) of FUNCTION __fib_res_prefsrc()
1 0 706 FUNCTION fib_convert_rtentry()
0 1 715 if (r -> rt_dst . sa_family != 2)
0 716 return - 97
1 0 727 if (! ( r -> rt_flags & 0x0004 ))
0 1 729 if (r -> rt_genmask . sa_family != 2)
0 0 730 if (mask || r -> rt_genmask . sa_family)
0 730 T || _
0 730 F || T
0 730 F || F
0 731 return - 97
0 1 733 if (bad_mask ( mask , * ptr ))
0 734 return - 22
0 1 742 if (cmd == 0x890C)
745 else
1 0 754 if (r -> rt_metric)
0 1 758 if (r -> rt_flags & 0x0200)
0 761 return 0
1 0 766 if (r -> rt_dev)
0 1 771 if (( __builtin_constant_p ( 16 - 1 ) ? __c..
0 772 return - 14
0 1 775 if (colon)
0 1 778 if (! dev)
0 779 return - 19
0 1 781 if (colon)
0 0 784 if (! in_dev)
0 785 return - 19
0 0 787 for (;ifa;)
0 0 788 if (strcmp ( ifa -> ifa_label , devname..
0 789 break
0 0 790 if (ifa == ( ( void * ) 0 ))
0 791 return - 19
1 0 797 if (r -> rt_gateway . sa_family == 2 && * ptr)
1 797 T && T
0 797 T && F
0 797 F && _
1 0 799 if (r -> rt_flags & 0x0002 && inet_addr_typ..
1 799 T && T
0 799 T && F
0 799 F && _
0 1 803 if (cmd == 0x890C)
0 804 return 0
0 1 806 if (r -> rt_flags & 0x0002 && rta -> rta_gw =..
0 806 T && T
1 806 T && F
0 806 F && _
0 807 return - 22
0 1 809 if (rtm -> rtm_scope == RT_SCOPE_NOWHERE)
0 1 812 if (r -> rt_flags & ( 0x0040 | 0x0080 | 0x010..
0 0 815 if (mx == ( ( void * ) 0 ))
0 816 return - 12
0 0 820 if (r -> rt_flags & 0x0040)
0 0 827 if (r -> rt_flags & 0x0080)
0 0 834 if (r -> rt_flags & 0x0100)
1 842 return 0
*** TER 29% ( 23/ 80) of FUNCTION fib_convert_rtentry()
0 0 854 FUNCTION fib_sync_down()
0 0 859 if (force)
0 0 862 for (;fi;)
0 0 863 if (local && fi -> fib_prefsrc == local)
0 863 T && T
0 863 T && F
0 863 F && _
0 0 866 else if (dev && fi -> fib_nhs)
0 866 T && T
0 866 T && F
0 866 F && _
0 0 869 for (;nhsel < 1;)
0 0 870 if (nh -> nh_flags & 1)
0 0 873 else if (nh -> nh_dev == dev && nh ..
0 873 T && T
0 873 T && F
0 873 F && _
0 0 882 if (dead == fi -> fib_nhs)
0 888 return ret
*** TER 0% ( 0/ 27) of FUNCTION fib_sync_down()
0 0 985 FUNCTION fib_flag_trans()
0 0 992 if (fi && fi -> fib_nh -> nh_gw)
0 992 T && T
0 992 T && F
0 992 F && _
0 0 994 if (mask == 0xFFFFFFFF)
0 0 996 if (! dead)
0 998 return flags
*** TER 0% ( 0/ 11) of FUNCTION fib_flag_trans()
0 0 1001 FUNCTION fib_node_get_info()
0 0 1006 if (fi)
1011 else
*** TER 0% ( 0/ 3) of FUNCTION fib_node_get_info()
*** TER 32% (117/365) of SOURCE FILE fib_semantics.c
MONITORED SOURCE FILE : random.c
9E4 0 418 FUNCTION rotate_left()
9E4 423 return word
*** TER 100% ( 2/ 2) of FUNCTION rotate_left()
4E4 0 446 FUNCTION int_ln_12bits()
4E4 460 return word & 15
*** TER 100% ( 2/ 2) of FUNCTION int_ln_12bits()
2 0 486 FUNCTION create_entropy_store()
12 0 496 for (;p -> poolwords;)
2 10 497 if (poolwords == p -> poolwords)
2 498 break
0 2 500 if (p -> poolwords == 0)
0 501 return - 22
0 2 504 if (! r)
0 505 return - 12
0 2 511 if (! r -> pool)
0 513 return - 12
2 517 return 0
*** TER 56% ( 9/ 16) of FUNCTION create_entropy_store()
2 2 521 FUNCTION clear_entropy_store()
*** TER 100% ( 1/ 1) of FUNCTION clear_entropy_store()
0 0 530 FUNCTION free_entropy_store()
0 0 532 if (r -> pool)
*** TER 0% ( 0/ 3) of FUNCTION free_entropy_store()
4E4 4E4 547 FUNCTION add_entropy_words()
9E4 4E4 557 while (num --)
8E4 719 567 if (i)
*** TER 100% ( 5/ 5) of FUNCTION add_entropy_words()
4E4 4E4 585 FUNCTION credit_entropy_store()
0 4E4 589 if (r -> entropy_count + num < 0)
4E4 1E3 591 else if (r -> entropy_count + num > max_entro..
593 else
*** TER 80% ( 4/ 5) of FUNCTION credit_entropy_store()
1 0 613 FUNCTION batch_entropy_init()
0 1 616 if (! batch_entropy_pool)
0 617 return - 1
0 1 619 if (! batch_entropy_credit)
0 621 return - 1
1 627 return 0
*** TER 50% ( 4/ 8) of FUNCTION batch_entropy_init()
4E4 4E4 630 FUNCTION batch_entropy_store()
0 4E4 634 if (! batch_max)
0 635 return
4E4 0 642 if (new != batch_tail)
645 else
*** TER 50% ( 3/ 6) of FUNCTION batch_entropy_store()
1E4 1E4 652 FUNCTION batch_entropy_process()
0 1E4 658 if (! batch_max)
0 659 return
4E4 1E4 662 while (batch_head != batch_tail)
0 4E4 665 if (r -> entropy_count > max_entropy && ( n..
0 665 T && (T)
0 665 T && (F)
4E4 665 F && (_)
1E4 5 671 if (r -> entropy_count >= random_read_wakeup_..
*** TER 62% ( 8/ 13) of FUNCTION batch_entropy_process()
4E4 4E4 706 FUNCTION add_timer_randomness()
4E4 0 713 if (( __builtin_constant_p ( ( 0 * 32 + 4 ) )..
718 else
4E4 286 730 if (! state -> dont_count_entropy)
34 4E4 740 if (delta < 0)
2E4 2E4 742 if (delta2 < 0)
1E4 2E4 744 if (delta3 < 0)
3E4 1E4 746 if (delta > delta2)
8E3 3E4 748 if (delta > delta3)
*** TER 93% ( 14/ 15) of FUNCTION add_timer_randomness()
399 399 764 FUNCTION add_keyboard_randomness()
350 49 768 if (scancode != last_scancode)
*** TER 100% ( 3/ 3) of FUNCTION add_keyboard_randomness()
0 0 774 FUNCTION add_mouse_randomness()
*** TER 0% ( 0/ 1) of FUNCTION add_mouse_randomness()
0 0 779 FUNCTION add_interrupt_randomness()
0 0 781 if (irq >= 224 || irq_timer_state [ irq ] == 0)
0 781 T || _
0 781 F || T
0 781 F || F
0 782 return
*** TER 0% ( 0/ 7) of FUNCTION add_interrupt_randomness()
4E4 4E4 787 FUNCTION add_blkdev_randomness()
0 4E4 789 if (major >= 255)
0 790 return
2 4E4 792 if (blkdev_timer_state [ major ] == 0)
0 2 794 if (blkdev_timer_state [ major ] == 0)
0 795 return
*** TER 56% ( 5/ 9) of FUNCTION add_blkdev_randomness()
1E3 1E3 866 FUNCTION SHATransform()
1E5 1E3 880 for (;i < 64;)
1E5 1E3 898 for (;i < 80;)
7E4 7E4 899 if (i < 40)
3E4 3E4 900 if (i < 20)
902 else
904 else
3E4 3E4 905 if (i < 60)
907 else
*** TER 100% ( 11/ 11) of FUNCTION SHATransform()
6 6 1209 FUNCTION xfer_secondary_pool()
6 0 1214 if (r -> entropy_count < nbytes * 8)
0 6 1219 if (r -> extract_count > 1024)
*** TER 60% ( 3/ 5) of FUNCTION xfer_secondary_pool()
12 0 1236 FUNCTION extract_entropy()
6 6 1246 if (r -> entropy_count > r -> poolinfo . pool..
6 6 1249 if (flags & 2)
5 7 1252 if (r -> entropy_count / 8 >= nbytes)
1254 else
7 5 1257 if (r -> entropy_count < random_write_wakeup_..
274 12 1263 while (nbytes)
0 274 1267 if (( flags & 1 ) && get_current ( ) -> nee..
0 1267 (T) && T
70 1267 (T) && F
204 1267 (F) && _
0 0 1268 if (signal_pending ( get_current ( ) ))
0 0 1269 if (ret == 0)
0 1271 break
1E3 274 1292 for (;i < r -> poolinfo . poolwords;)
548 274 1301 for (;i < 5 / 2;)
70 204 1311 if (flags & 1)
0 70 1313 if (! i)
0 1315 break
1317 else
12 1328 return ret
*** TER 71% ( 22/ 31) of FUNCTION extract_entropy()
0 0 1336 FUNCTION get_random_bytes()
0 0 1338 if (sec_random_state)
0 0 1341 else if (random_state)
1343 else
*** TER 0% ( 0/ 5) of FUNCTION get_random_bytes()
1 1 1359 FUNCTION init_std_data()
48 1 1376 for (;i;)
*** TER 100% ( 3/ 3) of FUNCTION init_std_data()
1 1 1383 FUNCTION rand_initialize()
0 1 1387 if (create_entropy_store ( 512 , & random_sta..
0 1388 return
0 1 1389 if (batch_entropy_init ( 256 , random_state ))
0 1390 return
0 1 1391 if (create_entropy_store ( 128 , & sec_random..
0 1392 return
224 1 1399 for (;i < 224;)
255 1 1401 for (;i < 255;)
*** TER 57% ( 8/ 14) of FUNCTION rand_initialize()
0 0 1409 FUNCTION rand_initialize_irq()
0 0 1413 if (irq >= 224 || irq_timer_state [ irq ])
0 1413 T || _
0 1413 F || T
0 1413 F || F
0 1414 return
0 0 1421 if (state)
*** TER 0% ( 0/ 9) of FUNCTION rand_initialize_irq()
2 2 1427 FUNCTION rand_initialize_blkdev()
0 2 1431 if (major >= 255 || blkdev_timer_state [ majo..
0 1431 T || _
0 1431 F || T
2 1431 F || F
0 1432 return
2 0 1439 if (state)
*** TER 44% ( 4/ 9) of FUNCTION rand_initialize_blkdev()
0 0 1447 FUNCTION random_read()
0 0 1452 if (nbytes == 0)
0 1453 return 0
0 0 1456 while (nbytes > 0)
1457 do
0 0 1457 do-while (0)
0 0 1460 if (n > ( ( 5 + 80 ) * 4 ))
0 0 1462 if (n > random_state -> entropy_count / 8)
0 0 1464 if (n == 0)
0 0 1465 if (file -> f_flags & 04000)
0 1467 break
0 0 1469 if (signal_pending ( get_current ( ) ))
0 1471 break
0 1474 continue
0 0 1479 if (n < 0)
0 1481 break
0 1486 break
0 0 1495 if (count != 0)
0 1499 return ( count ? count : retval )
*** TER 0% ( 0/ 28) of FUNCTION random_read()
6 0 1503 FUNCTION urandom_read()
6 1508 return extract_entropy ( sec_random_state , b..
*** TER 100% ( 2/ 2) of FUNCTION urandom_read()
0 0 1512 FUNCTION random_poll()
0 0 1519 if (random_state -> entropy_count >= random_r..
0 0 1521 if (random_state -> entropy_count < random_wr..
0 1523 return mask
*** TER 0% ( 0/ 6) of FUNCTION random_poll()
0 0 1527 FUNCTION random_write()
0 0 1536 while (c > 0)
0 0 1540 if (! bytes)
0 1542 break
0 0 1551 if (p == buffer)
0 1552 return ( ssize_t ) ret
1553 else
0 1556 return ( ssize_t ) ( p - buffer )
*** TER 0% ( 0/ 10) of FUNCTION random_write()
0 0 1561 FUNCTION random_ioctl()
1567 switch ( cmd )
0 1568 case ( ( ( 2U ) << ( ( ( 0 + 8 ) + 8 ) + 14 )..
0 0 1570 if (( { long __pu_err = - 14 ;__typeof__ ( ..
0 1571 return - 14
0 1572 return 0
0 1573 case ( ( ( 1U ) << ( ( ( 0 + 8 ) + 8 ) + 14 )..
0 0 1574 if (! capable ( 21 ))
0 1575 return - 1
0 0 1576 if (( { int __ret_gu , __val_gu ;switch ( s..
0 1577 return - 14
0 0 1583 if (random_state -> entropy_count >= random..
0 1585 return 0
0 1586 case ( ( ( 2U ) << ( ( ( 0 + 8 ) + 8 ) + 14 )..
0 0 1587 if (! capable ( 21 ))
0 1588 return - 1
0 0 1591 if (( { long __pu_err = - 14 ;__typeof__ ( ..
0 1592 return - 14
0 0 1594 if (( { int __ret_gu , __val_gu ;switch ( s..
0 1595 return - 14
0 0 1596 if (( { long __pu_err = - 14 ;__typeof__ ( ..
0 1597 return - 14
0 0 1598 if (size < 0)
0 1599 return - 22
0 0 1600 if (size > random_state -> poolinfo . poolw..
0 0 1602 if (( __builtin_constant_p ( size * sizeof ..
0 1603 return - 14
0 1604 return 0
0 1605 case ( ( ( 1U ) << ( ( ( 0 + 8 ) + 8 ) + 14 )..
0 0 1606 if (! capable ( 21 ))
0 1607 return - 1
0 0 1609 if (( { int __ret_gu , __val_gu ;switch ( s..
0 1610 return - 14
0 0 1611 if (ent_count < 0)
0 1612 return - 22
0 0 1613 if (( { int __ret_gu , __val_gu ;switch ( s..
0 1614 return - 14
0 0 1617 if (retval < 0)
0 1618 return retval
0 0 1624 if (random_state -> entropy_count >= random..
0 1626 return 0
0 1627 case ( ( ( 0U ) << ( ( ( 0 + 8 ) + 8 ) + 14 )..
0 0 1628 if (! capable ( 21 ))
0 1629 return - 1
0 1631 return 0
0 1632 case ( ( ( 0U ) << ( ( ( 0 + 8 ) + 8 ) + 14 )..
0 0 1634 if (! capable ( 21 ))
0 1635 return - 1
0 1638 return 0
0 1639 default:
0 1640 return - 22
*** TER 0% ( 0/ 69) of FUNCTION random_ioctl()
0 0 1667 FUNCTION generate_random_uuid()
*** TER 0% ( 0/ 1) of FUNCTION generate_random_uuid()
0 0 1695 FUNCTION change_poolsize()
0 0 1700 if (( ret = create_entropy_store ( poolsize ,..
0 1701 return ret
0 1711 return 0
*** TER 0% ( 0/ 5) of FUNCTION change_poolsize()
0 0 1714 FUNCTION proc_do_poolsize()
0 0 1723 if (ret || ! write || ( sysctl_poolsize == ra..
0 1723 T || _ || (_)
0 1723 F || T || (_)
0 1723 F || F || (T)
0 1723 F || F || (F)
0 1724 return ret
0 1726 return change_poolsize ( sysctl_poolsize )
*** TER 0% ( 0/ 9) of FUNCTION proc_do_poolsize()
0 0 1729 FUNCTION poolsize_strategy()
0 0 1742 if (newval && newlen)
0 1742 T && T
0 1742 T && F
0 1742 F && _
0 0 1744 if (len > table -> maxlen)
0 0 1746 if (( __builtin_constant_p ( len ) ? __cons..
0 1747 return - 14
0 0 1750 if (sysctl_poolsize != random_state -> poolin..
0 1751 return change_poolsize ( sysctl_poolsize )
0 1753 return 0
*** TER 0% ( 0/ 15) of FUNCTION poolsize_strategy()
0 0 1765 FUNCTION proc_do_uuid()
0 0 1772 if (! uuid)
0 0 1776 if (uuid [ 8 ] == 0)
0 1788 return proc_dostring ( & fake_table , write ,..
*** TER 0% ( 0/ 6) of FUNCTION proc_do_uuid()
0 0 1791 FUNCTION uuid_strategy()
0 0 1798 if (! oldval || ! oldlenp)
0 1798 T || _
0 1798 F || T
0 1798 F || F
0 1799 return 1
0 0 1802 if (! uuid)
0 0 1806 if (uuid [ 8 ] == 0)
0 0 1810 if (len)
0 0 1811 if (len > 16)
0 0 1813 if (( __builtin_constant_p ( len ) ? __cons..
0 1814 return - 14
0 0 1815 if (( { long __pu_err = - 14 ;__typeof__ ( ..
0 1816 return - 14
0 1818 return 1
*** TER 0% ( 0/ 22) of FUNCTION uuid_strategy()
1 1 1845 FUNCTION sysctl_init_random()
*** TER 100% ( 1/ 1) of FUNCTION sysctl_init_random()
0 0 1894 FUNCTION halfMD4Transform()
0 1928 return buf [ 1 ] + b
*** TER 0% ( 0/ 2) of FUNCTION halfMD4Transform()
0 0 2050 FUNCTION secure_tcp_sequence_number()
0 0 2064 if (! rekey_time || ( tv . tv_sec - rekey_tim..
0 2064 T || _
0 2064 F || T
0 2064 F || F
0 2100 return seq
*** TER 0% ( 0/ 7) of FUNCTION secure_tcp_sequence_number()
0 0 2106 FUNCTION secure_ip_id()
0 0 2116 if (! rekey_time || ( t - rekey_time ) > 300)
0 2116 T || _
0 2116 F || T
0 2116 F || F
0 2132 return halfMD4Transform ( secret + 8 , secret )
*** TER 0% ( 0/ 7) of FUNCTION secure_ip_id()
*** TER 31% (114/373) of SOURCE FILE random.c
MONITORED SOURCE FILE : extable.c
24 0 13 FUNCTION search_one_table()
204 0 17 while (first <= last)
24 180 23 if (diff == 0)
24 24 return mid -> fixup
156 24 25 else if (diff < 0)
27 else
0 30 return 0
*** TER 78% ( 7/ 9) of FUNCTION search_one_table()
24 0 34 FUNCTION search_exception_table()
24 0 45 for (;mp != ( ( void * ) 0 );)
0 24 46 if (mp -> ex_table_start == ( ( void * ) 0 ))
0 47 continue
24 0 50 if (ret)
24 50 return ret
0 54 return 0
*** TER 50% ( 5/ 10) of FUNCTION search_exception_table()
*** TER 63% ( 12/ 19) of SOURCE FILE extable.c