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

  /external/harfbuzz_ng/src/hb-ucdn/
ucdn.c 44 #define SBASE 0xAC00
114 int si = code - SBASE;
121 *a = SBASE + (si / TCOUNT) * TCOUNT;
138 && (a < SBASE || a >= (SBASE + SCOUNT)))
141 if (a >= SBASE) {
149 *code = SBASE + li * NCOUNT + vi * TCOUNT;
  /libcore/luni/src/main/java/java/util/concurrent/
ConcurrentHashMap.java 626 long u = (j << SSHIFT) + SBASE;
641 long u = (k << SSHIFT) + SBASE; // raw offset
669 long u = (((h >>> segmentShift) & segmentMask) << SSHIFT) + SBASE;
731 UNSAFE.putOrderedObject(ss, SBASE, s0); // ordered write of segments[0]
    [all...]
  /external/mksh/src/
lex.c 31 #define SBASE 0 /* outside any lexical constructs */
44 #define SADELIM 13 /* like SBASE, looking for delimiter */
223 state = (cf & HEREDELIM) ? SHEREDELIM : SBASE;
240 /* Initial state: one of SWORD SLETPAREN SHEREDELIM SBASE */
259 ((state == SBASE || state == SHEREDELIM) && ctype(c, C_LEX1)))) {
260 if (state == SBASE &&
284 case SBASE:
713 /* Same as SBASE, except (,|,) treated specially */
896 /* This done to avoid tests for SHEREDELIM wherever SBASE tested */
898 state = SBASE;
    [all...]

Completed in 1127 milliseconds