GrTessellator: fix logging; fix test comment.

Change-Id: Iaded9025a1518d8c69dbe366deb1035e0bd4295b
Reviewed-on: https://skia-review.googlesource.com/19289
Reviewed-by: Brian Salomon <bsalomon@google.com>
Commit-Queue: Stephen White <senorblanco@chromium.org>

1 files changed, 3 insertions, 3 deletions

diff --git a/src/gpu/GrTessellator.cpp b/src/gpu/GrTessellator.cpp
index 645befebf2..1ce129dcab 100644
--- a/src/gpu/GrTessellator.cpp
+++ b/src/gpu/GrTessellator.cpp
@@ -56,7 +56,7 @@
  *    neighbouring edges at the top or bottom vertex. This is handled by merging the
  *    edges (merge_collinear_edges()).
  * B) Intersections may cause an edge to violate the left-to-right ordering of the
- *    active edge list. This is handled by detecting potential violati0ns and rewinding
+ *    active edge list. This is handled by detecting potential violations and rewinding
  *    the active edge list to the vertex before they occur (rewind() during merging,
  *    rewind_if_necessary() during splitting).
  *
@@ -1114,9 +1114,9 @@ bool check_for_intersection(Edge* edge, Edge* other, EdgeList* activeEdges, Vert
                 v = alloc.make<Vertex>(p, alpha);
 #if LOGGING_ENABLED
                 if (!prevV) {
-                    v->fID = mesh->fHead - 1.0f;
+                    v->fID = mesh->fHead->fID - 1.0f;
                 } else if (!nextV) {
-                    v->fID = mesh->fTail + 1.0f;
+                    v->fID = mesh->fTail->fID + 1.0f;
                 } else {
                     v->fID = (prevV->fID + nextV->fID) * 0.5f;
                 }