.. | .. |
---|
1145 | 1145 | break; |
---|
1146 | 1146 | } |
---|
1147 | 1147 | } |
---|
1148 | | - if (false == pg_found) { |
---|
| 1148 | + if (!pg_found) { |
---|
1149 | 1149 | data[help_data->num_of_pg].pg = add_pg; |
---|
1150 | 1150 | data[help_data->num_of_pg].pg_priority = |
---|
1151 | 1151 | (1 << ttp[add_traf_type]); |
---|
.. | .. |
---|
1155 | 1155 | } |
---|
1156 | 1156 | DP(BNX2X_MSG_DCB, |
---|
1157 | 1157 | "add_traf_type %d pg_found %s num_of_pg %d\n", |
---|
1158 | | - add_traf_type, (false == pg_found) ? "NO" : "YES", |
---|
| 1158 | + add_traf_type, !pg_found ? "NO" : "YES", |
---|
1159 | 1159 | help_data->num_of_pg); |
---|
1160 | 1160 | } |
---|
1161 | 1161 | } |
---|
.. | .. |
---|
1544 | 1544 | if (pg_entry < DCBX_MAX_NUM_PG_BW_ENTRIES) { |
---|
1545 | 1545 | entry = 0; |
---|
1546 | 1546 | |
---|
1547 | | - if (i == (num_of_pri-1) && |
---|
1548 | | - false == b_found_strict) |
---|
| 1547 | + if (i == (num_of_pri-1) && !b_found_strict) |
---|
1549 | 1548 | /* last entry will be handled separately |
---|
1550 | 1549 | * If no priority is strict than last |
---|
1551 | 1550 | * entry goes to last queue. |
---|