Several more enumerations were changed to enumeration classes. While more of these included a size of enumerator, they were not being used. This included the translator test mode, translator reference type, dictionary entry type, error list type, program model operation type, and the table multiple enumerations. Two instances where the enum keyword was in front of the enumeration name were removed (this is something required for C but not C++).
This leaves several enumerations that are not as easy as adding the class keyword and renaming the enumerators like those changed above. These include the code (auto-generated), token status (auto-generated), sub-code (bit masks), table flag (bit masks), table search type, token type, and test option enumerations.
The auto-generated enumerations need a good C++ solution and not the current kludgy C solution using an external awk script. The bit mask enumerations will need operator functions implemented (bit-wise OR and AND), which will require using type casting. For the others, the size of enumerators are used for either dimensioning arrays or for looping over the enumerators.
[branch cpp11 commit e71fe6f0fe]
Sunday, August 17, 2014
Data Type As Enumeration Class
Now that the number of and size of enumerators of the data type enumeration have been removed, there was one more enumerator left that needed to be removed if possible, specifically the No_DataType enumerator that was assigned to a -1, which was used to indicate an unset data type. If this enumerator was left in place, then switch statements would need to have a case for it or would need a blank default.
C++11 allows a default enumerator in the form EnumName{} just like for any other type. For user types, it calls the default constructor (if there is one, else a compile error is reported). For built in types, the value is assigned a zero. And so is the case for a default enumerator, which also has the equivalent value of zero. For unscoped enumerations, the value is zero, but for an enumeration class, the value can't be used as an integer without a cast.
Therefore, the No_DataType enumerator was replaced with the default enumerator DataType{}. In addition, the first enumerator can't have the default value of zero, so was assigned to the value of one. This is not an issue since data type enumerators are no longer used as indexes to array (only as keys to maps). All of the Xx_DataType enumerators were changed to just Xx in the class enumeration definition and to DataType::Xx for all uses in the code since the enumerators are now scoped.
There was one remaining issue. The test names awk script scanned the header file for the data type enumeration and created an array of C style strings with the names of the enumerator. As the string This awk script generates the test names header file used in the test source file for converting enumerators to strings for test output. The awk script was modified to instead look for the enumeration class and to generate an unordered map. This code was put into a new function in the script. This script also generates C style string arrays for the code and token type enumerations. These will also be changed at some point.
[branch cpp11 commit 06ef6f17c5]
C++11 allows a default enumerator in the form EnumName{} just like for any other type. For user types, it calls the default constructor (if there is one, else a compile error is reported). For built in types, the value is assigned a zero. And so is the case for a default enumerator, which also has the equivalent value of zero. For unscoped enumerations, the value is zero, but for an enumeration class, the value can't be used as an integer without a cast.
Therefore, the No_DataType enumerator was replaced with the default enumerator DataType{}. In addition, the first enumerator can't have the default value of zero, so was assigned to the value of one. This is not an issue since data type enumerators are no longer used as indexes to array (only as keys to maps). All of the Xx_DataType enumerators were changed to just Xx in the class enumeration definition and to DataType::Xx for all uses in the code since the enumerators are now scoped.
There was one remaining issue. The test names awk script scanned the header file for the data type enumeration and created an array of C style strings with the names of the enumerator. As the string This awk script generates the test names header file used in the test source file for converting enumerators to strings for test output. The awk script was modified to instead look for the enumeration class and to generate an unordered map. This code was put into a new function in the script. This script also generates C style string arrays for the code and token type enumerations. These will also be changed at some point.
[branch cpp11 commit 06ef6f17c5]
Size of Data Types Enumerator
The size of enumerator was removed but it was used for the dimension of two arrays. Both of these arrays were two dimensional, so some sort of compound map would have been needed. Instead, simple switch statements and conditional operators were used. This should be nearly as efficient as an array as the compiler may generate a lookup table for a switch and this is not in highly critical code so absolute efficiency is not required.
The first array was used to obtain a conversion code needed to convert the data type in a token to the desired data type. The conversion code obtained could be a null code representing no conversion needed or an invalid code representing a data type that can't be converted.
This array was used by the convert code and find code functions in the Table class. The convert code function was modified to process the two data types directly using compound switch statements (the first on the token data type, and the second on the needed data type). The find code function used the array for a data type in a token with the needed data type and so was changed to simply call the convert code function instead.
The second used of the size of enumerator was to dimension the an array used in the expected error status function of the Translator class. This array was dimensioned for the number of data types and the number of reference types (none, variable, variable or defined function, or all) and used to obtain a token error status when a reference is expected but not found. This function was changed to use a compound switch statement (the first on the data type, and the second on the reference type or the tertiary operator was used where a second switch was overkill). The size of enumerator for the reference enumerator was only used for this array and was also removed.
[branch cpp11 commit 4183a87f74]
The first array was used to obtain a conversion code needed to convert the data type in a token to the desired data type. The conversion code obtained could be a null code representing no conversion needed or an invalid code representing a data type that can't be converted.
This array was used by the convert code and find code functions in the Table class. The convert code function was modified to process the two data types directly using compound switch statements (the first on the token data type, and the second on the needed data type). The find code function used the array for a data type in a token with the needed data type and so was changed to simply call the convert code function instead.
The second used of the size of enumerator was to dimension the an array used in the expected error status function of the Translator class. This array was dimensioned for the number of data types and the number of reference types (none, variable, variable or defined function, or all) and used to obtain a token error status when a reference is expected but not found. This function was changed to use a compound switch statement (the first on the data type, and the second on the reference type or the tertiary operator was used where a second switch was overkill). The size of enumerator for the reference enumerator was only used for this array and was also removed.
[branch cpp11 commit 4183a87f74]
Saturday, August 16, 2014
Number of Data Types Enumerator
Not only does the data type enumerator have the size of enumerator (which needs to be removed before changing to an enumeration class), it also has a number of enumerator, which was placed after the three main data types (double, integer and string). This enumerator was removed, but is was used to dimension two arrays that needed to be changed.
In the Table constructor, there is a section that scans the secondary associated codes of a main code, the purpose of which is to set the expected data type for the main code. If the main code has associated codes for both doubles and integers, the expected data type is set to number (for example, the minus operator); and if there are associated codes for all three types (numbers and string), the expected data type is set to any (for example, the plus operator).
This is accomplished by using bit masks where there is a bit for each type (double, integer and string). For each associated code, the data type of the code is bit-wise ORed together. After all the associated codes are scanned, the final value is checked to see if it as the two number bits set or all three bits set to determine the expected data type.
Originally, an array of three elements was defined with the bit masks for the three data types. The number of enumerator was used to dimension this array. With the number of enumerator removed, this array was replaced with an unordered map, with an initializer list to set the bit masks for each data type enumerator.
The other use of the number of enumerator was in the equivalent data type function of the Table class, which contained an array from data type to equivalent data type, but when the sub-string and temporary string data types were removed, this function ended up essentially just returning the data type passed to it. In other words, this function is no longer does anything, so it was removed and the one use of it was replaced with the data type (in the LET translator routine).
[branch cpp11 commit 8f56e1117a]
In the Table constructor, there is a section that scans the secondary associated codes of a main code, the purpose of which is to set the expected data type for the main code. If the main code has associated codes for both doubles and integers, the expected data type is set to number (for example, the minus operator); and if there are associated codes for all three types (numbers and string), the expected data type is set to any (for example, the plus operator).
This is accomplished by using bit masks where there is a bit for each type (double, integer and string). For each associated code, the data type of the code is bit-wise ORed together. After all the associated codes are scanned, the final value is checked to see if it as the two number bits set or all three bits set to determine the expected data type.
Originally, an array of three elements was defined with the bit masks for the three data types. The number of enumerator was used to dimension this array. With the number of enumerator removed, this array was replaced with an unordered map, with an initializer list to set the bit masks for each data type enumerator.
The other use of the number of enumerator was in the equivalent data type function of the Table class, which contained an array from data type to equivalent data type, but when the sub-string and temporary string data types were removed, this function ended up essentially just returning the data type passed to it. In other words, this function is no longer does anything, so it was removed and the one use of it was replaced with the data type (in the LET translator routine).
[branch cpp11 commit 8f56e1117a]
Enumeration Class Hash
In order to use the STL unordered map class, a hash function is required for the key of the map. Hash functions are provided for all the built in types plus some of the other STL classes (like std::string), but unfortunately, not for enumeration classes. For the built in types (integers), the number itself is used as the hash. However, enumeration class enumerator values can't be because they can't be used as integers even though there values are just numbers. The solution is to use a generic (template) function type that will work for all enumeration classes that converts the enumerators to integers:
struct EnumClassHashThis works for any enumeration class by returning an integer for an enumerator (a size_t is an integer that is large enough to cover any enumeration) using a static cast (hopefully the only place a cast will be needed). An unordered map to use an enumeration class with an initializer list to assign values to the enumerators would be defined as:
{
template <typename T>
std::size_t operator()(T t) const
{
return static_cast<std::size_t>(t);
}
};
std::unordered_map<EnumName, QString, EnumClassHash> names {The name of the map does not need to be repeated for an assignment of each value (which could be tedious for a long name or with a lot of enumerators). This does not resolve the issue of forgotten values, but hopefully when an undefined enumerator value is accessed, the default value (in this case a blank string) would be detected or identified easily.
{First_EnumName, "First"},
{Second_EnumName, "Second"},
{Third_EnumName, "Third"}
};
QMap vs. Standard Map (Initializer Lists)
Using enumeration classes will require using an associated array container class (like QMap or QHash) since the size of the enumeration (the number of enumerators) is not obtainable (without kludgy type casting) to dimension an C style array. As mentioned in the previous post, to use a associated array container class requires run-time assignments to fill the container.
C++11 provides a solution with initialize lists. Unfortunately, the Qt containers do no support C++11 initializer lists (specifically Qt4 doesn't because Qt5 does contain support for initializer lists). The Standard Template Library (STL) containers does support initializer lists. Therefore, the STL containers will be used as needed until the inevitable change to Qt5. STL containers are technically already available since the various Qt containers have method functions for converting STL containers to and from Qt containers.
For an associated array, either the QMap or std::map container could be used. Both of these containers order the keys of the elements. Ordering of the keys is not required in this case. Qt provides the QHash class for an associated array not requiring ordered keys. Similarly, STL provides std::unordered_map, which will be the class used.
C++11 provides a solution with initialize lists. Unfortunately, the Qt containers do no support C++11 initializer lists (specifically Qt4 doesn't because Qt5 does contain support for initializer lists). The Standard Template Library (STL) containers does support initializer lists. Therefore, the STL containers will be used as needed until the inevitable change to Qt5. STL containers are technically already available since the various Qt containers have method functions for converting STL containers to and from Qt containers.
For an associated array, either the QMap or std::map container could be used. Both of these containers order the keys of the elements. Ordering of the keys is not required in this case. Qt provides the QHash class for an associated array not requiring ordered keys. Similarly, STL provides std::unordered_map, which will be the class used.
Enumerators As Indexes – Using A Map
The first enumeration that will be changed to an enumeration class will be the data type enumeration. One of the differences with enumerations is that unscoped enumerators can be used as integers. One of the other things I preferred to do when defining an enumeration was add a size of enumerator at the end:
Alternatively, using an associated array (map) instead of a C style array solves the issue of needing to know the size of the enumeration. Compare the array solution to the map solution:
The map method method of using assignments (same for the array method using assignments) can also be error-prone because it is easy to miss an assignment of one of the values. In the array case, a null pointer would be returned, which will probably cause a segmentation fault unless it is checked for.
For the map method, however, accessing a value that doesn't exist simply adds a new element to the map with a default value (in this case a blank string). This is still a problem, but much less fatal. Alternatively, in the case of QMap, the value method function could be used instead of the [] operator, which doesn't add an element for a non-existing element and allows a default value to be returned for the non-existing element (for example, in this case a default value like "BUG" could be used).
enum EnumName {This size of enumerator can then be used to dimension an array, like to hold a conversion to another value (another enumeration, string, etc.). This will not work with enumeration classes because the enumerators can't be used as integers without resorting to kludgy type casting (something I prefer to avoid if possible). Plus, once this size of enumerator is added, then any switch statement using the enumeration will generate a warning since there is no case statement for this enumerator. Adding a blank default statement is also kludgy.
First_EnumName,
Second_EnumName,
Third_EnumName,
sizeof_EnumName
};
Alternatively, using an associated array (map) instead of a C style array solves the issue of needing to know the size of the enumeration. Compare the array solution to the map solution:
QString names[sizeof_EnumName] = { QMap<EnumName, QString> names;The array method is error-prone and care must be taken to make sure the right values (strings in this case) are applied to the right elements in the array. This could be solved by using assignments that would look identical to the map assignments, though may not be as efficient because the assignments are done at run-time instead of at compile time, and the array still needs to be dimensioned.
"First", names[First_EnumName] = "First";
"Second", names[Second_EnumName] = "Second";
"Third" names[Third_EnumName] = "Third";
};
The map method method of using assignments (same for the array method using assignments) can also be error-prone because it is easy to miss an assignment of one of the values. In the array case, a null pointer would be returned, which will probably cause a segmentation fault unless it is checked for.
For the map method, however, accessing a value that doesn't exist simply adds a new element to the map with a default value (in this case a blank string). This is still a problem, but much less fatal. Alternatively, in the case of QMap, the value method function could be used instead of the [] operator, which doesn't add an element for a non-existing element and allows a default value to be returned for the non-existing element (for example, in this case a default value like "BUG" could be used).
C++11 – New Enumeration Class
With original implementation of C/C++ enumerations (enum), I preferred to add a suffix to each of the enumerators to associate them to the enumeration so that when one appears in the code, it is easy to identify it to the enumeration:
C++11 introduces a new enum class where the enumerators are scoped inside the enumeration. The enumerators for these are also more strongly typed then the normal enumerations (which represent integers and can be used as such). As an enumeration class, the above enumeration becomes:
[branch cpp11 commit 2a8e3899ee]
enum EnumName {Without this suffix, it is difficult to see which enumeration the value is associated to. (Though using an IDE like Qt Creator, there is a command to go right to the definition.) In addition, obviously the same name can't be used for two different enumerations. A suffix (a prefix could have been used instead) solves this issue.
First_EnumName,
Second_EnumName,
Third_EnumName
};
C++11 introduces a new enum class where the enumerators are scoped inside the enumeration. The enumerators for these are also more strongly typed then the normal enumerations (which represent integers and can be used as such). As an enumeration class, the above enumeration becomes:
enum class EnumName {In order to use these enumerations, they must be scoped, so to refer to the second enumerator, the name EnumName::Second would be used. This is similar to my solution of using suffix (in this case it is a prefix). An example of an enumeration class was added to the try compile test program. The intention is to change the enumerations used in the project to enumeration classes.
First,
Second,
Third
};
[branch cpp11 commit 2a8e3899ee]
Thursday, August 14, 2014
Project – Enable C++11 Compiling
By default, GCC C++ compiles for the corrected C++98 standard (C++03) with GNU extensions (there is no option for compiling for the uncorrected original C++98 standard). There are two options for compiling C++11, one for the standard and one with GNU extensions. The option for the standard C++11 will be used and was added to the CMake build file.
Though not necessary, I decided that it was a reasonable idea to validate that C++11 compiling was enabled and that C++11 was supported while generating the make file. This meant adding a try_compile command to the CMake build file for a simple C++11 program. If compiling of the simple program fails, an error is reported and CMake aborts.
The initial simple C++11 program tests two C++11 features. As more C++11 features are used in the project, this simple program will be expanded to test those features also. The two initial features tested are the new universal initializer syntax and the new null pointer. Click Continue... for details of these two features.
I discovered something about CMake syntax, namely else and endif statements no longer require repeating the expression in the if statement (as of CMake 2.6.0). The expression may now be left empty. Repeating the expression can sometimes be misleading, for example:
There was also a statement in the CMake build file that obtained the GCC version for checking, but statements that were checking the version have been since removed, so this statement was also removed. Work is now taking place on a new cpp11 branch.
[branch cpp11 commit 18ed38e9af]
Though not necessary, I decided that it was a reasonable idea to validate that C++11 compiling was enabled and that C++11 was supported while generating the make file. This meant adding a try_compile command to the CMake build file for a simple C++11 program. If compiling of the simple program fails, an error is reported and CMake aborts.
The initial simple C++11 program tests two C++11 features. As more C++11 features are used in the project, this simple program will be expanded to test those features also. The two initial features tested are the new universal initializer syntax and the new null pointer. Click Continue... for details of these two features.
I discovered something about CMake syntax, namely else and endif statements no longer require repeating the expression in the if statement (as of CMake 2.6.0). The expression may now be left empty. Repeating the expression can sometimes be misleading, for example:
if (NOT ${SOMETHING})Which makes it seem like the else part is for handling the "not something" condition. Leaving the expression blank, as in else() and endif(), is much less confusing. The rest of the if-else-endif statements in the CMake file will be updated to this style at some point. (This syntax was already used for handling issues with Windows.)
... <not something processing here> ...
else (NOT ${SOMETHING})
... <something procession here> ...
endif (NOT ${SOMETHING})
There was also a statement in the CMake build file that obtained the GCC version for checking, but statements that were checking the version have been since removed, so this statement was also removed. Work is now taking place on a new cpp11 branch.
[branch cpp11 commit 18ed38e9af]
Wednesday, August 13, 2014
Project – Compiler Warnings
In [Stroustrup, 2013], he frequently mentions that for questionably formed C++ statements that the compiler should issue a warning. This made me realize that only the default warnings in the compiler were being used. To possibly catch more problems, all of the warnings were enabled using the following GCC compiler options:
[commit bb0124444f]
-Wall enable all (well actually most) warningsThe last option causes the compiler to abort after issuing a warning instead of proceeding, which will require the warning to be corrected; however, this does not affect warnings from pedantic option, therefore the -pendantic-errors was used instead, which has the same affect. After adding these options, several warnings were reported, which were of six different types. Click Continue... for details of these warning types that were corrected. Since this commit is development related and not specific to any topic, the commit was just made to the develop branch.
-Wextra enable warnings not enabled by -Wall
-pedantic enable warnings demanded by strict ISO C++ standard
-Werrors cause compiler to treat warnings as errors
[commit bb0124444f]
Tuesday, August 12, 2014
Transitioning to the New Branching Model
The current topic in development was integrating the program model with recreator into the edit box, which has been going well, but there is at least one issue remaining. When the text for a line entered in the edit box is recreated line replaced back into the edit box, extra undo commands are added to the undo stack. So upon undoing the line, it firsts undoes the recreation and then undoes the change. This issue will probably not be trivial to correct.
I want to start working on improving the C++ usage including using features that are part of the C++11 standard. This implies a new topic branch for this work. A topic branch is also needed for the recreator to edit box integration, somewhere on the current branch0.6 branch. Finally for the new branching model, the develop branch is needed somewhere.
Since v0.6.1 was the last tag, the develop branch should go at this tag. For the new C++11 branch, it should branch off of the develop branch (at this tag). However, a lot of improvements are on the current branch0.6 branch, so I've decided to split branches further on from the last tag.
Therefore, the new develop branch was created at branch0.6. The current branch0.6 was dead ended with an appropriate abandoned commit. There will be no more of these branches. Normally, git does not allow an empty commit with just a message, but this can be circumvented by using the --allow-empty option on the commit command.
A new recreator-editbox topic branch was placed at where the failing encoder test expected results were corrected before the latest two commits where the various Windows build issues were corrected since these commits have nothing to with this topic. When work commences on this topic, changes can be merged from the develop branch.
[commit d3bb314f24] [commit 727f7d223f]
I want to start working on improving the C++ usage including using features that are part of the C++11 standard. This implies a new topic branch for this work. A topic branch is also needed for the recreator to edit box integration, somewhere on the current branch0.6 branch. Finally for the new branching model, the develop branch is needed somewhere.
Since v0.6.1 was the last tag, the develop branch should go at this tag. For the new C++11 branch, it should branch off of the develop branch (at this tag). However, a lot of improvements are on the current branch0.6 branch, so I've decided to split branches further on from the last tag.
Therefore, the new develop branch was created at branch0.6. The current branch0.6 was dead ended with an appropriate abandoned commit. There will be no more of these branches. Normally, git does not allow an empty commit with just a message, but this can be circumvented by using the --allow-empty option on the commit command.
A new recreator-editbox topic branch was placed at where the failing encoder test expected results were corrected before the latest two commits where the various Windows build issues were corrected since these commits have nothing to with this topic. When work commences on this topic, changes can be merged from the develop branch.
[commit d3bb314f24] [commit 727f7d223f]
Monday, August 11, 2014
Project – New Git Branching Model
I found a better Git branching model. Currently, a branch is created for the development release series. For example, branch0.5 was created for all the 0.5.x versions (0.5.0 through 0.5.3). Once this development series was completed, the branch was merged back to the master branch. Since there were no other changes on the master branch, the pointer to master was simply moved from 0.4.6 (the last of the 0.4 development series) to 0.5.3 - what is known as a fast-forward merge. In the end though, the repository is just a long row of linear commits.
The new Git branch model is detailed in this blog post. I'm going to adopt this branching model. The main development branch will be named develop, which will replace the branchX.X branches that has been used for development. When development is ready for a release, a releaseX.X branch will be created from the develop branch. There will be at least one commit used for updating the version number, and possibly another to do minor clean up (like fixing comments), plus any for possible platform related bug fixes discovered during testing. This will replace the "updated files for release X.X.X" commits just before a release. If testing goes well (on all platforms), then this branch will be merged to master and tagged for the release (as vX.X.X).
When a new feature, function or change is being added (what is called a "topic"), a topic branch will be created off of the develop branch and will be named for the topic. This will more clearly state what is being developed (branchX.X states nothing except the release series). When the topic is complete, it will be merged back to the develop branch. If for some reason the topic doesn't work out, then the branch will abandoned and an empty commit will be made with the reason for the abandonment. These topic branches will allow more when one topic to be worked on at a given time.
This model also allows for hit fixes to the master branch, where a hotfix-X.X.X branch will be created for the fix (which includes the proposed hot fix version number). Once complete, the hot fix branch will be merged backed to the master branch, and it can be merged to the develop branch as needed.
As the blog post explains, all merges will use the no-fast-forward option (--no-ff), meaning that Git will make a merge commit showing the branch being merged instead of just moving the branch pointer. Using this option will allow it to be cleary seen where the branch started and where it was merged. With the current model, there is no way to see where the branch originally started, only where it ended up (assuming it isn't deleted, which is why the older development branches were not deleted).
The new Git branch model is detailed in this blog post. I'm going to adopt this branching model. The main development branch will be named develop, which will replace the branchX.X branches that has been used for development. When development is ready for a release, a releaseX.X branch will be created from the develop branch. There will be at least one commit used for updating the version number, and possibly another to do minor clean up (like fixing comments), plus any for possible platform related bug fixes discovered during testing. This will replace the "updated files for release X.X.X" commits just before a release. If testing goes well (on all platforms), then this branch will be merged to master and tagged for the release (as vX.X.X).
When a new feature, function or change is being added (what is called a "topic"), a topic branch will be created off of the develop branch and will be named for the topic. This will more clearly state what is being developed (branchX.X states nothing except the release series). When the topic is complete, it will be merged back to the develop branch. If for some reason the topic doesn't work out, then the branch will abandoned and an empty commit will be made with the reason for the abandonment. These topic branches will allow more when one topic to be worked on at a given time.
This model also allows for hit fixes to the master branch, where a hotfix-X.X.X branch will be created for the fix (which includes the proposed hot fix version number). Once complete, the hot fix branch will be merged backed to the master branch, and it can be merged to the develop branch as needed.
As the blog post explains, all merges will use the no-fast-forward option (--no-ff), meaning that Git will make a merge commit showing the branch being merged instead of just moving the branch pointer. Using this option will allow it to be cleary seen where the branch started and where it was merged. With the current model, there is no way to see where the branch originally started, only where it ended up (assuming it isn't deleted, which is why the older development branches were not deleted).
Sunday, August 10, 2014
Building and Running on Windows 8.1 – Command Line
The application can also be built using the command line, either from the Windows Command Prompt or from the BASH shell that comes with Git for Windows named Git Bash in the menu or start screen. However, the procedure is slightly different between the two. The procedures below include cloning the IBCP Git repository. Here are the steps for using Git Bash:
Here are the steps for using the Command Prompt:
In step 11, the batch file will run all the tests and then it will compare the first set of results (parser tests). If the tests are successful it will say OK for each file. Answer N for comparing more files. The next set of results will be compared. Answer N after each comparison (otherwise it will prompt for more files to compare).
In step 8 for Git Bash and steps 8 and 9 for the Command Prompt, add -DCMAKE_BUILD_TYPE=Debug before the source directory to do a debug build.
- cd Documents
- git clone https://github.com/thunder422/ibcp
- cd ibcp (shows master is the current branch)
- git checkout branch0.6 (now shows branch0.6 is the current branch)
- cd ..
- mkdir ibcp-build
- cd ibcp-build
- cmake -G "MSYS Makefiles" -DCMAKE_MAKE_PROGRAM=mingw32-make ../ibcp
- mingw32-make
- regtest (runs the Linux regression test script)
Here are the steps for using the Command Prompt:
- cd Documents
- git clone https://github.com/thunder422/ibcp
- cd ibcp
- git checkout branch0.6
- cd ..
- md ibcp-build
- cd ibcp-build
- cmake -G "MinGW Makefiles" ../ibcp (produces errors - see below)
- cmake -G "MinGW Makefiles" ../ibcp
- mingw32-make
- regtest (runs Windows regression test batch file)
In step 11, the batch file will run all the tests and then it will compare the first set of results (parser tests). If the tests are successful it will say OK for each file. Answer N for comparing more files. The next set of results will be compared. Answer N after each comparison (otherwise it will prompt for more files to compare).
In step 8 for Git Bash and steps 8 and 9 for the Command Prompt, add -DCMAKE_BUILD_TYPE=Debug before the source directory to do a debug build.
Building and Running on Windows 8.1 – Qt Creator
To obtain the project Git repository, start the Git GUI, either from the Start Menu (Programs, Git, Git GUI), from the Start Screen Git GUI icon or by typing "Git GUI" on the Start Screen (and there are probably other ways). For Windows 8, it probably dumped the Git GUI icon right on the Start Screen. For Windows 8.1, click the Down Arrow at the bottom-left and find the Git GUI under Git (pin to the Start screen if desired).
In the opening dialog of Git GUI, click on Clone Existing Repository. Enter https://github.com/thunder422/ibcp in the Source Location and set to Target Directory by clicking the Browse button. Find the Documents folder (or another folder), and click the OK button. To the Target Directory, add /ibcp (it must be a non-existing folder or and error will occur) and click the Clone button. After a few moments, the repository will be cloned. The next time the Git GUI is started, the same dialog appears, however, the Git GUI remembers the repositories that have been opened previously. Select the Repository menu and the recent repositories are listed.
The main Git GUI will be started indicating it is on the master branch. Check out the latest branch by Branch, Create..., click the Matching Tracking Branch Name option, click the Tracking Branch option, select origin/branch0.6 (or another branch) and click the Create button. This will create a local branch. Now the project can be opened in Qt Creator so start Qt Creator and select File and Open File or Project... and navigate to the Documents and then ibcp folder. Select the CMakeLists file (the .txt is not displayed unless file extensions are enabled) and click the Open button.
The CMake Wizard dialog appears with the build directory set to ...\Documents\ibcp-build, click the Next button. For a debug build (optional) add -DCMAKE_BUILD_TYPE=Debug into the Arguments field and then click the Run CMake button. For some reason, there are a bunch of errors the first time. Just click the Run CMake button again and it should complete successfully. Click the Finish button and the application is ready to be built.
To start the build, click the Hammer icon (lower left, or type Ctrl+B or use the Build menu). The run the program, click the Run/Play icon (lower left, or type Ctrl+R or use the Build menu). For a debug build use the Debug/Play icon (lower left, or type F5 or use the Debug menu). The application should start in GUI mode.
[commit ec787762b9] [commit 3285823de0]
In the opening dialog of Git GUI, click on Clone Existing Repository. Enter https://github.com/thunder422/ibcp in the Source Location and set to Target Directory by clicking the Browse button. Find the Documents folder (or another folder), and click the OK button. To the Target Directory, add /ibcp (it must be a non-existing folder or and error will occur) and click the Clone button. After a few moments, the repository will be cloned. The next time the Git GUI is started, the same dialog appears, however, the Git GUI remembers the repositories that have been opened previously. Select the Repository menu and the recent repositories are listed.
The main Git GUI will be started indicating it is on the master branch. Check out the latest branch by Branch, Create..., click the Matching Tracking Branch Name option, click the Tracking Branch option, select origin/branch0.6 (or another branch) and click the Create button. This will create a local branch. Now the project can be opened in Qt Creator so start Qt Creator and select File and Open File or Project... and navigate to the Documents and then ibcp folder. Select the CMakeLists file (the .txt is not displayed unless file extensions are enabled) and click the Open button.
The CMake Wizard dialog appears with the build directory set to ...\Documents\ibcp-build, click the Next button. For a debug build (optional) add -DCMAKE_BUILD_TYPE=Debug into the Arguments field and then click the Run CMake button. For some reason, there are a bunch of errors the first time. Just click the Run CMake button again and it should complete successfully. Click the Finish button and the application is ready to be built.
To start the build, click the Hammer icon (lower left, or type Ctrl+B or use the Build menu). The run the program, click the Run/Play icon (lower left, or type Ctrl+R or use the Build menu). For a debug build use the Debug/Play icon (lower left, or type F5 or use the Debug menu). The application should start in GUI mode.
[commit ec787762b9] [commit 3285823de0]
CMake Problems Windows 8.1 – Part 3
The final build problem found with the awk script used to auto-generate the automatic enumerations header file and the codes reference text file. The problem was that when building with Qt Creator (procedure will be provided in the next post), the build aborted with a strange error message after running this script. It correctly built the output files, and telling it to build again allowed it to successfully complete the build.
The problem was in the part of the script that generates the codes.txt reference file that lists all the codes by code index and by code name. This information is helpful to aid debugging, but otherwise it is not used. To sort by code names, it pipes the code name output through the sort command. It was desired that names like Asc_Code and Asc2_Code be sorted like this, but it was reversing these because the underscore sorts after the 2 character.
An attempt to correct this issue was made be adding the "-d" option (dictionary order) to the sort command which tells it to only recognize letters and digits ignoring underscore characters. When building under Windows, it was calling the Windows sort command. This sort command did not recognize this option and reported an error, which caused the build to fail.
Unfortunately, adding this option did not work as desired anyway. The problem was that with the underscores removed, the above names become AscCode and Asc2Code and the 2 character still sorted before the C character. This was not noticed when this option was added. Anyway, once this option was removed, the build no longer failed on Windows. (Curiously, the Windows sort command does sort the names as desired.)
The problem was in the part of the script that generates the codes.txt reference file that lists all the codes by code index and by code name. This information is helpful to aid debugging, but otherwise it is not used. To sort by code names, it pipes the code name output through the sort command. It was desired that names like Asc_Code and Asc2_Code be sorted like this, but it was reversing these because the underscore sorts after the 2 character.
An attempt to correct this issue was made be adding the "-d" option (dictionary order) to the sort command which tells it to only recognize letters and digits ignoring underscore characters. When building under Windows, it was calling the Windows sort command. This sort command did not recognize this option and reported an error, which caused the build to fail.
Unfortunately, adding this option did not work as desired anyway. The problem was that with the underscores removed, the above names become AscCode and Asc2Code and the 2 character still sorted before the C character. This was not noticed when this option was added. Anyway, once this option was removed, the build no longer failed on Windows. (Curiously, the Windows sort command does sort the names as desired.)
Saturday, August 9, 2014
CMake Problems Windows 8.1 – Part 2
The second problem was with the paths to the test files generated in the make file. When CMake generates a custom command for making the test directory and copying a test file, it uses the Unix style path forward slash separator regardless of the generator being used. While cmd.exe on Windows does support these style paths, the md and copy commands do not (in fact the forward slash indicates an option like the minus does for Linux and MSYS commands). This obviously causes problems with the custom commands.
In CMake, the file command supports a TO_NATIVE_PATH option, but when used, this command didn't work as expected (didn't do anything). Apparently this is a known issue and according to what I read, this is not the purpose of this command anyway. So instead, a ConvertPath function was added to the CMake build file, which if the MinGW generator is being used, changes forward slashes to back slashes and surrounds that path with double quotes to deal with paths that may have spaces in them (which doesn't occur with the MinGW generator like with the MSYS generator). For any other generator, the path is not changed.
Another build problem was found with the awk program required for building. When using MSYS with MinGW, MSYS included many of the Unix utilities including the awk program. Fortunately, Git for Windows includes many of the MSYS utilities. However, the gawk program is included instead (stands for GNU awk). Also included is an awk script, but this shell script is meant to be run by the sh.exe command that is part of MSYS, which just calls gawk. When run from cmd.exe the script doesn't work.
When looking for the awk program, CMake found this awk script and so an error occurred from the make command running under cmd.exe. To make CMake find gawk.exe instead of this script, the CMake build file was modified to look for gawk first, and if this is not found, then looks for awk. In fact, on Linux, awk is also called gawk, but there is an awk file that soft links to it, so that either can be used.
While testing a minor mismatch was found with encoder test #2 with recreator testing. The issue was that lines with error now store the text of the line, which is recreated. This change was made in the last commit but the expect results were not updated.
[commit 727f7d223f]
In CMake, the file command supports a TO_NATIVE_PATH option, but when used, this command didn't work as expected (didn't do anything). Apparently this is a known issue and according to what I read, this is not the purpose of this command anyway. So instead, a ConvertPath function was added to the CMake build file, which if the MinGW generator is being used, changes forward slashes to back slashes and surrounds that path with double quotes to deal with paths that may have spaces in them (which doesn't occur with the MinGW generator like with the MSYS generator). For any other generator, the path is not changed.
Another build problem was found with the awk program required for building. When using MSYS with MinGW, MSYS included many of the Unix utilities including the awk program. Fortunately, Git for Windows includes many of the MSYS utilities. However, the gawk program is included instead (stands for GNU awk). Also included is an awk script, but this shell script is meant to be run by the sh.exe command that is part of MSYS, which just calls gawk. When run from cmd.exe the script doesn't work.
When looking for the awk program, CMake found this awk script and so an error occurred from the make command running under cmd.exe. To make CMake find gawk.exe instead of this script, the CMake build file was modified to look for gawk first, and if this is not found, then looks for awk. In fact, on Linux, awk is also called gawk, but there is an awk file that soft links to it, so that either can be used.
While testing a minor mismatch was found with encoder test #2 with recreator testing. The issue was that lines with error now store the text of the line, which is recreated. This change was made in the last commit but the expect results were not updated.
[commit 727f7d223f]
Subscribe to:
Posts (Atom)