Login
[x]
Log in using an account from:
Fedora Account System
Red Hat Associate
Red Hat Customer
Or login using a Red Hat Bugzilla account
Forgot Password
Login:
Hide Forgot
Create an Account
Red Hat Bugzilla – Attachment 236091 Details for
Bug 196757
Firefox only prints first page for certain websites.
[?]
New
Simple Search
Advanced Search
My Links
Browse
Requests
Reports
Current State
Search
Tabular reports
Graphical reports
Duplicates
Other Reports
User Changes
Plotly Reports
Bug Status
Bug Severity
Non-Defaults
|
Product Dashboard
Help
Page Help!
Bug Writing Guidelines
What's new
Browser Support Policy
5.0.4.rh83 Release notes
FAQ
Guides index
User guide
Web Services
Contact
Legal
This site requires JavaScript to be enabled to function correctly, please enable it.
minimal testcase
p3.html (text/plain), 16.23 KB, created by
Martin Stransky
on 2007-10-24 11:37:44 UTC
(
hide
)
Description:
minimal testcase
Filename:
MIME Type:
Creator:
Martin Stransky
Created:
2007-10-24 11:37:44 UTC
Size:
16.23 KB
patch
obsolete
><head> ></head> > ><body> > <div style="position: absolute;"> > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > These optimizations are probably the easiest that one can perform. The approach > is to compile the code without any optimizations flagged at all and then run the > binary on a problem that is similar to the work you will be doing. This will > establish a baseline time. After reading the man page, manual, or other > documentation that explains the flags available for that compiler, recompile the > code with those options, and rerun the code on the same data set. Be careful to > check that the results are identical or close to the baseline run results, for some > compilers are known to rearrange the program's instructions for more efficient > execution, which may have the side effect of producing incorrect results. There may > be compiler flags to force strict ordering of the instructions, or you can select a > lower level of optimization. Things to try include default optimization, frequently > ></body> ></html>
You cannot view the attachment while viewing its details because your browser does not support IFRAMEs.
View the attachment on a separate page
.
View Attachment As Raw
Actions:
View
Attachments on
bug 196757
: 236091