HomeSort by relevance Sort by last modified time
    Searched refs:Word (Results 51 - 75 of 191) sorted by null

1 23 4 5 6 7 8

  /external/google-breakpad/src/common/linux/
elfutils.cc 45 typename ElfClass::Word section_type,
80 typename ElfClass::Word segment_type,
  /external/pdfium/core/src/fpdfdoc/
pdf_vt.h 118 : Word(0),
125 CPVT_WordInfo(FX_WORD word,
129 : Word(word),
137 CPVT_WordInfo(const CPVT_WordInfo& word)
138 : Word(0),
145 operator=(word);
147 void operator=(const CPVT_WordInfo& word) {
148 if (this == &word) {
151 Word = word.Word
    [all...]
  /external/valgrind/coregrind/
m_poolalloc.c 81 Word i;
94 Word i;
100 pointer in the first word of each element. That's why the
101 element size must be at least one word. */
m_libcbase.c 767 swaptype = ((a-(Char*)0) | es) % sizeof(Word) ? 2 \
768 : es > (SizeT)sizeof(Word) ? 1 \
777 : (void)BM_EXCH(*(Word*)(a), *(Word*)(b), t)
786 pv = (Char*)&v, v = *(Word*)pm
798 Word t;
799 for ( ; n > 0; a += sizeof(Word), b += sizeof(Word),
800 n -= sizeof(Word))
801 BM_EXCH(*(Word*)a, *(Word*)b, t)
    [all...]
m_oset.c 43 // right pointer, and a word containing balancing information and a
48 // comes after the metadata, it will only be word-aligned, even if the
96 // regardless of the machine's word size, so that any overwrites will be
110 // be the first word in the element. If cmp is set, arbitrary keys in
179 // Compare the first word of each element. Inlining is *crucial*.
180 static inline Word fast_cmp(const void* k, const AvlNode* n)
197 inline Word slow_cmp(const AvlTree* t, const void* k, const AvlNode* n)
454 static inline Word cmp_key_root(const AvlTree* t, const AvlNode* n)
465 Word cmpres = cmp_key_root(t, n);
532 vg_assert2(0, "OSet{Word,Gen}_Insert: duplicate element added")
    [all...]
m_deduppoolalloc.c 121 Word i;
151 Word reloc_offset = (Addr)newpool_free - (Addr)curpool_align;
184 static Word cmp_pool_elt (const void* node1, const void* node2 )
m_options.c 127 Word VG_(clo_max_stackframe) = 2000000;
129 Word VG_(clo_main_stacksize) = 0; /* use client's rlimit.stack */
130 Word VG_(clo_valgrind_stacksize) = VG_DEFAULT_STACK_ACTIVE_SZB;
m_execontext.c 332 static ExeContext* record_ExeContext_wrk ( ThreadId tid, Word first_ip_delta,
458 ExeContext* VG_(record_ExeContext)( ThreadId tid, Word first_ip_delta ) {
463 ExeContext* VG_(record_depth_1_ExeContext)( ThreadId tid, Word first_ip_delta )
  /external/valgrind/memcheck/tests/
unit_oset.c 65 // Word example
69 // case a Word), in which case the element is also the key.
75 sprintf(buf, "%ld", *(Word*)p);
80 static Word wordCmp(void* vkey, void* velem)
82 return *(Word*)vkey - *(Word*)velem;
103 vs[i] = VG_(OSetGen_AllocNode)(oset, sizeof(Word));
279 101, sizeof(Word));
291 101, sizeof(Word));
448 static Word blockCmp(const void* vkey, const void* velem
    [all...]
  /external/valgrind/cachegrind/
cg_branchpred.c 94 static ULong do_cond_branch_predict ( Addr instr_addr, Word takenW )
  /external/valgrind/helgrind/
hg_errors.h 62 void HG_(record_error_PthAPIerror) ( Thread*, const HChar*, Word,
hg_wordset.h 53 Word cacheSize );
  /external/valgrind/coregrind/m_gdbserver/
m_gdbserver.c 263 static inline GS_Watch* index_gs_watches(Word i)
272 Word* g_ix)
274 const Word n_elems = VG_(sizeXA) (gs_watches);
275 Word i;
347 Word g_ix;
412 Word n_elems;
414 Word i;
558 const Word n_elems = VG_(sizeXA) (gs_watches);
559 Word i;
    [all...]
  /external/valgrind/coregrind/m_initimg/
initimg-darwin.c 369 auxsize += 2 * sizeof(Word);
375 if (info->dynamic) auxsize += sizeof(Word);
379 sizeof(Word) + /* argc */
386 VG_ROUNDUP(stringsize, sizeof(Word)); /* strings (aligned) */
  /external/valgrind/coregrind/m_syswrap/
syswrap-x86-darwin.c 229 void (*f)(Word),
230 Word arg1 );
348 start_thread_NORETURN, (Word)tst);
535 start_thread_NORETURN, (Word)tst);
syswrap-s390x-linux.c 76 void (*f)(Word),
77 Word arg1 );
125 Word (*fn)(void *) 160(r15)
147 Word (*fn)(void *),
449 a0, a1, (Word)a2, (Word)a3, (Word)a4, (Word)a5 );
    [all...]
  /external/valgrind/coregrind/m_ume/
