Lines Matching defs:entries
2877 const int *entries;
2885 * ushort size number of entries in the table
2898 /* The entries are guaranteed to be aligned on a 32-bit boundary;
2901 entries = (const int*) &switchData[4];
2902 assert(((u4)entries & 0x3) == 0);
2913 caseDPCOffset = entries[index];
2915 caseDPCOffset = (unsigned int)entries[index] >> 16 | entries[index] << 16;
2930 const int *entries;
2937 * ushort size number of entries in the table; > 0
2953 /* The entries are guaranteed to be aligned on a 32-bit boundary;
2956 entries = keys + size;
2957 assert(((u4)entries & 0x3) == 0);
2963 * Most tables have 3-4 entries. Few have more than 10. A binary
2973 return (((u8) entries[i]) << 32) | (u8) (jumpIndex * CHAIN_CELL_NORMAL_SIZE + 20);
2980 int temp = (unsigned int)entries[i] >> 16 | entries[i] << 16;