forked from Imagelibrary/rtems
Convert to "bool".
This commit is contained in:
@@ -127,7 +127,7 @@ information about controller's queue and devices attached to the controller:
|
|||||||
* controller and chain of ATA requests to the controller.
|
* controller and chain of ATA requests to the controller.
|
||||||
*/
|
*/
|
||||||
typedef struct ata_ide_ctrl_s @{
|
typedef struct ata_ide_ctrl_s @{
|
||||||
rtems_boolean present; /* controller state */
|
bool present; /* controller state */
|
||||||
ata_dev_t device[2]; /* ata devices description */
|
ata_dev_t device[2]; /* ata devices description */
|
||||||
Chain_Control reqs; /* requests chain */
|
Chain_Control reqs; /* requests chain */
|
||||||
@} ata_ide_ctrl_t;
|
@} ata_ide_ctrl_t;
|
||||||
|
|||||||
@@ -46,7 +46,7 @@ the DMV177's @code{RTC_Table} configuration table is below:
|
|||||||
#include <libchip/rtc.h>
|
#include <libchip/rtc.h>
|
||||||
#include <libchip/icm7170.h>
|
#include <libchip/icm7170.h>
|
||||||
|
|
||||||
boolean dmv177_icm7170_probe(int minor);
|
bool dmv177_icm7170_probe(int minor);
|
||||||
|
|
||||||
rtc_tbl RTC_Table[] = @{
|
rtc_tbl RTC_Table[] = @{
|
||||||
@{ "/dev/rtc0", /* sDeviceName */
|
@{ "/dev/rtc0", /* sDeviceName */
|
||||||
@@ -64,7 +64,7 @@ rtc_tbl RTC_Table[] = @{
|
|||||||
unsigned long RTC_Count = (sizeof(RTC_Table)/sizeof(rtc_tbl));
|
unsigned long RTC_Count = (sizeof(RTC_Table)/sizeof(rtc_tbl));
|
||||||
rtems_device_minor_number RTC_Minor;
|
rtems_device_minor_number RTC_Minor;
|
||||||
|
|
||||||
boolean dmv177_icm7170_probe(int minor)
|
bool dmv177_icm7170_probe(int minor)
|
||||||
@{
|
@{
|
||||||
volatile unsigned16 *card_resource_reg;
|
volatile unsigned16 *card_resource_reg;
|
||||||
|
|
||||||
|
|||||||
@@ -557,7 +557,7 @@ the command @code{route add default gw yyy.yyy.yyy.yyy}:
|
|||||||
|
|
||||||
@example
|
@example
|
||||||
void mon_ifconfig(int argc, char *argv[], unsigned32 command_arg,
|
void mon_ifconfig(int argc, char *argv[], unsigned32 command_arg,
|
||||||
boolean verbose)
|
bool verbose)
|
||||||
@{
|
@{
|
||||||
struct sockaddr_in ipaddr;
|
struct sockaddr_in ipaddr;
|
||||||
struct sockaddr_in dstaddr;
|
struct sockaddr_in dstaddr;
|
||||||
@@ -761,7 +761,7 @@ void mon_ifconfig(int argc, char *argv[], unsigned32 command_arg,
|
|||||||
|
|
||||||
|
|
||||||
void mon_route(int argc, char *argv[], unsigned32 command_arg,
|
void mon_route(int argc, char *argv[], unsigned32 command_arg,
|
||||||
boolean verbose)
|
bool verbose)
|
||||||
@{
|
@{
|
||||||
int cmd;
|
int cmd;
|
||||||
struct sockaddr_in dst;
|
struct sockaddr_in dst;
|
||||||
|
|||||||
@@ -238,7 +238,7 @@ This call will discard any nodes on the chain.
|
|||||||
@ifset is-C
|
@ifset is-C
|
||||||
@findex @value{DIRPREFIX}chain_is_null_node
|
@findex @value{DIRPREFIX}chain_is_null_node
|
||||||
@example
|
@example
|
||||||
boolean @value{DIRPREFIX}chain_is_null_node(
|
bool @value{DIRPREFIX}chain_is_null_node(
|
||||||
const @value{DIRPREFIX}chain_node *the_node
|
const @value{DIRPREFIX}chain_node *the_node
|
||||||
);
|
);
|
||||||
@end example
|
@end example
|
||||||
@@ -246,7 +246,7 @@ boolean @value{DIRPREFIX}chain_is_null_node(
|
|||||||
|
|
||||||
@subheading RETURNS
|
@subheading RETURNS
|
||||||
|
|
||||||
Returns TRUE is the node point is NULL and FALSE if the node is not
|
Returns true is the node point is NULL and false if the node is not
|
||||||
NULL.
|
NULL.
|
||||||
|
|
||||||
@subheading DESCRIPTION:
|
@subheading DESCRIPTION:
|
||||||
@@ -320,7 +320,7 @@ This function returns a pointer to the last node on the chain.
|
|||||||
@ifset is-C
|
@ifset is-C
|
||||||
@findex @value{DIRPREFIX}chain_are_nodes_equal
|
@findex @value{DIRPREFIX}chain_are_nodes_equal
|
||||||
@example
|
@example
|
||||||
boolean @value{DIRPREFIX}chain_are_nodes_equal(
|
bool @value{DIRPREFIX}chain_are_nodes_equal(
|
||||||
const @value{DIRPREFIX}chain_node *left,
|
const @value{DIRPREFIX}chain_node *left,
|
||||||
const @value{DIRPREFIX}chain_node *right
|
const @value{DIRPREFIX}chain_node *right
|
||||||
);
|
);
|
||||||
@@ -329,13 +329,13 @@ boolean @value{DIRPREFIX}chain_are_nodes_equal(
|
|||||||
|
|
||||||
@subheading RETURNS
|
@subheading RETURNS
|
||||||
|
|
||||||
This function returns TRUE if the left node and the right node are
|
This function returns true if the left node and the right node are
|
||||||
equal, and FALSE otherwise.
|
equal, and false otherwise.
|
||||||
|
|
||||||
@subheading DESCRIPTION:
|
@subheading DESCRIPTION:
|
||||||
|
|
||||||
This function returns TRUE if the left node and the right node are
|
This function returns true if the left node and the right node are
|
||||||
equal, and FALSE otherwise.
|
equal, and false otherwise.
|
||||||
|
|
||||||
@c
|
@c
|
||||||
@c
|
@c
|
||||||
@@ -350,7 +350,7 @@ equal, and FALSE otherwise.
|
|||||||
@ifset is-C
|
@ifset is-C
|
||||||
@findex @value{DIRPREFIX}chain_is_empty
|
@findex @value{DIRPREFIX}chain_is_empty
|
||||||
@example
|
@example
|
||||||
boolean @value{DIRPREFIX}chain_is_empty(
|
bool @value{DIRPREFIX}chain_is_empty(
|
||||||
@value{DIRPREFIX}chain_control *the_chain
|
@value{DIRPREFIX}chain_control *the_chain
|
||||||
);
|
);
|
||||||
@end example
|
@end example
|
||||||
@@ -358,12 +358,12 @@ boolean @value{DIRPREFIX}chain_is_empty(
|
|||||||
|
|
||||||
@subheading RETURNS
|
@subheading RETURNS
|
||||||
|
|
||||||
This function returns TRUE if there a no nodes on the chain and FALSE
|
This function returns true if there a no nodes on the chain and false
|
||||||
otherwise.
|
otherwise.
|
||||||
|
|
||||||
@subheading DESCRIPTION:
|
@subheading DESCRIPTION:
|
||||||
|
|
||||||
This function returns TRUE if there a no nodes on the chain and FALSE
|
This function returns true if there a no nodes on the chain and false
|
||||||
otherwise.
|
otherwise.
|
||||||
|
|
||||||
@c
|
@c
|
||||||
@@ -379,7 +379,7 @@ otherwise.
|
|||||||
@ifset is-C
|
@ifset is-C
|
||||||
@findex @value{DIRPREFIX}chain_is_first
|
@findex @value{DIRPREFIX}chain_is_first
|
||||||
@example
|
@example
|
||||||
boolean @value{DIRPREFIX}chain_is_first(
|
bool @value{DIRPREFIX}chain_is_first(
|
||||||
const @value{DIRPREFIX}chain_node *the_node
|
const @value{DIRPREFIX}chain_node *the_node
|
||||||
);
|
);
|
||||||
@end example
|
@end example
|
||||||
@@ -387,13 +387,13 @@ boolean @value{DIRPREFIX}chain_is_first(
|
|||||||
|
|
||||||
@subheading RETURNS
|
@subheading RETURNS
|
||||||
|
|
||||||
This function returns TRUE if the node is the first node on a chain
|
This function returns true if the node is the first node on a chain
|
||||||
and FALSE otherwise.
|
and false otherwise.
|
||||||
|
|
||||||
@subheading DESCRIPTION:
|
@subheading DESCRIPTION:
|
||||||
|
|
||||||
This function returns TRUE if the node is the first node on a chain
|
This function returns true if the node is the first node on a chain
|
||||||
and FALSE otherwise.
|
and false otherwise.
|
||||||
|
|
||||||
@c
|
@c
|
||||||
@c
|
@c
|
||||||
@@ -408,7 +408,7 @@ and FALSE otherwise.
|
|||||||
@ifset is-C
|
@ifset is-C
|
||||||
@findex @value{DIRPREFIX}chain_is_last
|
@findex @value{DIRPREFIX}chain_is_last
|
||||||
@example
|
@example
|
||||||
boolean @value{DIRPREFIX}chain_is_last(
|
bool @value{DIRPREFIX}chain_is_last(
|
||||||
const @value{DIRPREFIX}chain_node *the_node
|
const @value{DIRPREFIX}chain_node *the_node
|
||||||
);
|
);
|
||||||
@end example
|
@end example
|
||||||
@@ -416,13 +416,13 @@ boolean @value{DIRPREFIX}chain_is_last(
|
|||||||
|
|
||||||
@subheading RETURNS
|
@subheading RETURNS
|
||||||
|
|
||||||
This function returns TRUE if the node is the last node on a chain and
|
This function returns true if the node is the last node on a chain and
|
||||||
FALSE otherwise.
|
false otherwise.
|
||||||
|
|
||||||
@subheading DESCRIPTION:
|
@subheading DESCRIPTION:
|
||||||
|
|
||||||
This function returns TRUE if the node is the last node on a chain and
|
This function returns true if the node is the last node on a chain and
|
||||||
FALSE otherwise.
|
false otherwise.
|
||||||
|
|
||||||
@c
|
@c
|
||||||
@c
|
@c
|
||||||
@@ -437,7 +437,7 @@ FALSE otherwise.
|
|||||||
@ifset is-C
|
@ifset is-C
|
||||||
@findex @value{DIRPREFIX}chain_has_only_one_node
|
@findex @value{DIRPREFIX}chain_has_only_one_node
|
||||||
@example
|
@example
|
||||||
boolean @value{DIRPREFIX}chain_has_only_one_node(
|
bool @value{DIRPREFIX}chain_has_only_one_node(
|
||||||
const @value{DIRPREFIX}chain_control *the_chain
|
const @value{DIRPREFIX}chain_control *the_chain
|
||||||
);
|
);
|
||||||
@end example
|
@end example
|
||||||
@@ -445,13 +445,13 @@ boolean @value{DIRPREFIX}chain_has_only_one_node(
|
|||||||
|
|
||||||
@subheading RETURNS
|
@subheading RETURNS
|
||||||
|
|
||||||
This function returns TRUE if there is only one node on the chain and
|
This function returns true if there is only one node on the chain and
|
||||||
FALSE otherwise.
|
false otherwise.
|
||||||
|
|
||||||
@subheading DESCRIPTION:
|
@subheading DESCRIPTION:
|
||||||
|
|
||||||
This function returns TRUE if there is only one node on the chain and
|
This function returns true if there is only one node on the chain and
|
||||||
FALSE otherwise.
|
false otherwise.
|
||||||
|
|
||||||
@c
|
@c
|
||||||
@c
|
@c
|
||||||
@@ -466,7 +466,7 @@ FALSE otherwise.
|
|||||||
@ifset is-C
|
@ifset is-C
|
||||||
@findex @value{DIRPREFIX}chain_is_head
|
@findex @value{DIRPREFIX}chain_is_head
|
||||||
@example
|
@example
|
||||||
boolean @value{DIRPREFIX}chain_is_head(
|
bool @value{DIRPREFIX}chain_is_head(
|
||||||
@value{DIRPREFIX}chain_control *the_chain,
|
@value{DIRPREFIX}chain_control *the_chain,
|
||||||
@value{DIRPREFIX}const chain_node *the_node
|
@value{DIRPREFIX}const chain_node *the_node
|
||||||
);
|
);
|
||||||
@@ -475,13 +475,13 @@ boolean @value{DIRPREFIX}chain_is_head(
|
|||||||
|
|
||||||
@subheading RETURNS
|
@subheading RETURNS
|
||||||
|
|
||||||
This function returns TRUE if the node is the head of the chain and
|
This function returns true if the node is the head of the chain and
|
||||||
FALSE otherwise.
|
false otherwise.
|
||||||
|
|
||||||
@subheading DESCRIPTION:
|
@subheading DESCRIPTION:
|
||||||
|
|
||||||
This function returns TRUE if the node is the head of the chain and
|
This function returns true if the node is the head of the chain and
|
||||||
FALSE otherwise.
|
false otherwise.
|
||||||
|
|
||||||
@c
|
@c
|
||||||
@c
|
@c
|
||||||
@@ -496,7 +496,7 @@ FALSE otherwise.
|
|||||||
@ifset is-C
|
@ifset is-C
|
||||||
@findex @value{DIRPREFIX}chain_is_tail
|
@findex @value{DIRPREFIX}chain_is_tail
|
||||||
@example
|
@example
|
||||||
boolean @value{DIRPREFIX}chain_is_tail(
|
bool @value{DIRPREFIX}chain_is_tail(
|
||||||
@value{DIRPREFIX}chain_control *the_chain,
|
@value{DIRPREFIX}chain_control *the_chain,
|
||||||
const @value{DIRPREFIX}chain_node *the_node
|
const @value{DIRPREFIX}chain_node *the_node
|
||||||
)
|
)
|
||||||
@@ -505,13 +505,13 @@ boolean @value{DIRPREFIX}chain_is_tail(
|
|||||||
|
|
||||||
@subheading RETURNS
|
@subheading RETURNS
|
||||||
|
|
||||||
This function returns TRUE if the node is the tail of the chain and
|
This function returns true if the node is the tail of the chain and
|
||||||
FALSE otherwise.
|
false otherwise.
|
||||||
|
|
||||||
@subheading DESCRIPTION:
|
@subheading DESCRIPTION:
|
||||||
|
|
||||||
This function returns TRUE if the node is the tail of the chain and
|
This function returns true if the node is the tail of the chain and
|
||||||
FALSE otherwise.
|
false otherwise.
|
||||||
|
|
||||||
@c
|
@c
|
||||||
@c
|
@c
|
||||||
|
|||||||
@@ -167,7 +167,7 @@ and status codes.
|
|||||||
|
|
||||||
@ifset is-C
|
@ifset is-C
|
||||||
@example
|
@example
|
||||||
boolean rtems_stack_checker_is_blown( void );
|
bool rtems_stack_checker_is_blown( void );
|
||||||
@end example
|
@end example
|
||||||
@end ifset
|
@end ifset
|
||||||
|
|
||||||
|
|||||||
Reference in New Issue
Block a user