HomeSort by: relevance | last modified time | path
    Searched refs:THERE (Results 1 - 3 of 3) sorted by relevancy

  /src/lib/libc/regex/
regcomp.c 219 #define THERE() (p->slen - 1)
375 g->firststate = THERE();
381 g->laststate = THERE();
654 AHEAD(THERE()); /* ...so fix it */
730 bc->back = THERE();
1607 AHEAD(THERE());
1619 AHEAD(THERE()); /* ...so fix it */
1869 * hard-case backup, but it's just too big and messy unless there are
2157 if (g->mlen == 0) { /* there isn't one */
2411 return(0); /* there may not be an OEND *
    [all...]
  /src/sys/arch/m68k/060sp/dist/
fplsp.s 5480 #--there is a danger of unwanted overflow in first LOOP iteration. In this
5911 #--there is a danger of unwanted overflow in first LOOP iteration. In this
6284 #--SIXTH BITS IS SET TO BE 1. SINCE K = -4, -3, ..., 3, THERE
6544 # detected inside of satan(), the exception would have been handled there
6738 # |X| < 16380 log(2). There is no harm to have a small #
8018 # Note 1. There are 64 different possible values for F, thus 64 #
8497 #--THERE ARE ONLY TWO CASES.
fpsp.s 1161 # _fpsp_done(). If there is an enabled FP exception, then we insert #
1358 bne.b fu_in_exc # there is at least one set
1386 # * there will be no other way to pass it the exceptional operand
1627 bne.b fu_out_exc # there is at least one set
1964 # * there will be no other way to pass it the exceptional operand
3836 # When a "Line F Emulator" exception occurs, there are 3 possible #
3969 # There are two main cases of instructions that may enter here to #
5586 #--there is a danger of unwanted overflow in first LOOP iteration. In this
6017 #--there is a danger of unwanted overflow in first LOOP iteration. In this
6390 #--SIXTH BITS IS SET TO BE 1. SINCE K = -4, -3, ..., 3, THERE
    [all...]

Completed in 22 milliseconds