void Phrase::InitStartEndWord()
{
FactorCollection &factorCollection = FactorCollection::Instance();
Word startWord(Input);
const Factor *factor = factorCollection.AddFactor(Input, 0, BOS_); // TODO - non-factored
startWord.SetFactor(0, factor);
PrependWord(startWord);
Word endWord(Input);
factor = factorCollection.AddFactor(Input, 0, EOS_); // TODO - non-factored
endWord.SetFactor(0, factor);
AddWord(endWord);
}
inline bool G1CMBitMapRO::iterate(BitMapClosure* cl, MemRegion mr) {
HeapWord* start_addr = MAX2(startWord(), mr.start());
HeapWord* end_addr = MIN2(endWord(), mr.end());
if (end_addr > start_addr) {
// Right-open interval [start-offset, end-offset).
BitMap::idx_t start_offset = heapWordToOffset(start_addr);
BitMap::idx_t end_offset = heapWordToOffset(end_addr);
start_offset = _bm.get_next_one_offset(start_offset, end_offset);
while (start_offset < end_offset) {
if (!cl->do_bit(start_offset)) {
return false;
}
HeapWord* next_addr = MIN2(nextObject(offsetToHeapWord(start_offset)), end_addr);
BitMap::idx_t next_offset = heapWordToOffset(next_addr);
start_offset = _bm.get_next_one_offset(next_offset, end_offset);
}
}
return true;
}
Job* Parser::parseLine (void) {
job = new Job();
currState = PARSCMD;
int i, length, curr;
int rflag;
// Limpa o buffer de entrada para evitar loop infinito
strcpy(line, "\0");
std::cin.clear();
std::cin.getline (line, MAX_LENGTH);
i = 0;
while (i < length && line[i] == ' ') i++;
length = strlen(line+i);
// Checa se a linha nao estava em branco
if (length == 0) {
job->addFlag (shooSH_NOP);
return job;
} else {
while (line[--length] == ' '); // pega os espacos do fim
length++;
if (strcmp (line+i, "exit") == 0) { //builtin
job->addFlag (shooSH_EXIT);
return job;
}
}
if ((line+i)[length-1] == '&')
job->setCommand (std::string (line+i, length-1));
else
job->setCommand (std::string (line+i, length));
while (currState != PARSSUCCESS && currState != PARSFAIL) {
if (currState == PARSCMD) {
newProcess();
newWord();
rflag = 0;
// pega espacos
while (i < length && line[i] == ' ') i++;
// esperava um comando, mas nao veio nada (usado para pipe)
if (i == length) {
currState = PARSFAIL;
} else {
// le ate encontrar um espaco
while (i < length && line[i] != ' ') cmdList[cmdListSize][currChar++] = line[i++];
currState = PARSNEXT;
}
endWord();
} else if (currState == PARSNEXT) {
// le espaco
while (i < length && line[i] == ' ') i++;
if (i == length) { //chegou ao fim da linha
currState = PARSSUCCESS;
endProcess();
} else {
// procura token
switch (line[i]) {
case '<':
i++;
currState = PARSRIN;
break;
case '>':
i++;
currState = PARSROUT;
break;
case '2': //pode ser argumento ou redirecionamento de erro
i++;
currState = PARSTWO;
break;
case '|':
i++;
job->addFlag (shooSH_PIPE);
endProcess();
currState = PARSCMD;
break;
case '&':
i++;
job->addFlag (shooSH_BG);
endProcess();
currState = PARSSUCCESS;
break;
default:
currState = PARSPARAM;
}
}
} else if (currState == PARSPARAM) {
newWord();
while (i < length && line[i] != ' ' && line[i] != '\"' && line[i] != '\'') cmdList[cmdListSize][currChar++] = line[i++];
if (line[i] == '\"') {
i++;
while (i < length && line[i] != '\"') cmdList[cmdListSize][currChar++] = line[i++];
if (i == length) {
endWord();
currState = PARSFAIL;
} else {
i++;
endWord();
currState = PARSNEXT;
}
} else if (line[i] == '\'') {
i++;
while (i < length && line[i] != '\'') cmdList[cmdListSize][currChar++] = line[i++];
if (i == length) {
endWord();
currState = PARSFAIL;
} else {
i++;
endWord();
currState = PARSNEXT;
}
} else {
endWord();
currState = PARSNEXT;
}
} else if (currState == PARSTWO) {
if (line[i] == '>') {
i++;
endWord();
currState = PARSRERR;
} else {
i--;
currState = PARSPARAM;
}
endWord();
} else if (currState == PARSRERR) {
if (line[i] == '>') { // append
i++;
rflag = REDERRA;
} else { // trunc
rflag = REDERRT;
}
currState = PARSFILENAME;
} else if (currState == PARSRIN) {
rflag = REDIN;
currState = PARSFILENAME;
} else if (currState == PARSROUT) {
if (line[i] == '>') { // append
i++;
rflag = REDOUTA;
} else { // trunc
rflag = REDOUTT;
}
currState = PARSFILENAME;
} else if (currState == PARSFILENAME) {
while (i < length && line[i] == ' ') i++;
if (i == length) currState = PARSFAIL;
else {
curr = 0;
if (line[i] == '"') { // le nomes como "file name"
i++;
while (i < length && line[i] != '"') filename[curr++] = line[i++];
if (i == length) currState = PARSFAIL;
else i++;
} else if (line[i] == '\'') { // le nomes do tipo 'file name'
i++;
while (i < length && line[i] != '\'') filename[curr++] = line[i++];
if (i == length) currState = PARSFAIL;
else i++;
} else { // le nomes do tipo filename
while (i < length && line[i] != ' ') filename[curr++] = line[i++];
}
filename[curr] = '\0';
job->setProcessFile (filename, rflag);
currState = PARSNEXT;
}
}
}
if (currState == PARSFAIL) job->addFlag (shooSH_FAIL);
return job;
}
inline bool CMSBitMap::isAllClear() const {
assert_locked();
return getNextMarkedWordAddress(startWord()) >= endWord();
}
// Return the HeapWord address corrsponding to the next "0" bit
// (inclusive).
inline HeapWord* CMSBitMap::getNextUnmarkedWordAddress(HeapWord* addr) const {
return getNextUnmarkedWordAddress(addr, endWord());
}
// Starting at "addr" (inclusive) return a memory region
// corresponding to the first maximally contiguous marked ("1") region.
inline MemRegion CMSBitMap::getAndClearMarkedRegion(HeapWord* addr) {
return getAndClearMarkedRegion(addr, endWord());
}