GCOV(1)
โจ NAME โจ
gcov โ the coverage testing tool ๐ (it's the GNU one, from section 1 of the manual, iykyk)
๐ฆ SYNOPSIS ๐ฆ
gcov [-v|--version] [-h|--help]
[-a|--all-blocks]
[-b|--branch-probabilities]
[-c|--branch-counts]
[-g|--conditions]
[-d|--display-progress]
[-f|--function-summaries]
[-j|--json-format]
[-H|--human-readable]
[-k|--use-colors]
[-l|--long-file-names]
[-m|--demangled-names]
[-n|--no-output]
[-o|--object-directory directory|file]
[-p|--preserve-paths]
[-q|--use-hotness-colors]
[-r|--relative-only]
[-s|--source-prefix directory]
[-t|--stdout]
[-u|--unconditional-branches]
[-x|--hash-filenames]
files
๐ธ DESCRIPTION ๐ธ
okay bestie, so gcov is a test coverage program. You use it in concert with GCC to analyze your programs โ the whole point is helping you write more efficient, faster-running code and discovering the untested parts of your program. You can also use gcov as a profiling tool, so you can figure out where your optimization efforts will hit hardest. Bonus: you can run gcov alongside the other profiling tool, gprof, to assess which parts of your code are eating the most computing time. ๐ฅ
Profiling tools help you analyze your code's performance. With a profiler like gcov or gprof, you get the basic performance tea, such as:
- how often each line of code executes
- what lines of code are actually executed
- how much computing time each section of code uses
Once you know these things about how your code behaves when it's compiled, you can look at each module and see which ones should be optimized. gcov literally helps you figure out where to do the optimization work. ๐
Software developers also use coverage testing with testsuites, to make sure the software is actually good enough for a release. Ttestsuites can verify that a program works as expected; a coverage program tests how much of the program is exercised by the testsuite. Then devs can figure out what kinds of test cases need to be added to the testsuites, which creates both better testing and a better final product. Slay. ๐
lowkey important: you should compile your code without optimization if you plan to usegcov, because optimization can combine several lines of code into one function, and that may not give you as much information as you need to hunt forhot spotswhere the code is using a great deal of computer time. Also, becausegcovaccumulates statistics by line (at the lowest resolution), it works best with a programming style that puts only one statement on each line. If you use complicated macros that expand to loops or other control structures, the statistics are less helpful โ they only report on the line where the macro call appears. If your complex macros behave like functions, you can swap them for inline functions to solve that problem. โจ
gcov creates a logfile called sourcefile.gcov which tells you how many times each line of a source file sourcefile.c has executed. You can use these logfiles along with gprof to aid in fine-tuning your programs' performance. gprof gives you timing information you can use along with the info you get from gcov. ๐ซถ
fr fr, read this: gcov works only on code compiled with GCC. It is not compatible with any other profiling or test coverage mechanism. no exceptions, bestie. ๐ญ
๐ OPTIONS ๐
-a,--all-blocksโ Write individual execution counts for every basic block. Normallygcovonly outputs execution counts for the main blocks of a line. With this option you can clock whether blocks within a single line are not being executed. ๐ต๏ธ-b,--branch-probabilitiesโ Write branch frequencies to the output file, and write branch summary info to standard output. This one lets you see how often each branch in your program was taken. Unconditional branches will not be shown, unless the-uoption is given. ๐-c,--branch-countsโ Write branch frequencies as the number of branches taken, rather than the percentage of branches taken.-g,--conditionsโ Write condition coverage to the output file, and write condition summary info to standard output. This lets you see if the conditions in your program at least once had an independent effect on the outcome of the boolean expression (modified condition/decision coverage). โ ๏ธ This requires you to compile the source with-fcondition-coverage.-d,--display-progressโ Display the progress on standard output. ๐-f,--function-summariesโ Output summaries for each function, in addition to the file level summary.-h,--helpโ Display help about usinggcov(on standard output), and exit without doing any further processing.-j,--json-formatโ Output agcovfile in an easy-to-parse JSON intermediate format which does not require source code for generation. The JSON file is compressed with the gzip compression algorithm and the files have a.gcov.json.gzextension.
Structure of the JSON is following:
{
"current_working_directory": "foo/bar",
"data_file": "a.out",
"format_version": "2",
"gcc_version": "11.1.1 20210510"
"files": ["$file"]
}
Fields of the root element have following semantics:
current_working_directory: working directory where a compilation unit was compileddata_file: name of the data file (GCDA)format_version: semantic version of the format
Changes in version 2:
calls: information about function calls is added
gcc_version: version of the GCC compiler
Each file has the following form:
{
"file": "a.c",
"functions": ["$function"],
"lines": ["$line"]
}
Fields of the file element have following semantics:
file_name: name of the source file
Each function has the following form:
{
"blocks": 2,
"blocks_executed": 2,
"demangled_name": "foo",
"end_column": 1,
"end_line": 4,
"execution_count": 1,
"name": "foo",
"start_column": 5,
"start_line": 1
}
Fields of the function element have following semantics:
blocks: number of blocks that are in the functionblocks_executed: number of executed blocks of the functiondemangled_name: demangled name of the functionend_column: column in the source file where the function endsend_line: line in the source file where the function endsexecution_count: number of executions of the functionname: name of the functionstart_column: column in the source file where the function beginsstart_line: line in the source file where the function begins
Note that line numbers and column numbers number from 1. In the current implementation,start_lineandstart_columndo not include any template parameters and the leading return type, but that this is likely to be fixed in the future. ๐
Each line has the following form:
{
"block_ids": ["$block_id"],
"branches": ["$branch"],
"calls": ["$call"],
"count": 2,
"conditions": ["$condition"],
"line_number": 15,
"unexecuted_block": false,
"function_name": "foo",
}
Branches and calls are present only with the -b option. Fields of the line element have following semantics:
block_ids: IDs of basic blocks that belong to the linecount: number of executions of the lineline_number: line numberunexecuted_block: flag whether the line contains an unexecuted block (not all statements on the line are executed)function_name: a name of a function this line belongs to (for a line with an inlined statements can be not set)
Each branch has the following form:
{
"count": 11,
"destination_block_id": 17,
"fallthrough": true,
"source_block_id": 13,
"throw": false
}
Fields of the branch element have following semantics:
count: number of executions of the branchfallthrough: true when the branch is a fall through branchthrow: true when the branch is an exceptional branchisource_block_id: ID of the basic block where this branch happensdestination_block_id: ID of the basic block this branch jumps to
Each call has the following form:
{
"destination_block_id": 1,
"returned": 11,
"source_block_id": 13
}
Fields of the call element have following semantics:
returned: number of times a function call returned (call count is equal toline::count)isource_block_id: ID of the basic block where this call happensdestination_block_id: ID of the basic block this calls continues after return
Each condition has the following form:
{
"count": 4,
"covered": 2,
"not_covered_false": [],
"not_covered_true": [0, 1],
}
Fields of the condition element have following semantics:
count: number of condition outcomes in this expressioncovered: number of covered condition outcomes in this expressionnot_covered_true: terms, by index, not seen as true in this expressionnot_covered_false: terms, by index, not seen as false in this expression
-H,--human-readableโ Write counts in human readable format (like24.6k). ๐ธ-k,--use-colorsโ Use colors for lines of code that have zero coverage. We use red color for non-exceptional lines and cyan for exceptional. Same colors are used for basic blocks with the-aoption. ๐จ-l,--long-file-namesโ bestie, this one makes long file names for included source files. So if header filex.hcontains code, and was included in filea.c, then runninggcovona.cwill produce an output file calleda.c##x.h.gcovinstead ofx.h.gcov. This can be useful ifx.his included in multiple source files and you want to see the individual contributions. If you use the-poption, both the including and included file names will be complete path names. ๐-m,--demangled-namesโ show demangled function names in output. The default is to show mangled function names. โจ-n,--no-outputโ do not create thegcovoutput file. ๐ซ-o directory|file,--object-directory directory,--object-file fileโ specify either the directory containing thegcovdata files, or the object path name. The.gcno, and.gcdadata files are searched for using this option. If a directory is specified, the data files are in that directory and named after the input file name, without its extension. If a file is specified here, the data files are named after that file, without its extension. ๐-p,--preserve-pathsโ preserve complete path information in the names of generated.gcovfiles. Without this option, just the filename component is used. With this option, all directories are used, with/characters translated to#characters,.directory components removed and unremoveable..components renamed to^. This is useful if sourcefiles are in several different directories. ๐ค๏ธ-q,--use-hotness-colorsโ emit perf-like colored output for hot lines. Legend of the color scale is printed at the very beginning of the output file. ๐ฅ-r,--relative-onlyโ only output information about source files with a relative pathname (after source prefix elision). Absolute paths are usually system header files and coverage of any inline functions therein is normally uninteresting. ๐-s directory,--source-prefix directoryโ a prefix for source file names to remove when generating the output coverage files. This option is useful when building in a separate directory, and the pathname to the source directory is not wanted when determining the output file names. Note that this prefix detection is applied before determining whether the source file is absolute. โ๏ธ-t,--stdoutโ output to standard output instead of output files. ๐จ๏ธ-u,--unconditional-branchesโ when branch probabilities are given, include those of unconditional branches. Unconditional branches are normally not interesting. ๐ค-v,--versionโ display thegcovversion number (on the standard output), and exit without doing any further processing. ๐-w,--verboseโ print verbose informations related to basic blocks and arcs. ๐ฃ๏ธ-x,--hash-filenamesโ when using--preserve-paths,gcovuses the full pathname of the source files to create an output filename. This can lead to long filenames that can overflow filesystem limits. This option creates names of the formsource-file##md5.gcov, where thesource-filecomponent is the final filename part and themd5component is calculated from the full mangled name that would have been used otherwise. The option is an alternative to the--preserve-pathson systems which have a filesystem limit. ๐งฎ
okay so gcov should be run with the current directory the same as that when you invoked the compiler. Otherwise it will not be able to locate the source files. gcov produces files called mangledname.gcov in the current directory. These contain the coverage information of the source file they correspond to. One .gcov file is produced for each source (or header) file containing code, which was compiled to produce the data files. The mangledname part of the output file name is usually simply the source file name, but can be something more complicated if the -l or -p options are given. Refer to those options for details. ๐ซถ
If you invoke gcov with multiple input files, the contributions from each input file are summed. Typically you would invoke it with the same list of files as the final link of your executable. ๐
The .gcov files contain the : separated fields along with program source code. The format is
<execution_count>:<line_number>:<source line text>
Additional block information may succeed each line, when requested by command line option. The execution_count is - for lines containing no code. Unexecuted lines are marked ##### or =====, depending on whether they are reachable by non-exceptional paths or only exceptional paths such as C++ exception handlers, respectively. Given the -a option, unexecuted blocks are marked $$$$$ or %%%%%, depending on whether a basic block is reachable via non-exceptional or exceptional paths. Executed basic blocks having a statement with zero execution_count end with * character and are colored with magenta color with the -k option. This functionality is not supported in Ada. ๐ญ
Note that GCC can completely remove the bodies of functions that are not needed -- for instance if they are inlined everywhere. Such functions are marked with -, which can be confusing. Use the -fkeep-inline-functions and -fkeep-static-functions options to retain these functions and allow gcov to properly show their execution_count. ๐
Some lines of information at the start have line_number of zero. These preamble lines are of the form
-:0:<tag>:<value>
The ordering and number of these preamble lines will be augmented as gcov development progresses --- do not rely on them remaining unchanged. Use tag to locate a particular preamble line. ๐
The additional block information is of the form
<tag> <information>
The information is human readable, but designed to be simple enough for machine parsing too. ๐ค
When printing percentages, 0% and 100% are only printed when the values are exactly 0% and 100% respectively. Other values which would conventionally be rounded to 0% or 100% are instead printed as the nearest non-boundary value. ๐ฏ
When using gcov, you must first compile your program with a special GCC option --coverage. This tells the compiler to generate additional information needed by gcov (basically a flow graph of the program) and also includes additional code in the object files for generating the extra profiling information needed by gcov. These additional files are placed in the directory where the object file is located. ๐๏ธ
Running the program will cause profile output to be generated. For each source file compiled with -fprofile-arcs, an accompanying .gcda file will be placed in the object file directory. ๐
Running gcov with your program's source file names as arguments will now produce a listing of the code along with frequency of execution for each line. For example, if your program is called tmp.cpp, this is what you see when you use the basic gcov facility:
$ g++ --coverage tmp.cpp -c
$ g++ --coverage tmp.o
$ a.out
$ gcov tmp.cpp -m
File 'tmp.cpp'
Lines executed:92.86% of 14
Creating 'tmp.cpp.gcov'
The file tmp.cpp.gcov contains output from gcov. Here is a sample:
-: 0:Source:tmp.cpp
-: 0:Working directory:/home/gcc/testcase
-: 0:Graph:tmp.gcno
-: 0:Data:tmp.gcda
-: 0:Runs:1
-: 0:Programs:1
-: 1:#include <stdio.h>
-: 2:
-: 3:template<class T>
-: 4:class Foo
-: 5:{
-: 6: public:
1*: 7: Foo(): b (1000) {}
------------------
Foo<char>::Foo():
#####: 7: Foo(): b (1000) {}
------------------
Foo<int>::Foo():
1: 7: Foo(): b (1000) {}
------------------
2*: 8: void inc () { b++; }
------------------
Foo<char>::inc():
#####: 8: void inc () { b++; }
------------------
Foo<int>::inc():
2: 8: void inc () { b++; }
------------------
-: 9:
-: 10: private:
-: 11: int b;
-: 12:};
-: 13:
-: 14:template class Foo<int>;
-: 15:template class Foo<char>;
-: 16:
-: 17:int
1: 18:main (void)
-: 19:{
-: 20: int i, total;
1: 21: Foo<int> counter;
-: 22:
1: 23: counter.inc();
1: 24: counter.inc();
1: 25: total = 0;
-: 26:
11: 27: for (i = 0; i < 10; i++)
10: 28: total += i;
-: 29:
1*: 30: int v = total > 100 ? 1 : 2;
-: 31:
1: 32: if (total != 45)
#####: 33: printf ("Failure\n");
-: 34: else
1: 35: printf ("Success\n");
1: 36: return 0;
-: 37:}
Note that line 7 is shown in the report multiple times. First occurrence presents total number of execution of the line and the next two belong to instances of class Foo constructors. As you can also see, line 30 contains some unexecuted basic blocks and thus execution count has asterisk symbol. ๐
When you use the -a option, you will get individual block counts, and the output looks like this:
-: 0:Source:tmp.cpp
-: 0:Working directory:/home/gcc/testcase
-: 0:Graph:tmp.gcno
-: 0:Data:tmp.gcda
-: 0:Runs:1
-: 0:Programs:1
-: 1:#include <stdio.h>
-: 2:
-: 3:template<class T>
-: 4:class Foo
-: 5:{
-: 6: public:
1*: 7: Foo(): b (1000) {}
------------------
Foo<char>::Foo():
#####: 7: Foo(): b (1000) {}
------------------
Foo<int>::Foo():
1: 7: Foo(): b (1000) {}
------------------
2*: 8: void inc () { b++; }
------------------
Foo<char>::inc():
#####: 8: void inc () { b++; }
------------------
Foo<int>::inc():
2: 8: void inc () { b++; }
------------------
-: 9:
-: 10: private:
-: 11: int b;
-: 12:};
-: 13:
-: 14:template class Foo<int>;
-: 15:template class Foo<char>;
-: 16:
-: 17:int
1: 18:main (void)
-: 19:{
-: 20: int i, total;
1: 21: Foo<int> counter;
1: 21-block 0
-: 22:
1: 23: counter.inc();
1: 23-block 0
1: 24: counter.inc();
1: 24-block 0
1: 25: total = 0;
-: 26:
11: 27: for (i = 0; i < 10; i++)
1: 27-block 0
11: 27-block 1
10: 28: total += i;
10: 28-block 0
-: 29:
1*: 30: int v = total > 100 ? 1 : 2;
1: 30-block 0
%%%%%: 30-block 1
1: 30-block 2
-: 31:
1: 32: if (total != 45)
1: 32-block 0
#####: 33: printf ("Failure\n");
%%%%%: 33-block 0
-: 34: else
1: 35: printf ("Success\n");
1: 35-block 0
1: 36: return 0;
1: 36-block 0
-: 37:}
okay so in this mode, every basic block only gets one line in the whole show โ and it's the last line of the block. ๐ that's the rule, no exceptions, bestie.
A multi-line block? bestie it only ever adds to the execution count of that last line. the other lines in the block don't get shown as containing code, unless previous blocks happen to end on those lines. ๐ so the total execution count for a line gets printed, and then the lines right after it show the execution counts for the individual blocks that end on that line. and after each block, the branch and call counts of that block show up too โ but only if you passed the -b option. ๐
Because of the way GCC instruments calls, you can get a call count printed after a line that has no individual blocks at all. and yeah, look at it โ line 33 contains a basic block that never got executed. rip fr fr. ๐
When you use the -b option, your output looks like this:
-: 0:Source:tmp.cpp
-: 0:Working directory:/home/gcc/testcase
-: 0:Graph:tmp.gcno
-: 0:Data:tmp.gcda
-: 0:Runs:1
-: 0:Programs:1
-: 1:#include <stdio.h>
-: 2:
-: 3:template<class T>
-: 4:class Foo
-: 5:{
-: 6: public:
1*: 7: Foo(): b (1000) {}
------------------
Foo<char>::Foo():
function Foo<char>::Foo() called 0 returned 0% blocks executed 0%
#####: 7: Foo(): b (1000) {}
------------------
Foo<int>::Foo():
function Foo<int>::Foo() called 1 returned 100% blocks executed 100%
1: 7: Foo(): b (1000) {}
------------------
2*: 8: void inc () { b++; }
------------------
Foo<char>::inc():
function Foo<char>::inc() called 0 returned 0% blocks executed 0%
#####: 8: void inc () { b++; }
------------------
Foo<int>::inc():
function Foo<int>::inc() called 2 returned 100% blocks executed 100%
2: 8: void inc () { b++; }
------------------
-: 9:
-: 10: private:
-: 11: int b;
-: 12:};
-: 13:
-: 14:template class Foo<int>;
-: 15:template class Foo<char>;
-: 16:
-: 17:int
function main called 1 returned 100% blocks executed 81%
1: 18:main (void)
-: 19:{
-: 20: int i, total;
1: 21: Foo<int> counter;
call 0 returned 100%
branch 1 taken 100% (fallthrough)
branch 2 taken 0% (throw)
-: 22:
1: 23: counter.inc();
call 0 returned 100%
branch 1 taken 100% (fallthrough)
branch 2 taken 0% (throw)
1: 24: counter.inc();
call 0 returned 100%
branch 1 taken 100% (fallthrough)
branch 2 taken 0% (throw)
1: 25: total = 0;
-: 26:
11: 27: for (i = 0; i < 10; i++)
branch 0 taken 91% (fallthrough)
branch 1 taken 9%
10: 28: total += i;
-: 29:
1*: 30: int v = total > 100 ? 1 : 2;
branch 0 taken 0% (fallthrough)
branch 1 taken 100%
-: 31:
1: 32: if (total != 45)
branch 0 taken 0% (fallthrough)
branch 1 taken 100%
#####: 33: printf ("Failure\n");
call 0 never executed
branch 1 never executed
branch 2 never executed
-: 34: else
1: 35: printf ("Success\n");
call 0 returned 100%
branch 1 taken 100% (fallthrough)
branch 2 taken 0% (throw)
1: 36: return 0;
-: 37:}
For every single function, there's a line printed that tells you how many times the function got called, how many times it returned, and what percentage of that function's blocks actually executed. ๐ธ
For every basic block, a line gets printed after the last line of that basic block, describing the branch or the call that ends the block. and bestie, there can be multiple branches and calls listed for a single source line โ that happens when multiple basic blocks all end on that same line. in that case, each branch and each call gets its own number. ๐
ngl there's no simple way to map these branches and calls back to the source constructs they came from. but like, in general, the lowest-numbered branch or call is gonna correspond to the leftmost construct on that source line. iykyk. ๐ซถ
For a branch: if it got executed at least once, you get a percentage โ times the branch was taken divided by times the branch was executed. if it never ran, you just get the message "never executed". ๐
For a call: if it got executed at least once, you get a percentage โ times the call returned divided by times the call was executed. usually that's 100%, but it can be lower for functions that call "exit" or "longjmp", because those lil guys might not return every single time they're called. ๐ญ periodt.
The execution counts are cumulative. so if you ran the example program again without deleting the .gcda file, the count for how many times each line in the source got executed would just get added onto the results from the previous run(s). and honestly? that's lowkey super useful in a bunch of ways. โจ like, you could use it to accumulate data across a whole bunch of program runs as part of a test verification suite, or to get more accurate long-term info over a huge number of runs. main character energy fr. ๐
The data in the .gcda files gets saved immediately before the program exits. here's the tea: for each source file compiled with -fprofile-arcs, the profiling code first tries to read in an existing .gcda file; if that file doesn't match the executable (like, a differing number of basic block counts) then it's just gonna ignore the contents of the file entirely. ๐ then it adds in the new execution counts, and finally writes the data out to the file. slay.
๐ Using gcov with GCC Optimization ๐
If you're planning to use gcov to help optimize your code, bestie, you have to compile your program with a special GCC option first: --coverage. no cap. other than that? you can use literally any other GCC options you want. ๐
But โ and this is the important part โ if you actually want to prove that every single line in your program got executed, you should not compile with optimization at the same time. ๐จ because on some machines, the optimizer can straight up eliminate simple code lines by combining them with other lines.
For example, code like this:
if (a != b)
c = 1;
else
c = 0;
can get compiled down into one single instruction on some machines. and in that case, there's like... no way for gcov to calculate separate execution counts for each line, because there literally isn't separate code for each line anymore. ๐ญ so the gcov output looks like this if you compiled the program with optimization:
100: 12:if (a != b)
100: 13: c = 1;
100: 14:else
100: 15: c = 0;
The output is showing that this block of code, combined by optimization, executed 100 times. and like, in one sense this result is correct โ because there was only one instruction representing all four of these lines. but the output does not indicate how many times the result was 0 and how many times the result was 1. ๐ so frustrating, i know.
Inlineable functions can also create unexpected line counts, which is a whole vibe. Line counts get shown for the source code of the inlineable function, but what actually gets shown depends on where the function is inlined โ or if it's not inlined at all. ๐ฆ
okay so picture this, bestie: the function did not get inlined, which means the compiler has to emit an out of line copy of it โ into literally any object file that needs one ๐
. So if fileA.o and fileB.o both contain out of line bodies of a particular inlineable function, they both also carry coverage counts for that function. and when fileA.o and fileB.o get linked together? on many systems the linker will select one of those out of line bodies for all calls to that function, and remove or ignore the other one. iconic of the linker, honestly ๐ซถ
but here's the heartbreak ๐ญ โ it will not remove the coverage counters for the unused function body. so when it's instrumented, all but one use of that function will show zero counts. ghost town energy fr fr ๐
now flip it: if the function is inlined in several places, the block structure at each of those locations might not be the same. like, a condition might now be calculable at compile time in some of those instances โญ. and because the coverage of all the uses of the inline function gets shown for the same source lines, the line counts themselves might seem inconsistent. it's giving messy, but it's just how it is ๐
Long-running applications can use the __gcov_reset and __gcov_dump facilities to restrict profile collection to the program region of interest โจ. Calling __gcov_reset(void) will clear all run-time profile counters to zero, and calling __gcov_dump(void) will cause the profile information collected at that point to be dumped to .gcda output files.
instrumented applications use a static destructor with priority 99 to invoke the __gcov_dump function ๐. so __gcov_dump is executed after all user defined static destructors, as well as handlers registered with atexit. order matters, bestie, no cap.
If an executable loads a dynamic shared object via dlopen functionality, -Wl,--dynamic-list-data is needed to dump all profile data ๐. don't forget it, or your profile data is gonna be like where did it go ๐.
The profiling run-time library reports various errors related to profile manipulation and profile saving ๐ญ. errors are printed into standard error output, or into the GCOV_ERROR_FILE file โ if that environment variable is used. and if you want to terminate immediately after an error occurs, set the GCOV_EXIT_AT_ERROR environment variable ๐ฅ. that can help users find profile clashing which leads to a misleading profile. very main character of an environment variable, honestly.
๐ธ SEE ALSO ๐ธ
gpl(7), gfdl(7), fsf-funding(7), gcc(1) and the Info entry for gcc. go read 'em, iykyk ๐
๐ COPYRIGHT ๐
Copyright (c) 1996-2024 Free Software Foundation, Inc.
Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.3 or any later version published by the Free Software Foundation; with the Invariant Sections being "GNU General Public License" and "Funding Free Software", the Front-Cover texts being (a) (see below), and with the Back-Cover Texts being (b) (see below). A copy of the license is included in the gfdl(7) man page.
(a) The FSF's Front-Cover Text is:
A GNU Manual
(b) The FSF's Back-Cover Text is:
You have freedom to copy and modify this GNU Manual, like GNU
software. Copies published by the Free Software Foundation raise
funds for GNU development.
and that's a wrap on the whole page, bestie ๐โจ this one shipped as gcc-14.4.0, dated 2026-06-26 โ go forth and gcov, you absolute icon ๐๐
๐ฆ where this page comes from
- ubuntu stonking: gcc-14-loongarch64-linux-gnu 14.4.0-2ubuntu1cross2
- ๐ girlified by deepseek-ai/DeepSeek-V4.1-Flash on : a language model's rewrite of the original, under its terms