HomeSort by relevance Sort by last modified time
    Searched refs:bix (Results 1 - 6 of 6) sorted by null

  /external/valgrind/main/coregrind/
m_sparsewa.c 93 UWord bix = ix >> 3; local
95 return (arr[bix] >> off) & 1;
99 UWord bix = ix >> 3; local
101 UChar old = arr[bix];
103 arr[bix] = nyu;
108 UWord bix = ix >> 3; local
110 UChar old = arr[bix];
112 arr[bix] = nyu;
  /external/srec/tools/grxmlcompile/
sub_phon.cpp 210 int ii, fix, bix, firstId, newId, modelCount, followCount, currId, count; local
265 bix= FindFromIndex (arc[ii]->GetToId());
266 if (bix < 0)
268 while (bix < sortNum
269 && arc[forwardList[bix]]->GetFromId() == arc[ii]->GetToId()) {
274 right= arc[forwardList[bix]]->GetRight();
290 newId= arc[forwardList[bix]]->GetToId();
294 arc[forwardList[bix]]->GetOutput(), currId, newId);
305 bix++;
  /external/chromium_org/third_party/icu/source/test/intltest/
rbbiapts.cpp 79 RuleBasedBreakIterator *bix = (RuleBasedBreakIterator *)BreakIterator::createLineInstance(Locale::getDefault(), status); local
90 if (biDefault == *bix) {
101 bix->setText(HelloString);
102 if (*bix == *bi2) {
105 *bix = *bi2;
106 if (*bix != *bi2) {
110 int bixnext = bix->next();
115 delete bix;
    [all...]
  /external/icu4c/test/intltest/
rbbiapts.cpp 80 RuleBasedBreakIterator *bix = (RuleBasedBreakIterator *)BreakIterator::createLineInstance(Locale::getDefault(), status); local
91 if (biDefault == *bix) {
102 bix->setText(HelloString);
103 if (*bix == *bi2) {
106 *bix = *bi2;
107 if (*bix != *bi2) {
111 int bixnext = bix->next();
116 delete bix;
    [all...]
  /external/valgrind/main/VEX/useful/
smchash.c 254 void invertBit ( UChar* b, UInt ix, UInt bix ) {
255 b[ix] ^= (1 << bix);
  /external/valgrind/main/helgrind/
libhb_core.c 771 Word bix, shft, mask, prep; local
773 bix = ix >> 2;
777 arr[bix] = (arr[bix] & ~mask) | prep;
782 Word bix, shft; local
784 bix = ix >> 2;
786 return (arr[bix] >> shft) & 3;
    [all...]

Completed in 727 milliseconds