elf.c 170 ESZ(Word) memsz;
187 ESZ(Word) filesz;
188 ESZ(Word) memsz;
310 ESZ(Word) interp_size = 0; /* interpreter size */
311 /* ESZ(Word) interp_align = VKI_PAGE_SIZE; */ /* UNUSED */
580 This TOC entry contains three words; the first word is the function
581 address, the second word is the TOC ptr (r2), and the third word
  /external/valgrind/drd/
drd_barrier.c 112 const Word count)
130 tl_assert(sizeof(((struct barrier_thread_info*)0)->tid) == sizeof(Word));
193 const BarrierT barrier_type, const Word count)
227 const BarrierT barrier_type, const Word count,
  /external/valgrind/include/
pub_tool_wordfm.h 3 /*--- An AVL tree based finite map for word keys and word values. ---*/
55 #include "pub_tool_basics.h" // Word
62 /* As of r7409 (15 Feb 08), all these word-based abstractions (WordFM,
64 they previously operated on signed words (Word). This became a
68 signed Word keys is not what callers expect when iterating through
79 ordering used is unsigned word ordering (UWord) on the key
85 Word (*kCmp)(UWord,UWord) );
179 /* Add a word. */
182 /* Find out how many times the given word exists in the bag. *
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/
ndattrib.h 127 WORD Word;
  /external/llvm/tools/llvm-readobj/
ARMEHABIPrinter.h 434 const support::ulittle32_t Word =
437 if (Word & 0x80000000) {
440 unsigned PersonalityIndex = (Word & 0x0f000000) >> 24;
449 unsigned AdditionalWords = (Word & 0x00ff0000) >> 16;
457 uint64_t Address = PREL31(Word, EHT->sh_addr);
479 /// * The first word contains a PREL31 offset to the start of a function with
481 /// * The second word contains one of:
  /external/valgrind/coregrind/m_debuginfo/
d3basics.c 400 static Bool get_Dwarf_Reg( /*OUT*/Addr* a, Word regno, const RegSummary* regs )
491 res.word = (UWord)(_str); \
519 Word sw1, sw2;
534 res.word = (UWord)(expr[0] - DW_OP_reg0);
543 res.word = (UWord)read_leb128U( &expr );
606 a1 = fbval.word; break; /* use as-is */
608 ok = get_Dwarf_Reg( &a1, fbval.word, regs );
617 sw1 = (Word)read_leb128S( &expr );
635 sw1 = (Word)read_leb128S( &expr );
646 sw1 = (Word)read_leb128S( &expr )
    [all...]
  /art/runtime/
elf_file.cc 639 typename ElfTypes::Word* ElfFileImpl<ElfTypes>::GetHashSectionStart() const {
644 typename ElfTypes::Word ElfFileImpl<ElfTypes>::GetHashBucketNum() const {
649 typename ElfTypes::Word ElfFileImpl<ElfTypes>::GetHashChainNum() const {
654 typename ElfTypes::Word ElfFileImpl<ElfTypes>::GetHashBucket(size_t i, bool* ok) const {
665 typename ElfTypes::Word ElfFileImpl<ElfTypes>::GetHashChain(size_t i, bool* ok) const {
676 typename ElfTypes::Word ElfFileImpl<ElfTypes>::GetProgramHeaderNum() const {
702 typename ElfTypes::Word ElfFileImpl<ElfTypes>::GetSectionHeaderNum() const {
809 typename ElfTypes::Word ElfFileImpl<ElfTypes>::GetSymbolNum(Elf_Shdr& section_header) const {
    [all...]
  /bionic/linker/
linker.h 174 void add_version_info(size_t source_index, ElfW(Word) elf_hash,
319 const char* get_string(ElfW(Word) index) const;
376 bool lookup_version_info(const VersionTracker& version_tracker, ElfW(Word) sym,
  /external/elfutils/libelf/
elf32_updatenull.c 215 ElfW2(LIBELFBITS,Word) sh_entsize = shdr->sh_entsize;
216 ElfW2(LIBELFBITS,Word) sh_align = shdr->sh_addralign ?: 1;
389 ElfW2(LIBELFBITS,Word) sh_size;

Completed in 1197 milliseconds

1 23 4 5 6 7 8