Fix Windows debug build.
authorap@webkit.org <ap@webkit.org@268f45cc-cd09-0410-ab3c-d52691b4dbfc>
Fri, 16 Nov 2007 10:49:40 +0000 (10:49 +0000)
committerap@webkit.org <ap@webkit.org@268f45cc-cd09-0410-ab3c-d52691b4dbfc>
Fri, 16 Nov 2007 10:49:40 +0000 (10:49 +0000)
        Rubber-stamped by Eric

        * pcre/pcre_exec.cpp: (match): Removed ASSERT_NOT_REACHED assertions that were making MSVC
        complain about unreachable code.

git-svn-id: https://svn.webkit.org/repository/webkit/trunk@27847 268f45cc-cd09-0410-ab3c-d52691b4dbfc

JavaScriptCore/ChangeLog
JavaScriptCore/pcre/pcre_exec.cpp

index f9a8552..379f005 100644 (file)
@@ -1,3 +1,11 @@
+2007-11-16  Alexey Proskuryakov  <ap@webkit.org>
+
+        Fix Windows debug build.
+        Rubber-stamped by Eric
+
+        * pcre/pcre_exec.cpp: (match): Removed ASSERT_NOT_REACHED assertions that were making MSVC
+        complain about unreachable code.
+
 2007-11-15  Mark Rowe  <mrowe@apple.com>
 
         Gtk build fix.
index 400ac48..22aa9ae 100644 (file)
@@ -929,7 +929,7 @@ RECURSE:
                             RRETURN;
                         stack.currentFrame->eptr += stack.currentFrame->length;
                     }
-                    ASSERT_NOT_REACHED();
+                    /* Control never reaches here */
                 }
                 
                 /* If maximizing, find the longest string and work backwards */
@@ -949,7 +949,7 @@ RECURSE:
                     }
                     RRETURN_NO_MATCH;
                 }
-                ASSERT_NOT_REACHED();
+                /* Control never reaches here */
                 
                 /* Match a bit-mapped character class, possibly repeatedly. This op code is
                  used when all the characters in the class have values in the range 0-255,
@@ -1038,7 +1038,7 @@ RECURSE:
                             }
                         }
                     }
-                    ASSERT_NOT_REACHED();
+                    /* Control never reaches here */
                 }
                 /* If maximizing, find the longest possible run, then work backwards. */
                 else {
@@ -1069,7 +1069,7 @@ RECURSE:
                     
                     RRETURN;
                 }
-                ASSERT_NOT_REACHED();
+                /* Control never reaches here */
                 
                 /* Match an extended character class. This opcode is encountered only
                  in UTF-8 mode, because that's the only time it is compiled. */
@@ -1137,7 +1137,7 @@ RECURSE:
                         if (!_pcre_xclass(c, stack.currentFrame->data))
                             RRETURN;
                     }
-                    ASSERT_NOT_REACHED();
+                    /* Control never reaches here */
                 }
                 
                 /* If maximizing, find the longest possible run, then work backwards. */
@@ -1164,7 +1164,7 @@ RECURSE:
                     RRETURN;
                 }
                 
-                ASSERT_NOT_REACHED();
+                /* Control never reaches here */
                 
                 /* Match a single character, casefully */
                 
@@ -1308,7 +1308,7 @@ RECURSE:
                                 RRETURN;
                             ++stack.currentFrame->eptr;
                         }
-                        ASSERT_NOT_REACHED();
+                        /* Control never reaches here */
                     } else {
                         stack.currentFrame->pp = stack.currentFrame->eptr;
                         for (i = min; i < stack.currentFrame->max; i++) {
@@ -1326,7 +1326,7 @@ RECURSE:
                         }
                         RRETURN_NO_MATCH;
                     }
-                    ASSERT_NOT_REACHED();
+                    /* Control never reaches here */
                 } else {
                     /* No case on surrogate pairs, so no need to bother with "othercase". */
                     
@@ -1354,7 +1354,7 @@ RECURSE:
                                 RRETURN;
                             stack.currentFrame->eptr += 2;
                         }
-                        ASSERT_NOT_REACHED();
+                        /* Control never reaches here */
                     } else {
                         stack.currentFrame->pp = stack.currentFrame->eptr;
                         for (i = min; i < stack.currentFrame->max; i++) {
@@ -1374,9 +1374,9 @@ RECURSE:
                         }
                         RRETURN_NO_MATCH;
                     }
-                    ASSERT_NOT_REACHED();
+                    /* Control never reaches here */
                 }
-                ASSERT_NOT_REACHED();
+                /* Control never reaches here */
                 
                 /* Match a negated single one-byte character. The character we are
                  checking can be multibyte. */
@@ -1479,7 +1479,7 @@ RECURSE:
                             if (stack.currentFrame->fi >= stack.currentFrame->max || stack.currentFrame->eptr >= md->end_subject || stack.currentFrame->fc == d)
                                 RRETURN;
                         }
-                        ASSERT_NOT_REACHED();
+                        /* Control never reaches here */
                     }
                     
                     /* Maximize case */
@@ -1512,7 +1512,7 @@ RECURSE:
                         
                         RRETURN;
                     }
-                    ASSERT_NOT_REACHED();
+                    /* Control never reaches here */
                 }
                 
                 /* Caseful comparisons */
@@ -1540,7 +1540,7 @@ RECURSE:
                             if (stack.currentFrame->fi >= stack.currentFrame->max || stack.currentFrame->eptr >= md->end_subject || stack.currentFrame->fc == d)
                                 RRETURN;
                         }
-                        ASSERT_NOT_REACHED();
+                        /* Control never reaches here */
                     }
                     
                     /* Maximize case */
@@ -1572,7 +1572,7 @@ RECURSE:
                         RRETURN;
                     }
                 }
-                ASSERT_NOT_REACHED();
+                /* Control never reaches here */
                 
                 /* Match a single character type repeatedly; several different opcodes
                  share code. This is very similar to the code for single characters, but we
@@ -1752,7 +1752,7 @@ RECURSE:
                             return matchError(JSRegExpErrorInternal, stack);
                         }
                     }
-                    ASSERT_NOT_REACHED();
+                    /* Control never reaches here */
                 }
                 
                 /* If maximizing it is worth using inline code for speed, doing the type
@@ -1882,7 +1882,7 @@ RECURSE:
                     
                     RRETURN;
                 }
-                ASSERT_NOT_REACHED();
+                /* Control never reaches here */
                 
                 BEGIN_OPCODE(CRMINPLUS):
                 BEGIN_OPCODE(CRMINQUERY):