int i2u(writeCharFunc writeChar, uint32_t v) {
int len = 1;
char mod = v % 10;
v /= 10;
if (v != 0) {
len += i2u(writeChar, v);
}
(*writeChar)(mod + '0');
return len;
}
int i2d(writeCharFunc writeChar, uint32_t v, uint8_t size, uint8_t withSign) {
if (v == 0) {
(*writeChar)('0');
return 1;
}
int len = 0;
if (withSign) {
// output sign if < 0, then negate and continue as if unsigned
if (v & (1 << (size * 8 - 1))) {
(*writeChar)('-');
len++;
v = ~v + 1;
}
}
if (size == 1) {
v &= 0xFF;
} else if (size == 2) {
v &= 0xFFFF;
}
return len + i2u(writeChar, v);
}
/**
* This function initializes various values that will be used later by
* emit_access when actually emitting loads or stores.
*
* Note: const_offset is an input as well as an output, clients must
* initialize it to the offset of the variable in the underlying block, and
* this function will adjust it by adding the constant offset of the member
* being accessed into that variable.
*/
void
lower_buffer_access::setup_buffer_access(void *mem_ctx,
ir_variable *var,
ir_rvalue *deref,
ir_rvalue **offset,
unsigned *const_offset,
bool *row_major,
int *matrix_columns,
const glsl_struct_field **struct_field,
unsigned packing)
{
*offset = new(mem_ctx) ir_constant(0u);
*row_major = is_dereferenced_thing_row_major(deref);
*matrix_columns = 1;
/* Calculate the offset to the start of the region of the UBO
* dereferenced by *rvalue. This may be a variable offset if an
* array dereference has a variable index.
*/
while (deref) {
switch (deref->ir_type) {
case ir_type_dereference_variable: {
deref = NULL;
break;
}
case ir_type_dereference_array: {
ir_dereference_array *deref_array = (ir_dereference_array *) deref;
unsigned array_stride;
if (deref_array->array->type->is_vector()) {
/* We get this when storing or loading a component out of a vector
* with a non-constant index. This happens for v[i] = f where v is
* a vector (or m[i][j] = f where m is a matrix). If we don't
* lower that here, it gets turned into v = vector_insert(v, i,
* f), which loads the entire vector, modifies one component and
* then write the entire thing back. That breaks if another
* thread or SIMD channel is modifying the same vector.
*/
array_stride = 4;
if (deref_array->array->type->is_double())
array_stride *= 2;
} else if (deref_array->array->type->is_matrix() && *row_major) {
/* When loading a vector out of a row major matrix, the
* step between the columns (vectors) is the size of a
* float, while the step between the rows (elements of a
* vector) is handled below in emit_ubo_loads.
*/
array_stride = 4;
if (deref_array->array->type->is_double())
array_stride *= 2;
*matrix_columns = deref_array->array->type->matrix_columns;
} else if (deref_array->type->without_array()->is_interface()) {
/* We're processing an array dereference of an interface instance
* array. The thing being dereferenced *must* be a variable
* dereference because interfaces cannot be embedded in other
* types. In terms of calculating the offsets for the lowering
* pass, we don't care about the array index. All elements of an
* interface instance array will have the same offsets relative to
* the base of the block that backs them.
*/
deref = deref_array->array->as_dereference();
break;
} else {
/* Whether or not the field is row-major (because it might be a
* bvec2 or something) does not affect the array itself. We need
* to know whether an array element in its entirety is row-major.
*/
const bool array_row_major =
is_dereferenced_thing_row_major(deref_array);
/* The array type will give the correct interface packing
* information
*/
if (packing == GLSL_INTERFACE_PACKING_STD430) {
array_stride = deref_array->type->std430_array_stride(array_row_major);
} else {
array_stride = deref_array->type->std140_size(array_row_major);
array_stride = glsl_align(array_stride, 16);
}
}
ir_rvalue *array_index = deref_array->array_index;
if (array_index->type->base_type == GLSL_TYPE_INT)
array_index = i2u(array_index);
ir_constant *const_index =
array_index->constant_expression_value(NULL);
if (const_index) {
*const_offset += array_stride * const_index->value.u[0];
} else {
*offset = add(*offset,
mul(array_index,
new(mem_ctx) ir_constant(array_stride)));
}
deref = deref_array->array->as_dereference();
break;
}
case ir_type_dereference_record: {
ir_dereference_record *deref_record = (ir_dereference_record *) deref;
const glsl_type *struct_type = deref_record->record->type;
unsigned intra_struct_offset = 0;
for (unsigned int i = 0; i < struct_type->length; i++) {
const glsl_type *type = struct_type->fields.structure[i].type;
ir_dereference_record *field_deref = new(mem_ctx)
ir_dereference_record(deref_record->record,
struct_type->fields.structure[i].name);
const bool field_row_major =
is_dereferenced_thing_row_major(field_deref);
ralloc_free(field_deref);
unsigned field_align = 0;
if (packing == GLSL_INTERFACE_PACKING_STD430)
field_align = type->std430_base_alignment(field_row_major);
else
field_align = type->std140_base_alignment(field_row_major);
intra_struct_offset = glsl_align(intra_struct_offset, field_align);
if (strcmp(struct_type->fields.structure[i].name,
deref_record->field) == 0) {
if (struct_field)
*struct_field = &struct_type->fields.structure[i];
break;
}
if (packing == GLSL_INTERFACE_PACKING_STD430)
intra_struct_offset += type->std430_size(field_row_major);
else
intra_struct_offset += type->std140_size(field_row_major);
/* If the field just examined was itself a structure, apply rule
* #9:
*
* "The structure may have padding at the end; the base offset
* of the member following the sub-structure is rounded up to
* the next multiple of the base alignment of the structure."
*/
if (type->without_array()->is_record()) {
intra_struct_offset = glsl_align(intra_struct_offset,
field_align);
}
}
*const_offset += intra_struct_offset;
deref = deref_record->record->as_dereference();
break;
}
case ir_type_swizzle: {
ir_swizzle *deref_swizzle = (ir_swizzle *) deref;
assert(deref_swizzle->mask.num_components == 1);
*const_offset += deref_swizzle->mask.x * sizeof(int);
deref = deref_swizzle->val->as_dereference();
break;
}
default:
assert(!"not reached");
deref = NULL;
break;
}
}
}
static int get_panel(int oid, data_panel *panel, size_t size)
{
int ret = (s32b) size;
switch(oid)
{
case 1:
{
int i = 0;
assert( size >= (u32b) boundaries[1].page_rows);
ret = boundaries[1].page_rows;
P_I(TERM_L_BLUE, "Name", "%y", s2u(op_ptr->full_name), END );
P_I(TERM_L_BLUE, "Sex", "%y", s2u(sp_ptr->title), END );
P_I(TERM_L_BLUE, "Race", "%y", s2u(rp_ptr->name), END );
P_I(TERM_L_BLUE, "Class", "%y", s2u(cp_ptr->name), END );
P_I(TERM_L_BLUE, "Title", "%y", s2u(show_title()), END );
P_I(TERM_L_BLUE, "HP", "%y/%y", i2u(p_ptr->chp), i2u(p_ptr->mhp) );
P_I(TERM_L_BLUE, "SP", "%y/%y", i2u(p_ptr->csp), i2u(p_ptr->msp) );
P_I(TERM_L_BLUE, "Level", "%y", i2u(p_ptr->lev), END );
assert(i == boundaries[1].page_rows);
return ret;
}
case 2:
{
int i = 0;
assert( ret >= boundaries[2].page_rows);
ret = boundaries[2].page_rows;
P_I(max_color(p_ptr->lev, p_ptr->max_lev), "Level", "%y", i2u(p_ptr->lev), END );
P_I(max_color(p_ptr->exp, p_ptr->max_exp), "Cur Exp", "%y", i2u(p_ptr->exp), END );
P_I(TERM_L_GREEN, "Max Exp", "%y", i2u(p_ptr->max_exp), END );
P_I(TERM_L_GREEN, "Adv Exp", "%y", s2u(show_adv_exp()), END );
P_I(TERM_L_GREEN, "MaxDepth", "%y", s2u(show_depth()), END );
P_I(TERM_L_GREEN, "Game Turns", "%y", i2u(turn), END );
P_I(TERM_L_GREEN, "Standard Turns","%y", i2u(p_ptr->total_energy / 100), END );
P_I(TERM_L_GREEN, "Resting Turns","%y", i2u(p_ptr->resting_turn), END );
P_I(TERM_L_GREEN, "Gold", "%y", i2u(p_ptr->au), END );
assert(i == boundaries[2].page_rows);
return ret;
}
case 3:
{
int i = 0;
assert(ret >= boundaries[3].page_rows);
ret = boundaries[3].page_rows;
P_I(TERM_L_BLUE, "Armor", "[%y,%+y]", i2u(p_ptr->state.dis_ac), i2u(p_ptr->state.dis_to_a) );
P_I(TERM_L_BLUE, "Fight", "(%+y,%+y)", i2u(p_ptr->state.dis_to_h), i2u(p_ptr->state.dis_to_d) );
P_I(TERM_L_BLUE, "Melee", "%y", s2u(show_melee_weapon(&p_ptr->inventory[INVEN_WIELD])), END );
P_I(TERM_L_BLUE, "Shoot", "%y", s2u(show_missile_weapon(&p_ptr->inventory[INVEN_BOW])), END );
P_I(TERM_L_BLUE, "Blows", "%y.%y/turn", i2u(p_ptr->state.num_blow / 100), i2u((p_ptr->state.num_blow / 10) % 10) );
P_I(TERM_L_BLUE, "Shots", "%y/turn", i2u(p_ptr->state.num_fire), END );
P_I(TERM_L_BLUE, "Infra", "%y ft", i2u(p_ptr->state.see_infra * 10), END );
P_I(TERM_L_BLUE, "Speed", "%y", s2u(show_speed()), END );
P_I(TERM_L_BLUE, "Burden","%.1y lbs", f2u(p_ptr->total_weight/10.0), END );
assert(i == boundaries[3].page_rows);
return ret;
}
case 4:
{
static struct {
const char *name;
int skill;
int div;
} skills[] =
{
{ "Saving Throw", SKILL_SAVE, 6 },
{ "Stealth", SKILL_STEALTH, 1 },
{ "Fighting", SKILL_TO_HIT_MELEE, 12 },
{ "Shooting", SKILL_TO_HIT_BOW, 12 },
{ "Disarming", SKILL_DISARM, 8 },
{ "Magic Device", SKILL_DEVICE, 6 },
{ "Perception", SKILL_SEARCH_FREQUENCY, 6 },
{ "Searching", SKILL_SEARCH, 6 }
};
int i;
assert(N_ELEMENTS(skills) == boundaries[4].page_rows);
ret = N_ELEMENTS(skills);
if ((u32b) ret > size) ret = size;
for (i = 0; i < ret; i++)
{
s16b skill = p_ptr->state.skills[skills[i].skill];
panel[i].color = TERM_L_BLUE;
panel[i].label = skills[i].name;
if (skills[i].skill == SKILL_SAVE ||
skills[i].skill == SKILL_SEARCH)
{
if (skill < 0) skill = 0;
if (skill > 100) skill = 100;
panel[i].fmt = "%y%%";
panel[i].value[0] = i2u(skill);
panel[i].color = colour_table[skill / 10];
}
else if (skills[i].skill == SKILL_DEVICE)
{
panel[i].fmt = "%y";
panel[i].value[0] = i2u(skill);
panel[i].color = colour_table[skill / 13];
}
else if (skills[i].skill == SKILL_SEARCH_FREQUENCY)
{
if (skill <= 0) skill = 1;
if (skill >= 50)
{
panel[i].fmt = "1 in 1";
panel[i].color = colour_table[10];
}
else
{
/* convert to % chance of searching */
skill = 50 - skill;
panel[i].fmt = "1 in %y";
panel[i].value[0] = i2u(skill);
panel[i].color =
colour_table[(100 - skill*2) / 10];
}
}
else if (skills[i].skill == SKILL_DISARM)
{
/* assume disarming a dungeon trap */
skill -= 5;
if (skill > 100) skill = 100;
if (skill < 2) skill = 2;
panel[i].fmt = "%y%%";
panel[i].value[0] = i2u(skill);
panel[i].color = colour_table[skill / 10];
}
else
{
panel[i].fmt = "%y";
panel[i].value[0] = s2u(likert(skill, skills[i].div, &panel[i].color));
}
}
return ret;
}
case 5:
{
int i = 0;
assert(ret >= boundaries[5].page_rows);
ret = boundaries[5].page_rows;
P_I(TERM_L_BLUE, "Age", "%y", i2u(p_ptr->age), END );
P_I(TERM_L_BLUE, "Height", "%y", i2u(p_ptr->ht), END );
P_I(TERM_L_BLUE, "Weight", "%y", i2u(p_ptr->wt), END );
P_I(TERM_L_BLUE, "Social", "%y", s2u(show_status()), END );
P_I(TERM_L_BLUE, "Maximize", "%y", c2u(OPT(birth_maximize) ? 'Y' : 'N'), END);
#if 0
/* Preserve mode deleted */
P_I(TERM_L_BLUE, "Preserve", "%y", c2u(birth_preserve ? 'Y' : 'N'), END);
#endif
assert(i == boundaries[5].page_rows);
return ret;
}
}
/* hopefully not reached */
return 0;
}
