diff options
Diffstat (limited to 'src/backend/access/nbtree')
| -rw-r--r-- | src/backend/access/nbtree/nbtsearch.c | 27 | ||||
| -rw-r--r-- | src/backend/access/nbtree/nbtutils.c | 7 |
2 files changed, 0 insertions, 34 deletions
diff --git a/src/backend/access/nbtree/nbtsearch.c b/src/backend/access/nbtree/nbtsearch.c index d69a0577a87..101a7d80a95 100644 --- a/src/backend/access/nbtree/nbtsearch.c +++ b/src/backend/access/nbtree/nbtsearch.c @@ -1026,33 +1026,6 @@ _bt_first(IndexScanDesc scan, ScanDirection dir) if (goback) offnum = OffsetNumberPrev(offnum); - /* - * By here the scan position is now set for the first key. If all further - * tuples are expected to match we set the SK_BT_MATCHED flag to avoid - * re-checking the scan key later. This is a big win for slow key matches - * though is still significant even for fast datatypes. - */ - switch (startKeys[0]->sk_strategy) - { - case BTEqualStrategyNumber: - break; - - case BTGreaterEqualStrategyNumber: - case BTGreaterStrategyNumber: - if (ScanDirectionIsForward(dir)) - startKeys[0]->sk_flags |= SK_BT_MATCHED; - break; - - case BTLessEqualStrategyNumber: - case BTLessStrategyNumber: - if (ScanDirectionIsBackward(dir)) - startKeys[0]->sk_flags |= SK_BT_MATCHED; - break; - - default: - break; - } - /* remember which buffer we have pinned, if any */ Assert(!BTScanPosIsValid(so->currPos)); so->currPos.buf = buf; diff --git a/src/backend/access/nbtree/nbtutils.c b/src/backend/access/nbtree/nbtutils.c index 91331bad651..7857c77b220 100644 --- a/src/backend/access/nbtree/nbtutils.c +++ b/src/backend/access/nbtree/nbtutils.c @@ -1429,13 +1429,6 @@ _bt_checkkeys(IndexScanDesc scan, bool isNull; Datum test; - /* - * If the scan key has already matched we can skip this key, as long - * as the index tuple does not contain NULL values. - */ - if (key->sk_flags & SK_BT_MATCHED && !IndexTupleHasNulls(tuple)) - continue; - /* row-comparison keys need special processing */ if (key->sk_flags & SK_ROW_HEADER) { |