GNU gdb Red Hat Linux (6.3.0.0-1.143.el4rh) Copyright 2004 Free Software Foundation, Inc. GDB is free software, covered by the GNU General Public License, and you are welcome to change it and/or distribute copies of it under certain conditions. Type "show copying" to see the conditions. There is absolutely no warranty for GDB. Type "show warranty" for details. This GDB was configured as "i386-redhat-linux-gnu"...Using host libthread_db library "/lib/tls/libthread_db.so.1". Attaching to program: /usr/bin/postgres, process 15072 Reading symbols from /usr/lib/libz.so.1...done. Loaded symbols for /usr/lib/libz.so.1 Reading symbols from /usr/lib/libreadline.so.4...done. Loaded symbols for /usr/lib/libreadline.so.4 Reading symbols from /lib/libtermcap.so.2...done. Loaded symbols for /lib/libtermcap.so.2 Reading symbols from /lib/libcrypt.so.1...done. Loaded symbols for /lib/libcrypt.so.1 Reading symbols from /lib/libresolv.so.2...done. Loaded symbols for /lib/libresolv.so.2 Reading symbols from /lib/libnsl.so.1...done. Loaded symbols for /lib/libnsl.so.1 Reading symbols from /lib/libdl.so.2...done. Loaded symbols for /lib/libdl.so.2 Reading symbols from /lib/tls/libm.so.6...done. Loaded symbols for /lib/tls/libm.so.6 Reading symbols from /lib/tls/libc.so.6...done. Loaded symbols for /lib/tls/libc.so.6 Reading symbols from /lib/ld-linux.so.2...done. Loaded symbols for /lib/ld-linux.so.2 Reading symbols from /lib/libnss_files.so.2...done. Loaded symbols for /lib/libnss_files.so.2 0x00bb77a2 in _dl_sysinfo_int80 () from /lib/ld-linux.so.2 Single stepping until exit from function _dl_sysinfo_int80, which has no line number information. 0x00c9a991 in recv () from /lib/tls/libc.so.6 Single stepping until exit from function recv, which has no line number information. secure_read (port=0x3c, ptr=0x82446a0, len=8192) at be-secure.c:310 310 client_read_ended(); client_read_ended () at postgres.c:447 447 { 448 if (DoingCommandRead) 447 { 448 if (DoingCommandRead) 450 ImmediateInterruptOK = false; 451 QueryCancelPending = false; /* forget any CANCEL signal */ 455 } client_read_ended () at postgres.c:453 453 DisableNotifyInterrupt(); DisableNotifyInterrupt () at async.c:774 774 { 775 notifyInterruptEnabled = 0; secure_read (port=0x3c, ptr=0x82446a0, len=8192) at be-secure.c:314 314 } pq_recvbuf () at pqcomm.c:688 688 if (r < 0) 704 if (r == 0) 713 PqRecvLength += r; 714 return 0; 716 } pq_getbyte () at pqcomm.c:728 728 return EOF; /* Failed to recv data */ 730 return PqRecvBuffer[PqRecvPointer++]; 731 } pq_getbyte () at pqcomm.c:730 730 return PqRecvBuffer[PqRecvPointer++]; 731 } PostgresMain (argc=4, argv=0x9a5dcc0, username=0x9a5dc30 "esoteric") at postgres.c:287 287 if (qtype == EOF) /* frontend disconnected */ 285 qtype = pq_getbyte(); 287 if (qtype == EOF) /* frontend disconnected */ 303 switch (qtype) 307 if (PG_PROTOCOL_MAJOR(FrontendProtocol) < 3) 306 doing_extended_query_message = false; 307 if (PG_PROTOCOL_MAJOR(FrontendProtocol) < 3) 385 if (PG_PROTOCOL_MAJOR(FrontendProtocol) >= 3) 387 if (pq_getmessage(inBuf, 0)) pq_getmessage (s=0xbffe1650, maxlen=0) at pqcomm.c:851 851 { 856 s->data[0] = '\0'; 851 { 855 s->len = 0; 856 s->data[0] = '\0'; 857 s->cursor = 0; 860 if (pq_getbytes((char *) &len, 4) == EOF) pq_getbytes (s=0xbffe152c "5", len=4) at pqcomm.c:758 758 { 774 len -= amount; 758 { 774 len -= amount; 766 return EOF; /* Failed to recv data */ 768 amount = PqRecvLength - PqRecvPointer; 769 if (amount > len) 770 amount = len; 771 memcpy(s, PqRecvBuffer + PqRecvPointer, amount); 772 PqRecvPointer += amount; 773 s += amount; 774 len -= amount; 772 PqRecvPointer += amount; 774 len -= amount; 777 } 776 return 0; 777 } pq_getmessage (s=0xbffe1650, maxlen=0) at pqcomm.c:868 868 len = ntohl(len); 869 len -= 4; /* discount length itself */ 871 if (len < 0 || 869 len -= 4; /* discount length itself */ 871 if (len < 0 || 880 if (len > 0) 883 enlargeStringInfo(s, len); enlargeStringInfo (str=0xbffe1650, needed=55) at stringinfo.c:221 221 { 229 if (needed < 0 || 221 { 229 if (needed < 0 || 234 needed += str->len + 1; /* total space required now */ 238 if (needed <= str->maxlen) 262 } pq_getmessage (s=0xbffe1650, maxlen=0) at pqcomm.c:886 886 if (pq_getbytes(s->data, len) == EOF) pq_getbytes (s=0x9aa7648 "", len=55) at pqcomm.c:758 758 { 774 len -= amount; 758 { 774 len -= amount; 766 return EOF; /* Failed to recv data */ 768 amount = PqRecvLength - PqRecvPointer; 769 if (amount > len) 771 memcpy(s, PqRecvBuffer + PqRecvPointer, amount); 772 PqRecvPointer += amount; 773 s += amount; 774 len -= amount; 772 PqRecvPointer += amount; 774 len -= amount; 777 } 776 return 0; 777 } pq_getmessage (s=0xbffe1650, maxlen=0) at pqcomm.c:893 893 s->len = len; 895 s->data[len] = '\0'; 893 s->len = len; 895 s->data[len] = '\0'; 899 } 898 return 0; 899 } PostgresMain (argc=4, argv=0x9a5dcc0, username=0x9a5dc30 "esoteric") at postgres.c:389 389 } 279 { 403 { 2945 if (got_SIGHUP) 2939 DoingCommandRead = false; 2945 if (got_SIGHUP) 2955 if (ignore_till_sync && firstchar != EOF) 2958 switch (firstchar) 2964 query_string = pq_getmsgstring(&input_message); pq_getmsgstring (msg=0xbffe1650) at pqformat.c:656 656 { 660 str = &msg->data[msg->cursor]; 667 slen = strlen(str); 668 if (msg->cursor + slen >= msg->len) 674 return (const char *) pg_client_to_server((unsigned char *) str, slen); 672 msg->cursor += slen + 1; 674 return (const char *) pg_client_to_server((unsigned char *) str, slen); pg_client_to_server ( s=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);", len=54) at mbutils.c:369 369 { 373 if (len <= 0) 369 { 373 if (len <= 0) 376 if (ClientEncoding->encoding == DatabaseEncoding->encoding || 382 (void) pg_verify_mbstr(DatabaseEncoding->encoding, s, len, false); pg_verify_mbstr (encoding=0, mbstr=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);", len=54, noError=0 '\0') at wchar.c:1058 1058 { 1066 if (pg_encoding_max_length(encoding) <= 1) 1058 { 1066 if (pg_encoding_max_length(encoding) <= 1) pg_encoding_max_length (encoding=0) at wchar.c:1019 1019 { 1022 return pg_wchar_table[encoding].maxmblen; 1023 } pg_verify_mbstr (encoding=0, mbstr=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);", len=54, noError=0 '\0') at wchar.c:1058 1058 { 1066 if (pg_encoding_max_length(encoding) <= 1) 1068 const char *nullpos = memchr(mbstr, 0, len); 1070 if (nullpos == NULL) 1071 return true; 1070 if (nullpos == NULL) 1111 } pg_client_to_server ( s=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);", len=54) at mbutils.c:418 418 } pq_getmsgstring (msg=0xbffe1650) at pqformat.c:675 675 } PostgresMain (argc=4, argv=0x9a5dcc0, username=0x9a5dc30 "esoteric") at postgres.c:2965 2965 pq_getmsgend(&input_message); pq_getmsgend (msg=0xbffe1650) at pqformat.c:683 683 { 684 if (msg->cursor != msg->len) 688 } PostgresMain (argc=4, argv=0x9a5dcc0, username=0x9a5dc30 "esoteric") at postgres.c:2967 2967 exec_simple_query(query_string); exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:734 734 bool save_log_duration = log_duration; 727 { 728 CommandDest dest = whereToSendOutput; 734 bool save_log_duration = log_duration; 735 int save_log_min_duration_statement = log_min_duration_statement; 736 bool save_log_statement_stats = log_statement_stats; 741 debug_query_string = query_string; 735 int save_log_min_duration_statement = log_min_duration_statement; 736 bool save_log_statement_stats = log_statement_stats; 741 debug_query_string = query_string; 743 pgstat_report_activity(query_string); pgstat_report_activity ( what=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at pgstat.c:562 562 if (!pgstat_collect_querystring || pgStatSock < 0) 558 { 562 if (!pgstat_collect_querystring || pgStatSock < 0) 575 } exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:751 751 if (save_log_duration || save_log_min_duration_statement != -1) 754 if (save_log_statement_stats) 764 start_xact_command(); start_xact_command () at postgres.c:1786 1786 if (!xact_started) 1788 ereport(DEBUG3, errstart (elevel=12, filename=0x821df1a "postgres.c", lineno=1789, funcname=0x821d132 "start_xact_command") at elog.c:165 165 { 167 bool output_to_server = false; 180 if (elevel == ERROR && IsInitProcessingMode()) 168 bool output_to_client = false; 180 if (elevel == ERROR && IsInitProcessingMode()) 187 if (elevel >= ERROR) 194 if (IsPostmasterEnvironment) 197 if (elevel == LOG || elevel == COMMERROR) 207 if (log_min_messages == LOG) 213 else if (elevel >= log_min_messages) 224 if (whereToSendOutput == Remote && elevel != COMMERROR) 232 if (ClientAuthInProgress) 235 output_to_client = (elevel >= client_min_messages || 240 if (elevel < ERROR && !output_to_server && !output_to_client) 241 return false; 240 if (elevel < ERROR && !output_to_server && !output_to_client) 302 } start_xact_command () at postgres.c:1790 1790 StartTransactionCommand(); StartTransactionCommand () at xact.c:1171 1171 TransactionState s = CurrentTransactionState; 1173 switch (s->blockState) 1180 StartTransaction(); StartTransaction () at xact.c:851 851 TransactionState s = CurrentTransactionState; 856 if (s->state != TRANS_DEFAULT) 863 s->state = TRANS_START; 868 FreeXactSnapshot(); FreeXactSnapshot () at tqual.c:1105 1105 QuerySnapshot = NULL; 1106 SerializableSnapshot = NULL; StartTransaction () at xact.c:869 869 XactIsoLevel = DefaultXactIsoLevel; 870 XactReadOnly = DefaultXactReadOnly; 875 s->transactionIdData = GetNewTransactionId(); GetNewTransactionId () at varsup.c:41 41 if (AMI_OVERRIDE) 42 return BootstrapTransactionId; 41 if (AMI_OVERRIDE) 44 LWLockAcquire(XidGenLock, LW_EXCLUSIVE); LWLockAcquire (lockid=XidGenLock, mode=LW_EXCLUSIVE) at lwlock.c:218 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 200 PGPROC *proc = MyProc; 199 volatile LWLock *lock = LWLockArray + lockid; 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 201 bool retry = false; 202 int extraWaits = 0; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 245 if (retry) 249 if (mode == LW_EXCLUSIVE) 251 if (lock->exclusive == 0 && lock->shared == 0) 253 lock->exclusive++; 325 SpinLockRelease_NoHoldoff(&lock->mutex); 329 held_lwlocks[num_held_lwlocks++] = lockid; 335 PGSemaphoreUnlock(&proc->sem); GetNewTransactionId () at varsup.c:46 46 xid = ShmemVariableCache->nextXid; 56 ExtendCLOG(xid); ExtendCLOG (newestXact=5338) at clog.c:253 253 if (TransactionIdToPgIndex(newestXact) != 0 && 265 } GetNewTransactionId () at varsup.c:64 64 TransactionIdAdvance(ShmemVariableCache->nextXid); 86 if (MyProc != (PGPROC *) NULL) 87 MyProc->xid = xid; 89 LWLockRelease(XidGenLock); LWLockRelease (lockid=XidGenLock) at lwlock.c:409 409 { 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 423 if (lockid == held_lwlocks[i]) 426 if (i < 0) 428 num_held_lwlocks--; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 436 if (lock->exclusive > 0) 437 lock->exclusive--; 450 head = lock->head; 451 if (head != NULL) 481 SpinLockRelease_NoHoldoff(&lock->mutex); 499 RESUME_INTERRUPTS(); GetNewTransactionId () at varsup.c:91 91 return xid; 92 } StartTransaction () at xact.c:877 877 XactLockTableInsert(s->transactionIdData); 875 s->transactionIdData = GetNewTransactionId(); 877 XactLockTableInsert(s->transactionIdData); XactLockTableInsert (xid=5338) at lmgr.c:318 318 MemSet(&tag, 0, sizeof(tag)); 315 { 318 MemSet(&tag, 0, sizeof(tag)); 323 if (!LockAcquire(LockTableId, &tag, xid, 319 tag.relId = XactLockTableId; 320 tag.dbId = InvalidOid; /* xids are globally unique */ 321 tag.objId.xid = xid; 323 if (!LockAcquire(LockTableId, &tag, xid, LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:434 434 { 453 locktag->lockmethod = lockmethod; 434 { 453 locktag->lockmethod = lockmethod; 456 lockMethodTable = LockMethodTable[lockmethod]; 457 if (!lockMethodTable) 456 lockMethodTable = LockMethodTable[lockmethod]; 457 if (!lockMethodTable) 463 masterLock = lockMethodTable->masterLock; 465 LWLockAcquire(masterLock, LW_EXCLUSIVE); 463 masterLock = lockMethodTable->masterLock; 465 LWLockAcquire(masterLock, LW_EXCLUSIVE); 471 lock = (LOCK *) hash_search(lockMethodTable->lockHash, 465 LWLockAcquire(masterLock, LW_EXCLUSIVE); LWLockAcquire (lockid=LockMgrLock, mode=LW_EXCLUSIVE) at lwlock.c:218 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 200 PGPROC *proc = MyProc; 199 volatile LWLock *lock = LWLockArray + lockid; 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 201 bool retry = false; 202 int extraWaits = 0; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 245 if (retry) 249 if (mode == LW_EXCLUSIVE) 251 if (lock->exclusive == 0 && lock->shared == 0) 253 lock->exclusive++; 325 SpinLockRelease_NoHoldoff(&lock->mutex); 329 held_lwlocks[num_held_lwlocks++] = lockid; 335 PGSemaphoreUnlock(&proc->sem); LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:471 471 lock = (LOCK *) hash_search(lockMethodTable->lockHash, hash_search (hashp=0x9a69180, keyPtr=0xbffe1430, action=HASH_ENTER, foundPtr=0xbffe13af "") at dynahash.c:515 515 HASHHDR *hctl = hashp->hctl; 538 if (action == HASH_REMOVE_SAVED) 515 HASHHDR *hctl = hashp->hctl; 516 uint32 hashvalue = 0; 538 if (action == HASH_REMOVE_SAVED) 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); tag_hash (key=0x9a69180, keysize=16) at hashfn.c:42 42 } tag_hash (key=0x9a69180, keysize=3221099568) at hashfn.c:40 40 return DatumGetUInt32(hash_any((const unsigned char *) key, hash_any (k=0xbffe1430 "x\001", keylen=16) at hashfunc.c:201 201 { 208 len = keylen; 201 { 209 a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */ 210 c = 3923095; /* initialize with an arbitrary value */ 220 len -= 12; 208 len = keylen; 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 218 mix(a, b, c); 220 len -= 12; 218 mix(a, b, c); 219 k += 12; 220 len -= 12; 224 c += keylen; 225 switch (len) /* all the case statements fall through */ 243 a += ((uint32) k[3] << 24); 245 a += ((uint32) k[2] << 16); 247 a += ((uint32) k[1] << 8); 249 a += k[0]; 252 mix(a, b, c); 255 } 252 mix(a, b, c); 255 } hash_search (hashp=0x9a69180, keyPtr=0xbffe1430, action=HASH_ENTER, foundPtr=0xbffe13af "") at dynahash.c:478 478 bucket = hash_val & hctl->high_mask; 475 { 479 if (bucket > hctl->max_bucket) 558 segment_ndx = MOD(bucket, hctl->ssize); 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 562 if (segp == NULL) 571 match = hashp->match; /* save one fetch in inner loop */ 565 prevBucketPtr = &segp[segment_ndx]; 571 match = hashp->match; /* save one fetch in inner loop */ 566 currBucket = *prevBucketPtr; 571 match = hashp->match; /* save one fetch in inner loop */ 578 currBucket = *prevBucketPtr; 586 if (foundPtr) 587 *foundPtr = (bool) (currBucket != NULL); 592 switch (action) 633 if (currBucket != NULL) 637 currBucket = hctl->freeList; 638 if (currBucket == NULL) 647 hctl->freeList = currBucket->link; 650 *prevBucketPtr = currBucket; 651 currBucket->link = NULL; 654 currBucket->hashvalue = hashvalue; 655 hashp->keycopy(ELEMENTKEY(currBucket), keyPtr, hctl->keysize); 660 if (++hctl->nentries / (long) (hctl->max_bucket + 1) > hctl->ffactor) 670 return (void *) ELEMENTKEY(currBucket); 676 } LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:474 474 if (!lock) 471 lock = (LOCK *) hash_search(lockMethodTable->lockHash, 474 if (!lock) 486 if (!found) 488 lock->grantMask = 0; 490 SHMQueueInit(&(lock->lockHolders)); 488 lock->grantMask = 0; 489 lock->waitMask = 0; 490 SHMQueueInit(&(lock->lockHolders)); SHMQueueInit (queue=0xb7b4bb20) at shmqueue.c:43 43 { 45 (queue)->prev = (queue)->next = MAKE_OFFSET(queue); LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:491 491 ProcQueueInit(&(lock->waitProcs)); ProcQueueInit (queue=0xbffe1430) at proc.c:501 501 { 502 SHMQueueInit(&(queue->links)); SHMQueueInit (queue=0xb7b4bb28) at shmqueue.c:43 43 { 45 (queue)->prev = (queue)->next = MAKE_OFFSET(queue); ProcQueueInit (queue=0xb7b4bb28) at proc.c:503 503 queue->size = 0; LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:492 492 lock->nRequested = 0; 494 MemSet((char *) lock->requested, 0, sizeof(int) * MAX_LOCKMODES); 492 lock->nRequested = 0; 493 lock->nGranted = 0; 494 MemSet((char *) lock->requested, 0, sizeof(int) * MAX_LOCKMODES); 495 MemSet((char *) lock->granted, 0, sizeof(int) * MAX_LOCKMODES); 509 MemSet(&proclocktag, 0, sizeof(PROCLOCKTAG)); /* must clear padding, 511 proclocktag.lock = MAKE_OFFSET(lock); 512 proclocktag.proc = MAKE_OFFSET(MyProc); 513 TransactionIdStore(xid, &proclocktag.xid); 518 proclockTable = lockMethodTable->proclockHash; 519 proclock = (PROCLOCK *) hash_search(proclockTable, hash_search (hashp=0x9a691f0, keyPtr=0xbffe13e0, action=HASH_ENTER, foundPtr=0xbffe13af "") at dynahash.c:515 515 HASHHDR *hctl = hashp->hctl; 538 if (action == HASH_REMOVE_SAVED) 515 HASHHDR *hctl = hashp->hctl; 516 uint32 hashvalue = 0; 538 if (action == HASH_REMOVE_SAVED) 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); tag_hash (key=0x9a691f0, keysize=12) at hashfn.c:42 42 } tag_hash (key=0x9a691f0, keysize=3221099488) at hashfn.c:40 40 return DatumGetUInt32(hash_any((const unsigned char *) key, hash_any (k=0xbffe13e0 "\b«\203", keylen=12) at hashfunc.c:201 201 { 208 len = keylen; 201 { 209 a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */ 210 c = 3923095; /* initialize with an arbitrary value */ 220 len -= 12; 208 len = keylen; 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 218 mix(a, b, c); 220 len -= 12; 218 mix(a, b, c); 219 k += 12; 220 len -= 12; 224 c += keylen; 225 switch (len) /* all the case statements fall through */ 252 mix(a, b, c); 255 } 252 mix(a, b, c); 255 } hash_search (hashp=0x9a691f0, keyPtr=0xbffe13e0, action=HASH_ENTER, foundPtr=0xbffe13af "") at dynahash.c:478 478 bucket = hash_val & hctl->high_mask; 475 { 479 if (bucket > hctl->max_bucket) 558 segment_ndx = MOD(bucket, hctl->ssize); 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 562 if (segp == NULL) 571 match = hashp->match; /* save one fetch in inner loop */ 565 prevBucketPtr = &segp[segment_ndx]; 571 match = hashp->match; /* save one fetch in inner loop */ 566 currBucket = *prevBucketPtr; 571 match = hashp->match; /* save one fetch in inner loop */ 578 currBucket = *prevBucketPtr; 586 if (foundPtr) 587 *foundPtr = (bool) (currBucket != NULL); 592 switch (action) 633 if (currBucket != NULL) 637 currBucket = hctl->freeList; 638 if (currBucket == NULL) 647 hctl->freeList = currBucket->link; 650 *prevBucketPtr = currBucket; 651 currBucket->link = NULL; 654 currBucket->hashvalue = hashvalue; 655 hashp->keycopy(ELEMENTKEY(currBucket), keyPtr, hctl->keysize); 660 if (++hctl->nentries / (long) (hctl->max_bucket + 1) > hctl->ffactor) 670 return (void *) ELEMENTKEY(currBucket); 676 } LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:522 522 if (!proclock) 519 proclock = (PROCLOCK *) hash_search(proclockTable, 522 if (!proclock) 534 if (!found) 537 MemSet((char *) proclock->holding, 0, sizeof(int) * MAX_LOCKMODES); 536 proclock->nHolding = 0; 537 MemSet((char *) proclock->holding, 0, sizeof(int) * MAX_LOCKMODES); 539 SHMQueueInsertBefore(&lock->lockHolders, &proclock->lockLink); SHMQueueInsertBefore (queue=0x9a691f0, elem=0xb7b4c578) at shmqueue.c:102 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 104 SHMEM_OFFSET elemOffset = MAKE_OFFSET(elem); 113 (elem)->next = prevPtr->next; 114 (elem)->prev = queue->prev; 116 prevPtr->next = elemOffset; 115 (queue)->prev = elemOffset; 116 prevPtr->next = elemOffset; LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:540 540 SHMQueueInsertBefore(&MyProc->procHolders, &proclock->procLink); SHMQueueInsertBefore (queue=0xb7b4c57c, elem=0xb7b4c57c) at shmqueue.c:102 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 104 SHMEM_OFFSET elemOffset = MAKE_OFFSET(elem); 113 (elem)->next = prevPtr->next; 114 (elem)->prev = queue->prev; 116 prevPtr->next = elemOffset; 115 (queue)->prev = elemOffset; 116 prevPtr->next = elemOffset; LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:587 587 lock->nRequested++; 588 lock->requested[lockmode]++; 595 if (proclock->holding[lockmode] > 0) 607 LockCountMyLocks(proclock->tag.lock, MyProc, myHolding); LockCountMyLocks (lockOffset=8629000, proc=0xb7b1c760, myHolding=0xbffe13b0) at lock.c:810 810 { 815 MemSet(myHolding, 0, MAX_LOCKMODES * sizeof(int)); 810 { 811 SHM_QUEUE *procHolders = &(proc->procHolders); 815 MemSet(myHolding, 0, MAX_LOCKMODES * sizeof(int)); 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, SHMQueueNext (queue=0xb7b1c7a4, curElem=0xb7b1c7a4, linkOffset=64) at shmqueue.c:179 179 SHM_QUEUE *elemPtr = (SHM_QUEUE *) MAKE_PTR((curElem)->next); 184 return NULL; 183 if (elemPtr == queue) /* back to the queue head? */ 186 return (Pointer) (((char *) elemPtr) - linkOffset); 187 } LockCountMyLocks (lockOffset=8629000, proc=) at lock.c:820 820 while (proclock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 822 if (lockOffset == proclock->tag.lock) 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, SHMQueueNext (queue=0xb7b1c7a4, curElem=0xb7b4c584, linkOffset=64) at shmqueue.c:179 179 SHM_QUEUE *elemPtr = (SHM_QUEUE *) MAKE_PTR((curElem)->next); 184 return NULL; 183 if (elemPtr == queue) /* back to the queue head? */ 187 } LockCountMyLocks (lockOffset=8629000, proc=) at lock.c:820 820 while (proclock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:608 608 if (myHolding[lockmode] > 0) 621 if (lockMethodTable->conflictTab[lockmode] & lock->waitMask) 624 status = LockCheckConflicts(lockMethodTable, lockmode, LockCheckConflicts (lockMethodTable=0xb7b18154, lockmode=7, lock=0xb7b4bb08, proclock=0x0, proc=0xb7b1c760, myHolding=0xbffe13b0) at lock.c:738 738 { 739 int numLockModes = lockMethodTable->numLockModes; 754 if (!(lockMethodTable->conflictTab[lockmode] & lock->grantMask)) 757 return STATUS_OK; 754 if (!(lockMethodTable->conflictTab[lockmode] & lock->grantMask)) 738 { 754 if (!(lockMethodTable->conflictTab[lockmode] & lock->grantMask)) 796 } LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:628 628 if (status == STATUS_OK) 631 GrantLock(lock, proclock, lockmode); GrantLock (lock=0xb7b4bb08, proclock=0xb7b4c544, lockmode=7) at lock.c:842 842 { 844 lock->granted[lockmode]++; 842 { 843 lock->nGranted++; 844 lock->granted[lockmode]++; 845 lock->grantMask |= BITS_ON[lockmode]; 846 if (lock->granted[lockmode] == lock->requested[lockmode]) 847 lock->waitMask &= BITS_OFF[lockmode]; 851 proclock->holding[lockmode]++; 852 proclock->nHolding++; LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:710 710 LWLockRelease(masterLock); LWLockRelease (lockid=LockMgrLock) at lwlock.c:409 409 { 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 423 if (lockid == held_lwlocks[i]) 426 if (i < 0) 428 num_held_lwlocks--; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 436 if (lock->exclusive > 0) 437 lock->exclusive--; 450 head = lock->head; 451 if (head != NULL) 481 SpinLockRelease_NoHoldoff(&lock->mutex); 499 RESUME_INTERRUPTS(); LockAcquire (lockmethod=1, locktag=0xbffe1430, xid=5338, lockmode=7, dontWait=0 '\0') at lock.c:712 712 return status == STATUS_OK; 713 } 712 return status == STATUS_OK; 713 } XactLockTableInsert (xid=5338) at lmgr.c:326 326 } StartTransaction () at xact.c:882 882 s->commandId = FirstCommandId; 883 s->startTime = GetCurrentAbsoluteTimeUsec(&(s->startTimeUsec)); GetCurrentAbsoluteTimeUsec (usec=0x0) at nabstime.c:113 113 gettimeofday(&tp, NULL); 115 *usec = tp.tv_usec; 114 now = tp.tv_sec; 115 *usec = tp.tv_usec; 117 } StartTransaction () at xact.c:477 477 TopTransactionContext = AllocSetContextCreate (parent=0x9a5cd28, name=0x81c9c8f "TopTransactionContext", minContextSize=0, initBlockSize=8192, maxBlockSize=8388608) at aset.c:297 297 { 301 context = (AllocSet) MemoryContextCreate(T_AllocSetContext, 312 initBlockSize = MAXALIGN(initBlockSize); 301 context = (AllocSet) MemoryContextCreate(T_AllocSetContext, 312 initBlockSize = MAXALIGN(initBlockSize); 301 context = (AllocSet) MemoryContextCreate(T_AllocSetContext, MemoryContextCreate (tag=T_AllocSetContext, size=80, methods=0x82401a0, parent=0x9a5cd28, name=0x81c9c8f "TopTransactionContext") at mcxt.c:428 428 Size needed = size + strlen(name) + 1; 431 if (TopMemoryContext != NULL) 426 { 428 Size needed = size + strlen(name) + 1; 431 if (TopMemoryContext != NULL) 428 Size needed = size + strlen(name) + 1; 431 if (TopMemoryContext != NULL) 434 node = (MemoryContext) MemoryContextAlloc(TopMemoryContext, MemoryContextAlloc (context=0x9a5cd28, size=102) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x259, size=80) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a5cd28, size=102) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 546 if (chunk->size >= size) 555 if (chunk != NULL) 557 if (priorfree == NULL) 558 set->freelist[fidx] = (AllocChunk) chunk->aset; 562 chunk->aset = (void *) set; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextCreate (tag=T_AllocSetContext, size=80, methods=0x82401a0, parent=0x9a5cd28, name=) at mcxt.c:440 440 node = (MemoryContext) malloc(needed); 445 MemSet(node, 0, size); 440 node = (MemoryContext) malloc(needed); 445 MemSet(node, 0, size); 445 MemSet(node, 0, size); 452 strcpy(node->name, name); 446 node->type = tag; 452 strcpy(node->name, name); 446 node->type = tag; 447 node->methods = methods; 451 node->name = ((char *) node) + size; 447 node->methods = methods; 448 node->parent = NULL; /* for the moment */ 449 node->firstchild = NULL; 450 node->nextchild = NULL; 452 strcpy(node->name, name); 455 (*node->methods->init) (node); AllocSetInit (context=0x9a8cdc0) at aset.c:365 365 { MemoryContextCreate (tag=T_AllocSetContext, size=80, methods=0x82401a0, parent=0x9a5cd28, name=0x81c9c8f "TopTransactionContext") at mcxt.c:458 458 if (parent) 460 node->parent = parent; 461 node->nextchild = parent->firstchild; 460 node->parent = parent; 461 node->nextchild = parent->firstchild; 462 parent->firstchild = node; 467 } AllocSetContextCreate (parent=0x9a5cd28, name=0x81c9c8f "TopTransactionContext", minContextSize=0, initBlockSize=8192, maxBlockSize=8388608) at aset.c:313 313 if (initBlockSize < 1024) 301 context = (AllocSet) MemoryContextCreate(T_AllocSetContext, 313 if (initBlockSize < 1024) 315 maxBlockSize = MAXALIGN(maxBlockSize); 316 if (maxBlockSize < initBlockSize) 318 context->initBlockSize = initBlockSize; 319 context->maxBlockSize = maxBlockSize; 324 if (minContextSize > ALLOC_BLOCKHDRSZ + ALLOC_CHUNKHDRSZ) 349 } StartTransaction () at xact.c:484 484 MemoryContextSwitchTo(TopTransactionContext); 477 TopTransactionContext = 484 MemoryContextSwitchTo(TopTransactionContext); MemoryContextSwitchTo (context=0x9a5cd28) at mcxt.c:611 611 CurrentMemoryContext = context; 610 old = CurrentMemoryContext; 611 CurrentMemoryContext = context; 613 } StartTransaction () at xact.c:889 889 AtStart_Cache(); AtStart_Cache () at xact.c:446 446 AcceptInvalidationMessages(); AcceptInvalidationMessages () at inval.c:563 563 { 564 ReceiveSharedInvalidMessages(LocalExecuteInvalidationMessage, ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:90 90 bool gotMessage = false; 110 LWLockAcquire(SInvalLock, LW_SHARED); LWLockAcquire (lockid=SInvalLock, mode=LW_SHARED) at lwlock.c:218 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 200 PGPROC *proc = MyProc; 199 volatile LWLock *lock = LWLockArray + lockid; 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 201 bool retry = false; 202 int extraWaits = 0; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 245 if (retry) 249 if (mode == LW_EXCLUSIVE) 261 if (lock->exclusive == 0) 263 lock->shared++; 325 SpinLockRelease_NoHoldoff(&lock->mutex); 329 held_lwlocks[num_held_lwlocks++] = lockid; 335 PGSemaphoreUnlock(&proc->sem); ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:111 111 getResult = SIGetDataEntry(shmInvalBuffer, MyBackendId, &data); SIGetDataEntry (segP=0xb7b1c800, backendId=1, data=0xbffe1410) at sinvaladt.c:283 283 { 284 ProcState *stateP = &segP->procState[backendId - 1]; 283 { 284 ProcState *stateP = &segP->procState[backendId - 1]; 286 if (stateP->resetState) 283 { 286 if (stateP->resetState) 297 if (stateP->nextMsgNum >= segP->maxMsgNum) 298 return 0; /* nothing to read */ 297 if (stateP->nextMsgNum >= segP->maxMsgNum) 312 } ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:112 112 LWLockRelease(SInvalLock); LWLockRelease (lockid=SInvalLock) at lwlock.c:409 409 { 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 423 if (lockid == held_lwlocks[i]) 426 if (i < 0) 428 num_held_lwlocks--; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 436 if (lock->exclusive > 0) 441 lock->shared--; 450 head = lock->head; 451 if (head != NULL) 481 SpinLockRelease_NoHoldoff(&lock->mutex); 499 RESUME_INTERRUPTS(); ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:114 114 if (getResult == 0) 131 if (gotMessage) 137 } 0x081ac7a5 in AcceptInvalidationMessages () at inval.c:564 564 ReceiveSharedInvalidMessages(LocalExecuteInvalidationMessage, StartTransaction () at xact.c:895 895 DeferredTriggerBeginXact(); DeferredTriggerBeginXact () at trigger.c:2103 2103 deferredTriggers = (DeferredTriggers) MemoryContextAlloc(TopTransactionContext, 2101 MemoryContext cxt = TopTransactionContext; 2103 deferredTriggers = (DeferredTriggers) MemoryContextAlloc(TopTransactionContext, MemoryContextAlloc (context=0x9a8cdc0, size=24) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x8241050, size=136581200) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cdc0, size=24) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 649 blksize = set->initBlockSize; 673 required_size = chunk_size + ALLOC_BLOCKHDRSZ + ALLOC_CHUNKHDRSZ; 678 block = (AllocBlock) malloc(blksize); 685 while (block == NULL && blksize > 1024 * 1024) 690 block = (AllocBlock) malloc(blksize); 678 block = (AllocBlock) malloc(blksize); 690 block = (AllocBlock) malloc(blksize); 703 block->aset = set; 704 block->freeptr = ((char *) block) + ALLOC_BLOCKHDRSZ; 705 block->endptr = ((char *) block) + blksize; 716 if (set->blocks == NULL && blksize == set->initBlockSize) 719 set->keeper = block; 722 block->next = set->blocks; 723 set->blocks = block; 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } DeferredTriggerBeginXact () at trigger.c:2109 2109 deferredTriggers->deftrig_cxt = AllocSetContextCreate(cxt, 2103 deferredTriggers = (DeferredTriggers) MemoryContextAlloc(TopTransactionContext, 2109 deferredTriggers->deftrig_cxt = AllocSetContextCreate(cxt, AllocSetContextCreate (parent=0x9a8cdc0, name=0x820b3a2 "DeferredTriggerXact", minContextSize=0, initBlockSize=8192, maxBlockSize=8388608) at aset.c:297 297 { 301 context = (AllocSet) MemoryContextCreate(T_AllocSetContext, 312 initBlockSize = MAXALIGN(initBlockSize); 301 context = (AllocSet) MemoryContextCreate(T_AllocSetContext, 312 initBlockSize = MAXALIGN(initBlockSize); 301 context = (AllocSet) MemoryContextCreate(T_AllocSetContext, MemoryContextCreate (tag=T_AllocSetContext, size=80, methods=0x82401a0, parent=0x9a8cdc0, name=0x820b3a2 "DeferredTriggerXact") at mcxt.c:428 428 Size needed = size + strlen(name) + 1; 431 if (TopMemoryContext != NULL) 426 { 428 Size needed = size + strlen(name) + 1; 431 if (TopMemoryContext != NULL) 428 Size needed = size + strlen(name) + 1; 431 if (TopMemoryContext != NULL) 434 node = (MemoryContext) MemoryContextAlloc(TopMemoryContext, MemoryContextAlloc (context=0x9a5cd28, size=100) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x259, size=80) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a5cd28, size=100) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 546 if (chunk->size >= size) 555 if (chunk != NULL) 557 if (priorfree == NULL) 558 set->freelist[fidx] = (AllocChunk) chunk->aset; 562 chunk->aset = (void *) set; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextCreate (tag=T_AllocSetContext, size=80, methods=0x82401a0, parent=0x9a8cdc0, name=) at mcxt.c:440 440 node = (MemoryContext) malloc(needed); 445 MemSet(node, 0, size); 440 node = (MemoryContext) malloc(needed); 445 MemSet(node, 0, size); 445 MemSet(node, 0, size); 452 strcpy(node->name, name); 446 node->type = tag; 452 strcpy(node->name, name); 446 node->type = tag; 447 node->methods = methods; 451 node->name = ((char *) node) + size; 447 node->methods = methods; 448 node->parent = NULL; /* for the moment */ 449 node->firstchild = NULL; 450 node->nextchild = NULL; 452 strcpy(node->name, name); 455 (*node->methods->init) (node); AllocSetInit (context=0x9a8ce48) at aset.c:365 365 { MemoryContextCreate (tag=T_AllocSetContext, size=80, methods=0x82401a0, parent=0x9a8cdc0, name=0x820b3a2 "DeferredTriggerXact") at mcxt.c:458 458 if (parent) 460 node->parent = parent; 461 node->nextchild = parent->firstchild; 460 node->parent = parent; 461 node->nextchild = parent->firstchild; 462 parent->firstchild = node; 467 } AllocSetContextCreate (parent=0x9a8cdc0, name=0x820b3a2 "DeferredTriggerXact", minContextSize=0, initBlockSize=8192, maxBlockSize=8388608) at aset.c:313 313 if (initBlockSize < 1024) 301 context = (AllocSet) MemoryContextCreate(T_AllocSetContext, 313 if (initBlockSize < 1024) 315 maxBlockSize = MAXALIGN(maxBlockSize); 316 if (maxBlockSize < initBlockSize) 318 context->initBlockSize = initBlockSize; 319 context->maxBlockSize = maxBlockSize; 324 if (minContextSize > ALLOC_BLOCKHDRSZ + ALLOC_CHUNKHDRSZ) 349 } DeferredTriggerBeginXact () at trigger.c:2118 2118 deferredTriggers->deftrig_all_isdeferred = false; 2119 deferredTriggers->deftrig_all_isset = false; 2121 deferredTriggers->deftrig_trigstates = NIL; 2122 deferredTriggers->deftrig_events = NULL; 2123 deferredTriggers->deftrig_events_imm = NULL; 2124 deferredTriggers->deftrig_event_tail = NULL; StartTransaction () at xact.c:901 901 s->state = TRANS_INPROGRESS; StartTransactionCommand () at xact.c:1243 1243 MemoryContextSwitchTo(TopTransactionContext); MemoryContextSwitchTo (context=0x9a8cdc0) at mcxt.c:611 611 CurrentMemoryContext = context; 610 old = CurrentMemoryContext; 611 CurrentMemoryContext = context; 613 } start_xact_command () at postgres.c:1793 1793 if (StatementTimeout > 0) 1796 xact_started = true; 1798 } exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:773 773 if (unnamed_stmt_context) 772 unnamed_stmt_pstmt = NULL; 773 if (unnamed_stmt_context) 783 oldcontext = MemoryContextSwitchTo(MessageContext); 778 unnamed_stmt_context = NULL; 783 oldcontext = MemoryContextSwitchTo(MessageContext); MemoryContextSwitchTo (context=0x9a8cdc0) at mcxt.c:611 611 CurrentMemoryContext = context; 610 old = CurrentMemoryContext; 611 CurrentMemoryContext = context; 613 } exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:785 785 QueryContext = CurrentMemoryContext; 791 parsetree_list = pg_parse_query(query_string); pg_parse_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:516 516 if (log_statement) 513 { 516 if (log_statement) 520 if (log_parser_stats) 523 raw_parsetree_list = raw_parser(query_string); raw_parser ( str=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at parser.c:51 51 scanner_init(str); 48 parsetree = NIL; /* in case grammar forgets to set it */ 49 have_lookahead = false; 51 scanner_init(str); scanner_init ( str=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at scan.l:619 619 { 620 Size slen = strlen(str); 625 if (YY_CURRENT_BUFFER) 620 Size slen = strlen(str); 625 if (YY_CURRENT_BUFFER) 620 Size slen = strlen(str); 625 if (YY_CURRENT_BUFFER) 631 scanbuf = palloc(slen + 2); MemoryContextAlloc (context=0x9a8cd38, size=56) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9aa7648, size=24) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=56) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } scanner_init (str=) at scan.l:632 632 memcpy(scanbuf, str, slen); 631 scanbuf = palloc(slen + 2); 632 memcpy(scanbuf, str, slen); 633 scanbuf[slen] = scanbuf[slen + 1] = YY_END_OF_BUFFER_CHAR; 634 scanbufhandle = yy_scan_buffer(scanbuf, slen + 2); base_yy_scan_buffer ( base=0x9aa7858 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);", size=56) at scan.c:5175 5175 { 5178 if ( size < 2 || 5175 { 5178 if ( size < 2 || 5184 b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); yy_flex_alloc (size=) at scan.c:5389 5389 } base_yy_scan_buffer ( base=0x9aa7858 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);", size=56) at scan.c:5185 5185 if ( ! b ) 5184 b = (YY_BUFFER_STATE) yy_flex_alloc( sizeof( struct yy_buffer_state ) ); 5185 if ( ! b ) 5188 b->yy_buf_size = size - 2; /* "- 2" to take care of EOB's */ 5189 b->yy_buf_pos = b->yy_ch_buf = base; 5192 b->yy_n_chars = b->yy_buf_size; 5190 b->yy_is_our_buffer = 0; 5191 b->yy_input_file = 0; 5193 b->yy_is_interactive = 0; 5194 b->yy_at_bol = 1; 5195 b->yy_fill_buffer = 0; 5196 b->yy_buffer_status = YY_BUFFER_NEW; 5198 yy_switch_to_buffer( b ); base_yy_switch_to_buffer (new_buffer=0x9a6eb58) at scan.c:5016 5016 { 5017 if ( yy_current_buffer == new_buffer ) 5020 if ( yy_current_buffer ) 5028 yy_current_buffer = new_buffer; 5029 yy_load_buffer_state(); base_yy_load_buffer_state () at scan.c:5045 5045 { 5046 yy_n_chars = yy_current_buffer->yy_n_chars; 5047 yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos; 5048 yyin = yy_current_buffer->yy_input_file; 5049 yy_hold_char = *yy_c_buf_p; 5045 { 5049 yy_hold_char = *yy_c_buf_p; base_yy_switch_to_buffer (new_buffer=0x9a6eb58) at scan.c:5036 5036 yy_did_buffer_switch_on_eof = 1; 5037 } base_yy_scan_buffer ( base=0x9aa7858 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);", size=56) at scan.c:5201 5201 } 5200 return b; 5201 } scanner_init (str=) at scan.l:638 638 literalbuf = (char *) palloc(literalalloc); 634 scanbufhandle = yy_scan_buffer(scanbuf, slen + 2); 637 literalalloc = 128; 638 literalbuf = (char *) palloc(literalalloc); MemoryContextAlloc (context=0x9a8cd38, size=128) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9aa7648, size=24) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=128) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } scanner_init (str=) at scan.l:639 639 startlit(); 641 BEGIN(INITIAL); raw_parser ( str=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at parser.c:52 52 parser_init(); parser_init () at gram.y:7994 7994 QueryIsRule = FALSE; raw_parser ( str=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at parser.c:53 53 parse_expr_init(); parse_expr_init () at parse_expr.c:60 60 expr_depth_counter = 0; raw_parser ( str=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at parser.c:55 55 yyresult = yyparse(); yyparse () at y.tab.c:9424 in y.tab.c 9404 in y.tab.c 9424 in y.tab.c 9459 in y.tab.c 9429 in y.tab.c 9436 in y.tab.c 9449 in y.tab.c 9450 in y.tab.c 9451 in y.tab.c 9452 in y.tab.c 9459 in y.tab.c 9460 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9566 in y.tab.c yylex () at parser.c:83 83 if (have_lookahead) 89 cur_token = base_yylex(); base_yylex () at scan.c:4034 4034 if ( yy_init ) 272 token_start = NULL; 4034 if ( yy_init ) 4042 if ( ! yy_start ) 4036 yy_init = 0; 4042 if ( ! yy_start ) 4045 if ( ! yyin ) 4046 yyin = stdin; 4048 if ( ! yyout ) 4049 yyout = stdout; 4051 if ( ! yy_current_buffer ) 4055 yy_load_buffer_state(); base_yy_load_buffer_state () at scan.c:5045 5045 { 5046 yy_n_chars = yy_current_buffer->yy_n_chars; 5047 yytext_ptr = yy_c_buf_p = yy_current_buffer->yy_buf_pos; 5048 yyin = yy_current_buffer->yy_input_file; 5049 yy_hold_char = *yy_c_buf_p; 5045 { 5049 yy_hold_char = *yy_c_buf_p; base_yylex () at scan.c:4063 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 560 keyword = ScanKeywordLookup(yytext); ScanKeywordLookup (text=0x9aa7858 "select") at keywords.c:354 354 { 361 len = strlen(text); 364 return NULL; 363 if (len >= NAMEDATALEN) 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 378 word[len] = '\0'; 383 low = &ScanKeywords[0]; 384 high = endof(ScanKeywords) - 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 395 low = middle + 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 395 low = middle + 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 395 low = middle + 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 395 low = middle + 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 395 low = middle + 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 401 } 393 return middle; 401 } base_yylex () at scan.l:561 561 if (keyword != NULL) 560 keyword = ScanKeywordLookup(yytext); 561 if (keyword != NULL) 563 yylval.keyword = keyword->name; 564 return keyword->value; 4677 } /* end of yylex */ yylex () at parser.c:92 92 switch (cur_token) 108 } yyparse () at y.tab.c:9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9594 in y.tab.c 9601 in y.tab.c 9602 in y.tab.c 9604 in y.tab.c 9610 in y.tab.c 18341 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9566 in y.tab.c yylex () at parser.c:83 83 if (have_lookahead) 89 cur_token = base_yylex(); base_yylex () at scan.c:4034 4034 if ( yy_init ) 272 token_start = NULL; 4034 if ( yy_init ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 560 keyword = ScanKeywordLookup(yytext); ScanKeywordLookup (text=0x9aa785f "pcm_getmiles_s") at keywords.c:354 354 { 361 len = strlen(text); 364 return NULL; 363 if (len >= NAMEDATALEN) 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 372 char ch = text[i]; 374 if (ch >= 'A' && ch <= 'Z') 376 word[i] = ch; 370 for (i = 0; i < len; i++) 378 word[len] = '\0'; 383 low = &ScanKeywords[0]; 384 high = endof(ScanKeywords) - 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 395 low = middle + 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 395 low = middle + 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 395 low = middle + 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 395 low = middle + 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 395 low = middle + 1; 397 high = middle - 1; 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 390 middle = low + (high - low) / 2; 391 difference = strcmp(middle->name, word); 392 if (difference == 0) 394 else if (difference < 0) 397 high = middle - 1; 400 return NULL; 401 } base_yylex () at scan.l:561 561 if (keyword != NULL) 560 keyword = ScanKeywordLookup(yytext); 561 if (keyword != NULL) 571 ident = downcase_truncate_identifier(yytext, yyleng, true); downcase_truncate_identifier (ident=0x9aa785f "pcm_getmiles_s", len=14, warn=1 '\001') at scansup.c:131 131 { 135 result = palloc(len + 1); 145 for (i = 0; i < len; i++) 135 result = palloc(len + 1); MemoryContextAlloc (context=0x9a8cd38, size=15) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9aa785f, size=14) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=15) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } downcase_truncate_identifier (ident=0x9aa785f "pcm_getmiles_s", len=14, warn=1 '\001') at scansup.c:145 145 for (i = 0; i < len; i++) 135 result = palloc(len + 1); 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 157 if (i >= NAMEDATALEN) 155 result[i] = '\0'; 157 if (i >= NAMEDATALEN) 161 } base_yylex () at scan.l:573 573 return IDENT; 572 yylval.str = ident; 4677 } /* end of yylex */ yylex () at parser.c:92 92 switch (cur_token) 108 } yyparse () at y.tab.c:9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 4553 | /*EMPTY*/ { $$ = NIL; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9594 in y.tab.c 9601 in y.tab.c 9602 in y.tab.c 9604 in y.tab.c 9610 in y.tab.c 18341 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9566 in y.tab.c yylex () at parser.c:83 83 if (have_lookahead) 89 cur_token = base_yylex(); base_yylex () at scan.c:4034 4034 if ( yy_init ) 272 token_start = NULL; 4034 if ( yy_init ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 576 {other} { return yytext[0]; } 4677 } /* end of yylex */ yylex () at parser.c:92 92 switch (cur_token) 108 } yyparse () at y.tab.c:9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9588 in y.tab.c 9590 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 7256 IDENT { $$ = $1; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 7111 { $$ = makeList1(makeString($1)); } makeString (str=0x9aa7928 "pcm_getmiles_s") at list.c:67 67 Value *v = makeNode(Value); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=8) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=8) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=8) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } makeString (str=0x9aa7948 "") at list.c:69 69 v->type = T_String; 70 v->val.str = str; 72 } lcons (obj=0x9aa7928, list=0x9aa7928) at list.c:99 99 List *l = makeNode(List); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } lcons (obj=0x9aa7964, list=0x9aa7964) at list.c:101 101 lfirst(l) = obj; 102 lnext(l) = list; 104 } yyparse () at gram.y:7112 7112 | dotted_name { $$ = $1; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9594 in y.tab.c 9601 in y.tab.c 9602 in y.tab.c 9604 in y.tab.c 9610 in y.tab.c 18341 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9566 in y.tab.c yylex () at parser.c:83 83 if (have_lookahead) 89 cur_token = base_yylex(); base_yylex () at scan.c:4034 4034 if ( yy_init ) 272 token_start = NULL; 4034 if ( yy_init ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 374 token_start = yytext; 375 BEGIN(xq); 416 startlit(); 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 434 addlit(yytext, yyleng); addlit (ytext=0x9aa786f "sparta, nc", yleng=10) at scan.l:660 660 if ((literallen+yleng) >= literalalloc) 658 { 660 if ((literallen+yleng) >= literalalloc) 668 memcpy(literalbuf+literallen, ytext, yleng); 669 literallen += yleng; 670 literalbuf[literallen] = '\0'; 669 literallen += yleng; 670 literalbuf[literallen] = '\0'; base_yylex () at scan.c:4063 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 379 BEGIN(INITIAL); 380 yylval.str = litbufdup(); litbufdup () at scan.l:700 700 new = palloc(literallen + 1); MemoryContextAlloc (context=0x9a8cd38, size=11) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a8cd38, size=12) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=11) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } litbufdup () at scan.l:701 701 memcpy(new, literalbuf, literallen+1); 703 } base_yylex () at scan.l:381 381 return SCONST; 380 yylval.str = litbufdup(); 4677 } /* end of yylex */ yylex () at parser.c:92 92 switch (cur_token) 108 } yyparse () at y.tab.c:9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9594 in y.tab.c 9601 in y.tab.c 9602 in y.tab.c 9604 in y.tab.c 9610 in y.tab.c 18341 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 7226 Sconst: SCONST { $$ = $1; }; in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 7135 A_Const *n = makeNode(A_Const); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=16) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=16) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=16) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } yyparse () at gram.y:7136 7136 n->val.type = T_String; 7137 n->val.val.str = $1; 7138 $$ = (Node *)n; 7140 | BCONST in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 6151 | AexprConst { $$ = $1; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 5737 a_expr: c_expr { $$ = $1; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9566 in y.tab.c yylex () at parser.c:83 83 if (have_lookahead) 89 cur_token = base_yylex(); base_yylex () at scan.c:4034 4034 if ( yy_init ) 272 token_start = NULL; 4034 if ( yy_init ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 576 {other} { return yytext[0]; } 4677 } /* end of yylex */ yylex () at parser.c:92 92 switch (cur_token) 108 } yyparse () at y.tab.c:9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 6701 makeFastList1(dst, $1); lcons (obj=0x9aa7988, list=0x9aa7988) at list.c:99 99 List *l = makeNode(List); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } lcons (obj=0x9aa79ac, list=0x9aa79ac) at list.c:101 101 lfirst(l) = obj; 102 lnext(l) = list; 104 } yyparse () at gram.y:6703 6703 | expr_list ',' a_expr in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18188 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9594 in y.tab.c 9601 in y.tab.c 9602 in y.tab.c 9604 in y.tab.c 9610 in y.tab.c 18341 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9566 in y.tab.c yylex () at parser.c:83 83 if (have_lookahead) 89 cur_token = base_yylex(); base_yylex () at scan.c:4034 4034 if ( yy_init ) 272 token_start = NULL; 4034 if ( yy_init ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 374 token_start = yytext; 375 BEGIN(xq); 416 startlit(); 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 434 addlit(yytext, yyleng); addlit (ytext=0x9aa787d "buffalo, ny", yleng=11) at scan.l:660 660 if ((literallen+yleng) >= literalalloc) 658 { 660 if ((literallen+yleng) >= literalalloc) 668 memcpy(literalbuf+literallen, ytext, yleng); 669 literallen += yleng; 670 literalbuf[literallen] = '\0'; 669 literallen += yleng; 670 literalbuf[literallen] = '\0'; base_yylex () at scan.c:4063 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 379 BEGIN(INITIAL); 380 yylval.str = litbufdup(); litbufdup () at scan.l:700 700 new = palloc(literallen + 1); MemoryContextAlloc (context=0x9a8cd38, size=12) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a8cd38, size=12) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } litbufdup () at scan.l:701 701 memcpy(new, literalbuf, literallen+1); 703 } base_yylex () at scan.l:381 381 return SCONST; 380 yylval.str = litbufdup(); 4677 } /* end of yylex */ yylex () at parser.c:92 92 switch (cur_token) 108 } yyparse () at y.tab.c:9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9594 in y.tab.c 9601 in y.tab.c 9602 in y.tab.c 9604 in y.tab.c 9610 in y.tab.c 18341 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 7226 Sconst: SCONST { $$ = $1; }; in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 7135 A_Const *n = makeNode(A_Const); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=16) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=16) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=16) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } yyparse () at gram.y:7136 7136 n->val.type = T_String; 7137 n->val.val.str = $1; 7138 $$ = (Node *)n; 7140 | BCONST in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 6151 | AexprConst { $$ = $1; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 5737 a_expr: c_expr { $$ = $1; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18188 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9566 in y.tab.c yylex () at parser.c:83 83 if (have_lookahead) 89 cur_token = base_yylex(); base_yylex () at scan.c:4034 4034 if ( yy_init ) 272 token_start = NULL; 4034 if ( yy_init ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 576 {other} { return yytext[0]; } 4677 } /* end of yylex */ yylex () at parser.c:92 92 switch (cur_token) 108 } yyparse () at y.tab.c:9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 6707 *dst = *src; 6708 FastAppend(dst, $3); 6707 *dst = *src; 6708 FastAppend(dst, $3); FastAppend (fl=0xbffe0c08, datum=0x9aa79d0) at list.c:206 206 { 207 List *cell = makeList1(datum); lcons (obj=0x9aa79a0, list=0x9aa79a0) at list.c:99 99 List *l = makeNode(List); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } lcons (obj=0x9aa79f4, list=0x9aa79f4) at list.c:101 101 lfirst(l) = obj; 102 lnext(l) = list; 104 } FastAppend (fl=0xbffe0c08, datum=0x9aa79d0) at list.c:209 209 if (fl->tail) 211 lnext(fl->tail) = cell; 212 fl->tail = cell; 220 } yyparse () at gram.y:6710 6710 ; in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18188 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9594 in y.tab.c 9601 in y.tab.c 9602 in y.tab.c 9604 in y.tab.c 9610 in y.tab.c 18341 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9566 in y.tab.c yylex () at parser.c:83 83 if (have_lookahead) 89 cur_token = base_yylex(); base_yylex () at scan.c:4034 4034 if ( yy_init ) 272 token_start = NULL; 4034 if ( yy_init ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 529 errno = 0; 333 return __strtol_internal (__nptr, __endptr, __base, 0); 529 errno = 0; 333 return __strtol_internal (__nptr, __endptr, __base, 0); 531 if (*endptr != '\0' || errno == ERANGE 333 return __strtol_internal (__nptr, __endptr, __base, 0); 531 if (*endptr != '\0' || errno == ERANGE 542 yylval.ival = val; 543 return ICONST; 4677 } /* end of yylex */ yylex () at parser.c:92 92 switch (cur_token) 108 } yyparse () at y.tab.c:9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9594 in y.tab.c 9601 in y.tab.c 9602 in y.tab.c 9604 in y.tab.c 9610 in y.tab.c 18341 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 7225 Iconst: ICONST { $$ = $1; }; in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 7121 A_Const *n = makeNode(A_Const); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=16) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=16) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=16) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } yyparse () at gram.y:7122 7122 n->val.type = T_Integer; 7123 n->val.val.ival = $1; 7124 $$ = (Node *)n; 7126 | FCONST in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 6151 | AexprConst { $$ = $1; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 5737 a_expr: c_expr { $$ = $1; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18188 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9566 in y.tab.c yylex () at parser.c:83 83 if (have_lookahead) 89 cur_token = base_yylex(); base_yylex () at scan.c:4034 4034 if ( yy_init ) 272 token_start = NULL; 4034 if ( yy_init ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 576 {other} { return yytext[0]; } 4677 } /* end of yylex */ yylex () at parser.c:92 92 switch (cur_token) 108 } yyparse () at y.tab.c:9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 6707 *dst = *src; 6708 FastAppend(dst, $3); 6707 *dst = *src; 6708 FastAppend(dst, $3); FastAppend (fl=0xbffe0c08, datum=0x9aa7a00) at list.c:206 206 { 207 List *cell = makeList1(datum); lcons (obj=0x9aa79a0, list=0x9aa79a0) at list.c:99 99 List *l = makeNode(List); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } lcons (obj=0x9aa7a24, list=0x9aa7a24) at list.c:101 101 lfirst(l) = obj; 102 lnext(l) = list; 104 } FastAppend (fl=0xbffe0c08, datum=0x9aa7a00) at list.c:209 209 if (fl->tail) 211 lnext(fl->tail) = cell; 212 fl->tail = cell; 220 } yyparse () at gram.y:6710 6710 ; in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18188 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9594 in y.tab.c 9601 in y.tab.c 9602 in y.tab.c 9604 in y.tab.c 9610 in y.tab.c 18341 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 6198 FuncCall *n = makeNode(FuncCall); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=16) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=16) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=16) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } yyparse () at gram.y:6199 6199 n->funcname = $1; 6198 FuncCall *n = makeNode(FuncCall); 6199 n->funcname = $1; 6200 n->args = $3; 6201 n->agg_star = FALSE; 6202 n->agg_distinct = FALSE; 6203 $$ = (Node *)n; 6205 | func_name '(' ALL expr_list ')' in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 5737 a_expr: c_expr { $$ = $1; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18188 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9566 in y.tab.c yylex () at parser.c:83 83 if (have_lookahead) 89 cur_token = base_yylex(); base_yylex () at scan.c:4034 4034 if ( yy_init ) 272 token_start = NULL; 4034 if ( yy_init ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 4553 int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1; 4556 *yy_cp = yy_hold_char; 4559 if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW ) 4570 yy_n_chars = yy_current_buffer->yy_n_chars; 4571 yy_current_buffer->yy_input_file = yyin; 4572 yy_current_buffer->yy_buffer_status = YY_BUFFER_NORMAL; 4582 if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] ) 4695 if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) 4691 register char *source = yytext_ptr; 4695 if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) 4690 register char *dest = yy_current_buffer->yy_ch_buf; 4691 register char *source = yytext_ptr; 4695 if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) 4699 if ( yy_current_buffer->yy_fill_buffer == 0 ) 4701 if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 ) 4660 yy_c_buf_p = 4663 yy_current_state = yy_get_previous_state(); yy_get_previous_state () at scan.c:4827 4827 for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp ) 4821 { 4827 for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp ) 4825 yy_current_state = yy_start_state_list[yy_start]; 4827 for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp ) 4825 yy_current_state = yy_start_state_list[yy_start]; 4827 for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp ) 4829 yy_current_state += yy_current_state[(*yy_cp ? YY_SC_TO_UI(*yy_cp) : 256)].yy_nxt; 4830 if ( yy_current_state[-1].yy_nxt ) 4832 yy_last_accepting_state = yy_current_state; 4833 yy_last_accepting_cpos = yy_cp; 4827 for ( yy_cp = yytext_ptr + YY_MORE_ADJ; yy_cp < yy_c_buf_p; ++yy_cp ) 4838 } base_yylex () at scan.c:4666 4666 yy_bp = yytext_ptr + YY_MORE_ADJ; 4665 yy_cp = yy_c_buf_p; 4666 yy_bp = yytext_ptr + YY_MORE_ADJ; 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 576 {other} { return yytext[0]; } 4677 } /* end of yylex */ yylex () at parser.c:92 92 switch (cur_token) 108 } yyparse () at y.tab.c:9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 6977 $$ = makeNode(ResTarget); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=16) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=16) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=16) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } yyparse () at gram.y:6978 6978 $$->name = NULL; 6979 $$->indirection = NIL; 6980 $$->val = (Node *)$1; 6982 | '*' in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18188 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 6963 target_el { $$ = makeList1($1); } lcons (obj=0x9aa7a48, list=0x9aa7a48) at list.c:99 99 List *l = makeNode(List); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } lcons (obj=0x9aa7a6c, list=0x9aa7a6c) at list.c:101 101 lfirst(l) = obj; 102 lnext(l) = list; 104 } yyparse () at gram.y:6964 6964 | target_list ',' target_el { $$ = lappend($1, $3); } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 4487 | /*EMPTY*/ { $$ = NULL; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 4684 | /*EMPTY*/ { $$ = NIL; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 4993 | /*EMPTY*/ { $$ = NULL; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18188 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 4651 | /*EMPTY*/ { $$ = NIL; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 4656 | /*EMPTY*/ { $$ = NULL; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 4460 SelectStmt *n = makeNode(SelectStmt); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=68) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=68) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=68) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } yyparse () at gram.y:4461 4461 n->distinctClause = $2; 4460 SelectStmt *n = makeNode(SelectStmt); 4461 n->distinctClause = $2; 4462 n->targetList = $3; 4463 n->into = $4; 4464 n->intoColNames = NIL; 4465 n->fromClause = $5; 4466 n->whereClause = $6; 4467 n->groupClause = $7; 4468 n->havingClause = $8; 4469 $$ = (Node *)n; 4471 | select_clause UNION opt_all select_clause in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9588 in y.tab.c 9590 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 4406 simple_select { $$ = $1; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 18171 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18188 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 18171 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 472 { if ($1 != (Node *)NULL) 473 $$ = makeList1($1); lcons (obj=0x9aa7a78, list=0x9aa7a78) at list.c:99 99 List *l = makeNode(List); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } lcons (obj=0x9aa7b0c, list=0x9aa7b0c) at list.c:101 101 lfirst(l) = obj; 102 lnext(l) = list; 104 } yyparse () at y.tab.c:18171 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9576 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9594 in y.tab.c 9601 in y.tab.c 9602 in y.tab.c 9604 in y.tab.c 9610 in y.tab.c 18341 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9566 in y.tab.c yylex () at parser.c:83 83 if (have_lookahead) 89 cur_token = base_yylex(); base_yylex () at scan.c:4034 4034 if ( yy_init ) 272 token_start = NULL; 4034 if ( yy_init ) 4063 *yy_cp = yy_hold_char; 4070 yy_current_state = yy_start_state_list[yy_start]; 4060 yy_cp = yy_c_buf_p; 4068 yy_bp = yy_cp; 4070 yy_current_state = yy_start_state_list[yy_start]; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4082 yy_current_state += yy_trans_info->yy_nxt; 4084 if ( yy_current_state[-1].yy_nxt ) 4086 yy_last_accepting_state = yy_current_state; 4087 yy_last_accepting_cpos = yy_cp; 4077 for ( yy_c = YY_SC_TO_UI(*yy_cp); 4095 YY_DO_BEFORE_ACTION; 4093 yy_act = yy_current_state[-1].yy_nxt; 4095 YY_DO_BEFORE_ACTION; 4101 switch ( yy_act ) 4553 int yy_amount_of_matched_text = (int) (yy_cp - yytext_ptr) - 1; 4556 *yy_cp = yy_hold_char; 4559 if ( yy_current_buffer->yy_buffer_status == YY_BUFFER_NEW ) 4582 if ( yy_c_buf_p <= &yy_current_buffer->yy_ch_buf[yy_n_chars] ) 4695 if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) 4691 register char *source = yytext_ptr; 4695 if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) 4690 register char *dest = yy_current_buffer->yy_ch_buf; 4691 register char *source = yytext_ptr; 4695 if ( yy_c_buf_p > &yy_current_buffer->yy_ch_buf[yy_n_chars + 1] ) 4699 if ( yy_current_buffer->yy_fill_buffer == 0 ) 4701 if ( yy_c_buf_p - yytext_ptr - YY_MORE_ADJ == 1 ) 4637 yy_act = YY_STATE_EOF(YY_START); 4635 yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; 4637 yy_act = YY_STATE_EOF(YY_START); 4622 yy_did_buffer_switch_on_eof = 0; 4635 yy_c_buf_p = yytext_ptr + YY_MORE_ADJ; 4101 switch ( yy_act ) 4548 yyterminate(); 4677 } /* end of yylex */ yylex () at parser.c:92 92 switch (cur_token) 108 } yyparse () at y.tab.c:9569 in y.tab.c 9571 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 552 { $$ = (Node *)NULL; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18188 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 466 { if ($3 != (Node *)NULL) 469 $$ = $1; in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9571 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9620 in y.tab.c 9621 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9631 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 9641 in y.tab.c 9645 in y.tab.c 461 stmtblock: stmtmulti { parsetree = $1; } in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18172 in y.tab.c 18177 in y.tab.c 18184 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18186 in y.tab.c 18187 in y.tab.c 18190 in y.tab.c 9471 in y.tab.c 9474 in y.tab.c 9476 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9556 in y.tab.c 9557 in y.tab.c 9563 in y.tab.c 9569 in y.tab.c 9571 in y.tab.c 9582 in y.tab.c 9583 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9585 in y.tab.c 9586 in y.tab.c 9594 in y.tab.c 18349 in y.tab.c 18375 in y.tab.c raw_parser ( str=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at parser.c:57 57 scanner_finish(); scanner_finish () at scan.l:651 651 yy_delete_buffer(scanbufhandle); base_yy_delete_buffer (b=0x9a6eb58) at scan.c:5091 5091 if ( ! b ) 5094 if ( b == yy_current_buffer ) 5095 yy_current_buffer = (YY_BUFFER_STATE) 0; 5097 if ( b->yy_is_our_buffer ) 5101 } 5100 yy_flex_free( (void *) b ); 5101 } base_yy_delete_buffer (b=0x9a6eb58) at scan.c:5100 5100 yy_flex_free( (void *) b ); yy_flex_free (ptr=0x9a6eb58) at scan.c:5415 5415 { 5416 free( ptr ); scanner_finish () at scan.l:652 652 pfree(scanbuf); pfree (pointer=0x9a6eb58) at mcxt.c:544 544 { 563 (*header->context->methods->free_p) (header->context, pointer); AllocSetFree (context=0x9a8cd38, pointer=0x9aa7858) at aset.c:753 753 { 755 AllocChunk chunk = AllocPointerGetChunk(pointer); 753 { 767 if (chunk->size > ALLOC_CHUNK_LIMIT) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 805 chunk->aset = (void *) set->freelist[fidx]; 816 set->freelist[fidx] = chunk; 818 } 0x081c03c0 in pfree (pointer=0x0) at mcxt.c:563 563 (*header->context->methods->free_p) (header->context, pointer); 0x080bc94d in scanner_finish () at scan.l:652 652 pfree(scanbuf); raw_parser ( str=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at parser.c:59 59 if (yyresult) /* error */ 60 return NIL; 59 if (yyresult) /* error */ 62 return parsetree; 63 } pg_parse_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:525 525 if (log_parser_stats) 523 raw_parsetree_list = raw_parser(query_string); 525 if (log_parser_stats) 529 } exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:796 796 MemoryContextSwitchTo(oldcontext); MemoryContextSwitchTo (context=0x2) at mcxt.c:611 611 CurrentMemoryContext = context; 610 old = CurrentMemoryContext; 611 CurrentMemoryContext = context; 613 } exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:801 801 foreach(parsetree_item, parsetree_list) 803 Node *parsetree = (Node *) lfirst(parsetree_item); 818 commandTag = CreateCommandTag(parsetree); 803 Node *parsetree = (Node *) lfirst(parsetree_item); 818 commandTag = CreateCommandTag(parsetree); CreateCommandTag (parsetree=0x9aa7a78) at utility.c:1174 1174 switch (nodeTag(parsetree)) 1189 tag = "SELECT"; 1569 } exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:820 820 set_ps_display(commandTag); set_ps_display (activity=0x8215bae "SELECT") at ps_status.c:239 239 if (!IsUnderPostmaster) 244 if (!ps_buffer) 249 StrNCpy(ps_buffer + ps_buffer_fixed_size, activity, 277 buflen = strlen(ps_buffer); 278 MemSet(ps_buffer + buflen, PS_PADDING, ps_buffer_size - buflen); 282 } exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:822 822 BeginCommand(commandTag, dest); BeginCommand (commandTag=0x8215bae "SELECT", dest=Remote) at dest.c:88 88 { exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:832 832 if (IsAbortedTransactionBlockState() && IsAbortedTransactionBlockState () at xact.c:311 311 { 315 return true; 311 { 315 return true; 318 } exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:840 840 start_xact_command(); start_xact_command () at postgres.c:1786 1786 if (!xact_started) 1798 } exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:843 843 CHECK_FOR_INTERRUPTS(); 851 oldcontext = MemoryContextSwitchTo(MessageContext); MemoryContextSwitchTo (context=0x3) at mcxt.c:611 611 CurrentMemoryContext = context; 610 old = CurrentMemoryContext; 611 CurrentMemoryContext = context; 613 } exec_simple_query ( query_string=0x9aa7648 "select pcm_getmiles_s('sparta, nc', 'buffalo, ny', 0);") at postgres.c:853 853 querytree_list = pg_analyze_and_rewrite(parsetree, NULL, 0); 851 oldcontext = MemoryContextSwitchTo(MessageContext); 853 querytree_list = pg_analyze_and_rewrite(parsetree, NULL, 0); pg_analyze_and_rewrite (parsetree=0x9aa7a78, paramTypes=0x0, numParams=0) at postgres.c:548 548 if (log_parser_stats) 542 { 548 if (log_parser_stats) 551 querytree_list = parse_analyze(parsetree, paramTypes, numParams); parse_analyze (parseTree=0x9aa7a78, paramTypes=0x9a8cdc0, numParams=162057664) at analyze.c:156 156 ParseState *pstate = make_parsestate(NULL); make_parsestate (parentParseState=0x0) at parse_node.c:39 39 pstate = palloc0(sizeof(ParseState)); 36 { 39 pstate = palloc0(sizeof(ParseState)); MemoryContextAllocZero (context=0x9a8cd38, size=52) at mcxt.c:497 497 { 502 if (!AllocSizeIsValid(size)) 497 { 502 if (!AllocSizeIsValid(size)) 506 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=52) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 546 if (chunk->size >= size) 555 if (chunk != NULL) 557 if (priorfree == NULL) 558 set->freelist[fidx] = (AllocChunk) chunk->aset; 562 chunk->aset = (void *) set; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZero (context=0x9a8cd38, size=52) at mcxt.c:508 508 MemSetAligned(ret, 0, size); 506 ret = (*context->methods->alloc) (context, size); 508 MemSetAligned(ret, 0, size); 511 } make_parsestate (parentParseState=0x0) at parse_node.c:46 46 if (parentParseState) 39 pstate = palloc0(sizeof(ParseState)); 41 pstate->parentParseState = parentParseState; 44 pstate->p_next_resno = 1; 46 if (parentParseState) 50 } parse_analyze (parseTree=0x9aa7a78, paramTypes=0x9aa7858, numParams=162166872) at analyze.c:159 159 pstate->p_paramtypes = paramTypes; 160 pstate->p_numparams = numParams; 161 pstate->p_variableparams = false; 163 result = do_parse_analyze(parseTree, pstate); do_parse_analyze (parseTree=0x9aa7a78, pstate=0x9aa7858) at analyze.c:230 230 { 239 query = transformStmt(pstate, parseTree, &extras_before, &extras_after); 234 List *extras_before = NIL; 235 List *extras_after = NIL; 239 query = transformStmt(pstate, parseTree, &extras_before, &extras_after); transformStmt (pstate=0x9aa7858, parseTree=0x9aa7a78, extras_before=0xbffe1414, extras_after=0xbffe1418) at analyze.c:302 302 { 305 switch (nodeTag(parseTree)) 302 { 305 switch (nodeTag(parseTree)) 414 if (((SelectStmt *) parseTree)->op == SETOP_NONE) 1987 Query *qry = makeNode(Query); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=108) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=108) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=108) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } transformStmt (pstate=0x9aa7858, parseTree=0x9aa7a78, extras_before=0xbffe1414, extras_after=0xbffe1418) at analyze.c:1990 1990 qry->commandType = CMD_SELECT; 1993 pstate->p_forUpdate = stmt->forUpdate; 1996 transformFromClause(pstate, stmt->fromClause); transformFromClause (pstate=0x9aa7858, frmList=0x0) at parse_clause.c:81 81 { 90 foreach(fl, frmList) 0x080beda4 90 foreach(fl, frmList) transformStmt (pstate=0x9aa7858, parseTree=0x9aa7a78, extras_before=0xbffe1414, extras_after=0xbffe1418) at analyze.c:1999 1999 qry->targetList = transformTargetList(pstate, stmt->targetList); transformTargetList (pstate=0x9aa7858, targetlist=0x9aa7a60) at parse_target.c:108 108 foreach(o_target, targetlist) 106 FastListInit(&p_target); 110 ResTarget *res = (ResTarget *) lfirst(o_target); 112 if (IsA(res->val, ColumnRef)) 201 FastAppend(&p_target, transformTargetEntry (pstate=0x9aa7858, node=0x9aa7a30, expr=0x0, colname=0x0, resjunk=0 '\0') at parse_target.c:54 54 { 60 if (expr == NULL) 54 { 60 if (expr == NULL) 61 expr = transformExpr(pstate, node); transformExpr (pstate=0x9aa7858, expr=0x9aa7a30) at parse_expr.c:93 93 if (expr == NULL) 91 Node *result = NULL; 94 return NULL; 93 if (expr == NULL) 103 if (++expr_depth_counter > max_expr_depth) 111 switch (nodeTag(expr)) 438 targs = listCopy(fn->args); listCopy (list=0x9aa79a0) at copyfuncs.c:84 84 { 92 return NIL; 91 if (list == NIL) 94 newcell = makeNode(List); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } listCopy (list=0x9aa79a0) at copyfuncs.c:95 95 newcell->elem = list->elem; 97 newlist = prev = newcell; 99 foreach(oldl, lnext(list)) 95 newcell->elem = list->elem; 101 newcell = makeNode(List); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } listCopy (list=0x9aa79a0) at copyfuncs.c:102 102 newcell->elem = oldl->elem; 103 prev->next = newcell; 102 newcell->elem = oldl->elem; 104 prev = newcell; 99 foreach(oldl, lnext(list)) 101 newcell = makeNode(List); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } listCopy (list=0x9aa79a0) at copyfuncs.c:102 102 newcell->elem = oldl->elem; 103 prev->next = newcell; 102 newcell->elem = oldl->elem; 104 prev = newcell; 99 foreach(oldl, lnext(list)) 106 prev->next = NIL; 108 return newlist; 109 } transformExpr (pstate=0x9aa7858, expr=0x9aa7a30) at parse_expr.c:439 439 foreach(args, targs) 441 lfirst(args) = transformExpr(pstate, transformExpr (pstate=0x9aa7858, expr=0x9aa7988) at parse_expr.c:93 93 if (expr == NULL) 91 Node *result = NULL; 94 return NULL; 93 if (expr == NULL) 103 if (++expr_depth_counter > max_expr_depth) 111 switch (nodeTag(expr)) 189 Value *val = &con->val; 191 result = (Node *) make_const(val); 189 Value *val = &con->val; 191 result = (Node *) make_const(val); make_const (value=0x9aa798c) at parse_node.c:273 273 { 281 switch (nodeTag(value)) 315 val = DirectFunctionCall1(unknownin, DirectFunctionCall1 (func=0x81989e8 , arg1=162167152) at fmgr.c:726 726 fcinfo.arg[0] = arg1; 729 result = (*func) (&fcinfo); 715 { 720 fcinfo.flinfo = NULL; 721 fcinfo.context = NULL; 722 fcinfo.resultinfo = NULL; 723 fcinfo.isnull = false; 725 fcinfo.nargs = 1; 727 fcinfo.argnull[0] = false; 729 result = (*func) (&fcinfo); unknownin (fcinfo=0xbffe1010) at varlena.c:330 330 char *inputStr = PG_GETARG_CSTRING(0); 334 len = strlen(inputStr) + VARHDRSZ; 336 result = (unknown *) palloc(len); 334 len = strlen(inputStr) + VARHDRSZ; 336 result = (unknown *) palloc(len); 334 len = strlen(inputStr) + VARHDRSZ; 336 result = (unknown *) palloc(len); MemoryContextAlloc (context=0x9a8cd38, size=14) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0xbffe1010, size=134670608) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=14) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } unknownin (fcinfo=0x9aa7be8) at varlena.c:337 337 VARATT_SIZEP(result) = len; 339 memcpy(VARDATA(result), inputStr, len - VARHDRSZ); 336 result = (unknown *) palloc(len); 339 memcpy(VARDATA(result), inputStr, len - VARHDRSZ); 342 } DirectFunctionCall1 (func=0x81989e8 , arg1=162167152) at fmgr.c:732 732 if (fcinfo.isnull) 729 result = (*func) (&fcinfo); 732 if (fcinfo.isnull) 736 } make_const (value=0x9aa798c) at parse_node.c:318 318 typeid = UNKNOWNOID; /* will be coerced later */ 329 typelen = -1; 330 typebyval = false; 331 break; 347 con = makeConst(typeid, makeConst (consttype=162167784, constlen=162167784, constvalue=162167784, constisnull=0 '\0', constbyval=0 '\0') at makefuncs.c:144 144 Const *cnst = makeNode(Const); 143 { 144 Const *cnst = makeNode(Const); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=20) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=20) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=20) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } makeConst (consttype=162167828, constlen=162167828, constvalue=162167828, constisnull=0 '\0', constbyval=0 '\0') at makefuncs.c:146 146 cnst->consttype = consttype; 147 cnst->constlen = constlen; 148 cnst->constvalue = constvalue; 150 cnst->constbyval = constbyval; 149 cnst->constisnull = constisnull; 150 cnst->constbyval = constbyval; 153 } make_const (value=0x9aa798c) at parse_node.c:354 354 } transformExpr (pstate=0x9aa7858, expr=0x9aa7988) at parse_expr.c:192 192 if (con->typename != NULL) 191 result = (Node *) make_const(val); 192 if (con->typename != NULL) 933 expr_depth_counter--; 936 } 935 return result; 936 } 439 foreach(args, targs) 441 lfirst(args) = transformExpr(pstate, transformExpr (pstate=0x9aa7858, expr=0x9aa79d0) at parse_expr.c:93 93 if (expr == NULL) 91 Node *result = NULL; 94 return NULL; 93 if (expr == NULL) 103 if (++expr_depth_counter > max_expr_depth) 111 switch (nodeTag(expr)) 189 Value *val = &con->val; 191 result = (Node *) make_const(val); 189 Value *val = &con->val; 191 result = (Node *) make_const(val); make_const (value=0x9aa79d4) at parse_node.c:273 273 { 281 switch (nodeTag(value)) 315 val = DirectFunctionCall1(unknownin, DirectFunctionCall1 (func=0x81989e8 , arg1=162167224) at fmgr.c:726 726 fcinfo.arg[0] = arg1; 729 result = (*func) (&fcinfo); 715 { 720 fcinfo.flinfo = NULL; 721 fcinfo.context = NULL; 722 fcinfo.resultinfo = NULL; 723 fcinfo.isnull = false; 725 fcinfo.nargs = 1; 727 fcinfo.argnull[0] = false; 729 result = (*func) (&fcinfo); unknownin (fcinfo=0xbffe1010) at varlena.c:330 330 char *inputStr = PG_GETARG_CSTRING(0); 334 len = strlen(inputStr) + VARHDRSZ; 336 result = (unknown *) palloc(len); 334 len = strlen(inputStr) + VARHDRSZ; 336 result = (unknown *) palloc(len); 334 len = strlen(inputStr) + VARHDRSZ; 336 result = (unknown *) palloc(len); MemoryContextAlloc (context=0x9a8cd38, size=15) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0xbffe1010, size=134670608) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=15) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } unknownin (fcinfo=0x9aa7c28) at varlena.c:337 337 VARATT_SIZEP(result) = len; 339 memcpy(VARDATA(result), inputStr, len - VARHDRSZ); 336 result = (unknown *) palloc(len); 339 memcpy(VARDATA(result), inputStr, len - VARHDRSZ); 342 } DirectFunctionCall1 (func=0x81989e8 , arg1=162167224) at fmgr.c:732 732 if (fcinfo.isnull) 729 result = (*func) (&fcinfo); 732 if (fcinfo.isnull) 736 } make_const (value=0x9aa79d4) at parse_node.c:318 318 typeid = UNKNOWNOID; /* will be coerced later */ 329 typelen = -1; 330 typebyval = false; 331 break; 347 con = makeConst(typeid, makeConst (consttype=162167848, constlen=162167848, constvalue=162167848, constisnull=0 '\0', constbyval=0 '\0') at makefuncs.c:144 144 Const *cnst = makeNode(Const); 143 { 144 Const *cnst = makeNode(Const); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=20) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=20) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=20) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } makeConst (consttype=162167892, constlen=162167892, constvalue=162167892, constisnull=0 '\0', constbyval=0 '\0') at makefuncs.c:146 146 cnst->consttype = consttype; 147 cnst->constlen = constlen; 148 cnst->constvalue = constvalue; 150 cnst->constbyval = constbyval; 149 cnst->constisnull = constisnull; 150 cnst->constbyval = constbyval; 153 } make_const (value=0x9aa79d4) at parse_node.c:354 354 } transformExpr (pstate=0x9aa7858, expr=0x9aa79d0) at parse_expr.c:192 192 if (con->typename != NULL) 191 result = (Node *) make_const(val); 192 if (con->typename != NULL) 933 expr_depth_counter--; 936 } 935 return result; 936 } 439 foreach(args, targs) 441 lfirst(args) = transformExpr(pstate, transformExpr (pstate=0x9aa7858, expr=0x9aa7a00) at parse_expr.c:93 93 if (expr == NULL) 91 Node *result = NULL; 94 return NULL; 93 if (expr == NULL) 103 if (++expr_depth_counter > max_expr_depth) 111 switch (nodeTag(expr)) 189 Value *val = &con->val; 191 result = (Node *) make_const(val); 189 Value *val = &con->val; 191 result = (Node *) make_const(val); make_const (value=0x9aa7a04) at parse_node.c:273 273 { 281 switch (nodeTag(value)) 284 val = Int32GetDatum(intVal(value)); 287 typelen = sizeof(int32); 286 typeid = INT4OID; 288 typebyval = true; 347 con = makeConst(typeid, makeConst (consttype=0, constlen=0, constvalue=0, constisnull=0 '\0', constbyval=1 '\001') at makefuncs.c:144 144 Const *cnst = makeNode(Const); 143 { 144 Const *cnst = makeNode(Const); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=20) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=20) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=20) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } makeConst (consttype=162167932, constlen=162167932, constvalue=162167932, constisnull=0 '\0', constbyval=1 '\001') at makefuncs.c:146 146 cnst->consttype = consttype; 147 cnst->constlen = constlen; 148 cnst->constvalue = constvalue; 150 cnst->constbyval = constbyval; 149 cnst->constisnull = constisnull; 150 cnst->constbyval = constbyval; 153 } make_const (value=0x9aa7a04) at parse_node.c:354 354 } transformExpr (pstate=0x9aa7858, expr=0x9aa7a00) at parse_expr.c:192 192 if (con->typename != NULL) 191 result = (Node *) make_const(val); 192 if (con->typename != NULL) 933 expr_depth_counter--; 936 } 935 return result; 936 } 439 foreach(args, targs) 444 result = ParseFuncOrColumn(pstate, ParseFuncOrColumn (pstate=0x9aa7858, funcname=0x9aa7958, fargs=0x9aa7ba0, agg_star=0 '\0', agg_distinct=0 '\0', is_column=0 '\0') at parse_func.c:67 67 { 71 Node *first_arg = NULL; 72 int nargs = length(fargs); length (l=0x9aa7ba0) at list.c:329 329 { 330 int i = 0; 334 l = lnext(l); 335 i++; 334 l = lnext(l); 335 i++; 334 l = lnext(l); 335 i++; 338 } ParseFuncOrColumn (pstate=0x9aa7858, funcname=0x9aa7958, fargs=0x9aa7ba0, agg_star=0 '\0', agg_distinct=0 '\0', is_column=0 '\0') at parse_func.c:86 86 if (nargs > FUNC_MAX_ARGS) 72 int nargs = length(fargs); 86 if (nargs > FUNC_MAX_ARGS) 92 if (fargs) 94 first_arg = lfirst(fargs); 104 if (nargs == 1 && !agg_star && !agg_distinct && length(funcname) == 1) 138 MemSet(actual_arg_types, 0, FUNC_MAX_ARGS * sizeof(Oid)); 141 foreach(i, fargs) 140 argn = 0; 143 Node *arg = lfirst(i); 146 if (IsA(arg, RangeVar)) 231 toid = exprType(arg); exprType (expr=0x9aa7c00) at parse_expr.c:1166 1166 { 1170 return InvalidOid; 1169 if (!expr) 1172 switch (nodeTag(expr)) 1313 type = ((SetToDefault *) expr)->typeId; 1333 return type; 1334 } ParseFuncOrColumn (pstate=0x9aa7858, funcname=0x9aa7958, fargs=0x9aa7ba0, agg_star=0 '\0', agg_distinct=0 '\0', is_column=0 '\0') at parse_func.c:233 233 actual_arg_types[argn++] = toid; 141 foreach(i, fargs) 143 Node *arg = lfirst(i); 146 if (IsA(arg, RangeVar)) 231 toid = exprType(arg); exprType (expr=0x9aa7c40) at parse_expr.c:1166 1166 { 1170 return InvalidOid; 1169 if (!expr) 1172 switch (nodeTag(expr)) 1313 type = ((SetToDefault *) expr)->typeId; 1333 return type; 1334 } ParseFuncOrColumn (pstate=0x9aa7858, funcname=0x9aa7958, fargs=0x9aa7ba0, agg_star=0 '\0', agg_distinct=0 '\0', is_column=0 '\0') at parse_func.c:233 233 actual_arg_types[argn++] = toid; 141 foreach(i, fargs) 143 Node *arg = lfirst(i); 146 if (IsA(arg, RangeVar)) 231 toid = exprType(arg); exprType (expr=0x9aa7c68) at parse_expr.c:1166 1166 { 1170 return InvalidOid; 1169 if (!expr) 1172 switch (nodeTag(expr)) 1313 type = ((SetToDefault *) expr)->typeId; 1333 return type; 1334 } ParseFuncOrColumn (pstate=0x9aa7858, funcname=0x9aa7958, fargs=0x9aa7ba0, agg_star=0 '\0', agg_distinct=0 '\0', is_column=0 '\0') at parse_func.c:233 233 actual_arg_types[argn++] = toid; 141 foreach(i, fargs) 243 fdresult = func_get_detail(funcname, fargs, nargs, actual_arg_types, func_get_detail (funcname=0x9aa7958, fargs=0x9aa7ba0, nargs=3, argtypes=0xbffe10f0, funcid=0xbffe10d4, rettype=0xbffe10d8, retset=0xbffe10df "\b0Ü¥\tð\"¦\t\230wª\t\030\022", true_typeids=0xbffe10e0) at parse_func.c:786 786 raw_candidates = FuncnameGetCandidates(funcname, nargs); FuncnameGetCandidates (names=0x9aa7958, nargs=3) at namespace.c:485 485 DeconstructQualifiedName(names, &schemaname, &funcname); 477 FuncCandidateList resultList = NULL; 485 DeconstructQualifiedName(names, &schemaname, &funcname); DeconstructQualifiedName (names=0x9aa7958, nspname_p=0xbffe0e24, objname_p=0xbffe0e24) at namespace.c:1192 1192 { 1197 switch (length(names)) length (l=0x9aa7958) at list.c:329 329 { 330 int i = 0; 334 l = lnext(l); 335 i++; 338 } DeconstructQualifiedName (names=0x9aa7958, nspname_p=0x1, objname_p=0x1) at namespace.c:1194 1194 char *schemaname = NULL; 1195 char *objname = NULL; 1197 switch (length(names)) 1200 objname = strVal(lfirst(names)); 1204 objname = strVal(lsecond(names)); 1227 *nspname_p = schemaname; 1228 *objname_p = objname; FuncnameGetCandidates (names=0x9aa7958, nargs=3) at namespace.c:487 487 if (schemaname) 495 namespaceId = InvalidOid; 496 recomputeNamespacePath(); recomputeNamespacePath () at namespace.c:1556 1556 AclId userId = GetUserId(); GetUserId () at miscinit.c:253 253 return CurrentUserId; 254 } recomputeNamespacePath () at namespace.c:1569 1569 if (namespaceSearchPathValid && namespaceUser == userId) 1556 AclId userId = GetUserId(); 1569 if (namespaceSearchPathValid && namespaceUser == userId) 1573 rawname = pstrdup(namespace_search_path); MemoryContextStrdup (context=0x9a8cd38, string=0x9a5cf98 "$user,public") at mcxt.c:623 623 Size len = strlen(string) + 1; 625 nstr = (char *) MemoryContextAlloc(context, len); MemoryContextAlloc (context=0x9a8cd38, size=13) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a8cd38, size=161861528) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=13) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextStrdup (context=0x9a8cd38, string=) at mcxt.c:627 627 memcpy(nstr, string, len); 625 nstr = (char *) MemoryContextAlloc(context, len); 627 memcpy(nstr, string, len); 630 } recomputeNamespacePath () at namespace.c:1576 1576 if (!SplitIdentifierString(rawname, ',', &namelist)) SplitIdentifierString (rawstring=0x9aa7c90 "$user,public", separator=44 ',', namelist=0xbffe0dd8) at varlena.c:1686 1686 { 1690 *namelist = NIL; 1686 { 1687 char *nextp = rawstring; 1688 bool done = false; 1690 *namelist = NIL; 1695 if (*nextp == '\0') 1696 return true; /* allow empty string */ 1695 if (*nextp == '\0') 1704 if (*nextp == '\"') 1728 curname = nextp; 1704 if (*nextp == '\"') 1733 if (curname == nextp) 1732 endp = nextp; 1733 if (curname == nextp) 1744 len = endp - curname; 1745 downname = downcase_truncate_identifier(curname, len, false); 1744 len = endp - curname; 1745 downname = downcase_truncate_identifier(curname, len, false); downcase_truncate_identifier (ident=0x9aa7c90 "$user,public", len=5, warn=0 '\0') at scansup.c:131 131 { 135 result = palloc(len + 1); 145 for (i = 0; i < len; i++) 135 result = palloc(len + 1); MemoryContextAlloc (context=0x9a8cd38, size=6) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9aa7c90, size=5) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=6) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } downcase_truncate_identifier (ident=0x9aa7c90 "$user,public", len=5, warn=0 '\0') at scansup.c:145 145 for (i = 0; i < len; i++) 135 result = palloc(len + 1); 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 157 if (i >= NAMEDATALEN) 155 result[i] = '\0'; 157 if (i >= NAMEDATALEN) 161 } SplitIdentifierString (rawstring=0x9aa7c90 "$user,public", separator=44 ',', namelist=0xbffe0dd8) at varlena.c:1747 1747 strncpy(curname, downname, len); 1745 downname = downcase_truncate_identifier(curname, len, false); 1747 strncpy(curname, downname, len); 1748 pfree(downname); pfree (pointer=0x9aa7c90) at mcxt.c:544 544 { 563 (*header->context->methods->free_p) (header->context, pointer); AllocSetFree (context=0x9a8cd38, pointer=0x9aa7ca8) at aset.c:753 753 { 755 AllocChunk chunk = AllocPointerGetChunk(pointer); 753 { 767 if (chunk->size > ALLOC_CHUNK_LIMIT) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 805 chunk->aset = (void *) set->freelist[fidx]; 816 set->freelist[fidx] = chunk; 818 } 0x081c03c0 in pfree (pointer=0x0) at mcxt.c:563 563 (*header->context->methods->free_p) (header->context, pointer); SplitIdentifierString (rawstring=0x9aa7c90 "$user,public", separator=44 ',', namelist=0xbffe0dd8) at varlena.c:1754 1754 if (*nextp == separator) 1756 nextp++; 1767 *endp = '\0'; 1770 truncate_identifier(curname, strlen(curname), false); truncate_identifier (ident=0x9aa7c90 "$user", len=5, warn=0 '\0') at scansup.c:174 174 { 175 if (len >= NAMEDATALEN) 174 { 175 if (len >= NAMEDATALEN) 185 } SplitIdentifierString (rawstring=0x9aa7c90 "$user", separator=44 ',', namelist=0xbffe0dd8) at varlena.c:1775 1775 *namelist = lappend(*namelist, curname); lappend (list=0x9aa7c90, datum=0x9aa7c90) at list.c:145 145 { 146 return nconc(list, makeList1(datum)); lcons (obj=0x9aa7c95, list=0x9aa7c95) at list.c:99 99 List *l = makeNode(List); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 546 if (chunk->size >= size) 555 if (chunk != NULL) 557 if (priorfree == NULL) 558 set->freelist[fidx] = (AllocChunk) chunk->aset; 562 chunk->aset = (void *) set; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } lcons (obj=0x9aa7cb4, list=0x9aa7cb4) at list.c:101 101 lfirst(l) = obj; 102 lnext(l) = list; 104 } lappend (list=0x0, datum=0x9aa7ca8) at list.c:147 147 } lappend (list=0x9aa7c90, datum=0x2c) at list.c:146 146 return nconc(list, makeList1(datum)); nconc (l1=0x0, l2=0x9aa7ca8) at list.c:181 181 { 184 if (l1 == NIL) 185 return l2; 184 if (l1 == NIL) 196 } SplitIdentifierString (rawstring=0x9aa7c90 "$user", separator=44 ',', namelist=0xbffe0dd8) at varlena.c:1778 1778 } while (!done); 1704 if (*nextp == '\"') 1728 curname = nextp; 1704 if (*nextp == '\"') 1733 if (curname == nextp) 1732 endp = nextp; 1733 if (curname == nextp) 1744 len = endp - curname; 1745 downname = downcase_truncate_identifier(curname, len, false); 1744 len = endp - curname; 1745 downname = downcase_truncate_identifier(curname, len, false); downcase_truncate_identifier (ident=0x9aa7c96 "public", len=6, warn=0 '\0') at scansup.c:131 131 { 135 result = palloc(len + 1); 145 for (i = 0; i < len; i++) 135 result = palloc(len + 1); MemoryContextAlloc (context=0x9a8cd38, size=7) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9aa7c96, size=6) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=7) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } downcase_truncate_identifier (ident=0x9aa7c96 "public", len=6, warn=0 '\0') at scansup.c:145 145 for (i = 0; i < len; i++) 135 result = palloc(len + 1); 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 147 unsigned char ch = (unsigned char) ident[i]; 149 if (ch >= 'A' && ch <= 'Z') 151 else if (ch >= 0x80 && isupper(ch)) 153 result[i] = (char) ch; 145 for (i = 0; i < len; i++) 157 if (i >= NAMEDATALEN) 155 result[i] = '\0'; 157 if (i >= NAMEDATALEN) 161 } SplitIdentifierString (rawstring=0x9aa7c90 "$user", separator=44 ',', namelist=0xbffe0dd8) at varlena.c:1747 1747 strncpy(curname, downname, len); 1745 downname = downcase_truncate_identifier(curname, len, false); 1747 strncpy(curname, downname, len); 1748 pfree(downname); pfree (pointer=0x9aa7c96) at mcxt.c:544 544 { 563 (*header->context->methods->free_p) (header->context, pointer); AllocSetFree (context=0x9a8cd38, pointer=0x9aa7cc0) at aset.c:753 753 { 755 AllocChunk chunk = AllocPointerGetChunk(pointer); 753 { 767 if (chunk->size > ALLOC_CHUNK_LIMIT) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 805 chunk->aset = (void *) set->freelist[fidx]; 816 set->freelist[fidx] = chunk; 818 } 0x081c03c0 in pfree (pointer=0x0) at mcxt.c:563 563 (*header->context->methods->free_p) (header->context, pointer); SplitIdentifierString (rawstring=0x9aa7c90 "$user", separator=44 ',', namelist=0xbffe0dd8) at varlena.c:1754 1754 if (*nextp == separator) 1761 else if (*nextp == '\0') 1762 done = true; 1767 *endp = '\0'; 1770 truncate_identifier(curname, strlen(curname), false); truncate_identifier (ident=0x9aa7c96 "public", len=6, warn=0 '\0') at scansup.c:174 174 { 175 if (len >= NAMEDATALEN) 174 { 175 if (len >= NAMEDATALEN) 185 } SplitIdentifierString (rawstring=0x9aa7c90 "$user", separator=44 ',', namelist=0xbffe0dd8) at varlena.c:1775 1775 *namelist = lappend(*namelist, curname); lappend (list=0x9aa7c96, datum=0x9aa7c96) at list.c:145 145 { 146 return nconc(list, makeList1(datum)); lcons (obj=0x9aa7c9c, list=0x9aa7c9c) at list.c:99 99 List *l = makeNode(List); MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:522 522 { 527 if (!AllocSizeIsValid(size)) 522 { 527 if (!AllocSizeIsValid(size)) 531 ret = (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=12) at aset.c:491 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 546 if (chunk->size >= size) 555 if (chunk != NULL) 557 if (priorfree == NULL) 558 set->freelist[fidx] = (AllocChunk) chunk->aset; 562 chunk->aset = (void *) set; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextAllocZeroAligned (context=0x9a8cd38, size=12) at mcxt.c:533 533 MemSetLoop(ret, 0, size); 536 } lcons (obj=0x9aa7ccc, list=0x9aa7ccc) at list.c:101 101 lfirst(l) = obj; 102 lnext(l) = list; 104 } lappend (list=0x9aa7ca8, datum=0x9aa7cc0) at list.c:147 147 } lappend (list=0x9aa7c96, datum=0x2c) at list.c:146 146 return nconc(list, makeList1(datum)); nconc (l1=0x9aa7ca8, l2=0x9aa7cc0) at list.c:181 181 { 184 if (l1 == NIL) 185 return l2; 184 if (l1 == NIL) 186 if (l2 == NIL) 187 return l1; 186 if (l2 == NIL) 188 if (l1 == l2) 191 for (temp = l1; lnext(temp) != NIL; temp = lnext(temp)) 194 lnext(temp) = l2; 195 return l1; /* list1 is now list1+list2 */ 196 } SplitIdentifierString (rawstring=0x9aa7c90 "$user", separator=44 ',', namelist=0xbffe0dd8) at varlena.c:1778 1778 } while (!done); 1780 return true; 1781 } recomputeNamespacePath () at namespace.c:1591 1591 foreach(l, namelist) 1589 oidlist = NIL; 1590 temp_missing = false; 1591 foreach(l, namelist) 1593 char *curname = (char *) lfirst(l); 1596 if (strcmp(curname, "$user") == 0) 1601 tuple = SearchSysCache(SHADOWSYSID, SearchSysCache (cacheId=30, key1=213, key2=0, key3=0, key4=0) at syscache.c:523 523 { 524 if (cacheId < 0 || cacheId >= SysCacheSize || 523 { 524 if (cacheId < 0 || cacheId >= SysCacheSize || 528 return SearchCatCache(SysCache[cacheId], key1, key2, key3, key4); 529 } SearchSysCache (cacheId=0, key1=162167976, key2=213, key3=12458510, key4=134659178) at syscache.c:528 528 return SearchCatCache(SysCache[cacheId], key1, key2, key3, key4); SearchCatCache (cache=0xb73050c8, v1=213, v2=0, v3=0, v4=0) at catcache.c:1080 1080 { 1093 if (cache->cc_tupdesc == NULL) 1094 CatalogCacheInitializeCache(cache); CatalogCacheInitializeCache (cache=0xb73050c8) at catcache.c:902 902 relation = heap_openr(cache->cc_relname, NoLock); 890 { 902 relation = heap_openr(cache->cc_relname, NoLock); heap_openr (sysRelationName=0x81cfa49 "pg_shadow", lockmode=0) at heapam.c:645 645 r = relation_openr(sysRelationName, lockmode); relation_openr (sysRelationName=0x81cfa49 "pg_shadow", lockmode=0) at heapam.c:518 518 { 529 r = RelationSysNameGetRelation(sysRelationName); RelationSysNameGetRelation (relationName=0x81cfa49 "pg_shadow") at relcache.c:1541 1541 namestrcpy(&name, relationName); namestrcpy (name=0xbffe0bf0, str=0x81cfa49 "pg_shadow") at name.c:274 274 if (!name || !str) 273 { 274 if (!name || !str) 276 StrNCpy(NameStr(*name), str, NAMEDATALEN); 277 return 0; 278 } RelationSysNameGetRelation (relationName=0x81cfa49 "pg_shadow") at relcache.c:1542 1542 RelationSysNameCacheLookup(NameStr(name), rd); hash_search (hashp=0x9a692d0, keyPtr=0xbffe0bf0, action=HASH_FIND, foundPtr=0x0) at dynahash.c:515 515 HASHHDR *hctl = hashp->hctl; 538 if (action == HASH_REMOVE_SAVED) 515 HASHHDR *hctl = hashp->hctl; 516 uint32 hashvalue = 0; 538 if (action == HASH_REMOVE_SAVED) 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); string_hash (key=0xbffe0bf0, keysize=64) at hashfn.c:29 29 { 30 return DatumGetUInt32(hash_any((const unsigned char *) key, 32 } string_hash (key=) at hashfn.c:30 30 return DatumGetUInt32(hash_any((const unsigned char *) key, hash_any (k=0xbffe0bf0 "pg_shadow", keylen=9) at hashfunc.c:201 201 { 208 len = keylen; 201 { 209 a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */ 210 c = 3923095; /* initialize with an arbitrary value */ 220 len -= 12; 208 len = keylen; 224 c += keylen; 225 switch (len) /* all the case statements fall through */ 232 c += ((uint32) k[8] << 8); 235 b += ((uint32) k[7] << 24); 237 b += ((uint32) k[6] << 16); 239 b += ((uint32) k[5] << 8); 241 b += k[4]; 243 a += ((uint32) k[3] << 24); 245 a += ((uint32) k[2] << 16); 247 a += ((uint32) k[1] << 8); 249 a += k[0]; 252 mix(a, b, c); 255 } 252 mix(a, b, c); 255 } hash_search (hashp=0x9a692d0, keyPtr=0xbffe0bf0, action=HASH_FIND, foundPtr=0x0) at dynahash.c:478 478 bucket = hash_val & hctl->high_mask; 475 { 479 if (bucket > hctl->max_bucket) 558 segment_ndx = MOD(bucket, hctl->ssize); 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 562 if (segp == NULL) 571 match = hashp->match; /* save one fetch in inner loop */ 565 prevBucketPtr = &segp[segment_ndx]; 571 match = hashp->match; /* save one fetch in inner loop */ 566 currBucket = *prevBucketPtr; 571 match = hashp->match; /* save one fetch in inner loop */ 578 currBucket = *prevBucketPtr; 574 if (currBucket->hashvalue == hashvalue && 586 if (foundPtr) 592 switch (action) 597 return NULL; 595 if (currBucket != NULL) 634 return (void *) ELEMENTKEY(currBucket); 676 } RelationSysNameGetRelation (relationName=0x81cfa49 "pg_shadow") at relcache.c:1544 1544 if (RelationIsValid(rd)) 1546 RelationIncrementReferenceCount(rd); 1548 if (rd->rd_isnailed == 2) 1639 } 1628 return rd; 1639 } relation_openr (sysRelationName=0x81cfa49 "pg_shadow", lockmode=0) at heapam.c:531 531 if (!RelationIsValid(r)) 529 r = RelationSysNameGetRelation(sysRelationName); 531 if (!RelationIsValid(r)) 534 if (lockmode != NoLock) 538 } heap_openr (sysRelationName=0x81cfa49 "pg_shadow", lockmode=0) at heapam.c:647 647 if (r->rd_rel->relkind == RELKIND_INDEX) 652 else if (r->rd_rel->relkind == RELKIND_SPECIAL) 657 else if (r->rd_rel->relkind == RELKIND_COMPOSITE_TYPE) 663 pgstat_initstats(&r->pgstat_info, r); pgstat_initstats (stats=0x9a83e00, rel=0x9a83d98) at pgstat.c:919 919 Oid rel_id = rel->rd_id; 928 stats->tabentry = NULL; 929 stats->no_stats = FALSE; 930 stats->heap_scan_counted = FALSE; 931 stats->index_scan_counted = FALSE; 933 if (pgStatSock < 0 || 979 stats->no_stats = TRUE; 995 } heap_openr (sysRelationName=0x81cfa49 "pg_shadow", lockmode=0) at heapam.c:666 666 } CatalogCacheInitializeCache (cache=0xb73050c8) at catcache.c:911 911 oldcxt = MemoryContextSwitchTo(CacheMemoryContext); MemoryContextSwitchTo (context=0x9a83e00) at mcxt.c:611 611 CurrentMemoryContext = context; 610 old = CurrentMemoryContext; 611 CurrentMemoryContext = context; 613 } CatalogCacheInitializeCache (cache=0xb73050c8) at catcache.c:916 916 tupdesc = CreateTupleDescCopyConstr(RelationGetDescr(relation)); CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:147 147 TupleConstr *constr = tupdesc->constr; 151 desc = (TupleDesc) palloc(sizeof(struct tupleDesc)); MemoryContextAlloc (context=0x9a71f30, size=16) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83ea8, size=0) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a71f30, size=16) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:152 152 desc->natts = tupdesc->natts; 153 if (desc->natts > 0) 152 desc->natts = tupdesc->natts; 153 if (desc->natts > 0) 156 desc->attrs = (Form_pg_attribute *) palloc(size); 155 size = desc->natts * sizeof(Form_pg_attribute); 156 desc->attrs = (Form_pg_attribute *) palloc(size); MemoryContextAlloc (context=0x9a71f30, size=32) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83ea8, size=0) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a71f30, size=32) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:157 157 for (i = 0; i < desc->natts; i++) 156 desc->attrs = (Form_pg_attribute *) palloc(size); 157 for (i = 0; i < desc->natts; i++) 159 desc->attrs[i] = (Form_pg_attribute) palloc(ATTRIBUTE_TUPLE_SIZE); MemoryContextAlloc (context=0x9a71f30, size=104) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83ea8, size=0) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a71f30, size=104) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:160 160 memcpy(desc->attrs[i], tupdesc->attrs[i], ATTRIBUTE_TUPLE_SIZE); 157 for (i = 0; i < desc->natts; i++) 159 desc->attrs[i] = (Form_pg_attribute) palloc(ATTRIBUTE_TUPLE_SIZE); MemoryContextAlloc (context=0x9a71f30, size=104) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83ea8, size=0) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a71f30, size=104) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:160 160 memcpy(desc->attrs[i], tupdesc->attrs[i], ATTRIBUTE_TUPLE_SIZE); 157 for (i = 0; i < desc->natts; i++) 159 desc->attrs[i] = (Form_pg_attribute) palloc(ATTRIBUTE_TUPLE_SIZE); MemoryContextAlloc (context=0x9a71f30, size=104) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83ea8, size=0) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a71f30, size=104) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:160 160 memcpy(desc->attrs[i], tupdesc->attrs[i], ATTRIBUTE_TUPLE_SIZE); 157 for (i = 0; i < desc->natts; i++) 159 desc->attrs[i] = (Form_pg_attribute) palloc(ATTRIBUTE_TUPLE_SIZE); MemoryContextAlloc (context=0x9a71f30, size=104) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83ea8, size=0) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a71f30, size=104) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:160 160 memcpy(desc->attrs[i], tupdesc->attrs[i], ATTRIBUTE_TUPLE_SIZE); 157 for (i = 0; i < desc->natts; i++) 159 desc->attrs[i] = (Form_pg_attribute) palloc(ATTRIBUTE_TUPLE_SIZE); MemoryContextAlloc (context=0x9a71f30, size=104) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83ea8, size=0) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a71f30, size=104) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:160 160 memcpy(desc->attrs[i], tupdesc->attrs[i], ATTRIBUTE_TUPLE_SIZE); 157 for (i = 0; i < desc->natts; i++) 159 desc->attrs[i] = (Form_pg_attribute) palloc(ATTRIBUTE_TUPLE_SIZE); MemoryContextAlloc (context=0x9a71f30, size=104) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83ea8, size=0) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a71f30, size=104) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:160 160 memcpy(desc->attrs[i], tupdesc->attrs[i], ATTRIBUTE_TUPLE_SIZE); 157 for (i = 0; i < desc->natts; i++) 159 desc->attrs[i] = (Form_pg_attribute) palloc(ATTRIBUTE_TUPLE_SIZE); MemoryContextAlloc (context=0x9a71f30, size=104) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83ea8, size=0) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a71f30, size=104) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:160 160 memcpy(desc->attrs[i], tupdesc->attrs[i], ATTRIBUTE_TUPLE_SIZE); 157 for (i = 0; i < desc->natts; i++) 159 desc->attrs[i] = (Form_pg_attribute) palloc(ATTRIBUTE_TUPLE_SIZE); MemoryContextAlloc (context=0x9a71f30, size=104) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83ea8, size=0) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a71f30, size=104) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:160 160 memcpy(desc->attrs[i], tupdesc->attrs[i], ATTRIBUTE_TUPLE_SIZE); 157 for (i = 0; i < desc->natts; i++) 165 if (constr) 167 TupleConstr *cpy = (TupleConstr *) palloc(sizeof(TupleConstr)); MemoryContextAlloc (context=0x9a71f30, size=16) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83ea8, size=0) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a71f30, size=16) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } CreateTupleDescCopyConstr (tupdesc=0x9a83ea8) at tupdesc.c:169 169 cpy->has_not_null = constr->has_not_null; 171 if ((cpy->num_defval = constr->num_defval) > 0) 182 if ((cpy->num_check = constr->num_check) > 0) 195 desc->constr = cpy; 200 desc->tdhasoid = tupdesc->tdhasoid; 202 } CatalogCacheInitializeCache (cache=0xb73050c8) at catcache.c:921 921 cache->cc_reloid = RelationGetRelid(relation); 922 cache->cc_relisshared = RelationGetForm(relation)->relisshared; 927 MemoryContextSwitchTo(oldcxt); MemoryContextSwitchTo (context=0xb73050c8) at mcxt.c:611 611 CurrentMemoryContext = context; 610 old = CurrentMemoryContext; 611 CurrentMemoryContext = context; 613 } CatalogCacheInitializeCache (cache=0xb73050c8) at catcache.c:929 929 heap_close(relation, NoLock); relation_close (relation=0x9a83d98, lockmode=0) at heapam.c:554 554 if (lockmode != NoLock) 551 { 554 if (lockmode != NoLock) 558 RelationClose(relation); RelationClose (relation=0x0) at relcache.c:1659 1659 { 1661 RelationDecrementReferenceCount(relation); CatalogCacheInitializeCache (cache=0xb73050c8) at catcache.c:937 937 for (i = 0; i < cache->cc_nkeys; ++i) 943 if (cache->cc_key[i] > 0) 944 keytype = tupdesc->attrs[cache->cc_key[i] - 1]->atttypid; 116 switch (keytype) 115 { 116 switch (keytype) 139 *hashfunc = hashint4; 140 *eqfunc = F_INT4EQ; 956 cache->cc_isname[i] = (keytype == NAMEOID); 962 fmgr_info_cxt(cache->cc_skey[i].sk_procedure, fmgr_info_cxt (functionId=3073397020, finfo=0xb73050c8, mcxt=0xb7305118) at fmgr.c:143 143 fmgr_info_cxt_security(functionId, finfo, mcxt, false); 142 { 143 fmgr_info_cxt_security(functionId, finfo, mcxt, false); fmgr_info_cxt_security (functionId=65, finfo=0xb730511c, mcxt=0x9a71f30, ignore_security=0 '\0') at fmgr.c:154 154 { 165 finfo->fn_oid = InvalidOid; 166 finfo->fn_extra = NULL; 167 finfo->fn_mcxt = mcxt; 78 int high = fmgr_nbuiltins - 1; 154 { 167 finfo->fn_mcxt = mcxt; 168 finfo->fn_expr = NULL; /* caller may set this later */ 77 int low = 0; 78 int high = fmgr_nbuiltins - 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 76 { 176 finfo->fn_nargs = fbp->nargs; 177 finfo->fn_strict = fbp->strict; 178 finfo->fn_retset = fbp->retset; 179 finfo->fn_addr = fbp->func; 180 finfo->fn_oid = functionId; 245 } CatalogCacheInitializeCache (cache=0xb73050c8) at catcache.c:967 967 cache->cc_skey[i].sk_attno = cache->cc_key[i]; 937 for (i = 0; i < cache->cc_nkeys; ++i) 978 cache->cc_tupdesc = tupdesc; SearchCatCache (cache=0xb73050c8, v1=213, v2=0, v3=0, v4=0) at catcache.c:1103 1103 memcpy(cur_skey, cache->cc_skey, sizeof(cur_skey)); 1104 cur_skey[0].sk_argument = v1; 1105 cur_skey[1].sk_argument = v2; 1106 cur_skey[2].sk_argument = v3; 1107 cur_skey[3].sk_argument = v4; 1112 hashValue = CatalogCacheComputeHashValue(cache, cache->cc_nkeys, cur_skey); 1107 cur_skey[3].sk_argument = v4; 1112 hashValue = CatalogCacheComputeHashValue(cache, cache->cc_nkeys, cur_skey); CatalogCacheComputeHashValue (cache=0xb73050c8, nkeys=1, cur_skey=0xbffe0cf0) at catcache.c:174 174 uint32 hashValue = 0; 181 switch (nkeys) 173 { 181 switch (nkeys) 199 hashValue ^= DirectFunctionCall1 (func=0x8077998 , arg1=213) at fmgr.c:726 726 fcinfo.arg[0] = arg1; 729 result = (*func) (&fcinfo); 715 { 720 fcinfo.flinfo = NULL; 721 fcinfo.context = NULL; 722 fcinfo.resultinfo = NULL; 723 fcinfo.isnull = false; 725 fcinfo.nargs = 1; 727 fcinfo.argnull[0] = false; 729 result = (*func) (&fcinfo); hashint4 (fcinfo=0xbffe0bd0) at hashfunc.c:41 41 PG_RETURN_UINT32(~PG_GETARG_UINT32(0)); 42 } DirectFunctionCall1 (func=0x8077998 , arg1=213) at fmgr.c:732 732 if (fcinfo.isnull) 729 result = (*func) (&fcinfo); 732 if (fcinfo.isnull) 736 } CatalogCacheComputeHashValue (cache=0xb73050c8, nkeys=1, cur_skey=0xbffe0cf0) at catcache.c:205 205 break; 209 } 199 hashValue ^= 209 } SearchCatCache (cache=) at catcache.c:1113 1113 hashIndex = HASH_INDEX(hashValue, cache->cc_nbuckets); 1118 for (elt = DLGetHead(&cache->cc_bucket[hashIndex]); 1198 relation = heap_open(cache->cc_reloid, AccessShareLock); heap_open (relationId=1260, lockmode=1) at heapam.c:575 575 r = relation_open(relationId, lockmode); relation_open (relationId=1260, lockmode=1) at heapam.c:450 450 { 456 r = RelationIdGetRelation(relationId); RelationIdGetRelation (relationId=1260) at relcache.c:1590 1590 { 1597 rd = RelationIdCacheGetRelation(relationId); RelationIdCacheGetRelation (relationId=1260) at relcache.c:1513 1513 RelationIdCacheLookup(relationId, rd); hash_search (hashp=0x9a69388, keyPtr=0xbffe0c40, action=HASH_FIND, foundPtr=0x0) at dynahash.c:515 515 HASHHDR *hctl = hashp->hctl; 538 if (action == HASH_REMOVE_SAVED) 515 HASHHDR *hctl = hashp->hctl; 516 uint32 hashvalue = 0; 538 if (action == HASH_REMOVE_SAVED) 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); tag_hash (key=0x9a69388, keysize=4) at hashfn.c:42 42 } tag_hash (key=0x9a69388, keysize=3221097536) at hashfn.c:40 40 return DatumGetUInt32(hash_any((const unsigned char *) key, hash_any (k=0xbffe0c40 "ì\004", keylen=4) at hashfunc.c:201 201 { 208 len = keylen; 201 { 209 a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */ 210 c = 3923095; /* initialize with an arbitrary value */ 220 len -= 12; 208 len = keylen; 224 c += keylen; 225 switch (len) /* all the case statements fall through */ 243 a += ((uint32) k[3] << 24); 245 a += ((uint32) k[2] << 16); 247 a += ((uint32) k[1] << 8); 249 a += k[0]; 252 mix(a, b, c); 255 } 252 mix(a, b, c); 255 } hash_search (hashp=0x9a69388, keyPtr=0xbffe0c40, action=HASH_FIND, foundPtr=0x0) at dynahash.c:478 478 bucket = hash_val & hctl->high_mask; 475 { 479 if (bucket > hctl->max_bucket) 480 bucket = bucket & hctl->low_mask; 558 segment_ndx = MOD(bucket, hctl->ssize); 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 562 if (segp == NULL) 571 match = hashp->match; /* save one fetch in inner loop */ 565 prevBucketPtr = &segp[segment_ndx]; 571 match = hashp->match; /* save one fetch in inner loop */ 566 currBucket = *prevBucketPtr; 571 match = hashp->match; /* save one fetch in inner loop */ 578 currBucket = *prevBucketPtr; 574 if (currBucket->hashvalue == hashvalue && 586 if (foundPtr) 592 switch (action) 597 return NULL; 595 if (currBucket != NULL) 634 return (void *) ELEMENTKEY(currBucket); 676 } RelationIdCacheGetRelation (relationId=1260) at relcache.c:1515 1515 if (RelationIsValid(rd)) 1517 RelationIncrementReferenceCount(rd); 1519 if (rd->rd_isnailed == 2) 1524 } RelationIdGetRelation (relationId=1260) at relcache.c:1598 1598 if (RelationIsValid(rd)) 1610 } relation_open (relationId=1260, lockmode=1) at heapam.c:458 458 if (!RelationIsValid(r)) 456 r = RelationIdGetRelation(relationId); 458 if (!RelationIsValid(r)) 461 if (lockmode != NoLock) 462 LockRelation(r, lockmode); LockRelation (relation=0x9a83d98, lockmode=1) at lmgr.c:130 130 MemSet(&tag, 0, sizeof(tag)); 127 { 130 MemSet(&tag, 0, sizeof(tag)); 131 tag.relId = relation->rd_lockInfo.lockRelId.relId; 132 tag.dbId = relation->rd_lockInfo.lockRelId.dbId; 135 if (!LockAcquire(LockTableId, &tag, GetCurrentTransactionId(), 132 tag.dbId = relation->rd_lockInfo.lockRelId.dbId; 133 tag.objId.blkno = InvalidBlockNumber; 135 if (!LockAcquire(LockTableId, &tag, GetCurrentTransactionId(), GetCurrentTransactionId () at xact.c:329 329 return s->transactionIdData; 330 } LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:434 434 { 453 locktag->lockmethod = lockmethod; 434 { 453 locktag->lockmethod = lockmethod; 456 lockMethodTable = LockMethodTable[lockmethod]; 457 if (!lockMethodTable) 456 lockMethodTable = LockMethodTable[lockmethod]; 457 if (!lockMethodTable) 463 masterLock = lockMethodTable->masterLock; 465 LWLockAcquire(masterLock, LW_EXCLUSIVE); 463 masterLock = lockMethodTable->masterLock; 465 LWLockAcquire(masterLock, LW_EXCLUSIVE); 471 lock = (LOCK *) hash_search(lockMethodTable->lockHash, 465 LWLockAcquire(masterLock, LW_EXCLUSIVE); LWLockAcquire (lockid=LockMgrLock, mode=LW_EXCLUSIVE) at lwlock.c:218 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 200 PGPROC *proc = MyProc; 199 volatile LWLock *lock = LWLockArray + lockid; 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 201 bool retry = false; 202 int extraWaits = 0; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 245 if (retry) 249 if (mode == LW_EXCLUSIVE) 251 if (lock->exclusive == 0 && lock->shared == 0) 253 lock->exclusive++; 325 SpinLockRelease_NoHoldoff(&lock->mutex); 329 held_lwlocks[num_held_lwlocks++] = lockid; 335 PGSemaphoreUnlock(&proc->sem); LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:471 471 lock = (LOCK *) hash_search(lockMethodTable->lockHash, hash_search (hashp=0x9a69180, keyPtr=0xbffe0c50, action=HASH_ENTER, foundPtr=0xbffe0bcf "¿") at dynahash.c:515 515 HASHHDR *hctl = hashp->hctl; 538 if (action == HASH_REMOVE_SAVED) 515 HASHHDR *hctl = hashp->hctl; 516 uint32 hashvalue = 0; 538 if (action == HASH_REMOVE_SAVED) 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); tag_hash (key=0x9a69180, keysize=16) at hashfn.c:42 42 } tag_hash (key=0x9a69180, keysize=3221097552) at hashfn.c:40 40 return DatumGetUInt32(hash_any((const unsigned char *) key, hash_any (k=0xbffe0c50 "ì\004", keylen=16) at hashfunc.c:201 201 { 208 len = keylen; 201 { 209 a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */ 210 c = 3923095; /* initialize with an arbitrary value */ 220 len -= 12; 208 len = keylen; 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 218 mix(a, b, c); 220 len -= 12; 218 mix(a, b, c); 219 k += 12; 220 len -= 12; 224 c += keylen; 225 switch (len) /* all the case statements fall through */ 243 a += ((uint32) k[3] << 24); 245 a += ((uint32) k[2] << 16); 247 a += ((uint32) k[1] << 8); 249 a += k[0]; 252 mix(a, b, c); 255 } 252 mix(a, b, c); 255 } hash_search (hashp=0x9a69180, keyPtr=0xbffe0c50, action=HASH_ENTER, foundPtr=0xbffe0bcf "¿") at dynahash.c:478 478 bucket = hash_val & hctl->high_mask; 475 { 479 if (bucket > hctl->max_bucket) 480 bucket = bucket & hctl->low_mask; 558 segment_ndx = MOD(bucket, hctl->ssize); 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 562 if (segp == NULL) 571 match = hashp->match; /* save one fetch in inner loop */ 565 prevBucketPtr = &segp[segment_ndx]; 571 match = hashp->match; /* save one fetch in inner loop */ 566 currBucket = *prevBucketPtr; 571 match = hashp->match; /* save one fetch in inner loop */ 578 currBucket = *prevBucketPtr; 586 if (foundPtr) 587 *foundPtr = (bool) (currBucket != NULL); 592 switch (action) 633 if (currBucket != NULL) 637 currBucket = hctl->freeList; 638 if (currBucket == NULL) 647 hctl->freeList = currBucket->link; 650 *prevBucketPtr = currBucket; 651 currBucket->link = NULL; 654 currBucket->hashvalue = hashvalue; 655 hashp->keycopy(ELEMENTKEY(currBucket), keyPtr, hctl->keysize); 660 if (++hctl->nentries / (long) (hctl->max_bucket + 1) > hctl->ffactor) 670 return (void *) ELEMENTKEY(currBucket); 676 } LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:474 474 if (!lock) 471 lock = (LOCK *) hash_search(lockMethodTable->lockHash, 474 if (!lock) 486 if (!found) 488 lock->grantMask = 0; 490 SHMQueueInit(&(lock->lockHolders)); 488 lock->grantMask = 0; 489 lock->waitMask = 0; 490 SHMQueueInit(&(lock->lockHolders)); SHMQueueInit (queue=0xb7b4ba94) at shmqueue.c:43 43 { 45 (queue)->prev = (queue)->next = MAKE_OFFSET(queue); LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:491 491 ProcQueueInit(&(lock->waitProcs)); ProcQueueInit (queue=0xbffe0c50) at proc.c:501 501 { 502 SHMQueueInit(&(queue->links)); SHMQueueInit (queue=0xb7b4ba9c) at shmqueue.c:43 43 { 45 (queue)->prev = (queue)->next = MAKE_OFFSET(queue); ProcQueueInit (queue=0xb7b4ba9c) at proc.c:503 503 queue->size = 0; LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:492 492 lock->nRequested = 0; 494 MemSet((char *) lock->requested, 0, sizeof(int) * MAX_LOCKMODES); 492 lock->nRequested = 0; 493 lock->nGranted = 0; 494 MemSet((char *) lock->requested, 0, sizeof(int) * MAX_LOCKMODES); 495 MemSet((char *) lock->granted, 0, sizeof(int) * MAX_LOCKMODES); 509 MemSet(&proclocktag, 0, sizeof(PROCLOCKTAG)); /* must clear padding, 511 proclocktag.lock = MAKE_OFFSET(lock); 512 proclocktag.proc = MAKE_OFFSET(MyProc); 513 TransactionIdStore(xid, &proclocktag.xid); 518 proclockTable = lockMethodTable->proclockHash; 519 proclock = (PROCLOCK *) hash_search(proclockTable, hash_search (hashp=0x9a691f0, keyPtr=0xbffe0c00, action=HASH_ENTER, foundPtr=0xbffe0bcf "") at dynahash.c:515 515 HASHHDR *hctl = hashp->hctl; 538 if (action == HASH_REMOVE_SAVED) 515 HASHHDR *hctl = hashp->hctl; 516 uint32 hashvalue = 0; 538 if (action == HASH_REMOVE_SAVED) 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); tag_hash (key=0x9a691f0, keysize=12) at hashfn.c:42 42 } tag_hash (key=0x9a691f0, keysize=3221097472) at hashfn.c:40 40 return DatumGetUInt32(hash_any((const unsigned char *) key, hash_any (k=0xbffe0c00 "|ª\203", keylen=12) at hashfunc.c:201 201 { 208 len = keylen; 201 { 209 a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */ 210 c = 3923095; /* initialize with an arbitrary value */ 220 len -= 12; 208 len = keylen; 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 218 mix(a, b, c); 220 len -= 12; 218 mix(a, b, c); 219 k += 12; 220 len -= 12; 224 c += keylen; 225 switch (len) /* all the case statements fall through */ 252 mix(a, b, c); 255 } 252 mix(a, b, c); 255 } hash_search (hashp=0x9a691f0, keyPtr=0xbffe0c00, action=HASH_ENTER, foundPtr=0xbffe0bcf "") at dynahash.c:478 478 bucket = hash_val & hctl->high_mask; 475 { 479 if (bucket > hctl->max_bucket) 558 segment_ndx = MOD(bucket, hctl->ssize); 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 562 if (segp == NULL) 571 match = hashp->match; /* save one fetch in inner loop */ 565 prevBucketPtr = &segp[segment_ndx]; 571 match = hashp->match; /* save one fetch in inner loop */ 566 currBucket = *prevBucketPtr; 571 match = hashp->match; /* save one fetch in inner loop */ 578 currBucket = *prevBucketPtr; 586 if (foundPtr) 587 *foundPtr = (bool) (currBucket != NULL); 592 switch (action) 633 if (currBucket != NULL) 637 currBucket = hctl->freeList; 638 if (currBucket == NULL) 647 hctl->freeList = currBucket->link; 650 *prevBucketPtr = currBucket; 651 currBucket->link = NULL; 654 currBucket->hashvalue = hashvalue; 655 hashp->keycopy(ELEMENTKEY(currBucket), keyPtr, hctl->keysize); 660 if (++hctl->nentries / (long) (hctl->max_bucket + 1) > hctl->ffactor) 670 return (void *) ELEMENTKEY(currBucket); 676 } LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:522 522 if (!proclock) 519 proclock = (PROCLOCK *) hash_search(proclockTable, 522 if (!proclock) 534 if (!found) 537 MemSet((char *) proclock->holding, 0, sizeof(int) * MAX_LOCKMODES); 536 proclock->nHolding = 0; 537 MemSet((char *) proclock->holding, 0, sizeof(int) * MAX_LOCKMODES); 539 SHMQueueInsertBefore(&lock->lockHolders, &proclock->lockLink); SHMQueueInsertBefore (queue=0x9a691f0, elem=0xb7b4c528) at shmqueue.c:102 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 104 SHMEM_OFFSET elemOffset = MAKE_OFFSET(elem); 113 (elem)->next = prevPtr->next; 114 (elem)->prev = queue->prev; 116 prevPtr->next = elemOffset; 115 (queue)->prev = elemOffset; 116 prevPtr->next = elemOffset; LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:540 540 SHMQueueInsertBefore(&MyProc->procHolders, &proclock->procLink); SHMQueueInsertBefore (queue=0xb7b4c52c, elem=0xb7b4c52c) at shmqueue.c:102 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 104 SHMEM_OFFSET elemOffset = MAKE_OFFSET(elem); 113 (elem)->next = prevPtr->next; 114 (elem)->prev = queue->prev; 116 prevPtr->next = elemOffset; 115 (queue)->prev = elemOffset; 116 prevPtr->next = elemOffset; LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:587 587 lock->nRequested++; 588 lock->requested[lockmode]++; 595 if (proclock->holding[lockmode] > 0) 607 LockCountMyLocks(proclock->tag.lock, MyProc, myHolding); LockCountMyLocks (lockOffset=8628860, proc=0xb7b1c760, myHolding=0xbffe0bd0) at lock.c:810 810 { 815 MemSet(myHolding, 0, MAX_LOCKMODES * sizeof(int)); 810 { 811 SHM_QUEUE *procHolders = &(proc->procHolders); 815 MemSet(myHolding, 0, MAX_LOCKMODES * sizeof(int)); 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, SHMQueueNext (queue=0xb7b1c7a4, curElem=0xb7b1c7a4, linkOffset=64) at shmqueue.c:179 179 SHM_QUEUE *elemPtr = (SHM_QUEUE *) MAKE_PTR((curElem)->next); 184 return NULL; 183 if (elemPtr == queue) /* back to the queue head? */ 186 return (Pointer) (((char *) elemPtr) - linkOffset); 187 } LockCountMyLocks (lockOffset=8628860, proc=) at lock.c:820 820 while (proclock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 822 if (lockOffset == proclock->tag.lock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, SHMQueueNext (queue=0xb7b1c7a4, curElem=0xb7b4c584, linkOffset=64) at shmqueue.c:179 179 SHM_QUEUE *elemPtr = (SHM_QUEUE *) MAKE_PTR((curElem)->next); 184 return NULL; 183 if (elemPtr == queue) /* back to the queue head? */ 186 return (Pointer) (((char *) elemPtr) - linkOffset); 187 } LockCountMyLocks (lockOffset=8628860, proc=) at lock.c:820 820 while (proclock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 822 if (lockOffset == proclock->tag.lock) 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, SHMQueueNext (queue=0xb7b1c7a4, curElem=0xb7b4c534, linkOffset=64) at shmqueue.c:179 179 SHM_QUEUE *elemPtr = (SHM_QUEUE *) MAKE_PTR((curElem)->next); 184 return NULL; 183 if (elemPtr == queue) /* back to the queue head? */ 187 } LockCountMyLocks (lockOffset=8628860, proc=) at lock.c:820 820 while (proclock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:608 608 if (myHolding[lockmode] > 0) 621 if (lockMethodTable->conflictTab[lockmode] & lock->waitMask) 624 status = LockCheckConflicts(lockMethodTable, lockmode, LockCheckConflicts (lockMethodTable=0xb7b18154, lockmode=1, lock=0xb7b4ba7c, proclock=0x0, proc=0xb7b1c760, myHolding=0xbffe0bd0) at lock.c:738 738 { 739 int numLockModes = lockMethodTable->numLockModes; 754 if (!(lockMethodTable->conflictTab[lockmode] & lock->grantMask)) 757 return STATUS_OK; 754 if (!(lockMethodTable->conflictTab[lockmode] & lock->grantMask)) 738 { 754 if (!(lockMethodTable->conflictTab[lockmode] & lock->grantMask)) 796 } LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:628 628 if (status == STATUS_OK) 631 GrantLock(lock, proclock, lockmode); GrantLock (lock=0xb7b4ba7c, proclock=0xb7b4c4f4, lockmode=1) at lock.c:842 842 { 844 lock->granted[lockmode]++; 842 { 843 lock->nGranted++; 844 lock->granted[lockmode]++; 845 lock->grantMask |= BITS_ON[lockmode]; 846 if (lock->granted[lockmode] == lock->requested[lockmode]) 847 lock->waitMask &= BITS_OFF[lockmode]; 851 proclock->holding[lockmode]++; 852 proclock->nHolding++; LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:710 710 LWLockRelease(masterLock); LWLockRelease (lockid=LockMgrLock) at lwlock.c:409 409 { 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 423 if (lockid == held_lwlocks[i]) 426 if (i < 0) 428 num_held_lwlocks--; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 436 if (lock->exclusive > 0) 437 lock->exclusive--; 450 head = lock->head; 451 if (head != NULL) 481 SpinLockRelease_NoHoldoff(&lock->mutex); 499 RESUME_INTERRUPTS(); LockAcquire (lockmethod=1, locktag=0xbffe0c50, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:712 712 return status == STATUS_OK; 713 } 712 return status == STATUS_OK; 713 } LockRelation (relation=0x9a83d98, lockmode=1) at lmgr.c:145 145 RelationIncrementReferenceCount(relation); 146 AcceptInvalidationMessages(); AcceptInvalidationMessages () at inval.c:564 564 ReceiveSharedInvalidMessages(LocalExecuteInvalidationMessage, ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:90 90 bool gotMessage = false; 110 LWLockAcquire(SInvalLock, LW_SHARED); LWLockAcquire (lockid=SInvalLock, mode=LW_SHARED) at lwlock.c:218 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 200 PGPROC *proc = MyProc; 199 volatile LWLock *lock = LWLockArray + lockid; 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 201 bool retry = false; 202 int extraWaits = 0; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 245 if (retry) 249 if (mode == LW_EXCLUSIVE) 261 if (lock->exclusive == 0) 263 lock->shared++; 325 SpinLockRelease_NoHoldoff(&lock->mutex); 329 held_lwlocks[num_held_lwlocks++] = lockid; 335 PGSemaphoreUnlock(&proc->sem); ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:111 111 getResult = SIGetDataEntry(shmInvalBuffer, MyBackendId, &data); SIGetDataEntry (segP=0xb7b1c800, backendId=1, data=0xbffe0c00) at sinvaladt.c:283 283 { 284 ProcState *stateP = &segP->procState[backendId - 1]; 283 { 284 ProcState *stateP = &segP->procState[backendId - 1]; 286 if (stateP->resetState) 283 { 286 if (stateP->resetState) 297 if (stateP->nextMsgNum >= segP->maxMsgNum) 298 return 0; /* nothing to read */ 297 if (stateP->nextMsgNum >= segP->maxMsgNum) 312 } ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:112 112 LWLockRelease(SInvalLock); LWLockRelease (lockid=SInvalLock) at lwlock.c:409 409 { 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 423 if (lockid == held_lwlocks[i]) 426 if (i < 0) 428 num_held_lwlocks--; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 436 if (lock->exclusive > 0) 441 lock->shared--; 450 head = lock->head; 451 if (head != NULL) 481 SpinLockRelease_NoHoldoff(&lock->mutex); 499 RESUME_INTERRUPTS(); ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:114 114 if (getResult == 0) 131 if (gotMessage) 137 } 0x081ac7a5 in AcceptInvalidationMessages () at inval.c:564 564 ReceiveSharedInvalidMessages(LocalExecuteInvalidationMessage, LockRelation (relation=0x9a83d98, lockmode=1) at lmgr.c:147 147 RelationDecrementReferenceCount(relation); relation_open (relationId=1260, lockmode=1) at heapam.c:465 465 } heap_open (relationId=1260, lockmode=1) at heapam.c:577 577 if (r->rd_rel->relkind == RELKIND_INDEX) 582 else if (r->rd_rel->relkind == RELKIND_SPECIAL) 587 else if (r->rd_rel->relkind == RELKIND_COMPOSITE_TYPE) 593 pgstat_initstats(&r->pgstat_info, r); pgstat_initstats (stats=0x9a83e00, rel=0x9a83d98) at pgstat.c:919 919 Oid rel_id = rel->rd_id; 928 stats->tabentry = NULL; 929 stats->no_stats = FALSE; 930 stats->heap_scan_counted = FALSE; 931 stats->index_scan_counted = FALSE; 933 if (pgStatSock < 0 || 979 stats->no_stats = TRUE; 995 } heap_open (relationId=1260, lockmode=1) at heapam.c:596 596 } SearchCatCache (cache=0xb73050c8, v1=213, v2=0, v3=0, v4=0) at catcache.c:1021 1021 if (cache->id == INDEXRELID) 1020 { 1021 if (cache->id == INDEXRELID) 1031 else if (cache->id == AMOID || 1040 return false; 1031 else if (cache->id == AMOID || 1042 else if (cache->id == OPEROID) 1052 } 1020 { systable_beginscan (heapRelation=0x9a83d98, indexRelname=0x822f5c9 "pg_shadow_usesysid_index", indexOK=1 '\001', snapshot=0x0, nkeys=1, key=0xbffe0cf0) at genam.c:189 189 if (indexOK && !IsIgnoringSystemIndexes()) 185 { 189 if (indexOK && !IsIgnoringSystemIndexes()) IsIgnoringSystemIndexes () at miscinit.c:71 71 return isIgnoringSystemIndexes; 72 } systable_beginscan (heapRelation=0x9a83d98, indexRelname=0x822f5c9 "pg_shadow_usesysid_index", indexOK=1 '\001', snapshot=0x0, nkeys=1, key=0xbffe0cf0) at genam.c:192 192 irel = index_openr(indexRelname); index_openr (sysRelationName=0x822f5c9 "pg_shadow_usesysid_index") at indexam.c:179 179 r = relation_openr(sysRelationName, NoLock); relation_openr (sysRelationName=0x822f5c9 "pg_shadow_usesysid_index", lockmode=0) at heapam.c:518 518 { 529 r = RelationSysNameGetRelation(sysRelationName); RelationSysNameGetRelation (relationName=0x822f5c9 "pg_shadow_usesysid_index") at relcache.c:1541 1541 namestrcpy(&name, relationName); namestrcpy (name=0xbffe0bd0, str=0x822f5c9 "pg_shadow_usesysid_index") at name.c:274 274 if (!name || !str) 273 { 274 if (!name || !str) 276 StrNCpy(NameStr(*name), str, NAMEDATALEN); 277 return 0; 278 } RelationSysNameGetRelation (relationName=0x822f5c9 "pg_shadow_usesysid_index") at relcache.c:1542 1542 RelationSysNameCacheLookup(NameStr(name), rd); hash_search (hashp=0x9a692d0, keyPtr=0xbffe0bd0, action=HASH_FIND, foundPtr=0x0) at dynahash.c:515 515 HASHHDR *hctl = hashp->hctl; 538 if (action == HASH_REMOVE_SAVED) 515 HASHHDR *hctl = hashp->hctl; 516 uint32 hashvalue = 0; 538 if (action == HASH_REMOVE_SAVED) 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); string_hash (key=0xbffe0bd0, keysize=64) at hashfn.c:29 29 { 30 return DatumGetUInt32(hash_any((const unsigned char *) key, 32 } string_hash (key=) at hashfn.c:30 30 return DatumGetUInt32(hash_any((const unsigned char *) key, hash_any (k=0xbffe0bd0 "pg_shadow_usesysid_index", keylen=24) at hashfunc.c:201 201 { 208 len = keylen; 201 { 209 a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */ 210 c = 3923095; /* initialize with an arbitrary value */ 220 len -= 12; 208 len = keylen; 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 218 mix(a, b, c); 220 len -= 12; 218 mix(a, b, c); 219 k += 12; 220 len -= 12; 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 218 mix(a, b, c); 220 len -= 12; 218 mix(a, b, c); 219 k += 12; 220 len -= 12; 224 c += keylen; 225 switch (len) /* all the case statements fall through */ 252 mix(a, b, c); 255 } 252 mix(a, b, c); 255 } hash_search (hashp=0x9a692d0, keyPtr=0xbffe0bd0, action=HASH_FIND, foundPtr=0x0) at dynahash.c:478 478 bucket = hash_val & hctl->high_mask; 475 { 479 if (bucket > hctl->max_bucket) 480 bucket = bucket & hctl->low_mask; 558 segment_ndx = MOD(bucket, hctl->ssize); 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 562 if (segp == NULL) 571 match = hashp->match; /* save one fetch in inner loop */ 565 prevBucketPtr = &segp[segment_ndx]; 571 match = hashp->match; /* save one fetch in inner loop */ 566 currBucket = *prevBucketPtr; 571 match = hashp->match; /* save one fetch in inner loop */ 578 currBucket = *prevBucketPtr; 574 if (currBucket->hashvalue == hashvalue && 577 prevBucketPtr = &(currBucket->link); 578 currBucket = *prevBucketPtr; 574 if (currBucket->hashvalue == hashvalue && 586 if (foundPtr) 592 switch (action) 597 return NULL; 595 if (currBucket != NULL) 634 return (void *) ELEMENTKEY(currBucket); 676 } RelationSysNameGetRelation (relationName=0x822f5c9 "pg_shadow_usesysid_index") at relcache.c:1544 1544 if (RelationIsValid(rd)) 1546 RelationIncrementReferenceCount(rd); 1548 if (rd->rd_isnailed == 2) 1639 } 1628 return rd; 1639 } relation_openr (sysRelationName=0x822f5c9 "pg_shadow_usesysid_index", lockmode=0) at heapam.c:531 531 if (!RelationIsValid(r)) 529 r = RelationSysNameGetRelation(sysRelationName); 531 if (!RelationIsValid(r)) 534 if (lockmode != NoLock) 538 } index_openr (sysRelationName=0x822f5c9 "pg_shadow_usesysid_index") at indexam.c:181 181 if (r->rd_rel->relkind != RELKIND_INDEX) 187 pgstat_initstats(&r->pgstat_info, r); pgstat_initstats (stats=0x9a8fc98, rel=0x9a8fc30) at pgstat.c:919 919 Oid rel_id = rel->rd_id; 928 stats->tabentry = NULL; 929 stats->no_stats = FALSE; 930 stats->heap_scan_counted = FALSE; 931 stats->index_scan_counted = FALSE; 933 if (pgStatSock < 0 || 979 stats->no_stats = TRUE; 995 } index_openr (sysRelationName=0x822f5c9 "pg_shadow_usesysid_index") at indexam.c:190 190 } systable_beginscan (heapRelation=0x9a83d98, indexRelname=0x822f5c9 "pg_shadow_usesysid_index", indexOK=1 '\001', snapshot=0x0, nkeys=1, key=0xbffe0cf0) at genam.c:194 194 if (ReindexIsProcessingIndex(RelationGetRelid(irel))) 192 irel = index_openr(indexRelname); 194 if (ReindexIsProcessingIndex(RelationGetRelid(irel))) ReindexIsProcessingIndex (indexOid=16646) at miscinit.c:112 112 return indexOid == currentlyReindexedIndex; 113 } systable_beginscan (heapRelation=0x9a83d98, indexRelname=0x822f5c9 "pg_shadow_usesysid_index", indexOK=1 '\001', snapshot=0x0, nkeys=1, key=0xbffe0cf0) at genam.c:204 204 sysscan = (SysScanDesc) palloc(sizeof(SysScanDescData)); MemoryContextAlloc (context=0x9a8cd38, size=16) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a83d98, size=136508873) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=16) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } systable_beginscan (heapRelation=0x9a83d98, indexRelname=0x822f5c9 "pg_shadow_usesysid_index", indexOK=1 '\001', snapshot=0x0, nkeys=1, key=0xbffe0cf0) at genam.c:209 209 if (irel) 206 sysscan->heap_rel = heapRelation; 209 if (irel) 206 sysscan->heap_rel = heapRelation; 207 sysscan->irel = irel; 209 if (irel) 219 for (i = 0; i < nkeys; i++) 222 key[i].sk_attno = i + 1; 219 for (i = 0; i < nkeys; i++) 222 key[i].sk_attno = i + 1; 219 for (i = 0; i < nkeys; i++) 225 sysscan->iscan = index_beginscan(heapRelation, irel, snapshot, index_beginscan (heapRelation=0x9a83d98, indexRelation=0x9a8fc30, snapshot=0x0, nkeys=1, key=0xbffe0cf0) at indexam.c:254 254 { 259 GET_REL_PROCEDURE(beginscan, ambeginscan); 270 LockRelation(indexRelation, AccessShareLock); 261 RelationIncrementReferenceCount(indexRelation); 270 LockRelation(indexRelation, AccessShareLock); LockRelation (relation=0x9a8fc30, lockmode=1) at lmgr.c:130 130 MemSet(&tag, 0, sizeof(tag)); 127 { 130 MemSet(&tag, 0, sizeof(tag)); 131 tag.relId = relation->rd_lockInfo.lockRelId.relId; 132 tag.dbId = relation->rd_lockInfo.lockRelId.dbId; 135 if (!LockAcquire(LockTableId, &tag, GetCurrentTransactionId(), 132 tag.dbId = relation->rd_lockInfo.lockRelId.dbId; 133 tag.objId.blkno = InvalidBlockNumber; 135 if (!LockAcquire(LockTableId, &tag, GetCurrentTransactionId(), GetCurrentTransactionId () at xact.c:329 329 return s->transactionIdData; 330 } LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:434 434 { 453 locktag->lockmethod = lockmethod; 434 { 453 locktag->lockmethod = lockmethod; 456 lockMethodTable = LockMethodTable[lockmethod]; 457 if (!lockMethodTable) 456 lockMethodTable = LockMethodTable[lockmethod]; 457 if (!lockMethodTable) 463 masterLock = lockMethodTable->masterLock; 465 LWLockAcquire(masterLock, LW_EXCLUSIVE); 463 masterLock = lockMethodTable->masterLock; 465 LWLockAcquire(masterLock, LW_EXCLUSIVE); 471 lock = (LOCK *) hash_search(lockMethodTable->lockHash, 465 LWLockAcquire(masterLock, LW_EXCLUSIVE); LWLockAcquire (lockid=LockMgrLock, mode=LW_EXCLUSIVE) at lwlock.c:218 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 200 PGPROC *proc = MyProc; 199 volatile LWLock *lock = LWLockArray + lockid; 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 201 bool retry = false; 202 int extraWaits = 0; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 245 if (retry) 249 if (mode == LW_EXCLUSIVE) 251 if (lock->exclusive == 0 && lock->shared == 0) 253 lock->exclusive++; 325 SpinLockRelease_NoHoldoff(&lock->mutex); 329 held_lwlocks[num_held_lwlocks++] = lockid; 335 PGSemaphoreUnlock(&proc->sem); LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:471 471 lock = (LOCK *) hash_search(lockMethodTable->lockHash, hash_search (hashp=0x9a69180, keyPtr=0xbffe0c30, action=HASH_ENTER, foundPtr=0xbffe0baf "¿Éõ\"\b") at dynahash.c:515 515 HASHHDR *hctl = hashp->hctl; 538 if (action == HASH_REMOVE_SAVED) 515 HASHHDR *hctl = hashp->hctl; 516 uint32 hashvalue = 0; 538 if (action == HASH_REMOVE_SAVED) 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); tag_hash (key=0x9a69180, keysize=16) at hashfn.c:42 42 } tag_hash (key=0x9a69180, keysize=3221097520) at hashfn.c:40 40 return DatumGetUInt32(hash_any((const unsigned char *) key, hash_any (k=0xbffe0c30 "\006A", keylen=16) at hashfunc.c:201 201 { 208 len = keylen; 201 { 209 a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */ 210 c = 3923095; /* initialize with an arbitrary value */ 220 len -= 12; 208 len = keylen; 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 218 mix(a, b, c); 220 len -= 12; 218 mix(a, b, c); 219 k += 12; 220 len -= 12; 224 c += keylen; 225 switch (len) /* all the case statements fall through */ 243 a += ((uint32) k[3] << 24); 245 a += ((uint32) k[2] << 16); 247 a += ((uint32) k[1] << 8); 249 a += k[0]; 252 mix(a, b, c); 255 } 252 mix(a, b, c); 255 } hash_search (hashp=0x9a69180, keyPtr=0xbffe0c30, action=HASH_ENTER, foundPtr=0xbffe0baf "¿Éõ\"\b") at dynahash.c:478 478 bucket = hash_val & hctl->high_mask; 475 { 479 if (bucket > hctl->max_bucket) 480 bucket = bucket & hctl->low_mask; 558 segment_ndx = MOD(bucket, hctl->ssize); 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 562 if (segp == NULL) 571 match = hashp->match; /* save one fetch in inner loop */ 565 prevBucketPtr = &segp[segment_ndx]; 571 match = hashp->match; /* save one fetch in inner loop */ 566 currBucket = *prevBucketPtr; 571 match = hashp->match; /* save one fetch in inner loop */ 578 currBucket = *prevBucketPtr; 586 if (foundPtr) 587 *foundPtr = (bool) (currBucket != NULL); 592 switch (action) 633 if (currBucket != NULL) 637 currBucket = hctl->freeList; 638 if (currBucket == NULL) 647 hctl->freeList = currBucket->link; 650 *prevBucketPtr = currBucket; 651 currBucket->link = NULL; 654 currBucket->hashvalue = hashvalue; 655 hashp->keycopy(ELEMENTKEY(currBucket), keyPtr, hctl->keysize); 660 if (++hctl->nentries / (long) (hctl->max_bucket + 1) > hctl->ffactor) 670 return (void *) ELEMENTKEY(currBucket); 676 } LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:474 474 if (!lock) 471 lock = (LOCK *) hash_search(lockMethodTable->lockHash, 474 if (!lock) 486 if (!found) 488 lock->grantMask = 0; 490 SHMQueueInit(&(lock->lockHolders)); 488 lock->grantMask = 0; 489 lock->waitMask = 0; 490 SHMQueueInit(&(lock->lockHolders)); SHMQueueInit (queue=0xb7b4ba08) at shmqueue.c:43 43 { 45 (queue)->prev = (queue)->next = MAKE_OFFSET(queue); LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:491 491 ProcQueueInit(&(lock->waitProcs)); ProcQueueInit (queue=0xbffe0c30) at proc.c:501 501 { 502 SHMQueueInit(&(queue->links)); SHMQueueInit (queue=0xb7b4ba10) at shmqueue.c:43 43 { 45 (queue)->prev = (queue)->next = MAKE_OFFSET(queue); ProcQueueInit (queue=0xb7b4ba10) at proc.c:503 503 queue->size = 0; LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:492 492 lock->nRequested = 0; 494 MemSet((char *) lock->requested, 0, sizeof(int) * MAX_LOCKMODES); 492 lock->nRequested = 0; 493 lock->nGranted = 0; 494 MemSet((char *) lock->requested, 0, sizeof(int) * MAX_LOCKMODES); 495 MemSet((char *) lock->granted, 0, sizeof(int) * MAX_LOCKMODES); 509 MemSet(&proclocktag, 0, sizeof(PROCLOCKTAG)); /* must clear padding, 511 proclocktag.lock = MAKE_OFFSET(lock); 512 proclocktag.proc = MAKE_OFFSET(MyProc); 513 TransactionIdStore(xid, &proclocktag.xid); 518 proclockTable = lockMethodTable->proclockHash; 519 proclock = (PROCLOCK *) hash_search(proclockTable, hash_search (hashp=0x9a691f0, keyPtr=0xbffe0be0, action=HASH_ENTER, foundPtr=0xbffe0baf "") at dynahash.c:515 515 HASHHDR *hctl = hashp->hctl; 538 if (action == HASH_REMOVE_SAVED) 515 HASHHDR *hctl = hashp->hctl; 516 uint32 hashvalue = 0; 538 if (action == HASH_REMOVE_SAVED) 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); tag_hash (key=0x9a691f0, keysize=12) at hashfn.c:42 42 } tag_hash (key=0x9a691f0, keysize=3221097440) at hashfn.c:40 40 return DatumGetUInt32(hash_any((const unsigned char *) key, hash_any (k=0xbffe0be0 "ð©\203", keylen=12) at hashfunc.c:201 201 { 208 len = keylen; 201 { 209 a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */ 210 c = 3923095; /* initialize with an arbitrary value */ 220 len -= 12; 208 len = keylen; 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 218 mix(a, b, c); 220 len -= 12; 218 mix(a, b, c); 219 k += 12; 220 len -= 12; 224 c += keylen; 225 switch (len) /* all the case statements fall through */ 252 mix(a, b, c); 255 } 252 mix(a, b, c); 255 } hash_search (hashp=0x9a691f0, keyPtr=0xbffe0be0, action=HASH_ENTER, foundPtr=0xbffe0baf "") at dynahash.c:478 478 bucket = hash_val & hctl->high_mask; 475 { 479 if (bucket > hctl->max_bucket) 480 bucket = bucket & hctl->low_mask; 558 segment_ndx = MOD(bucket, hctl->ssize); 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 562 if (segp == NULL) 571 match = hashp->match; /* save one fetch in inner loop */ 565 prevBucketPtr = &segp[segment_ndx]; 571 match = hashp->match; /* save one fetch in inner loop */ 566 currBucket = *prevBucketPtr; 571 match = hashp->match; /* save one fetch in inner loop */ 578 currBucket = *prevBucketPtr; 586 if (foundPtr) 587 *foundPtr = (bool) (currBucket != NULL); 592 switch (action) 633 if (currBucket != NULL) 637 currBucket = hctl->freeList; 638 if (currBucket == NULL) 647 hctl->freeList = currBucket->link; 650 *prevBucketPtr = currBucket; 651 currBucket->link = NULL; 654 currBucket->hashvalue = hashvalue; 655 hashp->keycopy(ELEMENTKEY(currBucket), keyPtr, hctl->keysize); 660 if (++hctl->nentries / (long) (hctl->max_bucket + 1) > hctl->ffactor) 670 return (void *) ELEMENTKEY(currBucket); 676 } LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:522 522 if (!proclock) 519 proclock = (PROCLOCK *) hash_search(proclockTable, 522 if (!proclock) 534 if (!found) 537 MemSet((char *) proclock->holding, 0, sizeof(int) * MAX_LOCKMODES); 536 proclock->nHolding = 0; 537 MemSet((char *) proclock->holding, 0, sizeof(int) * MAX_LOCKMODES); 539 SHMQueueInsertBefore(&lock->lockHolders, &proclock->lockLink); SHMQueueInsertBefore (queue=0x9a691f0, elem=0xb7b4c4d8) at shmqueue.c:102 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 104 SHMEM_OFFSET elemOffset = MAKE_OFFSET(elem); 113 (elem)->next = prevPtr->next; 114 (elem)->prev = queue->prev; 116 prevPtr->next = elemOffset; 115 (queue)->prev = elemOffset; 116 prevPtr->next = elemOffset; LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:540 540 SHMQueueInsertBefore(&MyProc->procHolders, &proclock->procLink); SHMQueueInsertBefore (queue=0xb7b4c4dc, elem=0xb7b4c4dc) at shmqueue.c:102 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 102 { 103 SHM_QUEUE *prevPtr = (SHM_QUEUE *) MAKE_PTR((queue)->prev); 104 SHMEM_OFFSET elemOffset = MAKE_OFFSET(elem); 113 (elem)->next = prevPtr->next; 114 (elem)->prev = queue->prev; 116 prevPtr->next = elemOffset; 115 (queue)->prev = elemOffset; 116 prevPtr->next = elemOffset; LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:587 587 lock->nRequested++; 588 lock->requested[lockmode]++; 595 if (proclock->holding[lockmode] > 0) 607 LockCountMyLocks(proclock->tag.lock, MyProc, myHolding); LockCountMyLocks (lockOffset=8628720, proc=0xb7b1c760, myHolding=0xbffe0bb0) at lock.c:810 810 { 815 MemSet(myHolding, 0, MAX_LOCKMODES * sizeof(int)); 810 { 811 SHM_QUEUE *procHolders = &(proc->procHolders); 815 MemSet(myHolding, 0, MAX_LOCKMODES * sizeof(int)); 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, SHMQueueNext (queue=0xb7b1c7a4, curElem=0xb7b1c7a4, linkOffset=64) at shmqueue.c:179 179 SHM_QUEUE *elemPtr = (SHM_QUEUE *) MAKE_PTR((curElem)->next); 184 return NULL; 183 if (elemPtr == queue) /* back to the queue head? */ 186 return (Pointer) (((char *) elemPtr) - linkOffset); 187 } LockCountMyLocks (lockOffset=8628720, proc=) at lock.c:820 820 while (proclock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 822 if (lockOffset == proclock->tag.lock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, SHMQueueNext (queue=0xb7b1c7a4, curElem=0xb7b4c584, linkOffset=64) at shmqueue.c:179 179 SHM_QUEUE *elemPtr = (SHM_QUEUE *) MAKE_PTR((curElem)->next); 184 return NULL; 183 if (elemPtr == queue) /* back to the queue head? */ 186 return (Pointer) (((char *) elemPtr) - linkOffset); 187 } LockCountMyLocks (lockOffset=8628720, proc=) at lock.c:820 820 while (proclock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 822 if (lockOffset == proclock->tag.lock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, SHMQueueNext (queue=0xb7b1c7a4, curElem=0xb7b4c534, linkOffset=64) at shmqueue.c:179 179 SHM_QUEUE *elemPtr = (SHM_QUEUE *) MAKE_PTR((curElem)->next); 184 return NULL; 183 if (elemPtr == queue) /* back to the queue head? */ 186 return (Pointer) (((char *) elemPtr) - linkOffset); 187 } LockCountMyLocks (lockOffset=8628720, proc=) at lock.c:820 820 while (proclock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 822 if (lockOffset == proclock->tag.lock) 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 825 myHolding[i] += proclock->holding[i]; 824 for (i = 1; i < MAX_LOCKMODES; i++) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, SHMQueueNext (queue=0xb7b1c7a4, curElem=0xb7b4c4e4, linkOffset=64) at shmqueue.c:179 179 SHM_QUEUE *elemPtr = (SHM_QUEUE *) MAKE_PTR((curElem)->next); 184 return NULL; 183 if (elemPtr == queue) /* back to the queue head? */ 187 } LockCountMyLocks (lockOffset=8628720, proc=) at lock.c:820 820 while (proclock) 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 817 proclock = (PROCLOCK *) SHMQueueNext(procHolders, procHolders, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, 828 proclock = (PROCLOCK *) SHMQueueNext(procHolders, &proclock->procLink, LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:608 608 if (myHolding[lockmode] > 0) 621 if (lockMethodTable->conflictTab[lockmode] & lock->waitMask) 624 status = LockCheckConflicts(lockMethodTable, lockmode, LockCheckConflicts (lockMethodTable=0xb7b18154, lockmode=1, lock=0xb7b4b9f0, proclock=0x0, proc=0xb7b1c760, myHolding=0xbffe0bb0) at lock.c:738 738 { 739 int numLockModes = lockMethodTable->numLockModes; 754 if (!(lockMethodTable->conflictTab[lockmode] & lock->grantMask)) 757 return STATUS_OK; 754 if (!(lockMethodTable->conflictTab[lockmode] & lock->grantMask)) 738 { 754 if (!(lockMethodTable->conflictTab[lockmode] & lock->grantMask)) 796 } LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:628 628 if (status == STATUS_OK) 631 GrantLock(lock, proclock, lockmode); GrantLock (lock=0xb7b4b9f0, proclock=0xb7b4c4a4, lockmode=1) at lock.c:842 842 { 844 lock->granted[lockmode]++; 842 { 843 lock->nGranted++; 844 lock->granted[lockmode]++; 845 lock->grantMask |= BITS_ON[lockmode]; 846 if (lock->granted[lockmode] == lock->requested[lockmode]) 847 lock->waitMask &= BITS_OFF[lockmode]; 851 proclock->holding[lockmode]++; 852 proclock->nHolding++; LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:710 710 LWLockRelease(masterLock); LWLockRelease (lockid=LockMgrLock) at lwlock.c:409 409 { 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 423 if (lockid == held_lwlocks[i]) 426 if (i < 0) 428 num_held_lwlocks--; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 436 if (lock->exclusive > 0) 437 lock->exclusive--; 450 head = lock->head; 451 if (head != NULL) 481 SpinLockRelease_NoHoldoff(&lock->mutex); 499 RESUME_INTERRUPTS(); LockAcquire (lockmethod=1, locktag=0xbffe0c30, xid=5338, lockmode=1, dontWait=0 '\0') at lock.c:712 712 return status == STATUS_OK; 713 } 712 return status == STATUS_OK; 713 } LockRelation (relation=0x9a8fc30, lockmode=1) at lmgr.c:145 145 RelationIncrementReferenceCount(relation); 146 AcceptInvalidationMessages(); AcceptInvalidationMessages () at inval.c:564 564 ReceiveSharedInvalidMessages(LocalExecuteInvalidationMessage, ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:90 90 bool gotMessage = false; 110 LWLockAcquire(SInvalLock, LW_SHARED); LWLockAcquire (lockid=SInvalLock, mode=LW_SHARED) at lwlock.c:218 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 200 PGPROC *proc = MyProc; 199 volatile LWLock *lock = LWLockArray + lockid; 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 201 bool retry = false; 202 int extraWaits = 0; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 245 if (retry) 249 if (mode == LW_EXCLUSIVE) 261 if (lock->exclusive == 0) 263 lock->shared++; 325 SpinLockRelease_NoHoldoff(&lock->mutex); 329 held_lwlocks[num_held_lwlocks++] = lockid; 335 PGSemaphoreUnlock(&proc->sem); ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:111 111 getResult = SIGetDataEntry(shmInvalBuffer, MyBackendId, &data); SIGetDataEntry (segP=0xb7b1c800, backendId=1, data=0xbffe0be0) at sinvaladt.c:283 283 { 284 ProcState *stateP = &segP->procState[backendId - 1]; 283 { 284 ProcState *stateP = &segP->procState[backendId - 1]; 286 if (stateP->resetState) 283 { 286 if (stateP->resetState) 297 if (stateP->nextMsgNum >= segP->maxMsgNum) 298 return 0; /* nothing to read */ 297 if (stateP->nextMsgNum >= segP->maxMsgNum) 312 } ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:112 112 LWLockRelease(SInvalLock); LWLockRelease (lockid=SInvalLock) at lwlock.c:409 409 { 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 423 if (lockid == held_lwlocks[i]) 426 if (i < 0) 428 num_held_lwlocks--; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 436 if (lock->exclusive > 0) 441 lock->shared--; 450 head = lock->head; 451 if (head != NULL) 481 SpinLockRelease_NoHoldoff(&lock->mutex); 499 RESUME_INTERRUPTS(); ReceiveSharedInvalidMessages ( invalFunction=0x81ac62c , resetFunction=0x81ac74c ) at sinval.c:114 114 if (getResult == 0) 131 if (gotMessage) 137 } 0x081ac7a5 in AcceptInvalidationMessages () at inval.c:564 564 ReceiveSharedInvalidMessages(LocalExecuteInvalidationMessage, LockRelation (relation=0x9a8fc30, lockmode=1) at lmgr.c:147 147 RelationDecrementReferenceCount(relation); index_beginscan (heapRelation=0x9a83d98, indexRelation=0x9a8fc30, snapshot=0x0, nkeys=1, key=0xbffe0cf0) at indexam.c:275 275 scan = (IndexScanDesc) OidFunctionCall3 (functionId=333, arg1=162069552, arg2=1, arg3=3221097712) at fmgr.c:1251 1251 fmgr_info(functionId, &flinfo); fmgr_info (functionId=333, finfo=0xbffe0c10) at fmgr.c:133 133 fmgr_info_cxt(functionId, finfo, CurrentMemoryContext); fmgr_info_cxt (functionId=0, finfo=0x0, mcxt=0xb7b1c80c) at fmgr.c:143 143 fmgr_info_cxt_security(functionId, finfo, mcxt, false); 142 { 143 fmgr_info_cxt_security(functionId, finfo, mcxt, false); fmgr_info_cxt_security (functionId=333, finfo=0xbffe0c10, mcxt=0x9a8cd38, ignore_security=0 '\0') at fmgr.c:154 154 { 165 finfo->fn_oid = InvalidOid; 166 finfo->fn_extra = NULL; 167 finfo->fn_mcxt = mcxt; 78 int high = fmgr_nbuiltins - 1; 154 { 167 finfo->fn_mcxt = mcxt; 168 finfo->fn_expr = NULL; /* caller may set this later */ 77 int low = 0; 78 int high = fmgr_nbuiltins - 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 76 { 176 finfo->fn_nargs = fbp->nargs; 177 finfo->fn_strict = fbp->strict; 178 finfo->fn_retset = fbp->retset; 179 finfo->fn_addr = fbp->func; 180 finfo->fn_oid = functionId; 245 } 0x081b6893 in fmgr_info (functionId=333, finfo=0xbffe0c10) at fmgr.c:133 133 fmgr_info_cxt(functionId, finfo, CurrentMemoryContext); OidFunctionCall3 (functionId=333, arg1=162069552, arg2=1, arg3=3221097712) at fmgr.c:1253 1253 MemSet(&fcinfo, 0, sizeof(fcinfo)); 1256 fcinfo.arg[0] = arg1; 1257 fcinfo.arg[1] = arg2; 1260 result = FunctionCallInvoke(&fcinfo); 1257 fcinfo.arg[1] = arg2; 1258 fcinfo.arg[2] = arg3; 1254 fcinfo.flinfo = &flinfo; 1255 fcinfo.nargs = 3; 1258 fcinfo.arg[2] = arg3; 1260 result = FunctionCallInvoke(&fcinfo); btbeginscan (fcinfo=0xbffe0cf0) at nbtree.c:365 365 { 372 scan = RelationGetIndexScan(rel, keysz, scankey); RelationGetIndexScan (indexRelation=0x9a8fc30, nkeys=1, key=0xbffe0cf0) at genam.c:73 73 scan = (IndexScanDesc) palloc(sizeof(IndexScanDescData)); 70 { 73 scan = (IndexScanDesc) palloc(sizeof(IndexScanDescData)); 70 { 73 scan = (IndexScanDesc) palloc(sizeof(IndexScanDescData)); MemoryContextAlloc (context=0x9a8cd38, size=108) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a8fc30, size=1) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=108) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } RelationGetIndexScan (indexRelation=0x9a8fc30, nkeys=1, key=0xbffe0cf0) at genam.c:84 84 if (nkeys > 0) 73 scan = (IndexScanDesc) palloc(sizeof(IndexScanDescData)); 75 scan->heapRelation = NULL; /* may be set later */ 76 scan->indexRelation = indexRelation; 77 scan->xs_snapshot = SnapshotNow; /* may be set later */ 78 scan->numberOfKeys = nkeys; 84 if (nkeys > 0) 85 scan->keyData = (ScanKey) palloc(sizeof(ScanKeyData) * nkeys); MemoryContextAlloc (context=0x9a8cd38, size=36) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a8fc30, size=1) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=36) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } RelationGetIndexScan (indexRelation=0x9a8fc30, nkeys=1, key=0xbffe0cf0) at genam.c:110 110 pgstat_initstats(&scan->xs_pgstat_info, indexRelation); 89 scan->kill_prior_tuple = false; 90 scan->ignore_killed_tuples = true; /* default setting */ 91 scan->keys_are_unique = false; /* may be set by index AM */ 92 scan->got_tuple = false; 94 scan->opaque = NULL; 96 ItemPointerSetInvalid(&scan->currentItemData); 97 ItemPointerSetInvalid(&scan->currentMarkData); 99 ItemPointerSetInvalid(&scan->xs_ctup.t_self); 100 scan->xs_ctup.t_datamcxt = NULL; 101 scan->xs_ctup.t_data = NULL; 102 scan->xs_cbuf = InvalidBuffer; 105 scan->fn_getnext.fn_oid = InvalidOid; 107 scan->unique_tuple_pos = 0; 108 scan->unique_tuple_mark = 0; 110 pgstat_initstats(&scan->xs_pgstat_info, indexRelation); pgstat_initstats (stats=0x9aa7d54, rel=0x9a8fc30) at pgstat.c:919 919 Oid rel_id = rel->rd_id; 928 stats->tabentry = NULL; 929 stats->no_stats = FALSE; 930 stats->heap_scan_counted = FALSE; 931 stats->index_scan_counted = FALSE; 933 if (pgStatSock < 0 || 979 stats->no_stats = TRUE; 995 } RelationGetIndexScan (indexRelation=0x9a8fc30, nkeys=1, key=0xbffe0cf0) at genam.c:115 115 index_rescan(scan, key); index_rescan (scan=0x9aa7cf0, key=0xbffe0cf0) at indexam.c:313 313 { 317 GET_SCAN_PROCEDURE(rescan, amrescan); 319 scan->kill_prior_tuple = false; /* for safety */ 320 scan->keys_are_unique = false; /* may be set by index AM */ 321 scan->got_tuple = false; 322 scan->unique_tuple_pos = 0; 323 scan->unique_tuple_mark = 0; 325 OidFunctionCall2(procedure, OidFunctionCall2 (functionId=334, arg1=162168048, arg2=3221097712) at fmgr.c:1226 1226 fmgr_info(functionId, &flinfo); fmgr_info (functionId=334, finfo=0xbffe0ab0) at fmgr.c:133 133 fmgr_info_cxt(functionId, finfo, CurrentMemoryContext); fmgr_info_cxt (functionId=162070528, finfo=0x9a8fc30, mcxt=0x40) at fmgr.c:143 143 fmgr_info_cxt_security(functionId, finfo, mcxt, false); 142 { 143 fmgr_info_cxt_security(functionId, finfo, mcxt, false); fmgr_info_cxt_security (functionId=334, finfo=0xbffe0ab0, mcxt=0x9a8cd38, ignore_security=0 '\0') at fmgr.c:154 154 { 165 finfo->fn_oid = InvalidOid; 166 finfo->fn_extra = NULL; 167 finfo->fn_mcxt = mcxt; 78 int high = fmgr_nbuiltins - 1; 154 { 167 finfo->fn_mcxt = mcxt; 168 finfo->fn_expr = NULL; /* caller may set this later */ 77 int low = 0; 78 int high = fmgr_nbuiltins - 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 76 { 176 finfo->fn_nargs = fbp->nargs; 177 finfo->fn_strict = fbp->strict; 178 finfo->fn_retset = fbp->retset; 179 finfo->fn_addr = fbp->func; 180 finfo->fn_oid = functionId; 245 } 0x081b6893 in fmgr_info (functionId=334, finfo=0xbffe0ab0) at fmgr.c:133 133 fmgr_info_cxt(functionId, finfo, CurrentMemoryContext); OidFunctionCall2 (functionId=334, arg1=162168048, arg2=3221097712) at fmgr.c:1228 1228 MemSet(&fcinfo, 0, sizeof(fcinfo)); 1231 fcinfo.arg[0] = arg1; 1234 result = FunctionCallInvoke(&fcinfo); 1231 fcinfo.arg[0] = arg1; 1232 fcinfo.arg[1] = arg2; 1229 fcinfo.flinfo = &flinfo; 1230 fcinfo.nargs = 2; 1232 fcinfo.arg[1] = arg2; 1234 result = FunctionCallInvoke(&fcinfo); btrescan (fcinfo=0xbffe0a00) at nbtree.c:382 382 { 383 IndexScanDesc scan = (IndexScanDesc) PG_GETARG_POINTER(0); 384 ScanKey scankey = (ScanKey) PG_GETARG_POINTER(1); 388 so = (BTScanOpaque) scan->opaque; 390 if (so == NULL) /* if called from btbeginscan */ 392 so = (BTScanOpaque) palloc(sizeof(BTScanOpaqueData)); MemoryContextAlloc (context=0x9a8cd38, size=36) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0xbffe0a00, size=3221097136) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=36) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } btrescan (fcinfo=0xbffe0a00) at nbtree.c:393 393 so->btso_curbuf = so->btso_mrkbuf = InvalidBuffer; 394 ItemPointerSetInvalid(&(so->curHeapIptr)); 395 ItemPointerSetInvalid(&(so->mrkHeapIptr)); 392 so = (BTScanOpaque) palloc(sizeof(BTScanOpaqueData)); 396 if (scan->numberOfKeys > 0) 397 so->keyData = (ScanKey) palloc(scan->numberOfKeys * sizeof(ScanKeyData)); MemoryContextAlloc (context=0x9a8cd38, size=36) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0xbffe0a00, size=3221097136) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=36) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } btrescan (fcinfo=0xbffe0a00) at nbtree.c:400 400 so->numberOfKeys = scan->numberOfKeys; 401 scan->opaque = so; 405 if (ItemPointerIsValid(iptr = &(scan->currentItemData))) 413 if (ItemPointerIsValid(iptr = &(scan->currentMarkData))) 425 if (scankey && scan->numberOfKeys > 0) 427 memmove(scan->keyData, 430 so->numberOfKeys = scan->numberOfKeys; 431 memmove(so->keyData, 437 } OidFunctionCall2 (functionId=334, arg1=162168048, arg2=3221097712) at fmgr.c:1237 1237 if (fcinfo.isnull) 1234 result = FunctionCallInvoke(&fcinfo); 1237 if (fcinfo.isnull) 1241 } index_rescan (scan=0x9aa7cf0, key=0xbffe0cf0) at indexam.c:329 329 pgstat_reset_index_scan(&scan->xs_pgstat_info); 330 } RelationGetIndexScan (indexRelation=0x9a8fc30, nkeys=1, key=0xbffe0cf0) at genam.c:118 118 } btbeginscan (fcinfo=0x9aa7cf0) at nbtree.c:375 375 } OidFunctionCall3 (functionId=333, arg1=162069552, arg2=1, arg3=3221097712) at fmgr.c:1263 1263 if (fcinfo.isnull) 1260 result = FunctionCallInvoke(&fcinfo); 1263 if (fcinfo.isnull) 1267 } index_beginscan (heapRelation=0x9a83d98, indexRelation=0x9a8fc30, snapshot=0x0, nkeys=1, key=0xbffe0cf0) at indexam.c:285 285 scan->heapRelation = heapRelation; 286 scan->xs_snapshot = snapshot; 293 GET_SCAN_PROCEDURE(beginscan, amgettuple); 294 fmgr_info(procedure, &scan->fn_getnext); fmgr_info (functionId=330, finfo=0x9aa7d34) at fmgr.c:133 133 fmgr_info_cxt(functionId, finfo, CurrentMemoryContext); fmgr_info_cxt (functionId=162168116, finfo=0x9aa7dc0, mcxt=0x0) at fmgr.c:143 143 fmgr_info_cxt_security(functionId, finfo, mcxt, false); 142 { 143 fmgr_info_cxt_security(functionId, finfo, mcxt, false); fmgr_info_cxt_security (functionId=330, finfo=0x9aa7d34, mcxt=0x9a8cd38, ignore_security=0 '\0') at fmgr.c:154 154 { 165 finfo->fn_oid = InvalidOid; 166 finfo->fn_extra = NULL; 167 finfo->fn_mcxt = mcxt; 78 int high = fmgr_nbuiltins - 1; 154 { 167 finfo->fn_mcxt = mcxt; 168 finfo->fn_expr = NULL; /* caller may set this later */ 77 int low = 0; 78 int high = fmgr_nbuiltins - 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 76 { 176 finfo->fn_nargs = fbp->nargs; 177 finfo->fn_strict = fbp->strict; 178 finfo->fn_retset = fbp->retset; 179 finfo->fn_addr = fbp->func; 180 finfo->fn_oid = functionId; 245 } 0x081b6893 in fmgr_info (functionId=330, finfo=0x9aa7d34) at fmgr.c:133 133 fmgr_info_cxt(functionId, finfo, CurrentMemoryContext); index_beginscan (heapRelation=0x9a83d98, indexRelation=0x9a8fc30, snapshot=0x0, nkeys=1, key=0xbffe0cf0) at indexam.c:297 297 } systable_beginscan (heapRelation=0x9a83d98, indexRelname=0x822f5c9 "pg_shadow_usesysid_index", indexOK=1 '\001', snapshot=0x0, nkeys=1, key=0xbffe0cf0) at genam.c:227 227 sysscan->scan = NULL; 236 } SearchCatCache (cache=0xb73050c8, v1=213, v2=0, v3=0, v4=0) at catcache.c:1209 1209 while (HeapTupleIsValid(ntp = systable_getnext(scandesc))) 1214 break; /* assume only one match */ 1020 { 1214 break; /* assume only one match */ systable_getnext (sysscan=0x9aa7cd8) at genam.c:249 249 { 252 if (sysscan->irel) 253 htup = index_getnext(sysscan->iscan, ForwardScanDirection); index_getnext (scan=0x9aa7cf0, direction=ForwardScanDirection) at indexam.c:417 417 { 423 if (BufferIsValid(scan->xs_cbuf)) 418 HeapTuple heapTuple = &scan->xs_ctup; 423 if (BufferIsValid(scan->xs_cbuf)) 445 if (scan->keys_are_unique && scan->got_tuple) 490 scan->kill_prior_tuple = false; 497 pgstat_count_index_scan(&scan->xs_pgstat_info); 503 found = DatumGetBool(FunctionCall2(&scan->fn_getnext, FunctionCall2 (flinfo=0x9aa7d34, arg1=162168048, arg2=1) at fmgr.c:988 988 fcinfo.arg[0] = arg1; 989 fcinfo.arg[1] = arg2; 977 { 989 fcinfo.arg[1] = arg2; 993 result = FunctionCallInvoke(&fcinfo); 982 fcinfo.context = NULL; 983 fcinfo.resultinfo = NULL; 984 fcinfo.isnull = false; 986 fcinfo.flinfo = flinfo; 987 fcinfo.nargs = 2; 990 fcinfo.argnull[0] = false; 991 fcinfo.argnull[1] = false; 993 result = FunctionCallInvoke(&fcinfo); btgettuple (fcinfo=0xbffe0bb0) at nbtree.c:277 277 { 278 IndexScanDesc scan = (IndexScanDesc) PG_GETARG_POINTER(0); 279 ScanDirection dir = (ScanDirection) PG_GETARG_INT32(1); 280 BTScanOpaque so = (BTScanOpaque) scan->opaque; 290 if (ItemPointerIsValid(&(scan->currentItemData))) 280 BTScanOpaque so = (BTScanOpaque) scan->opaque; 290 if (ItemPointerIsValid(&(scan->currentItemData))) 326 res = _bt_first(scan, dir); _bt_first (scan=0x9aa7cf0, dir=ForwardScanDirection) at nbtsearch.c:438 438 Relation rel = scan->indexRelation; 439 BTScanOpaque so = (BTScanOpaque) scan->opaque; 464 _bt_orderkeys(scan); 439 BTScanOpaque so = (BTScanOpaque) scan->opaque; 454 int keysCount = 0; 464 _bt_orderkeys(scan); _bt_orderkeys (scan=0x9aa7cf0) at nbtutils.c:204 204 Relation relation = scan->indexRelation; 205 BTScanOpaque so = (BTScanOpaque) scan->opaque; 208 int numberOfKeys = so->numberOfKeys; 219 so->qual_ok = true; 220 so->numberOfRequiredKeys = 0; 221 scan->keys_are_unique = false; 223 if (numberOfKeys < 1) 221 scan->keys_are_unique = false; 223 if (numberOfKeys < 1) 226 key = so->keyData; 227 cur = &key[0]; 229 if (cur->sk_attno != 1) 233 if (numberOfKeys == 1) 240 if (cur->sk_flags & SK_ISNULL) 242 else if (relation->rd_index->indisunique && 246 map = IndexStrategyGetStrategyMap(RelationGetIndexStrategy(relation), IndexStrategyGetStrategyMap (indexStrategy=0x9a9f5f8, maxStrategyNum=5, attrNum=1) at istrat.c:84 84 return &indexStrategy->strategyMapData[maxStrategyNum * (attrNum - 1)]; 85 } _bt_orderkeys (scan=0x9aa7cf0) at nbtutils.c:249 249 j = _bt_getstrategynumber(cur->sk_procedure, map); _bt_getstrategynumber (sk_procedure=65, map=0x9a9f5f8) at nbtutils.c:456 456 { 459 for (j = BTMaxStrategyNumber; --j >= 0;) 461 if (sk_procedure == map->entry[j].sk_procedure) 459 for (j = BTMaxStrategyNumber; --j >= 0;) 461 if (sk_procedure == map->entry[j].sk_procedure) 459 for (j = BTMaxStrategyNumber; --j >= 0;) 461 if (sk_procedure == map->entry[j].sk_procedure) 466 } _bt_orderkeys (scan=0x9aa7cf0) at nbtutils.c:250 250 if (j == (BTEqualStrategyNumber - 1)) 251 scan->keys_are_unique = true; 253 so->numberOfRequiredKeys = 1; 447 } _bt_first (scan=0x9aa7cf0, dir=ForwardScanDirection) at nbtsearch.c:470 470 if (!so->qual_ok) 471 return false; 470 if (!so->qual_ok) 477 strat_total = BTEqualStrategyNumber; 478 if (so->numberOfKeys > 0) 480 nKeyIs = (int *) palloc(so->numberOfKeys * sizeof(int)); MemoryContextAlloc (context=0x9a8cd38, size=4) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9aa7cf0, size=1) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=4) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } _bt_first (scan=0x9aa7cf0, dir=ForwardScanDirection) at nbtsearch.c:481 481 for (i = 0; i < so->numberOfKeys; i++) 483 AttrNumber attno = so->keyData[i].sk_attno; 486 if (attno <= keysCount) 489 if (attno > keysCount + 1) 491 strat = _bt_getstrat(rel, attno, _bt_getstrat (rel=0x9a8fc30, attno=1, proc=65) at nbtstrat.c:118 118 strat = RelationGetStrategy(rel, attno, &BTEvaluationData, proc); RelationGetStrategy (relation=0x9a8fc30, attributeNumber=1, evaluation=0x8238458, procedure=65) at istrat.c:276 276 strategyMap = IndexStrategyGetStrategyMap(RelationGetIndexStrategy(relation), 260 { 276 strategyMap = IndexStrategyGetStrategyMap(RelationGetIndexStrategy(relation), IndexStrategyGetStrategyMap (indexStrategy=0x9a9f5f8, maxStrategyNum=5, attrNum=1) at istrat.c:84 84 return &indexStrategy->strategyMapData[maxStrategyNum * (attrNum - 1)]; 85 } RelationGetStrategy (relation=0x9a8fc30, attributeNumber=) at istrat.c:281 281 for (index = 0; index < evaluation->maxStrategy; index += 1) 276 strategyMap = IndexStrategyGetStrategyMap(RelationGetIndexStrategy(relation), 281 for (index = 0; index < evaluation->maxStrategy; index += 1) 283 if (strategyMap->entry[index].sk_procedure == procedure) 281 for (index = 0; index < evaluation->maxStrategy; index += 1) 283 if (strategyMap->entry[index].sk_procedure == procedure) 281 for (index = 0; index < evaluation->maxStrategy; index += 1) 283 if (strategyMap->entry[index].sk_procedure == procedure) 287 if (index == evaluation->maxStrategy) 288 return InvalidStrategy; 287 if (index == evaluation->maxStrategy) 290 strategy = 1 + index; 291 entry = StrategyMapGetScanKeyEntry(strategyMap, strategy); StrategyMapGetScanKeyEntry (map=0x9a9f5f8, strategyNumber=3) at istrat.c:62 62 return &map->entry[strategyNumber - 1]; 63 } RelationGetStrategy (relation=0x9a8fc30, attributeNumber=) at istrat.c:295 295 switch (entry->sk_flags & (SK_NEGATE | SK_COMMUTE)) 298 return strategy; 295 switch (entry->sk_flags & (SK_NEGATE | SK_COMMUTE)) 324 } _bt_getstrat (rel=0x9a8fc30, attno=) at nbtstrat.c:122 122 return strat; 123 } _bt_first (scan=0x9aa7cf0, dir=ForwardScanDirection) at nbtsearch.c:500 500 if (strat == strat_total || 491 strat = _bt_getstrat(rel, attno, 500 if (strat == strat_total || 502 nKeyIs[keysCount++] = i; 522 if (keysCount == 0) 540 scankeys = (ScanKey) palloc(keysCount * sizeof(ScanKeyData)); 541 for (i = 0; i < keysCount; i++) 540 scankeys = (ScanKey) palloc(keysCount * sizeof(ScanKeyData)); MemoryContextAlloc (context=0x9a8cd38, size=36) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9aa7cf0, size=1) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=36) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } _bt_first (scan=0x9aa7cf0, dir=ForwardScanDirection) at nbtsearch.c:541 541 for (i = 0; i < keysCount; i++) 540 scankeys = (ScanKey) palloc(keysCount * sizeof(ScanKeyData)); 541 for (i = 0; i < keysCount; i++) 545 j = nKeyIs[i]; 551 if (so->keyData[j].sk_flags & SK_ISNULL) 558 procinfo = index_getprocinfo(rel, i + 1, BTORDER_PROC); index_getprocinfo (irel=0x9a8fc30, attnum=1, procnum=1) at indexam.c:728 728 { 733 nproc = irel->rd_am->amsupport; 737 procindex = (nproc * (attnum - 1)) + (procnum - 1); 743 locinfo += procindex; 746 if (locinfo->fn_oid == InvalidOid) 748 RegProcedure *loc = irel->rd_support; 753 procId = loc[procindex]; 762 if (!RegProcedureIsValid(procId)) 753 procId = loc[procindex]; 762 if (!RegProcedureIsValid(procId)) 766 fmgr_info_cxt(procId, locinfo, irel->rd_indexcxt); fmgr_info_cxt (functionId=162133800, finfo=0x15f, mcxt=0x9aa7dc0) at fmgr.c:143 143 fmgr_info_cxt_security(functionId, finfo, mcxt, false); 142 { 143 fmgr_info_cxt_security(functionId, finfo, mcxt, false); fmgr_info_cxt_security (functionId=351, finfo=0x9a9f740, mcxt=0x9a8c7e8, ignore_security=0 '\0') at fmgr.c:154 154 { 165 finfo->fn_oid = InvalidOid; 166 finfo->fn_extra = NULL; 167 finfo->fn_mcxt = mcxt; 78 int high = fmgr_nbuiltins - 1; 154 { 167 finfo->fn_mcxt = mcxt; 168 finfo->fn_expr = NULL; /* caller may set this later */ 77 int low = 0; 78 int high = fmgr_nbuiltins - 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 92 low = i + 1; 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 91 else if (id > ptr->foid) 94 high = i - 1; 86 int i = (high + low) / 2; 87 const FmgrBuiltin *ptr = &fmgr_builtins[i]; 89 if (id == ptr->foid) 76 { 176 finfo->fn_nargs = fbp->nargs; 177 finfo->fn_strict = fbp->strict; 178 finfo->fn_retset = fbp->retset; 179 finfo->fn_addr = fbp->func; 180 finfo->fn_oid = functionId; 245 } index_getprocinfo (irel=0x9a8fc30, attnum=1, procnum=1) at indexam.c:770 770 } _bt_first (scan=0x9aa7cf0, dir=ForwardScanDirection) at nbtsearch.c:559 559 ScanKeyEntryInitializeWithInfo(scankeys + i, 541 for (i = 0; i < keysCount; i++) 559 ScanKeyEntryInitializeWithInfo(scankeys + i, ScanKeyEntryInitializeWithInfo (entry=0x9aa7e08, flags=0, attributeNumber=1, finfo=0x9aa7dc0, mcxt=0x0, argument=0) at scankey.c:88 88 { 92 entry->sk_flags = flags; 88 { 92 entry->sk_flags = flags; 93 entry->sk_attno = attributeNumber; 94 entry->sk_procedure = finfo->fn_oid; 95 entry->sk_argument = argument; 96 fmgr_info_copy(&entry->sk_func, finfo, mcxt); fmgr_info_copy (dstinfo=0x9aa7e70, srcinfo=0x9a9f740, destcxt=0x9a8cd38) at fmgr.c:423 423 { 424 memcpy(dstinfo, srcinfo, sizeof(FmgrInfo)); 423 { 424 memcpy(dstinfo, srcinfo, sizeof(FmgrInfo)); 426 if (dstinfo->fn_addr == fmgr_oldstyle) 425 dstinfo->fn_mcxt = destcxt; 426 if (dstinfo->fn_addr == fmgr_oldstyle) 437 dstinfo->fn_extra = NULL; 438 } _bt_first (scan=0x9aa7cf0, dir=ForwardScanDirection) at nbtsearch.c:541 541 for (i = 0; i < keysCount; i++) 566 if (nKeyIs) 567 pfree(nKeyIs); pfree (pointer=0x9aa7e50) at mcxt.c:544 544 { 563 (*header->context->methods->free_p) (header->context, pointer); AllocSetFree (context=0x9a8cd38, pointer=0x9aa7e50) at aset.c:753 753 { 755 AllocChunk chunk = AllocPointerGetChunk(pointer); 753 { 767 if (chunk->size > ALLOC_CHUNK_LIMIT) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 805 chunk->aset = (void *) set->freelist[fidx]; 816 set->freelist[fidx] = chunk; 818 } 0x081c03c0 in pfree (pointer=0x0) at mcxt.c:563 563 (*header->context->methods->free_p) (header->context, pointer); _bt_first (scan=0x9aa7cf0, dir=ForwardScanDirection) at nbtsearch.c:575 575 stack = _bt_search(rel, keysCount, scankeys, &buf, BT_READ); 569 current = &(scan->currentItemData); 575 stack = _bt_search(rel, keysCount, scankeys, &buf, BT_READ); _bt_search (rel=0x9a8fc30, keysz=1, scankey=0x9aa7e68, bufP=0xbffe0b18, access=1) at nbtsearch.c:43 43 BTStack stack_in = NULL; 46 *bufP = _bt_getroot(rel, access); _bt_getroot (rel=0x9a8fc30, access=1) at nbtpage.c:135 135 { 146 metabuf = _bt_getbuf(rel, BTREE_METAPAGE, BT_READ); _bt_getbuf (rel=0x9a8fc30, blkno=0, access=1) at nbtpage.c:395 395 { 398 if (blkno != P_NEW) 395 { 398 if (blkno != P_NEW) 401 buf = ReadBuffer(rel, blkno); ReadBuffer (reln=0x0, blockNum=0) at bufmgr.c:117 117 { 118 return ReadBufferInternal(reln, blockNum, false); 119 } ReadBuffer (reln=0x9a8fc30, blockNum=0) at bufmgr.c:118 118 return ReadBufferInternal(reln, blockNum, false); ReadBufferInternal (reln=0x9a8fc30, blockNum=0, bufferLockHeld=0 '\0') at bufmgr.c:130 130 { 137 isExtend = (blockNum == P_NEW); 130 { 138 isLocalBuf = reln->rd_istemp; 140 if (isLocalBuf) 130 { 138 isLocalBuf = reln->rd_istemp; 140 if (isLocalBuf) 159 ReadBufferCount++; 160 pgstat_count_buffer_read(&reln->pgstat_info, reln); 162 if (isExtend) 173 if (!bufferLockHeld) 174 LWLockAcquire(BufMgrLock, LW_EXCLUSIVE); LWLockAcquire (lockid=BufMgrLock, mode=LW_EXCLUSIVE) at lwlock.c:218 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 200 PGPROC *proc = MyProc; 199 volatile LWLock *lock = LWLockArray + lockid; 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 201 bool retry = false; 202 int extraWaits = 0; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 245 if (retry) 249 if (mode == LW_EXCLUSIVE) 251 if (lock->exclusive == 0 && lock->shared == 0) 253 lock->exclusive++; 325 SpinLockRelease_NoHoldoff(&lock->mutex); 329 held_lwlocks[num_held_lwlocks++] = lockid; 335 PGSemaphoreUnlock(&proc->sem); ReadBufferInternal (reln=0x9a8fc30, blockNum=0, bufferLockHeld=0 '\0') at bufmgr.c:324 324 INIT_BUFFERTAG(&newTag, reln, blockNum); 327 buf = BufTableLookup(&newTag); 324 INIT_BUFFERTAG(&newTag, reln, blockNum); 327 buf = BufTableLookup(&newTag); 324 INIT_BUFFERTAG(&newTag, reln, blockNum); 327 buf = BufTableLookup(&newTag); BufTableLookup (tagPtr=0xbffe09d0) at buf_table.c:63 63 { 67 return NULL; 66 if (tagPtr->blockNum == P_NEW) 69 result = (BufferLookupEnt *) hash_search (hashp=0x9a69110, keyPtr=0xbffe09d0, action=HASH_FIND, foundPtr=0x0) at dynahash.c:515 515 HASHHDR *hctl = hashp->hctl; 538 if (action == HASH_REMOVE_SAVED) 515 HASHHDR *hctl = hashp->hctl; 516 uint32 hashvalue = 0; 538 if (action == HASH_REMOVE_SAVED) 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); tag_hash (key=0x9a69110, keysize=12) at hashfn.c:42 42 } tag_hash (key=0x9a69110, keysize=3221096912) at hashfn.c:40 40 return DatumGetUInt32(hash_any((const unsigned char *) key, hash_any (k=0xbffe09d0 "", keylen=12) at hashfunc.c:201 201 { 208 len = keylen; 201 { 209 a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */ 210 c = 3923095; /* initialize with an arbitrary value */ 220 len -= 12; 208 len = keylen; 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 218 mix(a, b, c); 220 len -= 12; 218 mix(a, b, c); 219 k += 12; 220 len -= 12; 224 c += keylen; 225 switch (len) /* all the case statements fall through */ 252 mix(a, b, c); 255 } 252 mix(a, b, c); 255 } hash_search (hashp=0x9a69110, keyPtr=0xbffe09d0, action=HASH_FIND, foundPtr=0x0) at dynahash.c:478 478 bucket = hash_val & hctl->high_mask; 475 { 479 if (bucket > hctl->max_bucket) 480 bucket = bucket & hctl->low_mask; 558 segment_ndx = MOD(bucket, hctl->ssize); 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 562 if (segp == NULL) 571 match = hashp->match; /* save one fetch in inner loop */ 565 prevBucketPtr = &segp[segment_ndx]; 571 match = hashp->match; /* save one fetch in inner loop */ 566 currBucket = *prevBucketPtr; 571 match = hashp->match; /* save one fetch in inner loop */ 578 currBucket = *prevBucketPtr; 586 if (foundPtr) 592 switch (action) 597 return NULL; 595 if (currBucket != NULL) 676 } BufTableLookup (tagPtr=0xbffe09d0) at buf_table.c:71 71 if (!result) 72 return NULL; 71 if (!result) 75 } ReadBufferInternal (reln=0x9a8fc30, blockNum=0, bufferLockHeld=0 '\0') at bufmgr.c:328 328 if (buf != NULL) 327 buf = BufTableLookup(&newTag); 328 if (buf != NULL) 378 *foundPtr = FALSE; 385 inProgress = FALSE; 388 buf = GetFreeBuffer(); GetFreeBuffer () at freelist.c:198 198 if (Free_List_Descriptor == SharedFreeList->freeNext) 206 buf = &(BufferDescriptors[SharedFreeList->freeNext]); 209 BufferDescriptors[buf->freeNext].freePrev = buf->freePrev; 210 BufferDescriptors[buf->freePrev].freeNext = buf->freeNext; 211 buf->freeNext = buf->freePrev = INVALID_DESCRIPTOR; 213 buf->flags &= ~(BM_FREE); 215 return buf; 216 } ReadBufferInternal (reln=0x9a8fc30, blockNum=0, bufferLockHeld=0 '\0') at bufmgr.c:400 400 buf->refcount = 1; 388 buf = GetFreeBuffer(); 401 PrivateRefCount[BufferDescriptorGetBuffer(buf) - 1] = 1; 403 if (buf->flags & BM_DIRTY || buf->cntxDirty) 386 for (buf = (BufferDesc *) NULL; buf == (BufferDesc *) NULL;) 553 if (!BufTableDelete(buf)) BufTableDelete (buf=0xb733a3c8) at buf_table.c:89 89 if (buf->flags & BM_DELETED) 110 } ReadBufferInternal (reln=0x9a8fc30, blockNum=0, bufferLockHeld=0 '\0') at bufmgr.c:559 559 INIT_BUFFERTAG(&(buf->tag), reln, blockNum); 561 if (!BufTableInsert(buf)) 559 INIT_BUFFERTAG(&(buf->tag), reln, blockNum); 561 if (!BufTableInsert(buf)) BufTableInsert (buf=0xb733a3c8) at buf_table.c:114 114 { 122 result = (BufferLookupEnt *) 120 buf->flags &= ~(BM_DELETED); 122 result = (BufferLookupEnt *) hash_search (hashp=0x9a69110, keyPtr=0xb733a3d4, action=HASH_ENTER, foundPtr=0xbffe098f "") at dynahash.c:515 515 HASHHDR *hctl = hashp->hctl; 538 if (action == HASH_REMOVE_SAVED) 515 HASHHDR *hctl = hashp->hctl; 516 uint32 hashvalue = 0; 538 if (action == HASH_REMOVE_SAVED) 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); 552 Size keysize = hctl->keysize; 554 hashvalue = hashp->hash(keyPtr, keysize); tag_hash (key=0x9a69110, keysize=12) at hashfn.c:42 42 } tag_hash (key=0x9a69110, keysize=3073614804) at hashfn.c:40 40 return DatumGetUInt32(hash_any((const unsigned char *) key, hash_any (k=0xb733a3d4 "", keylen=12) at hashfunc.c:201 201 { 208 len = keylen; 201 { 209 a = b = 0x9e3779b9; /* the golden ratio; an arbitrary value */ 210 c = 3923095; /* initialize with an arbitrary value */ 220 len -= 12; 208 len = keylen; 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 215 a += (k[0] + ((uint32) k[1] << 8) + ((uint32) k[2] << 16) + ((uint32) k[3] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 216 b += (k[4] + ((uint32) k[5] << 8) + ((uint32) k[6] << 16) + ((uint32) k[7] << 24)); 217 c += (k[8] + ((uint32) k[9] << 8) + ((uint32) k[10] << 16) + ((uint32) k[11] << 24)); 218 mix(a, b, c); 220 len -= 12; 218 mix(a, b, c); 219 k += 12; 220 len -= 12; 224 c += keylen; 225 switch (len) /* all the case statements fall through */ 252 mix(a, b, c); 255 } 252 mix(a, b, c); 255 } hash_search (hashp=0x9a69110, keyPtr=0xb733a3d4, action=HASH_ENTER, foundPtr=0xbffe098f "") at dynahash.c:478 478 bucket = hash_val & hctl->high_mask; 475 { 479 if (bucket > hctl->max_bucket) 480 bucket = bucket & hctl->low_mask; 558 segment_ndx = MOD(bucket, hctl->ssize); 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 557 segment_num = bucket >> hctl->sshift; 558 segment_ndx = MOD(bucket, hctl->ssize); 560 segp = hashp->dir[segment_num]; 562 if (segp == NULL) 571 match = hashp->match; /* save one fetch in inner loop */ 565 prevBucketPtr = &segp[segment_ndx]; 571 match = hashp->match; /* save one fetch in inner loop */ 566 currBucket = *prevBucketPtr; 571 match = hashp->match; /* save one fetch in inner loop */ 578 currBucket = *prevBucketPtr; 586 if (foundPtr) 587 *foundPtr = (bool) (currBucket != NULL); 592 switch (action) 633 if (currBucket != NULL) 637 currBucket = hctl->freeList; 638 if (currBucket == NULL) 647 hctl->freeList = currBucket->link; 650 *prevBucketPtr = currBucket; 651 currBucket->link = NULL; 654 currBucket->hashvalue = hashvalue; 655 hashp->keycopy(ELEMENTKEY(currBucket), keyPtr, hctl->keysize); 660 if (++hctl->nentries / (long) (hctl->max_bucket + 1) > hctl->ffactor) 670 return (void *) ELEMENTKEY(currBucket); 676 } BufTableInsert (buf=0xb733a3c8) at buf_table.c:125 125 if (!result) 122 result = (BufferLookupEnt *) 125 if (!result) 130 if (found) /* found something else in the table? */ 133 result->id = buf->buf_id; 135 } ReadBufferInternal (reln=0x9a8fc30, blockNum=0, bufferLockHeld=0 '\0') at bufmgr.c:573 573 if (!inProgress) 574 StartBufferIO(buf, true); StartBufferIO (buf=0xb733a3c8, forInput=1 '\001') at bufmgr.c:2076 2076 LWLockAcquire(buf->io_in_progress_lock, LW_EXCLUSIVE); 2074 buf->flags |= BM_IO_IN_PROGRESS; 2076 LWLockAcquire(buf->io_in_progress_lock, LW_EXCLUSIVE); 2071 { 2076 LWLockAcquire(buf->io_in_progress_lock, LW_EXCLUSIVE); 2071 { 2076 LWLockAcquire(buf->io_in_progress_lock, LW_EXCLUSIVE); LWLockAcquire (lockid=43, mode=LW_EXCLUSIVE) at lwlock.c:218 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 200 PGPROC *proc = MyProc; 199 volatile LWLock *lock = LWLockArray + lockid; 218 HOLD_INTERRUPTS(); 199 volatile LWLock *lock = LWLockArray + lockid; 201 bool retry = false; 202 int extraWaits = 0; 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 245 if (retry) 249 if (mode == LW_EXCLUSIVE) 251 if (lock->exclusive == 0 && lock->shared == 0) 253 lock->exclusive++; 325 SpinLockRelease_NoHoldoff(&lock->mutex); 329 held_lwlocks[num_held_lwlocks++] = lockid; 335 PGSemaphoreUnlock(&proc->sem); StartBufferIO (buf=0xb733a3c8, forInput=1 '\001') at bufmgr.c:2079 2079 IsForInput = forInput; 2078 InProgressBuf = buf; 2079 IsForInput = forInput; ReadBufferInternal (reln=0x9a8fc30, blockNum=0, bufferLockHeld=0 '\0') at bufmgr.c:582 582 LWLockRelease(BufMgrLock); LWLockRelease (lockid=BufMgrLock) at lwlock.c:409 409 { 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 410 volatile LWLock *lock = LWLockArray + lockid; 421 for (i = num_held_lwlocks; --i >= 0;) 423 if (lockid == held_lwlocks[i]) 421 for (i = num_held_lwlocks; --i >= 0;) 423 if (lockid == held_lwlocks[i]) 426 if (i < 0) 428 num_held_lwlocks--; 430 held_lwlocks[i] = held_lwlocks[i + 1]; 429 for (; i < num_held_lwlocks; i++) 103 register slock_t _res = 1; 105 __asm__ __volatile__( 102 { 436 if (lock->exclusive > 0) 437 lock->exclusive--; 450 head = lock->head; 451 if (head != NULL) 481 SpinLockRelease_NoHoldoff(&lock->mutex); 499 RESUME_INTERRUPTS(); ReadBufferInternal (reln=0x9a8fc30, blockNum=0, bufferLockHeld=0 '\0') at bufmgr.c:176 176 if (found) 316 { 176 if (found) 186 return InvalidBuffer; 185 if (!bufHdr) 189 if (found) 215 if (isExtend) 224 status = smgrread(DEFAULT_SMGR, reln, blockNum, smgrread (which=0, reln=0x9a8fc30, blocknum=0, buffer=0xb735ad20 "") at smgr.c:316 316 status = (*(smgrsw[which].smgr_read)) (reln, blocknum, buffer); 313 { 316 status = (*(smgrsw[which].smgr_read)) (reln, blocknum, buffer); 313 { 316 status = (*(smgrsw[which].smgr_read)) (reln, blocknum, buffer); mdread (reln=0x9a8fc30, blocknum=0, buffer=0xb735ad20 "") at md.c:411 411 { 417 v = _mdfd_getseg(reln, blocknum); _mdfd_getseg (reln=0x9a8fc30, blkno=0) at md.c:889 889 { 898 fd = _mdfd_getrelnfd(reln); _mdfd_getrelnfd (reln=0x9a8fc30) at md.c:874 874 fd = RelationGetFile(reln); 875 if (fd < 0) 871 { 875 if (fd < 0) 877 if ((fd = mdopen(reln)) < 0) mdopen (reln=0x9a8fc30) at md.c:306 306 path = relpath(reln->rd_node); relpath (rnode={tblNode = 0, relNode = 16646}) at catalog.c:34 34 { 37 if (rnode.tblNode == (Oid) 0) /* "global tablespace" */ 34 { 37 if (rnode.tblNode == (Oid) 0) /* "global tablespace" */ 40 path = (char *) palloc(strlen(DataDir) + 8 + sizeof(NameData) + 1); MemoryContextAlloc (context=0x9a8cd38, size=87) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x0, size=16646) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=87) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } relpath (rnode={tblNode = 0, relNode = 16646}) at catalog.c:41 41 sprintf(path, "%s/global/%u", DataDir, rnode.relNode); 40 path = (char *) palloc(strlen(DataDir) + 8 + sizeof(NameData) + 1); 41 sprintf(path, "%s/global/%u", DataDir, rnode.relNode); 46 sprintf(path, "%s/base/%u/%u", DataDir, rnode.tblNode, rnode.relNode); 49 } mdopen (reln=0x9a8fc30) at md.c:308 308 fd = FileNameOpenFile(path, O_RDWR | PG_BINARY, 0600); 306 path = relpath(reln->rd_node); 308 fd = FileNameOpenFile(path, O_RDWR | PG_BINARY, 0600); FileNameOpenFile (fileName=0x9aa7eb0 "/usr/pgsql/sev/global/16646", fileFlags=2, fileMode=384) at fd.c:810 810 { 814 fname = filepath(fileName); filepath (filename=0x9aa7eb0 "/usr/pgsql/sev/global/16646") at fd.c:688 688 if (!is_absolute_path(filename)) 684 { 688 if (!is_absolute_path(filename)) is_absolute_path (filename=0x9aa7eb0 "/usr/pgsql/sev/global/16646") at path.c:12 12 return filename[0] == '/' 20 } filepath (filename=0x9aa7eb0 "/usr/pgsql/sev/global/16646") at fd.c:694 694 buf = pstrdup(filename); MemoryContextStrdup (context=0x9a8cd38, string=0x9aa7eb0 "/usr/pgsql/sev/global/16646") at mcxt.c:623 623 Size len = strlen(string) + 1; 625 nstr = (char *) MemoryContextAlloc(context, len); MemoryContextAlloc (context=0x9a8cd38, size=28) at mcxt.c:478 478 { 481 if (!AllocSizeIsValid(size)) 478 { 481 if (!AllocSizeIsValid(size)) 485 return (*context->methods->alloc) (context, size); 486 } MemoryContextAlloc (context=0x9a8cd38, size=162168496) at mcxt.c:485 485 return (*context->methods->alloc) (context, size); AllocSetAlloc (context=0x9a8cd38, size=28) at aset.c:476 476 { 491 if (size > ALLOC_CHUNK_LIMIT) 261 if (size > 0) 259 int idx = 0; 261 if (size > 0) 263 size = (size - 1) >> ALLOC_MINBITS; 267 size >>= 1; 266 idx++; 267 size >>= 1; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 543 priorfree = NULL; 544 for (chunk = set->freelist[fidx]; chunk; chunk = (AllocChunk) chunk->aset) 578 chunk_size = 1 << (fidx + ALLOC_MINBITS); 585 if ((block = set->blocks) != NULL) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 587 Size availspace = block->endptr - block->freeptr; 589 if (availspace < (chunk_size + ALLOC_CHUNKHDRSZ)) 729 chunk = (AllocChunk) (block->freeptr); 731 block->freeptr += (chunk_size + ALLOC_CHUNKHDRSZ); 734 chunk->aset = (void *) set; 735 chunk->size = chunk_size; 745 } 744 return AllocChunkGetPointer(chunk); 745 } MemoryContextStrdup (context=0x9a8cd38, string=) at mcxt.c:627 627 memcpy(nstr, string, len); 625 nstr = (char *) MemoryContextAlloc(context, len); 627 memcpy(nstr, string, len); 630 } filepath (filename=0x9aa7eb0 "/usr/pgsql/sev/global/16646") at fd.c:701 701 } 694 buf = pstrdup(filename); 701 } FileNameOpenFile (fileName=0x9aa7f38 "/usr/pgsql/sev/global/16646", fileFlags=2, fileMode=384) at fd.c:815 815 fd = fileNameOpenFile(fname, fileFlags, fileMode); 814 fname = filepath(fileName); 815 fd = fileNameOpenFile(fname, fileFlags, fileMode); fileNameOpenFile (fileName=0x9aa7f38 "/usr/pgsql/sev/global/16646", fileFlags=2, fileMode=384) at fd.c:766 766 fnamecopy = strdup(fileName); 755 { 766 fnamecopy = strdup(fileName); 767 if (fnamecopy == NULL) 766 fnamecopy = strdup(fileName); 767 if (fnamecopy == NULL) 585 if (SizeVfdCache == 0) 605 if (VfdCache[0].nextFree == 0) 646 file = VfdCache[0].nextFree; 648 VfdCache[0].nextFree = VfdCache[file].nextFree; 773 vfdP = &VfdCache[file]; 778 break; 781 vfdP->fd = BasicOpenFile(fileName, fileFlags, fileMode); Program received signal SIGSEGV, Segmentation fault. FileClose (file=162253456) at fd.c:912 912 if (!FileIsNotOpen(file))