projects
/
mesa.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Merge remote branch 'origin/7.8'
[mesa.git]
/
src
/
mesa
/
drivers
/
dri
/
intel
/
intel_tex_layout.c
diff --git
a/src/mesa/drivers/dri/intel/intel_tex_layout.c
b/src/mesa/drivers/dri/intel/intel_tex_layout.c
index 7d69ea4484afe811b05a33ace971ffa3df34d180..d132e19e831b72b6270edf8dbe718f753a8f35cf 100644
(file)
--- a/
src/mesa/drivers/dri/intel/intel_tex_layout.c
+++ b/
src/mesa/drivers/dri/intel/intel_tex_layout.c
@@
-74,14
+74,14
@@
void i945_miptree_layout_2d( struct intel_context *intel,
GLuint width = mt->width0;
GLuint height = mt->height0;
GLuint width = mt->width0;
GLuint height = mt->height0;
- mt->
pitc
h = mt->width0;
+ mt->
total_widt
h = mt->width0;
intel_get_texture_alignment_unit(mt->internal_format, &align_w, &align_h);
if (mt->compressed) {
intel_get_texture_alignment_unit(mt->internal_format, &align_w, &align_h);
if (mt->compressed) {
- mt->
pitc
h = ALIGN(mt->width0, align_w);
+ mt->
total_widt
h = ALIGN(mt->width0, align_w);
}
}
- /* May need to adjust
pitc
h to accomodate the placement of
+ /* May need to adjust
widt
h to accomodate the placement of
* the 2nd mipmap. This occurs when the alignment
* constraints of mipmap placement push the right edge of the
* 2nd mipmap out past the width of its parent.
* the 2nd mipmap. This occurs when the alignment
* constraints of mipmap placement push the right edge of the
* 2nd mipmap out past the width of its parent.
@@
-97,15
+97,11
@@
void i945_miptree_layout_2d( struct intel_context *intel,
+ minify(minify(mt->width0));
}
+ minify(minify(mt->width0));
}
- if (mip1_width > mt->
pitc
h) {
- mt->
pitc
h = mip1_width;
+ if (mip1_width > mt->
total_widt
h) {
+ mt->
total_widt
h = mip1_width;
}
}
}
}
- /* Pitch must be a whole number of dwords, even though we
- * express it in texels.
- */
- mt->pitch = intel_miptree_pitch_align (intel, mt, tiling, mt->pitch);
mt->total_height = 0;
for ( level = mt->first_level ; level <= mt->last_level ; level++ ) {
mt->total_height = 0;
for ( level = mt->first_level ; level <= mt->last_level ; level++ ) {