HomeSort by relevance Sort by last modified time
    Searched refs:U_ASSERT (Results 1 - 25 of 129) sorted by null

1 2 3 4 5 6

  /external/chromium/third_party/icu/source/common/
uassert.h 11 * Contains U_ASSERT macro
13 * By default, U_ASSERT just wraps the C library assert macro.
25 #define U_ASSERT(exp)
28 #define U_ASSERT(exp) assert(exp)
ucln_cmn.c 35 U_ASSERT(UCLN_COMMON_START < type && type < UCLN_COMMON_COUNT);
46 U_ASSERT(UCLN_START < type && type < UCLN_COMMON);
umutex.c 234 U_ASSERT(gRecursionCount == 1); /* Detection works on Windows. Debug problems there. */
239 U_ASSERT(i >= 0 && i < MAX_MUTEXES);
242 U_ASSERT(gRecursionCountPool[i] == 1); /* !Detect Deadlock! */
246 U_ASSERT((CRITICAL_SECTION*)*mutex >= &gMutexes[0] &&
248 U_ASSERT(((CRITICAL_SECTION*)*mutex)->RecursionCount == 1);
268 U_ASSERT(FALSE); /* This mutex is not initialized. */
276 U_ASSERT(gRecursionCount == 0); /* Detect unlock of an already unlocked mutex */
281 U_ASSERT(i >= 0 && i < MAX_MUTEXES);
284 U_ASSERT(gRecursionCountPool[i] == 0); /* !Detect Deadlock! */
289 U_ASSERT((CRITICAL_SECTION*)*mutex >= &gMutexes[0] &
    [all...]
uhash.c 182 U_ASSERT(!IS_EMPTY_OR_DELETED(e->hashcode));
190 U_ASSERT(hash != NULL);
191 U_ASSERT(((int32_t)policy) >= 0);
192 U_ASSERT(((int32_t)policy) < 3);
216 U_ASSERT(primeIndex >= 0 && primeIndex < PRIMES_LENGTH);
254 U_ASSERT(keyHash != NULL);
255 U_ASSERT(keyComp != NULL);
376 U_ASSERT(FALSE);
422 U_ASSERT(e != NULL);
423 U_ASSERT(e->hashcode == HASH_EMPTY)
    [all...]
  /external/icu4c/common/
uassert.h 11 * Contains U_ASSERT macro
13 * By default, U_ASSERT just wraps the C library assert macro.
25 #define U_ASSERT(exp)
28 #define U_ASSERT(exp) assert(exp)
ucln_cmn.c 72 U_ASSERT(UCLN_COMMON_START < type && type < UCLN_COMMON_COUNT);
86 U_ASSERT(UCLN_START < type && type < UCLN_COMMON);
umutex.c 246 U_ASSERT(m->owner == mutex);
256 U_ASSERT(m->recursionCount == 1); /* Recursion detection works on Windows. */
276 U_ASSERT(FALSE); /* This mutex is not initialized. */
279 U_ASSERT(m->owner == mutex);
283 U_ASSERT(m->recursionCount == 0); /* Detect unlock of an already unlocked mutex */
308 U_ASSERT(U_SUCCESS(status));
385 U_ASSERT(mutex != NULL);
395 U_ASSERT(m->owner == mutex);
580 U_ASSERT(umtx_atomic_inc(&testInt) == 1); /* Sanity Check. Do the functions work at all? */
581 U_ASSERT(testInt == 1)
    [all...]
uhash.c 182 U_ASSERT(!IS_EMPTY_OR_DELETED(e->hashcode));
190 U_ASSERT(hash != NULL);
191 U_ASSERT(((int32_t)policy) >= 0);
192 U_ASSERT(((int32_t)policy) < 3);
216 U_ASSERT(primeIndex >= 0 && primeIndex < PRIMES_LENGTH);
254 U_ASSERT(keyHash != NULL);
255 U_ASSERT(keyComp != NULL);
376 U_ASSERT(FALSE);
422 U_ASSERT(e != NULL);
423 U_ASSERT(e->hashcode == HASH_EMPTY)
    [all...]
  /external/chromium/third_party/icu/source/i18n/
rematch.cpp 353 U_ASSERT(groupOffset < fPattern->fFrameSize);
354 U_ASSERT(groupOffset >= 0);
418 U_ASSERT(startPos >= 0);
441 U_ASSERT(FALSE);
460 U_ASSERT(fPattern->fMinMatchLen > 0);
481 U_ASSERT(FALSE);
487 U_ASSERT(fPattern->fMinMatchLen > 0);
508 U_ASSERT(FALSE);
576 U_ASSERT(FALSE);
579 U_ASSERT(FALSE)
    [all...]
ucln_in.c 43 U_ASSERT(UCLN_I18N_START < type && type < UCLN_I18N_COUNT);
uspoof_buildconf.cpp 286 U_ASSERT(mapString->length() >= 1);
298 U_ASSERT(table != NULL);
330 U_ASSERT(strLen >= previousStringLength);
397 U_ASSERT(fSpoofImpl->fSpoofData->fDataOwned == TRUE);
413 U_ASSERT((key & 0x00ffffff) >= (previousKey & 0x00ffffff));
414 U_ASSERT((key & 0xff000000) != 0);
426 U_ASSERT(numKeys == numValues);
434 U_ASSERT(value < 0xffff);
454 U_ASSERT(rawData->fCFUStringTable == 0);
475 U_ASSERT(offset < stringsLength)
    [all...]
regexcmp.cpp 112 U_ASSERT(fRXPat->fPattern.length() == 0);
143 U_ASSERT(state != 0);
398 U_ASSERT(URX_TYPE(op) == URX_NOP); // original contents of reserved location
    [all...]
wintzimpl.cpp 53 U_ASSERT(std->getRule()->getDateRuleType() == DateTimeRule::DOW);
54 U_ASSERT(dst->getRule()->getDateRuleType() == DateTimeRule::DOW);
  /external/chromium/third_party/icu/source/io/
ucln_io.c 44 U_ASSERT(UCLN_IO_START < type && type < UCLN_IO_COUNT);
  /external/icu4c/i18n/
decnumstr.cpp 55 U_ASSERT(index>=0 && index<fLength);
60 U_ASSERT(index>=0 && index<fLength);
93 U_ASSERT(fText.getCapacity() >= neededSize);
94 U_ASSERT(fText.getAlias() == newBuf);
ucln_in.c 50 U_ASSERT(UCLN_I18N_START < type && type < UCLN_I18N_COUNT);
rematch.cpp 536 U_ASSERT(groupOffset < fPattern->fFrameSize);
537 U_ASSERT(groupOffset >= 0);
620 U_ASSERT(startPos >= 0);
645 U_ASSERT(FALSE);
664 U_ASSERT(fPattern->fMinMatchLen > 0);
692 U_ASSERT(FALSE);
698 U_ASSERT(fPattern->fMinMatchLen > 0);
723 U_ASSERT(FALSE);
800 U_ASSERT(FALSE);
803 U_ASSERT(FALSE)
    [all...]
digitlst.cpp 222 U_ASSERT(destIdx >= 0);
269 U_ASSERT((fDecNumber->bits & DECSPECIAL) == 0); // Not Infinity or NaN
270 U_ASSERT(d-1>-999999999);
271 U_ASSERT(d-1< 999999999);
283 U_ASSERT((fDecNumber->bits & DECSPECIAL) == 0); // Not Infinity or NaN
292 U_ASSERT(c <= fContext.digits);
317 U_ASSERT(i<count);
318 U_ASSERT(v>='0' && v<='9');
327 U_ASSERT(i<count);
342 U_ASSERT(digit>='0' && digit<='9')
    [all...]
uspoof_conf.cpp 286 U_ASSERT(mapString->length() >= 1);
298 U_ASSERT(table != NULL);
330 U_ASSERT(strLen >= previousStringLength);
397 U_ASSERT(fSpoofImpl->fSpoofData->fDataOwned == TRUE);
413 U_ASSERT((key & 0x00ffffff) >= (previousKey & 0x00ffffff));
414 U_ASSERT((key & 0xff000000) != 0);
426 U_ASSERT(numKeys == numValues);
434 U_ASSERT(value < 0xffff);
454 U_ASSERT(rawData->fCFUStringTable == 0);
475 U_ASSERT(offset < stringsLength)
    [all...]
regexcmp.cpp 136 U_ASSERT(fRXPat->fPattern == NULL || utext_nativeLength(fRXPat->fPattern) == 0);
167 U_ASSERT(state != 0);
405 U_ASSERT(URX_TYPE(op) == URX_NOP); // original contents of reserved location
    [all...]
wintzimpl.cpp 55 U_ASSERT(std->getRule()->getDateRuleType() == DateTimeRule::DOW);
56 U_ASSERT(dst->getRule()->getDateRuleType() == DateTimeRule::DOW);
  /external/icu4c/io/
ucln_io.c 51 U_ASSERT(UCLN_IO_START < type && type < UCLN_IO_COUNT);
  /external/chromium/third_party/icu/source/tools/genpname/
genpname.cpp 457 U_ASSERT(a >= 0);
467 U_ASSERT(size >= 0);
477 U_ASSERT(e2ng->isContiguous(count));
487 U_ASSERT(IS_VALID_OFFSET(e2ng[i].nameGroupIndex));
497 U_ASSERT(!e2ng->isContiguous(count));
508 U_ASSERT(IS_VALID_OFFSET(e2ng[i].nameGroupIndex));
518 U_ASSERT(!e2v->isContiguous(count));
550 U_ASSERT(result >= 0 && result < total_size);
568 U_ASSERT(IS_VALID_OFFSET(nameToEnum[i].nameIndex));
592 U_ASSERT(!e2v->isContiguous(count))
    [all...]
  /external/icu4c/tools/genpname/
genpname.cpp 458 U_ASSERT(a >= 0);
468 U_ASSERT(size >= 0);
478 U_ASSERT(e2ng->isContiguous(count));
488 U_ASSERT(IS_VALID_OFFSET(e2ng[i].nameGroupIndex));
498 U_ASSERT(!e2ng->isContiguous(count));
509 U_ASSERT(IS_VALID_OFFSET(e2ng[i].nameGroupIndex));
519 U_ASSERT(!e2v->isContiguous(count));
551 U_ASSERT(result >= 0 && result < total_size);
569 U_ASSERT(IS_VALID_OFFSET(nameToEnum[i].nameIndex));
593 U_ASSERT(!e2v->isContiguous(count))
    [all...]
  /external/icu4c/samples/ucnv/
convsamp.cpp 49 #define U_ASSERT(x) { if(U_FAILURE(x)) {fflush(stdout);fflush(stderr); fprintf(stderr, #x " == %s\n", u_errorName(x)); assert(U_SUCCESS(x)); }}
461 U_ASSERT(status);
545 U_ASSERT(status);
581 U_ASSERT(status);
600 U_ASSERT(status);
637 U_ASSERT(status);
640 U_ASSERT(status);
650 U_ASSERT(status);
665 U_ASSERT(status);
668 U_ASSERT(status)
    [all...]

Completed in 454 milliseconds

1 2 3 4 5 6