search for: content_shel

Displaying 16 results from an estimated 16 matches for "content_shel".

Did you mean: content_shell
2013 Nov 14
4
[LLVMdev] asan coverage
...t?rev=194701&view=rev http://llvm.org/viewvc/llvm-project?rev=194702&view=rev It provides only function-level boolean coverage (i.e. no counters, just "visited or not"), but is very fast and very simple (no extra sections to the binary file, etc) I've tried it for Chrome's content_shell (huge and heavy binary) and the overhead is negligible at both run-time and shutdown-time. We'll be evaluating this implementation and collecting usage stats. Maybe we want to implement something simple like this in the Clang coverage. --kcc -------------- next part -------------- An HTML at...
2013 Nov 15
2
[LLVMdev] asan coverage
...> http://llvm.org/viewvc/llvm-project?rev=194702&view=rev > It provides only function-level boolean coverage (i.e. no counters, just > "visited or not"), > but is very fast and very simple (no extra sections to the binary file, etc) > I've tried it for Chrome's content_shell (huge and heavy binary) and the > overhead > is negligible at both run-time and shutdown-time. > > We'll be evaluating this implementation and collecting usage stats. > Maybe we want to implement something simple like this in the Clang coverage. > > --kcc > >
2013 Nov 15
2
[LLVMdev] asan coverage
...m-project?rev=194702&view=rev >>> It provides only function-level boolean coverage (i.e. no counters, just >>> "visited or not"), >>> but is very fast and very simple (no extra sections to the binary file, etc) >>> I've tried it for Chrome's content_shell (huge and heavy binary) and the >>> overhead >>> is negligible at both run-time and shutdown-time. >>> >>> We'll be evaluating this implementation and collecting usage stats. >>> Maybe we want to implement something simple like this in the Clang co...
2013 Nov 15
0
[LLVMdev] asan coverage
...w=rev > http://llvm.org/viewvc/llvm-project?rev=194702&view=rev > It provides only function-level boolean coverage (i.e. no counters, just "visited or not"), > but is very fast and very simple (no extra sections to the binary file, etc) > I've tried it for Chrome's content_shell (huge and heavy binary) and the overhead > is negligible at both run-time and shutdown-time. > > We'll be evaluating this implementation and collecting usage stats. > Maybe we want to implement something simple like this in the Clang coverage. > > --kcc -------------- ne...
2013 Nov 15
2
[LLVMdev] asan coverage
...v >>>>> It provides only function-level boolean coverage (i.e. no counters, just >>>>> "visited or not"), >>>>> but is very fast and very simple (no extra sections to the binary file, etc) >>>>> I've tried it for Chrome's content_shell (huge and heavy binary) and the >>>>> overhead >>>>> is negligible at both run-time and shutdown-time. >>>>> >>>>> We'll be evaluating this implementation and collecting usage stats. >>>>> Maybe we want to implement so...
2013 Nov 15
0
[LLVMdev] asan coverage
...m.org/viewvc/llvm-project?rev=194702&view=rev >> It provides only function-level boolean coverage (i.e. no counters, just >> "visited or not"), >> but is very fast and very simple (no extra sections to the binary file, etc) >> I've tried it for Chrome's content_shell (huge and heavy binary) and the >> overhead >> is negligible at both run-time and shutdown-time. >> >> We'll be evaluating this implementation and collecting usage stats. >> Maybe we want to implement something simple like this in the Clang coverage. >> >...
2013 Nov 15
2
[LLVMdev] asan coverage
...t provides only function-level boolean coverage (i.e. no counters, just >>>>>>> "visited or not"), >>>>>>> but is very fast and very simple (no extra sections to the binary file, etc) >>>>>>> I've tried it for Chrome's content_shell (huge and heavy binary) and the >>>>>>> overhead >>>>>>> is negligible at both run-time and shutdown-time. >>>>>>> >>>>>>> We'll be evaluating this implementation and collecting usage stats. >>>>&g...
2013 Nov 15
0
[LLVMdev] asan coverage
...4702&view=rev >>>> It provides only function-level boolean coverage (i.e. no counters, just >>>> "visited or not"), >>>> but is very fast and very simple (no extra sections to the binary file, etc) >>>> I've tried it for Chrome's content_shell (huge and heavy binary) and the >>>> overhead >>>> is negligible at both run-time and shutdown-time. >>>> >>>> We'll be evaluating this implementation and collecting usage stats. >>>> Maybe we want to implement something simple like t...
2014 Feb 13
2
[LLVMdev] asan coverage
...w=rev > http://llvm.org/viewvc/llvm-project?rev=194702&view=rev > It provides only function-level boolean coverage (i.e. no counters, just "visited or not"), > but is very fast and very simple (no extra sections to the binary file, etc) > I've tried it for Chrome's content_shell (huge and heavy binary) and the overhead > is negligible at both run-time and shutdown-time. > > We'll be evaluating this implementation and collecting usage stats. > Maybe we want to implement something simple like this in the Clang coverage. > > --kcc > -----------...
2013 Nov 15
0
[LLVMdev] asan coverage
...t;>> It provides only function-level boolean coverage (i.e. no counters, just >>>>>> "visited or not"), >>>>>> but is very fast and very simple (no extra sections to the binary file, etc) >>>>>> I've tried it for Chrome's content_shell (huge and heavy binary) and the >>>>>> overhead >>>>>> is negligible at both run-time and shutdown-time. >>>>>> >>>>>> We'll be evaluating this implementation and collecting usage stats. >>>>>> Maybe we w...
2013 Nov 15
2
[LLVMdev] asan coverage
...-level boolean coverage (i.e. no counters, just >>>>>>>>> "visited or not"), >>>>>>>>> but is very fast and very simple (no extra sections to the binary file, etc) >>>>>>>>> I've tried it for Chrome's content_shell (huge and heavy binary) and the >>>>>>>>> overhead >>>>>>>>> is negligible at both run-time and shutdown-time. >>>>>>>>> >>>>>>>>> We'll be evaluating this implementation and collecting...
2013 Nov 15
0
[LLVMdev] asan coverage
...nly function-level boolean coverage (i.e. no counters, just >>>>>>>> "visited or not"), >>>>>>>> but is very fast and very simple (no extra sections to the binary file, etc) >>>>>>>> I've tried it for Chrome's content_shell (huge and heavy binary) and the >>>>>>>> overhead >>>>>>>> is negligible at both run-time and shutdown-time. >>>>>>>> >>>>>>>> We'll be evaluating this implementation and collecting usage stats. &gt...
2013 Nov 15
2
[LLVMdev] asan coverage
...nters, just >> >>>>>>>>> "visited or not"), >> >>>>>>>>> but is very fast and very simple (no extra sections to the >> binary file, etc) >> >>>>>>>>> I've tried it for Chrome's content_shell (huge and heavy >> binary) and the >> >>>>>>>>> overhead >> >>>>>>>>> is negligible at both run-time and shutdown-time. >> >>>>>>>>> >> >>>>>>>>> We'll be e...
2013 Nov 15
0
[LLVMdev] asan coverage
...i.e. no > counters, just > >>>>>>>>> "visited or not"), > >>>>>>>>> but is very fast and very simple (no extra sections to the > binary file, etc) > >>>>>>>>> I've tried it for Chrome's content_shell (huge and heavy binary) > and the > >>>>>>>>> overhead > >>>>>>>>> is negligible at both run-time and shutdown-time. > >>>>>>>>> > >>>>>>>>> We'll be evaluating this imple...
2014 Feb 13
2
[LLVMdev] asan coverage
...ttp://llvm.org/viewvc/llvm-project?rev=194702&view=rev >> It provides only function-level boolean coverage (i.e. no counters, just "visited or not"), >> but is very fast and very simple (no extra sections to the binary file, etc) >> I've tried it for Chrome's content_shell (huge and heavy binary) and the overhead >> is negligible at both run-time and shutdown-time. >> >> We'll be evaluating this implementation and collecting usage stats. >> Maybe we want to implement something simple like this in the Clang coverage. >> >> -...
2013 Nov 15
0
[LLVMdev] asan coverage
...coverage (i.e. no counters, just > >>>>>>>>> "visited or not"), > >>>>>>>>> but is very fast and very simple (no extra sections to the binary file, etc) > >>>>>>>>> I've tried it for Chrome's content_shell (huge and heavy binary) and the > >>>>>>>>> overhead > >>>>>>>>> is negligible at both run-time and shutdown-time. > >>>>>>>>> > >>>>>>>>> We'll be evaluating this implementa...