Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Remove register storage specifier #66

Open
wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Remove register storage specifier #66

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
731d738
Remove register storage specifier
georgthegreat Feb 11, 2022
82fd642
More fixes
georgthegreat Feb 12, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion mecab/src/char_property.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -37,7 +37,7 @@ class CharProperty {
inline const char *seekToOtherType(const char *begin, const char *end,
CharInfo c, CharInfo *fail,
size_t *mblen, size_t *clen) const {
register const char *p = begin;
const char *p = begin;
*clen = 0;
while (p != end && c.isKindOf(*fail = getCharInfo(p, end, mblen))) {
p += *mblen;
Expand Down
20 changes: 10 additions & 10 deletions mecab/src/darts.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -404,10 +404,10 @@ class DoubleArrayImpl {
T result;
set_result(result, -1, 0);

register array_type_ b = array_[node_pos].base;
register array_u_type_ p;
array_type_ b = array_[node_pos].base;
array_u_type_ p;

for (register size_t i = 0; i < len; ++i) {
for (size_t i = 0; i < len; ++i) {
p = b +(node_u_type_)(key[i]) + 1;
if (static_cast<array_u_type_>(b) == array_[p].check)
b = array_[p].base;
Expand All @@ -431,12 +431,12 @@ class DoubleArrayImpl {
size_t node_pos = 0) const {
if (!len) len = length_func_()(key);

register array_type_ b = array_[node_pos].base;
register size_t num = 0;
register array_type_ n;
register array_u_type_ p;
array_type_ b = array_[node_pos].base;
size_t num = 0;
array_type_ n;
array_u_type_ p;

for (register size_t i = 0; i < len; ++i) {
for (size_t i = 0; i < len; ++i) {
p = b; // + 0;
n = array_[p].base;
if ((array_u_type_) b == array_[p].check && n < 0) {
Expand Down Expand Up @@ -469,8 +469,8 @@ class DoubleArrayImpl {
size_t len = 0) const {
if (!len) len = length_func_()(key);

register array_type_ b = array_[node_pos].base;
register array_u_type_ p;
array_type_ b = array_[node_pos].base;
array_u_type_ p;

for (; key_pos < len; ++key_pos) {
p = b +(node_u_type_)(key[key_pos]) + 1;
Expand Down
6 changes: 3 additions & 3 deletions mecab/src/viterbi.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -318,11 +318,11 @@ template <bool IsAllPath> bool connect(size_t pos, Node *rnode,
const Connector *connector,
Allocator<Node, Path> *allocator) {
for (;rnode; rnode = rnode->bnext) {
register long best_cost = 2147483647;
long best_cost = 2147483647;
Node* best_node = 0;
for (Node *lnode = end_node_list[pos]; lnode; lnode = lnode->enext) {
register int lcost = connector->cost(lnode, rnode); // local cost
register long cost = lnode->cost + lcost;
int lcost = connector->cost(lnode, rnode); // local cost
long cost = lnode->cost + lcost;

if (cost < best_cost) {
best_node = lnode;
Expand Down