kc3-lang/angle/src/libANGLE/angletypes.cpp

• Show log

  Commit

• Hash : d5451f11
  Author :
  Date : 2015-06-05T10:59:04
  

  Inline comparison operators of several small ANGLE structs.
  
  Improves draw call overhead of RendererGL.
  
  DrawCallPerf_gl:
  Before: 129779 score
  After: 136973 score
  Improvement: 5.543%
  
  No noticeable difference in DLL size or draw call perf of the D3D
  renderers.
  
  BUG=angleproject:959
  
  Change-Id: Id54d49e9e2cfb69431ee26d632c58fee2c42b82c
  Reviewed-on: https://chromium-review.googlesource.com/275408
  Reviewed-by: Jamie Madill <jmadill@chromium.org>
  Reviewed-by: Corentin Wallez <cwallez@chromium.org>
  Tested-by: Geoff Lang <geofflang@chromium.org>
  

Download

• src/libANGLE/angletypes.cpp

• //
  // Copyright (c) 2013 The ANGLE Project Authors. All rights reserved.
  // Use of this source code is governed by a BSD-style license that can be
  // found in the LICENSE file.
  //
  
  // angletypes.h : Defines a variety of structures and enum types that are used throughout libGLESv2
  
  #include "libANGLE/angletypes.h"
  #include "libANGLE/Program.h"
  #include "libANGLE/VertexAttribute.h"
  #include "libANGLE/State.h"
  #include "libANGLE/VertexArray.h"
  
  namespace gl
  {
  
  SamplerState::SamplerState()
      : minFilter(GL_NEAREST_MIPMAP_LINEAR),
        magFilter(GL_LINEAR),
        wrapS(GL_REPEAT),
        wrapT(GL_REPEAT),
        wrapR(GL_REPEAT),
        maxAnisotropy(1.0f),
        baseLevel(0),
        maxLevel(1000),
        minLod(-1000.0f),
        maxLod(1000.0f),
        compareMode(GL_NONE),
        compareFunc(GL_LEQUAL),
        swizzleRed(GL_RED),
        swizzleGreen(GL_GREEN),
        swizzleBlue(GL_BLUE),
        swizzleAlpha(GL_ALPHA)
  {}
  
  bool SamplerState::swizzleRequired() const
  {
      return swizzleRed != GL_RED || swizzleGreen != GL_GREEN ||
             swizzleBlue != GL_BLUE || swizzleAlpha != GL_ALPHA;
  }
  
  static void MinMax(int a, int b, int *minimum, int *maximum)
  {
      if (a < b)
      {
          *minimum = a;
          *maximum = b;
      }
      else
      {
          *minimum = b;
          *maximum = a;
      }
  }
  
  bool ClipRectangle(const Rectangle &source, const Rectangle &clip, Rectangle *intersection)
  {
      int minSourceX, maxSourceX, minSourceY, maxSourceY;
      MinMax(source.x, source.x + source.width, &minSourceX, &maxSourceX);
      MinMax(source.y, source.y + source.height, &minSourceY, &maxSourceY);
  
      int minClipX, maxClipX, minClipY, maxClipY;
      MinMax(clip.x, clip.x + clip.width, &minClipX, &maxClipX);
      MinMax(clip.y, clip.y + clip.height, &minClipY, &maxClipY);
  
      if (minSourceX >= maxClipX || maxSourceX <= minClipX || minSourceY >= maxClipY || maxSourceY <= minClipY)
      {
          if (intersection)
          {
              intersection->x = minSourceX;
              intersection->y = maxSourceY;
              intersection->width = maxSourceX - minSourceX;
              intersection->height = maxSourceY - minSourceY;
          }
  
          return false;
      }
      else
      {
          if (intersection)
          {
              intersection->x = std::max(minSourceX, minClipX);
              intersection->y = std::max(minSourceY, minClipY);
              intersection->width  = std::min(maxSourceX, maxClipX) - std::max(minSourceX, minClipX);
              intersection->height = std::min(maxSourceY, maxClipY) - std::max(minSourceY, minClipY);
          }
  
          return true;
      }
  }
  
  bool Box::operator==(const Box &other) const
  {
      return (x == other.x && y == other.y && z == other.z &&
              width == other.width && height == other.height && depth == other.depth);
  }
  
  bool Box::operator!=(const Box &other) const
  {
      return !(*this == other);
  }
  
  }
  

Download