HomeSort by relevance Sort by last modified time
    Searched full:inp_curr (Results 1 - 4 of 4) sorted by null

  /external/chromium_org/third_party/mach_override/libudis86/
input.h 51 u->inp_curr -= u->inp_ctr;
65 * inp_curr
69 inp_curr(const struct ud *u) function
71 return u->inp_cache[u->inp_curr];
82 --u->inp_curr;
input.c 38 u->inp_curr = 0;
126 return (u->inp_curr == u->inp_fill) && u->inp_end;
134 * inp_curr and inp_fill are pointers to the cache. The program is
150 if (u->inp_curr != u->inp_fill) {
151 c = u->inp_cache[ ++u->inp_curr ];
163 u->inp_curr = ++u->inp_fill;
decode.c 192 curr = inp_curr(u);
282 u->mnemonic = ud_itab[ u->le->table[ inp_curr( u ) ] ].mnemonic;
516 op->scale = (1 << SIB_S(inp_curr(u))) & ~1;
517 op->index = UD_R_RAX + (SIB_I(inp_curr(u)) | (REX_X(u->pfx_rex) << 3));
518 op->base = UD_R_RAX + (SIB_B(inp_curr(u)) | (REX_B(u->pfx_rex) << 3));
554 op->scale = (1 << SIB_S(inp_curr(u))) & ~1;
555 op->index = UD_R_EAX + (SIB_I(inp_curr(u)) | (REX_X(u->pfx_rex) << 3));
556 op->base = UD_R_EAX + (SIB_B(inp_curr(u)) | (REX_B(u->pfx_rex) << 3));
925 ptr = u->le->table[inp_curr(u)];
1042 u->primary_opcode = inp_curr(u)
    [all...]
types.h 176 uint8_t inp_curr; member in struct:ud

Completed in 68 milliseconds