HomeSort by relevance Sort by last modified time
    Searched defs:subs (Results 1 - 11 of 11) sorted by null

  /external/bluetooth/glib/gio/fen/
fen-data.h 38 #define FN_IS_PASSIVE(fp) (((fdata*)(fp))->subs == NULL)
54 GList *subs; member in struct:__anon1919
  /external/javassist/src/test/test/javassist/bytecode/analysis/
ScannerTest.java 32 Subroutine[] subs = scanner.scan(method.getMethodInfo2()); local
34 verifySubroutine(subs, 31, 31, new int[]{125, 25});
35 verifySubroutine(subs, 32, 31, new int[]{125, 25});
36 verifySubroutine(subs, 33, 31, new int[]{125, 25});
37 verifySubroutine(subs, 60, 31, new int[]{125, 25});
38 verifySubroutine(subs, 61, 31, new int[]{125, 25});
39 verifySubroutine(subs, 63, 31, new int[]{125, 25});
40 verifySubroutine(subs, 66, 31, new int[]{125, 25});
41 verifySubroutine(subs, 69, 31, new int[]{125, 25});
42 verifySubroutine(subs, 71, 31, new int[]{125, 25})
    [all...]
  /external/elfutils/libebl/
eblwstrtab.c 234 struct Ebl_WStrent *subs; local
237 for (subs = (*sep)->next; subs != NULL; subs = subs->next)
238 if (subs->len == newstr->len)
245 return subs;
286 struct Ebl_WStrent *subs; local
296 for (subs = nodep->next; subs != NULL; subs = subs->next
    [all...]
eblgstrtab.c 245 struct Ebl_GStrent *subs; local
248 for (subs = (*sep)->next; subs != NULL; subs = subs->next)
249 if (subs->len == newstr->len)
256 return subs;
297 struct Ebl_GStrent *subs; local
307 for (subs = nodep->next; subs != NULL; subs = subs->next
    [all...]
eblstrtab.c 234 struct Ebl_Strent *subs; local
237 for (subs = (*sep)->next; subs != NULL; subs = subs->next)
238 if (subs->len == newstr->len)
245 return subs;
286 struct Ebl_Strent *subs; local
296 for (subs = nodep->next; subs != NULL; subs = subs->next
    [all...]
  /external/icu4c/test/intltest/
mnkytst.cpp 84 UnicodeString subs, subt; local
86 source.extract(MIN(s, slen), MAX(s, slen), subs); local
93 myCollator->getCollationKey(subs, collationKey1, status1);
97 report( subs, subt, result, revResult);
100 myCollator->getCollationKey(subs, collationKey1, status1);
104 report( subs, subt, result, revResult);
107 myCollator->getCollationKey(subs, collationKey1, status1);
111 report(subs, subt, result, revResult);
114 UnicodeString addOne(subs);
117 myCollator->getCollationKey(subs, collationKey1, status1)
159 UnicodeString subs, subt; local
161 source.extract(MIN(s, slen), MAX(s, slen), subs); local
    [all...]
  /external/bluetooth/glib/gio/inotify/
inotify-path.c 58 GList *subs; member in struct:ip_watched_dir_s
124 dir->subs = g_list_prepend (dir->subs, sub);
224 dir->subs = g_list_remove (dir->subs, sub);
232 for (l = dir->subs; l; l = l->next)
237 g_list_free (dir->subs);
238 dir->subs = NULL;
253 if (dir->subs == NULL)
280 g_assert (dir->subs == NULL)
    [all...]
  /external/valgrind/main/coregrind/m_demangle/
cp-demangle.h 109 struct demangle_component **subs; member in struct:d_info
112 /* The number of available entries in the subs array. */
114 /* The number of substitutions which we actually made from the subs
cp-demangle.c 4431 __extension__ struct demangle_component *subs[di.num_subs]; local
4694 __extension__ struct demangle_component *subs[di.num_subs]; local
    [all...]
  /external/chromium/chrome/browser/safe_browsing/
safe_browsing_util.h 119 std::string subs; // The ranges for sub chunks. member in struct:SBListChunkRanges
139 // For subs:
219 // For subs: if prefix_count is 0 then this is the add chunk that this sub
230 // Helper to return the size of each prefix entry (i.e. for subs this
  /external/freetype/src/sfnt/
ttcmap.c 231 /* subs 518 SUBHEAD[NSUBS] sub-headers array */
238 /* Note that for any n, `keys[n]' is a byte offset within the `subs' */
268 /* within the glyph IDs table (and not within the `subs' table itself or */
282 FT_Byte* subs; /* sub-headers */ local
311 subs = p;
312 glyph_ids = subs + (max_subs + 1) * 8;
386 FT_Byte* subs = table + 518; /* subheaders table */ local
395 sub = subs; /* jump to first sub-header */
412 sub = subs + ( FT_PAD_FLOOR( TT_PEEK_USHORT( p ), 8 ) );
415 if ( sub == subs )
    [all...]

Completed in 241 milliseconds